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
33021264_c0	33021264	haskell	0	Title: Call by name vs Call by value in Haskell Problem title: Call by name vs Call by value in Haskell Tags: haskell Problem: Call by name vs Call by value in Haskell Call-By-Value: "first second third" 7 Call-By-Name: "second second third" 7 Lazy Evaluation: "second third" 7 Is this case we will get three different r...	Call by name vs Call by value in Haskell Call by name vs Call by value in Haskell haskell Debug.Trace Call Haskell Call-By-Value Call-By-Name Lazy Evaluation Call by name vs Call by value in Haskell If call by value and call by name works, does both of the them delivers the same result? For example: Is this case we wil...	[ 0.0162353515625, 0.0064697265625, 0.0208740234375, 0.041748046875, 0.00811767578125, 0.0162353515625, 0.008056640625, -0.00421142578125, 0.005035400390625, -0.00689697265625, -0.0096435546875, 0.004241943359375, -0.00506591796875, -0.00101470947265625, 0.01287841796875, -0.017211914062...	[ 26265, 390, 9351, 20209, 34292, 23, 20625, 142508, 1556, 262, 85779, 28542, 75358, 856, 50770, 163612, 239, 3285, 151228, 4263, 11782, 136, 43240, 14602, 15044, 111, 2856, 75060, 5701, 16750, 27781, 2071, 903, 7225, 642, 1221, 2046, 17262, ...	[ 0.209228515625, 0.217529296875, 0.2191162109375, 0.181640625, 0.283447265625, 0.046142578125, 0.1575927734375, 0.2587890625, 0.143310546875, 0.05712890625, 0.19580078125, 0.10650634765625, 0.177490234375, 0.1331787109375, 0.1397705078125, 0.1724853515625, 0.107421875, 0.16674804687...	embed
34162708_c0	34162708	haskell	0	Title: How do I get symbolic square root and logarithm functions in SBV? Problem title: How do I get symbolic square root and logarithm functions in SBV? Tags: haskell, symbolic-math, proof, sbv Problem: How do I get symbolic square root and logarithm functions in SBV? The only solution I can find is to do a square roo...	How do I get symbolic square root and logarithm functions in SBV? How do I get symbolic square root and logarithm functions in SBV? haskell symbolic-math proof sbv How SBV How do I get symbolic square root and logarithm functions in SBV? The only solution I can find is to do a square root approximation, but this doesn'...	[ 0.0078125, 0.0130615234375, 0.0040283203125, 0.0152587890625, 0.009765625, 0.017822265625, -0.00811767578125, 0.01287841796875, 0.000301361083984375, 0.00726318359375, -0.005615234375, 0.003326416015625, -0.00179290771484375, -0.00848388671875, -0.009765625, -0.01043701171875, -0.016...	[ 11249, 2046, 128201, 238, 108047, 74855, 136, 459, 8962, 39, 32354, 23, 159, 77394, 54, 1970, 1556, 142508, 125458, 98869, 91, 275, 334, 87, 6, 4734, 29806, 7413, 35707, 53950, 18, 4488, 26582, 4527, 502, 6496 ]	[ 0.06329345703125, 0.121826171875, 0.240234375, 0.089599609375, 0.1334228515625, 0.1986083984375, 0.10205078125, 0.069580078125, 0.1485595703125, 0.07666015625, 0.193115234375, 0.0645751953125, 0.07977294921875, 0.25390625, 0.0318603515625, 0.0521240234375, 0.068359375, 0.1774902343...	embed
48911040_c0	48911040	haskell	0	Title: Where to start with "Couldn't match type MyId with MyId" Problem title: Where to start with "Couldn't match type MyId with MyId" Tags: ghc, haskell-stack, haskell Problem: Where to start with "Couldn't match type MyId with MyId" Code signals: Where, Couldn, MyId, Spec.hs:785:11, my-...	Where to start with "Couldn't match type MyId with MyId" Where to start with "Couldn't match type MyId with MyId" ghc haskell-stack haskell Where Couldn MyId Spec.hs:785:11 my-model-0.0.0:Types.Ids.MyId Types.Ids my-model-0.0.0 Expected UserId Actual f3ba11fc016d stack.yaml Where to start ...	[ -0.006378173828125, -0.0125732421875, -0.00970458984375, -0.0022125244140625, -0.016845703125, 0.002349853515625, -0.004119873046875, -0.0030670166015625, 0.01251220703125, -0.015869140625, 0.002685546875, -0.0098876953125, 0.006011962890625, 0.0027313232421875, 0.014404296875, -0.0038...	[ 78662, 4034, 678, 10625, 52366, 19, 3768, 18, 14858, 10644, 2646, 568, 71, 31380, 238, 1556, 142508, 590, 2594, 191147, 24990, 127, 164814, 19993, 51734, 23320, 99929, 196707, 31852, 60457, 759, 60075, 53400, 100582, 1662, 169887, 177261, 145...	[ 0.036895751953125, 0.1129150390625, 0.1435546875, 0.060546875, 0.12890625, 0.050933837890625, 0.0858154296875, 0.1297607421875, 0.224853515625, 0.2247314453125, 0.180908203125, 0.172607421875, 0.16796875, 0.0889892578125, 0.0748291015625, 0.08489990234375, 0.1845703125, 0.067626953...	embed
59337355_c0	59337355	haskell	0	Title: How could I make a list in Haskell by prime index? Problem title: How could I make a list in Haskell by prime index? Tags: haskell Problem: How could I make a list in Haskell by prime index? How could I make a list where I get every number/letter which has a prime index number? primeIndex :: [a] -> [a] primeInde...	How could I make a list in Haskell by prime index? How could I make a list in Haskell by prime index? haskell How Haskell How could I make a list in Haskell by prime index? How could I make a list where I get every number/letter which has a prime index number?	[ -0.0166015625, 0.0184326171875, 0.0128173828125, 0.0174560546875, 0.019775390625, -0.0032958984375, 0.01116943359375, -0.0234375, 0.0166015625, -0.0054931640625, 0.004364013671875, -0.0286865234375, -0.01055908203125, 0.0255126953125, -0.0185546875, -0.00958251953125, 0.0162353515625...	[ 11249, 5809, 3249, 5303, 20625, 142508, 390, 20809, 63262, 23, 1556, 87, 10, 2046, 11907, 14012, 63049 ]	[ 0.072265625, 0.087890625, 0.0850830078125, 0.209228515625, 0.1507568359375, 0.24169921875, 0.088623046875, 0.1986083984375, 0.20947265625, 0.0487060546875, 0.1226806640625, 0.019256591796875, 0.012786865234375, 0.0399169921875, 0.09210205078125, 0.1175537109375, 0.133056640625 ]	embed
5156735_c0	5156735	haskell	0	Title: Compare the head of a haskell string? Problem title: Compare the head of a haskell string? Tags: haskell Problem: Compare the head of a haskell string? Struggling to learn Haskell, how does one take the head of a string and compare it with the next character untill it finds a character thats note true? In pseudo...	Compare the head of a haskell string? Compare the head of a haskell string? haskell Compare Compare the head of a haskell string? Struggling to learn Haskell, how does one take the head of a string and compare it with the next character untill it finds a character thats note true? In pseudo code I'm trying to: while x ...	[ 0.0064697265625, -0.00830078125, -0.006988525390625, 0.033203125, 0.0091552734375, 0.01422119140625, 0.01055908203125, -0.0068359375, 0.0206298828125, -0.00244140625, 0.01043701171875, 0.0238037109375, 0.0059814453125, 0.002227783203125, -0.01171875, -0.017822265625, 0.02001953125, ...	[ 113307, 13, 10336, 111, 1556, 142508, 79315, 70, 63667, 9815, 30698, 20625, 3642, 14602, 5646, 69101, 11737, 62816, 30394, 7413, 20537, 29568, 74189, 18151, 31577, 12960, 1022, 69112, 86, 29062, 21441, 3525, 5303, 176377 ]	[ 0.203369140625, 0.062744140625, 0.2022705078125, 0.049468994140625, 0.131591796875, 0.2091064453125, 0.207763671875, 0.006072998046875, 0.0010986328125, 0.00537109375, 0.06903076171875, 0.10418701171875, 0.030120849609375, 0.00616455078125, 0.055145263671875, 0.199462890625, 0.089355...	embed
76216662_c0	76216662	haskell	0	Title: Conditional compilation for macOS Problem title: Conditional compilation for macOS Tags: haskell, macos, preprocessor Problem: Conditional compilation for macOS Using {-# LANGUAGE CPP #-} , is there a preprocessor define I can #ifdef to check whether current compilation is for macOS? I tried __APPLE__ and others...	Conditional compilation for macOS Conditional compilation for macOS haskell macos preprocessor Conditional LANGUAGE CPP __APPLE__ Conditional compilation for macOS Using {-# LANGUAGE CPP #-} , is there a preprocessor define I can #ifdef to check whether current compilation is for macOS? I tried __APPLE__ and others as ...	[ -0.00201416015625, 0.010498046875, 0.00421142578125, 0.01806640625, 0.01953125, 0.01708984375, 0.0167236328125, 0.01312255859375, -0.0007781982421875, 0.0184326171875, -0.0208740234375, -0.01373291015625, -0.0016021728515625, -0.0098876953125, 0.006591796875, 0.016357421875, -0.01531...	[ 46347, 43315, 98352, 1363, 100, 19138, 7285, 1556, 142508, 291, 7840, 479, 63923, 3358, 98064, 313, 17487, 40680, 15300, 345, 9, 4904, 468, 2685, 748, 61924, 831, 3190, 112, 420, 47, 12765, 36766, 43581, 83, 35166, 7413 ]	[ 0.2257080078125, 0.181396484375, 0.21826171875, 0.110595703125, 0.1402587890625, 0.1741943359375, 0.20947265625, 0.1175537109375, 0.20458984375, 0.05633544921875, 0.10272216796875, 0.1639404296875, 0.1771240234375, 0.0474853515625, 0.127197265625, 0.06634521484375, 0.250732421875, ...	embed
45537953_c0	45537953	haskell	0	Title: How many args does runState in haskell have Problem title: How many args does runState in haskell have Tags: haskell Problem: How many args does runState in haskell have I misread the documentation. Consider runState as defined in mtl . s -> (a, s) :: State s a Does what look like two arguments for runState have...	How many args does runState in haskell have How many args does runState in haskell have haskell How State Identity StateT How many args does runState in haskell have I misread the documentation. Consider runState as defined in mtl . s -> (a, s) :: State s a Does what look like two arguments for runState have something ...	[ -0.00067138671875, -0.00701904296875, -0.014404296875, 0.01336669921875, 0.00506591796875, 0.0234375, -0.0169677734375, -0.004974365234375, 0.006103515625, -0.0220947265625, 0.017578125, 0.001739501953125, -0.01287841796875, 0.012939453125, -0.0206298828125, -0.0004138946533203125, 0...	[ 11249, 5941, 79459, 7, 14602, 11675, 135206, 13, 23, 1556, 142508, 765, 22836, 71257, 2481, 618, 1239, 39116, 209806, 61924, 18, 141, 5, 91, 33079, 11, 1984, 10, 6713, 1884, 6626, 10750, 136 ]	[ 0.057464599609375, 0.1265869140625, 0.2276611328125, 0.155029296875, 0.0677490234375, 0.178955078125, 0.239013671875, 0.19287109375, 0.076416015625, 0.156005859375, 0.2227783203125, 0.0963134765625, 0.1915283203125, 0.1866455078125, 0.0789794921875, 0.11962890625, 0.046356201171875, ...	embed
46990446_c0	46990446	haskell	0	Title: x in list for which f(x) is maximum Problem title: x in list for which f(x) is maximum Tags: search, haskell, max Problem: x in list for which f(x) is maximum I am trying to find an x in a list for which score x has the maximum value. I tried snd (maximum [(score x, x) \| x <- codes]) which works, but I was wonde...	x in list for which f(x) is maximum x in list for which f(x) is maximum search haskell max x in list for which f(x) is maximum I am trying to find an x in a list for which score x has the maximum value. I tried snd (maximum [(score x, x) \| x <- codes]) which works, but I was wondering whether there were a faster way to...	[ 0.00151824951171875, -0.01165771484375, 0.02685546875, -0.005645751953125, 0.007293701171875, -0.0027313232421875, 0.00927734375, 0.0069580078125, 0.00909423828125, -0.031005859375, 0.0220947265625, 0.0047607421875, -0.0057373046875, -0.0137939453125, 0.009033203125, -0.01953125, -0....	[ 1022, 23, 5303, 100, 3129, 1238, 132, 425, 83, 38132, 33938, 1556, 142508, 18389, 31577, 47, 7413, 47763, 70, 34292, 37842, 2208, 192, 53950, 316, 30854, 18151, 16, 43240, 149016, 4271, 56, 3917, 903, 15490, 3082, 32354 ]	[ 0.1241455078125, 0.0831298828125, 0.1988525390625, 0.1246337890625, 0.079833984375, 0.174072265625, 0.038177490234375, 0.12451171875, 0.09637451171875, 0.2230224609375, 0.145263671875, 0.13525390625, 0.1728515625, 0.1817626953125, 0.0543212890625, 0.013671875, 0.0953369140625, 0.16...	embed
60549478_c0	60549478	haskell	0	Title: Lambda in Haskell Problem title: Lambda in Haskell Tags: haskell Problem: Lambda in Haskell Can someone explain to me how lambda works in Haskell? For eg. add' = \x -> (\y -> x+y) or foldl (\x _ -> x+1) 0 [1,2,3] == 3 I know what the results are and what the functions do, but I don't understand why do we need la...	Lambda in Haskell Lambda in Haskell haskell Lambda Haskell Lambda in Haskell Can someone explain to me how lambda works in Haskell? For eg. add' = \x -> (\y -> x+y) or foldl (\x _ -> x+1) 0 [1,2,3] == 3 I know what the results are and what the functions do, but I don't understand why do we need lambda expression or wha...	[ 0.00848388671875, 0.0201416015625, 0.0135498046875, -0.00116729736328125, 0.011474609375, 0.00811767578125, 0.0020751953125, 0.00106048583984375, 0.000640869140625, -0.0286865234375, 0.006256103515625, -0.048828125, -0.0093994140625, 0.00848388671875, -0.00909423828125, -0.012817382812...	[ 122930, 85, 23, 20625, 142508, 1556, 22008, 73342, 163, 3642, 21, 6492, 43240, 30046, 15190, 25, 2203, 425, 33079, 53, 1328, 18344, 20469, 101, 21748, 757, 155761, 69112, 138, 3714, 50339, 2367, 32354, 54, 28219, 15400, 642, 3871, 125195, ...	[ 0.212890625, 0.2353515625, 0.0916748046875, 0.150146484375, 0.282958984375, 0.113037109375, 0.006683349609375, 0.12060546875, 0.00714111328125, 0.1072998046875, 0.1278076171875, 0.2423095703125, 0.1810302734375, 0.011444091796875, 0.1839599609375, 0.1077880859375, 0.015289306640625, ...	embed
53596801_c0	53596801	haskell	0	Title: Coercing function using type families leads to constraint error Problem title: Coercing function using type families leads to constraint error Tags: haskell Problem: Coercing function using type families leads to constraint error Code signals: type, a, the, myfunDef, Coercing, MyClass, Fam, Triv, Embed, Embeddab...	Coercing function using type families leads to constraint error Coercing function using type families leads to constraint error haskell type a the myfunDef Coercing MyClass Fam Triv Embed Embeddable MyNewtype MyConstructor MyFam Coercible Could Lib.hs:22:1-75 Relevant Lib.hs:23:1 Bool BoolFam Coercing function using ty...	[ -0.005767822265625, -0.04052734375, -0.01611328125, 0.00384521484375, 0.01611328125, -0.000568389892578125, -0.0361328125, -0.005462646484375, 0.0196533203125, -0.010498046875, -0.01416015625, -0.0235595703125, 0.012451171875, 0.0220947265625, 0.0078125, -0.01239013671875, -0.0001974...	[ 1311, 56, 21896, 32354, 17368, 10644, 87143, 37105, 158, 2816, 4288, 18499, 1556, 142508, 759, 16498, 187423, 2646, 140803, 52917, 4699, 334, 2775, 13482, 46568, 50986, 36716, 919, 302, 318, 2661, 191147, 43278, 127, 19721, 6873, 133, 2460, ...	[ 0.084228515625, 0.1898193359375, 0.1405029296875, 0.177490234375, 0.090087890625, 0.24658203125, 0.2025146484375, 0.1207275390625, 0.0787353515625, 0.20751953125, 0.1300048828125, 0.214599609375, 0.130859375, 0.2216796875, 0.0975341796875, 0.11279296875, 0.2080078125, 0.12060546875...	embed
27054285_c0	27054285	haskell	0	Title: Haskell if then else with "two statements" Problem title: Haskell if then else with "two statements" Tags: haskell Problem: Haskell if then else with "two statements" How can I do this: if n > 0 then putStrLn "Hello" putStrLn "Anything" I want to have "two statements" in one condition but I k...	Haskell if then else with "two statements" Haskell if then else with "two statements" haskell Haskell Hello Anything Haskell if then else with "two statements" How can I do this: I want to have "two statements" in one condition but I keep getting compilation errors I tried using semi-colon with no l...	[ 0.005279541015625, 0.01385498046875, 0.0008697509765625, 0.034423828125, 0.0262451171875, 0.0206298828125, 0.0103759765625, 0.008544921875, 0.007415771484375, -0.00927734375, 0.002227783203125, -0.030029296875, -0.008056640625, 0.01611328125, -0.00506591796875, -0.004852294921875, 0....	[ 20625, 142508, 2174, 7068, 37076, 678, 41502, 55547, 63805, 7, 1556, 35378, 28541, 64113, 831, 54, 903, 3444, 765, 23, 1632, 35431, 1284, 13695, 98352, 18499, 36137, 22796, 19, 110, 84434 ]	[ 0.150146484375, 0.2098388671875, 0.184814453125, 0.1671142578125, 0.2052001953125, 0.07861328125, 0.011199951171875, 0.22705078125, 0.251220703125, 0.099365234375, 0.1475830078125, 0.1060791015625, 0.027130126953125, 0.0816650390625, 0.03668212890625, 0.0545654296875, 0.069091796875,...	embed
29351873_c0	29351873	haskell	0	Title: Combined type = one, the other, or both? Problem title: Combined type = one, the other, or both? Tags: types, haskell, algebraic-data-types Problem: Combined type = one, the other, or both? I'm wondering if this is possible in Haskell: type DateTime = Date \| Time \| Date :+ Time ...so that it can be either a spec...	Combined type = one, the other, or both? Combined type = one, the other, or both? types haskell algebraic-data-types Combined DateTime Date Time Combined type = one, the other, or both? I'm wondering if this is possible in Haskell: ...so that it can be either a specific date, a specific time or a complex value made up ...	[ -0.0012969970703125, 0.01483154296875, -0.0009765625, 0.03466796875, -0.0234375, -0.00653076171875, -0.0162353515625, 0.00909423828125, 0.00927734375, 0.005828857421875, -0.0020904541015625, 0.013916015625, 0.0233154296875, 0.0198974609375, -0.035888671875, 0.0147705078125, 0.0030822...	[ 106935, 14534, 10644, 1632, 3789, 15044, 2203, 52895, 1556, 142508, 429, 2844, 10135, 50986, 25512, 70059, 19055, 149016, 2174, 903, 83, 7722, 23, 20625, 991, 831, 186, 29458, 5622, 1733, 27140, 34292, 1257 ]	[ 0.258544921875, 0.1888427734375, 0.262939453125, 0.08123779296875, 0.119140625, 0.1220703125, 0.05029296875, 0.1881103515625, 0.1341552734375, 0.26318359375, 0.03631591796875, 0.031005859375, 0.0948486328125, 0.2008056640625, 0.1353759765625, 0.1708984375, 0.1993408203125, 0.046966...	embed
44190079_c3	44190079	haskell	3	, base-4.9.1.0, binary-0.8.3.0, bytestring-0.10.8.1, deepseq-1.4.2.0, random-1.1-9tceXaeYIMZ4JrKq20Egog, split-0.2.3.1-FWyXC6nhV0H3AfM8IzrEFk, storable-complex-0.2.2-G9QzpmZTKvgKKVagrcRWdL, vector-0.11.0.0-HhutbadagxHIONIkSRJEug, OpenBLAS-v0.2.19-Win64-int32, Users, Yotam, AppData, Local, Programs, msys2-20150512, ming...	, base-4.9.1.0, binary-0.8.3.0, bytestring-0.10.8.1, deepseq-1.4.2.0, random-1.1-9tceXaeYIMZ4JrKq20Egog, split-0.2.3.1-FWyXC6nhV0H3AfM8IzrEFk, storable-complex-0.2.2-G9QzpmZTKvgKKVagrcRWdL, vector-0.11.0.0-HhutbadagxHIONIkSRJEug, OpenBLAS-v0.2.19-Win64-int32, Users, Yotam, AppData, Local, Programs, msys2-20150512, ming...	[ 0.01318359375, 0.003662109375, -0.0133056640625, -0.005584716796875, 0.01129150390625, -0.002655029296875, -0.009033203125, -0.0125732421875, 0.00286865234375, 0.0169677734375, -0.0167236328125, -0.0159912109375, -0.0091552734375, 0.004150390625, -0.0003108978271484375, -0.012268066406...	[ 6, 4, 3647, 9, 156982, 5, 102107, 2394, 6635, 132208, 132265, 390, 67, 91693, 23320, 10179, 206730, 53894, 184, 864, 91977, 73011, 96759, 92134, 15205, 1549, 65450, 133684, 97109, 53, 3082, 2886, 44974, 70147, 238, 866, 173, 18770, 14556, ...	[ 0.0966796875, 0.081298828125, 0.2218017578125, 0.1033935546875, 0.2205810546875, 0.110595703125, 0.182373046875, 0.1402587890625, 0.145263671875, 0.120361328125, 0.1392822265625, 0.0570068359375, 0.1202392578125, 0.1776123046875, 0.0364990234375, 0.051483154296875, 0.116943359375, ...	embed
49590571_c0	49590571	haskell	0	Title: How to create a function that graphs objects in haskell in Haskell Problem title: How to create a function that graphs objects in haskell in Haskell Tags: pattern-matching, haskell, codeworld Problem: How to create a function that graphs objects in haskell in Haskell How to Format ► put returns between paragraph...	How to create a function that graphs objects in haskell in Haskell How to create a function that graphs objects in haskell in Haskell pattern-matching haskell codeworld How Haskell How to create a function that graphs objects in haskell in Haskell How to Format ► put returns between paragraphs ► for linebreak add 2 spa...	[ -0.0025482177734375, 0.0020294189453125, -0.004608154296875, 0.0072021484375, 0.002197265625, 0.003997802734375, -0.0225830078125, -0.004974365234375, 0.00909423828125, 0.00787353515625, 0.01068115234375, -0.0458984375, 0.005523681640625, -0.01153564453125, 0.004241943359375, 0.0026550...	[ 11249, 28282, 32354, 450, 41382, 7, 36746, 1556, 142508, 20625, 23, 103510, 98753, 32554, 60972, 3884, 30646, 17721, 151268, 13315, 70751, 15190, 116, 32628, 3564, 85530, 238, 65665, 18597, 18, 18151, 390, 201 ]	[ 0.04388427734375, 0.161376953125, 0.2127685546875, 0.03009033203125, 0.2587890625, 0.06439208984375, 0.186279296875, 0.1470947265625, 0.220458984375, 0.137939453125, 0.0206146240234375, 0.1422119140625, 0.141357421875, 0.0775146484375, 0.167236328125, 0.035430908203125, 0.18737792968...	embed
54233506_c0	54233506	haskell	0	Title: Read single field of object using Aeson without writing a FromJSON instance Problem title: Read single field of object using Aeson without writing a FromJSON instance Tags: haskell, aeson Problem: Read single field of object using Aeson without writing a FromJSON instance How do I read a single field (by name) f...	Read single field of object using Aeson without writing a FromJSON instance Read single field of object using Aeson without writing a FromJSON instance haskell aeson Aeson Read FromJSON Read single field of object using Aeson without writing a FromJSON instance How do I read a single field (by name) from a JSON object ...	[ -0.01055908203125, -0.006927490234375, -0.0057373046875, 0.0303955078125, -0.0111083984375, -0.007049560546875, -0.00457763671875, -0.00323486328125, -0.006927490234375, -0.01806640625, 0.01519775390625, 0.005035400390625, -0.0028533935546875, -0.00616455078125, 0.0118408203125, -0.035...	[ 4764, 11001, 44457, 36746, 17368, 62, 90, 191, 15490, 32562, 28090, 1375, 58627, 110527, 111, 1556, 142508, 10, 12301, 9351, 16, 1295, 821, 10644, 18507 ]	[ 0.1971435546875, 0.20947265625, 0.259765625, 0.1810302734375, 0.05694580078125, 0.1251220703125, 0.144287109375, 0.2098388671875, 0.11181640625, 0.13671875, 0.1766357421875, 0.1156005859375, 0.2200927734375, 0.165771484375, 0.008026123046875, 0.1077880859375, 0.1795654296875, 0.075...	embed
12508727_c0	12508727	haskell	0	Title: how to assign values to a list in haskell Problem title: how to assign values to a list in haskell Tags: haskell Problem: how to assign values to a list in haskell I have a data type: data Numbers = Numbers {a::Int, b::Int} How can I construct [Numbers] in order to get the same effect as [[a,b] \| a <- [1,2], b <...	how to assign values to a list in haskell how to assign values to a list in haskell haskell Numbers a::Int b::Int how to assign values to a list in haskell I have a data type: How can I construct [Numbers] in order to get the same effect as so the result will be similar to [[1,2],[2,1]]	[ -0.000659942626953125, -0.005584716796875, 0.002044677734375, -0.009765625, -0.0115966796875, 0.0025482177734375, -0.01171875, 0.0006866455078125, 0.0167236328125, 0.0218505859375, 0.01019287109375, -0.0054931640625, 0.031494140625, -0.01361083984375, -0.0262451171875, -0.0054321289062...	[ 3642, 47, 95486, 142424, 10, 5303, 23, 1556, 142508, 103332, 4153, 18, 876, 2053, 10644, 11249, 831, 64549, 18444, 26278, 5701, 21543, 16750, 21373, 133063, 304, 76172 ]	[ 0.0806884765625, 0.1370849609375, 0.27880859375, 0.2454833984375, 0.06646728515625, 0.2314453125, 0.063232421875, 0.1832275390625, 0.2408447265625, 0.2041015625, 0.052001953125, 0.09423828125, 0.07049560546875, 0.08056640625, 0.1090087890625, 0.029083251953125, 0.018890380859375, 0...	embed
18598365_c0	18598365	haskell	0	Title: equal sign with haskell literals Problem title: equal sign with haskell literals Tags: literals, haskell, equality Problem: equal sign with haskell literals What exactly happens in GHCi when I load a file with a line that says: 0=1 ? I was expecting that this would give an error but it doesn't seem to do anythin...	equal sign with haskell literals equal sign with haskell literals literals haskell equality equal sign with haskell literals What exactly happens in GHCi when I load a file with a line that says: 0=1 ? I was expecting that this would give an error but it doesn't seem to do anything at all. Does it do anything? I assume...	[ 0.01953125, 0.004730224609375, 0.0019989013671875, -0.00531005859375, -0.00732421875, -0.002105712890625, 0.00921630859375, -0.00787353515625, -0.0091552734375, -0.00390625, -0.0064697265625, -0.000010609626770019531, 0.015869140625, -0.0111083984375, 0.0030517578125, 0.01434326171875,...	[ 105950, 24092, 678, 1556, 142508, 15659, 16765, 28, 161789, 66161, 96276, 23, 527, 73265, 14, 3229, 72367, 11435, 13315, 450, 17378, 757, 33000, 214, 18499, 48903, 54, 23937, 41591, 183234, 54433, 1974, 4865 ]	[ 0.1893310546875, 0.2109375, 0.114501953125, 0.1446533203125, 0.2127685546875, 0.135498046875, 0.107177734375, 0.022125244140625, 0.07952880859375, 0.0211181640625, 0.05059814453125, 0.0194549560546875, 0.0872802734375, 0.1141357421875, 0.1859130859375, 0.011810302734375, 0.1756591796...	embed
38538207_c0	38538207	haskell	0	Title: Is '$' a function in haskell? Problem title: Is '$' a function in haskell? Tags: syntax, dollar-sign, haskell Problem: Is '$' a function in haskell? I am quite confused about ($) in haskell. when I type :t ($) in ghci. I will get :($) :: (a -> b) -> a -> b but, when I type :t ($ 3) I will get...	Is '$' a function in haskell? Is '$' a function in haskell? syntax dollar-sign haskell Num Is '$' a function in haskell? I am quite confused about ($) in haskell. when I type in ghci. I will get but, when I type I will get so, why ($) accept the second argument without any error？	[ 0.006439208984375, -0.006072998046875, 0.018798828125, -0.00927734375, -0.00897216796875, 0.0181884765625, -0.0015106201171875, 0.0137939453125, 0.005401611328125, -0.0074462890625, -0.0084228515625, -0.0264892578125, -0.006134033203125, -0.01708984375, -0.01434326171875, 0.01055908203...	[ 2071, 54764, 3768, 74, 4369, 425, 10, 32354, 23, 1556, 142508, 6002, 86531, 15437, 31304, 52782, 25, 32233, 55681, 5281, 1672, 16, 10644, 31380, 318, 2046, 1221, 221, 15400, 26946, 17932, 10750, 15490, 18499 ]	[ 0.060455322265625, 0.07318115234375, 0.1905517578125, 0.105712890625, 0.264892578125, 0.0118408203125, 0.0987548828125, 0.25537109375, 0.1107177734375, 0.1451416015625, 0.26806640625, 0.049102783203125, 0.0107421875, 0.1767578125, 0.1724853515625, 0.162841796875, 0.0237884521484375, ...	embed
20593330_c0	20593330	haskell	0	Title: Operator priority in haskell Problem title: Operator priority in haskell Tags: haskell Problem: Operator priority in haskell I have a function g1 = flip map . (flip take $ iterate (+1) 1) I am wondering why i can't write g1 = flip map . $ flip take $ iterate (+1) 1 ? I know that $ has lowest priority but don't u...	Operator priority in haskell Operator priority in haskell haskell Operator Operator priority in haskell I have a function g1 = flip map . (flip take $ iterate (+1) 1) I am wondering why i can't write g1 = flip map . $ flip take $ iterate (+1) 1 ? I know that $ has lowest priority but don't understand why we can have $ ...	[ 0.0203857421875, 0.0177001953125, 0.00933837890625, -0.004486083984375, -0.01055908203125, -0.00628662109375, 0.007568359375, 0.00518798828125, -0.017822265625, 0.0012054443359375, -0.0106201171875, 0.0244140625, 0.026611328125, -0.0118408203125, -0.01434326171875, -0.00872802734375, ...	[ 150922, 25343, 53, 23, 1556, 142508, 32354, 706, 418, 147505, 22288, 420, 21392, 5646, 3650, 8560, 67, 22183, 17727, 4879, 149016, 15400, 831, 18, 33022, 6, 17, 106, 459, 25617, 28219, 765, 959, 7103, 20633 ]	[ 0.289306640625, 0.2271728515625, 0.1279296875, 0.03668212890625, 0.134765625, 0.2449951171875, 0.157958984375, 0.1005859375, 0.12255859375, 0.17431640625, 0.173828125, 0.0152435302734375, 0.1383056640625, 0.175048828125, 0.1358642578125, 0.1964111328125, 0.0738525390625, 0.12854003...	embed
53191477_c1	53191477	haskell	1	-> a0 (bound at C:\\Users\Ellis\OneDrive\Year 2\CS-205 Declarative Programming\CW1\Haskell-Cw1\Coursework1.hs:13:26) \| 14 \| in (0.001 * area) + ((fromIntegral y)0.002 area) * 1.5 \| I believe my lack of understanding with haskell is what caused this issue Code signals: area, Match, Float, Bool, Couldn, Probable, Rel...	-> a0 (bound at C:\\Users\Ellis\OneDrive\Year 2\CS-205 Declarative Programming\CW1\Haskell-Cw1\Coursework1.hs:13:26) \| 14 \| in (0.001 * area) + ((fromIntegral y)0.002 area) * 1.5 \| I believe my lack of understanding with haskell is what caused this issue Code signals: area, Match, Float, Bool, Couldn, Probable, Rel...	[ 0.0146484375, 0.0004482269287109375, 0.0016937255859375, -0.00213623046875, -0.007080078125, 0.01348876953125, -0.0123291015625, 0.0040283203125, 0.0186767578125, 0.003936767578125, 0.00128936767578125, -0.0037078857421875, -0.019775390625, -0.018798828125, 0.0125732421875, -0.00094604...	[ 33079, 10, 2389, 99091, 99, 313, 12, 13273, 1062, 7, 1314, 647, 19813, 62068, 142994, 69085, 147, 116, 19283, 143422, 98501, 4935, 27958, 129781, 418, 6495, 142508, 434, 474, 184, 18244, 127, 22618, 28194, 58745, 616, 23, 37509, 661, 1612...	[ 0.139404296875, 0.1695556640625, 0.227294921875, 0.240966796875, 0.025238037109375, 0.04046630859375, 0.054931640625, 0.0159912109375, 0.039093017578125, 0.073974609375, 0.08642578125, 0.0692138671875, 0.205078125, 0.1463623046875, 0.2447509765625, 0.044677734375, 0.040374755859375, ...	embed
7435422_c0	7435422	haskell	0	Title: How to return float number with 2 digits after decimal point? Problem title: How to return float number with 2 digits after decimal point? Tags: pretty-print, printf, formatting, haskell, floating-point Problem: How to return float number with 2 digits after decimal point? I have some simple function f :: Float ...	How to return float number with 2 digits after decimal point? How to return float number with 2 digits after decimal point? pretty-print printf formatting haskell floating-point How Float Prelude How to return float number with 2 digits after decimal point? I have some simple function Why not 5.00 ? How can I achieve t...	[ 0.00145721435546875, -0.027099609375, -0.000293731689453125, 0.002410888671875, 0.01611328125, 0.007659912109375, 0.00714111328125, 0.002960205078125, -0.00008296966552734375, 0.0211181640625, 0.0157470703125, -0.031005859375, -0.013671875, 0.0166015625, 0.0078125, 0.01318359375, 0.0...	[ 11249, 47, 30646, 21917, 257, 14012, 678, 116, 153939, 7103, 32380, 2749, 6275, 28875, 35662, 28412, 420, 9384, 1556, 142508, 26518, 38496, 38699, 1914, 822, 112, 8781, 32354, 44084, 959, 82683, 69307 ]	[ 0.051727294921875, 0.0562744140625, 0.1820068359375, 0.1925048828125, 0.11669921875, 0.1466064453125, 0.08587646484375, 0.13134765625, 0.161865234375, 0.1072998046875, 0.155029296875, 0.1180419921875, 0.1142578125, 0.110107421875, 0.1220703125, 0.052154541015625, 0.06475830078125, ...	embed
40480861_c0	40480861	haskell	0	Title: Defining a length function using tail Problem title: Defining a length function using tail Tags: list, haskell Problem: Defining a length function using tail I'm pretty new to Haskell and I am trying to define my own length function as follows: lengthz :: [a] -> a lengthz [] = 0 lengthz n = 1 + length (tail n) W...	Defining a length function using tail Defining a length function using tail list haskell tail Defining Defining a length function using tail I'm pretty new to Haskell and I am trying to define my own length function as follows: lengthz :: [a] -> a lengthz [] = 0 lengthz n = 1 + length (tail n) Why does this not compile...	[ 0.01611328125, 0.029296875, 0.0027008056640625, 0.0223388671875, 0.00909423828125, -0.005126953125, 0.0062255859375, 0.0045166015625, 0.0233154296875, -0.03125, 0.0186767578125, -0.0150146484375, 0.0230712890625, 0.0162353515625, 0.0250244140625, 0.0086669921875, 0.0157470703125, 0...	[ 88606, 140909, 32354, 17368, 46741, 449, 10, 5303, 1556, 142508, 28875, 3525, 20625, 31577, 61924, 10002, 28960, 169, 1984, 11, 33079, 2203, 757, 653, 106, 997, 44084, 14602, 959, 9969, 1340, 44691, 62775 ]	[ 0.1865234375, 0.2391357421875, 0.2171630859375, 0.1124267578125, 0.25927734375, 0.0272674560546875, 0.07061767578125, 0.1563720703125, 0.125732421875, 0.2020263671875, 0.019866943359375, 0.043487548828125, 0.116455078125, 0.07220458984375, 0.18603515625, 0.1104736328125, 0.0089721679...	embed
27909759_c0	27909759	haskell	0	Title: Signal to CellRendererModeActivatable Problem title: Signal to CellRendererModeActivatable Tags: gtk2hs, haskell Problem: Signal to CellRendererModeActivatable The CellRenderer of gtk2hs has a property cellMode . If it's set to CellRendererModeActivateble , what signal gets emitted? I can't find one in the docum...	Signal to CellRendererModeActivatable Signal to CellRendererModeActivatable gtk2hs haskell Signal CellRendererModeActivatable CellRenderer CellRendererModeActivateble gtk2hs Signal to CellRendererModeActivatable The CellRenderer of gtk2hs has a property cellMode . If it's set to CellRendererModeActivateble , what signa...	[ -0.00537109375, 0.00061798095703125, 0.0252685546875, 0.01513671875, 0.01202392578125, 0.0111083984375, -0.007171630859375, 0.03271484375, -0.0194091796875, -0.0189208984375, -0.00150299072265625, -0.03125, -0.004547119140625, 0.035400390625, -0.0166015625, -0.0133056640625, 0.004119...	[ 144000, 47, 80743, 1052, 23894, 56, 9083, 112, 164414, 11, 22819, 706, 31472, 304, 127, 1556, 142508, 2182, 2661, 7, 57266, 38750, 4263, 442, 5423, 2367, 26073, 62163, 53225, 3674, 7413, 1632, 209806 ]	[ 0.2091064453125, 0.1151123046875, 0.1690673828125, 0.0946044921875, 0.168701171875, 0.1456298828125, 0.1956787109375, 0.08148193359375, 0.1612548828125, 0.0185546875, 0.1463623046875, 0.0400390625, 0.16943359375, 0.1236572265625, 0.12744140625, 0.118896484375, 0.208740234375, 0.097...	embed
21213103_c0	21213103	haskell	0	Title: Haskell operation "+" what does that mean? Problem title: Haskell operation "+" what does that mean? Tags: haskell, operators Problem: Haskell operation "+" what does that mean? The code as follows: chop [n] lev = [n-1] chop (n:m:xs) lev = n-1:lev +m:xs what does n-1:lev +m:xs mean? I know m:...	Haskell operation "+" what does that mean? Haskell operation "+" what does that mean? haskell operators Haskell n-1 n:m:xs n-1:lev m:xs Haskell operation "+" what does that mean? The code as follows: what does n-1:lev +m:xs mean? I know m:xs is list, how can a list add a int (n-1:lev) ? Thanks you!	[ -0.0216064453125, 0.0002899169921875, 0.025146484375, 0.01312255859375, 0.00750732421875, 0.0172119140625, -0.01409912109375, -0.006561279296875, 0.024658203125, -0.0220947265625, 0.008544921875, -0.03369140625, 0.022705078125, 0.0024261474609375, -0.0179443359375, -0.01092529296875, ...	[ 20625, 142508, 41018, 619, 41502, 1328, 1230, 2367, 14602, 450, 29459, 32, 74, 1556, 39933, 653, 5759, 12, 39, 425, 7, 11150, 347, 18151, 28960, 997, 3714, 83, 5303, 3642, 831, 15190, 10, 23, 18, 19 ]	[ 0.1622314453125, 0.2724609375, 0.2362060546875, 0.0782470703125, 0.0814208984375, 0.26806640625, 0.115478515625, 0.07525634765625, 0.06951904296875, 0.0980224609375, 0.1551513671875, 0.0255279541015625, 0.0302734375, 0.1234130859375, 0.1708984375, 0.0927734375, 0.1728515625, 0.0789...	embed
43438875_c0	43438875	haskell	0	Title: Confusion about StateT, State and MonadState Problem title: Confusion about StateT, State and MonadState Tags: state-monad, haskell Problem: Confusion about StateT, State and MonadState I'm utterly confused between newtype StateT s m a = StateT {runStateT :: s -> m (a, s)} and type State s = StateT s Identity an...	Confusion about StateT, State and MonadState Confusion about StateT, State and MonadState state-monad haskell Confusion StateT State MonadState Identity Monad Confusion about StateT, State and MonadState I'm utterly confused between and and	[ -0.0125732421875, 0.006378173828125, 0.008056640625, 0.001373291015625, 0.011962890625, -0.006500244140625, 0.0031890869140625, -0.005859375, -0.004913330078125, 0.01220703125, 0.00823974609375, 0.0169677734375, -0.010986328125, 0.01300048828125, -0.01141357421875, 0.000425338745117187...	[ 1657, 92105, 1672, 22836, 618, 4, 136, 60331, 71, 135206, 13, 11341, 3796, 712, 1556, 142508, 71257, 2481, 3055, 55681, 5281, 17721 ]	[ 0.0191497802734375, 0.1827392578125, 0.07318115234375, 0.2337646484375, 0.260498046875, 0.042938232421875, 0.0830078125, 0.1654052734375, 0.134765625, 0.24755859375, 0.1317138671875, 0.1822509765625, 0.11334228515625, 0.126708984375, 0.127197265625, 0.2296142578125, 0.1566162109375, ...	embed
64881810_c2	64881810	haskell	2	++ dit morseCode '0' = dah ++ dah ++ dah ++ dah ++ dah morseCode _ = undefined -- Avoid warnings type Table = [(Char, Code)] morseTable :: Table morseTable = [ (c , morseCode c) \| c <- ['A'..'Z']++['0'..'9'] ] The encodeWord Code signals: Data.Maybe, How, Haskell, x:xs, Table, Maybe, Silence, Types, Atom, Beep, Show, ...	++ dit morseCode '0' = dah ++ dah ++ dah ++ dah ++ dah morseCode _ = undefined -- Avoid warnings type Table = [(Char, Code)] morseTable :: Table morseTable = [ (c , morseCode c) \| c <- ['A'..'Z']++['0'..'9'] ] The encodeWord Code signals: Data.Maybe, How, Haskell, x:xs, Table, Maybe, Silence, Types, Atom, Beep, Show, ...	[ 0.00543212890625, -0.017333984375, 0.001190185546875, -0.00579833984375, -0.0029144287109375, 0.01708984375, 0.035400390625, 0.0198974609375, 0.00823974609375, -0.01177978515625, -0.00061798095703125, 0.000621795654296875, 0.007598876953125, 0.0281982421875, -0.021484375, 0.00646972656...	[ 37223, 854, 2993, 184, 114211, 2389, 2203, 6178, 101, 9232, 5983, 84361, 532, 1631, 6977, 10644, 112997, 84068, 28864, 618, 2886, 238, 501, 284, 1511, 5, 1126, 581, 22, 40899, 164805, 26073, 7, 11809, 82419, 372, 11249, 20625, 142508, 102...	[ 0.236083984375, 0.2032470703125, 0.2081298828125, 0.2103271484375, 0.25390625, 0.1539306640625, 0.04486083984375, 0.1307373046875, 0.04376220703125, 0.081787109375, 0.1591796875, 0.15087890625, 0.1285400390625, 0.140869140625, 0.12109375, 0.1456298828125, 0.2147216796875, 0.1080322...	embed
5811842_c0	5811842	haskell	0	Title: multidimensional mutable Vectors: possible? if so, how? Problem title: multidimensional mutable Vectors: possible? if so, how? Tags: multidimensional-array, arrays, haskell Problem: multidimensional mutable Vectors: possible? if so, how? i notice that the generate function is not defined for mutable vectors. i'm...	multidimensional mutable Vectors: possible? if so, how? multidimensional mutable Vectors: possible? if so, how? multidimensional-array arrays haskell Vectors multidimensional mutable Vectors: possible? if so, how? i notice that the generate function is not defined for mutable vectors. i'm wondering if there is another ...	[ 0.00830078125, 0.00433349609375, -0.01129150390625, 0.007476806640625, 0.0167236328125, 0.0111083984375, -0.004547119140625, -0.025634765625, 0.007720947265625, -0.010986328125, -0.01043701171875, -0.00482177734375, 0.00439453125, 0.0174560546875, -0.0220947265625, -0.001922607421875, ...	[ 6024, 157955, 842, 22819, 52884, 22230, 7722, 2174, 3642, 19305, 10298, 4778, 1556, 142508, 221, 60322, 139392, 32354, 959, 61924, 22834 ]	[ 0.135498046875, 0.193603515625, 0.1527099609375, 0.1734619140625, 0.2095947265625, 0.1497802734375, 0.214599609375, 0.058197021484375, 0.0765380859375, 0.047515869140625, 0.07525634765625, 0.01605224609375, 0.13037109375, 0.227783203125, 0.035675048828125, 0.0139923095703125, 0.24499...	embed
35846753_c0	35846753	haskell	0	Title: Why this Haskell expression won't get a result? Problem title: Why this Haskell expression won't get a result? Tags: haskell Problem: Why this Haskell expression won't get a result? I try to run this in GHCi: take 100 [ (a,b,c) \| a <- [1..], b <- [1..], c <- [1..], a^2 + b^2 == c^2, a<b ] I would expec...	Why this Haskell expression won't get a result? Why this Haskell expression won't get a result? haskell Why Haskell Why this Haskell expression won't get a result? I try to run this in GHCi: I would expect it to be calculated because of the lazyness of take, but that's not the case. Why?	[ 0.0185546875, 0.000774383544921875, 0.006378173828125, 0.00262451171875, 0.006805419921875, 0.0111083984375, 0.0020751953125, 0.00064849853515625, 0.0079345703125, -0.006134033203125, 0.004669189453125, -0.00074005126953125, 0.0017242431640625, -0.0020904541015625, -0.0111083984375, -0...	[ 44084, 903, 20625, 142508, 125195, 23742, 3768, 18, 2046, 10, 16750, 1556, 9790, 11675, 527, 73265, 14, 41206, 442, 74481, 3674, 6637, 21, 3285, 7432, 111, 5646, 1284, 450, 959, 7225 ]	[ 0.11572265625, 0.0836181640625, 0.146728515625, 0.257080078125, 0.2193603515625, 0.136474609375, 0.06964111328125, 0.14013671875, 0.09002685546875, 0.06512451171875, 0.1500244140625, 0.1072998046875, 0.011962890625, 0.0472412109375, 0.03387451171875, 0.070556640625, 0.106689453125, ...	embed
22960638_c0	22960638	haskell	0	Title: Convert 2-tuple to 3-tuple Haskell Problem title: Convert 2-tuple to 3-tuple Haskell Tags: haskell, tuples Problem: Convert 2-tuple to 3-tuple Haskell So I have a list of tuples: [(1,2),(2,3),(3,4)] for example. And I perform a calculation on its elements. The result of this should be joined to this tuple, but I...	Convert 2-tuple to 3-tuple Haskell Convert 2-tuple to 3-tuple Haskell haskell tuples Convert Haskell Convert 2-tuple to 3-tuple Haskell So I have a list of tuples: for example. And I perform a calculation on its elements. The result of this should be joined to this tuple, but I don't know how. is the format I'm thinkin...	[ 0.007232666015625, 0.007720947265625, -0.00970458984375, 0.0103759765625, 0.001373291015625, 0.01361083984375, -0.0233154296875, -0.00994873046875, 0.00897216796875, -0.00994873046875, 0.0023651123046875, -0.02197265625, 0.00872802734375, 0.0299072265625, -0.0284423828125, 0.0155639648...	[ 1657, 11549, 4720, 458, 8705, 47, 5691, 20625, 142508, 1556, 370, 99726, 5303, 27781, 51339, 74481, 1363, 80854, 16750, 5608, 33284, 903, 18, 3714, 3642, 9384, 47644 ]	[ 0.03814697265625, 0.1357421875, 0.171630859375, 0.191162109375, 0.209228515625, 0.0726318359375, 0.19921875, 0.1534423828125, 0.232421875, 0.1268310546875, 0.1558837890625, 0.2066650390625, 0.097412109375, 0.06951904296875, 0.058624267578125, 0.1397705078125, 0.020751953125, 0.1020...	embed
6021327_c0	6021327	haskell	0	Title: Equivalence of function types with type variables Problem title: Equivalence of function types with type variables Tags: haskell, function, types Problem: Equivalence of function types with type variables I need a function with following attributes. (c->d)->(a->b->c)->a->b->d my function: funktionD = (.) . (.) b...	Equivalence of function types with type variables Equivalence of function types with type variables haskell function types Equivalence Equivalence of function types with type variables I need a function with following attributes. my function: funktionD = (.) . (.) but :t funktionD ist this equal?	[ 0.01397705078125, 0.01031494140625, -0.018798828125, 0.01300048828125, -0.015869140625, -0.0191650390625, -0.00823974609375, -0.005523681640625, 0.009033203125, -0.020751953125, -0.01904296875, -0.0045166015625, 0.01385498046875, 0.00732421875, -0.000293731689453125, -0.00164794921875,...	[ 145666, 1405, 6620, 32354, 52895, 678, 10644, 77336, 1556, 142508, 3871, 25632, 150380, 40210, 397, 2203, 5, 18, 443, 903, 105950 ]	[ 0.076171875, 0.114013671875, 0.001983642578125, 0.18017578125, 0.208740234375, 0.0838623046875, 0.21533203125, 0.212158203125, 0.1153564453125, 0.1878662109375, 0.08892822265625, 0.088623046875, 0.146728515625, 0.201904296875, 0.16943359375, 0.028900146484375, 0.047454833984375, 0....	embed
6241650_c0	6241650	haskell	0	Title: Haskell Array Index out of range Problem title: Haskell Array Index out of range Tags: range, haskell, arrays Problem: Haskell Array Index out of range Code signals: Haskell, Array, Index, Main, Breakpoint, SVMCF.hs:125:13-86, Stopped, _result, UA.Array, User, RTuple, A.Array, A.listArray, UA.UArray, Double, SVM...	Haskell Array Index out of range Haskell Array Index out of range range haskell arrays Haskell Array Index Main Breakpoint SVMCF.hs:125:13-86 Stopped _result UA.Array User RTuple A.Array A.listArray UA.UArray Double SVMCF.hs:125:13-28 SVMCF.hs:125:21-27 Bool SVMCF.hs:125:32-86 SVMCF.hs:125:32-56 SVMCF.hs:125:60-86 Exce...	[ 0.004486083984375, 0.01544189453125, 0.007080078125, -0.0038604736328125, 0.007110595703125, -0.0018768310546875, -0.003021240234375, 0.01708984375, 0.0115966796875, 0.0252685546875, -0.007110595703125, -0.023193359375, 0.00102996826171875, -0.0038909912109375, 0.0361328125, -0.0268554...	[ 20625, 142508, 69253, 53, 31471, 1810, 111, 37457, 1556, 10298, 4778, 12321, 131904, 38496, 159, 47599, 84683, 127, 63652, 22618, 15276, 42284, 20051, 2109, 7136, 20004, 7614, 7092, 53400, 34, 8705, 62, 6562, 107172, 48590, 25619, 50994, 2460...	[ 0.1749267578125, 0.2880859375, 0.22509765625, 0.1180419921875, 0.28076171875, 0.2196044921875, 0.2098388671875, 0.268798828125, 0.156494140625, 0.191162109375, 0.01263427734375, 0.1156005859375, 0.14697265625, 0.1607666015625, 0.02276611328125, 0.1763916015625, 0.164794921875, 0.10...	embed
11701099_c0	11701099	haskell	0	Title: What is the GLboolean values denoting true and false? Problem title: What is the GLboolean values denoting true and false? Tags: opengl, haskell Problem: What is the GLboolean values denoting true and false? I am using Haskell's OpenGL.Raw library and I wish to use the GLboolean values for true and false, but th...	What is the GLboolean values denoting true and false? What is the GLboolean values denoting true and false? opengl haskell What GLboolean What is the GLboolean values denoting true and false? I am using Haskell's OpenGL.Raw library and I wish to use the GLboolean values for true and false, but they don't seem to be pre...	[ 0.004364013671875, -0.00171661376953125, 0.00885009765625, -0.0205078125, 0.00323486328125, 0.02587890625, 0.01239013671875, -0.000888824462890625, 0.0128173828125, 0.056396484375, 0.004669189453125, -0.02392578125, -0.00054168701171875, -0.0068359375, -0.0106201171875, 0.011474609375,...	[ 4865, 70, 90799, 142484, 5073, 142424, 8, 157, 1916, 29568, 136, 98320, 9803, 11016, 1556, 142508, 83, 17368, 20625, 13527, 78703, 12248, 434, 35773, 1294, 32599, 4527, 100, 1653, 13, 5983, 61924, 6097, 35978 ]	[ 0.0546875, 0.0401611328125, 0.1712646484375, 0.16162109375, 0.2098388671875, 0.228515625, 0.1007080078125, 0.1400146484375, 0.08502197265625, 0.2161865234375, 0.1466064453125, 0.25537109375, 0.09112548828125, 0.1495361328125, 0.10235595703125, 0.21533203125, 0.033905029296875, 0.03...	embed
63115281_c0	63115281	haskell	0	Title: How do I set a HTTP header for a request with wreq? Problem title: How do I set a HTTP header for a request with wreq? Tags: wreq, haskell Problem: How do I set a HTTP header for a request with wreq? I see there is a likely function to do this of getWith which passes an Option value. However looking up Option ty...	How do I set a HTTP header for a request with wreq? How do I set a HTTP header for a request with wreq? wreq haskell How HTTP Option How do I set a HTTP header for a request with wreq? I see there is a likely function to do this of getWith which passes an Option value. However looking up Option type seems to show somet...	[ 0.0081787109375, 0.0164794921875, 0.00921630859375, 0.0107421875, -0.005950927734375, -0.0238037109375, 0.0002346038818359375, -0.0133056640625, 0.0024566650390625, 0.026611328125, 0.01043701171875, 0.0107421875, -0.01092529296875, -0.0164794921875, -0.0196533203125, -0.008056640625, ...	[ 11249, 87, 5423, 10, 135913, 10336, 56, 100, 50336, 678, 148, 107, 864, 54, 1556, 142508, 86769, 47041, 32354, 903, 2046, 194583, 10922, 34292, 10644, 10176, 3004, 1902, 138414, 831, 6097 ]	[ 0.05401611328125, 0.0072021484375, 0.1683349609375, 0.053497314453125, 0.228271484375, 0.1890869140625, 0.171630859375, 0.0391845703125, 0.16162109375, 0.0792236328125, 0.043914794921875, 0.1876220703125, 0.2012939453125, 0.011932373046875, 0.1004638671875, 0.183349609375, 0.20043945...	embed
17217876_c0	17217876	haskell	0	Title: returning an element extracted from a monad; redundant? Problem title: returning an element extracted from a monad; redundant? Tags: monads, do-notation, haskell Problem: returning an element extracted from a monad; redundant? Are the following two implementations of flatten equivalent for all well-behaved Monad...	returning an element extracted from a monad; redundant? returning an element extracted from a monad; redundant? monads do-notation haskell a flatten1 flatten2 returning an element extracted from a monad; redundant? Are the following two implementations of flatten equivalent for all well-behaved Monads?	[ -0.00007915496826171875, 0.014892578125, 0.00244140625, 0.0062255859375, 0.0048828125, 0.00848388671875, 0.0057373046875, -0.005279541015625, 0.005645751953125, -0.01239013671875, 0.005645751953125, -0.00830078125, -0.0020294189453125, -0.017578125, 0.00494384765625, -0.000823974609375...	[ 30646, 12830, 125663, 2667, 712, 4842, 35405, 18, 7, 54, 157, 22062, 1556, 142508, 49878, 510, 418, 304, 214, 1295, 25632, 6626, 208124, 183234, 756, 5299, 372, 528, 60331, 6468 ]	[ 0.15771484375, 0.1673583984375, 0.155517578125, 0.1402587890625, 0.1708984375, 0.064208984375, 0.1734619140625, 0.08056640625, 0.041168212890625, 0.0711669921875, 0.126220703125, 0.05157470703125, 0.08642578125, 0.21484375, 0.1925048828125, 0.215087890625, 0.047393798828125, 0.0762...	embed
69843667_c0	69843667	haskell	0	Title: transpose a 2d list and convert it to a 1d list Problem title: transpose a 2d list and convert it to a 1d list Tags: haskell, list-comprehension, list Problem: transpose a 2d list and convert it to a 1d list I have a 2d list l, and [l!!y!!x\| x<-[0..length l-1], y<-[0..length l-1]] will produce a 1d list where ro...	transpose a 2d list and convert it to a 1d list transpose a 2d list and convert it to a 1d list haskell list-comprehension list l-1 transpose a 2d list and convert it to a 1d list I have a 2d list l, and will produce a 1d list where rows and columns are swapped. How can I implement this without list comprehension(i.e. ...	[ -0.004974365234375, 0.01165771484375, -0.006103515625, -0.01348876953125, -0.0213623046875, -0.0164794921875, -0.00148773193359375, -0.00360107421875, -0.000720977783203125, -0.029541015625, 0.00897216796875, 0.01611328125, 0.01531982421875, 0.0098876953125, -0.025146484375, 0.00256347...	[ 3900, 78381, 116, 71, 5303, 96760, 47, 106, 10, 1556, 142508, 277, 4692, 3220, 96, 5759, 27489, 15555, 136, 3365, 316, 68062, 48398, 29479, 15490, 46683, 6889, 17368, 22288 ]	[ 0.176025390625, 0.14501953125, 0.1162109375, 0.10443115234375, 0.2197265625, 0.1207275390625, 0.0640869140625, 0.0904541015625, 0.042724609375, 0.0806884765625, 0.1822509765625, 0.01031494140625, 0.099853515625, 0.1024169921875, 0.05194091796875, 0.0538330078125, 0.0966796875, 0.13...	embed
33315685_c2	33315685	haskell	2	server.crt, server.pem, localhost:3000, Rebuilt, URL, Trying, Connected, ALPN, Cipher, ALL, EXPORT, EXPORT40, EXPORT56, LOW, RC4, STRENGTH, TLSv1.2, OUT, TLS, Certificate, Status, Client, error:04091077:rsa, routines:INT_RSA_VERIFY:wrong, Closing, Oct, Info, yesod_2EJXksqBDOz5UARIVdQquS:Yesod.Core.Dispatch, Yesod, Cor...	server.crt, server.pem, localhost:3000, Rebuilt, URL, Trying, Connected, ALPN, Cipher, ALL, EXPORT, EXPORT40, EXPORT56, LOW, RC4, STRENGTH, TLSv1.2, OUT, TLS, Certificate, Status, Client, error:04091077:rsa, routines:INT_RSA_VERIFY:wrong, Closing, Oct, Info, yesod_2EJXksqBDOz5UARIVdQquS:Yesod.Core.Dispatch, Yesod, Cor...	[ -0.010498046875, 0.0087890625, 0.00274658203125, 0.028564453125, 0.0028076171875, -0.0030517578125, -0.0078125, 0.00225830078125, 0.010009765625, 0.024169921875, 0.006500244140625, -0.0213623046875, 0.00872802734375, 0.00848388671875, -0.007720947265625, 0.0009765625, -0.015197753906...	[ 10723, 23150, 18, 4, 72508, 4000, 40294, 36605, 853, 978, 24908, 31862, 40858, 214, 62448, 297, 9804, 34440, 2079, 94266, 58837, 29426, 91599, 2839, 13683, 143141, 81135, 617, 46549, 48262, 20602, 294, 334, 48400, 6, 52001, 83991, 56504, 91...	[ 0.204833984375, 0.06719970703125, 0.154052734375, 0.001312255859375, 0.1817626953125, 0.1156005859375, 0.1298828125, 0.2061767578125, 0.108642578125, 0.1124267578125, 0.1285400390625, 0.159912109375, 0.1512451171875, 0.06451416015625, 0.1502685546875, 0.01983642578125, 0.085388183593...	embed
12675420_c0	12675420	haskell	0	Title: How to use case expression for tuple in Haskell? Problem title: How to use case expression for tuple in Haskell? Tags: switch-statement, tuples, haskell Problem: How to use case expression for tuple in Haskell? I have a problem when using case expression in Haskell. filterSth::[a]->(b,c)->[a] filterSth (x:xs) (b...	How to use case expression for tuple in Haskell? How to use case expression for tuple in Haskell? switch-statement tuples haskell How Haskell x:xs How to use case expression for tuple in Haskell? I have a problem when using case expression in Haskell. can I do something like above ?	[ -0.00396728515625, 0.006591796875, -0.01165771484375, -0.004119873046875, 0.007232666015625, -0.018310546875, 0.005218505859375, 0.00799560546875, 0.03369140625, 0.0027313232421875, 0.015380859375, 0.0218505859375, -0.00041961669921875, -0.0030975341796875, -0.00689697265625, -0.000488...	[ 11249, 47, 4527, 7225, 125195, 370, 8705, 20625, 142508, 100, 23, 101089, 61340, 99726, 1556, 425, 2967, 17368 ]	[ 0.030609130859375, 0.036346435546875, 0.0894775390625, 0.2369384765625, 0.20068359375, 0.10589599609375, 0.2041015625, 0.1082763671875, 0.1961669921875, 0.01131439208984375, 0.0173797607421875, 0.1478271484375, 0.0899658203125, 0.1610107421875, 0.08526611328125, 0.031524658203125, 0....	embed
23436133_c0	23436133	haskell	0	Title: Manually deriving the type `(.) (foldr(++)) (map (:))` Problem title: Manually deriving the type `(.) (foldr(++)) (map (:))` Tags: unification, types, ghci, haskell Problem: Manually deriving the type `(.) (foldr(++)) (map (:))` I'm trying to derive the type of (.) (foldr(++)) (map (:)) I start by deriving the t...	Manually deriving the type `(.) (foldr(++)) (map (:))` Manually deriving the type `(.) (foldr(++)) (map (:))` unification types ghci haskell Manually Manually deriving the type `(.) (foldr(++)) (map (:))` I'm trying to derive the type of (.) (foldr(++)) (map (:)) I start by deriving the type of foldr (++) So Then I der...	[ 0.00299072265625, 0.01953125, -0.014892578125, -0.00341796875, -0.0277099609375, -0.00125885009765625, -0.0125732421875, 0.01287841796875, -0.010986328125, -0.01361083984375, -0.01446533203125, -0.03466796875, 0.00958251953125, -0.0012359619140625, -0.0169677734375, -0.006988525390625,...	[ 111021, 538, 16406, 6496, 10644, 5, 42822, 42, 37223, 62346, 84142, 51, 41274, 52895, 31380, 318, 1556, 142508, 132, 31577, 122, 5844, 111, 4034, 18344, 7569, 22288, 201106, 2046, 4966, 26458, 527, 73265, 14, 100, 18, 87, 33079, 11, 12921...	[ 0.166748046875, 0.039581298828125, 0.1478271484375, 0.0750732421875, 0.192138671875, 0.1485595703125, 0.14111328125, 0.131103515625, 0.1907958984375, 0.1663818359375, 0.0772705078125, 0.108154296875, 0.0933837890625, 0.1593017578125, 0.08941650390625, 0.1337890625, 0.10321044921875, ...	embed
24517995_c0	24517995	haskell	0	Title: Why ByteString is not Vector Word8? Problem title: Why ByteString is not Vector Word8? Tags: bytestring, haskell, performance, vector Problem: Why ByteString is not Vector Word8? Seems like strict ByteString is structuraly same as Vector Word8 . Why ByteString is not deprecated in favor of Vector ? Are there per...	Why ByteString is not Vector Word8? Why ByteString is not Vector Word8? bytestring haskell performance vector Why ByteString Vector Word8 Byte8 Why ByteString is not Vector Word8? Seems like strict ByteString is structuraly same as Vector Word8 . Why ByteString is not deprecated in favor of Vector ? Are there performan...	[ 0.0164794921875, 0.00982666015625, -0.00787353515625, 0.014892578125, -0.01495361328125, -0.0034942626953125, -0.0164794921875, -0.01458740234375, -0.005950927734375, 0.024658203125, 0.0020294189453125, -0.008056640625, -0.0003643035888671875, 0.01519775390625, -0.040283203125, 0.01000...	[ 44084, 3311, 67, 71713, 214, 83, 959, 2609, 18770, 22543, 1019, 390, 91693, 1556, 142508, 23718, 173, 81113, 118990, 5701, 237, 8, 4692, 4460, 10862, 27781, 4271, 56 ]	[ 0.08648681640625, 0.1075439453125, 0.1646728515625, 0.2183837890625, 0.1236572265625, 0.057281494140625, 0.1181640625, 0.1728515625, 0.165771484375, 0.1246337890625, 0.201904296875, 0.08258056640625, 0.208251953125, 0.10284423828125, 0.2076416015625, 0.1573486328125, 0.10986328125, ...	embed
37563975_c0	37563975	haskell	0	Title: Why my Eclipse doesn't mark the reserverd words for Haskell? Problem title: Why my Eclipse doesn't mark the reserverd words for Haskell? Tags: ghc, haskell, eclipse Problem: Why my Eclipse doesn't mark the reserverd words for Haskell? I've installed the plugin for Eclipse Luna: EclipseFP - http://eclip...	Why my Eclipse doesn't mark the reserverd words for Haskell? Why my Eclipse doesn't mark the reserverd words for Haskell? ghc haskell eclipse Why Eclipse Haskell Why my Eclipse doesn't mark the reserverd words for Haskell? I've installed the plugin for Eclipse Luna: EclipseFP - http://eclipsefp.sf.net/updates...	[ -0.00098419189453125, 0.00604248046875, -0.00830078125, 0.0032958984375, -0.006439208984375, -0.000865936279296875, -0.0125732421875, 0.01373291015625, -0.000659942626953125, 0.0269775390625, -0.0098876953125, -0.0279541015625, 0.013427734375, 0.01611328125, -0.0002536773681640625, 0.0...	[ 44084, 234962, 22027, 3768, 18, 16188, 76875, 4216, 34153, 20625, 142508, 759, 100, 31380, 238, 1556, 106371, 184, 20600, 69993, 42873, 51006, 95680, 254, 420, 117008, 27985, 36497, 959, 214, 70488 ]	[ 0.07830810546875, 0.229736328125, 0.06256103515625, 0.041015625, 0.0831298828125, 0.1341552734375, 0.164306640625, 0.120361328125, 0.181640625, 0.117919921875, 0.2435302734375, 0.0181884765625, 0.033111572265625, 0.011871337890625, 0.019927978515625, 0.0845947265625, 0.1199951171875,...	embed
70729598_c0	70729598	haskell	0	Title: Basic Functors in Haskell Problem title: Basic Functors in Haskell Tags: haskell, functor Problem: Basic Functors in Haskell I know that Functor typeclass is defined like so: class Functor f where fmap :: (a -> b) -> f a -> f b In my course it says that this is how a list is made an instance of functor: instance...	Basic Functors in Haskell Basic Functors in Haskell haskell functor Basic Functors Haskell Functor Basic Functors in Haskell I know that Functor typeclass is defined like so: In my course it says that this is how a list is made an instance of functor: Is [] a some kind of synonym for [a] ?	[ 0.00567626953125, -0.0016326904296875, 0.0113525390625, -0.0034332275390625, -0.007568359375, 0.0203857421875, -0.0020904541015625, -0.005279541015625, 0.01806640625, 0.0126953125, -0.023193359375, -0.036865234375, -0.00726318359375, 0.01190185546875, -0.0220947265625, -0.0033721923828...	[ 91692, 28670, 18770, 20625, 142508, 23, 1556, 7477, 7, 3714, 10644, 67413, 83, 61924, 71, 1884, 221, 15411, 903, 3642, 5303, 7228, 110527, 2071, 378, 268, 8562, 164661, 11 ]	[ 0.1529541015625, 0.16357421875, 0.241455078125, 0.1348876953125, 0.2337646484375, 0.051116943359375, 0.099609375, 0.166259765625, 0.00958251953125, 0.0195770263671875, 0.17578125, 0.2288818359375, 0.0037841796875, 0.12646484375, 0.0166168212890625, 0.06378173828125, 0.06402587890625,...	embed
8375006_c0	8375006	haskell	0	Title: Function to map Maybes to a monad Problem title: Function to map Maybes to a monad Tags: monads, standard-library, haskell Problem: Function to map Maybes to a monad I often use expressions of the form maybe (return ()) someFunc someMaybe . Searching for a function Monad m => (a -> m ()) -> Maybe a -> m () on ho...	Function to map Maybes to a monad Function to map Maybes to a monad monads standard-library haskell Maybes Monad Maybe Function to map Maybes to a monad I often use expressions of the form maybe (return ()) someFunc someMaybe . Searching for a function Monad m => (a -> m ()) -> Maybe a -> m () on hoogle doesn't yield a...	[ -0.0167236328125, -0.003387451171875, 0.0205078125, -0.0002498626708984375, -0.0003070831298828125, 0.0152587890625, 0.016357421875, -0.017333984375, -0.00093841552734375, -0.0205078125, -0.004638671875, -0.01507568359375, -0.028564453125, 0.002166748046875, 0.0084228515625, -0.0233154...	[ 28670, 10763, 47, 22288, 83425, 7, 10, 2667, 712, 5570, 150, 2844, 1556, 142508, 60331, 71, 27983, 4527, 125195, 3173, 51139, 65395, 19, 3060, 97249, 238, 82419, 372, 33086, 100, 32354, 347, 44357, 11, 33079, 98, 28994, 133, 29458, 16750,...	[ 0.183837890625, 0.0465087890625, 0.176025390625, 0.2457275390625, 0.3076171875, 0.1954345703125, 0.0911865234375, 0.16845703125, 0.21533203125, 0.1326904296875, 0.06146240234375, 0.1077880859375, 0.10400390625, 0.2122802734375, 0.174560546875, 0.163818359375, 0.07550048828125, 0.05...	embed
40106559_c0	40106559	haskell	0	Title: Tree to a list of possible paths (values) Problem title: Tree to a list of possible paths (values) Tags: haskell Problem: Tree to a list of possible paths (values) Given a tree data structure defined as data Tree = Node Int Tree Tree \| Leaf How can one transform it into a list of values along all paths? For exam...	Tree to a list of possible paths (values) Tree to a list of possible paths (values) haskell Tree Node Leaf Tree to a list of possible paths (values) Given a tree data structure defined as How can one transform it into a list of values along all paths? For example Node 1 (Node 2 Leaf Leaf) (Node 3 Leaf Leaf) should tran...	[ 0.030029296875, -0.00958251953125, -0.0166015625, -0.01263427734375, 0.0029449462890625, 0.0169677734375, -0.0291748046875, -0.02197265625, -0.0026397705078125, -0.037841796875, -0.0225830078125, -0.0155029296875, -0.0026397705078125, 0.01470947265625, 0.0002994537353515625, 0.00537109...	[ 101344, 47, 5303, 111, 7722, 60875, 7, 27494, 10, 1556, 142508, 438, 112, 636, 2407, 77878, 53201, 2053, 45646, 61924, 11249, 831, 27198, 3934, 142424, 33233, 756, 106, 5021, 116, 138, 5608, 3900, 19309, 133063, 96386 ]	[ 0.255615234375, 0.165283203125, 0.166748046875, 0.023681640625, 0.167236328125, 0.198974609375, 0.070556640625, 0.156494140625, 0.0191192626953125, 0.141357421875, 0.244140625, 0.149169921875, 0.1558837890625, 0.061920166015625, 0.139892578125, 0.010009765625, 0.241455078125, 0.161...	embed
50415146_c0	50415146	haskell	0	Title: Weird type syntax in data constructor Problem title: Weird type syntax in data constructor Tags: syntax, haskell Problem: Weird type syntax in data constructor I've found some code data Tree c a = Node String [Tree c a] \| NodeWithCleanup c [Tree c a] \| Leaf a And I don't understand why it's necessary to add [Tre...	Weird type syntax in data constructor Weird type syntax in data constructor syntax haskell Weird Tree Node NodeWithCleanup Leaf Weird type syntax in data constructor I've found some code And I don't understand why it's necessary to add [Tree c a] . I don't know this syntax, can you explain it to me ?	[ 0.005096435546875, 0.004547119140625, -0.015625, 0.009521484375, 0.0140380859375, 0.005035400390625, -0.0101318359375, 0.007568359375, 0.0026092529296875, -0.0267333984375, -0.005889892578125, -0.042236328125, 0.005096435546875, -0.00616455078125, -0.01129150390625, -0.01068115234375, ...	[ 1401, 82249, 10644, 6002, 86531, 23, 2053, 64549, 748, 1556, 142508, 101344, 438, 112, 194583, 34677, 2037, 636, 2407, 14037, 18151, 2301, 18, 28219, 15400, 63559, 47, 15190, 62731, 13, 501, 10, 268, 3714, 903, 831, 73342 ]	[ 0.0882568359375, 0.2138671875, 0.22509765625, 0.1529541015625, 0.183837890625, 0.044921875, 0.11767578125, 0.1851806640625, 0.1036376953125, 0.12060546875, 0.2152099609375, 0.2171630859375, 0.1220703125, 0.10113525390625, 0.110595703125, 0.16357421875, 0.1226806640625, 0.0382385253...	embed
27280187_c0	27280187	haskell	0	Title: Haskell Platform through Macports Problem title: Haskell Platform through Macports Tags: haskell-platform, macports, haskell Problem: Haskell Platform through Macports I have installed the Haskell Platform through MacPorts. Although many Haskell libraries are available as MacPorts packages, some are not. What is...	Haskell Platform through Macports Haskell Platform through Macports haskell-platform macports haskell Haskell Platform Macports Haskell Platform through Macports I have installed the Haskell Platform through MacPorts. Although many Haskell libraries are available as MacPorts packages, some are not. What is the proper w...	[ -0.00604248046875, -0.0033111572265625, 0.00152587890625, 0.01422119140625, 0.0024261474609375, 0.00274658203125, 0.002105712890625, -0.014892578125, -0.000316619873046875, -0.00299072265625, 0.006103515625, -0.0185546875, 0.0196533203125, 0.005950927734375, 0.0108642578125, -0.0140380...	[ 20625, 142508, 70968, 8305, 4727, 6982, 7, 1556, 172121, 19138, 20600, 60006, 5941, 35773, 19882, 237, 98169, 3060, 959, 27798, 3917, 47, 2856, 25553, 6892, 171763 ]	[ 0.1632080078125, 0.272705078125, 0.2037353515625, 0.08355712890625, 0.1195068359375, 0.24560546875, 0.0460205078125, 0.0902099609375, 0.1292724609375, 0.0814208984375, 0.1822509765625, 0.2489013671875, 0.0206298828125, 0.1817626953125, 0.0770263671875, 0.007232666015625, 0.1765136718...	embed
21860901_c1	21860901	haskell	1	handles the content and the teaser correctly. But the tags are not seen. They just end up in the HTML output. The HTML input is like: . . . </head> <body> <div id="content"> <h1 class="title">2013-06-30-test-post</h1> --- title: My first org-mode post tags: emacs, org-mode --- <p> Does it work? </p> <!-- MORE --> <p> ...	handles the content and the teaser correctly. But the tags are not seen. They just end up in the HTML output. The HTML input is like: . . . </head> <body> <div id="content"> <h1 class="title">2013-06-30-test-post</h1> --- title: My first org-mode post tags: emacs, org-mode --- <p> Does it work? </p> <!-- MORE --> <p> ...	[ 0.0059814453125, 0.00811767578125, 0.01513671875, -0.0281982421875, 0.018798828125, 0.0047607421875, -0.0225830078125, 0.0030059814453125, -0.004241943359375, -0.04150390625, 0.00555419921875, 0.02587890625, -0.0211181640625, -0.00421142578125, 0.02294921875, -0.0004425048828125, -0....	[ 34831, 7, 10941, 136, 214295, 26785, 538, 4966, 69141, 621, 959, 51592, 3564, 1257, 19097, 140992, 107730, 1884, 31251, 37873, 30618, 69246, 7735, 1197, 6954, 4594, 44759, 5117, 30910, 61170, 1305, 352, 2263, 101790, 442, 4488, 9, 195879, 1...	[ 0.156982421875, 0.07794189453125, 0.1724853515625, 0.0213775634765625, 0.293212890625, 0.131103515625, 0.030914306640625, 0.043975830078125, 0.233154296875, 0.03021240234375, 0.08837890625, 0.1622314453125, 0.09228515625, 0.0426025390625, 0.2181396484375, 0.1549072265625, 0.189575195...	embed
22084187_c0	22084187	haskell	0	Title: Haskell compare NaN values Problem title: Haskell compare NaN values Tags: haskell Problem: Haskell compare NaN values I've got a function which is returning a Float.(average) Then I get that output and compare it within another function \| average == 0 = "0" \| average >= 0 = (show average) But when the average i...	Haskell compare NaN values Haskell compare NaN values haskell Haskell NaN Haskell compare NaN values I've got a function which is returning a Float.(average) Then I get that output and compare it within another function But when the average is NaN I can't do this comparing cause NaN seems to be /=0. How can I compare a...	[ -0.0093994140625, -0.01708984375, 0.000888824462890625, -0.007049560546875, 0.00616455078125, 0.0106201171875, 0.042236328125, -0.01507568359375, -0.006500244140625, 0.0478515625, 0.0091552734375, 0.00543212890625, 0.00823974609375, -0.01495361328125, 0.0034027099609375, -0.00579833984...	[ 20625, 142508, 69101, 353, 839, 142424, 1556, 87, 4163, 32354, 30646, 38699, 257, 8216, 29838, 140992, 28032, 15700, 4966, 3229, 70, 83080, 831, 18, 54, 37397, 214, 22304, 37202, 248, 145407, 11249, 34292 ]	[ 0.137451171875, 0.2420654296875, 0.2252197265625, 0.200927734375, 0.2425537109375, 0.2176513671875, 0.118896484375, 0.00067138671875, 0.0186920166015625, 0.1646728515625, 0.108642578125, 0.162353515625, 0.0887451171875, 0.1351318359375, 0.14892578125, 0.12890625, 0.057586669921875, ...	embed
54658737_c0	54658737	haskell	0	Title: How to delete an element from list and all his duplicates? Problem title: How to delete an element from list and all his duplicates? Tags: haskell Problem: How to delete an element from list and all his duplicates? I need to find max and min elements from list and remove them and their duplicate. I use maximum(l...	How to delete an element from list and all his duplicates? How to delete an element from list and all his duplicates? haskell list How How to delete an element from list and all his duplicates? I need to find max and min elements from list and remove them and their duplicate. I use to find max and min but don't know ho...	[ -0.013427734375, 0.0174560546875, -0.0025787353515625, -0.006256103515625, -0.01263427734375, 0.0152587890625, 0.0230712890625, 0.009765625, 0.0038604736328125, -0.034423828125, -0.00970458984375, -0.00183868408203125, 0.01519775390625, -0.00518798828125, -0.00909423828125, 0.004028320...	[ 11249, 47, 154109, 12830, 1295, 5303, 136, 756, 1919, 171763, 1636, 32, 1556, 142508, 142, 87, 3871, 7413, 18389, 881, 80854, 87388, 2856, 67, 4527, 1284, 18, 3714, 3642, 111 ]	[ 0.1124267578125, 0.10791015625, 0.258056640625, 0.2056884765625, 0.1900634765625, 0.2197265625, 0.1312255859375, 0.1024169921875, 0.073974609375, 0.2386474609375, 0.1290283203125, 0.010711669921875, 0.1387939453125, 0.225830078125, 0.0360107421875, 0.00335693359375, 0.07415771484375,...	embed
36393570_c0	36393570	haskell	0	Title: Is it safe to postulate unit types are equal? Problem title: Is it safe to postulate unit types are equal? Tags: haskell, types Problem: Is it safe to postulate unit types are equal? Is it safe to postulate that all types of kind () are the same? That is, can the following be used to break type safety? -- Bad po...	Is it safe to postulate unit types are equal? Is it safe to postulate unit types are equal? haskell types Bad Refl Is it safe to postulate unit types are equal? Is it safe to postulate that all types of kind () are the same? That is, can the following be used to break type safety?	[ 0.01165771484375, 0.00640869140625, 0.01116943359375, -0.002471923828125, -0.006622314453125, -0.031982421875, -0.01165771484375, -0.0084228515625, -0.0035858154296875, -0.019287109375, -0.006988525390625, -0.0018310546875, 0.0234375, 0.007659912109375, -0.00628662109375, 0.00396728515...	[ 46002, 49489, 2182, 25072, 52895, 105950, 1556, 142508, 12745, 53295, 141, 2071, 442, 621, 756, 8562, 5701, 25632, 11814, 36356, 10644, 81900 ]	[ 0.1632080078125, 0.1756591796875, 0.05694580078125, 0.18408203125, 0.215576171875, 0.158447265625, 0.0830078125, 0.169189453125, 0.08453369140625, 0.1109619140625, 0.028900146484375, 0.0110321044921875, 0.0105743408203125, 0.0269775390625, 0.056732177734375, 0.140869140625, 0.1094970...	embed
16505410_c0	16505410	haskell	0	Title: Seeking example of how to use nntp package Problem title: Seeking example of how to use nntp package Tags: monads, nntp, haskell Problem: Seeking example of how to use nntp package I still quite new to the whole monad/IO thing, and I am having trouble using the nntp package . Could someone show me an example of ...	Seeking example of how to use nntp package Seeking example of how to use nntp package monads nntp haskell Seeking Seeking example of how to use nntp package I still quite new to the whole monad/IO thing, and I am having trouble using the nntp package . Could someone show me an example of how to use it please? eg. How t...	[ 0.000789642333984375, 0.00080108642578125, -0.00701904296875, 0.027099609375, 0.00830078125, 0.033203125, 0.0118408203125, -0.00830078125, 0.01263427734375, -0.02783203125, 0.005218505859375, -0.0233154296875, -0.00799560546875, 0.006744384765625, -0.0169677734375, -0.0159912109375, ...	[ 6872, 6048, 27781, 3642, 4527, 653, 660, 254, 98169, 2667, 712, 7, 1556, 142508, 7464, 32233, 3525, 17780, 13580, 63134, 17368, 7639, 47, 442, 22936, 11249, 2046, 5303, 5582, 11338, 21115, 28032, 4568, 744, 21974 ]	[ 0.064697265625, 0.0233306884765625, 0.177734375, 0.051666259765625, 0.1165771484375, 0.092529296875, 0.184814453125, 0.2457275390625, 0.2196044921875, 0.1160888671875, 0.1744384765625, 0.03857421875, 0.1195068359375, 0.229248046875, 0.010650634765625, 0.020111083984375, 0.07147216796...	embed
37379507_c0	37379507	haskell	0	Title: Getting params as a list of key/value tuple Problem title: Getting params as a list of key/value tuple Tags: yesod, haskell Problem: Getting params as a list of key/value tuple I'm implementing a RESTful url, so I could filter my query with for example /api/v1.0/events?filter[title]="foo"&filter[content]="bar" I...	Getting params as a list of key/value tuple Getting params as a list of key/value tuple yesod haskell Getting v1.0 Getting params as a list of key/value tuple I'm implementing a RESTful url, so I could filter my query with for example /api/v1.0/events?filter[title]="foo"&filter[content]="bar" Is there an existing way t...	[ 0.00360107421875, 0.000202178955078125, -0.01055908203125, -0.038818359375, -0.0133056640625, 0.002838134765625, -0.01043701171875, -0.01446533203125, 0.005523681640625, -0.04052734375, 0.01611328125, -0.0113525390625, -0.0142822265625, 0.00860595703125, -0.0164794921875, -0.0046386718...	[ 210732, 121, 4432, 237, 5303, 22799, 64, 27494, 13, 370, 8705, 2422, 23722, 1556, 142508, 81, 102107, 111, 29479, 627, 21828, 7844, 25002, 5809, 46312, 41, 1294, 100, 248, 40897, 334, 90141, 120337, 5440, 3584, 31, 1230, 69246, 1299, 1445...	[ 0.1248779296875, 0.199462890625, 0.252197265625, 0.1165771484375, 0.15869140625, 0.141845703125, 0.0526123046875, 0.152587890625, 0.0262603759765625, 0.1099853515625, 0.2037353515625, 0.1158447265625, 0.173095703125, 0.105712890625, 0.2261962890625, 0.0703125, 0.156982421875, 0.031...	embed
39013007_c0	39013007	haskell	0	Title: recursive instances in haskell Problem title: recursive instances in haskell Tags: haskell, typeclass, recursion Problem: recursive instances in haskell When using the following code, I get the error message below for the recursive usage of toInt module Intro0 where data Zero data Succ n Code signals: a, the, In...	recursive instances in haskell recursive instances in haskell haskell typeclass recursion a the Intro0 Zero Succ Nat Could EPhantomTypes.hs:10:10-32 Note Defined EPhantomTypes.hs:10:10 EPhantomTypes.hs:8:10 recursive instances in haskell When using the following code, I get the error message below for the recursive usa...	[ -0.0181884765625, -0.00787353515625, -0.0019989013671875, 0.0228271484375, -0.01446533203125, 0.00946044921875, 0.01123046875, 0.004058837890625, 0.004150390625, -0.0238037109375, -0.01177978515625, -0.0194091796875, 0.0098876953125, 0.025146484375, 0.0274658203125, -0.01177978515625, ...	[ 195625, 5844, 110527, 23, 1556, 142508, 10644, 67413, 1830, 10, 70, 360, 2955, 2389, 83947, 1832, 10060, 68875, 191147, 1121, 5928, 196707, 127, 15110, 108760, 18622, 262, 5983, 26201, 1019, 17368, 25632, 18151, 18499, 26008, 35064, 127689, 4...	[ 0.257568359375, 0.169921875, 0.2412109375, 0.03350830078125, 0.15673828125, 0.22705078125, 0.1356201171875, 0.1915283203125, 0.0909423828125, 0.052978515625, 0.000244140625, 0.0643310546875, 0.1534423828125, 0.18896484375, 0.159912109375, 0.10107421875, 0.1236572265625, 0.134765625...	embed
23359525_c0	23359525	haskell	0	Title: Best way to send 10GB vector across network in Haskell Problem title: Best way to send 10GB vector across network in Haskell Tags: haskell Problem: Best way to send 10GB vector across network in Haskell I am curious to know what the best way to send 10 GB once over the network in Haskell? I don't want to send it...	Best way to send 10GB vector across network in Haskell Best way to send 10GB vector across network in Haskell haskell Best Haskell Best way to send 10GB vector across network in Haskell I am curious to know what the best way to send 10 GB once over the network in Haskell? I don't want to send it as binary without havin...	[ 0.0103759765625, 0.0208740234375, -0.0172119140625, 0.00311279296875, 0.00014400482177734375, -0.000644683837890625, -0.01080322265625, -0.01385498046875, -0.00799560546875, -0.03564453125, 0.022705078125, -0.033935546875, 0.0086669921875, 0.01104736328125, -0.0164794921875, 0.02746582...	[ 11345, 3917, 47, 25379, 209, 8359, 173, 18770, 36880, 33120, 23, 20625, 142508, 1556, 193844, 3714, 2367, 2965, 20331, 24145, 645, 70, 3444, 237, 2394, 6635, 33022, 8, 40899, 64, 66332, 442, 13695, 81113, 21, 3285 ]	[ 0.1339111328125, 0.1055908203125, 0.07745361328125, 0.16845703125, 0.1937255859375, 0.21044921875, 0.198974609375, 0.2342529296875, 0.1837158203125, 0.1669921875, 0.07611083984375, 0.1575927734375, 0.258056640625, 0.1400146484375, 0.065673828125, 0.015228271484375, 0.00347900390625, ...	embed
51762890_c0	51762890	haskell	0	Title: How can I create my own list in Haskell? Problem title: How can I create my own list in Haskell? Tags: list, haskell Problem: How can I create my own list in Haskell? I would like to create my own list in Haskell where I could put in the number 6 and get the result [1,2,3,4,5,6] I thought I could write something...	How can I create my own list in Haskell? How can I create my own list in Haskell? list haskell How Haskell n-1 How can I create my own list in Haskell? I would like to create my own list in Haskell where I could put in the number 6 and get the result [1,2,3,4,5,6] I thought I could write something like Could someone he...	[ 0.00131988525390625, 0.01263427734375, -0.00390625, 0.01116943359375, 0, 0.000652313232421875, -0.006805419921875, 0.0013427734375, 0.01141357421875, -0.0238037109375, 0.00848388671875, -0.041259765625, 0.01177978515625, 0.0255126953125, 0.00604248046875, 0.0023956298828125, 0.010864...	[ 11249, 831, 87, 28282, 759, 10002, 5303, 23, 20625, 142508, 1556, 653, 5759, 2806, 1884, 5809, 3884, 14012, 305, 2046, 16750, 133063, 82449, 104629, 17569, 33022, 191147, 22008, 4358 ]	[ 0.0882568359375, 0.10076904296875, 0.055816650390625, 0.18603515625, 0.1123046875, 0.2042236328125, 0.2734375, 0.09228515625, 0.1851806640625, 0.26171875, 0.161865234375, 0.0899658203125, 0.1832275390625, 0.039794921875, 0.0950927734375, 0.0474853515625, 0.046295166015625, 0.164672...	embed
47599616_c0	47599616	haskell	0	Title: In Haskell (max 3 5) * 2 => 10 Problem title: In Haskell (max 3 5) * 2 => 10 Tags: haskell Problem: In Haskell (max 3 5) * 2 => 10 This is my first day with Haskell, Can you please explain, how this works. I assume, first the compiler should work on finding the max value among 3 and 5 and then multiply the...	In Haskell (max 3 5) * 2 => 10 In Haskell (max 3 5) * 2 => 10 haskell Haskell In Haskell (max 3 5) * 2 => 10 This is my first day with Haskell, Can you please explain, how this works. I assume, first the compiler should work on finding the max value among 3 and 5 and then multiply the result by 2. Whereas, Haskel...	[ 0.00098419189453125, -0.00494384765625, 0.0263671875, 0.01165771484375, 0.0013275146484375, 0.0341796875, -0.000823974609375, 0.0023193359375, 0.01104736328125, -0.0257568359375, 0.0013275146484375, -0.011474609375, -0.00372314453125, -0.00775146484375, 0.00147247314453125, -0.01354980...	[ 360, 20625, 142508, 24084, 138, 21162, 661, 116, 5386, 209, 1556, 44357, 5117, 5155, 678, 4171, 22936, 73342, 3642, 903, 43240, 41591, 9969, 34759, 5608, 4488, 90791, 18389, 34292, 54940, 136, 190, 6024, 62479, 16750, 390, 787, 78662, 162, ...	[ 0.0936279296875, 0.1776123046875, 0.276611328125, 0.2127685546875, 0.1827392578125, 0.2734375, 0.14404296875, 0.2039794921875, 0.0227203369140625, 0.2125244140625, 0.1546630859375, 0.0906982421875, 0.0634765625, 0.0802001953125, 0.0643310546875, 0.018463134765625, 0.020355224609375, ...	embed
23471594_c1	23471594	haskell	1	<- forkIO $ mapM_ (\a -> printf "pushing %c... " a >> pushStack s a >> threadDelay 100000) ['a' .. 'z'] _ <- forkIO $ do replicateM 13 (popStack s) >>= printf "\npopped 13 elems: %s\n" replicateM 13 (popStack s) >>= printf "\npopped 13 elems: %s\n" threadDelay (5*10^6) putStrLn "Done" Code signals: MVar, Control.Concu...	<- forkIO $ mapM_ (\a -> printf "pushing %c... " a >> pushStack s a >> threadDelay 100000) ['a' .. 'z'] _ <- forkIO $ do replicateM 13 (popStack s) >>= printf "\npopped 13 elems: %s\n" replicateM 13 (popStack s) >>= printf "\npopped 13 elems: %s\n" threadDelay (5*10^6) putStrLn "Done" Code signals: MVar, Control.Concu...	[ 0.0159912109375, -0.006927490234375, -0.0296630859375, 0.000408172607421875, -0.007232666015625, 0.0030670166015625, 0.017822265625, 0.000461578369140625, 0.00081634521484375, -0.037353515625, 0.0274658203125, -0.00063323974609375, 0.0038299560546875, -0.0130615234375, 0.0022125244140625...	[ 100, 92, 17780, 3650, 22288, 594, 454, 11, 28412, 420, 1766, 54700, 44, 10, 25944, 42378, 2594, 91, 86997, 4657, 5259, 77433, 77495, 169, 143126, 67, 702, 33554, 771, 48398, 88, 195, 58, 11516, 963, 59690, 3884, 71713, 60728, 28864, 260...	[ 0.16845703125, 0.151123046875, 0.25439453125, 0.127197265625, 0.1588134765625, 0.111572265625, 0.042724609375, 0.057861328125, 0.162109375, 0.07781982421875, 0.1802978515625, 0.158447265625, 0.004425048828125, 0.048126220703125, 0.17724609375, 0.122802734375, 0.0970458984375, 0.050...	embed
29144220_c0	29144220	haskell	0	Title: How can I calculate Σ_{i=m}^n (m+i)^n? Problem title: How can I calculate Σ_{i=m}^n (m+i)^n? Tags: haskell Problem: How can I calculate Σ_{i=m}^n (m+i)^n? I'm currently trying to calculate the following sum: sum2015 :: Integer->Integer->Integer sum2015 m n \| m>n = 0 \| otherwise = (m+m)^n + sum2015 (m+1) n As an ...	How can I calculate Σ_{i=m}^n (m+i)^n? How can I calculate Σ_{i=m}^n (m+i)^n? haskell How sum2015 Integer How can I calculate Σ_{i=m}^n (m+i)^n? I'm currently trying to calculate the following sum: As an example, sum2015 0 1 should return 1 . However, it returns 2 . What did I do wrong?	[ -0.01318359375, -0.00738525390625, 0.0012969970703125, 0.0028839111328125, -0.00897216796875, 0.00958251953125, 0.01165771484375, 0.01226806640625, 0.0135498046875, 0.00537109375, 0.01904296875, -0.0260009765625, 0.00433349609375, 0.00579833984375, 0.0172119140625, 0.005126953125, 0....	[ 11249, 831, 87, 74481, 67, 5127, 454, 14, 1369, 39, 8353, 19, 1328, 1556, 142508, 10554, 5357, 44401, 82424, 31577, 25632, 27781, 757, 106, 5608, 30646, 33306, 116, 6, 44691 ]	[ 0.0855712890625, 0.06304931640625, 0.0303497314453125, 0.1905517578125, 0.05126953125, 0.1591796875, 0.050048828125, 0.157470703125, 0.0284423828125, 0.1378173828125, 0.060272216796875, 0.1309814453125, 0.197509765625, 0.10150146484375, 0.1983642578125, 0.18994140625, 0.263427734375,...	embed
1960657_c0	1960657	haskell	0	Title: Haskell type cast problem Problem title: Haskell type cast problem Tags: types, haskell, casting Problem: Haskell type cast problem Example code: fac :: Int → Int fac 0 = 1 fac n = n * fac (n-1) main = do putStrLn show fac 10 Error: Couldnt match expected type 'String' against inferred type 'a -> String' In the ...	Haskell type cast problem Haskell type cast problem types haskell casting Haskell n-1 Couldnt Haskell type cast problem Example code: Error:	[ -0.00015544891357421875, 0.00174713134765625, 0.004119873046875, 0.032958984375, 0.00445556640625, -0.0177001953125, -0.006805419921875, 0.0020599365234375, -0.00543212890625, -0.0029449462890625, -0.009521484375, -0.0380859375, -0.00958251953125, 0.0019073486328125, -0.007598876953125, ...	[ 20625, 142508, 10644, 37702, 2967, 52895, 1556, 176050, 653, 5759, 191147, 660, 89536, 18151, 212059, 12 ]	[ 0.1480712890625, 0.2149658203125, 0.201171875, 0.185302734375, 0.191162109375, 0.1805419921875, 0.136962890625, 0.1680908203125, 0.06719970703125, 0.1334228515625, 0.1158447265625, 0.1236572265625, 0.128173828125, 0.129150390625, 0.1947021484375, 0.0216522216796875 ]	embed
72390984_c0	72390984	haskell	0	Title: Confusion about data types in Haskell Problem title: Confusion about data types in Haskell Tags: types, haskell Problem: Confusion about data types in Haskell I have to write a simple pi approximation and I did and it works fine, but in the task it says to write a function with the header "pi_approx :: Int -> Do...	Confusion about data types in Haskell Confusion about data types in Haskell types haskell Confusion Haskell pi_approx pi2_approx x-1 Double Confusion about data types in Haskell I have to write a simple pi approximation and I did and it works fine, but in the task it says to write a function with the header "pi_approx ...	[ 0.0130615234375, -0.006072998046875, 0.008056640625, 0.006256103515625, 0.0040283203125, 0.00860595703125, -0.003265380859375, -0.0233154296875, 0.0020599365234375, 0.0135498046875, -0.0045166015625, -0.0201416015625, 0.01495361328125, 0.0037994384765625, 0.006195068359375, 0.006134033...	[ 1657, 92105, 1672, 2053, 52895, 23, 20625, 142508, 1556, 2147, 2631, 64101, 304, 1022, 5759, 107172, 33022, 8781, 35707, 53950, 43240, 5885, 66211, 17378, 32354, 10336, 1434, 1984, 360, 33079, 18151, 15490, 9790, 4527, 21635, 11343, 10644, 18...	[ 0.060302734375, 0.221435546875, 0.050872802734375, 0.1639404296875, 0.266845703125, 0.021392822265625, 0.156982421875, 0.2734375, 0.1298828125, 0.2298583984375, 0.07318115234375, 0.2529296875, 0.1761474609375, 0.082275390625, 0.160888671875, 0.27880859375, 0.0887451171875, 0.089294...	embed
27630269_c0	27630269	haskell	0	Title: Parsing function application with Happy Problem title: Parsing function application with Happy Tags: parsing, haskell, happy Problem: Parsing function application with Happy How would I parse something like f x y Into APPLY (APPLY f x) y using Happy? Right now I have a rule that says %left APP Expr : Expr Expr %...	Parsing function application with Happy Parsing function application with Happy parsing haskell happy Parsing Happy APPLY APP Expr Parsing function application with Happy How would I parse something like Into using Happy? Right now I have a rule that says But that parses the above as	[ 0.0184326171875, -0.006134033203125, 0.021240234375, 0.0196533203125, -0.0147705078125, 0.02392578125, -0.0045166015625, -0.0096435546875, 0.0257568359375, -0.0086669921875, 0.01373291015625, -0.0164794921875, -0.01318359375, 0.0030364990234375, 0.013671875, 0.00933837890625, -0.0040...	[ 2392, 6953, 32354, 38415, 678, 32506, 366, 1556, 142508, 17723, 66440, 19917, 60075, 42, 2806, 184, 9844, 1884, 360, 188, 17368, 5036, 79986, 5908, 36917, 237 ]	[ 0.1766357421875, 0.144775390625, 0.175048828125, 0.1656494140625, 0.1312255859375, 0.25390625, 0.1795654296875, 0.08740234375, 0.1810302734375, 0.1856689453125, 0.171875, 0.1380615234375, 0.062255859375, 0.0648193359375, 0.033355712890625, 0.134033203125, 0.034698486328125, 0.05142...	embed
70812567_c0	70812567	haskell	0	Title: Quasiquotes escaping Problem title: Quasiquotes escaping Tags: quasiquotes, haskell, megaparsec, parsec Problem: Quasiquotes escaping I would like to add my new language to Haskell using the Quasiquotes, but the language itself uses \|] as a keyword. Is there some way, how to: a) Escape \|] , so it is passed to my...	Quasiquotes escaping Quasiquotes escaping quasiquotes haskell megaparsec parsec Quasiquotes Quasiquotes escaping I would like to add my new language to Haskell using the Quasiquotes, but the language itself uses \|] as a keyword. Is there some way, how to: a) Escape \|] , so it is passed to my language b) Let the parser ...	[ 0.01458740234375, 0.01324462890625, 0.00811767578125, 0.00133514404296875, -0.031982421875, 0.0106201171875, -0.01220703125, 0.0001373291015625, -0.0140380859375, -0.004608154296875, -0.002960205078125, -0.004638671875, 0.009765625, 0.00225830078125, 0.0191650390625, -0.0101318359375, ...	[ 19559, 172, 68726, 7, 38940, 10366, 12404, 1556, 142508, 31534, 2500, 39797, 366, 1884, 15190, 3525, 46876, 47, 20625, 17368, 1284, 68034, 4527, 58745, 268, 237, 10, 166117, 3060, 3917, 3642, 16, 181540, 115081, 876, 10842, 2189, 28288, 322...	[ 0.1806640625, 0.188720703125, 0.246826171875, 0.05999755859375, 0.1990966796875, 0.1507568359375, 0.24951171875, 0.1444091796875, 0.265625, 0.1239013671875, 0.0936279296875, 0.1705322265625, 0.108154296875, 0.054779052734375, 0.1400146484375, 0.07745361328125, 0.2188720703125, 0.08...	embed
74187378_c0	74187378	haskell	0	Title: Pattern Maching IO variables in haskell Problem title: Pattern Maching IO variables in haskell Tags: monads, haskell, io Problem: Pattern Maching IO variables in haskell Currently I have a function getFP :: IO [String] -> Maybe (FilePath) . What I want to do is something equivalent for getFP [] = Nothing if the ...	Pattern Maching IO variables in haskell Pattern Maching IO variables in haskell monads haskell io Pattern Maching Maybe FilePath Nothing Pattern Maching IO variables in haskell Currently I have a function getFP :: IO [String] -> Maybe (FilePath) . What I want to do is something equivalent for getFP [] = Nothing if the ...	[ -0.007232666015625, -0.0002536773681640625, -0.00101470947265625, 0.002471923828125, -0.004638671875, 0.00677490234375, -0.00002181529998779297, -0.0011138916015625, 0.008544921875, 0.00885009765625, 0.0267333984375, -0.034912109375, -0.00836181640625, -0.016357421875, 0.001800537109375,...	[ 9876, 22766, 60154, 214, 17780, 77336, 23, 1556, 142508, 2667, 712, 22995, 83425, 42724, 683, 10519, 182747, 32354, 2046, 51006, 1984, 71713, 33079, 174350, 3444, 183234, 378, 2203, 2174, 10750, 509, 351, 79315 ]	[ 0.1607666015625, 0.1138916015625, 0.177734375, 0.09228515625, 0.2093505859375, 0.2288818359375, 0.011474609375, 0.1566162109375, 0.237548828125, 0.05023193359375, 0.08074951171875, 0.177734375, 0.275390625, 0.1729736328125, 0.10791015625, 0.1734619140625, 0.198974609375, 0.13391113...	embed
42612107_c0	42612107	haskell	0	Title: Implicit pattern matching in Haskell Problem title: Implicit pattern matching in Haskell Tags: performance, pattern-matching, haskell Problem: Implicit pattern matching in Haskell Should one expect performance differences between these two empty s, or is it merely a matter of stylistic preference? foo list = cas...	Implicit pattern matching in Haskell Implicit pattern matching in Haskell performance pattern-matching haskell Implicit Haskell Implicit pattern matching in Haskell Should one expect performance differences between these two empty s, or is it merely a matter of stylistic preference?	[ 0.003570556640625, 0.0052490234375, -0.00537109375, -0.0030517578125, -0.00390625, -0.00152587890625, -0.0274658203125, -0.0126953125, 0.02197265625, 0.005279541015625, 0.039306640625, 0.0135498046875, -0.01019287109375, 0.0067138671875, 0.0013885498046875, -0.00701904296875, 0.00491...	[ 29128, 60923, 103510, 14858, 20625, 142508, 214, 23718, 98753, 1556, 41206, 60212, 6626, 201505, 91, 182352, 205537 ]	[ 0.1259765625, 0.211181640625, 0.20703125, 0.178955078125, 0.10772705078125, 0.215576171875, 0.0056304931640625, 0.1864013671875, 0.179931640625, 0.11065673828125, 0.09552001953125, 0.12274169921875, 0.033721923828125, 0.2232666015625, 0.1502685546875, 0.12646484375, 0.11224365234375 ...	embed
3848492_c0	3848492	haskell	0	Title: Advantages of subtyping over typeclasses Problem title: Advantages of subtyping over typeclasses Tags: haskell, oop, programming-languages, functional-programming, scala Problem: Advantages of subtyping over typeclasses What are the advantages of OOP subtyping over typeclasses, if any? In other words, now that w...	Advantages of subtyping over typeclasses Advantages of subtyping over typeclasses haskell oop programming-languages functional-programming scala Advantages Advantages of subtyping over typeclasses What are the advantages of OOP subtyping over typeclasses, if any? In other words, now that we have typeclasses, is there a...	[ 0.000484466552734375, 0.0010986328125, 0.021240234375, -0.00101470947265625, 0.0003833770751953125, -0.01513671875, -0.0140380859375, 0.01129150390625, 0.0162353515625, -0.00396728515625, -0.022705078125, -0.0206298828125, 0.00750732421875, 0.00836181640625, -0.01190185546875, -0.01007...	[ 3145, 2187, 92674, 111, 1614, 46280, 214, 645, 10644, 67413, 1556, 142508, 32500, 56037, 449, 196651, 123309, 28966, 146232, 4865, 621, 70, 92940, 7, 180, 20880, 90, 2174, 2499, 5036, 765, 31635, 7464, 4527, 87, 444, 10, 152653, 11, 77848...	[ 0.0802001953125, 0.1527099609375, 0.138916015625, 0.043731689453125, 0.2244873046875, 0.2413330078125, 0.129150390625, 0.1236572265625, 0.18603515625, 0.22216796875, 0.0831298828125, 0.209228515625, 0.18994140625, 0.0892333984375, 0.012786865234375, 0.1136474609375, 0.12744140625, ...	embed
31680573_c0	31680573	haskell	0	Title: How can I install a recent version of the Haskell GHC compiler on Ubuntu? Problem title: How can I install a recent version of the Haskell GHC compiler on Ubuntu? Tags: haskell, ghc Problem: How can I install a recent version of the Haskell GHC compiler on Ubuntu? I noticed that I'm running an old version of GHC...	How can I install a recent version of the Haskell GHC compiler on Ubuntu? How can I install a recent version of the Haskell GHC compiler on Ubuntu? haskell ghc How Haskell GHC Ubuntu How can I install a recent version of the Haskell GHC compiler on Ubuntu? I noticed that I'm running an old version of GHC on Ubuntu 15.0...	[ -0.0004329681396484375, 0.01043701171875, 0.0263671875, -0.0135498046875, 0.00140380859375, 0.0177001953125, -0.0137939453125, -0.0284423828125, -0.0079345703125, 0.01239013671875, -0.003997802734375, -0.043701171875, 0.0164794921875, 0.009521484375, 0.003082275390625, 0.00552368164062...	[ 11249, 831, 87, 20600, 17309, 11389, 20625, 142508, 527, 73265, 9969, 34759, 98, 116890, 70, 1556, 31380, 238, 111, 156672, 51042, 10332, 6281, 39876, 2046, 3525, 56, 1632, 15490, 19441, 1340, 442, 1295, 31344 ]	[ 0.065185546875, 0.08807373046875, 0.045135498046875, 0.1656494140625, 0.1048583984375, 0.1109619140625, 0.1544189453125, 0.261962890625, 0.11181640625, 0.2496337890625, 0.15673828125, 0.1710205078125, 0.10540771484375, 0.2147216796875, 0.02178955078125, 0.12109375, 0.1021728515625, ...	embed
56095383_c0	56095383	haskell	0	Title: (new to haskell) if statment generating parse error Problem title: (new to haskell) if statment generating parse error Tags: haskell Problem: (new to haskell) if statment generating parse error I want the function to create a list of a tuple if the condition applies but it doesnt seem to be working. (I'm new to ...	(new to haskell) if statment generating parse error (new to haskell) if statment generating parse error haskell (new to haskell) if statment generating parse error I want the function to create a list of a tuple if the condition applies but it doesnt seem to be working. (I'm new to haskell)	[ 0.0244140625, 0.0031280517578125, -0.0247802734375, -0.0037994384765625, 0.0135498046875, 0.01416015625, 0.00494384765625, -0.0036773681640625, 0.01434326171875, 0.0294189453125, 0.0213623046875, 0.00506591796875, 0.0234375, 0.000370025634765625, -0.00029754638671875, 0.01361083984375,...	[ 54936, 47, 1556, 142508, 2174, 13254, 674, 12663, 1916, 366, 184, 18499, 3444, 32354, 28282, 5303, 111, 370, 8705, 35431, 4027, 25720, 22027, 18, 48903, 20697, 3525 ]	[ 0.11669921875, 0.046356201171875, 0.1322021484375, 0.1884765625, 0.1380615234375, 0.22607421875, 0.1563720703125, 0.1612548828125, 0.072021484375, 0.13720703125, 0.0999755859375, 0.2021484375, 0.063232421875, 0.1451416015625, 0.1243896484375, 0.1473388671875, 0.04278564453125, 0.10...	embed
11274864_c0	11274864	haskell	0	Title: What does 'qualified' mean in 'import qualified Data.List' statement? Problem title: What does 'qualified' mean in 'import qualified Data.List' statement? Tags: haskell Problem: What does 'qualified' mean in 'import qualified Data.List' statement? I understand import Data....	What does 'qualified' mean in 'import qualified Data.List' statement? What does 'qualified' mean in 'import qualified Data.List' statement? haskell qualified Data.List What What does 'qualified' mean in 'import qualified Data.List' statement? I understand import Data.List . But w...	[ 0.009521484375, 0.00787353515625, 0.0185546875, 0.0084228515625, 0.0052490234375, 0.01611328125, 0.0167236328125, 0.0087890625, 0.00408935546875, 0.0303955078125, -0.00017547607421875, -0.0303955078125, 0.0057373046875, -0.0030059814453125, -0.0286865234375, 0.00970458984375, 0.00244...	[ 4865, 14602, 3768, 71723, 47314, 54764, 29459, 60270, 217225, 11809, 154663, 63805, 23, 1556, 142508, 242, 25, 5, 87, 28219, 24927, 4966, 2367 ]	[ 0.0799560546875, 0.087158203125, 0.1015625, 0.1864013671875, 0.270751953125, 0.01446533203125, 0.15087890625, 0.2301025390625, 0.28369140625, 0.1475830078125, 0.1939697265625, 0.19873046875, 0.05865478515625, 0.1256103515625, 0.2105712890625, 0.00775146484375, 0.0273590087890625, 0...	embed
17951915_c1	17951915	haskell	1	ToTuple = proc tree -> do desc <- aDesc -< tree display <- aDisp -< tree plist <- aPlist -< tree returnA -< (desc, display, plist) tx3 = map (\i -> runLA aToTuple i) tx1 It all falls in a big heap. What am I missing with the conversion to proc/do notation? Thanks. Code signals: Text.XML.HXT.Arrow.ReadDocument, Text.XML...	ToTuple = proc tree -> do desc <- aDesc -< tree display <- aDisp -< tree plist <- aPlist -< tree returnA -< (desc, display, plist) tx3 = map (\i -> runLA aToTuple i) tx1 It all falls in a big heap. What am I missing with the conversion to proc/do notation? Thanks. Code signals: Text.XML.HXT.Arrow.ReadDocument, Text.XML...	[ 0.000873565673828125, 0.0164794921875, -0.013671875, -0.0208740234375, 0.00341796875, 0.00958251953125, -0.01422119140625, -0.00897216796875, 0.0216064453125, -0.0267333984375, -0.003936767578125, 0.0164794921875, -0.00714111328125, 0.0279541015625, 0.01312255859375, -0.00994873046875,...	[ 717, 15665, 8705, 2203, 10402, 53201, 54, 224, 238, 10, 6964, 44116, 254, 4655, 271, 6562, 30646, 284, 988, 808, 425, 363, 22288, 11675, 8356, 7763, 17, 418, 756, 123867, 764, 2631, 132283, 142477, 47, 64, 246, 110, 22062, 28864, 26073,...	[ 0.17724609375, 0.1258544921875, 0.2548828125, 0.0494384765625, 0.2423095703125, 0.2196044921875, 0.13427734375, 0.1728515625, 0.050811767578125, 0.0272674560546875, 0.06939697265625, 0.1241455078125, 0.0159912109375, 0.08056640625, 0.0523681640625, 0.1539306640625, 0.042388916015625,...	embed
39553257_c0	39553257	haskell	0	Title: Use of putStrLn to show result Problem title: Use of putStrLn to show result Tags: haskell Problem: Use of putStrLn to show result I am using the Idone.com site and wanted to run this code but do not know the syntax putStrLn to compile from stdin Use this code but strip error. main = putStrLn (show (sumaCifras x...	Use of putStrLn to show result Use of putStrLn to show result haskell Use Use of putStrLn to show result I am using the Idone.com site and wanted to run this code but do not know the syntax putStrLn to compile from stdin Use this code but strip error.	[ 0.00125885009765625, 0.00836181640625, 0.0006866455078125, 0.01202392578125, 0.0067138671875, 0.0279541015625, 0.00102996826171875, 0.0012969970703125, 0.0057373046875, -0.0284423828125, -0.011474609375, -0.037109375, -0.0244140625, 0.01275634765625, 0.002593994140625, 0.00759887695312...	[ 36836, 111, 3884, 71713, 866, 19, 47, 7639, 16750, 1556, 142508, 87, 64007, 277, 11675, 18151, 3714, 6002, 86531, 9969, 1340, 1295, 6138, 3035, 1284, 43613, 18499 ]	[ 0.09161376953125, 0.026336669921875, 0.1993408203125, 0.2486572265625, 0.1640625, 0.1435546875, 0.0269012451171875, 0.1566162109375, 0.2039794921875, 0.122802734375, 0.21240234375, 0.006801605224609375, 0.1568603515625, 0.018035888671875, 0.052886962890625, 0.09979248046875, 0.017257...	embed
20659810_c0	20659810	haskell	0	Title: Haskell: Int to Char Problem title: Haskell: Int to Char Tags: haskell Problem: Haskell: Int to Char I am using the function fromEnum to convert a character to its corresponding ASCII Int. For example: fromEnum 'A' returns 65. Now, assuming I had a function that did: (fromEnum 'A')+1 And then wanted to convert t...	Haskell: Int to Char Haskell: Int to Char haskell Haskell Char Haskell: Int to Char I am using the function fromEnum to convert a character to its corresponding ASCII Int. For example: returns 65. Now, assuming I had a function that did: And then wanted to convert the returned value (66) to a Char which would be 'B'. W...	[ -0.000827789306640625, 0.003814697265625, 0.0286865234375, 0.025390625, 0.00537109375, 0.0213623046875, -0.0018310546875, -0.03076171875, -0.020263671875, 0.014892578125, 0.0111083984375, -0.0302734375, -0.00095367431640625, 0.045654296875, -0.0177001953125, -0.0108642578125, 0.00135...	[ 20625, 142508, 12, 360, 18, 47, 21656, 1556, 87, 17368, 32354, 1295, 647, 2606, 96760, 62816, 42518, 125429, 10001, 27781, 30646, 5684, 66596, 36663, 176377, 34292, 84308, 10, 2806, 571, 2965, 3917, 20594, 221, 22362 ]	[ 0.1436767578125, 0.2509765625, 0.039398193359375, 0.15380859375, 0.20751953125, 0.146728515625, 0.244873046875, 0.153076171875, 0.008941650390625, 0.0850830078125, 0.1614990234375, 0.1710205078125, 0.10009765625, 0.28369140625, 0.18896484375, 0.1971435546875, 0.059326171875, 0.0781...	embed
78523216_c0	78523216	haskell	0	Title: Finding the type of functions Problem title: Finding the type of functions Tags: haskell, types Problem: Finding the type of functions I have a problem regarding finding the type in Haskell. The question is as follows: Find the type of uncurry curry Does anyone know a way to find the type? The answer should be (...	Finding the type of functions Finding the type of functions haskell types Finding Finding the type of functions I have a problem regarding finding the type in Haskell. The question is as follows: Does anyone know a way to find the type? The answer should be ((b1, b2) -> c, b1) -> b2 -> c . I know I can use :t to find t...	[ 0.0031890869140625, -0.01318359375, 0.003387451171875, 0.01019287109375, -0.01019287109375, 0.002410888671875, -0.01031494140625, -0.0177001953125, 0.003021240234375, -0.036865234375, 0.00750732421875, -0.050048828125, -0.002227783203125, 0.004486083984375, -0.0029296875, -0.0024719238...	[ 26040, 214, 70, 10644, 111, 32354, 7, 1556, 142508, 52895, 87, 765, 2967, 90791, 23, 20625, 9655, 28960, 101790, 35672, 3714, 3917, 47, 7413, 35166, 5608, 186, 60494, 275, 418, 4, 876, 10461, 33079, 501, 17727, 304, 6, 831, 4527, 152, ...	[ 0.1336669921875, 0.040008544921875, 0.1072998046875, 0.2489013671875, 0.1004638671875, 0.213623046875, 0.0584716796875, 0.1690673828125, 0.259765625, 0.2276611328125, 0.007110595703125, 0.0221099853515625, 0.08544921875, 0.1456298828125, 0.07012939453125, 0.1717529296875, 0.028839111...	embed
58582514_c0	58582514	haskell	0	Title: Haskell .hs files turning into .hi files? Problem title: Haskell .hs files turning into .hi files? Tags: haskell Problem: Haskell .hs files turning into .hi files? I just installed an application that has a number of .hs Haskell files https://github.com/tidalcycles/Tidal/tree/master/src/Sound/Tidal After install...	Haskell .hs files turning into .hi files? Haskell .hs files turning into .hi files? haskell Haskell Haskell .hs files turning into .hi files? I just installed an application that has a number of .hs Haskell files https://github.com/tidalcycles/Tidal/tree/master/src/Sound/Tidal After installation via cabal, all of the ....	[ 0.0033721923828125, -0.01495361328125, 0.017333984375, 0.00156402587890625, -0.01055908203125, 0.0016632080078125, -0.01019287109375, 0.0034332275390625, -0.01043701171875, 0.021728515625, -0.0034332275390625, -0.0247802734375, -0.01068115234375, 0.003997802734375, 0.005279541015625, 0...	[ 20625, 142508, 5, 127, 7, 102158, 174548, 3934, 979, 1556, 20600, 38415, 14012, 15769, 32102, 118, 2465, 75457, 16734, 62600, 47327, 19437, 8912, 7030, 59720, 1829, 109524, 756, 621, 14602, 47 ]	[ 0.1473388671875, 0.232177734375, 0.044281005859375, 0.1759033203125, 0.1644287109375, 0.212646484375, 0.11181640625, 0.0762939453125, 0.2213134765625, 0.112060546875, 0.1041259765625, 0.1265869140625, 0.032135009765625, 0.07794189453125, 0.1292724609375, 0.07379150390625, 0.133666992...	embed
6320424_c0	6320424	haskell	0	Title: Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? Problem title: Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? Tags: operator-precedence, haskell Problem: Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? I want to know why Hask...	Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? operator-precedence haskell Why Haskell Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? I want to know why Haskell designers agreed to al...	[ 0.00390625, 0.000751495361328125, 0.007171630859375, 0.0159912109375, 0.01611328125, 0.0025177001953125, -0.0079345703125, -0.01214599609375, -0.00286865234375, -0.01092529296875, 0.0027313232421875, -0.0218505859375, 0.00830078125, -0.00189208984375, 0.0002765655517578125, 0.000196456...	[ 44084, 20625, 142508, 107671, 6620, 765, 4734, 209, 90926, 2071, 26366, 20174, 111, 39933, 4692, 37534, 1556, 14602, 15400, 51517, 176506, 63769, 129980 ]	[ 0.1064453125, 0.1527099609375, 0.250732421875, 0.21142578125, 0.145751953125, 0.068603515625, 0.1258544921875, 0.1934814453125, 0.26220703125, 0.0020751953125, 0.1865234375, 0.1251220703125, 0.01031494140625, 0.1727294921875, 0.1160888671875, 0.158203125, 0.13134765625, 0.036560058...	embed
68695059_c0	68695059	haskell	0	Title: What does the asterisk in (x) do in Haskell? Problem title: What does the asterisk in (x) do in Haskell? Tags: haskell, operators Problem: What does the asterisk in (x) do in Haskell? I'm new to Haskell, can someone please explain to me how this code works? f = g (\x -> x) g k [] = k 100 g k (x:xs) = g ((x) ...	What does the asterisk in (x) do in Haskell? What does the asterisk in (x) do in Haskell? haskell operators What Haskell x:xs What does the asterisk in (x*) do in Haskell? I'm new to Haskell, can someone please explain to me how this code works? When I call f [1..5] it returns 12000. I don't understand why. What does...	[ 0.01019287109375, 0.0034637451171875, 0.0189208984375, -0.0162353515625, 0.00714111328125, 0.0167236328125, 0.0040283203125, 0.00005698204040527344, 0.022216796875, -0.0164794921875, 0.0194091796875, -0.0179443359375, -0.003997802734375, 0.01007080078125, -0.0120849609375, -0.015075683...	[ 4865, 14602, 10, 1515, 6581, 23, 425, 77518, 54, 20625, 142508, 1556, 39933, 1022, 12, 7, 70, 3525, 47, 831, 22936, 73342, 3642, 903, 18151, 43240, 11782, 1238, 68252, 5, 758, 30646, 106, 13821, 2301, 28219, 15400 ]	[ 0.06427001953125, 0.055877685546875, 0.060943603515625, 0.1397705078125, 0.2113037109375, 0.06927490234375, 0.1558837890625, 0.2120361328125, 0.100830078125, 0.1341552734375, 0.2457275390625, 0.10565185546875, 0.12646484375, 0.121826171875, 0.038238525390625, 0.0261077880859375, 0.00...	embed
64706590_c1	64706590	haskell	1	626e8] *Main> The approximations to the nth derivative of e^x\|x=0 are: [1.0,1.0000004999621837,1.000088900582341,-222.0446049250313,4.440892098500626e8] The first and 2nd derivatives are perfectly reasonable approximations given the setup, but suddenly, the third derivative of func at 0 is... -222.0446049250313 ! HOW!!...	626e8] *Main> The approximations to the nth derivative of e^x\|x=0 are: [1.0,1.0000004999621837,1.000088900582341,-222.0446049250313,4.440892098500626e8] The first and 2nd derivatives are perfectly reasonable approximations given the setup, but suddenly, the third derivative of func at 0 is... -222.0446049250313 ! HOW!!...	[ 0.009033203125, -0.0002384185791015625, 0.005615234375, -0.0250244140625, 0.01422119140625, 0.01904296875, 0.0003986358642578125, 0.0001773834228515625, 0.021240234375, -0.0030059814453125, -0.0181884765625, 0.01397705078125, 0.0079345703125, 0.00836181640625, -0.006072998046875, 0.009...	[ 305, 4046, 13, 1019, 168793, 35707, 53950, 21094, 47, 653, 927, 30057, 4935, 28, 8353, 425, 58745, 145407, 621, 102107, 146533, 28568, 12977, 185245, 180882, 4, 5, 12772, 8894, 9, 132537, 159937, 24291, 5016, 82449, 141929, 183642, 5117, 13...	[ 0.086669921875, 0.2138671875, 0.03564453125, 0.13916015625, 0.1192626953125, 0.146240234375, 0.233154296875, 0.0777587890625, 0.10003662109375, 0.191650390625, 0.212890625, 0.2587890625, 0.177978515625, 0.1614990234375, 0.1539306640625, 0.1575927734375, 0.06732177734375, 0.22985839...	embed
24684363_c0	24684363	haskell	0	Title: How to reduce boilerplate dealing with Maybe and lists? Problem title: How to reduce boilerplate dealing with Maybe and lists? Tags: haskell Problem: How to reduce boilerplate dealing with Maybe and lists? Is there a cleaner way to compose functions producing lists with other producing Maybe s? import Text.Feed....	How to reduce boilerplate dealing with Maybe and lists? How to reduce boilerplate dealing with Maybe and lists? haskell Text.Feed.Query How Maybe How to reduce boilerplate dealing with Maybe and lists? Is there a cleaner way to compose functions producing lists with other producing Maybe s?	[ -0.01055908203125, -0.00811767578125, 0.0130615234375, 0.00909423828125, 0.00799560546875, 0.0014190673828125, 0.004547119140625, -0.00543212890625, 0.00213623046875, -0.022705078125, 0.0035552978515625, -0.00408935546875, 0.005615234375, 0.006866455078125, 0.0064697265625, -0.01892089...	[ 11249, 34390, 337, 34759, 92558, 184017, 83425, 136, 5303, 678, 1556, 142508, 24129, 30154, 297, 41732, 1294, 47, 46622, 56, 3917, 150350, 32354, 27024, 3789, 91 ]	[ 0.115478515625, 0.21240234375, 0.106689453125, 0.1309814453125, 0.243408203125, 0.1131591796875, 0.28173828125, 0.05926513671875, 0.2049560546875, 0.07025146484375, 0.119873046875, 0.198974609375, 0.160400390625, 0.157470703125, 0.091064453125, 0.072021484375, 0.01174163818359375, ...	embed
2741768_c0	2741768	haskell	0	Title: How do you make this Haskell power function tail recursive? Problem title: How do you make this Haskell power function tail recursive? Tags: tail-recursion, haskell Problem: How do you make this Haskell power function tail recursive? How would I make this Haskell power function tail recursive? turboPower a 0 = 1...	How do you make this Haskell power function tail recursive? How do you make this Haskell power function tail recursive? tail-recursion haskell How Haskell b-1 How do you make this Haskell power function tail recursive? How would I make this Haskell power function tail recursive?	[ 0.004364013671875, -0.005523681640625, 0.029052734375, 0.006317138671875, 0.00677490234375, 0.0164794921875, -0.0164794921875, -0.0203857421875, 0.00086212158203125, 0.005615234375, 0.004974365234375, 0.004241943359375, 0.0037384033203125, 0.0169677734375, 0.0185546875, -0.004638671875...	[ 11249, 3249, 903, 20625, 142508, 14537, 32354, 46741, 195625, 5844, 54, 107, 48650, 1830, 1556, 876, 5759 ]	[ 0.0745849609375, 0.08599853515625, 0.04217529296875, 0.1339111328125, 0.20849609375, 0.1539306640625, 0.142822265625, 0.26171875, 0.214111328125, 0.1505126953125, 0.017333984375, 0.08087158203125, 0.153076171875, 0.0679931640625, 0.135986328125, 0.0858154296875, 0.1339111328125 ]	embed
42015459_c0	42015459	haskell	0	Title: Haskell !! operator combination Problem title: Haskell !! operator combination Tags: haskell Problem: Haskell !! operator combination In the following code, what does m!!i!!j stand for? Any examples will be helpful. matrixElements :: [[t]] -> [t] matrixElements m = [m!!i!!j \| i<-[0..length m - 1], j<-[0..length(...	Haskell !! operator combination Haskell !! operator combination haskell Haskell Haskell !! operator combination In the following code, what does m!!i!!j stand for? Any examples will be helpful.	[ -0.00958251953125, 0.00762939453125, 0.00958251953125, -0.004974365234375, 0.0174560546875, 0.01531982421875, -0.003814697265625, 0.005096435546875, 0.003662109375, -0.00885009765625, 0.0201416015625, -0.00130462646484375, 0.0177001953125, -0.0142822265625, -0.0303955078125, -0.0030212...	[ 20625, 142508, 6506, 39933, 162515, 1556, 360, 25632, 18151, 2367, 14602, 347, 1146, 14, 170, 9157, 100, 27781, 7, 98893 ]	[ 0.173828125, 0.2301025390625, 0.208984375, 0.1865234375, 0.180908203125, 0.147705078125, 0.03643798828125, 0.10394287109375, 0.1368408203125, 0.0924072265625, 0.089111328125, 0.1837158203125, 0.235595703125, 0.2200927734375, 0.250244140625, 0.1356201171875, 0.12109375, 0.0970458984...	embed
48669145_c1	48669145	haskell	1	&& head xs == 'i' && not (head (tail xs) == 'i') = (Si (f xs)) \| x == 'Y' = (Y (f xs)) \| x == 'O' = (O (f xs)) \| x == 'N' && head xs == 'o' = (O (f xs)) The function aims to create an FProp from a String, being its type [Char] -> FProp . The problem is that I do not come up with the base case of this recursive functio...	&& head xs == 'i' && not (head (tail xs) == 'i') = (Si (f xs)) \| x == 'Y' = (Y (f xs)) \| x == 'O' = (O (f xs)) \| x == 'N' && head xs == 'o' = (O (f xs)) The function aims to create an FProp from a String, being its type [Char] -> FProp . The problem is that I do not come up with the base case of this recursive functio...	[ 0.000152587890625, -0.00946044921875, -0.010498046875, 0.005157470703125, -0.0035552978515625, 0.00106048583984375, 0.0196533203125, -0.01153564453125, 0.0289306640625, 0.0174560546875, 0.0179443359375, -0.0255126953125, -0.0018768310546875, -0.003814697265625, -0.00946044921875, 0.000...	[ 619, 1230, 10336, 1022, 7, 69112, 14, 959, 31251, 46741, 8859, 420, 1723, 670, 839, 31, 32354, 131264, 28282, 563, 10752, 254, 1295, 23351, 214, 8035, 10644, 84068, 33079, 2967, 1380, 1257, 3647, 7225, 195625, 5844, 5809, 54, 2174, 2046, ...	[ 0.0279541015625, 0.1064453125, 0.2169189453125, 0.15625, 0.091796875, 0.1256103515625, 0.1114501953125, 0.1552734375, 0.190185546875, 0.2027587890625, 0.1778564453125, 0.0615234375, 0.08349609375, 0.149658203125, 0.060333251953125, 0.1563720703125, 0.171875, 0.1470947265625, 0.10...	embed
63404026_c0	63404026	haskell	0	Title: In Haskell, what is the result of a infinite multiplication of 1 by itself? Problem title: In Haskell, what is the result of a infinite multiplication of 1 by itself? Tags: haskell Problem: In Haskell, what is the result of a infinite multiplication of 1 by itself? In the following example, why any optimization ...	In Haskell, what is the result of a infinite multiplication of 1 by itself? In Haskell, what is the result of a infinite multiplication of 1 by itself? haskell Haskell CInterrupted In Haskell, what is the result of a infinite multiplication of 1 by itself? In the following example, why any optimization that evaluates t...	[ -0.007293701171875, -0.0027923583984375, 0.01483154296875, 0.007354736328125, -0.027587890625, -0.01177978515625, -0.00186920166015625, -0.0203857421875, -0.003265380859375, -0.043701171875, -0.003143310546875, 0.0186767578125, 0.00023365020751953125, 0.00823974609375, 0.0018463134765625...	[ 360, 20625, 142508, 2367, 83, 16750, 54241, 13, 127664, 1363, 106, 390, 68034, 111, 1556, 313, 44851, 9167, 3674, 27781, 15400, 87235, 151575, 47, 90698, 214552 ]	[ 0.03472900390625, 0.1475830078125, 0.2432861328125, 0.033050537109375, 0.0283355712890625, 0.16650390625, 0.1915283203125, 0.07073974609375, 0.19482421875, 0.0462646484375, 0.1297607421875, 0.10205078125, 0.1640625, 0.0184326171875, 0.1142578125, 0.019256591796875, 0.04010009765625, ...	embed
36804300_c0	36804300	haskell	0	Title: Pattern match using smart constructor Problem title: Pattern match using smart constructor Tags: haskell Problem: Pattern match using smart constructor Is there a way to pattern match smart constructors, outside of its module? Something like this: import MyModule (thing) fn (thing 3) = True without being able to...	Pattern match using smart constructor Pattern match using smart constructor haskell smart MyModule Pattern Thing Pattern match using smart constructor Is there a way to pattern match smart constructors, outside of its module? Something like this: without being able to write this: where thing is a smart constructor for ...	[ -0.02197265625, 0.0179443359375, 0.0037994384765625, -0.004302978515625, -0.000835418701171875, 0.021484375, -0.013671875, 0.01806640625, 0.01068115234375, -0.050537109375, 0.0157470703125, 0.01275634765625, 0.00148773193359375, 0.00024318695068359375, 0.0126953125, -0.013916015625, ...	[ 9876, 22766, 14858, 17368, 18775, 64549, 748, 1556, 142508, 2646, 91616, 8782, 6003, 214, 2685, 10, 3917, 47, 103510, 25251, 50782, 111, 6863, 88996, 1884, 15490, 33022, 7440, 13580, 83, 100 ]	[ 0.161865234375, 0.1494140625, 0.2486572265625, 0.0750732421875, 0.1932373046875, 0.186279296875, 0.151123046875, 0.10089111328125, 0.1551513671875, 0.09161376953125, 0.048065185546875, 0.06927490234375, 0.09539794921875, 0.11407470703125, 0.0164031982421875, 0.0179595947265625, 0.074...	embed
14695894_c0	14695894	haskell	0	Title: Haskell: Show all the elements that are "showable" on a Hlist Problem title: Haskell: Show all the elements that are "showable" on a Hlist Tags: haskell, reflection, hlist Problem: Haskell: Show all the elements that are "showable" on a Hlist I have tried map show . mapMaybe fromDynamic $ [to...	Haskell: Show all the elements that are "showable" on a Hlist Haskell: Show all the elements that are "showable" on a Hlist haskell reflection hlist Haskell Show Hlist x::Integer Haskell: Show all the elements that are "showable" on a Hlist I have tried but it returned	[ 0, -0.01470947265625, 0.0126953125, 0.01507568359375, -0.017822265625, 0.02001953125, 0.002685546875, 0.00701904296875, 0.00860595703125, -0.0184326171875, -0.034423828125, -0.045166015625, 0.003204345703125, 0.018310546875, -0.008056640625, 0.01031494140625, 0.00170135498046875, 0...	[ 20625, 142508, 17367, 756, 80854, 450, 621, 31374, 2886, 98, 572, 6562, 1556, 44961, 1830, 1096, 1022, 67, 1505, 765, 37842, 176377 ]	[ 0.128662109375, 0.2161865234375, 0.1640625, 0.1002197265625, 0.1822509765625, 0.010406494140625, 0.033966064453125, 0.19482421875, 0.1971435546875, 0.06695556640625, 0.1126708984375, 0.23388671875, 0.11181640625, 0.151123046875, 0.066162109375, 0.053558349609375, 0.06585693359375, ...	embed
39381115_c1	39381115	haskell	1	0.0011 seconds 1 example, 0 failures So my "test" is running. But so is a test from the dependency (and failing). What could be causing this? And how do I prevent this? Code signals: Test.Hspec, Stack, Wall, Werror, DTEST, OverloadedStrings, Spec.hs, exitcode-stdio-1.0, Foo, QuickCheck, Haskell2010, TemplateHaskell, E...	0.0011 seconds 1 example, 0 failures So my "test" is running. But so is a test from the dependency (and failing). What could be causing this? And how do I prevent this? Code signals: Test.Hspec, Stack, Wall, Werror, DTEST, OverloadedStrings, Spec.hs, exitcode-stdio-1.0, Foo, QuickCheck, Haskell2010, TemplateHaskell, E...	[ 0.000576019287109375, -0.01043701171875, -0.01007080078125, -0.010498046875, 0.002410888671875, 0.02001953125, 0.00299072265625, -0.012939453125, -0.000118255615234375, 0.0010833740234375, -0.004913330078125, -0.0027008056640625, -0.0177001953125, 0.018798828125, -0.0123291015625, 0.02...	[ 6, 37509, 1662, 94131, 27781, 757, 137578, 1061, 759, 6954, 83, 51042, 4966, 221, 3034, 1295, 42548, 27771, 2940, 35782, 214, 4865, 5809, 216806, 903, 56282, 28864, 26073, 7, 8647, 841, 16711, 6512, 2594, 23706, 188800, 21828, 9578, 63033, ...	[ 0.0162506103515625, 0.1234130859375, 0.09478759765625, 0.1822509765625, 0.12255859375, 0.022674560546875, 0.156494140625, 0.01141357421875, 0.049652099609375, 0.24560546875, 0.00628662109375, 0.1641845703125, 0.055938720703125, 0.06781005859375, 0.26708984375, 0.059234619140625, 0.21...	embed
9318146_c0	9318146	haskell	0	Title: Testing haskell equality on Doubles with HUnit? Problem title: Testing haskell equality on Doubles with HUnit? Tags: haskell Problem: Testing haskell equality on Doubles with HUnit? Does HUnit have some way of doing approximate equalities? Clearly, this fails: test1 = TestCase (assertEqual "Should equal" (get_sc...	Testing haskell equality on Doubles with HUnit? Testing haskell equality on Doubles with HUnit? haskell Testing Doubles HUnit test1 TestCase Should get_scores Testing haskell equality on Doubles with HUnit? Does HUnit have some way of doing approximate equalities? Clearly, this fails:	[ -0.00384521484375, 0.0098876953125, 0.005157470703125, -0.0067138671875, -0.0108642578125, -0.00927734375, -0.00494384765625, -0.002685546875, 0.0089111328125, 0.0322265625, -0.0008697509765625, 0.021484375, -0.00335693359375, -0.00537109375, -0.00677490234375, 0.01275634765625, 0.00...	[ 8647, 214, 1556, 142508, 28, 161789, 98, 107172, 7, 678, 22438, 6773, 3034, 418, 441, 6991, 151117, 2046, 12064, 2109, 3917, 20594, 35707, 5134, 15829, 105950, 31075, 35782 ]	[ 0.19091796875, 0.034698486328125, 0.1639404296875, 0.2420654296875, 0.07403564453125, 0.19677734375, 0.0616455078125, 0.213623046875, 0.01873779296875, 0.10107421875, 0.1546630859375, 0.228515625, 0.154296875, 0.0269775390625, 0.040496826171875, 0.040771484375, 0.0535888671875, 0.0...	embed
68942035_c1	68942035	haskell	1	ilation of the entire software suite for step 4. Is there anyway that I can get around needing this step? I've already tried to manually delete the $(stack path --local-install-root)/doc folder before the second docs generation, but this didn't work without a full clean. My Stack version is Version 2.7.3, Git revision ...	ilation of the entire software suite for step 4. Is there anyway that I can get around needing this step? I've already tried to manually delete the $(stack path --local-install-root)/doc folder before the second docs generation, but this didn't work without a full clean. My Stack version is Version 2.7.3, Git revision ...	[ -0.0120849609375, 0.016357421875, -0.0074462890625, 0.0125732421875, -0.0177001953125, 0.003997802734375, -0.021728515625, -0.01434326171875, -0.002410888671875, -0.00836181640625, -0.00482177734375, 0.003021240234375, -0.01458740234375, 0.004852294921875, 0.0186767578125, 0.0008735656...	[ 211, 2320, 111, 70, 64194, 10975, 14947, 100, 29954, 1398, 2071, 2685, 109954, 831, 2046, 10932, 3871, 903, 21771, 37842, 23009, 154109, 3650, 590, 2594, 60875, 98908, 80383, 148920, 29713, 78303, 8108, 17932, 54, 4439, 58093, 4488, 15490, ...	[ 0.1533203125, 0.105712890625, 0.0975341796875, 0.03155517578125, 0.1025390625, 0.2044677734375, 0.1973876953125, 0.0185546875, 0.1549072265625, 0.19384765625, 0.001220703125, 0.00030517578125, 0.03704833984375, 0.0234222412109375, 0.004730224609375, 0.15576171875, 0.0821533203125, ...	embed
31369918_c0	31369918	haskell	0	Title: Composing applicative functions Problem title: Composing applicative functions Tags: applicative, function-composition, functor, haskell Problem: Composing applicative functions Please implement the function: composeApplicative :: (Applicative f) => f (b -> c) -> f (a -> b) -> f (a -> c) Such that: (composeAppli...	Composing applicative functions Composing applicative functions applicative function-composition functor haskell Composing Applicative Composing applicative functions Please implement the function: Such that: Or alternatively, explain why this can not be done?	[ 0.0024566650390625, 0.00927734375, -0.002532958984375, 0.04296875, -0.002288818359375, 0.03759765625, 0.00738525390625, 0.007171630859375, 0.00159454345703125, 0.00180816650390625, 0.0091552734375, -0.0166015625, 0.01318359375, 0.03369140625, -0.0037689208984375, -0.01385498046875, -...	[ 15612, 232, 41816, 4935, 32354, 214, 277, 40322, 7477, 18770, 1556, 142508, 5659, 11048, 30607, 29479, 12, 62771, 450, 73342, 15400, 903, 831, 959, 186, 16940 ]	[ 0.1375732421875, 0.1900634765625, 0.1656494140625, 0.12420654296875, 0.2322998046875, 0.03277587890625, 0.12432861328125, 0.1456298828125, 0.1158447265625, 0.155029296875, 0.1326904296875, 0.223388671875, 0.092529296875, 0.1334228515625, 0.12115478515625, 0.2274169921875, 0.020645141...	embed
23551503_c0	23551503	haskell	0	Title: Trouble making simple function in haskell Problem title: Trouble making simple function in haskell Tags: haskell Problem: Trouble making simple function in haskell I am having trouble trying to convert the following block of C code into Haskell. void echo(int num){ if(num != 0) print(num) else exit() } I just st...	Trouble making simple function in haskell Trouble making simple function in haskell haskell Trouble Trouble making simple function in haskell I am having trouble trying to convert the following block of C code into Haskell. I just started learning Haskell, but I am pretty confused as to how such a simple function could...	[ -0.00518798828125, -0.0024261474609375, 0.002532958984375, 0.005126953125, -0.0010986328125, 0.0162353515625, -0.0123291015625, -0.0224609375, 0.0062255859375, -0.00787353515625, -0.02099609375, -0.028564453125, -0.0007476806640625, 0.0048828125, 0.0166015625, 0.00311279296875, 0.012...	[ 119671, 2661, 20662, 8781, 32354, 23, 1556, 142508, 19441, 63134, 31577, 96760, 25632, 46389, 313, 18151, 3934, 20625, 52080, 28875, 55681, 5281, 6044, 5809, 186, 221, 34844 ]	[ 0.15283203125, 0.1004638671875, 0.10467529296875, 0.206298828125, 0.1751708984375, 0.050811767578125, 0.155029296875, 0.239501953125, 0.02691650390625, 0.1683349609375, 0.06829833984375, 0.134765625, 0.08935546875, 0.142333984375, 0.0760498046875, 0.1275634765625, 0.0889892578125, ...	embed
41412636_c0	41412636	haskell	0	Title: haskell packages: base versus haskel98 Problem title: haskell packages: base versus haskel98 Tags: haskell Problem: haskell packages: base versus haskel98 I installed haskell-platform on my Ubuntu system. Now I need to run ghci -package haskell98 -hide-package base in order to try out simple things like: map Cha...	haskell packages: base versus haskel98 haskell packages: base versus haskel98 haskell haskel98 haskell98 Char.toUpper Hello World haskell packages: base versus haskel98 I installed haskell-platform on my Ubuntu system. Now I need to run in order to try out simple things like: Is there a way to make this the default?	[ 0.01220703125, -0.0084228515625, 0.0306396484375, -0.00543212890625, -0.0064697265625, 0.0033416748046875, 0.00201416015625, -0.0252685546875, 0.0035400390625, 0.009765625, 0.00128936767578125, -0.023193359375, 0.01397705078125, 0.01275634765625, -0.0224609375, -0.004547119140625, 0....	[ 1556, 142508, 98169, 3647, 119475, 2590, 16665, 21656, 188, 1062, 8079, 35378, 6661, 12, 20600, 172121, 98, 116890, 5426, 14240, 3871, 11675, 12989, 9790, 8781, 8966, 3917, 47, 3249, 903, 70, 114977 ]	[ 0.1865234375, 0.267578125, 0.209716796875, 0.2142333984375, 0.182373046875, 0.194091796875, 0.287109375, 0.1492919921875, 0.1636962890625, 0.06494140625, 0.1915283203125, 0.08447265625, 0.06549072265625, 0.0200958251953125, 0.1138916015625, 0.144775390625, 0.0096435546875, 0.175903...	embed
67678471_c0	67678471	haskell	0	Title: Is ghci super slow? Problem title: Is ghci super slow? Tags: haskell Problem: Is ghci super slow? The following Haskell program for finding all perfect numbers below a given limit takes excecutes in about 5-10 seconds in ghci on my computer with n=10000: perf :: Int -> Bool perf n = sum [d \| d<-[1..div n 2], mod...	Is ghci super slow? Is ghci super slow? haskell Bool Is ghci super slow? The following Haskell program for finding all perfect numbers below a given limit takes excecutes in about 5-10 seconds in ghci on my computer with n=10000: Why is the excecution so slow?	[ -0.025634765625, -0.01263427734375, 0.0157470703125, 0.00193023681640625, 0.00714111328125, 0.004058837890625, -0.015869140625, -0.0118408203125, 0.00555419921875, -0.017822265625, 0.01092529296875, -0.0152587890625, -0.0019683837890625, -0.0020599365234375, -0.0034637451171875, 0.0086...	[ 2071, 31380, 318, 1601, 72803, 1556, 142508, 2460, 929, 25632, 20625, 1528, 90791, 756, 15787, 101935, 35064, 34475, 17475, 51776, 1119, 329, 85691, 1672, 67710, 94131, 13909, 653, 191281, 44084, 83, 1010, 221 ]	[ 0.10430908203125, 0.1646728515625, 0.211181640625, 0.169189453125, 0.2410888671875, 0.1280517578125, 0.245849609375, 0.07366943359375, 0.1669921875, 0.058746337890625, 0.1307373046875, 0.1514892578125, 0.1046142578125, 0.0595703125, 0.1864013671875, 0.158203125, 0.185546875, 0.0364...	embed
32401109_c0	32401109	haskell	0	Title: How do I make a list of all possible replaced items in Haskell? Problem title: How do I make a list of all possible replaced items in Haskell? Tags: haskell Problem: How do I make a list of all possible replaced items in Haskell? My input is an arbitrary list, such as ["a","b","c"] and another list element, say ...	How do I make a list of all possible replaced items in Haskell? How do I make a list of all possible replaced items in Haskell? haskell How Haskell How do I make a list of all possible replaced items in Haskell? My input is an arbitrary list, such as and another list element, say "z" . I want the output to look like: H...	[ -0.00885009765625, 0.009765625, -0.0162353515625, 0.01416015625, -0.0089111328125, 0.00860595703125, -0.0322265625, -0.012451171875, 0.0196533203125, 0.0147705078125, 0.0118408203125, -0.007080078125, 0.0169677734375, 0.01104736328125, -0.01544189453125, 0.0177001953125, 0.0191650390...	[ 11249, 3249, 5303, 111, 756, 7722, 91995, 71, 55769, 20625, 142508, 54, 87, 23, 1556, 10, 107730, 61799, 15700, 12830, 169, 3444, 140992, 6713, 1884, 903 ]	[ 0.0770263671875, 0.111083984375, 0.1951904296875, 0.08636474609375, 0.1358642578125, 0.187255859375, 0.21240234375, 0.128662109375, 0.176025390625, 0.14306640625, 0.2393798828125, 0.028656005859375, 0.0278167724609375, 0.05706787109375, 0.11279296875, 0.0596923828125, 0.1461181640625...	embed
54220840_c0	54220840	haskell	0	Title: Join two IOs with - in haskell Problem title: Join two IOs with - in haskell Tags: monads, haskell Problem: Join two IOs with - in haskell I need to join two IO String s with a - in between. Here's what I came up with, which works - what's the right way? import System.Environment f :: String -> String -> IO Stri...	Join two IOs with - in haskell Join two IOs with - in haskell monads haskell System.Environment Join IOs foldl1 Join two IOs with - in haskell I need to join two IO String s with a - in between. Here's what I came up with, which works - what's the right way?	[ -0.0198974609375, -0.000812530517578125, -0.0213623046875, 0.0244140625, -0.005828857421875, 0.0103759765625, -0.016357421875, 0.0103759765625, -0.00140380859375, -0.00970458984375, 0.0135498046875, -0.00982666015625, 0.000560760498046875, -0.0150146484375, -0.0111083984375, -0.0049133...	[ 113053, 6626, 87, 42246, 678, 20, 23, 1556, 142508, 2667, 712, 12353, 686, 1900, 18344, 20469, 418, 3871, 33284, 17780, 23351, 214, 91, 10, 17721, 1257, 43240, 7108, 3917 ]	[ 0.2196044921875, 0.1925048828125, 0.13916015625, 0.20751953125, 0.1014404296875, 0.12353515625, 0.11883544921875, 0.1558837890625, 0.231201171875, 0.07623291015625, 0.08514404296875, 0.07318115234375, 0.0556640625, 0.06488037109375, 0.07440185546875, 0.12109375, 0.0162353515625, 0....	embed
56223033_c0	56223033	haskell	0	Title: Cabal installed packages cache cleanup issue Problem title: Cabal installed packages cache cleanup issue Tags: haskell, cabal Problem: Cabal installed packages cache cleanup issue If I give following command: cabal install <pkgname> the package and its dependencies will be downloaded and installed. Do these pack...	Cabal installed packages cache cleanup issue Cabal installed packages cache cleanup issue haskell cabal Cabal Cabal installed packages cache cleanup issue If I give following command: the package and its dependencies will be downloaded and installed. Do these packages remain in some place like cache and take up space? ...	[ -0.0003528594970703125, 0.012451171875, 0.03564453125, 0.01153564453125, -0.015869140625, 0.0146484375, -0.0108642578125, -0.00927734375, -0.00799560546875, 0.053955078125, -0.01275634765625, 0.001800537109375, 0.00482177734375, 0.01239013671875, -0.00469970703125, 0.0146484375, 0.01...	[ 30438, 289, 20600, 297, 98169, 82365, 46622, 2037, 31089, 1556, 142508, 109524, 8337, 25632, 75101, 136, 42548, 117538, 1221, 7026, 6097, 47143, 3687, 5646, 1257, 32628, 3642, 831, 154109, 71, 51312 ]	[ 0.161376953125, 0.1544189453125, 0.16943359375, 0.025665283203125, 0.224853515625, 0.23291015625, 0.1744384765625, 0.078857421875, 0.0985107421875, 0.0972900390625, 0.16455078125, 0.2076416015625, 0.03369140625, 0.033660888671875, 0.1270751953125, 0.038421630859375, 0.1676025390625, ...	embed
21808930_c0	21808930	haskell	0	Title: Combining bind and return Problem title: Combining bind and return Tags: haskell Problem: Combining bind and return Consider: x `f` y = x >>= (return . y) This function f seems very similar to <$> and flip liftM but <$> doesn't seem to work and I'd have to define an infix operator for flip liftM to make it look ...	Combining bind and return Combining bind and return haskell Combining Combining bind and return Consider: This function f seems very similar to <$> and flip liftM but <$> doesn't seem to work and I'd have to define an infix operator for flip liftM to make it look nice and I'm presuming one already exists? Is there a fu...	[ -0.023193359375, 0.0203857421875, 0.00157928466796875, 0.004058837890625, -0.006072998046875, 0.009765625, 0.0113525390625, -0.02001953125, 0.0205078125, -0.0245361328125, -0.00018787384033203125, -0.0201416015625, 0.0025177001953125, 0.0264892578125, 0.00174713134765625, -0.0036621093...	[ 106935, 592, 68557, 136, 30646, 1556, 142508, 137399, 32354, 1238, 37202, 21373, 4369, 2740, 147505, 60520, 594, 22027, 18, 48903, 4488, 61924, 23, 55923, 39933, 6713, 26267, 44136, 21771, 32316, 1884, 151552 ]	[ 0.193359375, 0.0445556640625, 0.211669921875, 0.093505859375, 0.23681640625, 0.0870361328125, 0.1925048828125, 0.0168304443359375, 0.1798095703125, 0.11572265625, 0.0712890625, 0.0947265625, 0.1173095703125, 0.0279388427734375, 0.1529541015625, 0.1773681640625, 0.1439208984375, 0.0...	embed
57532363_c0	57532363	haskell	0	Title: Haskell hedgehog-fn custom function generator Problem title: Haskell hedgehog-fn custom function generator Tags: haskell-hedgehog, haskell Problem: Haskell hedgehog-fn custom function generator When using hedgehog-fn is it possible to create function generators that generate functions meeting a specific criteria...	Haskell hedgehog-fn custom function generator Haskell hedgehog-fn custom function generator haskell-hedgehog haskell Haskell Haskell hedgehog-fn custom function generator When using hedgehog-fn is it possible to create function generators that generate functions meeting a specific criteria? For example: would it be pos...	[ 0.007049560546875, -0.001556396484375, -0.0130615234375, -0.0189208984375, -0.014892578125, 0.0244140625, 0.01409912109375, -0.0213623046875, 0.00165557861328125, -0.0201416015625, -0.00830078125, -0.01025390625, -0.0042724609375, 0.0034637451171875, 0.018310546875, -0.006591796875, ...	[ 20625, 142508, 80568, 60885, 1663, 14783, 114122, 32354, 145823, 1556, 5252, 17368, 83, 7722, 28282, 7, 139392, 41714, 29458, 55738, 11, 2806, 765, 4734, 1582, 100034 ]	[ 0.0849609375, 0.205810546875, 0.103271484375, 0.131591796875, 0.174072265625, 0.1898193359375, 0.1920166015625, 0.2218017578125, 0.2626953125, 0.0623779296875, 0.04833984375, 0.06756591796875, 0.0140380859375, 0.135986328125, 0.1358642578125, 0.0287628173828125, 0.1959228515625, 0....	embed
38930302_c0	38930302	haskell	0	Title: Power given in a String to Integer Problem title: Power given in a String to Integer Tags: haskell Problem: Power given in a String to Integer We know how to convert a String to an Integer for a String such as "50" . Assume the String is "2^3" , how to get 8 from it ? Is there something which works when it is no...	Power given in a String to Integer Power given in a String to Integer haskell Power Integer Power given in a String to Integer We know how to convert a String to an Integer for a String such as "50" . Assume the String is "2^3" , how to get 8 from it ? Is there something which works when it is not known in advance that...	[ -0.0012664794921875, -0.0205078125, -0.01104736328125, 0.03466796875, 0.0012664794921875, 0.0306396484375, 0.0067138671875, -0.0034637451171875, 0.00689697265625, -0.009521484375, 0.006866455078125, -0.018310546875, -0.0169677734375, 0.0164794921875, -0.0031890869140625, -0.00077056884...	[ 17170, 34475, 23351, 214, 47, 44401, 23, 1556, 142508, 3714, 3642, 96760, 142, 2525, 66596, 304, 8353, 363, 2046, 382, 1295, 9844, 43240, 959, 51529, 129745, 41018, 14537, 4488, 85398 ]	[ 0.2166748046875, 0.0992431640625, 0.203857421875, 0.1048583984375, 0.0963134765625, 0.2137451171875, 0.028106689453125, 0.12451171875, 0.2119140625, 0.01116943359375, 0.03656005859375, 0.1177978515625, 0.00518798828125, 0.17431640625, 0.018157958984375, 0.051788330078125, 0.011199951...	embed
39795944_c2	39795944	haskell	2	ate_fixe :: (Functor f) => FixE f (e1 -> e2) -> FixE f e1 -> FixE f e2 applicate_fixe (Fix f) b = Fix (fmap (`applicate_fixe` b) f) -- Works as the f argument in fmap is a functor applicate_fixe (Throw Code signals: a, the, Why, Functor, Free, Applicative, Main, Toy, Output, Bell, Done, FixE, Fix, Throw, Type, applicat...	ate_fixe :: (Functor f) => FixE f (e1 -> e2) -> FixE f e1 -> FixE f e2 applicate_fixe (Fix f) b = Fix (fmap (`applicate_fixe` b) f) -- Works as the f argument in fmap is a functor applicate_fixe (Throw Code signals: a, the, Why, Functor, Free, Applicative, Main, Toy, Output, Bell, Done, FixE, Fix, Throw, Type, applicat...	[ 0.019775390625, -0.00714111328125, 0.00958251953125, 0.00628662109375, 0.0205078125, 0.0108642578125, -0.018310546875, 0.00823974609375, 0.033203125, -0.01611328125, 0.00171661376953125, -0.01531982421875, 0.01300048828125, 0.04296875, 0.01080322265625, -0.044921875, 0.00811767578125...	[ 10, 67, 454, 55923, 13, 1984, 97249, 18770, 1238, 44357, 96746, 647, 418, 33079, 28, 10461, 304, 41816, 6159, 425, 876, 2203, 420, 62346, 9007, 11048, 4210, 27985, 237, 10750, 23, 83, 7477, 20800, 15555, 28864, 26073, 70, 44084, 28670, ...	[ 0.0677490234375, 0.1915283203125, 0.0289459228515625, 0.277587890625, 0.1766357421875, 0.052734375, 0.1529541015625, 0.1697998046875, 0.1744384765625, 0.04400634765625, 0.25439453125, 0.1539306640625, 0.035064697265625, 0.0200958251953125, 0.054443359375, 0.0848388671875, 0.056701660...	embed
38320570_c0	38320570	haskell	0	Title: The up arrow in ghcii.sh does not scroll through command history Problem title: The up arrow in ghcii.sh does not scroll through command history Tags: windows, haskell, cygwin, ghci Problem: The up arrow in ghcii.sh does not scroll through command history I'm using ghcii.sh and cygwin (windows 10). The up arrow ...	The up arrow in ghcii.sh does not scroll through command history The up arrow in ghcii.sh does not scroll through command history windows haskell cygwin ghci ghcii.sh The up arrow in ghcii.sh does not scroll through command history I'm using ghcii.sh and cygwin (windows 10). The up arrow moves the cursor up one line in...	[ -0.01348876953125, 0.039794921875, 0.0255126953125, -0.000682830810546875, -0.005462646484375, -0.0052490234375, 0.01251220703125, 0.011962890625, -0.0026702880859375, 0.00677490234375, -0.000965118408203125, 0.006683349609375, -0.00013637542724609375, 0.00103759765625, 0.001884460449218...	[ 1257, 118201, 23, 31380, 26506, 5, 1495, 14602, 959, 192046, 8305, 75101, 32692, 54825, 1556, 142508, 19932, 177, 9494, 318, 17368, 136, 229792, 209, 25813, 7, 13810, 42, 1632, 13315, 64457, 214, 3249 ]	[ 0.187255859375, 0.220458984375, 0.03607177734375, 0.1435546875, 0.2421875, 0.04034423828125, 0.1580810546875, 0.06488037109375, 0.1419677734375, 0.218017578125, 0.0941162109375, 0.1597900390625, 0.1846923828125, 0.066162109375, 0.09033203125, 0.185302734375, 0.0540771484375, 0.0309...	embed
50689354_c0	50689354	haskell	0	Title: Haskell, rigid type error Problem title: Haskell, rigid type error Tags: haskell Problem: Haskell, rigid type error Currently I am working on the following code segment data Stream x = Stream [x] deriving Show data Parser a b = P { runParser :: Stream a -> [(b, Stream a)] } Code signals: p, Haskell, Stream, Show...	Haskell, rigid type error Haskell, rigid type error haskell p Haskell Stream Show Parser Char x:xs PComb.hs:72:16 Couldn PComb.hs:71:1-44 Expected Actual Relevant PComb.hs:72:12 PComb.hs:72:1 Failed Haskell, rigid type error Currently I am working on the following code segment and I received an error like this I was ex...	[ -0.021240234375, 0.023193359375, -0.007781982421875, 0.01483154296875, 0.01708984375, 0.01544189453125, -0.01446533203125, -0.02099609375, 0.006988525390625, -0.00665283203125, 0.01507568359375, -0.0194091796875, 0.017822265625, 0.005767822265625, -0.00799560546875, -0.0017471313476562...	[ 20625, 142508, 128652, 10644, 18499, 1556, 915, 115061, 17367, 2392, 2189, 21656, 1022, 12, 425, 306, 275, 127, 12825, 22354, 191147, 15770, 179437, 617, 60075, 13, 100582, 133, 30624, 20927, 19721, 190355, 20697, 25632, 18151, 33180, 1884, 9...	[ 0.1488037109375, 0.24560546875, 0.263427734375, 0.20458984375, 0.1875, 0.1488037109375, 0.080322265625, 0.18359375, 0.1181640625, 0.06365966796875, 0.1004638671875, 0.16796875, 0.1343994140625, 0.005828857421875, 0.1021728515625, 0.0982666015625, 0.07501220703125, 0.05523681640625,...	embed
73106581_c0	73106581	haskell	0	Title: Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Problem title: Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Tags: haskell Problem: Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Why is the range so specific? Why not ...	Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? haskell Why Haskell Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Why is the range so specific? Why not 29-bits wide or 32 bits-w...	[ -0.0137939453125, 0.00176239013671875, 0.002685546875, 0.002471923828125, -0.00787353515625, 0.037841796875, -0.00156402587890625, -0.006072998046875, -0.00099945068359375, 0.0380859375, -0.004608154296875, -0.023681640625, 0.000896453857421875, 0.00775146484375, 0.0233154296875, 0.004...	[ 44084, 83, 5570, 89657, 2733, 297, 37457, 360, 18, 20625, 142508, 66161, 5428, 8353, 4235, 116, 83679, 23, 74, 1556, 70, 9, 100, 221, 29458, 959, 46284, 3137, 38134, 707, 2789, 4785, 113458, 15400, 496, 31635, 106, 48903, 8337 ]	[ 0.13037109375, 0.05780029296875, 0.214111328125, 0.1602783203125, 0.1837158203125, 0.10693359375, 0.237060546875, 0.1702880859375, 0.219970703125, 0.191162109375, 0.304931640625, 0.1180419921875, 0.1024169921875, 0.0660400390625, 0.257568359375, 0.0753173828125, 0.2349853515625, 0....	embed
69882582_c1	69882582	haskell	1	second argument of multiApp', namely [head, last]' In the first argument of (?==)', namely multiApp (sum :: [Int] -> Int) [head, last] [1 :: Int, 2, 3, 4]' \| 232 \| multiApp (sum::[Int]->Int) [head, last] [1::Int,2,3,4] ?== 5 \| ^^^^ And this stackoverflow demands less code and more comments. I don't know how to more co...	second argument of multiApp', namely [head, last]' In the first argument of (?==)', namely multiApp (sum :: [Int] -> Int) [head, last] [1 :: Int, 2, 3, 4]' \| 232 \| multiApp (sum::[Int]->Int) [head, last] [1::Int,2,3,4] ?== 5 \| ^^^^ And this stackoverflow demands less code and more comments. I don't know how to more co...	[ -0.0031585693359375, 0.0262451171875, 0.0021209716796875, 0.0155029296875, -0.0040283203125, 0.014404296875, -0.003570556640625, 0.004241943359375, 0.035400390625, -0.0233154296875, 0.0277099609375, 0.00897216796875, 0.024658203125, 0.0306396484375, 0.0024566650390625, -0.02783203125, ...	[ 17932, 10750, 111, 6024, 39179, 25, 110987, 31251, 4568, 360, 5117, 32, 69112, 11832, 4153, 18, 33079, 138, 201, 98989, 82449, 190, 177261, 5465, 118664, 35968, 40715, 18151, 24626, 6868, 28864, 26073, 7, 1022, 20625, 142508, 19943, 363, 11...	[ 0.2196044921875, 0.29833984375, 0.0142059326171875, 0.2008056640625, 0.260986328125, 0.0928955078125, 0.0204925537109375, 0.20751953125, 0.178466796875, 0.0709228515625, 0.1588134765625, 0.1124267578125, 0.263916015625, 0.215087890625, 0.06402587890625, 0.1331787109375, 0.04254150390...	embed

33021264_c0

33021264

haskell

0

Title: Call by name vs Call by value in Haskell Problem title: Call by name vs Call by value in Haskell Tags: haskell Problem: Call by name vs Call by value in Haskell Call-By-Value: "first second third" 7 Call-By-Name: "second second third" 7 Lazy Evaluation: "second third" 7 Is this case we will get three different r...

Call by name vs Call by value in Haskell Call by name vs Call by value in Haskell haskell Debug.Trace Call Haskell Call-By-Value Call-By-Name Lazy Evaluation Call by name vs Call by value in Haskell If call by value and call by name works, does both of the them delivers the same result? For example: Is this case we wil...

[ 0.0162353515625, 0.0064697265625, 0.0208740234375, 0.041748046875, 0.00811767578125, 0.0162353515625, 0.008056640625, -0.00421142578125, 0.005035400390625, -0.00689697265625, -0.0096435546875, 0.004241943359375, -0.00506591796875, -0.00101470947265625, 0.01287841796875, -0.017211914062...

[ 26265, 390, 9351, 20209, 34292, 23, 20625, 142508, 1556, 262, 85779, 28542, 75358, 856, 50770, 163612, 239, 3285, 151228, 4263, 11782, 136, 43240, 14602, 15044, 111, 2856, 75060, 5701, 16750, 27781, 2071, 903, 7225, 642, 1221, 2046, 17262, ...

[ 0.209228515625, 0.217529296875, 0.2191162109375, 0.181640625, 0.283447265625, 0.046142578125, 0.1575927734375, 0.2587890625, 0.143310546875, 0.05712890625, 0.19580078125, 0.10650634765625, 0.177490234375, 0.1331787109375, 0.1397705078125, 0.1724853515625, 0.107421875, 0.16674804687...

embed

34162708_c0

34162708

haskell

0

Title: How do I get symbolic square root and logarithm functions in SBV? Problem title: How do I get symbolic square root and logarithm functions in SBV? Tags: haskell, symbolic-math, proof, sbv Problem: How do I get symbolic square root and logarithm functions in SBV? The only solution I can find is to do a square roo...

How do I get symbolic square root and logarithm functions in SBV? How do I get symbolic square root and logarithm functions in SBV? haskell symbolic-math proof sbv How SBV How do I get symbolic square root and logarithm functions in SBV? The only solution I can find is to do a square root approximation, but this doesn'...

[ 0.0078125, 0.0130615234375, 0.0040283203125, 0.0152587890625, 0.009765625, 0.017822265625, -0.00811767578125, 0.01287841796875, 0.000301361083984375, 0.00726318359375, -0.005615234375, 0.003326416015625, -0.00179290771484375, -0.00848388671875, -0.009765625, -0.01043701171875, -0.016...

[ 11249, 2046, 128201, 238, 108047, 74855, 136, 459, 8962, 39, 32354, 23, 159, 77394, 54, 1970, 1556, 142508, 125458, 98869, 91, 275, 334, 87, 6, 4734, 29806, 7413, 35707, 53950, 18, 4488, 26582, 4527, 502, 6496 ]

[ 0.06329345703125, 0.121826171875, 0.240234375, 0.089599609375, 0.1334228515625, 0.1986083984375, 0.10205078125, 0.069580078125, 0.1485595703125, 0.07666015625, 0.193115234375, 0.0645751953125, 0.07977294921875, 0.25390625, 0.0318603515625, 0.0521240234375, 0.068359375, 0.1774902343...

embed

48911040_c0

48911040

haskell

0

Title: Where to start with "Couldn't match type MyId with MyId" Problem title: Where to start with "Couldn't match type MyId with MyId" Tags: ghc, haskell-stack, haskell Problem: Where to start with "Couldn't match type MyId with MyId" Code signals: Where, Couldn, MyId, Spec.hs:785:11, my-...

Where to start with "Couldn't match type MyId with MyId" Where to start with "Couldn't match type MyId with MyId" ghc haskell-stack haskell Where Couldn MyId Spec.hs:785:11 my-model-0.0.0:Types.Ids.MyId Types.Ids my-model-0.0.0 Expected UserId Actual f3ba11fc016d stack.yaml Where to start ...

[ -0.006378173828125, -0.0125732421875, -0.00970458984375, -0.0022125244140625, -0.016845703125, 0.002349853515625, -0.004119873046875, -0.0030670166015625, 0.01251220703125, -0.015869140625, 0.002685546875, -0.0098876953125, 0.006011962890625, 0.0027313232421875, 0.014404296875, -0.0038...

[ 78662, 4034, 678, 10625, 52366, 19, 3768, 18, 14858, 10644, 2646, 568, 71, 31380, 238, 1556, 142508, 590, 2594, 191147, 24990, 127, 164814, 19993, 51734, 23320, 99929, 196707, 31852, 60457, 759, 60075, 53400, 100582, 1662, 169887, 177261, 145...

[ 0.036895751953125, 0.1129150390625, 0.1435546875, 0.060546875, 0.12890625, 0.050933837890625, 0.0858154296875, 0.1297607421875, 0.224853515625, 0.2247314453125, 0.180908203125, 0.172607421875, 0.16796875, 0.0889892578125, 0.0748291015625, 0.08489990234375, 0.1845703125, 0.067626953...

embed

59337355_c0

59337355

haskell

0

Title: How could I make a list in Haskell by prime index? Problem title: How could I make a list in Haskell by prime index? Tags: haskell Problem: How could I make a list in Haskell by prime index? How could I make a list where I get every number/letter which has a prime index number? primeIndex :: [a] -> [a] primeInde...

How could I make a list in Haskell by prime index? How could I make a list in Haskell by prime index? haskell How Haskell How could I make a list in Haskell by prime index? How could I make a list where I get every number/letter which has a prime index number?

[ -0.0166015625, 0.0184326171875, 0.0128173828125, 0.0174560546875, 0.019775390625, -0.0032958984375, 0.01116943359375, -0.0234375, 0.0166015625, -0.0054931640625, 0.004364013671875, -0.0286865234375, -0.01055908203125, 0.0255126953125, -0.0185546875, -0.00958251953125, 0.0162353515625...

[ 11249, 5809, 3249, 5303, 20625, 142508, 390, 20809, 63262, 23, 1556, 87, 10, 2046, 11907, 14012, 63049 ]

[ 0.072265625, 0.087890625, 0.0850830078125, 0.209228515625, 0.1507568359375, 0.24169921875, 0.088623046875, 0.1986083984375, 0.20947265625, 0.0487060546875, 0.1226806640625, 0.019256591796875, 0.012786865234375, 0.0399169921875, 0.09210205078125, 0.1175537109375, 0.133056640625 ]

embed

5156735_c0

5156735

haskell

0

Title: Compare the head of a haskell string? Problem title: Compare the head of a haskell string? Tags: haskell Problem: Compare the head of a haskell string? Struggling to learn Haskell, how does one take the head of a string and compare it with the next character untill it finds a character thats note true? In pseudo...

Compare the head of a haskell string? Compare the head of a haskell string? haskell Compare Compare the head of a haskell string? Struggling to learn Haskell, how does one take the head of a string and compare it with the next character untill it finds a character thats note true? In pseudo code I'm trying to: while x ...

[ 0.0064697265625, -0.00830078125, -0.006988525390625, 0.033203125, 0.0091552734375, 0.01422119140625, 0.01055908203125, -0.0068359375, 0.0206298828125, -0.00244140625, 0.01043701171875, 0.0238037109375, 0.0059814453125, 0.002227783203125, -0.01171875, -0.017822265625, 0.02001953125, ...

[ 113307, 13, 10336, 111, 1556, 142508, 79315, 70, 63667, 9815, 30698, 20625, 3642, 14602, 5646, 69101, 11737, 62816, 30394, 7413, 20537, 29568, 74189, 18151, 31577, 12960, 1022, 69112, 86, 29062, 21441, 3525, 5303, 176377 ]

[ 0.203369140625, 0.062744140625, 0.2022705078125, 0.049468994140625, 0.131591796875, 0.2091064453125, 0.207763671875, 0.006072998046875, 0.0010986328125, 0.00537109375, 0.06903076171875, 0.10418701171875, 0.030120849609375, 0.00616455078125, 0.055145263671875, 0.199462890625, 0.089355...

embed

76216662_c0

76216662

haskell

0

Title: Conditional compilation for macOS Problem title: Conditional compilation for macOS Tags: haskell, macos, preprocessor Problem: Conditional compilation for macOS Using {-# LANGUAGE CPP #-} , is there a preprocessor define I can #ifdef to check whether current compilation is for macOS? I tried __APPLE__ and others...

Conditional compilation for macOS Conditional compilation for macOS haskell macos preprocessor Conditional LANGUAGE CPP __APPLE__ Conditional compilation for macOS Using {-# LANGUAGE CPP #-} , is there a preprocessor define I can #ifdef to check whether current compilation is for macOS? I tried __APPLE__ and others as ...

[ -0.00201416015625, 0.010498046875, 0.00421142578125, 0.01806640625, 0.01953125, 0.01708984375, 0.0167236328125, 0.01312255859375, -0.0007781982421875, 0.0184326171875, -0.0208740234375, -0.01373291015625, -0.0016021728515625, -0.0098876953125, 0.006591796875, 0.016357421875, -0.01531...

[ 46347, 43315, 98352, 1363, 100, 19138, 7285, 1556, 142508, 291, 7840, 479, 63923, 3358, 98064, 313, 17487, 40680, 15300, 345, 9, 4904, 468, 2685, 748, 61924, 831, 3190, 112, 420, 47, 12765, 36766, 43581, 83, 35166, 7413 ]

[ 0.2257080078125, 0.181396484375, 0.21826171875, 0.110595703125, 0.1402587890625, 0.1741943359375, 0.20947265625, 0.1175537109375, 0.20458984375, 0.05633544921875, 0.10272216796875, 0.1639404296875, 0.1771240234375, 0.0474853515625, 0.127197265625, 0.06634521484375, 0.250732421875, ...

embed

45537953_c0

45537953

haskell

0

Title: How many args does runState in haskell have Problem title: How many args does runState in haskell have Tags: haskell Problem: How many args does runState in haskell have I misread the documentation. Consider runState as defined in mtl . s -> (a, s) :: State s a Does what look like two arguments for runState have...

How many args does runState in haskell have How many args does runState in haskell have haskell How State Identity StateT How many args does runState in haskell have I misread the documentation. Consider runState as defined in mtl . s -> (a, s) :: State s a Does what look like two arguments for runState have something ...

[ -0.00067138671875, -0.00701904296875, -0.014404296875, 0.01336669921875, 0.00506591796875, 0.0234375, -0.0169677734375, -0.004974365234375, 0.006103515625, -0.0220947265625, 0.017578125, 0.001739501953125, -0.01287841796875, 0.012939453125, -0.0206298828125, -0.0004138946533203125, 0...

[ 11249, 5941, 79459, 7, 14602, 11675, 135206, 13, 23, 1556, 142508, 765, 22836, 71257, 2481, 618, 1239, 39116, 209806, 61924, 18, 141, 5, 91, 33079, 11, 1984, 10, 6713, 1884, 6626, 10750, 136 ]

[ 0.057464599609375, 0.1265869140625, 0.2276611328125, 0.155029296875, 0.0677490234375, 0.178955078125, 0.239013671875, 0.19287109375, 0.076416015625, 0.156005859375, 0.2227783203125, 0.0963134765625, 0.1915283203125, 0.1866455078125, 0.0789794921875, 0.11962890625, 0.046356201171875, ...

embed

46990446_c0

46990446

haskell

0

Title: x in list for which f(x) is maximum Problem title: x in list for which f(x) is maximum Tags: search, haskell, max Problem: x in list for which f(x) is maximum I am trying to find an x in a list for which score x has the maximum value. I tried snd (maximum [(score x, x) | x <- codes]) which works, but I was wonde...

x in list for which f(x) is maximum x in list for which f(x) is maximum search haskell max x in list for which f(x) is maximum I am trying to find an x in a list for which score x has the maximum value. I tried snd (maximum [(score x, x) | x <- codes]) which works, but I was wondering whether there were a faster way to...

[ 0.00151824951171875, -0.01165771484375, 0.02685546875, -0.005645751953125, 0.007293701171875, -0.0027313232421875, 0.00927734375, 0.0069580078125, 0.00909423828125, -0.031005859375, 0.0220947265625, 0.0047607421875, -0.0057373046875, -0.0137939453125, 0.009033203125, -0.01953125, -0....

[ 1022, 23, 5303, 100, 3129, 1238, 132, 425, 83, 38132, 33938, 1556, 142508, 18389, 31577, 47, 7413, 47763, 70, 34292, 37842, 2208, 192, 53950, 316, 30854, 18151, 16, 43240, 149016, 4271, 56, 3917, 903, 15490, 3082, 32354 ]

[ 0.1241455078125, 0.0831298828125, 0.1988525390625, 0.1246337890625, 0.079833984375, 0.174072265625, 0.038177490234375, 0.12451171875, 0.09637451171875, 0.2230224609375, 0.145263671875, 0.13525390625, 0.1728515625, 0.1817626953125, 0.0543212890625, 0.013671875, 0.0953369140625, 0.16...

embed

60549478_c0

60549478

haskell

0

Title: Lambda in Haskell Problem title: Lambda in Haskell Tags: haskell Problem: Lambda in Haskell Can someone explain to me how lambda works in Haskell? For eg. add' = \x -> (\y -> x+y) or foldl (\x _ -> x+1) 0 [1,2,3] == 3 I know what the results are and what the functions do, but I don't understand why do we need la...

Lambda in Haskell Lambda in Haskell haskell Lambda Haskell Lambda in Haskell Can someone explain to me how lambda works in Haskell? For eg. add' = \x -> (\y -> x+y) or foldl (\x _ -> x+1) 0 [1,2,3] == 3 I know what the results are and what the functions do, but I don't understand why do we need lambda expression or wha...

[ 0.00848388671875, 0.0201416015625, 0.0135498046875, -0.00116729736328125, 0.011474609375, 0.00811767578125, 0.0020751953125, 0.00106048583984375, 0.000640869140625, -0.0286865234375, 0.006256103515625, -0.048828125, -0.0093994140625, 0.00848388671875, -0.00909423828125, -0.012817382812...

[ 122930, 85, 23, 20625, 142508, 1556, 22008, 73342, 163, 3642, 21, 6492, 43240, 30046, 15190, 25, 2203, 425, 33079, 53, 1328, 18344, 20469, 101, 21748, 757, 155761, 69112, 138, 3714, 50339, 2367, 32354, 54, 28219, 15400, 642, 3871, 125195, ...

[ 0.212890625, 0.2353515625, 0.0916748046875, 0.150146484375, 0.282958984375, 0.113037109375, 0.006683349609375, 0.12060546875, 0.00714111328125, 0.1072998046875, 0.1278076171875, 0.2423095703125, 0.1810302734375, 0.011444091796875, 0.1839599609375, 0.1077880859375, 0.015289306640625, ...

embed

53596801_c0

53596801

haskell

0

Title: Coercing function using type families leads to constraint error Problem title: Coercing function using type families leads to constraint error Tags: haskell Problem: Coercing function using type families leads to constraint error Code signals: type, a, the, myfunDef, Coercing, MyClass, Fam, Triv, Embed, Embeddab...

Coercing function using type families leads to constraint error Coercing function using type families leads to constraint error haskell type a the myfunDef Coercing MyClass Fam Triv Embed Embeddable MyNewtype MyConstructor MyFam Coercible Could Lib.hs:22:1-75 Relevant Lib.hs:23:1 Bool BoolFam Coercing function using ty...

[ -0.005767822265625, -0.04052734375, -0.01611328125, 0.00384521484375, 0.01611328125, -0.000568389892578125, -0.0361328125, -0.005462646484375, 0.0196533203125, -0.010498046875, -0.01416015625, -0.0235595703125, 0.012451171875, 0.0220947265625, 0.0078125, -0.01239013671875, -0.0001974...

[ 1311, 56, 21896, 32354, 17368, 10644, 87143, 37105, 158, 2816, 4288, 18499, 1556, 142508, 759, 16498, 187423, 2646, 140803, 52917, 4699, 334, 2775, 13482, 46568, 50986, 36716, 919, 302, 318, 2661, 191147, 43278, 127, 19721, 6873, 133, 2460, ...

[ 0.084228515625, 0.1898193359375, 0.1405029296875, 0.177490234375, 0.090087890625, 0.24658203125, 0.2025146484375, 0.1207275390625, 0.0787353515625, 0.20751953125, 0.1300048828125, 0.214599609375, 0.130859375, 0.2216796875, 0.0975341796875, 0.11279296875, 0.2080078125, 0.12060546875...

embed

27054285_c0

27054285

haskell

0

Title: Haskell if then else with "two statements" Problem title: Haskell if then else with "two statements" Tags: haskell Problem: Haskell if then else with "two statements" How can I do this: if n > 0 then putStrLn "Hello" putStrLn "Anything" I want to have "two statements" in one condition but I k...

Haskell if then else with "two statements" Haskell if then else with "two statements" haskell Haskell Hello Anything Haskell if then else with "two statements" How can I do this: I want to have "two statements" in one condition but I keep getting compilation errors I tried using semi-colon with no l...

[ 0.005279541015625, 0.01385498046875, 0.0008697509765625, 0.034423828125, 0.0262451171875, 0.0206298828125, 0.0103759765625, 0.008544921875, 0.007415771484375, -0.00927734375, 0.002227783203125, -0.030029296875, -0.008056640625, 0.01611328125, -0.00506591796875, -0.004852294921875, 0....

[ 20625, 142508, 2174, 7068, 37076, 678, 41502, 55547, 63805, 7, 1556, 35378, 28541, 64113, 831, 54, 903, 3444, 765, 23, 1632, 35431, 1284, 13695, 98352, 18499, 36137, 22796, 19, 110, 84434 ]

[ 0.150146484375, 0.2098388671875, 0.184814453125, 0.1671142578125, 0.2052001953125, 0.07861328125, 0.011199951171875, 0.22705078125, 0.251220703125, 0.099365234375, 0.1475830078125, 0.1060791015625, 0.027130126953125, 0.0816650390625, 0.03668212890625, 0.0545654296875, 0.069091796875,...

embed

29351873_c0

29351873

haskell

0

Title: Combined type = one, the other, or both? Problem title: Combined type = one, the other, or both? Tags: types, haskell, algebraic-data-types Problem: Combined type = one, the other, or both? I'm wondering if this is possible in Haskell: type DateTime = Date | Time | Date :+ Time ...so that it can be either a spec...

Combined type = one, the other, or both? Combined type = one, the other, or both? types haskell algebraic-data-types Combined DateTime Date Time Combined type = one, the other, or both? I'm wondering if this is possible in Haskell: ...so that it can be either a specific date, a specific time or a complex value made up ...

[ -0.0012969970703125, 0.01483154296875, -0.0009765625, 0.03466796875, -0.0234375, -0.00653076171875, -0.0162353515625, 0.00909423828125, 0.00927734375, 0.005828857421875, -0.0020904541015625, 0.013916015625, 0.0233154296875, 0.0198974609375, -0.035888671875, 0.0147705078125, 0.0030822...

[ 106935, 14534, 10644, 1632, 3789, 15044, 2203, 52895, 1556, 142508, 429, 2844, 10135, 50986, 25512, 70059, 19055, 149016, 2174, 903, 83, 7722, 23, 20625, 991, 831, 186, 29458, 5622, 1733, 27140, 34292, 1257 ]

[ 0.258544921875, 0.1888427734375, 0.262939453125, 0.08123779296875, 0.119140625, 0.1220703125, 0.05029296875, 0.1881103515625, 0.1341552734375, 0.26318359375, 0.03631591796875, 0.031005859375, 0.0948486328125, 0.2008056640625, 0.1353759765625, 0.1708984375, 0.1993408203125, 0.046966...

embed

44190079_c3

44190079

haskell

3

, base-4.9.1.0, binary-0.8.3.0, bytestring-0.10.8.1, deepseq-1.4.2.0, random-1.1-9tceXaeYIMZ4JrKq20Egog, split-0.2.3.1-FWyXC6nhV0H3AfM8IzrEFk, storable-complex-0.2.2-G9QzpmZTKvgKKVagrcRWdL, vector-0.11.0.0-HhutbadagxHIONIkSRJEug, OpenBLAS-v0.2.19-Win64-int32, Users, Yotam, AppData, Local, Programs, msys2-20150512, ming...

[ 0.01318359375, 0.003662109375, -0.0133056640625, -0.005584716796875, 0.01129150390625, -0.002655029296875, -0.009033203125, -0.0125732421875, 0.00286865234375, 0.0169677734375, -0.0167236328125, -0.0159912109375, -0.0091552734375, 0.004150390625, -0.0003108978271484375, -0.012268066406...

[ 6, 4, 3647, 9, 156982, 5, 102107, 2394, 6635, 132208, 132265, 390, 67, 91693, 23320, 10179, 206730, 53894, 184, 864, 91977, 73011, 96759, 92134, 15205, 1549, 65450, 133684, 97109, 53, 3082, 2886, 44974, 70147, 238, 866, 173, 18770, 14556, ...

[ 0.0966796875, 0.081298828125, 0.2218017578125, 0.1033935546875, 0.2205810546875, 0.110595703125, 0.182373046875, 0.1402587890625, 0.145263671875, 0.120361328125, 0.1392822265625, 0.0570068359375, 0.1202392578125, 0.1776123046875, 0.0364990234375, 0.051483154296875, 0.116943359375, ...

embed

49590571_c0

49590571

haskell

0

Title: How to create a function that graphs objects in haskell in Haskell Problem title: How to create a function that graphs objects in haskell in Haskell Tags: pattern-matching, haskell, codeworld Problem: How to create a function that graphs objects in haskell in Haskell How to Format ► put returns between paragraph...

How to create a function that graphs objects in haskell in Haskell How to create a function that graphs objects in haskell in Haskell pattern-matching haskell codeworld How Haskell How to create a function that graphs objects in haskell in Haskell How to Format ► put returns between paragraphs ► for linebreak add 2 spa...

[ -0.0025482177734375, 0.0020294189453125, -0.004608154296875, 0.0072021484375, 0.002197265625, 0.003997802734375, -0.0225830078125, -0.004974365234375, 0.00909423828125, 0.00787353515625, 0.01068115234375, -0.0458984375, 0.005523681640625, -0.01153564453125, 0.004241943359375, 0.0026550...

[ 11249, 28282, 32354, 450, 41382, 7, 36746, 1556, 142508, 20625, 23, 103510, 98753, 32554, 60972, 3884, 30646, 17721, 151268, 13315, 70751, 15190, 116, 32628, 3564, 85530, 238, 65665, 18597, 18, 18151, 390, 201 ]

[ 0.04388427734375, 0.161376953125, 0.2127685546875, 0.03009033203125, 0.2587890625, 0.06439208984375, 0.186279296875, 0.1470947265625, 0.220458984375, 0.137939453125, 0.0206146240234375, 0.1422119140625, 0.141357421875, 0.0775146484375, 0.167236328125, 0.035430908203125, 0.18737792968...

embed

54233506_c0

54233506

haskell

0

Title: Read single field of object using Aeson without writing a FromJSON instance Problem title: Read single field of object using Aeson without writing a FromJSON instance Tags: haskell, aeson Problem: Read single field of object using Aeson without writing a FromJSON instance How do I read a single field (by name) f...

Read single field of object using Aeson without writing a FromJSON instance Read single field of object using Aeson without writing a FromJSON instance haskell aeson Aeson Read FromJSON Read single field of object using Aeson without writing a FromJSON instance How do I read a single field (by name) from a JSON object ...

[ -0.01055908203125, -0.006927490234375, -0.0057373046875, 0.0303955078125, -0.0111083984375, -0.007049560546875, -0.00457763671875, -0.00323486328125, -0.006927490234375, -0.01806640625, 0.01519775390625, 0.005035400390625, -0.0028533935546875, -0.00616455078125, 0.0118408203125, -0.035...

[ 4764, 11001, 44457, 36746, 17368, 62, 90, 191, 15490, 32562, 28090, 1375, 58627, 110527, 111, 1556, 142508, 10, 12301, 9351, 16, 1295, 821, 10644, 18507 ]

[ 0.1971435546875, 0.20947265625, 0.259765625, 0.1810302734375, 0.05694580078125, 0.1251220703125, 0.144287109375, 0.2098388671875, 0.11181640625, 0.13671875, 0.1766357421875, 0.1156005859375, 0.2200927734375, 0.165771484375, 0.008026123046875, 0.1077880859375, 0.1795654296875, 0.075...

embed

12508727_c0

12508727

haskell

0

Title: how to assign values to a list in haskell Problem title: how to assign values to a list in haskell Tags: haskell Problem: how to assign values to a list in haskell I have a data type: data Numbers = Numbers {a::Int, b::Int} How can I construct [Numbers] in order to get the same effect as [[a,b] | a <- [1,2], b <...

how to assign values to a list in haskell how to assign values to a list in haskell haskell Numbers a::Int b::Int how to assign values to a list in haskell I have a data type: How can I construct [Numbers] in order to get the same effect as so the result will be similar to [[1,2],[2,1]]

[ -0.000659942626953125, -0.005584716796875, 0.002044677734375, -0.009765625, -0.0115966796875, 0.0025482177734375, -0.01171875, 0.0006866455078125, 0.0167236328125, 0.0218505859375, 0.01019287109375, -0.0054931640625, 0.031494140625, -0.01361083984375, -0.0262451171875, -0.0054321289062...

[ 3642, 47, 95486, 142424, 10, 5303, 23, 1556, 142508, 103332, 4153, 18, 876, 2053, 10644, 11249, 831, 64549, 18444, 26278, 5701, 21543, 16750, 21373, 133063, 304, 76172 ]

[ 0.0806884765625, 0.1370849609375, 0.27880859375, 0.2454833984375, 0.06646728515625, 0.2314453125, 0.063232421875, 0.1832275390625, 0.2408447265625, 0.2041015625, 0.052001953125, 0.09423828125, 0.07049560546875, 0.08056640625, 0.1090087890625, 0.029083251953125, 0.018890380859375, 0...

embed

18598365_c0

18598365

haskell

0

Title: equal sign with haskell literals Problem title: equal sign with haskell literals Tags: literals, haskell, equality Problem: equal sign with haskell literals What exactly happens in GHCi when I load a file with a line that says: 0=1 ? I was expecting that this would give an error but it doesn't seem to do anythin...

equal sign with haskell literals equal sign with haskell literals literals haskell equality equal sign with haskell literals What exactly happens in GHCi when I load a file with a line that says: 0=1 ? I was expecting that this would give an error but it doesn't seem to do anything at all. Does it do anything? I assume...

[ 0.01953125, 0.004730224609375, 0.0019989013671875, -0.00531005859375, -0.00732421875, -0.002105712890625, 0.00921630859375, -0.00787353515625, -0.0091552734375, -0.00390625, -0.0064697265625, -0.000010609626770019531, 0.015869140625, -0.0111083984375, 0.0030517578125, 0.01434326171875,...

[ 105950, 24092, 678, 1556, 142508, 15659, 16765, 28, 161789, 66161, 96276, 23, 527, 73265, 14, 3229, 72367, 11435, 13315, 450, 17378, 757, 33000, 214, 18499, 48903, 54, 23937, 41591, 183234, 54433, 1974, 4865 ]

[ 0.1893310546875, 0.2109375, 0.114501953125, 0.1446533203125, 0.2127685546875, 0.135498046875, 0.107177734375, 0.022125244140625, 0.07952880859375, 0.0211181640625, 0.05059814453125, 0.0194549560546875, 0.0872802734375, 0.1141357421875, 0.1859130859375, 0.011810302734375, 0.1756591796...

embed

38538207_c0

38538207

haskell

0

Title: Is '$' a function in haskell? Problem title: Is '$' a function in haskell? Tags: syntax, dollar-sign, haskell Problem: Is '$' a function in haskell? I am quite confused about ($) in haskell. when I type :t ($) in ghci. I will get :($) :: (a -> b) -> a -> b but, when I type :t ($ 3) I will get...

Is '$' a function in haskell? Is '$' a function in haskell? syntax dollar-sign haskell Num Is '$' a function in haskell? I am quite confused about ($) in haskell. when I type in ghci. I will get but, when I type I will get so, why ($) accept the second argument without any error？

[ 0.006439208984375, -0.006072998046875, 0.018798828125, -0.00927734375, -0.00897216796875, 0.0181884765625, -0.0015106201171875, 0.0137939453125, 0.005401611328125, -0.0074462890625, -0.0084228515625, -0.0264892578125, -0.006134033203125, -0.01708984375, -0.01434326171875, 0.01055908203...

[ 2071, 54764, 3768, 74, 4369, 425, 10, 32354, 23, 1556, 142508, 6002, 86531, 15437, 31304, 52782, 25, 32233, 55681, 5281, 1672, 16, 10644, 31380, 318, 2046, 1221, 221, 15400, 26946, 17932, 10750, 15490, 18499 ]

[ 0.060455322265625, 0.07318115234375, 0.1905517578125, 0.105712890625, 0.264892578125, 0.0118408203125, 0.0987548828125, 0.25537109375, 0.1107177734375, 0.1451416015625, 0.26806640625, 0.049102783203125, 0.0107421875, 0.1767578125, 0.1724853515625, 0.162841796875, 0.0237884521484375, ...

embed

20593330_c0

20593330

haskell

0

Title: Operator priority in haskell Problem title: Operator priority in haskell Tags: haskell Problem: Operator priority in haskell I have a function g1 = flip map . (flip take $ iterate (+1) 1) I am wondering why i can't write g1 = flip map . $ flip take $ iterate (+1) 1 ? I know that $ has lowest priority but don't u...

Operator priority in haskell Operator priority in haskell haskell Operator Operator priority in haskell I have a function g1 = flip map . (flip take $ iterate (+1) 1) I am wondering why i can't write g1 = flip map . $ flip take $ iterate (+1) 1 ? I know that $ has lowest priority but don't understand why we can have $ ...

[ 0.0203857421875, 0.0177001953125, 0.00933837890625, -0.004486083984375, -0.01055908203125, -0.00628662109375, 0.007568359375, 0.00518798828125, -0.017822265625, 0.0012054443359375, -0.0106201171875, 0.0244140625, 0.026611328125, -0.0118408203125, -0.01434326171875, -0.00872802734375, ...

[ 150922, 25343, 53, 23, 1556, 142508, 32354, 706, 418, 147505, 22288, 420, 21392, 5646, 3650, 8560, 67, 22183, 17727, 4879, 149016, 15400, 831, 18, 33022, 6, 17, 106, 459, 25617, 28219, 765, 959, 7103, 20633 ]

[ 0.289306640625, 0.2271728515625, 0.1279296875, 0.03668212890625, 0.134765625, 0.2449951171875, 0.157958984375, 0.1005859375, 0.12255859375, 0.17431640625, 0.173828125, 0.0152435302734375, 0.1383056640625, 0.175048828125, 0.1358642578125, 0.1964111328125, 0.0738525390625, 0.12854003...

embed

53191477_c1

53191477

haskell

1

-> a0 (bound at C:\\Users\Ellis\OneDrive\Year 2\CS-205 Declarative Programming\CW1\Haskell-Cw1\Coursework1.hs:13:26) | 14 | in (0.001 * area) + ((fromIntegral y)*0.002 * area) * 1.5 | I believe my lack of understanding with haskell is what caused this issue Code signals: area, Match, Float, Bool, Couldn, Probable, Rel...

[ 0.0146484375, 0.0004482269287109375, 0.0016937255859375, -0.00213623046875, -0.007080078125, 0.01348876953125, -0.0123291015625, 0.0040283203125, 0.0186767578125, 0.003936767578125, 0.00128936767578125, -0.0037078857421875, -0.019775390625, -0.018798828125, 0.0125732421875, -0.00094604...

[ 33079, 10, 2389, 99091, 99, 313, 12, 13273, 1062, 7, 1314, 647, 19813, 62068, 142994, 69085, 147, 116, 19283, 143422, 98501, 4935, 27958, 129781, 418, 6495, 142508, 434, 474, 184, 18244, 127, 22618, 28194, 58745, 616, 23, 37509, 661, 1612...

[ 0.139404296875, 0.1695556640625, 0.227294921875, 0.240966796875, 0.025238037109375, 0.04046630859375, 0.054931640625, 0.0159912109375, 0.039093017578125, 0.073974609375, 0.08642578125, 0.0692138671875, 0.205078125, 0.1463623046875, 0.2447509765625, 0.044677734375, 0.040374755859375, ...

embed

7435422_c0

7435422

haskell

0

Title: How to return float number with 2 digits after decimal point? Problem title: How to return float number with 2 digits after decimal point? Tags: pretty-print, printf, formatting, haskell, floating-point Problem: How to return float number with 2 digits after decimal point? I have some simple function f :: Float ...

How to return float number with 2 digits after decimal point? How to return float number with 2 digits after decimal point? pretty-print printf formatting haskell floating-point How Float Prelude How to return float number with 2 digits after decimal point? I have some simple function Why not 5.00 ? How can I achieve t...

[ 0.00145721435546875, -0.027099609375, -0.000293731689453125, 0.002410888671875, 0.01611328125, 0.007659912109375, 0.00714111328125, 0.002960205078125, -0.00008296966552734375, 0.0211181640625, 0.0157470703125, -0.031005859375, -0.013671875, 0.0166015625, 0.0078125, 0.01318359375, 0.0...

[ 11249, 47, 30646, 21917, 257, 14012, 678, 116, 153939, 7103, 32380, 2749, 6275, 28875, 35662, 28412, 420, 9384, 1556, 142508, 26518, 38496, 38699, 1914, 822, 112, 8781, 32354, 44084, 959, 82683, 69307 ]

[ 0.051727294921875, 0.0562744140625, 0.1820068359375, 0.1925048828125, 0.11669921875, 0.1466064453125, 0.08587646484375, 0.13134765625, 0.161865234375, 0.1072998046875, 0.155029296875, 0.1180419921875, 0.1142578125, 0.110107421875, 0.1220703125, 0.052154541015625, 0.06475830078125, ...

embed

40480861_c0

40480861

haskell

0

Title: Defining a length function using tail Problem title: Defining a length function using tail Tags: list, haskell Problem: Defining a length function using tail I'm pretty new to Haskell and I am trying to define my own length function as follows: lengthz :: [a] -> a lengthz [] = 0 lengthz n = 1 + length (tail n) W...

Defining a length function using tail Defining a length function using tail list haskell tail Defining Defining a length function using tail I'm pretty new to Haskell and I am trying to define my own length function as follows: lengthz :: [a] -> a lengthz [] = 0 lengthz n = 1 + length (tail n) Why does this not compile...

[ 0.01611328125, 0.029296875, 0.0027008056640625, 0.0223388671875, 0.00909423828125, -0.005126953125, 0.0062255859375, 0.0045166015625, 0.0233154296875, -0.03125, 0.0186767578125, -0.0150146484375, 0.0230712890625, 0.0162353515625, 0.0250244140625, 0.0086669921875, 0.0157470703125, 0...

[ 88606, 140909, 32354, 17368, 46741, 449, 10, 5303, 1556, 142508, 28875, 3525, 20625, 31577, 61924, 10002, 28960, 169, 1984, 11, 33079, 2203, 757, 653, 106, 997, 44084, 14602, 959, 9969, 1340, 44691, 62775 ]

[ 0.1865234375, 0.2391357421875, 0.2171630859375, 0.1124267578125, 0.25927734375, 0.0272674560546875, 0.07061767578125, 0.1563720703125, 0.125732421875, 0.2020263671875, 0.019866943359375, 0.043487548828125, 0.116455078125, 0.07220458984375, 0.18603515625, 0.1104736328125, 0.0089721679...

embed

27909759_c0

27909759

haskell

0

Title: Signal to CellRendererModeActivatable Problem title: Signal to CellRendererModeActivatable Tags: gtk2hs, haskell Problem: Signal to CellRendererModeActivatable The CellRenderer of gtk2hs has a property cellMode . If it's set to CellRendererModeActivateble , what signal gets emitted? I can't find one in the docum...

Signal to CellRendererModeActivatable Signal to CellRendererModeActivatable gtk2hs haskell Signal CellRendererModeActivatable CellRenderer CellRendererModeActivateble gtk2hs Signal to CellRendererModeActivatable The CellRenderer of gtk2hs has a property cellMode . If it's set to CellRendererModeActivateble , what signa...

[ -0.00537109375, 0.00061798095703125, 0.0252685546875, 0.01513671875, 0.01202392578125, 0.0111083984375, -0.007171630859375, 0.03271484375, -0.0194091796875, -0.0189208984375, -0.00150299072265625, -0.03125, -0.004547119140625, 0.035400390625, -0.0166015625, -0.0133056640625, 0.004119...

[ 144000, 47, 80743, 1052, 23894, 56, 9083, 112, 164414, 11, 22819, 706, 31472, 304, 127, 1556, 142508, 2182, 2661, 7, 57266, 38750, 4263, 442, 5423, 2367, 26073, 62163, 53225, 3674, 7413, 1632, 209806 ]

[ 0.2091064453125, 0.1151123046875, 0.1690673828125, 0.0946044921875, 0.168701171875, 0.1456298828125, 0.1956787109375, 0.08148193359375, 0.1612548828125, 0.0185546875, 0.1463623046875, 0.0400390625, 0.16943359375, 0.1236572265625, 0.12744140625, 0.118896484375, 0.208740234375, 0.097...

embed

21213103_c0

21213103

haskell

0

Title: Haskell operation "+" what does that mean? Problem title: Haskell operation "+" what does that mean? Tags: haskell, operators Problem: Haskell operation "+" what does that mean? The code as follows: chop [n] lev = [n-1] chop (n:m:xs) lev = n-1:lev +m:xs what does n-1:lev +m:xs mean? I know m:...

Haskell operation "+" what does that mean? Haskell operation "+" what does that mean? haskell operators Haskell n-1 n:m:xs n-1:lev m:xs Haskell operation "+" what does that mean? The code as follows: what does n-1:lev +m:xs mean? I know m:xs is list, how can a list add a int (n-1:lev) ? Thanks you!

[ -0.0216064453125, 0.0002899169921875, 0.025146484375, 0.01312255859375, 0.00750732421875, 0.0172119140625, -0.01409912109375, -0.006561279296875, 0.024658203125, -0.0220947265625, 0.008544921875, -0.03369140625, 0.022705078125, 0.0024261474609375, -0.0179443359375, -0.01092529296875, ...

[ 20625, 142508, 41018, 619, 41502, 1328, 1230, 2367, 14602, 450, 29459, 32, 74, 1556, 39933, 653, 5759, 12, 39, 425, 7, 11150, 347, 18151, 28960, 997, 3714, 83, 5303, 3642, 831, 15190, 10, 23, 18, 19 ]

[ 0.1622314453125, 0.2724609375, 0.2362060546875, 0.0782470703125, 0.0814208984375, 0.26806640625, 0.115478515625, 0.07525634765625, 0.06951904296875, 0.0980224609375, 0.1551513671875, 0.0255279541015625, 0.0302734375, 0.1234130859375, 0.1708984375, 0.0927734375, 0.1728515625, 0.0789...

embed

43438875_c0

43438875

haskell

0

Title: Confusion about StateT, State and MonadState Problem title: Confusion about StateT, State and MonadState Tags: state-monad, haskell Problem: Confusion about StateT, State and MonadState I'm utterly confused between newtype StateT s m a = StateT {runStateT :: s -> m (a, s)} and type State s = StateT s Identity an...

Confusion about StateT, State and MonadState Confusion about StateT, State and MonadState state-monad haskell Confusion StateT State MonadState Identity Monad Confusion about StateT, State and MonadState I'm utterly confused between and and

[ -0.0125732421875, 0.006378173828125, 0.008056640625, 0.001373291015625, 0.011962890625, -0.006500244140625, 0.0031890869140625, -0.005859375, -0.004913330078125, 0.01220703125, 0.00823974609375, 0.0169677734375, -0.010986328125, 0.01300048828125, -0.01141357421875, 0.000425338745117187...

[ 1657, 92105, 1672, 22836, 618, 4, 136, 60331, 71, 135206, 13, 11341, 3796, 712, 1556, 142508, 71257, 2481, 3055, 55681, 5281, 17721 ]

[ 0.0191497802734375, 0.1827392578125, 0.07318115234375, 0.2337646484375, 0.260498046875, 0.042938232421875, 0.0830078125, 0.1654052734375, 0.134765625, 0.24755859375, 0.1317138671875, 0.1822509765625, 0.11334228515625, 0.126708984375, 0.127197265625, 0.2296142578125, 0.1566162109375, ...

embed

64881810_c2

64881810

haskell

2

++ dit morseCode '0' = dah ++ dah ++ dah ++ dah ++ dah morseCode _ = undefined -- Avoid warnings type Table = [(Char, Code)] morseTable :: Table morseTable = [ (c , morseCode c) | c <- ['A'..'Z']++['0'..'9'] ] The encodeWord Code signals: Data.Maybe, How, Haskell, x:xs, Table, Maybe, Silence, Types, Atom, Beep, Show, ...

[ 0.00543212890625, -0.017333984375, 0.001190185546875, -0.00579833984375, -0.0029144287109375, 0.01708984375, 0.035400390625, 0.0198974609375, 0.00823974609375, -0.01177978515625, -0.00061798095703125, 0.000621795654296875, 0.007598876953125, 0.0281982421875, -0.021484375, 0.00646972656...

[ 37223, 854, 2993, 184, 114211, 2389, 2203, 6178, 101, 9232, 5983, 84361, 532, 1631, 6977, 10644, 112997, 84068, 28864, 618, 2886, 238, 501, 284, 1511, 5, 1126, 581, 22, 40899, 164805, 26073, 7, 11809, 82419, 372, 11249, 20625, 142508, 102...

[ 0.236083984375, 0.2032470703125, 0.2081298828125, 0.2103271484375, 0.25390625, 0.1539306640625, 0.04486083984375, 0.1307373046875, 0.04376220703125, 0.081787109375, 0.1591796875, 0.15087890625, 0.1285400390625, 0.140869140625, 0.12109375, 0.1456298828125, 0.2147216796875, 0.1080322...

embed

5811842_c0

5811842

haskell

0

Title: multidimensional mutable Vectors: possible? if so, how? Problem title: multidimensional mutable Vectors: possible? if so, how? Tags: multidimensional-array, arrays, haskell Problem: multidimensional mutable Vectors: possible? if so, how? i notice that the generate function is not defined for mutable vectors. i'm...

multidimensional mutable Vectors: possible? if so, how? multidimensional mutable Vectors: possible? if so, how? multidimensional-array arrays haskell Vectors multidimensional mutable Vectors: possible? if so, how? i notice that the generate function is not defined for mutable vectors. i'm wondering if there is another ...

[ 0.00830078125, 0.00433349609375, -0.01129150390625, 0.007476806640625, 0.0167236328125, 0.0111083984375, -0.004547119140625, -0.025634765625, 0.007720947265625, -0.010986328125, -0.01043701171875, -0.00482177734375, 0.00439453125, 0.0174560546875, -0.0220947265625, -0.001922607421875, ...

[ 6024, 157955, 842, 22819, 52884, 22230, 7722, 2174, 3642, 19305, 10298, 4778, 1556, 142508, 221, 60322, 139392, 32354, 959, 61924, 22834 ]

[ 0.135498046875, 0.193603515625, 0.1527099609375, 0.1734619140625, 0.2095947265625, 0.1497802734375, 0.214599609375, 0.058197021484375, 0.0765380859375, 0.047515869140625, 0.07525634765625, 0.01605224609375, 0.13037109375, 0.227783203125, 0.035675048828125, 0.0139923095703125, 0.24499...

embed

35846753_c0

35846753

haskell

0

Title: Why this Haskell expression won't get a result? Problem title: Why this Haskell expression won't get a result? Tags: haskell Problem: Why this Haskell expression won't get a result? I try to run this in GHCi: take 100 [ (a,b,c) | a <- [1..], b <- [1..], c <- [1..], a^2 + b^2 == c^2, a<b ] I would expec...

Why this Haskell expression won't get a result? Why this Haskell expression won't get a result? haskell Why Haskell Why this Haskell expression won't get a result? I try to run this in GHCi: I would expect it to be calculated because of the lazyness of take, but that's not the case. Why?

[ 0.0185546875, 0.000774383544921875, 0.006378173828125, 0.00262451171875, 0.006805419921875, 0.0111083984375, 0.0020751953125, 0.00064849853515625, 0.0079345703125, -0.006134033203125, 0.004669189453125, -0.00074005126953125, 0.0017242431640625, -0.0020904541015625, -0.0111083984375, -0...

[ 44084, 903, 20625, 142508, 125195, 23742, 3768, 18, 2046, 10, 16750, 1556, 9790, 11675, 527, 73265, 14, 41206, 442, 74481, 3674, 6637, 21, 3285, 7432, 111, 5646, 1284, 450, 959, 7225 ]

[ 0.11572265625, 0.0836181640625, 0.146728515625, 0.257080078125, 0.2193603515625, 0.136474609375, 0.06964111328125, 0.14013671875, 0.09002685546875, 0.06512451171875, 0.1500244140625, 0.1072998046875, 0.011962890625, 0.0472412109375, 0.03387451171875, 0.070556640625, 0.106689453125, ...

embed

22960638_c0

22960638

haskell

0

Title: Convert 2-tuple to 3-tuple Haskell Problem title: Convert 2-tuple to 3-tuple Haskell Tags: haskell, tuples Problem: Convert 2-tuple to 3-tuple Haskell So I have a list of tuples: [(1,2),(2,3),(3,4)] for example. And I perform a calculation on its elements. The result of this should be joined to this tuple, but I...

Convert 2-tuple to 3-tuple Haskell Convert 2-tuple to 3-tuple Haskell haskell tuples Convert Haskell Convert 2-tuple to 3-tuple Haskell So I have a list of tuples: for example. And I perform a calculation on its elements. The result of this should be joined to this tuple, but I don't know how. is the format I'm thinkin...

[ 0.007232666015625, 0.007720947265625, -0.00970458984375, 0.0103759765625, 0.001373291015625, 0.01361083984375, -0.0233154296875, -0.00994873046875, 0.00897216796875, -0.00994873046875, 0.0023651123046875, -0.02197265625, 0.00872802734375, 0.0299072265625, -0.0284423828125, 0.0155639648...

[ 1657, 11549, 4720, 458, 8705, 47, 5691, 20625, 142508, 1556, 370, 99726, 5303, 27781, 51339, 74481, 1363, 80854, 16750, 5608, 33284, 903, 18, 3714, 3642, 9384, 47644 ]

[ 0.03814697265625, 0.1357421875, 0.171630859375, 0.191162109375, 0.209228515625, 0.0726318359375, 0.19921875, 0.1534423828125, 0.232421875, 0.1268310546875, 0.1558837890625, 0.2066650390625, 0.097412109375, 0.06951904296875, 0.058624267578125, 0.1397705078125, 0.020751953125, 0.1020...

embed

6021327_c0

6021327

haskell

0

Title: Equivalence of function types with type variables Problem title: Equivalence of function types with type variables Tags: haskell, function, types Problem: Equivalence of function types with type variables I need a function with following attributes. (c->d)->(a->b->c)->a->b->d my function: funktionD = (.) . (.) b...

Equivalence of function types with type variables Equivalence of function types with type variables haskell function types Equivalence Equivalence of function types with type variables I need a function with following attributes. my function: funktionD = (.) . (.) but :t funktionD ist this equal?

[ 0.01397705078125, 0.01031494140625, -0.018798828125, 0.01300048828125, -0.015869140625, -0.0191650390625, -0.00823974609375, -0.005523681640625, 0.009033203125, -0.020751953125, -0.01904296875, -0.0045166015625, 0.01385498046875, 0.00732421875, -0.000293731689453125, -0.00164794921875,...

[ 145666, 1405, 6620, 32354, 52895, 678, 10644, 77336, 1556, 142508, 3871, 25632, 150380, 40210, 397, 2203, 5, 18, 443, 903, 105950 ]

[ 0.076171875, 0.114013671875, 0.001983642578125, 0.18017578125, 0.208740234375, 0.0838623046875, 0.21533203125, 0.212158203125, 0.1153564453125, 0.1878662109375, 0.08892822265625, 0.088623046875, 0.146728515625, 0.201904296875, 0.16943359375, 0.028900146484375, 0.047454833984375, 0....

embed

6241650_c0

6241650

haskell

0

Title: Haskell Array Index out of range Problem title: Haskell Array Index out of range Tags: range, haskell, arrays Problem: Haskell Array Index out of range Code signals: Haskell, Array, Index, Main, Breakpoint, SVMCF.hs:125:13-86, Stopped, _result, UA.Array, User, RTuple, A.Array, A.listArray, UA.UArray, Double, SVM...

Haskell Array Index out of range Haskell Array Index out of range range haskell arrays Haskell Array Index Main Breakpoint SVMCF.hs:125:13-86 Stopped _result UA.Array User RTuple A.Array A.listArray UA.UArray Double SVMCF.hs:125:13-28 SVMCF.hs:125:21-27 Bool SVMCF.hs:125:32-86 SVMCF.hs:125:32-56 SVMCF.hs:125:60-86 Exce...

[ 0.004486083984375, 0.01544189453125, 0.007080078125, -0.0038604736328125, 0.007110595703125, -0.0018768310546875, -0.003021240234375, 0.01708984375, 0.0115966796875, 0.0252685546875, -0.007110595703125, -0.023193359375, 0.00102996826171875, -0.0038909912109375, 0.0361328125, -0.0268554...

[ 20625, 142508, 69253, 53, 31471, 1810, 111, 37457, 1556, 10298, 4778, 12321, 131904, 38496, 159, 47599, 84683, 127, 63652, 22618, 15276, 42284, 20051, 2109, 7136, 20004, 7614, 7092, 53400, 34, 8705, 62, 6562, 107172, 48590, 25619, 50994, 2460...

[ 0.1749267578125, 0.2880859375, 0.22509765625, 0.1180419921875, 0.28076171875, 0.2196044921875, 0.2098388671875, 0.268798828125, 0.156494140625, 0.191162109375, 0.01263427734375, 0.1156005859375, 0.14697265625, 0.1607666015625, 0.02276611328125, 0.1763916015625, 0.164794921875, 0.10...

embed

11701099_c0

11701099

haskell

0

Title: What is the GLboolean values denoting true and false? Problem title: What is the GLboolean values denoting true and false? Tags: opengl, haskell Problem: What is the GLboolean values denoting true and false? I am using Haskell's OpenGL.Raw library and I wish to use the GLboolean values for true and false, but th...

What is the GLboolean values denoting true and false? What is the GLboolean values denoting true and false? opengl haskell What GLboolean What is the GLboolean values denoting true and false? I am using Haskell's OpenGL.Raw library and I wish to use the GLboolean values for true and false, but they don't seem to be pre...

[ 0.004364013671875, -0.00171661376953125, 0.00885009765625, -0.0205078125, 0.00323486328125, 0.02587890625, 0.01239013671875, -0.000888824462890625, 0.0128173828125, 0.056396484375, 0.004669189453125, -0.02392578125, -0.00054168701171875, -0.0068359375, -0.0106201171875, 0.011474609375,...

[ 4865, 70, 90799, 142484, 5073, 142424, 8, 157, 1916, 29568, 136, 98320, 9803, 11016, 1556, 142508, 83, 17368, 20625, 13527, 78703, 12248, 434, 35773, 1294, 32599, 4527, 100, 1653, 13, 5983, 61924, 6097, 35978 ]

[ 0.0546875, 0.0401611328125, 0.1712646484375, 0.16162109375, 0.2098388671875, 0.228515625, 0.1007080078125, 0.1400146484375, 0.08502197265625, 0.2161865234375, 0.1466064453125, 0.25537109375, 0.09112548828125, 0.1495361328125, 0.10235595703125, 0.21533203125, 0.033905029296875, 0.03...

embed

63115281_c0

63115281

haskell

0

Title: How do I set a HTTP header for a request with wreq? Problem title: How do I set a HTTP header for a request with wreq? Tags: wreq, haskell Problem: How do I set a HTTP header for a request with wreq? I see there is a likely function to do this of getWith which passes an Option value. However looking up Option ty...

How do I set a HTTP header for a request with wreq? How do I set a HTTP header for a request with wreq? wreq haskell How HTTP Option How do I set a HTTP header for a request with wreq? I see there is a likely function to do this of getWith which passes an Option value. However looking up Option type seems to show somet...

[ 0.0081787109375, 0.0164794921875, 0.00921630859375, 0.0107421875, -0.005950927734375, -0.0238037109375, 0.0002346038818359375, -0.0133056640625, 0.0024566650390625, 0.026611328125, 0.01043701171875, 0.0107421875, -0.01092529296875, -0.0164794921875, -0.0196533203125, -0.008056640625, ...

[ 11249, 87, 5423, 10, 135913, 10336, 56, 100, 50336, 678, 148, 107, 864, 54, 1556, 142508, 86769, 47041, 32354, 903, 2046, 194583, 10922, 34292, 10644, 10176, 3004, 1902, 138414, 831, 6097 ]

[ 0.05401611328125, 0.0072021484375, 0.1683349609375, 0.053497314453125, 0.228271484375, 0.1890869140625, 0.171630859375, 0.0391845703125, 0.16162109375, 0.0792236328125, 0.043914794921875, 0.1876220703125, 0.2012939453125, 0.011932373046875, 0.1004638671875, 0.183349609375, 0.20043945...

embed

17217876_c0

17217876

haskell

0

Title: returning an element extracted from a monad; redundant? Problem title: returning an element extracted from a monad; redundant? Tags: monads, do-notation, haskell Problem: returning an element extracted from a monad; redundant? Are the following two implementations of flatten equivalent for all well-behaved Monad...

returning an element extracted from a monad; redundant? returning an element extracted from a monad; redundant? monads do-notation haskell a flatten1 flatten2 returning an element extracted from a monad; redundant? Are the following two implementations of flatten equivalent for all well-behaved Monads?

[ -0.00007915496826171875, 0.014892578125, 0.00244140625, 0.0062255859375, 0.0048828125, 0.00848388671875, 0.0057373046875, -0.005279541015625, 0.005645751953125, -0.01239013671875, 0.005645751953125, -0.00830078125, -0.0020294189453125, -0.017578125, 0.00494384765625, -0.000823974609375...

[ 30646, 12830, 125663, 2667, 712, 4842, 35405, 18, 7, 54, 157, 22062, 1556, 142508, 49878, 510, 418, 304, 214, 1295, 25632, 6626, 208124, 183234, 756, 5299, 372, 528, 60331, 6468 ]

[ 0.15771484375, 0.1673583984375, 0.155517578125, 0.1402587890625, 0.1708984375, 0.064208984375, 0.1734619140625, 0.08056640625, 0.041168212890625, 0.0711669921875, 0.126220703125, 0.05157470703125, 0.08642578125, 0.21484375, 0.1925048828125, 0.215087890625, 0.047393798828125, 0.0762...

embed

69843667_c0

69843667

haskell

0

Title: transpose a 2d list and convert it to a 1d list Problem title: transpose a 2d list and convert it to a 1d list Tags: haskell, list-comprehension, list Problem: transpose a 2d list and convert it to a 1d list I have a 2d list l, and [l!!y!!x| x<-[0..length l-1], y<-[0..length l-1]] will produce a 1d list where ro...

transpose a 2d list and convert it to a 1d list transpose a 2d list and convert it to a 1d list haskell list-comprehension list l-1 transpose a 2d list and convert it to a 1d list I have a 2d list l, and will produce a 1d list where rows and columns are swapped. How can I implement this without list comprehension(i.e. ...

[ -0.004974365234375, 0.01165771484375, -0.006103515625, -0.01348876953125, -0.0213623046875, -0.0164794921875, -0.00148773193359375, -0.00360107421875, -0.000720977783203125, -0.029541015625, 0.00897216796875, 0.01611328125, 0.01531982421875, 0.0098876953125, -0.025146484375, 0.00256347...

[ 3900, 78381, 116, 71, 5303, 96760, 47, 106, 10, 1556, 142508, 277, 4692, 3220, 96, 5759, 27489, 15555, 136, 3365, 316, 68062, 48398, 29479, 15490, 46683, 6889, 17368, 22288 ]

[ 0.176025390625, 0.14501953125, 0.1162109375, 0.10443115234375, 0.2197265625, 0.1207275390625, 0.0640869140625, 0.0904541015625, 0.042724609375, 0.0806884765625, 0.1822509765625, 0.01031494140625, 0.099853515625, 0.1024169921875, 0.05194091796875, 0.0538330078125, 0.0966796875, 0.13...

embed

33315685_c2

33315685

haskell

2

server.crt, server.pem, localhost:3000, Rebuilt, URL, Trying, Connected, ALPN, Cipher, ALL, EXPORT, EXPORT40, EXPORT56, LOW, RC4, STRENGTH, TLSv1.2, OUT, TLS, Certificate, Status, Client, error:04091077:rsa, routines:INT_RSA_VERIFY:wrong, Closing, Oct, Info, yesod_2EJXksqBDOz5UARIVdQquS:Yesod.Core.Dispatch, Yesod, Cor...

[ -0.010498046875, 0.0087890625, 0.00274658203125, 0.028564453125, 0.0028076171875, -0.0030517578125, -0.0078125, 0.00225830078125, 0.010009765625, 0.024169921875, 0.006500244140625, -0.0213623046875, 0.00872802734375, 0.00848388671875, -0.007720947265625, 0.0009765625, -0.015197753906...

[ 10723, 23150, 18, 4, 72508, 4000, 40294, 36605, 853, 978, 24908, 31862, 40858, 214, 62448, 297, 9804, 34440, 2079, 94266, 58837, 29426, 91599, 2839, 13683, 143141, 81135, 617, 46549, 48262, 20602, 294, 334, 48400, 6, 52001, 83991, 56504, 91...

[ 0.204833984375, 0.06719970703125, 0.154052734375, 0.001312255859375, 0.1817626953125, 0.1156005859375, 0.1298828125, 0.2061767578125, 0.108642578125, 0.1124267578125, 0.1285400390625, 0.159912109375, 0.1512451171875, 0.06451416015625, 0.1502685546875, 0.01983642578125, 0.085388183593...

embed

12675420_c0

12675420

haskell

0

Title: How to use case expression for tuple in Haskell? Problem title: How to use case expression for tuple in Haskell? Tags: switch-statement, tuples, haskell Problem: How to use case expression for tuple in Haskell? I have a problem when using case expression in Haskell. filterSth::[a]->(b,c)->[a] filterSth (x:xs) (b...

How to use case expression for tuple in Haskell? How to use case expression for tuple in Haskell? switch-statement tuples haskell How Haskell x:xs How to use case expression for tuple in Haskell? I have a problem when using case expression in Haskell. can I do something like above ?

[ -0.00396728515625, 0.006591796875, -0.01165771484375, -0.004119873046875, 0.007232666015625, -0.018310546875, 0.005218505859375, 0.00799560546875, 0.03369140625, 0.0027313232421875, 0.015380859375, 0.0218505859375, -0.00041961669921875, -0.0030975341796875, -0.00689697265625, -0.000488...

[ 11249, 47, 4527, 7225, 125195, 370, 8705, 20625, 142508, 100, 23, 101089, 61340, 99726, 1556, 425, 2967, 17368 ]

[ 0.030609130859375, 0.036346435546875, 0.0894775390625, 0.2369384765625, 0.20068359375, 0.10589599609375, 0.2041015625, 0.1082763671875, 0.1961669921875, 0.01131439208984375, 0.0173797607421875, 0.1478271484375, 0.0899658203125, 0.1610107421875, 0.08526611328125, 0.031524658203125, 0....

embed

23436133_c0

23436133

haskell

0

Title: Manually deriving the type `(.) (foldr(++)) (map (:))` Problem title: Manually deriving the type `(.) (foldr(++)) (map (:))` Tags: unification, types, ghci, haskell Problem: Manually deriving the type `(.) (foldr(++)) (map (:))` I'm trying to derive the type of (.) (foldr(++)) (map (:)) I start by deriving the t...

Manually deriving the type `(.) (foldr(++)) (map (:))` Manually deriving the type `(.) (foldr(++)) (map (:))` unification types ghci haskell Manually Manually deriving the type `(.) (foldr(++)) (map (:))` I'm trying to derive the type of (.) (foldr(++)) (map (:)) I start by deriving the type of foldr (++) So Then I der...

[ 0.00299072265625, 0.01953125, -0.014892578125, -0.00341796875, -0.0277099609375, -0.00125885009765625, -0.0125732421875, 0.01287841796875, -0.010986328125, -0.01361083984375, -0.01446533203125, -0.03466796875, 0.00958251953125, -0.0012359619140625, -0.0169677734375, -0.006988525390625,...

[ 111021, 538, 16406, 6496, 10644, 5, 42822, 42, 37223, 62346, 84142, 51, 41274, 52895, 31380, 318, 1556, 142508, 132, 31577, 122, 5844, 111, 4034, 18344, 7569, 22288, 201106, 2046, 4966, 26458, 527, 73265, 14, 100, 18, 87, 33079, 11, 12921...

[ 0.166748046875, 0.039581298828125, 0.1478271484375, 0.0750732421875, 0.192138671875, 0.1485595703125, 0.14111328125, 0.131103515625, 0.1907958984375, 0.1663818359375, 0.0772705078125, 0.108154296875, 0.0933837890625, 0.1593017578125, 0.08941650390625, 0.1337890625, 0.10321044921875, ...

embed

24517995_c0

24517995

haskell

0

Title: Why ByteString is not Vector Word8? Problem title: Why ByteString is not Vector Word8? Tags: bytestring, haskell, performance, vector Problem: Why ByteString is not Vector Word8? Seems like strict ByteString is structuraly same as Vector Word8 . Why ByteString is not deprecated in favor of Vector ? Are there per...

Why ByteString is not Vector Word8? Why ByteString is not Vector Word8? bytestring haskell performance vector Why ByteString Vector Word8 Byte8 Why ByteString is not Vector Word8? Seems like strict ByteString is structuraly same as Vector Word8 . Why ByteString is not deprecated in favor of Vector ? Are there performan...

[ 0.0164794921875, 0.00982666015625, -0.00787353515625, 0.014892578125, -0.01495361328125, -0.0034942626953125, -0.0164794921875, -0.01458740234375, -0.005950927734375, 0.024658203125, 0.0020294189453125, -0.008056640625, -0.0003643035888671875, 0.01519775390625, -0.040283203125, 0.01000...

[ 44084, 3311, 67, 71713, 214, 83, 959, 2609, 18770, 22543, 1019, 390, 91693, 1556, 142508, 23718, 173, 81113, 118990, 5701, 237, 8, 4692, 4460, 10862, 27781, 4271, 56 ]

[ 0.08648681640625, 0.1075439453125, 0.1646728515625, 0.2183837890625, 0.1236572265625, 0.057281494140625, 0.1181640625, 0.1728515625, 0.165771484375, 0.1246337890625, 0.201904296875, 0.08258056640625, 0.208251953125, 0.10284423828125, 0.2076416015625, 0.1573486328125, 0.10986328125, ...

embed

37563975_c0

37563975

haskell

0

Title: Why my Eclipse doesn't mark the reserverd words for Haskell? Problem title: Why my Eclipse doesn't mark the reserverd words for Haskell? Tags: ghc, haskell, eclipse Problem: Why my Eclipse doesn't mark the reserverd words for Haskell? I've installed the plugin for Eclipse Luna: EclipseFP - http://eclip...

Why my Eclipse doesn't mark the reserverd words for Haskell? Why my Eclipse doesn't mark the reserverd words for Haskell? ghc haskell eclipse Why Eclipse Haskell Why my Eclipse doesn't mark the reserverd words for Haskell? I've installed the plugin for Eclipse Luna: EclipseFP - http://eclipsefp.sf.net/updates...

[ -0.00098419189453125, 0.00604248046875, -0.00830078125, 0.0032958984375, -0.006439208984375, -0.000865936279296875, -0.0125732421875, 0.01373291015625, -0.000659942626953125, 0.0269775390625, -0.0098876953125, -0.0279541015625, 0.013427734375, 0.01611328125, -0.0002536773681640625, 0.0...

[ 44084, 234962, 22027, 3768, 18, 16188, 76875, 4216, 34153, 20625, 142508, 759, 100, 31380, 238, 1556, 106371, 184, 20600, 69993, 42873, 51006, 95680, 254, 420, 117008, 27985, 36497, 959, 214, 70488 ]

[ 0.07830810546875, 0.229736328125, 0.06256103515625, 0.041015625, 0.0831298828125, 0.1341552734375, 0.164306640625, 0.120361328125, 0.181640625, 0.117919921875, 0.2435302734375, 0.0181884765625, 0.033111572265625, 0.011871337890625, 0.019927978515625, 0.0845947265625, 0.1199951171875,...

embed

70729598_c0

70729598

haskell

0

Title: Basic Functors in Haskell Problem title: Basic Functors in Haskell Tags: haskell, functor Problem: Basic Functors in Haskell I know that Functor typeclass is defined like so: class Functor f where fmap :: (a -> b) -> f a -> f b In my course it says that this is how a list is made an instance of functor: instance...

Basic Functors in Haskell Basic Functors in Haskell haskell functor Basic Functors Haskell Functor Basic Functors in Haskell I know that Functor typeclass is defined like so: In my course it says that this is how a list is made an instance of functor: Is [] a some kind of synonym for [a] ?

[ 0.00567626953125, -0.0016326904296875, 0.0113525390625, -0.0034332275390625, -0.007568359375, 0.0203857421875, -0.0020904541015625, -0.005279541015625, 0.01806640625, 0.0126953125, -0.023193359375, -0.036865234375, -0.00726318359375, 0.01190185546875, -0.0220947265625, -0.0033721923828...

[ 91692, 28670, 18770, 20625, 142508, 23, 1556, 7477, 7, 3714, 10644, 67413, 83, 61924, 71, 1884, 221, 15411, 903, 3642, 5303, 7228, 110527, 2071, 378, 268, 8562, 164661, 11 ]

[ 0.1529541015625, 0.16357421875, 0.241455078125, 0.1348876953125, 0.2337646484375, 0.051116943359375, 0.099609375, 0.166259765625, 0.00958251953125, 0.0195770263671875, 0.17578125, 0.2288818359375, 0.0037841796875, 0.12646484375, 0.0166168212890625, 0.06378173828125, 0.06402587890625,...

embed

8375006_c0

8375006

haskell

0

Title: Function to map Maybes to a monad Problem title: Function to map Maybes to a monad Tags: monads, standard-library, haskell Problem: Function to map Maybes to a monad I often use expressions of the form maybe (return ()) someFunc someMaybe . Searching for a function Monad m => (a -> m ()) -> Maybe a -> m () on ho...

Function to map Maybes to a monad Function to map Maybes to a monad monads standard-library haskell Maybes Monad Maybe Function to map Maybes to a monad I often use expressions of the form maybe (return ()) someFunc someMaybe . Searching for a function Monad m => (a -> m ()) -> Maybe a -> m () on hoogle doesn't yield a...

[ -0.0167236328125, -0.003387451171875, 0.0205078125, -0.0002498626708984375, -0.0003070831298828125, 0.0152587890625, 0.016357421875, -0.017333984375, -0.00093841552734375, -0.0205078125, -0.004638671875, -0.01507568359375, -0.028564453125, 0.002166748046875, 0.0084228515625, -0.0233154...

[ 28670, 10763, 47, 22288, 83425, 7, 10, 2667, 712, 5570, 150, 2844, 1556, 142508, 60331, 71, 27983, 4527, 125195, 3173, 51139, 65395, 19, 3060, 97249, 238, 82419, 372, 33086, 100, 32354, 347, 44357, 11, 33079, 98, 28994, 133, 29458, 16750,...

[ 0.183837890625, 0.0465087890625, 0.176025390625, 0.2457275390625, 0.3076171875, 0.1954345703125, 0.0911865234375, 0.16845703125, 0.21533203125, 0.1326904296875, 0.06146240234375, 0.1077880859375, 0.10400390625, 0.2122802734375, 0.174560546875, 0.163818359375, 0.07550048828125, 0.05...

embed

40106559_c0

40106559

haskell

0

Title: Tree to a list of possible paths (values) Problem title: Tree to a list of possible paths (values) Tags: haskell Problem: Tree to a list of possible paths (values) Given a tree data structure defined as data Tree = Node Int Tree Tree | Leaf How can one transform it into a list of values along all paths? For exam...

Tree to a list of possible paths (values) Tree to a list of possible paths (values) haskell Tree Node Leaf Tree to a list of possible paths (values) Given a tree data structure defined as How can one transform it into a list of values along all paths? For example Node 1 (Node 2 Leaf Leaf) (Node 3 Leaf Leaf) should tran...

[ 0.030029296875, -0.00958251953125, -0.0166015625, -0.01263427734375, 0.0029449462890625, 0.0169677734375, -0.0291748046875, -0.02197265625, -0.0026397705078125, -0.037841796875, -0.0225830078125, -0.0155029296875, -0.0026397705078125, 0.01470947265625, 0.0002994537353515625, 0.00537109...

[ 101344, 47, 5303, 111, 7722, 60875, 7, 27494, 10, 1556, 142508, 438, 112, 636, 2407, 77878, 53201, 2053, 45646, 61924, 11249, 831, 27198, 3934, 142424, 33233, 756, 106, 5021, 116, 138, 5608, 3900, 19309, 133063, 96386 ]

[ 0.255615234375, 0.165283203125, 0.166748046875, 0.023681640625, 0.167236328125, 0.198974609375, 0.070556640625, 0.156494140625, 0.0191192626953125, 0.141357421875, 0.244140625, 0.149169921875, 0.1558837890625, 0.061920166015625, 0.139892578125, 0.010009765625, 0.241455078125, 0.161...

embed

50415146_c0

50415146

haskell

0

Title: Weird type syntax in data constructor Problem title: Weird type syntax in data constructor Tags: syntax, haskell Problem: Weird type syntax in data constructor I've found some code data Tree c a = Node String [Tree c a] | NodeWithCleanup c [Tree c a] | Leaf a And I don't understand why it's necessary to add [Tre...

Weird type syntax in data constructor Weird type syntax in data constructor syntax haskell Weird Tree Node NodeWithCleanup Leaf Weird type syntax in data constructor I've found some code And I don't understand why it's necessary to add [Tree c a] . I don't know this syntax, can you explain it to me ?

[ 0.005096435546875, 0.004547119140625, -0.015625, 0.009521484375, 0.0140380859375, 0.005035400390625, -0.0101318359375, 0.007568359375, 0.0026092529296875, -0.0267333984375, -0.005889892578125, -0.042236328125, 0.005096435546875, -0.00616455078125, -0.01129150390625, -0.01068115234375, ...

[ 1401, 82249, 10644, 6002, 86531, 23, 2053, 64549, 748, 1556, 142508, 101344, 438, 112, 194583, 34677, 2037, 636, 2407, 14037, 18151, 2301, 18, 28219, 15400, 63559, 47, 15190, 62731, 13, 501, 10, 268, 3714, 903, 831, 73342 ]

[ 0.0882568359375, 0.2138671875, 0.22509765625, 0.1529541015625, 0.183837890625, 0.044921875, 0.11767578125, 0.1851806640625, 0.1036376953125, 0.12060546875, 0.2152099609375, 0.2171630859375, 0.1220703125, 0.10113525390625, 0.110595703125, 0.16357421875, 0.1226806640625, 0.0382385253...

embed

27280187_c0

27280187

haskell

0

Title: Haskell Platform through Macports Problem title: Haskell Platform through Macports Tags: haskell-platform, macports, haskell Problem: Haskell Platform through Macports I have installed the Haskell Platform through MacPorts. Although many Haskell libraries are available as MacPorts packages, some are not. What is...

Haskell Platform through Macports Haskell Platform through Macports haskell-platform macports haskell Haskell Platform Macports Haskell Platform through Macports I have installed the Haskell Platform through MacPorts. Although many Haskell libraries are available as MacPorts packages, some are not. What is the proper w...

[ -0.00604248046875, -0.0033111572265625, 0.00152587890625, 0.01422119140625, 0.0024261474609375, 0.00274658203125, 0.002105712890625, -0.014892578125, -0.000316619873046875, -0.00299072265625, 0.006103515625, -0.0185546875, 0.0196533203125, 0.005950927734375, 0.0108642578125, -0.0140380...

[ 20625, 142508, 70968, 8305, 4727, 6982, 7, 1556, 172121, 19138, 20600, 60006, 5941, 35773, 19882, 237, 98169, 3060, 959, 27798, 3917, 47, 2856, 25553, 6892, 171763 ]

[ 0.1632080078125, 0.272705078125, 0.2037353515625, 0.08355712890625, 0.1195068359375, 0.24560546875, 0.0460205078125, 0.0902099609375, 0.1292724609375, 0.0814208984375, 0.1822509765625, 0.2489013671875, 0.0206298828125, 0.1817626953125, 0.0770263671875, 0.007232666015625, 0.1765136718...

embed

21860901_c1

21860901

haskell

1

handles the content and the teaser correctly. But the tags are not seen. They just end up in the HTML output. The HTML input is like: . . . </head> <body> <div id="content"> <h1 class="title">2013-06-30-test-post</h1> --- title: My first org-mode post tags: emacs, org-mode --- <p> Does it work? </p>  <p> ...

[ 0.0059814453125, 0.00811767578125, 0.01513671875, -0.0281982421875, 0.018798828125, 0.0047607421875, -0.0225830078125, 0.0030059814453125, -0.004241943359375, -0.04150390625, 0.00555419921875, 0.02587890625, -0.0211181640625, -0.00421142578125, 0.02294921875, -0.0004425048828125, -0....

[ 34831, 7, 10941, 136, 214295, 26785, 538, 4966, 69141, 621, 959, 51592, 3564, 1257, 19097, 140992, 107730, 1884, 31251, 37873, 30618, 69246, 7735, 1197, 6954, 4594, 44759, 5117, 30910, 61170, 1305, 352, 2263, 101790, 442, 4488, 9, 195879, 1...

[ 0.156982421875, 0.07794189453125, 0.1724853515625, 0.0213775634765625, 0.293212890625, 0.131103515625, 0.030914306640625, 0.043975830078125, 0.233154296875, 0.03021240234375, 0.08837890625, 0.1622314453125, 0.09228515625, 0.0426025390625, 0.2181396484375, 0.1549072265625, 0.189575195...

embed

22084187_c0

22084187

haskell

0

Title: Haskell compare NaN values Problem title: Haskell compare NaN values Tags: haskell Problem: Haskell compare NaN values I've got a function which is returning a Float.(average) Then I get that output and compare it within another function | average == 0 = "0" | average >= 0 = (show average) But when the average i...

Haskell compare NaN values Haskell compare NaN values haskell Haskell NaN Haskell compare NaN values I've got a function which is returning a Float.(average) Then I get that output and compare it within another function But when the average is NaN I can't do this comparing cause NaN seems to be /=0. How can I compare a...

[ -0.0093994140625, -0.01708984375, 0.000888824462890625, -0.007049560546875, 0.00616455078125, 0.0106201171875, 0.042236328125, -0.01507568359375, -0.006500244140625, 0.0478515625, 0.0091552734375, 0.00543212890625, 0.00823974609375, -0.01495361328125, 0.0034027099609375, -0.00579833984...

[ 20625, 142508, 69101, 353, 839, 142424, 1556, 87, 4163, 32354, 30646, 38699, 257, 8216, 29838, 140992, 28032, 15700, 4966, 3229, 70, 83080, 831, 18, 54, 37397, 214, 22304, 37202, 248, 145407, 11249, 34292 ]

[ 0.137451171875, 0.2420654296875, 0.2252197265625, 0.200927734375, 0.2425537109375, 0.2176513671875, 0.118896484375, 0.00067138671875, 0.0186920166015625, 0.1646728515625, 0.108642578125, 0.162353515625, 0.0887451171875, 0.1351318359375, 0.14892578125, 0.12890625, 0.057586669921875, ...

embed

54658737_c0

54658737

haskell

0

Title: How to delete an element from list and all his duplicates? Problem title: How to delete an element from list and all his duplicates? Tags: haskell Problem: How to delete an element from list and all his duplicates? I need to find max and min elements from list and remove them and their duplicate. I use maximum(l...

How to delete an element from list and all his duplicates? How to delete an element from list and all his duplicates? haskell list How How to delete an element from list and all his duplicates? I need to find max and min elements from list and remove them and their duplicate. I use to find max and min but don't know ho...

[ -0.013427734375, 0.0174560546875, -0.0025787353515625, -0.006256103515625, -0.01263427734375, 0.0152587890625, 0.0230712890625, 0.009765625, 0.0038604736328125, -0.034423828125, -0.00970458984375, -0.00183868408203125, 0.01519775390625, -0.00518798828125, -0.00909423828125, 0.004028320...

[ 11249, 47, 154109, 12830, 1295, 5303, 136, 756, 1919, 171763, 1636, 32, 1556, 142508, 142, 87, 3871, 7413, 18389, 881, 80854, 87388, 2856, 67, 4527, 1284, 18, 3714, 3642, 111 ]

[ 0.1124267578125, 0.10791015625, 0.258056640625, 0.2056884765625, 0.1900634765625, 0.2197265625, 0.1312255859375, 0.1024169921875, 0.073974609375, 0.2386474609375, 0.1290283203125, 0.010711669921875, 0.1387939453125, 0.225830078125, 0.0360107421875, 0.00335693359375, 0.07415771484375,...

embed

36393570_c0

36393570

haskell

0

Title: Is it safe to postulate unit types are equal? Problem title: Is it safe to postulate unit types are equal? Tags: haskell, types Problem: Is it safe to postulate unit types are equal? Is it safe to postulate that all types of kind () are the same? That is, can the following be used to break type safety? -- Bad po...

Is it safe to postulate unit types are equal? Is it safe to postulate unit types are equal? haskell types Bad Refl Is it safe to postulate unit types are equal? Is it safe to postulate that all types of kind () are the same? That is, can the following be used to break type safety?

[ 0.01165771484375, 0.00640869140625, 0.01116943359375, -0.002471923828125, -0.006622314453125, -0.031982421875, -0.01165771484375, -0.0084228515625, -0.0035858154296875, -0.019287109375, -0.006988525390625, -0.0018310546875, 0.0234375, 0.007659912109375, -0.00628662109375, 0.00396728515...

[ 46002, 49489, 2182, 25072, 52895, 105950, 1556, 142508, 12745, 53295, 141, 2071, 442, 621, 756, 8562, 5701, 25632, 11814, 36356, 10644, 81900 ]

[ 0.1632080078125, 0.1756591796875, 0.05694580078125, 0.18408203125, 0.215576171875, 0.158447265625, 0.0830078125, 0.169189453125, 0.08453369140625, 0.1109619140625, 0.028900146484375, 0.0110321044921875, 0.0105743408203125, 0.0269775390625, 0.056732177734375, 0.140869140625, 0.1094970...

embed

16505410_c0

16505410

haskell

0

Title: Seeking example of how to use nntp package Problem title: Seeking example of how to use nntp package Tags: monads, nntp, haskell Problem: Seeking example of how to use nntp package I still quite new to the whole monad/IO thing, and I am having trouble using the nntp package . Could someone show me an example of ...

Seeking example of how to use nntp package Seeking example of how to use nntp package monads nntp haskell Seeking Seeking example of how to use nntp package I still quite new to the whole monad/IO thing, and I am having trouble using the nntp package . Could someone show me an example of how to use it please? eg. How t...

[ 0.000789642333984375, 0.00080108642578125, -0.00701904296875, 0.027099609375, 0.00830078125, 0.033203125, 0.0118408203125, -0.00830078125, 0.01263427734375, -0.02783203125, 0.005218505859375, -0.0233154296875, -0.00799560546875, 0.006744384765625, -0.0169677734375, -0.0159912109375, ...

[ 6872, 6048, 27781, 3642, 4527, 653, 660, 254, 98169, 2667, 712, 7, 1556, 142508, 7464, 32233, 3525, 17780, 13580, 63134, 17368, 7639, 47, 442, 22936, 11249, 2046, 5303, 5582, 11338, 21115, 28032, 4568, 744, 21974 ]

[ 0.064697265625, 0.0233306884765625, 0.177734375, 0.051666259765625, 0.1165771484375, 0.092529296875, 0.184814453125, 0.2457275390625, 0.2196044921875, 0.1160888671875, 0.1744384765625, 0.03857421875, 0.1195068359375, 0.229248046875, 0.010650634765625, 0.020111083984375, 0.07147216796...

embed

37379507_c0

37379507

haskell

0

Title: Getting params as a list of key/value tuple Problem title: Getting params as a list of key/value tuple Tags: yesod, haskell Problem: Getting params as a list of key/value tuple I'm implementing a RESTful url, so I could filter my query with for example /api/v1.0/events?filter[title]="foo"&filter[content]="bar" I...

Getting params as a list of key/value tuple Getting params as a list of key/value tuple yesod haskell Getting v1.0 Getting params as a list of key/value tuple I'm implementing a RESTful url, so I could filter my query with for example /api/v1.0/events?filter[title]="foo"&filter[content]="bar" Is there an existing way t...

[ 0.00360107421875, 0.000202178955078125, -0.01055908203125, -0.038818359375, -0.0133056640625, 0.002838134765625, -0.01043701171875, -0.01446533203125, 0.005523681640625, -0.04052734375, 0.01611328125, -0.0113525390625, -0.0142822265625, 0.00860595703125, -0.0164794921875, -0.0046386718...

[ 210732, 121, 4432, 237, 5303, 22799, 64, 27494, 13, 370, 8705, 2422, 23722, 1556, 142508, 81, 102107, 111, 29479, 627, 21828, 7844, 25002, 5809, 46312, 41, 1294, 100, 248, 40897, 334, 90141, 120337, 5440, 3584, 31, 1230, 69246, 1299, 1445...

[ 0.1248779296875, 0.199462890625, 0.252197265625, 0.1165771484375, 0.15869140625, 0.141845703125, 0.0526123046875, 0.152587890625, 0.0262603759765625, 0.1099853515625, 0.2037353515625, 0.1158447265625, 0.173095703125, 0.105712890625, 0.2261962890625, 0.0703125, 0.156982421875, 0.031...

embed

39013007_c0

39013007

haskell

0

Title: recursive instances in haskell Problem title: recursive instances in haskell Tags: haskell, typeclass, recursion Problem: recursive instances in haskell When using the following code, I get the error message below for the recursive usage of toInt module Intro0 where data Zero data Succ n Code signals: a, the, In...

recursive instances in haskell recursive instances in haskell haskell typeclass recursion a the Intro0 Zero Succ Nat Could EPhantomTypes.hs:10:10-32 Note Defined EPhantomTypes.hs:10:10 EPhantomTypes.hs:8:10 recursive instances in haskell When using the following code, I get the error message below for the recursive usa...

[ -0.0181884765625, -0.00787353515625, -0.0019989013671875, 0.0228271484375, -0.01446533203125, 0.00946044921875, 0.01123046875, 0.004058837890625, 0.004150390625, -0.0238037109375, -0.01177978515625, -0.0194091796875, 0.0098876953125, 0.025146484375, 0.0274658203125, -0.01177978515625, ...

[ 195625, 5844, 110527, 23, 1556, 142508, 10644, 67413, 1830, 10, 70, 360, 2955, 2389, 83947, 1832, 10060, 68875, 191147, 1121, 5928, 196707, 127, 15110, 108760, 18622, 262, 5983, 26201, 1019, 17368, 25632, 18151, 18499, 26008, 35064, 127689, 4...

[ 0.257568359375, 0.169921875, 0.2412109375, 0.03350830078125, 0.15673828125, 0.22705078125, 0.1356201171875, 0.1915283203125, 0.0909423828125, 0.052978515625, 0.000244140625, 0.0643310546875, 0.1534423828125, 0.18896484375, 0.159912109375, 0.10107421875, 0.1236572265625, 0.134765625...

embed

23359525_c0

23359525

haskell

0

Title: Best way to send 10GB vector across network in Haskell Problem title: Best way to send 10GB vector across network in Haskell Tags: haskell Problem: Best way to send 10GB vector across network in Haskell I am curious to know what the best way to send 10 GB once over the network in Haskell? I don't want to send it...

Best way to send 10GB vector across network in Haskell Best way to send 10GB vector across network in Haskell haskell Best Haskell Best way to send 10GB vector across network in Haskell I am curious to know what the best way to send 10 GB once over the network in Haskell? I don't want to send it as binary without havin...

[ 0.0103759765625, 0.0208740234375, -0.0172119140625, 0.00311279296875, 0.00014400482177734375, -0.000644683837890625, -0.01080322265625, -0.01385498046875, -0.00799560546875, -0.03564453125, 0.022705078125, -0.033935546875, 0.0086669921875, 0.01104736328125, -0.0164794921875, 0.02746582...

[ 11345, 3917, 47, 25379, 209, 8359, 173, 18770, 36880, 33120, 23, 20625, 142508, 1556, 193844, 3714, 2367, 2965, 20331, 24145, 645, 70, 3444, 237, 2394, 6635, 33022, 8, 40899, 64, 66332, 442, 13695, 81113, 21, 3285 ]

[ 0.1339111328125, 0.1055908203125, 0.07745361328125, 0.16845703125, 0.1937255859375, 0.21044921875, 0.198974609375, 0.2342529296875, 0.1837158203125, 0.1669921875, 0.07611083984375, 0.1575927734375, 0.258056640625, 0.1400146484375, 0.065673828125, 0.015228271484375, 0.00347900390625, ...

embed

51762890_c0

51762890

haskell

0

Title: How can I create my own list in Haskell? Problem title: How can I create my own list in Haskell? Tags: list, haskell Problem: How can I create my own list in Haskell? I would like to create my own list in Haskell where I could put in the number 6 and get the result [1,2,3,4,5,6] I thought I could write something...

How can I create my own list in Haskell? How can I create my own list in Haskell? list haskell How Haskell n-1 How can I create my own list in Haskell? I would like to create my own list in Haskell where I could put in the number 6 and get the result [1,2,3,4,5,6] I thought I could write something like Could someone he...

[ 0.00131988525390625, 0.01263427734375, -0.00390625, 0.01116943359375, 0, 0.000652313232421875, -0.006805419921875, 0.0013427734375, 0.01141357421875, -0.0238037109375, 0.00848388671875, -0.041259765625, 0.01177978515625, 0.0255126953125, 0.00604248046875, 0.0023956298828125, 0.010864...

[ 11249, 831, 87, 28282, 759, 10002, 5303, 23, 20625, 142508, 1556, 653, 5759, 2806, 1884, 5809, 3884, 14012, 305, 2046, 16750, 133063, 82449, 104629, 17569, 33022, 191147, 22008, 4358 ]

[ 0.0882568359375, 0.10076904296875, 0.055816650390625, 0.18603515625, 0.1123046875, 0.2042236328125, 0.2734375, 0.09228515625, 0.1851806640625, 0.26171875, 0.161865234375, 0.0899658203125, 0.1832275390625, 0.039794921875, 0.0950927734375, 0.0474853515625, 0.046295166015625, 0.164672...

embed

47599616_c0

47599616

haskell

0

Title: In Haskell (max 3 5) * 2 => 10 Problem title: In Haskell (max 3 5) * 2 => 10 Tags: haskell Problem: In Haskell (max 3 5) * 2 => 10 This is my first day with Haskell, Can you please explain, how this works. I assume, first the compiler should work on finding the max value among 3 and 5 and then multiply the...

In Haskell (max 3 5) * 2 => 10 In Haskell (max 3 5) * 2 => 10 haskell Haskell In Haskell (max 3 5) * 2 => 10 This is my first day with Haskell, Can you please explain, how this works. I assume, first the compiler should work on finding the max value among 3 and 5 and then multiply the result by 2. Whereas, Haskel...

[ 0.00098419189453125, -0.00494384765625, 0.0263671875, 0.01165771484375, 0.0013275146484375, 0.0341796875, -0.000823974609375, 0.0023193359375, 0.01104736328125, -0.0257568359375, 0.0013275146484375, -0.011474609375, -0.00372314453125, -0.00775146484375, 0.00147247314453125, -0.01354980...

[ 360, 20625, 142508, 24084, 138, 21162, 661, 116, 5386, 209, 1556, 44357, 5117, 5155, 678, 4171, 22936, 73342, 3642, 903, 43240, 41591, 9969, 34759, 5608, 4488, 90791, 18389, 34292, 54940, 136, 190, 6024, 62479, 16750, 390, 787, 78662, 162, ...

[ 0.0936279296875, 0.1776123046875, 0.276611328125, 0.2127685546875, 0.1827392578125, 0.2734375, 0.14404296875, 0.2039794921875, 0.0227203369140625, 0.2125244140625, 0.1546630859375, 0.0906982421875, 0.0634765625, 0.0802001953125, 0.0643310546875, 0.018463134765625, 0.020355224609375, ...

embed

23471594_c1

23471594

haskell

1

<- forkIO $ mapM_ (\a -> printf "pushing %c... " a >> pushStack s a >> threadDelay 100000) ['a' .. 'z'] _ <- forkIO $ do replicateM 13 (popStack s) >>= printf "\npopped 13 elems: %s\n" replicateM 13 (popStack s) >>= printf "\npopped 13 elems: %s\n" threadDelay (5*10^6) putStrLn "Done" Code signals: MVar, Control.Concu...

[ 0.0159912109375, -0.006927490234375, -0.0296630859375, 0.000408172607421875, -0.007232666015625, 0.0030670166015625, 0.017822265625, 0.000461578369140625, 0.00081634521484375, -0.037353515625, 0.0274658203125, -0.00063323974609375, 0.0038299560546875, -0.0130615234375, 0.0022125244140625...

[ 100, 92, 17780, 3650, 22288, 594, 454, 11, 28412, 420, 1766, 54700, 44, 10, 25944, 42378, 2594, 91, 86997, 4657, 5259, 77433, 77495, 169, 143126, 67, 702, 33554, 771, 48398, 88, 195, 58, 11516, 963, 59690, 3884, 71713, 60728, 28864, 260...

[ 0.16845703125, 0.151123046875, 0.25439453125, 0.127197265625, 0.1588134765625, 0.111572265625, 0.042724609375, 0.057861328125, 0.162109375, 0.07781982421875, 0.1802978515625, 0.158447265625, 0.004425048828125, 0.048126220703125, 0.17724609375, 0.122802734375, 0.0970458984375, 0.050...

embed

29144220_c0

29144220

haskell

0

Title: How can I calculate Σ_{i=m}^n (m+i)^n? Problem title: How can I calculate Σ_{i=m}^n (m+i)^n? Tags: haskell Problem: How can I calculate Σ_{i=m}^n (m+i)^n? I'm currently trying to calculate the following sum: sum2015 :: Integer->Integer->Integer sum2015 m n | m>n = 0 | otherwise = (m+m)^n + sum2015 (m+1) n As an ...

How can I calculate Σ_{i=m}^n (m+i)^n? How can I calculate Σ_{i=m}^n (m+i)^n? haskell How sum2015 Integer How can I calculate Σ_{i=m}^n (m+i)^n? I'm currently trying to calculate the following sum: As an example, sum2015 0 1 should return 1 . However, it returns 2 . What did I do wrong?

[ -0.01318359375, -0.00738525390625, 0.0012969970703125, 0.0028839111328125, -0.00897216796875, 0.00958251953125, 0.01165771484375, 0.01226806640625, 0.0135498046875, 0.00537109375, 0.01904296875, -0.0260009765625, 0.00433349609375, 0.00579833984375, 0.0172119140625, 0.005126953125, 0....

[ 11249, 831, 87, 74481, 67, 5127, 454, 14, 1369, 39, 8353, 19, 1328, 1556, 142508, 10554, 5357, 44401, 82424, 31577, 25632, 27781, 757, 106, 5608, 30646, 33306, 116, 6, 44691 ]

[ 0.0855712890625, 0.06304931640625, 0.0303497314453125, 0.1905517578125, 0.05126953125, 0.1591796875, 0.050048828125, 0.157470703125, 0.0284423828125, 0.1378173828125, 0.060272216796875, 0.1309814453125, 0.197509765625, 0.10150146484375, 0.1983642578125, 0.18994140625, 0.263427734375,...

embed

1960657_c0

1960657

haskell

0

Title: Haskell type cast problem Problem title: Haskell type cast problem Tags: types, haskell, casting Problem: Haskell type cast problem Example code: fac :: Int → Int fac 0 = 1 fac n = n * fac (n-1) main = do putStrLn show fac 10 Error: Couldnt match expected type 'String' against inferred type 'a -> String' In the ...

Haskell type cast problem Haskell type cast problem types haskell casting Haskell n-1 Couldnt Haskell type cast problem Example code: Error:

[ -0.00015544891357421875, 0.00174713134765625, 0.004119873046875, 0.032958984375, 0.00445556640625, -0.0177001953125, -0.006805419921875, 0.0020599365234375, -0.00543212890625, -0.0029449462890625, -0.009521484375, -0.0380859375, -0.00958251953125, 0.0019073486328125, -0.007598876953125, ...

[ 20625, 142508, 10644, 37702, 2967, 52895, 1556, 176050, 653, 5759, 191147, 660, 89536, 18151, 212059, 12 ]

[ 0.1480712890625, 0.2149658203125, 0.201171875, 0.185302734375, 0.191162109375, 0.1805419921875, 0.136962890625, 0.1680908203125, 0.06719970703125, 0.1334228515625, 0.1158447265625, 0.1236572265625, 0.128173828125, 0.129150390625, 0.1947021484375, 0.0216522216796875 ]

embed

72390984_c0

72390984

haskell

0

Title: Confusion about data types in Haskell Problem title: Confusion about data types in Haskell Tags: types, haskell Problem: Confusion about data types in Haskell I have to write a simple pi approximation and I did and it works fine, but in the task it says to write a function with the header "pi_approx :: Int -> Do...

Confusion about data types in Haskell Confusion about data types in Haskell types haskell Confusion Haskell pi_approx pi2_approx x-1 Double Confusion about data types in Haskell I have to write a simple pi approximation and I did and it works fine, but in the task it says to write a function with the header "pi_approx ...

[ 0.0130615234375, -0.006072998046875, 0.008056640625, 0.006256103515625, 0.0040283203125, 0.00860595703125, -0.003265380859375, -0.0233154296875, 0.0020599365234375, 0.0135498046875, -0.0045166015625, -0.0201416015625, 0.01495361328125, 0.0037994384765625, 0.006195068359375, 0.006134033...

[ 1657, 92105, 1672, 2053, 52895, 23, 20625, 142508, 1556, 2147, 2631, 64101, 304, 1022, 5759, 107172, 33022, 8781, 35707, 53950, 43240, 5885, 66211, 17378, 32354, 10336, 1434, 1984, 360, 33079, 18151, 15490, 9790, 4527, 21635, 11343, 10644, 18...

[ 0.060302734375, 0.221435546875, 0.050872802734375, 0.1639404296875, 0.266845703125, 0.021392822265625, 0.156982421875, 0.2734375, 0.1298828125, 0.2298583984375, 0.07318115234375, 0.2529296875, 0.1761474609375, 0.082275390625, 0.160888671875, 0.27880859375, 0.0887451171875, 0.089294...

embed

27630269_c0

27630269

haskell

0

Title: Parsing function application with Happy Problem title: Parsing function application with Happy Tags: parsing, haskell, happy Problem: Parsing function application with Happy How would I parse something like f x y Into APPLY (APPLY f x) y using Happy? Right now I have a rule that says %left APP Expr : Expr Expr %...

Parsing function application with Happy Parsing function application with Happy parsing haskell happy Parsing Happy APPLY APP Expr Parsing function application with Happy How would I parse something like Into using Happy? Right now I have a rule that says But that parses the above as

[ 0.0184326171875, -0.006134033203125, 0.021240234375, 0.0196533203125, -0.0147705078125, 0.02392578125, -0.0045166015625, -0.0096435546875, 0.0257568359375, -0.0086669921875, 0.01373291015625, -0.0164794921875, -0.01318359375, 0.0030364990234375, 0.013671875, 0.00933837890625, -0.0040...

[ 2392, 6953, 32354, 38415, 678, 32506, 366, 1556, 142508, 17723, 66440, 19917, 60075, 42, 2806, 184, 9844, 1884, 360, 188, 17368, 5036, 79986, 5908, 36917, 237 ]

[ 0.1766357421875, 0.144775390625, 0.175048828125, 0.1656494140625, 0.1312255859375, 0.25390625, 0.1795654296875, 0.08740234375, 0.1810302734375, 0.1856689453125, 0.171875, 0.1380615234375, 0.062255859375, 0.0648193359375, 0.033355712890625, 0.134033203125, 0.034698486328125, 0.05142...

embed

70812567_c0

70812567

haskell

0

Title: Quasiquotes escaping Problem title: Quasiquotes escaping Tags: quasiquotes, haskell, megaparsec, parsec Problem: Quasiquotes escaping I would like to add my new language to Haskell using the Quasiquotes, but the language itself uses |] as a keyword. Is there some way, how to: a) Escape |] , so it is passed to my...

Quasiquotes escaping Quasiquotes escaping quasiquotes haskell megaparsec parsec Quasiquotes Quasiquotes escaping I would like to add my new language to Haskell using the Quasiquotes, but the language itself uses |] as a keyword. Is there some way, how to: a) Escape |] , so it is passed to my language b) Let the parser ...

[ 0.01458740234375, 0.01324462890625, 0.00811767578125, 0.00133514404296875, -0.031982421875, 0.0106201171875, -0.01220703125, 0.0001373291015625, -0.0140380859375, -0.004608154296875, -0.002960205078125, -0.004638671875, 0.009765625, 0.00225830078125, 0.0191650390625, -0.0101318359375, ...

[ 19559, 172, 68726, 7, 38940, 10366, 12404, 1556, 142508, 31534, 2500, 39797, 366, 1884, 15190, 3525, 46876, 47, 20625, 17368, 1284, 68034, 4527, 58745, 268, 237, 10, 166117, 3060, 3917, 3642, 16, 181540, 115081, 876, 10842, 2189, 28288, 322...

[ 0.1806640625, 0.188720703125, 0.246826171875, 0.05999755859375, 0.1990966796875, 0.1507568359375, 0.24951171875, 0.1444091796875, 0.265625, 0.1239013671875, 0.0936279296875, 0.1705322265625, 0.108154296875, 0.054779052734375, 0.1400146484375, 0.07745361328125, 0.2188720703125, 0.08...

embed

74187378_c0

74187378

haskell

0

Title: Pattern Maching IO variables in haskell Problem title: Pattern Maching IO variables in haskell Tags: monads, haskell, io Problem: Pattern Maching IO variables in haskell Currently I have a function getFP :: IO [String] -> Maybe (FilePath) . What I want to do is something equivalent for getFP [] = Nothing if the ...

Pattern Maching IO variables in haskell Pattern Maching IO variables in haskell monads haskell io Pattern Maching Maybe FilePath Nothing Pattern Maching IO variables in haskell Currently I have a function getFP :: IO [String] -> Maybe (FilePath) . What I want to do is something equivalent for getFP [] = Nothing if the ...

[ -0.007232666015625, -0.0002536773681640625, -0.00101470947265625, 0.002471923828125, -0.004638671875, 0.00677490234375, -0.00002181529998779297, -0.0011138916015625, 0.008544921875, 0.00885009765625, 0.0267333984375, -0.034912109375, -0.00836181640625, -0.016357421875, 0.001800537109375,...

[ 9876, 22766, 60154, 214, 17780, 77336, 23, 1556, 142508, 2667, 712, 22995, 83425, 42724, 683, 10519, 182747, 32354, 2046, 51006, 1984, 71713, 33079, 174350, 3444, 183234, 378, 2203, 2174, 10750, 509, 351, 79315 ]

[ 0.1607666015625, 0.1138916015625, 0.177734375, 0.09228515625, 0.2093505859375, 0.2288818359375, 0.011474609375, 0.1566162109375, 0.237548828125, 0.05023193359375, 0.08074951171875, 0.177734375, 0.275390625, 0.1729736328125, 0.10791015625, 0.1734619140625, 0.198974609375, 0.13391113...

embed

42612107_c0

42612107

haskell

0

Title: Implicit pattern matching in Haskell Problem title: Implicit pattern matching in Haskell Tags: performance, pattern-matching, haskell Problem: Implicit pattern matching in Haskell Should one expect performance differences between these two empty s, or is it merely a matter of stylistic preference? foo list = cas...

Implicit pattern matching in Haskell Implicit pattern matching in Haskell performance pattern-matching haskell Implicit Haskell Implicit pattern matching in Haskell Should one expect performance differences between these two empty s, or is it merely a matter of stylistic preference?

[ 0.003570556640625, 0.0052490234375, -0.00537109375, -0.0030517578125, -0.00390625, -0.00152587890625, -0.0274658203125, -0.0126953125, 0.02197265625, 0.005279541015625, 0.039306640625, 0.0135498046875, -0.01019287109375, 0.0067138671875, 0.0013885498046875, -0.00701904296875, 0.00491...

[ 29128, 60923, 103510, 14858, 20625, 142508, 214, 23718, 98753, 1556, 41206, 60212, 6626, 201505, 91, 182352, 205537 ]

[ 0.1259765625, 0.211181640625, 0.20703125, 0.178955078125, 0.10772705078125, 0.215576171875, 0.0056304931640625, 0.1864013671875, 0.179931640625, 0.11065673828125, 0.09552001953125, 0.12274169921875, 0.033721923828125, 0.2232666015625, 0.1502685546875, 0.12646484375, 0.11224365234375 ...

embed

3848492_c0

3848492

haskell

0

Title: Advantages of subtyping over typeclasses Problem title: Advantages of subtyping over typeclasses Tags: haskell, oop, programming-languages, functional-programming, scala Problem: Advantages of subtyping over typeclasses What are the advantages of OOP subtyping over typeclasses, if any? In other words, now that w...

Advantages of subtyping over typeclasses Advantages of subtyping over typeclasses haskell oop programming-languages functional-programming scala Advantages Advantages of subtyping over typeclasses What are the advantages of OOP subtyping over typeclasses, if any? In other words, now that we have typeclasses, is there a...

[ 0.000484466552734375, 0.0010986328125, 0.021240234375, -0.00101470947265625, 0.0003833770751953125, -0.01513671875, -0.0140380859375, 0.01129150390625, 0.0162353515625, -0.00396728515625, -0.022705078125, -0.0206298828125, 0.00750732421875, 0.00836181640625, -0.01190185546875, -0.01007...

[ 3145, 2187, 92674, 111, 1614, 46280, 214, 645, 10644, 67413, 1556, 142508, 32500, 56037, 449, 196651, 123309, 28966, 146232, 4865, 621, 70, 92940, 7, 180, 20880, 90, 2174, 2499, 5036, 765, 31635, 7464, 4527, 87, 444, 10, 152653, 11, 77848...

[ 0.0802001953125, 0.1527099609375, 0.138916015625, 0.043731689453125, 0.2244873046875, 0.2413330078125, 0.129150390625, 0.1236572265625, 0.18603515625, 0.22216796875, 0.0831298828125, 0.209228515625, 0.18994140625, 0.0892333984375, 0.012786865234375, 0.1136474609375, 0.12744140625, ...

embed

31680573_c0

31680573

haskell

0

Title: How can I install a recent version of the Haskell GHC compiler on Ubuntu? Problem title: How can I install a recent version of the Haskell GHC compiler on Ubuntu? Tags: haskell, ghc Problem: How can I install a recent version of the Haskell GHC compiler on Ubuntu? I noticed that I'm running an old version of GHC...

How can I install a recent version of the Haskell GHC compiler on Ubuntu? How can I install a recent version of the Haskell GHC compiler on Ubuntu? haskell ghc How Haskell GHC Ubuntu How can I install a recent version of the Haskell GHC compiler on Ubuntu? I noticed that I'm running an old version of GHC on Ubuntu 15.0...

[ -0.0004329681396484375, 0.01043701171875, 0.0263671875, -0.0135498046875, 0.00140380859375, 0.0177001953125, -0.0137939453125, -0.0284423828125, -0.0079345703125, 0.01239013671875, -0.003997802734375, -0.043701171875, 0.0164794921875, 0.009521484375, 0.003082275390625, 0.00552368164062...

[ 11249, 831, 87, 20600, 17309, 11389, 20625, 142508, 527, 73265, 9969, 34759, 98, 116890, 70, 1556, 31380, 238, 111, 156672, 51042, 10332, 6281, 39876, 2046, 3525, 56, 1632, 15490, 19441, 1340, 442, 1295, 31344 ]

[ 0.065185546875, 0.08807373046875, 0.045135498046875, 0.1656494140625, 0.1048583984375, 0.1109619140625, 0.1544189453125, 0.261962890625, 0.11181640625, 0.2496337890625, 0.15673828125, 0.1710205078125, 0.10540771484375, 0.2147216796875, 0.02178955078125, 0.12109375, 0.1021728515625, ...

embed

56095383_c0

56095383

haskell

0

Title: (new to haskell) if statment generating parse error Problem title: (new to haskell) if statment generating parse error Tags: haskell Problem: (new to haskell) if statment generating parse error I want the function to create a list of a tuple if the condition applies but it doesnt seem to be working. (I'm new to ...

(new to haskell) if statment generating parse error (new to haskell) if statment generating parse error haskell (new to haskell) if statment generating parse error I want the function to create a list of a tuple if the condition applies but it doesnt seem to be working. (I'm new to haskell)

[ 0.0244140625, 0.0031280517578125, -0.0247802734375, -0.0037994384765625, 0.0135498046875, 0.01416015625, 0.00494384765625, -0.0036773681640625, 0.01434326171875, 0.0294189453125, 0.0213623046875, 0.00506591796875, 0.0234375, 0.000370025634765625, -0.00029754638671875, 0.01361083984375,...

[ 54936, 47, 1556, 142508, 2174, 13254, 674, 12663, 1916, 366, 184, 18499, 3444, 32354, 28282, 5303, 111, 370, 8705, 35431, 4027, 25720, 22027, 18, 48903, 20697, 3525 ]

[ 0.11669921875, 0.046356201171875, 0.1322021484375, 0.1884765625, 0.1380615234375, 0.22607421875, 0.1563720703125, 0.1612548828125, 0.072021484375, 0.13720703125, 0.0999755859375, 0.2021484375, 0.063232421875, 0.1451416015625, 0.1243896484375, 0.1473388671875, 0.04278564453125, 0.10...

embed

11274864_c0

11274864

haskell

0

Title: What does 'qualified' mean in 'import qualified Data.List' statement? Problem title: What does 'qualified' mean in 'import qualified Data.List' statement? Tags: haskell Problem: What does 'qualified' mean in 'import qualified Data.List' statement? I understand import Data....

What does 'qualified' mean in 'import qualified Data.List' statement? What does 'qualified' mean in 'import qualified Data.List' statement? haskell qualified Data.List What What does 'qualified' mean in 'import qualified Data.List' statement? I understand import Data.List . But w...

[ 0.009521484375, 0.00787353515625, 0.0185546875, 0.0084228515625, 0.0052490234375, 0.01611328125, 0.0167236328125, 0.0087890625, 0.00408935546875, 0.0303955078125, -0.00017547607421875, -0.0303955078125, 0.0057373046875, -0.0030059814453125, -0.0286865234375, 0.00970458984375, 0.00244...

[ 4865, 14602, 3768, 71723, 47314, 54764, 29459, 60270, 217225, 11809, 154663, 63805, 23, 1556, 142508, 242, 25, 5, 87, 28219, 24927, 4966, 2367 ]

[ 0.0799560546875, 0.087158203125, 0.1015625, 0.1864013671875, 0.270751953125, 0.01446533203125, 0.15087890625, 0.2301025390625, 0.28369140625, 0.1475830078125, 0.1939697265625, 0.19873046875, 0.05865478515625, 0.1256103515625, 0.2105712890625, 0.00775146484375, 0.0273590087890625, 0...

embed

17951915_c1

17951915

haskell

1

ToTuple = proc tree -> do desc <- aDesc -< tree display <- aDisp -< tree plist <- aPlist -< tree returnA -< (desc, display, plist) tx3 = map (\i -> runLA aToTuple i) tx1 It all falls in a big heap. What am I missing with the conversion to proc/do notation? Thanks. Code signals: Text.XML.HXT.Arrow.ReadDocument, Text.XML...

[ 0.000873565673828125, 0.0164794921875, -0.013671875, -0.0208740234375, 0.00341796875, 0.00958251953125, -0.01422119140625, -0.00897216796875, 0.0216064453125, -0.0267333984375, -0.003936767578125, 0.0164794921875, -0.00714111328125, 0.0279541015625, 0.01312255859375, -0.00994873046875,...

[ 717, 15665, 8705, 2203, 10402, 53201, 54, 224, 238, 10, 6964, 44116, 254, 4655, 271, 6562, 30646, 284, 988, 808, 425, 363, 22288, 11675, 8356, 7763, 17, 418, 756, 123867, 764, 2631, 132283, 142477, 47, 64, 246, 110, 22062, 28864, 26073,...

[ 0.17724609375, 0.1258544921875, 0.2548828125, 0.0494384765625, 0.2423095703125, 0.2196044921875, 0.13427734375, 0.1728515625, 0.050811767578125, 0.0272674560546875, 0.06939697265625, 0.1241455078125, 0.0159912109375, 0.08056640625, 0.0523681640625, 0.1539306640625, 0.042388916015625,...

embed

39553257_c0

39553257

haskell

0

Title: Use of putStrLn to show result Problem title: Use of putStrLn to show result Tags: haskell Problem: Use of putStrLn to show result I am using the Idone.com site and wanted to run this code but do not know the syntax putStrLn to compile from stdin Use this code but strip error. main = putStrLn (show (sumaCifras x...

Use of putStrLn to show result Use of putStrLn to show result haskell Use Use of putStrLn to show result I am using the Idone.com site and wanted to run this code but do not know the syntax putStrLn to compile from stdin Use this code but strip error.

[ 0.00125885009765625, 0.00836181640625, 0.0006866455078125, 0.01202392578125, 0.0067138671875, 0.0279541015625, 0.00102996826171875, 0.0012969970703125, 0.0057373046875, -0.0284423828125, -0.011474609375, -0.037109375, -0.0244140625, 0.01275634765625, 0.002593994140625, 0.00759887695312...

[ 36836, 111, 3884, 71713, 866, 19, 47, 7639, 16750, 1556, 142508, 87, 64007, 277, 11675, 18151, 3714, 6002, 86531, 9969, 1340, 1295, 6138, 3035, 1284, 43613, 18499 ]

[ 0.09161376953125, 0.026336669921875, 0.1993408203125, 0.2486572265625, 0.1640625, 0.1435546875, 0.0269012451171875, 0.1566162109375, 0.2039794921875, 0.122802734375, 0.21240234375, 0.006801605224609375, 0.1568603515625, 0.018035888671875, 0.052886962890625, 0.09979248046875, 0.017257...

embed

20659810_c0

20659810

haskell

0

Title: Haskell: Int to Char Problem title: Haskell: Int to Char Tags: haskell Problem: Haskell: Int to Char I am using the function fromEnum to convert a character to its corresponding ASCII Int. For example: fromEnum 'A' returns 65. Now, assuming I had a function that did: (fromEnum 'A')+1 And then wanted to convert t...

Haskell: Int to Char Haskell: Int to Char haskell Haskell Char Haskell: Int to Char I am using the function fromEnum to convert a character to its corresponding ASCII Int. For example: returns 65. Now, assuming I had a function that did: And then wanted to convert the returned value (66) to a Char which would be 'B'. W...

[ -0.000827789306640625, 0.003814697265625, 0.0286865234375, 0.025390625, 0.00537109375, 0.0213623046875, -0.0018310546875, -0.03076171875, -0.020263671875, 0.014892578125, 0.0111083984375, -0.0302734375, -0.00095367431640625, 0.045654296875, -0.0177001953125, -0.0108642578125, 0.00135...

[ 20625, 142508, 12, 360, 18, 47, 21656, 1556, 87, 17368, 32354, 1295, 647, 2606, 96760, 62816, 42518, 125429, 10001, 27781, 30646, 5684, 66596, 36663, 176377, 34292, 84308, 10, 2806, 571, 2965, 3917, 20594, 221, 22362 ]

[ 0.1436767578125, 0.2509765625, 0.039398193359375, 0.15380859375, 0.20751953125, 0.146728515625, 0.244873046875, 0.153076171875, 0.008941650390625, 0.0850830078125, 0.1614990234375, 0.1710205078125, 0.10009765625, 0.28369140625, 0.18896484375, 0.1971435546875, 0.059326171875, 0.0781...

embed

78523216_c0

78523216

haskell

0

Title: Finding the type of functions Problem title: Finding the type of functions Tags: haskell, types Problem: Finding the type of functions I have a problem regarding finding the type in Haskell. The question is as follows: Find the type of uncurry curry Does anyone know a way to find the type? The answer should be (...

Finding the type of functions Finding the type of functions haskell types Finding Finding the type of functions I have a problem regarding finding the type in Haskell. The question is as follows: Does anyone know a way to find the type? The answer should be ((b1, b2) -> c, b1) -> b2 -> c . I know I can use :t to find t...

[ 0.0031890869140625, -0.01318359375, 0.003387451171875, 0.01019287109375, -0.01019287109375, 0.002410888671875, -0.01031494140625, -0.0177001953125, 0.003021240234375, -0.036865234375, 0.00750732421875, -0.050048828125, -0.002227783203125, 0.004486083984375, -0.0029296875, -0.0024719238...

[ 26040, 214, 70, 10644, 111, 32354, 7, 1556, 142508, 52895, 87, 765, 2967, 90791, 23, 20625, 9655, 28960, 101790, 35672, 3714, 3917, 47, 7413, 35166, 5608, 186, 60494, 275, 418, 4, 876, 10461, 33079, 501, 17727, 304, 6, 831, 4527, 152, ...

[ 0.1336669921875, 0.040008544921875, 0.1072998046875, 0.2489013671875, 0.1004638671875, 0.213623046875, 0.0584716796875, 0.1690673828125, 0.259765625, 0.2276611328125, 0.007110595703125, 0.0221099853515625, 0.08544921875, 0.1456298828125, 0.07012939453125, 0.1717529296875, 0.028839111...

embed

58582514_c0

58582514

haskell

0

Title: Haskell .hs files turning into .hi files? Problem title: Haskell .hs files turning into .hi files? Tags: haskell Problem: Haskell .hs files turning into .hi files? I just installed an application that has a number of .hs Haskell files https://github.com/tidalcycles/Tidal/tree/master/src/Sound/Tidal After install...

Haskell .hs files turning into .hi files? Haskell .hs files turning into .hi files? haskell Haskell Haskell .hs files turning into .hi files? I just installed an application that has a number of .hs Haskell files https://github.com/tidalcycles/Tidal/tree/master/src/Sound/Tidal After installation via cabal, all of the ....

[ 0.0033721923828125, -0.01495361328125, 0.017333984375, 0.00156402587890625, -0.01055908203125, 0.0016632080078125, -0.01019287109375, 0.0034332275390625, -0.01043701171875, 0.021728515625, -0.0034332275390625, -0.0247802734375, -0.01068115234375, 0.003997802734375, 0.005279541015625, 0...

[ 20625, 142508, 5, 127, 7, 102158, 174548, 3934, 979, 1556, 20600, 38415, 14012, 15769, 32102, 118, 2465, 75457, 16734, 62600, 47327, 19437, 8912, 7030, 59720, 1829, 109524, 756, 621, 14602, 47 ]

[ 0.1473388671875, 0.232177734375, 0.044281005859375, 0.1759033203125, 0.1644287109375, 0.212646484375, 0.11181640625, 0.0762939453125, 0.2213134765625, 0.112060546875, 0.1041259765625, 0.1265869140625, 0.032135009765625, 0.07794189453125, 0.1292724609375, 0.07379150390625, 0.133666992...

embed

6320424_c0

6320424

haskell

0

Title: Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? Problem title: Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? Tags: operator-precedence, haskell Problem: Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? I want to know why Hask...

Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? operator-precedence haskell Why Haskell Why does Haskell precedence have only 10 levels? Is the figure of 10 enough? I want to know why Haskell designers agreed to al...

[ 0.00390625, 0.000751495361328125, 0.007171630859375, 0.0159912109375, 0.01611328125, 0.0025177001953125, -0.0079345703125, -0.01214599609375, -0.00286865234375, -0.01092529296875, 0.0027313232421875, -0.0218505859375, 0.00830078125, -0.00189208984375, 0.0002765655517578125, 0.000196456...

[ 44084, 20625, 142508, 107671, 6620, 765, 4734, 209, 90926, 2071, 26366, 20174, 111, 39933, 4692, 37534, 1556, 14602, 15400, 51517, 176506, 63769, 129980 ]

[ 0.1064453125, 0.1527099609375, 0.250732421875, 0.21142578125, 0.145751953125, 0.068603515625, 0.1258544921875, 0.1934814453125, 0.26220703125, 0.0020751953125, 0.1865234375, 0.1251220703125, 0.01031494140625, 0.1727294921875, 0.1160888671875, 0.158203125, 0.13134765625, 0.036560058...

embed

68695059_c0

68695059

haskell

0

Title: What does the asterisk in (x*) do in Haskell? Problem title: What does the asterisk in (x*) do in Haskell? Tags: haskell, operators Problem: What does the asterisk in (x*) do in Haskell? I'm new to Haskell, can someone please explain to me how this code works? f = g (\x -> x) g k [] = k 100 g k (x:xs) = g ((x*) ...

What does the asterisk in (x*) do in Haskell? What does the asterisk in (x*) do in Haskell? haskell operators What Haskell x:xs What does the asterisk in (x*) do in Haskell? I'm new to Haskell, can someone please explain to me how this code works? When I call f [1..5] it returns 12000. I don't understand why. What does...

[ 0.01019287109375, 0.0034637451171875, 0.0189208984375, -0.0162353515625, 0.00714111328125, 0.0167236328125, 0.0040283203125, 0.00005698204040527344, 0.022216796875, -0.0164794921875, 0.0194091796875, -0.0179443359375, -0.003997802734375, 0.01007080078125, -0.0120849609375, -0.015075683...

[ 4865, 14602, 10, 1515, 6581, 23, 425, 77518, 54, 20625, 142508, 1556, 39933, 1022, 12, 7, 70, 3525, 47, 831, 22936, 73342, 3642, 903, 18151, 43240, 11782, 1238, 68252, 5, 758, 30646, 106, 13821, 2301, 28219, 15400 ]

[ 0.06427001953125, 0.055877685546875, 0.060943603515625, 0.1397705078125, 0.2113037109375, 0.06927490234375, 0.1558837890625, 0.2120361328125, 0.100830078125, 0.1341552734375, 0.2457275390625, 0.10565185546875, 0.12646484375, 0.121826171875, 0.038238525390625, 0.0261077880859375, 0.00...

embed

64706590_c1

64706590

haskell

1

626e8] *Main> The approximations to the nth derivative of e^x|x=0 are: [1.0,1.0000004999621837,1.000088900582341,-222.0446049250313,4.440892098500626e8] The first and 2nd derivatives are perfectly reasonable approximations given the setup, but suddenly, the third derivative of func at 0 is... -222.0446049250313 ! HOW!!...

[ 0.009033203125, -0.0002384185791015625, 0.005615234375, -0.0250244140625, 0.01422119140625, 0.01904296875, 0.0003986358642578125, 0.0001773834228515625, 0.021240234375, -0.0030059814453125, -0.0181884765625, 0.01397705078125, 0.0079345703125, 0.00836181640625, -0.006072998046875, 0.009...

[ 305, 4046, 13, 1019, 168793, 35707, 53950, 21094, 47, 653, 927, 30057, 4935, 28, 8353, 425, 58745, 145407, 621, 102107, 146533, 28568, 12977, 185245, 180882, 4, 5, 12772, 8894, 9, 132537, 159937, 24291, 5016, 82449, 141929, 183642, 5117, 13...

[ 0.086669921875, 0.2138671875, 0.03564453125, 0.13916015625, 0.1192626953125, 0.146240234375, 0.233154296875, 0.0777587890625, 0.10003662109375, 0.191650390625, 0.212890625, 0.2587890625, 0.177978515625, 0.1614990234375, 0.1539306640625, 0.1575927734375, 0.06732177734375, 0.22985839...

embed

24684363_c0

24684363

haskell

0

Title: How to reduce boilerplate dealing with Maybe and lists? Problem title: How to reduce boilerplate dealing with Maybe and lists? Tags: haskell Problem: How to reduce boilerplate dealing with Maybe and lists? Is there a cleaner way to compose functions producing lists with other producing Maybe s? import Text.Feed....

How to reduce boilerplate dealing with Maybe and lists? How to reduce boilerplate dealing with Maybe and lists? haskell Text.Feed.Query How Maybe How to reduce boilerplate dealing with Maybe and lists? Is there a cleaner way to compose functions producing lists with other producing Maybe s?

[ -0.01055908203125, -0.00811767578125, 0.0130615234375, 0.00909423828125, 0.00799560546875, 0.0014190673828125, 0.004547119140625, -0.00543212890625, 0.00213623046875, -0.022705078125, 0.0035552978515625, -0.00408935546875, 0.005615234375, 0.006866455078125, 0.0064697265625, -0.01892089...

[ 11249, 34390, 337, 34759, 92558, 184017, 83425, 136, 5303, 678, 1556, 142508, 24129, 30154, 297, 41732, 1294, 47, 46622, 56, 3917, 150350, 32354, 27024, 3789, 91 ]

[ 0.115478515625, 0.21240234375, 0.106689453125, 0.1309814453125, 0.243408203125, 0.1131591796875, 0.28173828125, 0.05926513671875, 0.2049560546875, 0.07025146484375, 0.119873046875, 0.198974609375, 0.160400390625, 0.157470703125, 0.091064453125, 0.072021484375, 0.01174163818359375, ...

embed

2741768_c0

2741768

haskell

0

Title: How do you make this Haskell power function tail recursive? Problem title: How do you make this Haskell power function tail recursive? Tags: tail-recursion, haskell Problem: How do you make this Haskell power function tail recursive? How would I make this Haskell power function tail recursive? turboPower a 0 = 1...

How do you make this Haskell power function tail recursive? How do you make this Haskell power function tail recursive? tail-recursion haskell How Haskell b-1 How do you make this Haskell power function tail recursive? How would I make this Haskell power function tail recursive?

[ 0.004364013671875, -0.005523681640625, 0.029052734375, 0.006317138671875, 0.00677490234375, 0.0164794921875, -0.0164794921875, -0.0203857421875, 0.00086212158203125, 0.005615234375, 0.004974365234375, 0.004241943359375, 0.0037384033203125, 0.0169677734375, 0.0185546875, -0.004638671875...

[ 11249, 3249, 903, 20625, 142508, 14537, 32354, 46741, 195625, 5844, 54, 107, 48650, 1830, 1556, 876, 5759 ]

[ 0.0745849609375, 0.08599853515625, 0.04217529296875, 0.1339111328125, 0.20849609375, 0.1539306640625, 0.142822265625, 0.26171875, 0.214111328125, 0.1505126953125, 0.017333984375, 0.08087158203125, 0.153076171875, 0.0679931640625, 0.135986328125, 0.0858154296875, 0.1339111328125 ]

embed

42015459_c0

42015459

haskell

0

Title: Haskell !! operator combination Problem title: Haskell !! operator combination Tags: haskell Problem: Haskell !! operator combination In the following code, what does m!!i!!j stand for? Any examples will be helpful. matrixElements :: [[t]] -> [t] matrixElements m = [m!!i!!j | i<-[0..length m - 1], j<-[0..length(...

Haskell !! operator combination Haskell !! operator combination haskell Haskell Haskell !! operator combination In the following code, what does m!!i!!j stand for? Any examples will be helpful.

[ -0.00958251953125, 0.00762939453125, 0.00958251953125, -0.004974365234375, 0.0174560546875, 0.01531982421875, -0.003814697265625, 0.005096435546875, 0.003662109375, -0.00885009765625, 0.0201416015625, -0.00130462646484375, 0.0177001953125, -0.0142822265625, -0.0303955078125, -0.0030212...

[ 20625, 142508, 6506, 39933, 162515, 1556, 360, 25632, 18151, 2367, 14602, 347, 1146, 14, 170, 9157, 100, 27781, 7, 98893 ]

[ 0.173828125, 0.2301025390625, 0.208984375, 0.1865234375, 0.180908203125, 0.147705078125, 0.03643798828125, 0.10394287109375, 0.1368408203125, 0.0924072265625, 0.089111328125, 0.1837158203125, 0.235595703125, 0.2200927734375, 0.250244140625, 0.1356201171875, 0.12109375, 0.0970458984...

embed

48669145_c1

48669145

haskell

1

&& head xs == 'i' && not (head (tail xs) == 'i') = (Si (f xs)) | x == 'Y' = (Y (f xs)) | x == 'O' = (O (f xs)) | x == 'N' && head xs == 'o' = (O (f xs)) The function aims to create an FProp from a String, being its type [Char] -> FProp . The problem is that I do not come up with the base case of this recursive functio...

[ 0.000152587890625, -0.00946044921875, -0.010498046875, 0.005157470703125, -0.0035552978515625, 0.00106048583984375, 0.0196533203125, -0.01153564453125, 0.0289306640625, 0.0174560546875, 0.0179443359375, -0.0255126953125, -0.0018768310546875, -0.003814697265625, -0.00946044921875, 0.000...

[ 619, 1230, 10336, 1022, 7, 69112, 14, 959, 31251, 46741, 8859, 420, 1723, 670, 839, 31, 32354, 131264, 28282, 563, 10752, 254, 1295, 23351, 214, 8035, 10644, 84068, 33079, 2967, 1380, 1257, 3647, 7225, 195625, 5844, 5809, 54, 2174, 2046, ...

[ 0.0279541015625, 0.1064453125, 0.2169189453125, 0.15625, 0.091796875, 0.1256103515625, 0.1114501953125, 0.1552734375, 0.190185546875, 0.2027587890625, 0.1778564453125, 0.0615234375, 0.08349609375, 0.149658203125, 0.060333251953125, 0.1563720703125, 0.171875, 0.1470947265625, 0.10...

embed

63404026_c0

63404026

haskell

0

Title: In Haskell, what is the result of a infinite multiplication of 1 by itself? Problem title: In Haskell, what is the result of a infinite multiplication of 1 by itself? Tags: haskell Problem: In Haskell, what is the result of a infinite multiplication of 1 by itself? In the following example, why any optimization ...

In Haskell, what is the result of a infinite multiplication of 1 by itself? In Haskell, what is the result of a infinite multiplication of 1 by itself? haskell Haskell CInterrupted In Haskell, what is the result of a infinite multiplication of 1 by itself? In the following example, why any optimization that evaluates t...

[ -0.007293701171875, -0.0027923583984375, 0.01483154296875, 0.007354736328125, -0.027587890625, -0.01177978515625, -0.00186920166015625, -0.0203857421875, -0.003265380859375, -0.043701171875, -0.003143310546875, 0.0186767578125, 0.00023365020751953125, 0.00823974609375, 0.0018463134765625...

[ 360, 20625, 142508, 2367, 83, 16750, 54241, 13, 127664, 1363, 106, 390, 68034, 111, 1556, 313, 44851, 9167, 3674, 27781, 15400, 87235, 151575, 47, 90698, 214552 ]

[ 0.03472900390625, 0.1475830078125, 0.2432861328125, 0.033050537109375, 0.0283355712890625, 0.16650390625, 0.1915283203125, 0.07073974609375, 0.19482421875, 0.0462646484375, 0.1297607421875, 0.10205078125, 0.1640625, 0.0184326171875, 0.1142578125, 0.019256591796875, 0.04010009765625, ...

embed

36804300_c0

36804300

haskell

0

Title: Pattern match using smart constructor Problem title: Pattern match using smart constructor Tags: haskell Problem: Pattern match using smart constructor Is there a way to pattern match smart constructors, outside of its module? Something like this: import MyModule (thing) fn (thing 3) = True without being able to...

Pattern match using smart constructor Pattern match using smart constructor haskell smart MyModule Pattern Thing Pattern match using smart constructor Is there a way to pattern match smart constructors, outside of its module? Something like this: without being able to write this: where thing is a smart constructor for ...

[ -0.02197265625, 0.0179443359375, 0.0037994384765625, -0.004302978515625, -0.000835418701171875, 0.021484375, -0.013671875, 0.01806640625, 0.01068115234375, -0.050537109375, 0.0157470703125, 0.01275634765625, 0.00148773193359375, 0.00024318695068359375, 0.0126953125, -0.013916015625, ...

[ 9876, 22766, 14858, 17368, 18775, 64549, 748, 1556, 142508, 2646, 91616, 8782, 6003, 214, 2685, 10, 3917, 47, 103510, 25251, 50782, 111, 6863, 88996, 1884, 15490, 33022, 7440, 13580, 83, 100 ]

[ 0.161865234375, 0.1494140625, 0.2486572265625, 0.0750732421875, 0.1932373046875, 0.186279296875, 0.151123046875, 0.10089111328125, 0.1551513671875, 0.09161376953125, 0.048065185546875, 0.06927490234375, 0.09539794921875, 0.11407470703125, 0.0164031982421875, 0.0179595947265625, 0.074...

embed

14695894_c0

14695894

haskell

0

Title: Haskell: Show all the elements that are "showable" on a Hlist Problem title: Haskell: Show all the elements that are "showable" on a Hlist Tags: haskell, reflection, hlist Problem: Haskell: Show all the elements that are "showable" on a Hlist I have tried map show . mapMaybe fromDynamic $ [to...

Haskell: Show all the elements that are "showable" on a Hlist Haskell: Show all the elements that are "showable" on a Hlist haskell reflection hlist Haskell Show Hlist x::Integer Haskell: Show all the elements that are "showable" on a Hlist I have tried but it returned

[ 0, -0.01470947265625, 0.0126953125, 0.01507568359375, -0.017822265625, 0.02001953125, 0.002685546875, 0.00701904296875, 0.00860595703125, -0.0184326171875, -0.034423828125, -0.045166015625, 0.003204345703125, 0.018310546875, -0.008056640625, 0.01031494140625, 0.00170135498046875, 0...

[ 20625, 142508, 17367, 756, 80854, 450, 621, 31374, 2886, 98, 572, 6562, 1556, 44961, 1830, 1096, 1022, 67, 1505, 765, 37842, 176377 ]

[ 0.128662109375, 0.2161865234375, 0.1640625, 0.1002197265625, 0.1822509765625, 0.010406494140625, 0.033966064453125, 0.19482421875, 0.1971435546875, 0.06695556640625, 0.1126708984375, 0.23388671875, 0.11181640625, 0.151123046875, 0.066162109375, 0.053558349609375, 0.06585693359375, ...

embed

39381115_c1

39381115

haskell

1

0.0011 seconds 1 example, 0 failures So my "test" is running. But so is a test from the dependency (and failing). What could be causing this? And how do I prevent this? Code signals: Test.Hspec, Stack, Wall, Werror, DTEST, OverloadedStrings, Spec.hs, exitcode-stdio-1.0, Foo, QuickCheck, Haskell2010, TemplateHaskell, E...

[ 0.000576019287109375, -0.01043701171875, -0.01007080078125, -0.010498046875, 0.002410888671875, 0.02001953125, 0.00299072265625, -0.012939453125, -0.000118255615234375, 0.0010833740234375, -0.004913330078125, -0.0027008056640625, -0.0177001953125, 0.018798828125, -0.0123291015625, 0.02...

[ 6, 37509, 1662, 94131, 27781, 757, 137578, 1061, 759, 6954, 83, 51042, 4966, 221, 3034, 1295, 42548, 27771, 2940, 35782, 214, 4865, 5809, 216806, 903, 56282, 28864, 26073, 7, 8647, 841, 16711, 6512, 2594, 23706, 188800, 21828, 9578, 63033, ...

[ 0.0162506103515625, 0.1234130859375, 0.09478759765625, 0.1822509765625, 0.12255859375, 0.022674560546875, 0.156494140625, 0.01141357421875, 0.049652099609375, 0.24560546875, 0.00628662109375, 0.1641845703125, 0.055938720703125, 0.06781005859375, 0.26708984375, 0.059234619140625, 0.21...

embed

9318146_c0

9318146

haskell

0

Title: Testing haskell equality on Doubles with HUnit? Problem title: Testing haskell equality on Doubles with HUnit? Tags: haskell Problem: Testing haskell equality on Doubles with HUnit? Does HUnit have some way of doing approximate equalities? Clearly, this fails: test1 = TestCase (assertEqual "Should equal" (get_sc...

Testing haskell equality on Doubles with HUnit? Testing haskell equality on Doubles with HUnit? haskell Testing Doubles HUnit test1 TestCase Should get_scores Testing haskell equality on Doubles with HUnit? Does HUnit have some way of doing approximate equalities? Clearly, this fails:

[ -0.00384521484375, 0.0098876953125, 0.005157470703125, -0.0067138671875, -0.0108642578125, -0.00927734375, -0.00494384765625, -0.002685546875, 0.0089111328125, 0.0322265625, -0.0008697509765625, 0.021484375, -0.00335693359375, -0.00537109375, -0.00677490234375, 0.01275634765625, 0.00...

[ 8647, 214, 1556, 142508, 28, 161789, 98, 107172, 7, 678, 22438, 6773, 3034, 418, 441, 6991, 151117, 2046, 12064, 2109, 3917, 20594, 35707, 5134, 15829, 105950, 31075, 35782 ]

[ 0.19091796875, 0.034698486328125, 0.1639404296875, 0.2420654296875, 0.07403564453125, 0.19677734375, 0.0616455078125, 0.213623046875, 0.01873779296875, 0.10107421875, 0.1546630859375, 0.228515625, 0.154296875, 0.0269775390625, 0.040496826171875, 0.040771484375, 0.0535888671875, 0.0...

embed

68942035_c1

68942035

haskell

1

ilation of the entire software suite for step 4. Is there anyway that I can get around needing this step? I've already tried to manually delete the $(stack path --local-install-root)/doc folder before the second docs generation, but this didn't work without a full clean. My Stack version is Version 2.7.3, Git revision ...

[ -0.0120849609375, 0.016357421875, -0.0074462890625, 0.0125732421875, -0.0177001953125, 0.003997802734375, -0.021728515625, -0.01434326171875, -0.002410888671875, -0.00836181640625, -0.00482177734375, 0.003021240234375, -0.01458740234375, 0.004852294921875, 0.0186767578125, 0.0008735656...

[ 211, 2320, 111, 70, 64194, 10975, 14947, 100, 29954, 1398, 2071, 2685, 109954, 831, 2046, 10932, 3871, 903, 21771, 37842, 23009, 154109, 3650, 590, 2594, 60875, 98908, 80383, 148920, 29713, 78303, 8108, 17932, 54, 4439, 58093, 4488, 15490, ...

[ 0.1533203125, 0.105712890625, 0.0975341796875, 0.03155517578125, 0.1025390625, 0.2044677734375, 0.1973876953125, 0.0185546875, 0.1549072265625, 0.19384765625, 0.001220703125, 0.00030517578125, 0.03704833984375, 0.0234222412109375, 0.004730224609375, 0.15576171875, 0.0821533203125, ...

embed

31369918_c0

31369918

haskell

0

Title: Composing applicative functions Problem title: Composing applicative functions Tags: applicative, function-composition, functor, haskell Problem: Composing applicative functions Please implement the function: composeApplicative :: (Applicative f) => f (b -> c) -> f (a -> b) -> f (a -> c) Such that: (composeAppli...

Composing applicative functions Composing applicative functions applicative function-composition functor haskell Composing Applicative Composing applicative functions Please implement the function: Such that: Or alternatively, explain why this can not be done?

[ 0.0024566650390625, 0.00927734375, -0.002532958984375, 0.04296875, -0.002288818359375, 0.03759765625, 0.00738525390625, 0.007171630859375, 0.00159454345703125, 0.00180816650390625, 0.0091552734375, -0.0166015625, 0.01318359375, 0.03369140625, -0.0037689208984375, -0.01385498046875, -...

[ 15612, 232, 41816, 4935, 32354, 214, 277, 40322, 7477, 18770, 1556, 142508, 5659, 11048, 30607, 29479, 12, 62771, 450, 73342, 15400, 903, 831, 959, 186, 16940 ]

[ 0.1375732421875, 0.1900634765625, 0.1656494140625, 0.12420654296875, 0.2322998046875, 0.03277587890625, 0.12432861328125, 0.1456298828125, 0.1158447265625, 0.155029296875, 0.1326904296875, 0.223388671875, 0.092529296875, 0.1334228515625, 0.12115478515625, 0.2274169921875, 0.020645141...

embed

23551503_c0

23551503

haskell

0

Title: Trouble making simple function in haskell Problem title: Trouble making simple function in haskell Tags: haskell Problem: Trouble making simple function in haskell I am having trouble trying to convert the following block of C code into Haskell. void echo(int num){ if(num != 0) print(num) else exit() } I just st...

Trouble making simple function in haskell Trouble making simple function in haskell haskell Trouble Trouble making simple function in haskell I am having trouble trying to convert the following block of C code into Haskell. I just started learning Haskell, but I am pretty confused as to how such a simple function could...

[ -0.00518798828125, -0.0024261474609375, 0.002532958984375, 0.005126953125, -0.0010986328125, 0.0162353515625, -0.0123291015625, -0.0224609375, 0.0062255859375, -0.00787353515625, -0.02099609375, -0.028564453125, -0.0007476806640625, 0.0048828125, 0.0166015625, 0.00311279296875, 0.012...

[ 119671, 2661, 20662, 8781, 32354, 23, 1556, 142508, 19441, 63134, 31577, 96760, 25632, 46389, 313, 18151, 3934, 20625, 52080, 28875, 55681, 5281, 6044, 5809, 186, 221, 34844 ]

[ 0.15283203125, 0.1004638671875, 0.10467529296875, 0.206298828125, 0.1751708984375, 0.050811767578125, 0.155029296875, 0.239501953125, 0.02691650390625, 0.1683349609375, 0.06829833984375, 0.134765625, 0.08935546875, 0.142333984375, 0.0760498046875, 0.1275634765625, 0.0889892578125, ...

embed

41412636_c0

41412636

haskell

0

Title: haskell packages: base versus haskel98 Problem title: haskell packages: base versus haskel98 Tags: haskell Problem: haskell packages: base versus haskel98 I installed haskell-platform on my Ubuntu system. Now I need to run ghci -package haskell98 -hide-package base in order to try out simple things like: map Cha...

haskell packages: base versus haskel98 haskell packages: base versus haskel98 haskell haskel98 haskell98 Char.toUpper Hello World haskell packages: base versus haskel98 I installed haskell-platform on my Ubuntu system. Now I need to run in order to try out simple things like: Is there a way to make this the default?

[ 0.01220703125, -0.0084228515625, 0.0306396484375, -0.00543212890625, -0.0064697265625, 0.0033416748046875, 0.00201416015625, -0.0252685546875, 0.0035400390625, 0.009765625, 0.00128936767578125, -0.023193359375, 0.01397705078125, 0.01275634765625, -0.0224609375, -0.004547119140625, 0....

[ 1556, 142508, 98169, 3647, 119475, 2590, 16665, 21656, 188, 1062, 8079, 35378, 6661, 12, 20600, 172121, 98, 116890, 5426, 14240, 3871, 11675, 12989, 9790, 8781, 8966, 3917, 47, 3249, 903, 70, 114977 ]

[ 0.1865234375, 0.267578125, 0.209716796875, 0.2142333984375, 0.182373046875, 0.194091796875, 0.287109375, 0.1492919921875, 0.1636962890625, 0.06494140625, 0.1915283203125, 0.08447265625, 0.06549072265625, 0.0200958251953125, 0.1138916015625, 0.144775390625, 0.0096435546875, 0.175903...

embed

67678471_c0

67678471

haskell

0

Title: Is ghci super slow? Problem title: Is ghci super slow? Tags: haskell Problem: Is ghci super slow? The following Haskell program for finding all perfect numbers below a given limit takes excecutes in about 5-10 seconds in ghci on my computer with n=10000: perf :: Int -> Bool perf n = sum [d | d<-[1..div n 2], mod...

Is ghci super slow? Is ghci super slow? haskell Bool Is ghci super slow? The following Haskell program for finding all perfect numbers below a given limit takes excecutes in about 5-10 seconds in ghci on my computer with n=10000: Why is the excecution so slow?

[ -0.025634765625, -0.01263427734375, 0.0157470703125, 0.00193023681640625, 0.00714111328125, 0.004058837890625, -0.015869140625, -0.0118408203125, 0.00555419921875, -0.017822265625, 0.01092529296875, -0.0152587890625, -0.0019683837890625, -0.0020599365234375, -0.0034637451171875, 0.0086...

[ 2071, 31380, 318, 1601, 72803, 1556, 142508, 2460, 929, 25632, 20625, 1528, 90791, 756, 15787, 101935, 35064, 34475, 17475, 51776, 1119, 329, 85691, 1672, 67710, 94131, 13909, 653, 191281, 44084, 83, 1010, 221 ]

[ 0.10430908203125, 0.1646728515625, 0.211181640625, 0.169189453125, 0.2410888671875, 0.1280517578125, 0.245849609375, 0.07366943359375, 0.1669921875, 0.058746337890625, 0.1307373046875, 0.1514892578125, 0.1046142578125, 0.0595703125, 0.1864013671875, 0.158203125, 0.185546875, 0.0364...

embed

32401109_c0

32401109

haskell

0

Title: How do I make a list of all possible replaced items in Haskell? Problem title: How do I make a list of all possible replaced items in Haskell? Tags: haskell Problem: How do I make a list of all possible replaced items in Haskell? My input is an arbitrary list, such as ["a","b","c"] and another list element, say ...

How do I make a list of all possible replaced items in Haskell? How do I make a list of all possible replaced items in Haskell? haskell How Haskell How do I make a list of all possible replaced items in Haskell? My input is an arbitrary list, such as and another list element, say "z" . I want the output to look like: H...

[ -0.00885009765625, 0.009765625, -0.0162353515625, 0.01416015625, -0.0089111328125, 0.00860595703125, -0.0322265625, -0.012451171875, 0.0196533203125, 0.0147705078125, 0.0118408203125, -0.007080078125, 0.0169677734375, 0.01104736328125, -0.01544189453125, 0.0177001953125, 0.0191650390...

[ 11249, 3249, 5303, 111, 756, 7722, 91995, 71, 55769, 20625, 142508, 54, 87, 23, 1556, 10, 107730, 61799, 15700, 12830, 169, 3444, 140992, 6713, 1884, 903 ]

[ 0.0770263671875, 0.111083984375, 0.1951904296875, 0.08636474609375, 0.1358642578125, 0.187255859375, 0.21240234375, 0.128662109375, 0.176025390625, 0.14306640625, 0.2393798828125, 0.028656005859375, 0.0278167724609375, 0.05706787109375, 0.11279296875, 0.0596923828125, 0.1461181640625...

embed

54220840_c0

54220840

haskell

0

Title: Join two IOs with - in haskell Problem title: Join two IOs with - in haskell Tags: monads, haskell Problem: Join two IOs with - in haskell I need to join two IO String s with a - in between. Here's what I came up with, which works - what's the right way? import System.Environment f :: String -> String -> IO Stri...

Join two IOs with - in haskell Join two IOs with - in haskell monads haskell System.Environment Join IOs foldl1 Join two IOs with - in haskell I need to join two IO String s with a - in between. Here's what I came up with, which works - what's the right way?

[ -0.0198974609375, -0.000812530517578125, -0.0213623046875, 0.0244140625, -0.005828857421875, 0.0103759765625, -0.016357421875, 0.0103759765625, -0.00140380859375, -0.00970458984375, 0.0135498046875, -0.00982666015625, 0.000560760498046875, -0.0150146484375, -0.0111083984375, -0.0049133...

[ 113053, 6626, 87, 42246, 678, 20, 23, 1556, 142508, 2667, 712, 12353, 686, 1900, 18344, 20469, 418, 3871, 33284, 17780, 23351, 214, 91, 10, 17721, 1257, 43240, 7108, 3917 ]

[ 0.2196044921875, 0.1925048828125, 0.13916015625, 0.20751953125, 0.1014404296875, 0.12353515625, 0.11883544921875, 0.1558837890625, 0.231201171875, 0.07623291015625, 0.08514404296875, 0.07318115234375, 0.0556640625, 0.06488037109375, 0.07440185546875, 0.12109375, 0.0162353515625, 0....

embed

56223033_c0

56223033

haskell

0

Title: Cabal installed packages cache cleanup issue Problem title: Cabal installed packages cache cleanup issue Tags: haskell, cabal Problem: Cabal installed packages cache cleanup issue If I give following command: cabal install <pkgname> the package and its dependencies will be downloaded and installed. Do these pack...

Cabal installed packages cache cleanup issue Cabal installed packages cache cleanup issue haskell cabal Cabal Cabal installed packages cache cleanup issue If I give following command: the package and its dependencies will be downloaded and installed. Do these packages remain in some place like cache and take up space? ...

[ -0.0003528594970703125, 0.012451171875, 0.03564453125, 0.01153564453125, -0.015869140625, 0.0146484375, -0.0108642578125, -0.00927734375, -0.00799560546875, 0.053955078125, -0.01275634765625, 0.001800537109375, 0.00482177734375, 0.01239013671875, -0.00469970703125, 0.0146484375, 0.01...

[ 30438, 289, 20600, 297, 98169, 82365, 46622, 2037, 31089, 1556, 142508, 109524, 8337, 25632, 75101, 136, 42548, 117538, 1221, 7026, 6097, 47143, 3687, 5646, 1257, 32628, 3642, 831, 154109, 71, 51312 ]

[ 0.161376953125, 0.1544189453125, 0.16943359375, 0.025665283203125, 0.224853515625, 0.23291015625, 0.1744384765625, 0.078857421875, 0.0985107421875, 0.0972900390625, 0.16455078125, 0.2076416015625, 0.03369140625, 0.033660888671875, 0.1270751953125, 0.038421630859375, 0.1676025390625, ...

embed

21808930_c0

21808930

haskell

0

Title: Combining bind and return Problem title: Combining bind and return Tags: haskell Problem: Combining bind and return Consider: x `f` y = x >>= (return . y) This function f seems very similar to <$> and flip liftM but <$> doesn't seem to work and I'd have to define an infix operator for flip liftM to make it look ...

Combining bind and return Combining bind and return haskell Combining Combining bind and return Consider: This function f seems very similar to <$> and flip liftM but <$> doesn't seem to work and I'd have to define an infix operator for flip liftM to make it look nice and I'm presuming one already exists? Is there a fu...

[ -0.023193359375, 0.0203857421875, 0.00157928466796875, 0.004058837890625, -0.006072998046875, 0.009765625, 0.0113525390625, -0.02001953125, 0.0205078125, -0.0245361328125, -0.00018787384033203125, -0.0201416015625, 0.0025177001953125, 0.0264892578125, 0.00174713134765625, -0.0036621093...

[ 106935, 592, 68557, 136, 30646, 1556, 142508, 137399, 32354, 1238, 37202, 21373, 4369, 2740, 147505, 60520, 594, 22027, 18, 48903, 4488, 61924, 23, 55923, 39933, 6713, 26267, 44136, 21771, 32316, 1884, 151552 ]

[ 0.193359375, 0.0445556640625, 0.211669921875, 0.093505859375, 0.23681640625, 0.0870361328125, 0.1925048828125, 0.0168304443359375, 0.1798095703125, 0.11572265625, 0.0712890625, 0.0947265625, 0.1173095703125, 0.0279388427734375, 0.1529541015625, 0.1773681640625, 0.1439208984375, 0.0...

embed

57532363_c0

57532363

haskell

0

Title: Haskell hedgehog-fn custom function generator Problem title: Haskell hedgehog-fn custom function generator Tags: haskell-hedgehog, haskell Problem: Haskell hedgehog-fn custom function generator When using hedgehog-fn is it possible to create function generators that generate functions meeting a specific criteria...

Haskell hedgehog-fn custom function generator Haskell hedgehog-fn custom function generator haskell-hedgehog haskell Haskell Haskell hedgehog-fn custom function generator When using hedgehog-fn is it possible to create function generators that generate functions meeting a specific criteria? For example: would it be pos...

[ 0.007049560546875, -0.001556396484375, -0.0130615234375, -0.0189208984375, -0.014892578125, 0.0244140625, 0.01409912109375, -0.0213623046875, 0.00165557861328125, -0.0201416015625, -0.00830078125, -0.01025390625, -0.0042724609375, 0.0034637451171875, 0.018310546875, -0.006591796875, ...

[ 20625, 142508, 80568, 60885, 1663, 14783, 114122, 32354, 145823, 1556, 5252, 17368, 83, 7722, 28282, 7, 139392, 41714, 29458, 55738, 11, 2806, 765, 4734, 1582, 100034 ]

[ 0.0849609375, 0.205810546875, 0.103271484375, 0.131591796875, 0.174072265625, 0.1898193359375, 0.1920166015625, 0.2218017578125, 0.2626953125, 0.0623779296875, 0.04833984375, 0.06756591796875, 0.0140380859375, 0.135986328125, 0.1358642578125, 0.0287628173828125, 0.1959228515625, 0....

embed

38930302_c0

38930302

haskell

0

Title: Power given in a String to Integer Problem title: Power given in a String to Integer Tags: haskell Problem: Power given in a String to Integer We know how to convert a String to an Integer for a String such as "50" . Assume the String is "2^3" , how to get 8 from it ? Is there something which works when it is no...

Power given in a String to Integer Power given in a String to Integer haskell Power Integer Power given in a String to Integer We know how to convert a String to an Integer for a String such as "50" . Assume the String is "2^3" , how to get 8 from it ? Is there something which works when it is not known in advance that...

[ -0.0012664794921875, -0.0205078125, -0.01104736328125, 0.03466796875, 0.0012664794921875, 0.0306396484375, 0.0067138671875, -0.0034637451171875, 0.00689697265625, -0.009521484375, 0.006866455078125, -0.018310546875, -0.0169677734375, 0.0164794921875, -0.0031890869140625, -0.00077056884...

[ 17170, 34475, 23351, 214, 47, 44401, 23, 1556, 142508, 3714, 3642, 96760, 142, 2525, 66596, 304, 8353, 363, 2046, 382, 1295, 9844, 43240, 959, 51529, 129745, 41018, 14537, 4488, 85398 ]

[ 0.2166748046875, 0.0992431640625, 0.203857421875, 0.1048583984375, 0.0963134765625, 0.2137451171875, 0.028106689453125, 0.12451171875, 0.2119140625, 0.01116943359375, 0.03656005859375, 0.1177978515625, 0.00518798828125, 0.17431640625, 0.018157958984375, 0.051788330078125, 0.011199951...

embed

39795944_c2

39795944

haskell

2

ate_fixe :: (Functor f) => FixE f (e1 -> e2) -> FixE f e1 -> FixE f e2 applicate_fixe (Fix f) b = Fix (fmap (`applicate_fixe` b) f) -- Works as the f argument in fmap is a functor applicate_fixe (Throw Code signals: a, the, Why, Functor, Free, Applicative, Main, Toy, Output, Bell, Done, FixE, Fix, Throw, Type, applicat...

[ 0.019775390625, -0.00714111328125, 0.00958251953125, 0.00628662109375, 0.0205078125, 0.0108642578125, -0.018310546875, 0.00823974609375, 0.033203125, -0.01611328125, 0.00171661376953125, -0.01531982421875, 0.01300048828125, 0.04296875, 0.01080322265625, -0.044921875, 0.00811767578125...

[ 10, 67, 454, 55923, 13, 1984, 97249, 18770, 1238, 44357, 96746, 647, 418, 33079, 28, 10461, 304, 41816, 6159, 425, 876, 2203, 420, 62346, 9007, 11048, 4210, 27985, 237, 10750, 23, 83, 7477, 20800, 15555, 28864, 26073, 70, 44084, 28670, ...

[ 0.0677490234375, 0.1915283203125, 0.0289459228515625, 0.277587890625, 0.1766357421875, 0.052734375, 0.1529541015625, 0.1697998046875, 0.1744384765625, 0.04400634765625, 0.25439453125, 0.1539306640625, 0.035064697265625, 0.0200958251953125, 0.054443359375, 0.0848388671875, 0.056701660...

embed

38320570_c0

38320570

haskell

0

Title: The up arrow in ghcii.sh does not scroll through command history Problem title: The up arrow in ghcii.sh does not scroll through command history Tags: windows, haskell, cygwin, ghci Problem: The up arrow in ghcii.sh does not scroll through command history I'm using ghcii.sh and cygwin (windows 10). The up arrow ...

The up arrow in ghcii.sh does not scroll through command history The up arrow in ghcii.sh does not scroll through command history windows haskell cygwin ghci ghcii.sh The up arrow in ghcii.sh does not scroll through command history I'm using ghcii.sh and cygwin (windows 10). The up arrow moves the cursor up one line in...

[ -0.01348876953125, 0.039794921875, 0.0255126953125, -0.000682830810546875, -0.005462646484375, -0.0052490234375, 0.01251220703125, 0.011962890625, -0.0026702880859375, 0.00677490234375, -0.000965118408203125, 0.006683349609375, -0.00013637542724609375, 0.00103759765625, 0.001884460449218...

[ 1257, 118201, 23, 31380, 26506, 5, 1495, 14602, 959, 192046, 8305, 75101, 32692, 54825, 1556, 142508, 19932, 177, 9494, 318, 17368, 136, 229792, 209, 25813, 7, 13810, 42, 1632, 13315, 64457, 214, 3249 ]

[ 0.187255859375, 0.220458984375, 0.03607177734375, 0.1435546875, 0.2421875, 0.04034423828125, 0.1580810546875, 0.06488037109375, 0.1419677734375, 0.218017578125, 0.0941162109375, 0.1597900390625, 0.1846923828125, 0.066162109375, 0.09033203125, 0.185302734375, 0.0540771484375, 0.0309...

embed

50689354_c0

50689354

haskell

0

Title: Haskell, rigid type error Problem title: Haskell, rigid type error Tags: haskell Problem: Haskell, rigid type error Currently I am working on the following code segment data Stream x = Stream [x] deriving Show data Parser a b = P { runParser :: Stream a -> [(b, Stream a)] } Code signals: p, Haskell, Stream, Show...

Haskell, rigid type error Haskell, rigid type error haskell p Haskell Stream Show Parser Char x:xs PComb.hs:72:16 Couldn PComb.hs:71:1-44 Expected Actual Relevant PComb.hs:72:12 PComb.hs:72:1 Failed Haskell, rigid type error Currently I am working on the following code segment and I received an error like this I was ex...

[ -0.021240234375, 0.023193359375, -0.007781982421875, 0.01483154296875, 0.01708984375, 0.01544189453125, -0.01446533203125, -0.02099609375, 0.006988525390625, -0.00665283203125, 0.01507568359375, -0.0194091796875, 0.017822265625, 0.005767822265625, -0.00799560546875, -0.0017471313476562...

[ 20625, 142508, 128652, 10644, 18499, 1556, 915, 115061, 17367, 2392, 2189, 21656, 1022, 12, 425, 306, 275, 127, 12825, 22354, 191147, 15770, 179437, 617, 60075, 13, 100582, 133, 30624, 20927, 19721, 190355, 20697, 25632, 18151, 33180, 1884, 9...

[ 0.1488037109375, 0.24560546875, 0.263427734375, 0.20458984375, 0.1875, 0.1488037109375, 0.080322265625, 0.18359375, 0.1181640625, 0.06365966796875, 0.1004638671875, 0.16796875, 0.1343994140625, 0.005828857421875, 0.1021728515625, 0.0982666015625, 0.07501220703125, 0.05523681640625,...

embed

73106581_c0

73106581

haskell

0

Title: Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Problem title: Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Tags: haskell Problem: Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Why is the range so specific? Why not ...

Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? haskell Why Haskell Why is the standard-guaranteed range for Int in Haskell exactly [-2^29; 2^29)? Why is the range so specific? Why not 29-bits wide or 32 bits-w...

[ -0.0137939453125, 0.00176239013671875, 0.002685546875, 0.002471923828125, -0.00787353515625, 0.037841796875, -0.00156402587890625, -0.006072998046875, -0.00099945068359375, 0.0380859375, -0.004608154296875, -0.023681640625, 0.000896453857421875, 0.00775146484375, 0.0233154296875, 0.004...

[ 44084, 83, 5570, 89657, 2733, 297, 37457, 360, 18, 20625, 142508, 66161, 5428, 8353, 4235, 116, 83679, 23, 74, 1556, 70, 9, 100, 221, 29458, 959, 46284, 3137, 38134, 707, 2789, 4785, 113458, 15400, 496, 31635, 106, 48903, 8337 ]

[ 0.13037109375, 0.05780029296875, 0.214111328125, 0.1602783203125, 0.1837158203125, 0.10693359375, 0.237060546875, 0.1702880859375, 0.219970703125, 0.191162109375, 0.304931640625, 0.1180419921875, 0.1024169921875, 0.0660400390625, 0.257568359375, 0.0753173828125, 0.2349853515625, 0....

embed

69882582_c1

69882582

haskell

1

second argument of multiApp', namely [head, last]' In the first argument of (?==)', namely multiApp (sum :: [Int] -> Int) [head, last] [1 :: Int, 2, 3, 4]' | 232 | multiApp (sum::[Int]->Int) [head, last] [1::Int,2,3,4] ?== 5 | ^^^^ And this stackoverflow demands less code and more comments. I don't know how to more co...

[ -0.0031585693359375, 0.0262451171875, 0.0021209716796875, 0.0155029296875, -0.0040283203125, 0.014404296875, -0.003570556640625, 0.004241943359375, 0.035400390625, -0.0233154296875, 0.0277099609375, 0.00897216796875, 0.024658203125, 0.0306396484375, 0.0024566650390625, -0.02783203125, ...

[ 17932, 10750, 111, 6024, 39179, 25, 110987, 31251, 4568, 360, 5117, 32, 69112, 11832, 4153, 18, 33079, 138, 201, 98989, 82449, 190, 177261, 5465, 118664, 35968, 40715, 18151, 24626, 6868, 28864, 26073, 7, 1022, 20625, 142508, 19943, 363, 11...

[ 0.2196044921875, 0.29833984375, 0.0142059326171875, 0.2008056640625, 0.260986328125, 0.0928955078125, 0.0204925537109375, 0.20751953125, 0.178466796875, 0.0709228515625, 0.1588134765625, 0.1124267578125, 0.263916015625, 0.215087890625, 0.06402587890625, 0.1331787109375, 0.04254150390...

embed