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
9190638_c0	9190638	haskell	0	Title: How, why and when to use the ".Internal" modules pattern? Problem title: How, why and when to use the ".Internal" modules pattern? Tags: haskell Problem: How, why and when to use the ".Internal" modules pattern? I've seen a couple of package on hackage which contain module names with .Interna...	How, why and when to use the ".Internal" modules pattern? How, why and when to use the ".Internal" modules pattern? haskell How Internal Data.ByteString.Internal How, why and when to use the ".Internal" modules pattern? I've seen a couple of package on hackage which contain module names with .Intern...	[ -0.00860595703125, 0.0103759765625, 0.0103759765625, 0.0213623046875, -0.0135498046875, 0.021728515625, -0.01275634765625, -0.0036163330078125, -0.00439453125, 0.035888671875, 0.01312255859375, -0.01031494140625, 0.004058837890625, 0.029052734375, -0.0003032684326171875, -0.0048828125,...	[ 11249, 15400, 3229, 4527, 5, 44851, 6236, 41502, 88996, 7, 103510, 1556, 142508, 106745, 141, 11809, 75358, 67, 71713, 136, 98169, 85526, 4588, 70541, 123055, 678, 237, 4568, 9351, 82761, 155965, 140773, 28129, 138414, 11814, 23282, 18151, 80...	[ 0.127685546875, 0.142578125, 0.111328125, 0.1202392578125, 0.0404052734375, 0.214111328125, 0.233154296875, 0.0261993408203125, 0.245361328125, 0.06756591796875, 0.25341796875, 0.1314697265625, 0.2220458984375, 0.2059326171875, 0.05889892578125, 0.10040283203125, 0.06854248046875, ...	embed
63909870_c0	63909870	haskell	0	Title: Pattern Matching Time Complexity Haskell Problem title: Pattern Matching Time Complexity Haskell Tags: haskell, pattern-matching Problem: Pattern Matching Time Complexity Haskell I'm trying to understand time complexity of pattern matching. I thought matching types like in foo would take constant time while matc...	Pattern Matching Time Complexity Haskell Pattern Matching Time Complexity Haskell haskell pattern-matching Pattern Matching Time Complexity Haskell Main Foo Bar Baz Cat Constructors Elements x:xs y:x:xs Pattern Matching Time Complexity Haskell I'm trying to understand time complexity of pattern matching. I thought matc...	[ -0.00653076171875, 0.003082275390625, -0.00154876708984375, 0.0003185272216796875, 0.004852294921875, -0.0027618408203125, -0.0133056640625, 0.01031494140625, 0.0091552734375, -0.030517578125, 0.021240234375, -0.021240234375, 0.01251220703125, 0.007232666015625, -0.013427734375, -0.007...	[ 9876, 22766, 67407, 214, 19055, 113197, 20625, 142508, 2481, 1556, 103510, 98753, 12321, 9572, 31, 3253, 36490, 18826, 82084, 18770, 48325, 425, 113, 31577, 28219, 1733, 27140, 14858, 17569, 52895, 1884, 23, 5775, 2806, 5646, 53697, 12960, 19...	[ 0.1519775390625, 0.1241455078125, 0.218505859375, 0.07977294921875, 0.146484375, 0.1995849609375, 0.1158447265625, 0.2076416015625, 0.10205078125, 0.10308837890625, 0.2073974609375, 0.1246337890625, 0.0693359375, 0.138916015625, 0.148193359375, 0.130859375, 0.121337890625, 0.122802...	embed
15054329_c1	15054329	haskell	1	elements being no "location" getName &&& (getChildren) -- get the name and the value for each element ) <+> ( hasName "location" >>> -- work on all nodes within the "location" subcontainer getChildren >>> isElem >>> ( getName &&& (getChildren) ) -- get the name and the value for each element ) getAllAddressesUsages ::...	elements being no "location" getName &&& (getChildren) -- get the name and the value for each element ) <+> ( hasName "location" >>> -- work on all nodes within the "location" subcontainer getChildren >>> isElem >>> ( getName &&& (getChildren) ) -- get the name and the value for each element ) getAllAddressesUsages ::...	[ 0.0191650390625, 0.0031890869140625, 0.00830078125, -0.000713348388671875, -0.0062255859375, 0.0166015625, -0.01123046875, -0.01068115234375, 0.00897216796875, -0.004058837890625, 0.00494384765625, 0.01055908203125, -0.0081787109375, 0.005462646484375, 0.004669189453125, -0.01141357421...	[ 80854, 8035, 110, 87632, 2046, 163612, 619, 1230, 15, 3794, 441, 102656, 982, 4210, 9351, 136, 34292, 100, 12638, 12830, 1328, 1556, 4488, 98, 756, 988, 28032, 1614, 98102, 20037, 58142, 83, 7623, 195, 1388, 43512, 161007, 1062, 7, 42724,...	[ 0.224365234375, 0.1541748046875, 0.1805419921875, 0.2347412109375, 0.168212890625, 0.2509765625, 0.0997314453125, 0.169189453125, 0.0059814453125, 0.152587890625, 0.05096435546875, 0.1619873046875, 0.1785888671875, 0.09320068359375, 0.170166015625, 0.1116943359375, 0.1805419921875, ...	embed
38552441_c0	38552441	haskell	0	Title: PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" Problem title: PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" Tags: postgresql-simple, postgresql, haskell Problem: PostgreSQL-simple `execute` on a f...	PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" postgresql-simple postgresql haskell SomeException QueryError PostgreSQL-simple Col RETURNS id1 id2 Exception ...	[ 0.0087890625, -0.01141357421875, -0.00897216796875, 0.0233154296875, 0.009033203125, -0.00628662109375, -0.001190185546875, -0.0291748046875, 0.0023345947265625, -0.005645751953125, 0.01495361328125, -0.01092529296875, -0.021728515625, -0.01361083984375, 0.0028533935546875, -0.01110839...	[ 2795, 7134, 158897, 191560, 46480, 85691, 98, 32354, 35782, 678, 16750, 11554, 4317, 8447, 316, 1305, 17562, 99247, 1556, 142508, 31384, 63928, 58836, 9069, 56943, 3447, 418, 304, 23, 3444, 71924, 1295, 20625, 114419, 138, 15555, 1284, 159978...	[ 0.0985107421875, 0.1646728515625, 0.175537109375, 0.214111328125, 0.1318359375, 0.159912109375, 0.1080322265625, 0.17431640625, 0.1488037109375, 0.032684326171875, 0.136962890625, 0.13818359375, 0.047271728515625, 0.07958984375, 0.08245849609375, 0.060302734375, 0.215576171875, 0.1...	embed
28579534_c0	28579534	haskell	0	Title: How do you filter a list of strings by a string in haskell? Problem title: How do you filter a list of strings by a string in haskell? Tags: filtering, haskell, string Problem: How do you filter a list of strings by a string in haskell? I have a string containing letters I want to be sure are in the words in the...	How do you filter a list of strings by a string in haskell? How do you filter a list of strings by a string in haskell? filtering haskell string Data.List How How do you filter a list of strings by a string in haskell? I have a string containing letters I want to be sure are in the words in the list. Running it however...	[ -0.00982666015625, 0.007171630859375, -0.027587890625, 0.00086212158203125, 0.004669189453125, 0.0081787109375, 0.023193359375, -0.0125732421875, -0.003662109375, -0.00167083740234375, -0.014404296875, 0.00531005859375, -0.007568359375, 0.00128936767578125, -0.0283203125, 0.01489257812...	[ 11249, 46312, 5303, 79315, 7, 390, 23, 1556, 142508, 214, 11809, 154663, 10, 70541, 120820, 3444, 9077, 34153, 28398, 7464, 137802, 50155, 165, 7373, 2822, 32354, 15549, 4488, 34735, 16065, 959, 202, 15123, 1810, 14817, 10840, 2565, 46799, ...	[ 0.049713134765625, 0.259765625, 0.1748046875, 0.2196044921875, 0.0161285400390625, 0.1136474609375, 0.04266357421875, 0.145263671875, 0.241943359375, 0.0146636962890625, 0.0706787109375, 0.0928955078125, 0.00244140625, 0.0838623046875, 0.13232421875, 0.005584716796875, 0.104370117187...	embed
66008338_c0	66008338	haskell	0	Title: Filter bigger element of two lists Problem title: Filter bigger element of two lists Tags: haskell, list, filter Problem: Filter bigger element of two lists I am trying to write a Haskell programm which outputs a list of primes, but only those where the square is bigger than the product of the previous and follo...	Filter bigger element of two lists Filter bigger element of two lists haskell list filter Filter Filter bigger element of two lists I am trying to write a Haskell programm which outputs a list of primes, but only those where the square is bigger than the product of the previous and following prime. For example, given M...	[ 0.005035400390625, 0.0279541015625, -0.00714111328125, -0.00433349609375, -0.0028533935546875, -0.00518798828125, -0.000035762786865234375, -0.0106201171875, 0.0272216796875, 0.027587890625, 0.004669189453125, -0.002288818359375, -0.020751953125, -0.0186767578125, -0.0152587890625, 0.0...	[ 128896, 167785, 12830, 111, 6626, 5303, 1556, 142508, 46312, 31577, 33022, 20625, 28966, 140992, 20809, 7, 4734, 8382, 7440, 108047, 3501, 12996, 96362, 25632, 1774, 28282, 6958, 38648, 38742, 80854, 2060, 171581, 43240, 4127, 145111, 90, 32354...	[ 0.2191162109375, 0.236083984375, 0.2242431640625, 0.039031982421875, 0.179443359375, 0.2227783203125, 0.124267578125, 0.19921875, 0.2078857421875, 0.058990478515625, 0.0738525390625, 0.09698486328125, 0.107421875, 0.116455078125, 0.1650390625, 0.02996826171875, 0.032958984375, 0.01...	embed
68537997_c0	68537997	haskell	0	Title: Why does the type of local variables that are values affect the type of input variables in the type signature of a function? Problem title: Why does the type of local variables that are values affect the type of input variables in the type signature of a function? Tags: haskell Problem: Why does the type of loca...	Why does the type of local variables that are values affect the type of input variables in the type signature of a function? Why does the type of local variables that are values affect the type of input variables in the type signature of a function? haskell Why Prelude Num Enum Show Bool Why does the type of local vari...	[ 0.0035858154296875, 0.0020599365234375, -0.0018157958984375, 0.0152587890625, 0.00323486328125, -0.004974365234375, -0.0228271484375, -0.010498046875, -0.0107421875, -0.004608154296875, -0.01068115234375, -0.006866455078125, 0.004364013671875, 0.0145263671875, 0.007171630859375, -0.010...	[ 44084, 10644, 4000, 77336, 142424, 52490, 107730, 138256, 32354, 7, 1556, 142508, 1914, 822, 112, 52782, 357, 316, 17367, 2460, 929, 621, 2806, 41206, 1238, 110527, 864, 10, 756, 18507, 158, 2816, 4288, 190659, 91, 2843, 31635, 853, 133266,...	[ 0.111328125, 0.178955078125, 0.139404296875, 0.2244873046875, 0.1971435546875, 0.1484375, 0.1827392578125, 0.1842041015625, 0.13623046875, 0.0145721435546875, 0.10711669921875, 0.2030029296875, 0.06378173828125, 0.142822265625, 0.042266845703125, 0.1268310546875, 0.041839599609375, ...	embed
57514838_c0	57514838	haskell	0	Title: Why is a universally quantified variable not in scope in this Haskell function? Problem title: Why is a universally quantified variable not in scope in this Haskell function? Tags: haskell Problem: Why is a universally quantified variable not in scope in this Haskell function? I'm sure I've been able to do somet...	Why is a universally quantified variable not in scope in this Haskell function? Why is a universally quantified variable not in scope in this Haskell function? haskell Data.Typeable RIO Why Haskell LANGUAGE TypeApplications FDS.Database IsCowRec CowMark FdsEnv type2tblName Proxy Not Why is a universally quantified vari...	[ 0.01385498046875, 0.005767822265625, -0.020263671875, 0.0037384033203125, -0.006805419921875, -0.01177978515625, -0.01190185546875, 0.026611328125, -0.008544921875, -0.01373291015625, 0.006317138671875, -0.0283203125, 0.00311279296875, -0.016357421875, 0.00299072265625, 0.0133056640625...	[ 44084, 83, 32813, 538, 55230, 47314, 77336, 959, 23, 70820, 903, 20625, 142508, 32354, 1556, 11809, 196707, 2886, 92823, 98064, 60457, 47677, 182867, 563, 13526, 137989, 37382, 2071, 8770, 4332, 238, 1311, 434, 73484, 6468, 7768, 334, 10644, ...	[ 0.11572265625, 0.0347900390625, 0.163818359375, 0.0911865234375, 0.16748046875, 0.166259765625, 0.2587890625, 0.1788330078125, 0.117431640625, 0.227294921875, 0.0540771484375, 0.1312255859375, 0.2568359375, 0.165283203125, 0.1024169921875, 0.0384521484375, 0.1417236328125, 0.125244...	embed
61453455_c0	61453455	haskell	0	Title: Finding the bit length of an Integer in haskell Problem title: Finding the bit length of an Integer in haskell Tags: haskell Problem: Finding the bit length of an Integer in haskell I want to find the bit-length (i.e., the index of the highest set bit) of an Integral type in Haskell - like the corresponding meth...	Finding the bit length of an Integer in haskell Finding the bit length of an Integer in haskell haskell Finding Integer Integral Bits Finding the bit length of an Integer in haskell I want to find the bit-length (i.e., the index of the highest set bit) of an Integral type in Haskell - like the corresponding methods in ...	[ -0.0299072265625, 0.020263671875, -0.01019287109375, 0.00860595703125, 0.002410888671875, 0.0198974609375, -0.0059814453125, -0.005218505859375, 0.0029449462890625, -0.024658203125, -0.00133514404296875, -0.0034637451171875, 0.00112152099609375, 0.0341796875, 0.0260009765625, -0.008911...	[ 26040, 214, 70, 4785, 140909, 111, 44401, 23, 1556, 142508, 204681, 27774, 3444, 7413, 23986, 927, 63262, 167375, 5423, 10644, 20625, 1884, 42518, 150624, 41925, 707, 145581, 2965, 10, 2394, 6635, 33938, 17368, 7108, 122925, 221, 4966, 12319,...	[ 0.1231689453125, 0.0194549560546875, 0.0037841796875, 0.2215576171875, 0.2271728515625, 0.046356201171875, 0.271484375, 0.07562255859375, 0.1636962890625, 0.25390625, 0.2449951171875, 0.189453125, 0.0897216796875, 0.140625, 0.1737060546875, 0.1075439453125, 0.1568603515625, 0.18359...	embed
25963297_c0	25963297	haskell	0	Title: Haskell - how to wire together components that have different subsets of dependencies? Problem title: Haskell - how to wire together components that have different subsets of dependencies? Tags: haskell, dependency-injection Problem: Haskell - how to wire together components that have different subsets of depend...	Haskell - how to wire together components that have different subsets of dependencies? Haskell - how to wire together components that have different subsets of dependencies? haskell dependency-injection Haskell MonadIO Haskell - how to wire together components that have different subsets of dependencies? How can I inte...	[ -0.0086669921875, -0.0057373046875, -0.01104736328125, 0.0032501220703125, -0.00927734375, 0.024658203125, -0.007720947265625, -0.00616455078125, 0.007080078125, 0.014892578125, 0.00177001953125, -0.0213623046875, 0.000530242919921875, 0.035400390625, -0.006011962890625, -0.02124023437...	[ 20625, 142508, 3642, 1439, 13, 25842, 82761, 765, 12921, 1614, 3509, 42548, 117538, 47, 1556, 27771, 73, 236, 60331, 71, 17780, 450, 11249, 831, 87, 78779, 38415, 1295, 64209, 67842, 150449, 123309, 8781, 180346, 155255, 3444, 172554, 4734, ...	[ 0.1617431640625, 0.279296875, 0.0810546875, 0.114501953125, 0.0948486328125, 0.191650390625, 0.2230224609375, 0.022552490234375, 0.1422119140625, 0.13916015625, 0.1400146484375, 0.218994140625, 0.1226806640625, 0.012298583984375, 0.1322021484375, 0.13134765625, 0.05767822265625, 0....	embed
53724107_c0	53724107	haskell	0	Title: Map function at Haskell Problem title: Map function at Haskell Tags: haskell Problem: Map function at Haskell The question : Define the function setElements, which takes a list indxs of pairs of (n, x) (where n is an Int), and a list xs, and for each pair (n, x) it sets the n’th element in xs to be x. If a pair ...	Map function at Haskell Map function at Haskell haskell Map Haskell x:tail x:xs Map function at Haskell The question : Define the function setElements, which takes a list indxs of pairs of (n, x) (where n is an Int), and a list xs, and for each pair (n, x) it sets the n’th element in xs to be x. If a pair contains in i...	[ -0.00170135498046875, 0.004486083984375, 0.02392578125, 0.00139617919921875, -0.0189208984375, 0.01434326171875, -0.00640869140625, -0.005828857421875, 0.028564453125, 0.007080078125, 0.0159912109375, -0.002532958984375, 0.0106201171875, 0.007720947265625, 0.00628662109375, -0.00668334...	[ 42719, 32354, 99, 20625, 142508, 1556, 1022, 46741, 12, 425, 9655, 262, 64552, 5423, 647, 19929, 7, 51776, 5303, 2752, 80836, 19, 653, 360, 18, 12638, 927, 12830, 47, 186, 70541, 5117, 82761, 40907, 63262, 150679, 140909, 124962, 1286, 16...	[ 0.2783203125, 0.22412109375, 0.095947265625, 0.1630859375, 0.271240234375, 0.1304931640625, 0.091064453125, 0.2021484375, 0.01959228515625, 0.1241455078125, 0.05523681640625, 0.010711669921875, 0.1339111328125, 0.24853515625, 0.142578125, 0.2724609375, 0.1351318359375, 0.1149902343...	embed
21696933_c0	21696933	haskell	0	Title: How to pass type which got FromJSON implemented as argument to anoter function? Problem title: How to pass type which got FromJSON implemented as argument to anoter function? Tags: interface, haskell Problem: How to pass type which got FromJSON implemented as argument to anoter function? Here is my try: decode :...	How to pass type which got FromJSON implemented as argument to anoter function? How to pass type which got FromJSON implemented as argument to anoter function? interface haskell How FromJSON BS.ByteString BS.readFile Maybe Data.Yaml.decode Couldn Yaml.decode Yaml.hs:46:11 Expected Actual How to pass type which got From...	[ 0.02001953125, 0.001434326171875, -0.004486083984375, 0.00860595703125, 0.0036163330078125, 0.01043701171875, -0.00933837890625, -0.00147247314453125, -0.0220947265625, -0.0191650390625, -0.004119873046875, -0.017822265625, -0.0145263671875, -0.0181884765625, 0.001953125, -0.0103759765...	[ 11249, 47, 27875, 10644, 3129, 4163, 28090, 1375, 58627, 29479, 237, 10750, 2373, 720, 32354, 101758, 1556, 142508, 84145, 75358, 67, 71713, 39116, 174350, 83425, 11809, 21566, 7237, 112, 40899, 191147, 2369, 5, 127, 32909, 19993, 60075, 13, ...	[ 0.0545654296875, 0.0845947265625, 0.134033203125, 0.228271484375, 0.041412353515625, 0.02935791015625, 0.22705078125, 0.12353515625, 0.2095947265625, 0.134033203125, 0.06982421875, 0.228759765625, 0.1719970703125, 0.242919921875, 0.1673583984375, 0.1036376953125, 0.10211181640625, ...	embed
71243589_c1	71243589	haskell	1	a Maybe m1 traverse-like an async operation over m1 if m1 is Nothing , short-circuit out of the computation, i.e. traverse-like returns m2 == Nothing to the computation if m1 is Just x , perform the async effect which may return async Nothing or async Just x , s.t. traverse-like returns m2 == Nothing or Just async x t...	a Maybe m1 traverse-like an async operation over m1 if m1 is Nothing , short-circuit out of the computation, i.e. traverse-like returns m2 == Nothing to the computation if m1 is Just x , perform the async effect which may return async Nothing or async Just x , s.t. traverse-like returns m2 == Nothing or Just async x t...	[ -0.0201416015625, 0.0223388671875, -0.0024566650390625, -0.01275634765625, 0.0177001953125, 0.018798828125, 0.0157470703125, -0.0130615234375, 0.01434326171875, -0.0242919921875, 0.0029144287109375, 0.0067138671875, -0.005035400390625, -0.01275634765625, 0.01251220703125, 0.00386047363...	[ 83425, 347, 418, 37317, 13, 5062, 10, 12654, 238, 41018, 645, 2174, 83, 182747, 16610, 82063, 7143, 1810, 181135, 30646, 304, 69112, 9563, 1022, 51339, 21543, 1543, 18, 5201, 19537, 939, 903, 49878, 67, 592, 3934, 28271, 8999, 3525, 22253...	[ 0.28759765625, 0.1038818359375, 0.126953125, 0.2275390625, 0.109375, 0.2071533203125, 0.1312255859375, 0.21923828125, 0.0916748046875, 0.230712890625, 0.1063232421875, 0.0596923828125, 0.060882568359375, 0.1678466796875, 0.107666015625, 0.0660400390625, 0.10443115234375, 0.09875488...	embed
7815402_c0	7815402	haskell	0	Title: Convert a Lazy ByteString to a strict ByteString Problem title: Convert a Lazy ByteString to a strict ByteString Tags: haskell, lazy-evaluation, strict, chunking, bytestring Problem: Convert a Lazy ByteString to a strict ByteString I have a function that takes a lazy ByteString , that I wish to have return lists...	Convert a Lazy ByteString to a strict ByteString Convert a Lazy ByteString to a strict ByteString haskell lazy-evaluation strict chunking bytestring qualified Convert Lazy ByteString ByteStrings Data.ByteString Data.ByteString.Lazy L.ByteString B.ByteString Convert a Lazy ByteString to a strict ByteString I have a func...	[ 0.005523681640625, 0.00787353515625, 0.0067138671875, -0.0225830078125, -0.001556396484375, 0.03076171875, -0.005157470703125, -0.00007486343383789062, 0.01422119140625, -0.007049560546875, 0.00836181640625, 0.0084228515625, 0.007354736328125, 0.00830078125, -0.01708984375, 0.011230468...	[ 1657, 11549, 239, 3285, 3311, 67, 71713, 214, 47, 10, 81113, 1556, 142508, 21, 159258, 7839, 6048, 390, 91693, 217225, 11809, 75358, 2729, 339, 335, 32354, 51776, 32599, 30646, 5303, 5180, 708, 7432, 12302, 10644, 140992, 3444, 75675, 64209...	[ 0.024078369140625, 0.146240234375, 0.1534423828125, 0.197998046875, 0.1231689453125, 0.1392822265625, 0.198486328125, 0.10125732421875, 0.07366943359375, 0.04254150390625, 0.253173828125, 0.091796875, 0.2012939453125, 0.13525390625, 0.135986328125, 0.1351318359375, 0.066650390625, ...	embed
67757976_c0	67757976	haskell	0	Title: How can the reader monad be bound like this Problem title: How can the reader monad be bound like this Tags: haskell, monads Problem: How can the reader monad be bound like this import Control.Monad.Reader tom :: Reader String String tom = do env <- ask -- gives you the environment which in this case is a String...	How can the reader monad be bound like this How can the reader monad be bound like this haskell monads Control.Monad.Reader How Reader Tom Jerry Who How can the reader monad be bound like this In this example, tom:: Reader (String -> String) . So is the same as (supposing tom is Reader (f) and jerry is Reader (g) ): th...	[ -0.00909423828125, 0.004058837890625, 0.005950927734375, 0.0079345703125, 0.00102996826171875, 0.005767822265625, -0.0072021484375, -0.0146484375, -0.00555419921875, -0.03369140625, 0.015625, 0.00689697265625, -0.01312255859375, 0.00726318359375, 0.0181884765625, -0.003753662109375, ...	[ 11249, 831, 155255, 2667, 712, 186, 99091, 1884, 903, 70, 1556, 142508, 27131, 46674, 31345, 56, 122636, 8352, 138171, 40469, 27781, 3627, 12, 71713, 214, 33079, 23351, 5701, 67565, 83, 420, 136, 55, 56216, 177, 26950, 1238, 47, 808, 706,...	[ 0.08343505859375, 0.09423828125, 0.275634765625, 0.12451171875, 0.1771240234375, 0.066650390625, 0.2447509765625, 0.145263671875, 0.10638427734375, 0.0228424072265625, 0.11474609375, 0.2135009765625, 0.1656494140625, 0.0958251953125, 0.2098388671875, 0.094482421875, 0.30029296875, ...	embed
30744680_c1	30744680	haskell	1	File = "test_ascii.pgm" main = B.readFile logFile >>= print . parseOnly parseASCIIGreymap A example file (test_ascii.pgm) looks like this: P2 # CREATOR: GIMP PNM Filter Version 1.1 10 10 255 0 0 0 0 0 64 255 255 255 179 0 0 0 0 0 159 255 255 255 243 0 0 0 0 96 223 255 255 255 255 0 0 64 96 223 255 255 255 255 255 128 1...	File = "test_ascii.pgm" main = B.readFile logFile >>= print . parseOnly parseASCIIGreymap A example file (test_ascii.pgm) looks like this: P2 # CREATOR: GIMP PNM Filter Version 1.1 10 10 255 0 0 0 0 0 64 255 255 255 179 0 0 0 0 0 159 255 255 255 243 0 0 0 0 96 223 255 255 255 255 0 0 64 96 223 255 255 255 255 255 128 1...	[ -0.00848388671875, -0.00799560546875, -0.01373291015625, 0.02880859375, 0.004669189453125, 0.03662109375, -0.009765625, -0.0111083984375, 0.0086669921875, 0.034423828125, 0.030517578125, -0.010986328125, -0.00927734375, -0.01287841796875, -0.000911712646484375, 0.003387451171875, -0....	[ 42724, 6954, 162, 26506, 254, 177, 39, 5201, 335, 39116, 174350, 12684, 28412, 366, 184, 20320, 538, 284, 134165, 36840, 62346, 27781, 11435, 33342, 1884, 903, 436, 304, 175151, 527, 169937, 70480, 128896, 40647, 38245, 209, 86565, 7911, 64...	[ 0.174072265625, 0.192138671875, 0.043487548828125, 0.236328125, 0.04913330078125, 0.1201171875, 0.166015625, 0.0892333984375, 0.09686279296875, 0.171142578125, 0.1693115234375, 0.13916015625, 0.07122802734375, 0.1722412109375, 0.092041015625, 0.0609130859375, 0.028228759765625, 0.0...	embed
10408046_c0	10408046	haskell	0	Title: Implementing `read` for a left-associative tree in Haskell Problem title: Implementing `read` for a left-associative tree in Haskell Tags: haskell Problem: Implementing `read` for a left-associative tree in Haskell I'm having a hard time implementing Read for a tree structure. I want to take a left-associative s...	Implementing `read` for a left-associative tree in Haskell Implementing `read` for a left-associative tree in Haskell haskell Implementing Haskell ABC Tree Branch Leaf Char Show Implementing `read` for a left-associative tree in Haskell I'm having a hard time implementing Read for a tree structure. I want to take a lef...	[ 0.00518798828125, 0.013427734375, -0.003662109375, 0.0225830078125, 0.0145263671875, 0.0211181640625, 0.00592041015625, -0.049560546875, 0.00055694580078125, -0.038330078125, 0.0028839111328125, -0.035400390625, -0.00579833984375, 0.00836181640625, 0.0057373046875, 0.00147247314453125,...	[ 153941, 39116, 100, 25737, 162, 45388, 45023, 53201, 20625, 142508, 1556, 47457, 101344, 21110, 636, 2407, 21656, 17367, 7941, 1733, 29479, 4764, 45646, 3444, 5646, 10, 79315, 76228, 366, 1755, 1884, 8399, 919, 96760, 3934, 17311, 27781, 4251...	[ 0.21142578125, 0.27490234375, 0.08575439453125, 0.2073974609375, 0.03369140625, 0.150634765625, 0.050048828125, 0.2427978515625, 0.1339111328125, 0.2213134765625, 0.1229248046875, 0.1380615234375, 0.172119140625, 0.0775146484375, 0.021209716796875, 0.09600830078125, 0.1221923828125, ...	embed
4463154_c0	4463154	haskell	0	Title: Haskell overlapping instances and type functions Problem title: Haskell overlapping instances and type functions Tags: overlapping-instances, metaprogramming, typeclass, haskell Problem: Haskell overlapping instances and type functions I have the following typeclass which models a SQL-like query optimization: cl...	Haskell overlapping instances and type functions Haskell overlapping instances and type functions overlapping-instances metaprogramming typeclass haskell Haskell OptimizableQuery Optimized Query Select Haskell overlapping instances and type functions I have the following typeclass which models a SQL-like query optimiza...	[ 0.0240478515625, -0.0037994384765625, -0.0086669921875, 0.006134033203125, -0.018310546875, -0.001708984375, -0.0224609375, -0.0299072265625, -0.0022735595703125, -0.000640869140625, 0.00164031982421875, -0.014892578125, 0.009765625, -0.003082275390625, -0.0220947265625, -0.00183868408...	[ 20625, 142508, 645, 143, 26783, 110527, 136, 10644, 32354, 116071, 23550, 28966, 67413, 1556, 43938, 2886, 41732, 1294, 29367, 58836, 51620, 25632, 115774, 80866, 5062, 41, 87235, 2967, 18499, 11935, 134225, 214, 14449, 21635, 5256, 44084, 8686...	[ 0.12255859375, 0.2271728515625, 0.1171875, 0.1783447265625, 0.08978271484375, 0.2225341796875, 0.0286865234375, 0.173828125, 0.1414794921875, 0.168701171875, 0.079345703125, 0.08184814453125, 0.1903076171875, 0.099609375, 0.1361083984375, 0.04718017578125, 0.016357421875, 0.0335693...	embed
3206869_c1	3206869	haskell	1	-> Operation -> fs (Path, Response) step currentDir op = case op of ChangeDir d -> return (d, "") Ls -> do { files <- children currentDir ; return (currentDir, unlines files) } At this point I am totally stuck. What I want to do is write an interactive loop in the IO monad, which can read Operation s and print Respons...	-> Operation -> fs (Path, Response) step currentDir op = case op of ChangeDir d -> return (d, "") Ls -> do { files <- children currentDir ; return (currentDir, unlines files) } At this point I am totally stuck. What I want to do is write an interactive loop in the IO monad, which can read Operation s and print Respons...	[ -0.031982421875, -0.01055908203125, -0.00013446807861328125, 0.0031890869140625, 0.00482177734375, 0.022705078125, 0.002593994140625, -0.0301513671875, -0.00016307830810546875, -0.035888671875, -0.0005645751953125, 0.033935546875, -0.0240478515625, 0.0177001953125, 0.00176239013671875, ...	[ 33079, 102203, 1238, 7, 683, 10519, 92748, 29954, 43581, 397, 481, 233, 2203, 7225, 87377, 104, 30646, 71, 339, 54, 102158, 20020, 163812, 51, 59801, 903, 6275, 444, 112668, 179933, 3444, 33022, 212398, 40956, 17780, 2667, 712, 831, 12301, ...	[ 0.016448974609375, 0.2056884765625, 0.1025390625, 0.059814453125, 0.039337158203125, 0.143310546875, 0.224853515625, 0.2440185546875, 0.235107421875, 0.142333984375, 0.180908203125, 0.2315673828125, 0.043182373046875, 0.12744140625, 0.21826171875, 0.1329345703125, 0.1568603515625, ...	embed
35733921_c0	35733921	haskell	0	Title: Compose lenses with accessing outer type during getter and setter Problem title: Compose lenses with accessing outer type during getter and setter Tags: haskell-lens, haskell Problem: Compose lenses with accessing outer type during getter and setter Suppose I have a function which extracts some inner value using...	Compose lenses with accessing outer type during getter and setter Compose lenses with accessing outer type during getter and setter haskell-lens haskell Compose inner1 inner2 Lens Compose lenses with accessing outer type during getter and setter Suppose I have a function which extracts some inner value using other inne...	[ -0.0062255859375, -0.009033203125, -0.004974365234375, 0.01177978515625, 0.0206298828125, 0.0120849609375, -0.000255584716796875, 0.000629425048828125, -0.00738525390625, -0.01708984375, -0.004058837890625, 0.050048828125, 0.0054931640625, -0.005859375, 0.012451171875, -0.0006561279296...	[ 15612, 8364, 96, 47754, 678, 17203, 1810, 56, 10644, 20271, 2046, 720, 136, 88685, 1556, 142508, 1977, 75414, 418, 304, 18226, 32354, 125663, 34292, 17368, 3789, 7359, 1636, 3098, 17721, 3917, 28282, 15700, 7, 1600, 1177, 16750, 11522, 3302...	[ 0.147216796875, 0.0850830078125, 0.1448974609375, 0.151123046875, 0.014404296875, 0.1243896484375, 0.130126953125, 0.1024169921875, 0.135498046875, 0.0811767578125, 0.0904541015625, 0.12890625, 0.04248046875, 0.1640625, 0.0902099609375, 0.200927734375, 0.1387939453125, 0.1694335937...	embed
70006438_c0	70006438	haskell	0	Title: Suppress module details when building Haskell project with Cabal Problem title: Suppress module details when building Haskell project with Cabal Tags: cabal, haskell Problem: Suppress module details when building Haskell project with Cabal I've recently switched from building my project with Stack to building it...	Suppress module details when building Haskell project with Cabal Suppress module details when building Haskell project with Cabal cabal haskell Suppress Haskell Cabal Compiling Vehicle Vehicle.hs AISEC x86_64-linux ghc-9.0.1 vehicle-0.1.0.1 Vehicle.o Vehicle.dyn_o Suppress module details when building Haskell project w...	[ 0.0146484375, 0.0034942626953125, 0.0115966796875, 0.01025390625, 0.0108642578125, -0.004150390625, 0.0062255859375, -0.006927490234375, -0.0042724609375, 0.023681640625, -0.0296630859375, -0.055419921875, 0.006805419921875, 0.00634765625, -0.0228271484375, 0.00927734375, -0.01477050...	[ 47004, 11856, 88996, 41653, 3229, 33976, 20625, 142508, 13452, 30438, 289, 678, 109524, 1556, 15612, 232362, 127, 49054, 16546, 15276, 13307, 2397, 6077, 31380, 15205, 102014, 80939, 31, 17872, 101089, 6512, 2594, 12638, 11814, 140992, 21373, 2...	[ 0.2130126953125, 0.23046875, 0.2393798828125, 0.182861328125, 0.03192138671875, 0.15234375, 0.134033203125, 0.22998046875, 0.1217041015625, 0.2015380859375, 0.1865234375, 0.060791015625, 0.2325439453125, 0.0924072265625, 0.0927734375, 0.2017822265625, 0.061492919921875, 0.022171020...	embed
13869979_c0	13869979	haskell	0	Title: printing menu in terminal and choosing an option, how to? Problem title: printing menu in terminal and choosing an option, how to? Tags: buffering, command-line, haskell, io Problem: printing menu in terminal and choosing an option, how to? Possible Duplicate: Wrong IO actions order using putStr and getLine I'm ...	printing menu in terminal and choosing an option, how to? printing menu in terminal and choosing an option, how to? buffering command-line haskell io Hello Choose World printing menu in terminal and choosing an option, how to? I'm a haskell beginner. I'm trying to make a program that shows a menu through terminal and a...	[ -0.0130615234375, -0.0003509521484375, -0.0047607421875, 0.0186767578125, -0.005279541015625, -0.014404296875, 0.00469970703125, -0.0086669921875, -0.004425048828125, -0.005645751953125, 0.003173828125, -0.0400390625, -0.00147247314453125, -0.004425048828125, -0.0012359619140625, 0.000...	[ 2448, 1916, 8026, 23, 33949, 136, 218873, 35829, 3642, 123759, 4209, 75101, 2256, 1556, 142508, 22995, 35378, 211525, 6661, 142, 47, 9842, 1679, 31577, 1528, 45831, 8305, 26458, 38937, 65508, 18151, 88996, 31380, 318, 29481, 56, 26818, 43240,...	[ 0.1903076171875, 0.051055908203125, 0.237548828125, 0.062286376953125, 0.240966796875, 0.0386962890625, 0.153564453125, 0.236328125, 0.044921875, 0.123779296875, 0.052032470703125, 0.0892333984375, 0.0625, 0.0966796875, 0.184814453125, 0.1812744140625, 0.14013671875, 0.181030273437...	embed
38154295_c0	38154295	haskell	0	Title: trouble installing accelerate-cuda Problem title: trouble installing accelerate-cuda Tags: accelerate, haskell Problem: trouble installing accelerate-cuda I have been trying to run cabal install accelerate-cuda -fdebug to no avail. at first i had some issues i think with my version of cuda, so i upgraded ghc to ...	trouble installing accelerate-cuda trouble installing accelerate-cuda accelerate haskell trouble installing accelerate-cuda I have been trying to run cabal install accelerate-cuda -fdebug to no avail. at first i had some issues i think with my version of cuda, so i upgraded ghc to version 8.0.1 and cabal to version 1.2...	[ 0.01507568359375, -0.00885009765625, 0.0106201171875, -0.005279541015625, 0.00628662109375, -0.02197265625, -0.0169677734375, -0.01220703125, -0.003570556640625, 0.0123291015625, 0.004730224609375, -0.05126953125, 0.01348876953125, -0.0030975341796875, 0.0024261474609375, 0.00207519531...	[ 63134, 20600, 197108, 13, 1010, 85, 9, 1556, 142508, 214, 31577, 11675, 109524, 420, 112, 85779, 47, 110, 25820, 5117, 37348, 5351, 11389, 314, 116086, 31380, 238, 3217, 102014, 4015, 187461, 19048, 79786, 1284, 16750 ]	[ 0.1243896484375, 0.183349609375, 0.1988525390625, 0.1522216796875, 0.1832275390625, 0.1832275390625, 0.0160064697265625, 0.1077880859375, 0.1934814453125, 0.022369384765625, 0.0416259765625, 0.05072021484375, 0.189208984375, 0.04302978515625, 0.1123046875, 0.2122802734375, 0.00708007...	embed
71605899_c0	71605899	haskell	0	Title: haskell another function as input parameter Problem title: haskell another function as input parameter Tags: haskell Problem: haskell another function as input parameter hi_copy.hs waxOn = x where z = 7 y = z + 18 k = y ^ 2 x = k * 5 triple = a where a = a * 3 then load. ghci> :load hi_copy.hs [1 of 1] Compiling...	haskell another function as input parameter haskell another function as input parameter haskell it hi_copy.hs Compiling Main Couldn Integer Relevant haskell another function as input parameter hi_copy.hs then load. then run triple waxOn run 3 * waxOn will work. but now I don't how to make triple waxOn working. meta: ti...	[ -0.023681640625, 0.007720947265625, 0.00016880035400390625, 0.011962890625, 0.000835418701171875, -0.0035400390625, -0.010986328125, -0.008544921875, 0.0031585693359375, -0.041015625, 0.0087890625, 0.0047607421875, 0.00008153915405273438, 0.01165771484375, -0.00162506103515625, -0.0004...	[ 1556, 142508, 15700, 32354, 237, 107730, 171859, 1274, 137366, 127, 15612, 49725, 12321, 191147, 19, 44401, 133, 30624, 72367, 11675, 162738, 7866, 20320, 138, 661, 4488, 3642, 3249, 20697, 23550, 570, 959, 52080, 10644, 23, 35166, 28219, 678...	[ 0.1829833984375, 0.240966796875, 0.1480712890625, 0.2119140625, 0.094482421875, 0.2005615234375, 0.2406005859375, 0.16357421875, 0.1943359375, 0.1102294921875, 0.0579833984375, 0.05499267578125, 0.081787109375, 0.130859375, 0.03826904296875, 0.1351318359375, 0.0960693359375, 0.0780...	embed
56292345_c0	56292345	haskell	0	Title: How does this usage of the composition operator work without a second argument? Problem title: How does this usage of the composition operator work without a second argument? Tags: function-composition, haskell Problem: How does this usage of the composition operator work without a second argument? I came across...	How does this usage of the composition operator work without a second argument? How does this usage of the composition operator work without a second argument? function-composition haskell How How does this usage of the composition operator work without a second argument? I came across a usage of the . operator that I ...	[ -0.01055908203125, 0.005645751953125, 0.00069427490234375, 0.03076171875, -0.01153564453125, 0.01031494140625, -0.013671875, 0.005828857421875, 0.0009613037109375, -0.0208740234375, -0.0159912109375, -0.0157470703125, -0.0037841796875, 0.0067138671875, -0.01171875, -0.0205078125, 0.0...	[ 11249, 903, 127689, 166577, 39933, 4488, 15490, 17932, 10750, 32354, 277, 40322, 1556, 142508, 14602, 5, 28219, 31635, 12921, 41877, 17304, 27489, 17368, 152, 18, 134071, 10644, 125195, 7, 4568, 136, 138256, 55681, 64549, 21373, 2806, 41206, ...	[ 0.0625, 0.0714111328125, 0.144287109375, 0.250732421875, 0.2276611328125, 0.1278076171875, 0.119384765625, 0.12255859375, 0.2117919921875, 0.153564453125, 0.13720703125, 0.178466796875, 0.14111328125, 0.2452392578125, 0.0330810546875, 0.152099609375, 0.056304931640625, 0.0205993652...	embed
34141165_c0	34141165	haskell	0	Title: foldl compiles but not foldr Problem title: foldl compiles but not foldr Tags: functional-programming, haskell Problem: foldl compiles but not foldr As a small exercise, I am trying to recode all. This code seems to work (except for infinite list): allComp f acc x = acc && f x all :: (a -> Bool) -> [a] -> Bool a...	foldl compiles but not foldr foldl compiles but not foldr functional-programming haskell Bool Couldn Main.hs:8:8 Expected Actual foldl compiles but not foldr As a small exercise, I am trying to recode all. This code seems to work (except for infinite list): But this one does not compile if I keep the same signature: An...	[ -0.004974365234375, 0.007568359375, 0.00860595703125, 0.01470947265625, -0.0059814453125, 0.0220947265625, -0.00946044921875, 0.013427734375, -0.01190185546875, 0.007354736328125, -0.005279541015625, -0.0255126953125, 0.007171630859375, 0.031494140625, -0.003265380859375, -0.0105590820...	[ 18344, 20469, 9969, 1340, 1284, 959, 7569, 123309, 28966, 1556, 142508, 2460, 929, 191147, 19, 12321, 127, 1019, 60075, 13, 100582, 19336, 81979, 31577, 33844, 112, 756, 18151, 4488, 54241, 5303, 903, 13695, 5701, 138256, 98352, 18499, 73342,...	[ 0.189453125, 0.229248046875, 0.18505859375, 0.161865234375, 0.0577392578125, 0.1097412109375, 0.1953125, 0.1270751953125, 0.0604248046875, 0.08758544921875, 0.198974609375, 0.0438232421875, 0.15478515625, 0.123046875, 0.0147705078125, 0.0955810546875, 0.0426025390625, 0.10034179687...	embed
36967622_c1	36967622	haskell	1	In this question, please trace the execution/reduction of the following function: foldl (toggle //) nil (“foo” “bar” “baz”) Below is a Hint I am Given: foldl (toggle //) nil (“foo” “bar” “baz”) Step1: Start with (1b), left side, foldl f x (cons a list) with f = (toggle //), x = nil, and list = (“foo” “bar” “baz”) Step...	In this question, please trace the execution/reduction of the following function: foldl (toggle //) nil (“foo” “bar” “baz”) Below is a Hint I am Given: foldl (toggle //) nil (“foo” “bar” “baz”) Step1: Start with (1b), left side, foldl f x (cons a list) with f = (toggle //), x = nil, and list = (“foo” “bar” “baz”) Step...	[ -0.0011444091796875, -0.01495361328125, 0.0166015625, 0.017822265625, -0.00799560546875, 0.02197265625, -0.028076171875, 0.0040283203125, 0.01068115234375, 0.01177978515625, 0.0091552734375, 0.000946044921875, 0.018798828125, 0.009521484375, -0.005889892578125, -0.0194091796875, -0.0...	[ 360, 903, 9655, 22936, 144851, 71924, 1830, 64, 107, 77391, 25632, 32354, 18344, 20469, 15, 188, 129384, 4666, 17324, 3584, 31, 1299, 40300, 17336, 83, 19895, 18, 87, 444, 77878, 50478, 82825, 13794, 275, 25737, 5609, 1238, 1022, 25553, 5...	[ 0.0098876953125, 0.024871826171875, 0.0633544921875, 0.081298828125, 0.2109375, 0.2110595703125, 0.06396484375, 0.03826904296875, 0.152587890625, 0.226318359375, 0.095703125, 0.2215576171875, 0.194580078125, 0.245849609375, 0.04010009765625, 0.1368408203125, 0.2293701171875, 0.1975...	embed
24141972_c0	24141972	haskell	0	Title: How to apply higher order function to an effectful function in Haskell? Problem title: How to apply higher order function to an effectful function in Haskell? Tags: monads, haskell Problem: How to apply higher order function to an effectful function in Haskell? I have too functions: higherOrderPure :: (a -> b) -...	How to apply higher order function to an effectful function in Haskell? How to apply higher order function to an effectful function in Haskell? monads haskell How Haskell Monad Double Dia Any Either Left Parse Right How to apply higher order function to an effectful function in Haskell? I have too functions: I'd like t...	[ 0.0098876953125, -0.014892578125, -0.000827789306640625, -0.006011962890625, 0.006927490234375, 0.026611328125, 0.000484466552734375, 0.0052490234375, 0.011474609375, -0.0250244140625, -0.000919342041015625, -0.00994873046875, -0.0213623046875, -0.0322265625, 0.00543212890625, -0.00811...	[ 11249, 47, 59911, 77546, 12989, 32354, 21543, 7844, 23, 20625, 142508, 2667, 712, 7, 1556, 60331, 71, 107172, 4512, 28541, 9319, 636, 2480, 2392, 184, 90911, 765, 5792, 1884, 5117, 17932, 7440, 89536 ]	[ 0.100341796875, 0.1143798828125, 0.1856689453125, 0.177978515625, 0.2093505859375, 0.2310791015625, 0.1820068359375, 0.159423828125, 0.029815673828125, 0.146484375, 0.27783203125, 0.08935546875, 0.13330078125, 0.06097412109375, 0.1378173828125, 0.154541015625, 0.0982666015625, 0.13...	embed
20086030_c1	20086030	haskell	1	can do: runState (pushQueue 2 >> pushQueue 3 >> popQueue >> pushQueue 1 >> popQueue) emptyQueue and get back (Just 3,Queue {inbox = [1], outbox = []}) , which is what I wanted. But I can't do something like: runState (pushQueue 2 >> popQueue >>= pushQueue) emptyQueue which results in an: Occurs check: cannot construct...	can do: runState (pushQueue 2 >> pushQueue 3 >> popQueue >> pushQueue 1 >> popQueue) emptyQueue and get back (Just 3,Queue {inbox = [1], outbox = []}) , which is what I wanted. But I can't do something like: runState (pushQueue 2 >> popQueue >>= pushQueue) emptyQueue which results in an: Occurs check: cannot construct...	[ -0.00897216796875, -0.00592041015625, -0.007110595703125, 0.003997802734375, -0.0012054443359375, 0.01434326171875, -0.0093994140625, -0.01953125, -0.0033111572265625, 0.0021209716796875, 0.0238037109375, 0.0306396484375, 0.003936767578125, -0.005615234375, 0.001556396484375, 0.0026245...	[ 831, 54, 11675, 135206, 13, 7332, 127, 41732, 13388, 116, 25944, 138, 7426, 106, 201505, 2046, 4420, 127794, 73, 11728, 17550, 1810, 36663, 4966, 18, 50339, 180, 48650, 12765, 53418, 64549, 54241, 10644, 10, 2389, 83425, 60075, 22836, 618, ...	[ 0.0899658203125, 0.05120849609375, 0.16748046875, 0.2210693359375, 0.092529296875, 0.1156005859375, 0.05706787109375, 0.1719970703125, 0.1439208984375, 0.09130859375, 0.237548828125, 0.136474609375, 0.177490234375, 0.0205841064453125, 0.2001953125, 0.044586181640625, 0.1492919921875,...	embed
2226833_c0	2226833	haskell	0	Title: Haskell confusion with ContT, callCC, when Problem title: Haskell confusion with ContT, callCC, when Tags: monads, continuations, haskell Problem: Haskell confusion with ContT, callCC, when Continuing quest to make sense of ContT and friends. Please consider the (absurd but illustrative) code below: v :: IO (Eit...	Haskell confusion with ContT, callCC, when Haskell confusion with ContT, callCC, when monads continuations haskell Haskell ContT Either Left Error Right Haskell confusion with ContT, callCC, when Continuing quest to make sense of ContT and friends. Please consider the (absurd but illustrative) code below: This code doe...	[ -0.0035552978515625, 0.004058837890625, -0.0012969970703125, -0.0174560546875, 0.005523681640625, -0.0003681182861328125, 0.010986328125, -0.0155029296875, -0.003692626953125, 0.00115966796875, 0.0025177001953125, -0.001922607421875, 0.005645751953125, 0.009765625, 0.00592041015625, -0...	[ 20625, 142508, 169463, 678, 1657, 18, 618, 11782, 13709, 3229, 2667, 712, 9454, 1556, 2480, 212059, 90911, 100761, 214, 38694, 10422, 136, 23902, 16916, 7, 84093, 58755, 18151, 35064, 3293, 14602, 959, 9969, 1340, 2174, 91995, 6868, 297, 47...	[ 0.1199951171875, 0.229736328125, 0.1854248046875, 0.049896240234375, 0.111328125, 0.0933837890625, 0.1416015625, 0.158447265625, 0.13916015625, 0.156494140625, 0.07904052734375, 0.0963134765625, 0.1527099609375, 0.101806640625, 0.07098388671875, 0.1085205078125, 0.099365234375, 0.1...	embed
24837844_c0	24837844	haskell	0	Title: Modify text being inserted into GTK TextBuffer Problem title: Modify text being inserted into GTK TextBuffer Tags: gtk, haskell, gtk3 Problem: Modify text being inserted into GTK TextBuffer I have a TextView and I want to automatically convert all typed, pasted, etc. text to uppercase, is it possible? I tried ad...	Modify text being inserted into GTK TextBuffer Modify text being inserted into GTK TextBuffer gtk haskell gtk3 Modify GTK TextBuffer TextView Gtk-WARNING Invalid You gtk3 Modify text being inserted into GTK TextBuffer I have a TextView and I want to automatically convert all typed, pasted, etc. text to uppercase, is it...	[ -0.021728515625, 0.004425048828125, 0.026611328125, 0.005767822265625, 0.000820159912109375, -0.00567626953125, -0.007171630859375, -0.00811767578125, -0.0001678466796875, -0.007659912109375, -0.004119873046875, -0.051513671875, 0.007537841796875, -0.016357421875, 0, -0.00921630859375,...	[ 16269, 40383, 7986, 8035, 183540, 297, 3934, 527, 29735, 24129, 7235, 18234, 706, 31472, 1556, 142508, 363, 100474, 60873, 25795, 7013, 2583, 3444, 191082, 96760, 756, 10644, 452, 47, 1407, 56, 58437, 7722, 154107, 373, 33657, 174379, 35863, ...	[ 0.1556396484375, 0.1370849609375, 0.201171875, 0.03900146484375, 0.229736328125, 0.04241943359375, 0.139404296875, 0.0782470703125, 0.244140625, 0.18212890625, 0.1549072265625, 0.1943359375, 0.060333251953125, 0.2037353515625, 0.10186767578125, 0.209228515625, 0.15673828125, 0.2553...	embed
52434603_c0	52434603	haskell	0	Title: Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) Problem title: Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) Tags: functional-programming, ghc, haskell, lazy-evaluation, sieve-of-eratosthenes Problem: Understanding the Limitations of Lazy Evaluation (Sieve of E...	Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) functional-programming ghc haskell lazy-evaluation sieve-of-eratosthenes Understanding Limitations Lazy Evaluation Sieve Eratosthenes Understanding the Limitations of Lazy Ev...	[ -0.006500244140625, 0.03515625, 0.0294189453125, -0.0023193359375, 0.012939453125, 0.0008544921875, -0.0072021484375, -0.0137939453125, 0.0196533203125, -0.0111083984375, 0.023681640625, -0.0054931640625, 0.0228271484375, 0.00250244140625, 0.0167236328125, 0.0120849609375, 0.01831054...	[ 9626, 144057, 125177, 21094, 239, 3285, 151228, 99266, 272, 111, 14825, 1952, 2347, 1444, 123309, 28966, 31380, 238, 1556, 142508, 21, 159258, 78, 3134, 4390, 13164, 232, 727, 20625, 39418, 20809, 101935, 208124, 151552, 14847, 20594, 125296, ...	[ 0.034423828125, 0.017120361328125, 0.192626953125, 0.04742431640625, 0.111328125, 0.201171875, 0.175537109375, 0.150390625, 0.1956787109375, 0.1683349609375, 0.135498046875, 0.1295166015625, 0.16552734375, 0.1326904296875, 0.09185791015625, 0.070068359375, 0.00665283203125, 0.00805...	embed
5320528_c0	5320528	haskell	0	Title: Monadic type confusion Problem title: Monadic type confusion Tags: parsec, types, monads, haskell Problem: Monadic type confusion I am going through Write Yourself a Scheme in Haskell . Its a great tutorial, but I've run into a wall with one of the parsing exercises : parseNumber :: Parser LispVal parseNumber = ...	Monadic type confusion Monadic type confusion parsec types monads haskell Monadic Parser LispVal Number many1 Monadic type confusion I am going through Write Yourself a Scheme in Haskell . Its a great tutorial, but I've run into a wall with one of the parsing exercises : Rewrite parseNumber using: Do-notation explicit ...	[ -0.0238037109375, 0.0177001953125, -0.01141357421875, 0.009765625, -0.006561279296875, 0.027587890625, -0.01220703125, -0.00445556640625, 0.0130615234375, -0.03076171875, -0.004364013671875, -0.0302734375, -0.0072021484375, 0.00023555755615234375, 0.00060272216796875, -0.00073623657226...	[ 60331, 18403, 10644, 169463, 366, 39797, 52895, 2667, 712, 1556, 142508, 2392, 2189, 1261, 7008, 42272, 103332, 5941, 418, 18781, 14804, 39379, 34702, 282, 20625, 6782, 57143, 11675, 3934, 58982, 70, 81979, 853, 434, 184, 18444, 26278, 984, ...	[ 0.195068359375, 0.1632080078125, 0.21923828125, 0.206787109375, 0.11328125, 0.149169921875, 0.2105712890625, 0.1282958984375, 0.1038818359375, 0.0986328125, 0.2322998046875, 0.10711669921875, 0.06866455078125, 0.0601806640625, 0.06744384765625, 0.17578125, 0.1292724609375, 0.130371...	embed
29449754_c1	29449754	haskell	1	.0.0) rejecting: parsec-3.1.9/installed-3e8... (package is broken) trying: parsec-3.1.9 next goal: text (dependency of parsec-3.1.9) rejecting: text-1.2.0.4/installed-3df... (conflict: text => bytestring==0.10.6.0/installed-768..., netcore => bytestring==0.9.*) trying: text-1.2.0.4 next goal: bytestring (dependency of ...	.0.0) rejecting: parsec-3.1.9/installed-3e8... (package is broken) trying: parsec-3.1.9 next goal: text (dependency of parsec-3.1.9) rejecting: text-1.2.0.4/installed-3df... (conflict: text => bytestring==0.10.6.0/installed-768..., netcore => bytestring==0.9.*) trying: text-1.2.0.4 next goal: bytestring (dependency of ...	[ -0.01171875, 0.0052490234375, 0.022216796875, 0.04296875, -0.0106201171875, -0.00604248046875, -0.0108642578125, -0.0162353515625, 0.017333984375, 0.020751953125, 0.0014801025390625, -0.005767822265625, -0.01251220703125, -0.01068115234375, -0.000446319580078125, -0.004608154296875, ...	[ 5, 99929, 456, 75161, 366, 39797, 97109, 92419, 80383, 297, 8316, 13, 1019, 27, 29102, 4588, 83, 148431, 31577, 158304, 11737, 69236, 7986, 105254, 48400, 121254, 71, 420, 2271, 134225, 390, 67, 91693, 102014, 122887, 84453, 2043, 30854, 14...	[ 0.05889892578125, 0.262451171875, 0.096435546875, 0.2193603515625, 0.10626220703125, 0.21240234375, 0.146240234375, 0.1190185546875, 0.1484375, 0.04656982421875, 0.08026123046875, 0.0570068359375, 0.1737060546875, 0.00543212890625, 0.1751708984375, 0.055694580078125, 0.01235961914062...	embed
9592191_c0	9592191	haskell	0	Title: The type signature of a combinator does not match the type signature of its equivalent Lambda function Problem title: The type signature of a combinator does not match the type signature of its equivalent Lambda function Tags: combinators, combinatory-logic, haskell, lambda-calculus, type-signature Problem: The ...	The type signature of a combinator does not match the type signature of its equivalent Lambda function The type signature of a combinator does not match the type signature of its equivalent Lambda function combinators combinatory-logic haskell lambda-calculus type-signature Lambda The type signature of a combinator doe...	[ 0.003692626953125, 0.020751953125, -0.0130615234375, -0.0162353515625, -0.0113525390625, -0.00799560546875, 0.005096435546875, 0.017333984375, -0.0076904296875, 0.012939453125, -0.0025787353515625, -0.0087890625, 0.00014209747314453125, -0.0111083984375, 0.00225830078125, 0.00179290771...	[ 10644, 138256, 22321, 1290, 14602, 959, 14858, 183234, 122930, 85, 32354, 22230, 31667, 137043, 1556, 142508, 6492, 6827, 94739, 137432, 5659, 10750, 1193, 990, 18264, 117176, 159, 294, 341, 69407, 20625, 17686, 41877, 40658, 55516, 113, 33079,...	[ 0.2529296875, 0.253173828125, 0.2347412109375, 0.181396484375, 0.056732177734375, 0.1192626953125, 0.1864013671875, 0.111328125, 0.1480712890625, 0.1048583984375, 0.10986328125, 0.0526123046875, 0.056549072265625, 0.0931396484375, 0.048675537109375, 0.2059326171875, 0.128173828125, ...	embed
59074808_c1	59074808	haskell	1	wanted to write my own custom data types and use my own tokens such as data Token = Zero \| One [Char] \| Two [Char] [Char] token :: Parser Token token = twoParser <\|> oneParser <\|> zeroParser twoParser :: Parser Token twoParser = do two <- tExpression a <- var b <- var return $ two a b tExpression :: Parser Token tExpr...	wanted to write my own custom data types and use my own tokens such as data Token = Zero \| One [Char] \| Two [Char] [Char] token :: Parser Token token = twoParser <\|> oneParser <\|> zeroParser twoParser :: Parser Token twoParser = do two <- tExpression a <- var b <- var return $ two a b tExpression :: Parser Token tExpr...	[ 0.00982666015625, 0.0081787109375, -0.0225830078125, 0.033203125, 0.0045166015625, 0.01361083984375, 0.0086669921875, -0.00171661376953125, 0.00127410888671875, -0.022705078125, 0.0078125, 0.007415771484375, -0.0150146484375, -0.01318359375, -0.009033203125, 0.01300048828125, 0.00903...	[ 36663, 33022, 10002, 114122, 2053, 52895, 4527, 47, 84694, 717, 1098, 83947, 6561, 84068, 32964, 2392, 2189, 6626, 28636, 1632, 45234, 808, 178752, 285, 30646, 3650, 10, 876, 23351, 54, 140443, 5117, 10588, 5941, 351, 56644, 40407, 83, 5267...	[ 0.0543212890625, 0.1419677734375, 0.10382080078125, 0.1876220703125, 0.1524658203125, 0.2166748046875, 0.09576416015625, 0.1365966796875, 0.2103271484375, 0.0994873046875, 0.1982421875, 0.1513671875, 0.0953369140625, 0.1292724609375, 0.119873046875, 0.1077880859375, 0.1109619140625, ...	embed
14034764_c1	14034764	haskell	1	es the list twice pickRandomWithLen :: [a] -> IO a pickRandomWithLen [] = error "List is empty" pickRandomWithLen xs = do gen <- newStdGen (e, _) <- return $ randomR (0, (length xs) - 1) gen return $ xs !! e Here is the code I use for benchmarking these two functions: main :: IO () main = do gen <- newStdGen let size =...	es the list twice pickRandomWithLen :: [a] -> IO a pickRandomWithLen [] = error "List is empty" pickRandomWithLen xs = do gen <- newStdGen (e, _) <- return $ randomR (0, (length xs) - 1) gen return $ xs !! e Here is the code I use for benchmarking these two functions: main :: IO () main = do gen <- newStdGen let size =...	[ -0.0291748046875, 0.00982666015625, 0.01904296875, -0.00958251953125, 0.0146484375, -0.0020904541015625, -0.00445556640625, -0.01275634765625, 0.018310546875, -0.04296875, 0.02978515625, 0.010498046875, 0.017333984375, 0.0005950927734375, 0.00164031982421875, -0.01031494140625, -0.00...	[ 198, 70, 5303, 186351, 39580, 126525, 3815, 194583, 866, 33, 11, 17780, 18499, 154663, 83, 201505, 1022, 7, 54, 9226, 3525, 37455, 71, 105376, 13, 30646, 3650, 96759, 1052, 22085, 23986, 4879, 6506, 28, 18151, 4527, 240057, 214, 6097, 662...	[ 0.108154296875, 0.0107421875, 0.22216796875, 0.22119140625, 0.20556640625, 0.134521484375, 0.1407470703125, 0.180419921875, 0.141845703125, 0.1680908203125, 0.037078857421875, 0.205078125, 0.16162109375, 0.1990966796875, 0.049102783203125, 0.200927734375, 0.134765625, 0.08538818359...	embed
16160012_c0	16160012	haskell	0	Title: Parsec unexpected character after function call Problem title: Parsec unexpected character after function call Tags: haskell, parsec Problem: Parsec unexpected character after function call Here is my code so far: http://hpaste.org/86353 . I'm building w/ GHC on Windows. The code above produces the following out...	Parsec unexpected character after function call Parsec unexpected character after function call haskell parsec Parsec Parsec unexpected character after function call Here is my code so far: http://hpaste.org/86353 . I'm building w/ GHC on Windows. The code above produces the following output on my test file: Here is my...	[ -0.0081787109375, 0.01385498046875, 0.00274658203125, 0.041748046875, -0.0023651123046875, 0.00677490234375, 0.0036163330078125, -0.0135498046875, -0.00396728515625, 0.0024261474609375, 0.0003910064697265625, 0.006439208984375, -0.01324462890625, -0.00433349609375, -0.0036163330078125, ...	[ 2392, 39797, 241957, 62816, 7103, 32354, 11782, 1556, 142508, 366, 18151, 2060, 127, 134665, 127875, 33976, 148, 527, 73265, 3773, 36917, 27489, 140992, 3034, 11435, 11853, 107730, 15400, 70, 32628, 125195, 57357, 1636, 221, 5045, 87388, 36137,...	[ 0.1385498046875, 0.2374267578125, 0.193359375, 0.185546875, 0.1383056640625, 0.1717529296875, 0.192138671875, 0.1185302734375, 0.212646484375, 0.1622314453125, 0.0928955078125, 0.052490234375, 0.006378173828125, 0.1231689453125, 0.0784912109375, 0.052978515625, 0.0013427734375, 0.0...	embed
4124282_c0	4124282	haskell	0	Title: New to Haskell, don't understand why I'm getting an infinite type error Problem title: New to Haskell, don't understand why I'm getting an infinite type error Tags: haskell Problem: New to Haskell, don't understand why I'm getting an infinite type error module Main where rev :: [a] -> [a] rev...	New to Haskell, don't understand why I'm getting an infinite type error New to Haskell, don't understand why I'm getting an infinite type error haskell Haskell Main x:xs Occurs New to Haskell, don't understand why I'm getting an infinite type error I'm working my way through 99 Haskell Problems and ...	[ -0.0123291015625, 0.010986328125, 0.00396728515625, 0.019287109375, -0.0189208984375, 0.0037078857421875, 0.002899169921875, 0.0076904296875, 0.0020599365234375, -0.0194091796875, 0.01904296875, -0.0269775390625, 0.006805419921875, -0.005157470703125, 0.004058837890625, 0.0191650390625...	[ 2356, 47, 20625, 142508, 3768, 28219, 15400, 20949, 54241, 13, 10644, 18499, 1556, 425, 48650, 18, 10078, 15649, 31577, 33022, 32354, 39531, 184, 5303, 107419, 21771, 23, 479, 822, 2967, 9790, 9969, 1340, 18151, 36917, 80934, 3934, 527, 732...	[ 0.06591796875, 0.0384521484375, 0.0947265625, 0.1795654296875, 0.041839599609375, 0.0927734375, 0.07763671875, 0.035736083984375, 0.162109375, 0.053466796875, 0.1998291015625, 0.17578125, 0.05328369140625, 0.037811279296875, 0.0968017578125, 0.00555419921875, 0.1484375, 0.101074218...	embed
33378977_c0	33378977	haskell	0	Title: Infinite Loop Haskell Problem title: Infinite Loop Haskell Tags: haskell, infinite-loop, ghci Problem: Infinite Loop Haskell data Node = Node Char [Node] deriving(Eq) nodeA = Node 'A' [nodeB, nodeC, nodeD] nodeB = Node 'B' [] nodeC = Node 'C' [nodeE, nodeF] nodeD = Node 'D' [] nodeE = Node 'E' [nodeB] nodeF = No...	Infinite Loop Haskell Infinite Loop Haskell haskell infinite-loop ghci Infinite Loop Haskell Node Char Main ABCEBF Infinite Loop Haskell Whenever I call deepTraverse nodeA it loops gets hung up. In ghci it does spit out: Leading me to suspect the "then" part of the if. I have been banging my head against this problem f...	[ 0.00933837890625, -0.0120849609375, 0.0036163330078125, 0.0026397705078125, 0.016845703125, 0.00885009765625, 0.0038299560546875, -0.0169677734375, 0.0218505859375, -0.038330078125, 0.0228271484375, -0.025634765625, 0.0140380859375, 0.0341796875, 0.01361083984375, 0.008544921875, 0.0...	[ 134322, 199694, 20625, 142508, 13, 1556, 54241, 28354, 31380, 318, 438, 112, 21656, 12321, 47457, 24162, 919, 30441, 11782, 53894, 28542, 37676, 110, 284, 442, 40956, 7, 62163, 80756, 1257, 14602, 16195, 18, 1810, 92610, 92733, 2831, 2174, ...	[ 0.150146484375, 0.201904296875, 0.1446533203125, 0.237060546875, 0.0703125, 0.1199951171875, 0.1171875, 0.19921875, 0.09552001953125, 0.1319580078125, 0.130859375, 0.1258544921875, 0.1229248046875, 0.07012939453125, 0.06585693359375, 0.0889892578125, 0.07476806640625, 0.05715942382...	embed
64275943_c0	64275943	haskell	0	Title: How to prevent type scoping in such situation? Problem title: How to prevent type scoping in such situation? Tags: haskell Problem: How to prevent type scoping in such situation? instance IsString Escaped where fromString a = Escaped a instance ConvertibleStrings URI.URI String where convertString = show data Es...	How to prevent type scoping in such situation? How to prevent type scoping in such situation? haskell How IsString Escaped ConvertibleStrings URI.URI Show Escaping esc1 esc2 escape1 escape2 OverloadedStrings sec1 How to prevent type scoping in such situation? Now, with the OverloadedStrings extension enabled, if I use ...	[ 0.0074462890625, -0.005615234375, -0.01287841796875, 0.003631591796875, -0.004669189453125, -0.01373291015625, 0.010498046875, 0.021240234375, -0.000789642333984375, -0.025390625, -0.0002956390380859375, -0.02099609375, -0.00083160400390625, 0.014404296875, 0.005950927734375, -0.018798...	[ 11249, 56282, 10644, 44679, 214, 23, 6044, 16648, 47, 1556, 142508, 2071, 71713, 181540, 71, 1657, 41418, 2661, 5180, 46492, 17367, 156704, 10366, 6964, 418, 304, 144281, 9578, 63033, 297, 19216, 111938, 225081, 4527, 5608, 678, 6936, 39797, ...	[ 0.053802490234375, 0.22119140625, 0.2476806640625, 0.1871337890625, 0.133544921875, 0.036956787109375, 0.058837890625, 0.1112060546875, 0.01055908203125, 0.1214599609375, 0.206298828125, 0.034912109375, 0.1552734375, 0.166748046875, 0.09130859375, 0.010833740234375, 0.11962890625, ...	embed
40007277_c0	40007277	haskell	0	Title: Ambiguous type variable from use of array freeze in ST monad Problem title: Ambiguous type variable from use of array freeze in ST monad Tags: arrays, haskell Problem: Ambiguous type variable from use of array freeze in ST monad Following code creates array, initializes, then returns immutable array. import Data...	Ambiguous type variable from use of array freeze in ST monad Ambiguous type variable from use of array freeze in ST monad arrays haskell use Data.Array Control.Monad.ST Data.Array.ST qualified a Ambiguous Data.Array.IArray STArray IA.IArray Array Ambiguous type variable from use of array freeze in ST monad Following co...	[ 0.004791259765625, -0.004425048828125, -0.015625, -0.00750732421875, 0.00933837890625, -0.0244140625, -0.005462646484375, 0.0235595703125, -0.001251220703125, 0.005279541015625, 0.02490234375, -0.00156402587890625, -0.006927490234375, 0.0091552734375, 0.000644683837890625, 0.0110473632...	[ 10250, 12282, 10821, 10644, 77336, 4527, 10298, 53, 4092, 731, 16992, 2667, 712, 1556, 142508, 11809, 7614, 7092, 27131, 46674, 8545, 217225, 69253, 77168, 18151, 28282, 61475, 30646, 561, 22819, 4773, 42, 4426, 187, 113660, 18499, 6868, 1382...	[ 0.1339111328125, 0.175537109375, 0.0484619140625, 0.2025146484375, 0.2274169921875, 0.05316162109375, 0.1246337890625, 0.06304931640625, 0.1441650390625, 0.168212890625, 0.116455078125, 0.09112548828125, 0.1329345703125, 0.1002197265625, 0.20166015625, 0.033599853515625, 0.0483398437...	embed
65853147_c0	65853147	haskell	0	Title: How to interpret a Traversable type as an Applicative in this function? Problem title: How to interpret a Traversable type as an Applicative in this function? Tags: list, cartesian-product, haskell, traversable Problem: How to interpret a Traversable type as an Applicative in this function? I was experimenting w...	How to interpret a Traversable type as an Applicative in this function? How to interpret a Traversable type as an Applicative in this function? list cartesian-product haskell traversable How Traversable Applicative How to interpret a Traversable type as an Applicative in this function? I was experimenting with haskell ...	[ 0.0137939453125, 0.0162353515625, -0.01141357421875, 0.036376953125, 0.021484375, 0.006561279296875, 0.005584716796875, 0.02880859375, 0.007568359375, -0.0277099609375, 0.003875732421875, 0.00689697265625, 0.0064697265625, 0.040771484375, -0.0181884765625, -0.003662109375, -0.0035095...	[ 11249, 29481, 4937, 7864, 2886, 10644, 237, 5659, 11048, 4935, 23, 903, 32354, 5303, 129912, 3378, 57877, 1556, 142508, 37317, 10, 28007, 61112, 134053, 19713, 3060, 2053, 45646, 2843, 80934, 831, 61924, 40, 944, 3956, 284, 2046, 12996, 116...	[ 0.07275390625, 0.2139892578125, 0.1495361328125, 0.2149658203125, 0.243896484375, 0.232421875, 0.033050537109375, 0.151611328125, 0.2020263671875, 0.1629638671875, 0.0209503173828125, 0.040435791015625, 0.1708984375, 0.1781005859375, 0.1298828125, 0.09478759765625, 0.175048828125, ...	embed
55957712_c1	55957712	haskell	1	init $ drop 7 $ show nsalbum .... 60 artist ++ " - " ++ album I'm having trouble understanding why this is happening. Running a similar command in a test program of mine: main = do artg <- getTags "/home/spilskinanke/backlogtest/02 - await rescue.mp3" artistGetter let test = init $ drop 8 $ show artg print test this w...	init $ drop 7 $ show nsalbum .... 60 artist ++ " - " ++ album I'm having trouble understanding why this is happening. Running a similar command in a test program of mine: main = do artg <- getTags "/home/spilskinanke/backlogtest/02 - await rescue.mp3" artistGetter let test = init $ drop 8 $ show artg print test this w...	[ -0.00102996826171875, 0.01416015625, 0.0106201171875, 0.005767822265625, -0.00970458984375, 0.0145263671875, 0.037109375, -0.023193359375, -0.002960205078125, -0.01055908203125, 0.006103515625, 0.000263214111328125, -0.0089111328125, -0.0027008056640625, -0.00958251953125, 0.0019836425...	[ 23, 217, 3650, 36069, 361, 7639, 1779, 54981, 1496, 22104, 37223, 20, 7156, 19441, 63134, 100094, 15400, 903, 123087, 28398, 21373, 75101, 3034, 1528, 5201, 4927, 177, 66448, 29552, 40277, 1336, 76, 13116, 4867, 6954, 97564, 634, 114777, 26...	[ 0.04693603515625, 0.07666015625, 0.10748291015625, 0.183837890625, 0.1282958984375, 0.1279296875, 0.0687255859375, 0.179443359375, 0.1961669921875, 0.1727294921875, 0.09136962890625, 0.017547607421875, 0.1771240234375, 0.002685546875, 0.058807373046875, 0.0826416015625, 0.08587646484...	embed
56209194_c0	56209194	haskell	0	Title: Non-exhaustive patterns in a function [Haskell] Problem title: Non-exhaustive patterns in a function [Haskell] Tags: haskell Problem: Non-exhaustive patterns in a function [Haskell] I have to make a function neighbours :: [((String, String), Int)] -> String -> [(String, Int)] This is the function I came up with:...	Non-exhaustive patterns in a function [Haskell] Non-exhaustive patterns in a function [Haskell] haskell Non-exhaustive Haskell Non-exhaustive patterns in a function [Haskell] I have to make a function neighbours :: [((String, String), Int)] -> String -> [(String, Int)] This is the function I came up with: The output is...	[ -0.009033203125, 0.0128173828125, -0.002410888671875, -0.004486083984375, 0.01165771484375, 0.0054931640625, -0.01043701171875, -0.0234375, 0.01287841796875, -0.01434326171875, 0.00946044921875, -0.00872802734375, 0.010009765625, 0.0096435546875, -0.00112152099609375, 0.017333984375, ...	[ 3775, 3355, 18391, 4935, 103510, 23, 32354, 6495, 7, 142508, 1556, 20625, 765, 108, 6958, 38648, 1984, 71713, 23351, 360, 18, 33079, 1257, 140992, 134598, 5303, 370, 99726, 79315, 80836, 107730, 164805, 8705, 1022, 418, 892, 1505, 304, 2967...	[ 0.1923828125, 0.03533935546875, 0.14453125, 0.0804443359375, 0.2303466796875, 0.03619384765625, 0.1824951171875, 0.07012939453125, 0.06353759765625, 0.201904296875, 0.110595703125, 0.108642578125, 0.0040283203125, 0.087158203125, 0.1256103515625, 0.197509765625, 0.07305908203125, 0...	embed
26385809_c0	26385809	haskell	0	Title: Catch SomeException with ExceptT Problem title: Catch SomeException with ExceptT Tags: monad-transformers, haskell, exception Problem: Catch SomeException with ExceptT I'm trying to use the ExceptT monad transformer to catch any exception thrown by a function, like so: import Control.Exception import Control.Mon...	Catch SomeException with ExceptT Catch SomeException with ExceptT monad-transformers haskell exception SomeException Control.Exception Control.Monad.Trans.Except Catch ExceptT DivideByZero Left Right Catch SomeException with ExceptT I'm trying to use the ExceptT monad transformer to catch any exception thrown by a func...	[ 0.015869140625, 0.01287841796875, 0.0093994140625, -0.0164794921875, 0.0093994140625, -0.01416015625, 0.0035400390625, -0.019287109375, -0.00616455078125, -0.00390625, 0.00726318359375, -0.006591796875, -0.0030975341796875, 0.010986328125, 0.0233154296875, -0.01104736328125, 0.004150...	[ 18826, 206, 31384, 19279, 63928, 678, 218288, 618, 2667, 712, 215175, 1314, 1556, 142508, 131527, 27131, 46674, 62624, 19462, 76278, 112, 75358, 4036, 2480, 90911, 31577, 4527, 27198, 56, 105556, 2499, 104250, 390, 32354, 1884, 221, 1284, 256...	[ 0.15087890625, 0.0823974609375, 0.1192626953125, 0.092041015625, 0.2120361328125, 0.050506591796875, 0.2198486328125, 0.2193603515625, 0.09967041015625, 0.1463623046875, 0.1728515625, 0.037017822265625, 0.0865478515625, 0.1776123046875, 0.235595703125, 0.1175537109375, 0.04248046875,...	embed
41078686_c2	41078686	haskell	2	.0 monad-par-0.3.4.8 monad-par-extras-0.3.3 mono-traversable-1.0.1 mtl-2.2.1 mwc-random-0.13.5.0 network-2.6.3.1 network-conduit-1.1.0 parallel-3.2.1.0 parallel-io-0.3.3 parseargs-0.2.0.8 primitive-0.6.1.0 random-1.1 resourcet-1.1.8.1 scientific-0.3.4.9 semigroups-0.18.2 split-0.2.3.1 stm-2.4.4.1 streaming-commons-0.1....	.0 monad-par-0.3.4.8 monad-par-extras-0.3.3 mono-traversable-1.0.1 mtl-2.2.1 mwc-random-0.13.5.0 network-2.6.3.1 network-conduit-1.1.0 parallel-3.2.1.0 parallel-io-0.3.3 parseargs-0.2.0.8 primitive-0.6.1.0 random-1.1 resourcet-1.1.8.1 scientific-0.3.4.9 semigroups-0.18.2 split-0.2.3.1 stm-2.4.4.1 streaming-commons-0.1....	[ -0.0181884765625, 0.01422119140625, -0.006317138671875, 0.00872802734375, 0.009033203125, 0.0196533203125, -0.0033721923828125, -0.006072998046875, -0.016845703125, 0.00787353515625, -0.0223388671875, -0.0155029296875, -0.003021240234375, 0.0155029296875, 0.000545501708984375, 0.012878...	[ 6, 5, 2389, 2667, 712, 2500, 170179, 29485, 1019, 112779, 7, 23320, 134693, 22460, 1517, 7864, 2886, 5759, 102014, 18, 141, 5428, 68107, 43879, 238, 46258, 2681, 187461, 33120, 154784, 97109, 2271, 112061, 102107, 95103, 107033, 846, 366, 6...	[ 0.061431884765625, 0.0782470703125, 0.1505126953125, 0.1728515625, 0.1788330078125, 0.1739501953125, 0.1456298828125, 0.130859375, 0.153564453125, 0.1566162109375, 0.129638671875, 0.04351806640625, 0.0965576171875, 0.20751953125, 0.0599365234375, 0.1129150390625, 0.12353515625, 0.0...	embed
53994854_c0	53994854	haskell	0	Title: How to bring a monadic interpreter to the IO monad? Problem title: How to bring a monadic interpreter to the IO monad? Tags: haskell, interpreter Problem: How to bring a monadic interpreter to the IO monad? My question relates to the simple interpreter written in in this answer . I already asked a similar questi...	How to bring a monadic interpreter to the IO monad? How to bring a monadic interpreter to the IO monad? haskell interpreter How Stmt Exp While Seq Print How to bring a monadic interpreter to the IO monad? My question relates to the simple interpreter written in in this answer . I already asked a similar question before...	[ -0.001739501953125, 0.00189971923828125, -0.00885009765625, 0.033935546875, 0.0111083984375, 0.0025787353515625, 0.0118408203125, -0.0034332275390625, -0.005615234375, -0.048828125, -0.0078125, -0.029052734375, -0.00360107421875, 0.00286865234375, 0, 0.00994873046875, -0.0341796875, ...	[ 11249, 47, 19095, 2667, 11, 18403, 29481, 56, 17780, 712, 10, 1556, 142508, 2907, 18, 60075, 51404, 503, 864, 39754, 8781, 351, 17932, 5809, 15190, 130732, 31075, 192046, 6626, 20117, 87039, 154107, 63805, 4527, 3884, 71713, 866, 19, 20625,...	[ 0.0830078125, 0.11279296875, 0.141357421875, 0.1339111328125, 0.09185791015625, 0.1090087890625, 0.2349853515625, 0.1536865234375, 0.203857421875, 0.1982421875, 0.03350830078125, 0.095947265625, 0.2210693359375, 0.01275634765625, 0.02227783203125, 0.144775390625, 0.060089111328125, ...	embed
28142914_c0	28142914	haskell	0	Title: Managing explosion of constraints (Haskell) Problem title: Managing explosion of constraints (Haskell) Tags: typeclass, constraints, haskell Problem: Managing explosion of constraints (Haskell) I am writing a function which I would like to be generic over Vectors. In other words, I have something like: import qu...	Managing explosion of constraints (Haskell) Managing explosion of constraints (Haskell) typeclass constraints haskell qualified Managing Haskell Data.Vector.Generic G.Vector Unboxed Storable Managing explosion of constraints (Haskell) I am writing a function which I would like to be generic over Vectors. In other words...	[ -0.0034637451171875, 0.0252685546875, -0.0228271484375, 0.0203857421875, 0.012451171875, -0.01519775390625, -0.0240478515625, -0.01220703125, -0.003387451171875, -0.0264892578125, -0.0181884765625, -0.026123046875, 0.005706787109375, 0.0108642578125, -0.0269775390625, 0.0068359375, 0...	[ 1572, 66398, 24649, 6889, 111, 158, 2816, 4288, 6495, 7, 142508, 10644, 67413, 1556, 217225, 20625, 11809, 26455, 18770, 135932, 12259, 527, 992, 11728, 23604, 2886, 32562, 32354, 2806, 1884, 186, 189534, 645, 52884, 22230, 38937, 55076, 4527...	[ 0.1097412109375, 0.076904296875, 0.2044677734375, 0.11474609375, 0.06854248046875, 0.1116943359375, 0.20068359375, 0.1663818359375, 0.0914306640625, 0.09222412109375, 0.2374267578125, 0.1282958984375, 0.1748046875, 0.1163330078125, 0.1431884765625, 0.1197509765625, 0.067626953125, ...	embed
31214814_c0	31214814	haskell	0	Title: Haskell reuse patterns Problem title: Haskell reuse patterns Tags: haskell, pattern-matching Problem: Haskell reuse patterns In the code below, the same pattern match (Node n left right) is used by three different functions. If I want to add a pattern, e.g. (Node n (Leaf) (Leaf)) or change my datatype, I have to...	Haskell reuse patterns Haskell reuse patterns haskell pattern-matching Haskell Tree Node Leaf PNode Haskell reuse patterns In the code below, the same pattern match (Node n left right) is used by three different functions. If I want to add a pattern, e.g. (Node n (Leaf) (Leaf)) or change my datatype, I have to change a...	[ -0.0211181640625, 0.02001953125, 0.014892578125, 0.00041961669921875, 0.002044677734375, -0.0106201171875, -0.032470703125, -0.0125732421875, 0.0177001953125, -0.0576171875, -0.0003376007080078125, -0.0126953125, 0.0025177001953125, -0.01251220703125, 0.0034332275390625, -0.00018024444...	[ 20625, 142508, 156883, 103510, 1556, 98753, 101344, 438, 112, 636, 2407, 436, 5021, 18151, 35064, 70, 5701, 14858, 653, 25737, 7108, 11814, 390, 17262, 12921, 32354, 3444, 15190, 5267, 15549, 2053, 50986, 756, 3917, 6097, 4734, 61924, 24145, ...	[ 0.1470947265625, 0.215576171875, 0.265625, 0.244384765625, 0.146240234375, 0.2056884765625, 0.162841796875, 0.11865234375, 0.1163330078125, 0.049530029296875, 0.1580810546875, 0.039215087890625, 0.138427734375, 0.07098388671875, 0.05999755859375, 0.008697509765625, 0.1092529296875, ...	embed
54369864_c0	54369864	haskell	0	Title: Exercise with functor, applicative and monads in Haskell Problem title: Exercise with functor, applicative and monads in Haskell Tags: haskell Problem: Exercise with functor, applicative and monads in Haskell I'm doing exercises from the book "Programming in Haskell (2nd Edition)" and I have some problems in und...	Exercise with functor, applicative and monads in Haskell Exercise with functor, applicative and monads in Haskell haskell Exercise Haskell Expr Val Add Show Exercise with functor, applicative and monads in Haskell I'm doing exercises from the book "Programming in Haskell (2nd Edition)" and I have some problems in under...	[ 0.00555419921875, -0.000774383544921875, 0.008544921875, 0.0230712890625, 0.025146484375, 0.0234375, 0.000881195068359375, -0.01373291015625, 0.006500244140625, -0.00787353515625, 0.0033721923828125, -0.037109375, 0.0035247802734375, 0.01483154296875, 0.00145721435546875, 0.009765625, ...	[ 155534, 184, 678, 7477, 18770, 41816, 4935, 136, 2667, 712, 20625, 142508, 7, 23, 1556, 60075, 42, 4769, 29117, 17367, 81979, 12877, 172895, 44965, 44402, 100094, 25632, 10644, 125195, 70541, 77336, 10, 7639, 3642, 3249, 110527, 28670, 5659, ...	[ 0.205078125, 0.002197265625, 0.1246337890625, 0.1728515625, 0.1949462890625, 0.1871337890625, 0.1412353515625, 0.0295257568359375, 0.1268310546875, 0.1734619140625, 0.1451416015625, 0.2347412109375, 0.049835205078125, 0.0288848876953125, 0.111083984375, 0.075927734375, 0.089599609375...	embed
10641391_c0	10641391	haskell	0	Title: Haskell compiling DLL "undefined reference" Problem title: Haskell compiling DLL "undefined reference" Tags: haskell, linker Problem: Haskell compiling DLL "undefined reference" I was following the guide for making DLL's to be called from other languages here: http://www.haskell.org/ghc/docs/...	Haskell compiling DLL "undefined reference" Haskell compiling DLL "undefined reference" haskell linker Haskell DLL Haskell compiling DLL "undefined reference" I was following the guide for making DLL's to be called from other languages here: http://www.haskell.org/ghc/docs/7.0.4/html/users_guide/win...	[ 0.02294921875, 0.03369140625, 0.00860595703125, -0.00848388671875, -0.007720947265625, -0.00140380859375, -0.00885009765625, 0.004852294921875, -0.011474609375, -0.0067138671875, -0.0220947265625, -0.040283203125, 0.02685546875, 0.0223388671875, 0.01446533203125, -0.0054931640625, 0....	[ 20625, 142508, 9969, 391, 23708, 59437, 5983, 297, 91067, 49725, 1556, 3126, 56, 25632, 17997, 35839, 1295, 3789, 46876, 10557, 9486, 64527, 6460, 71, 42458, 1340, 88996, 4358, 313, 11435, 1884, 9790, 756, 25842, 71358, 18499, 89914, 903, 1...	[ 0.1561279296875, 0.244384765625, 0.110107421875, 0.0623779296875, 0.218994140625, 0.07952880859375, 0.166748046875, 0.06256103515625, 0.2415771484375, 0.0079345703125, 0.12548828125, 0.1903076171875, 0.0966796875, 0.005889892578125, 0.039459228515625, 0.10491943359375, 0.062042236328...	embed
1414497_c0	1414497	haskell	0	Title: Complex iterations in haskell Problem title: Complex iterations in haskell Tags: haskell, math, functional-programming, complex-numbers Problem: Complex iterations in haskell I have this complex iterations program I wrote in TI Basic to perform a basic iteration on a complex number and then give the magnitude of...	Complex iterations in haskell Complex iterations in haskell haskell math functional-programming complex-numbers Complex INPUT SEED ITERATIONS DISP MAGNITUDE PAUSE END RealFloat Integer Finished Complex iterations in haskell I have this complex iterations program I wrote in TI Basic to perform a basic iteration on a com...	[ -0.0032958984375, 0.017333984375, 0.00183868408203125, 0.0033416748046875, 0.01611328125, 0.01092529296875, 0.012939453125, -0.0059814453125, 0.007659912109375, -0.0240478515625, 0.006317138671875, -0.0155029296875, -0.0103759765625, 0.00823974609375, 0, 0.0108642578125, -0.017822265...	[ 113197, 17, 720, 21094, 1556, 142508, 23, 48909, 123309, 28966, 27140, 2606, 1297, 5881, 124599, 159, 138911, 87, 136265, 209973, 157684, 11107, 39015, 5120, 365, 257, 44401, 13316, 164, 765, 903, 1528, 54397, 26906, 91692, 51339, 62822, 1401...	[ 0.256103515625, 0.09307861328125, 0.2432861328125, 0.08154296875, 0.1519775390625, 0.23583984375, 0.007537841796875, 0.08551025390625, 0.125244140625, 0.0948486328125, 0.244384765625, 0.0718994140625, 0.0611572265625, 0.058837890625, 0.03472900390625, 0.044769287109375, 0.16369628906...	embed
16222203_c0	16222203	haskell	0	Title: Migrating Applicative Form to Monadic - get current timestamp Problem title: Migrating Applicative Form to Monadic - get current timestamp Tags: forms, haskell, yesod Problem: Migrating Applicative Form to Monadic - get current timestamp I have a working applicative form, but I want to add a textField that doesn...	Migrating Applicative Form to Monadic - get current timestamp Migrating Applicative Form to Monadic - get current timestamp forms haskell yesod Migrating Applicative Form Monadic Migrating Applicative Form to Monadic - get current timestamp I have a working applicative form, but I want to add a textField that doesn't c...	[ -0.0264892578125, 0.00982666015625, -0.00054168701171875, -0.00848388671875, 0.01068115234375, -0.015380859375, -0.00640869140625, 0.0050048828125, 0.0038909912109375, -0.0869140625, 0.031982421875, -0.008056640625, -0.00799560546875, 0.000751495361328125, -0.0018310546875, -0.02258300...	[ 130446, 1916, 5659, 11048, 4935, 15236, 47, 60331, 18403, 2046, 43581, 1733, 590, 2676, 3173, 1556, 142508, 2422, 23722, 765, 20697, 41816, 3444, 15190, 7986, 6159, 19388, 42518, 2499, 44457, 3299, 171581, 68403, 40494, 1632, 16995, 99577, 70...	[ 0.1644287109375, 0.07763671875, 0.11376953125, 0.1363525390625, 0.17431640625, 0.2401123046875, 0.11083984375, 0.185791015625, 0.1839599609375, 0.10693359375, 0.2210693359375, 0.1571044921875, 0.20458984375, 0.201171875, 0.2393798828125, 0.10986328125, 0.2196044921875, 0.1121826171...	embed
7252493_c0	7252493	haskell	0	Title: library for affine k-algebra computations? Problem title: library for affine k-algebra computations? Tags: polynomial-math, computer-algebra-systems, haskell Problem: library for affine k-algebra computations? I'm looking for a library or computer algebra system that will help compute operations on polynomials i...	library for affine k-algebra computations? library for affine k-algebra computations? polynomial-math computer-algebra-systems haskell F_2 x_1 x_n poly_xn x_2 library for affine k-algebra computations? I'm looking for a library or computer algebra system that will help compute operations on polynomials in the ring wher...	[ 0.01470947265625, 0.0179443359375, -0.0019683837890625, 0.020751953125, -0.0000400543212890625, 0.0033111572265625, 0.0289306640625, 0.0238037109375, -0.0030975341796875, -0.0021514892578125, 0.0238037109375, 0.0081787109375, 0.0203857421875, 0.01373291015625, -0.0177001953125, -0.0170...	[ 35773, 1294, 100, 261, 64552, 472, 9, 289, 429, 2844, 181135, 5256, 35874, 1687, 15403, 125458, 13909, 16751, 1556, 142508, 563, 454, 304, 1022, 115187, 425, 16487, 144, 5426, 4358, 9969, 6743, 41018, 15789, 4720, 62766, 94418, 44457, 420, ...	[ 0.2110595703125, 0.126953125, 0.0809326171875, 0.1256103515625, 0.233642578125, 0.1927490234375, 0.00372314453125, 0.0601806640625, 0.1143798828125, 0.1475830078125, 0.1602783203125, 0.042266845703125, 0.1322021484375, 0.1138916015625, 0.0980224609375, 0.0733642578125, 0.092590332031...	embed
47745674_c0	47745674	haskell	0	Title: Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell Problem title: Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell Tags: tree, haskell Problem: Creating a Binary Tree from a list of a preorder traversal with known Interna...	Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell tree haskell a Creating Binary Tree Internal Haskell Empty Branch Show Char x:xs Creating a Binary Tree from a list of a preorde...	[ 0.0035247802734375, -0.0021209716796875, -0.006134033203125, 0.014404296875, 0.0267333984375, 0.0267333984375, -0.005645751953125, -0.041259765625, 0.0196533203125, -0.015625, 0.019775390625, -0.020751953125, 0.00445556640625, 0.018798828125, 0.00701904296875, 0.00799560546875, 0.031...	[ 56781, 54092, 1294, 101344, 1295, 5303, 479, 80596, 37317, 678, 51529, 106745, 110, 988, 20625, 142508, 289, 53201, 1556, 31678, 21110, 17367, 21656, 1022, 425, 81887, 44188, 36716, 34475, 1914, 756, 70796, 34292, 661, 438, 173591, 765, 3034,...	[ 0.1136474609375, 0.194091796875, 0.134521484375, 0.24560546875, 0.042449951171875, 0.11669921875, 0.1185302734375, 0.207763671875, 0.1173095703125, 0.0574951171875, 0.13671875, 0.139892578125, 0.100830078125, 0.04998779296875, 0.1236572265625, 0.20361328125, 0.018585205078125, 0.19...	embed
47800046_c0	47800046	haskell	0	Title: Augmenting type aliases in elm or haskell Problem title: Augmenting type aliases in elm or haskell Tags: haskell, elm Problem: Augmenting type aliases in elm or haskell Say I have a type in elm (0.18) like this: type alias CatSimple = { color : String , age : Int , name : String , breed : String } My project req...	Augmenting type aliases in elm or haskell Augmenting type aliases in elm or haskell haskell elm Augmenting CatSimple CatComplex Bool Augmenting type aliases in elm or haskell Say I have a type in elm (0.18) like this: My project requires that I also have a type that has all the fields of the previous one, but with a fe...	[ 0.004974365234375, 0.0128173828125, 0.01080322265625, 0.0341796875, 0.003692626953125, -0.006622314453125, -0.01171875, 0.0125732421875, -0.0150146484375, -0.0026397705078125, 0.004730224609375, -0.003936767578125, -0.0079345703125, 0.0194091796875, 0.003265380859375, -0.00595092773437...	[ 23177, 674, 214, 10644, 55109, 90, 88, 39, 707, 1556, 142508, 23, 18826, 8859, 33209, 10770, 44974, 2460, 929, 765, 22085, 5, 56641, 1884, 13452, 144570, 2843, 756, 44457, 96362, 10846, 78301, 3871, 15190, 15700, 37629, 19048, 84079, 9620, ...	[ 0.1558837890625, 0.1651611328125, 0.028839111328125, 0.2197265625, 0.2071533203125, 0.1126708984375, 0.1580810546875, 0.196533203125, 0.06787109375, 0.113037109375, 0.2265625, 0.03411865234375, 0.140869140625, 0.1302490234375, 0.1929931640625, 0.0882568359375, 0.1793212890625, 0.06...	embed
48731094_c1	48731094	haskell	1	BS.ByteString) <> bs)) output :: Consumer BS.ByteString IO () output = toConsumer $ CL.mapM_ BS.putStrLn _ <- forkIO (sourceProcessWithStreams chat input output output >> pure ()) pure req With newer lts it seems like the problem is not with communication via TQueue , as uncommenting the line which prints content from...	BS.ByteString) <> bs)) output :: Consumer BS.ByteString IO () output = toConsumer $ CL.mapM_ BS.putStrLn _ <- forkIO (sourceProcessWithStreams chat input output output >> pure ()) pure req With newer lts it seems like the problem is not with communication via TQueue , as uncommenting the line which prints content from...	[ 0.006317138671875, 0.015869140625, -0.0205078125, 0.00164031982421875, 0.0078125, -0.003753662109375, 0.0040283203125, -0.022216796875, -0.0081787109375, -0.02197265625, -0.011962890625, 0.007293701171875, 0.0216064453125, 0.02490234375, -0.0029144287109375, 0.00469970703125, -0.0020...	[ 84145, 5, 75358, 67, 71713, 214, 876, 7, 16, 140992, 76980, 56, 17780, 2203, 47, 11935, 11832, 3650, 46323, 62346, 594, 7077, 100, 92, 60427, 10752, 26531, 194583, 115061, 3245, 107730, 34166, 456, 864, 3525, 96, 933, 2967, 959, 36398, ...	[ 0.171875, 0.0170745849609375, 0.1016845703125, 0.07012939453125, 0.1817626953125, 0.0849609375, 0.055877685546875, 0.08123779296875, 0.01190185546875, 0.197265625, 0.208251953125, 0.1129150390625, 0.2027587890625, 0.0155792236328125, 0.1373291015625, 0.031097412109375, 0.217651367187...	embed
77233248_c0	77233248	haskell	0	Title: Does GHC reuse recursive function computations? Problem title: Does GHC reuse recursive function computations? Tags: optimization, recursion, haskell Problem: Does GHC reuse recursive function computations? Let's say I have the following function myFunction :: Integer->Integer->Integer->Rational myFunction n m l...	Does GHC reuse recursive function computations? Does GHC reuse recursive function computations? optimization recursion haskell Does GHC Integer Rational l-1 n-1 m-1 Does GHC reuse recursive function computations? Let's say I have the following function The details are not so important, the key point being that in order...	[ -0.015380859375, 0.003997802734375, 0.01806640625, 0.00103759765625, 0.0006103515625, -0.003997802734375, -0.0201416015625, -0.01373291015625, -0.007232666015625, -0.015869140625, 0.0106201171875, 0.002532958984375, 0.012939453125, -0.00909423828125, 0.0123291015625, 0.00848388671875, ...	[ 101790, 527, 73265, 156883, 195625, 5844, 32354, 181135, 5256, 87235, 1830, 1556, 142508, 44401, 2552, 43315, 96, 5759, 653, 347, 25632, 41653, 5526, 22799, 151575, 3559, 5955, 18151, 27117, 86869, 2967, 141, 5046, 39, 12989, 30646, 23937, 58...	[ 0.0821533203125, 0.1357421875, 0.2431640625, 0.254638671875, 0.2237548828125, 0.1435546875, 0.1875, 0.1827392578125, 0.07958984375, 0.1513671875, 0.0255279541015625, 0.09564208984375, 0.20849609375, 0.1588134765625, 0.156494140625, 0.08758544921875, 0.1097412109375, 0.1455078125, ...	embed
37577227_c0	37577227	haskell	0	Title: Simple Haskell program not behaving correct Problem title: Simple Haskell program not behaving correct Tags: haskell Problem: Simple Haskell program not behaving correct I'm new to Haskell and trying to write simple program to find maximal element and it's index from intput. I receive values to compare one by on...	Simple Haskell program not behaving correct Simple Haskell program not behaving correct haskell Simple Haskell input_line INNER CHECK OUTER Simple Haskell program not behaving correct I'm new to Haskell and trying to write simple program to find maximal element and it's index from intput. I receive values to compare on...	[ -0.01165771484375, 0.0034942626953125, 0.006744384765625, 0.0185546875, -0.00469970703125, 0.0220947265625, 0.01068115234375, 0.01446533203125, 0.0128173828125, -0.02880859375, 0.0089111328125, -0.0028076171875, -0.01513671875, -0.003570556640625, 0.012939453125, -0.013427734375, 0.0...	[ 60552, 20625, 142508, 1528, 959, 186, 528, 26785, 1556, 107730, 2256, 5881, 52952, 83556, 20572, 32616, 3525, 33022, 8781, 7413, 111340, 12830, 63262, 23, 18, 7077, 53299, 142424, 69101, 1632, 46540, 289, 104064, 142555, 77336, 18389, 568, 71...	[ 0.2000732421875, 0.15185546875, 0.2205810546875, 0.182373046875, 0.0885009765625, 0.03668212890625, 0.10595703125, 0.179443359375, 0.144775390625, 0.10491943359375, 0.097900390625, 0.1109619140625, 0.164306640625, 0.2110595703125, 0.1566162109375, 0.0960693359375, 0.01287841796875, ...	embed
60960469_c0	60960469	haskell	0	Title: How to properly implement a helper function in Haskell Problem title: How to properly implement a helper function in Haskell Tags: syntax-error, haskell, functional-programming Problem: How to properly implement a helper function in Haskell The 'gridList' function description: Takes two Integer inputs, x and y ,...	How to properly implement a helper function in Haskell How to properly implement a helper function in Haskell syntax-error haskell functional-programming How Haskell Integer x-1 y-1 Variable How to properly implement a helper function in Haskell The 'gridList' function description: Takes two Integer inputs, x and y , a...	[ -0.0035552978515625, 0.0155029296875, -0.004791259765625, -0.008544921875, -0.004119873046875, 0.0174560546875, -0.0142822265625, -0.00162506103515625, -0.00469970703125, -0.000286102294921875, 0.00146484375, -0.0283203125, 0.0089111328125, -0.01171875, 0.0262451171875, 0.0072631835937...	[ 11249, 155965, 29479, 4358, 56, 32354, 20625, 142508, 47, 10, 23, 6002, 86531, 188800, 1556, 123309, 44401, 1022, 5759, 113, 84572, 2886, 120067, 154663, 76811, 2561, 6626, 107730, 136, 30646, 5303, 370, 99726, 33636, 176866, 12638, 38750, 12...	[ 0.038330078125, 0.1746826171875, 0.220947265625, 0.258056640625, 0.2486572265625, 0.2021484375, 0.175537109375, 0.25244140625, 0.08258056640625, 0.005889892578125, 0.017333984375, 0.0224151611328125, 0.123779296875, 0.128173828125, 0.158203125, 0.131591796875, 0.1578369140625, 0.07...	embed
11396178_c0	11396178	haskell	0	Title: Haskell recursive function without stack overflow Problem title: Haskell recursive function without stack overflow Tags: haskell, recursion, stack-overflow, tail-recursion Problem: Haskell recursive function without stack overflow I have a recursive function which index a textile and if I use it for huge textfil...	Haskell recursive function without stack overflow Haskell recursive function without stack overflow haskell recursion stack-overflow tail-recursion Haskell Map M.Map Word TextLocation x:xs lineNumber-1 Haskell recursive function without stack overflow I have a recursive function which index a textile and if I use it fo...	[ -0.0135498046875, -0.003021240234375, -0.00078582763671875, 0.011474609375, -0.01318359375, -0.003082275390625, -0.00836181640625, -0.00811767578125, 0.01141357421875, -0.0185546875, -0.00112152099609375, -0.0096435546875, 0.00848388671875, 0.0159912109375, 0.031494140625, 0.0113525390...	[ 20625, 142508, 195625, 5844, 32354, 15490, 177261, 645, 118664, 1556, 1830, 5465, 46741, 107, 48650, 42719, 276, 5, 166179, 22543, 24129, 15363, 1022, 425, 13315, 26278, 5759, 63262, 67773, 4527, 58696, 7986, 29822, 32628, 17569, 2831, 2633, ...	[ 0.122314453125, 0.225341796875, 0.2188720703125, 0.1585693359375, 0.1536865234375, 0.140380859375, 0.1507568359375, 0.095947265625, 0.2247314453125, 0.1197509765625, 0.021087646484375, 0.1044921875, 0.2169189453125, 0.055999755859375, 0.157470703125, 0.1436767578125, 0.02577209472656...	embed
34302616_c0	34302616	haskell	0	Title: Can you define `Comonads` based on `Monads`? Problem title: Can you define `Comonads` based on `Monads`? Tags: transform, haskell, comonad, monads Problem: Can you define `Comonads` based on `Monads`? Okay, so let's say you have the type newtype Dual f a = Dual {dual :: forall r. f(a -> r)->r} As it turns out, w...	Can you define `Comonads` based on `Monads`? Can you define `Comonads` based on `Monads`? transform haskell comonad monads Can Comonads Monads Dual Comonad MonadPlus Reader Env Writer Traced State Store Can you define `Comonads` based on `Monads`? Okay, so let's say you have the type As it turns out, when f is a Comona...	[ -0.013427734375, -0.005950927734375, 0.0037994384765625, 0.0255126953125, 0.00543212890625, 0.0014801025390625, -0.026123046875, -0.011962890625, -0.00982666015625, -0.013427734375, -0.0096435546875, -0.01336669921875, -0.00109100341796875, 0.0186767578125, -0.008056640625, -0.00218200...	[ 4171, 61924, 10770, 2477, 6468, 35509, 46674, 712, 7, 98, 27198, 1556, 142508, 533, 9169, 2667, 6646, 60331, 114421, 71, 88225, 122636, 334, 2783, 4937, 37534, 22836, 14934, 10644, 3229, 1238, 83, 10, 16498, 81979, 4488, 3789, 3917, 10932, ...	[ 0.03558349609375, 0.2120361328125, 0.1556396484375, 0.197021484375, 0.2135009765625, 0.135498046875, 0.166015625, 0.2169189453125, 0.079345703125, 0.029571533203125, 0.205078125, 0.0936279296875, 0.1947021484375, 0.1595458984375, 0.2266845703125, 0.1143798828125, 0.1876220703125, 0...	embed
15039285_c1	15039285	haskell	1	but there they don't seem to mention how to expose the test and I don't seem to manage to make that run. I'm a bit at a loss now, I can run those quickcheck tests with quickcheck itself but not with cabal and I would like to have this to be able to quickly verify all my tests and code and use it in a Jenkins or so. An...	but there they don't seem to mention how to expose the test and I don't seem to manage to make that run. I'm a bit at a loss now, I can run those quickcheck tests with quickcheck itself but not with cabal and I would like to have this to be able to quickly verify all my tests and code and use it in a Jenkins or so. An...	[ 0.0169677734375, -0.0025177001953125, -0.0113525390625, 0.00537109375, -0.01263427734375, -0.00927734375, -0.00165557861328125, -0.0032806396484375, 0.0220947265625, 0.0291748046875, -0.0218505859375, 0.006317138671875, 0.01123046875, 0.002777099609375, 0.004913330078125, 0.00885009765...	[ 41392, 3642, 47, 172554, 70, 3034, 111240, 3249, 11675, 86669, 831, 8382, 63773, 78292, 109921, 68034, 678, 109524, 1884, 69405, 493, 40383, 756, 18151, 4527, 234339, 6528, 37842, 3004, 63559, 52721, 11435, 21373, 17368, 185688, 143161, 13380, ...	[ 0.07098388671875, 0.0809326171875, 0.015380859375, 0.233154296875, 0.026885986328125, 0.255126953125, 0.0968017578125, 0.03204345703125, 0.10247802734375, 0.06048583984375, 0.03436279296875, 0.00531005859375, 0.1082763671875, 0.2607421875, 0.216064453125, 0.1304931640625, 0.040466308...	embed
22885638_c0	22885638	haskell	0	Title: Type checking and the Haskell hint interpreter library Problem title: Type checking and the Haskell hint interpreter library Tags: haskell, hint, types Problem: Type checking and the Haskell hint interpreter library How can I get this Haskell code to type check? aesonLensInterpreter :: String -> String -> Interp...	Type checking and the Haskell hint interpreter library Type checking and the Haskell hint interpreter library haskell hint types Type Haskell Interpreter Maybe Value Prelude Nothing Data.Map Just Control.Lens Data.Aeson.Lens Data.Aeson OverloadedStrings ToJSON Type checking and the Haskell hint interpreter library How ...	[ -0.017333984375, -0.0216064453125, -0.002471923828125, 0.0133056640625, -0.0233154296875, 0.00457763671875, 0.00927734375, 0.00543212890625, -0.0159912109375, -0.036865234375, -0.006072998046875, 0.01019287109375, 0.00921630859375, -0.011474609375, 0.017578125, -0.00921630859375, 0.0...	[ 60457, 175199, 136, 20625, 142508, 5122, 29481, 35773, 1556, 18, 52895, 5337, 56359, 83425, 190060, 1914, 822, 182747, 11809, 166179, 9563, 27131, 866, 1755, 191, 90, 9578, 63033, 71713, 717, 1375, 58627, 831, 2046, 903, 18151, 47, 10644, 1...	[ 0.2225341796875, 0.18994140625, 0.023651123046875, 0.1221923828125, 0.2037353515625, 0.1314697265625, 0.104736328125, 0.0732421875, 0.0994873046875, 0.020355224609375, 0.1829833984375, 0.07635498046875, 0.1474609375, 0.08001708984375, 0.138671875, 0.012054443359375, 0.07373046875, ...	embed
48045500_c0	48045500	haskell	0	Title: function that accepts a function and a list and returns boolean Problem title: function that accepts a function and a list and returns boolean Tags: function, functional-programming, haskell Problem: function that accepts a function and a list and returns boolean I am very new to Haskell and functional programmi...	function that accepts a function and a list and returns boolean function that accepts a function and a list and returns boolean function functional-programming haskell Foldable Bool function that accepts a function and a list and returns boolean I am very new to Haskell and functional programming. I am trying to implem...	[ 0.006256103515625, -0.007049560546875, 0.0120849609375, 0.01324462890625, -0.008056640625, 0.033447265625, -0.005767822265625, 0.004302978515625, 0.0067138671875, -0.00885009765625, 0.0123291015625, -0.0208740234375, 0.0014190673828125, 0.01312255859375, -0.005035400390625, -0.00244140...	[ 32354, 450, 26946, 7, 136, 5303, 30646, 337, 31, 34677, 123309, 28966, 1556, 142508, 30077, 71, 2886, 2460, 929, 3525, 20625, 56037, 31577, 29479, 66211, 35064, 151313, 29568, 2174, 19713, 1632, 35735, 98320, 120262, 4488, 35874, 178851, 4832...	[ 0.2315673828125, 0.06854248046875, 0.2156982421875, 0.0743408203125, 0.145263671875, 0.20068359375, 0.18505859375, 0.06317138671875, 0.128173828125, 0.2027587890625, 0.1431884765625, 0.09088134765625, 0.09619140625, 0.2103271484375, 0.1368408203125, 0.08441162109375, 0.1248779296875,...	embed
8791768_c0	8791768	haskell	0	Title: Haskell: selecting lists from a list when a condition is true Problem title: Haskell: selecting lists from a list when a condition is true Tags: list, select, haskell Problem: Haskell: selecting lists from a list when a condition is true i'm trying to select some lists from a list when a condition is true, somet...	Haskell: selecting lists from a list when a condition is true Haskell: selecting lists from a list when a condition is true list select haskell a Haskell File Integer Show coment1 coment2 coment3 Haskell: selecting lists from a list when a condition is true i'm trying to select some lists from a list when a condition i...	[ -0.00604248046875, -0.007598876953125, 0.00689697265625, 0.01806640625, -0.020263671875, -0.005859375, 0.008544921875, 0.00921630859375, 0.0101318359375, 0.0250244140625, 0.016845703125, -0.001861572265625, -0.0022125244140625, 0.01202392578125, -0.0142822265625, -0.0019378662109375, ...	[ 20625, 142508, 36849, 5303, 7, 1295, 3229, 35431, 83, 29568, 214, 1556, 42724, 44401, 17367, 552, 674, 363, 31577, 2053, 45646, 11627, 23351, 13267, 6868, 21771, 35773, 756, 102158, 25632, 903, 3871, 32354, 2101, 4283, 62539, 2174, 1902, 16...	[ 0.150634765625, 0.2425537109375, 0.189208984375, 0.2427978515625, 0.0653076171875, 0.0865478515625, 0.09002685546875, 0.2320556640625, 0.0875244140625, 0.201171875, 0.0262603759765625, 0.149658203125, 0.1536865234375, 0.1318359375, 0.166748046875, 0.0643310546875, 0.139892578125, 0...	embed
25080979_c0	25080979	haskell	0	Title: Why is parser combinator "seq" defined with "bind" and "return"? Problem title: Why is parser combinator "seq" defined with "bind" and "return"? Tags: haskell, functional-programming, parsing Problem: Why is parser combinator "seq" defined with "bind" a...	Why is parser combinator "seq" defined with "bind" and "return"? Why is parser combinator "seq" defined with "bind" and "return"? haskell functional-programming parsing Why Parser Why is parser combinator "seq" defined with "bind" and "return"? I am reading th...	[ -0.0218505859375, 0.041748046875, -0.000514984130859375, 0.0400390625, 0.0194091796875, 0.0277099609375, -0.00213623046875, -0.017822265625, -0.00701904296875, -0.03271484375, -0.005279541015625, -0.00836181640625, -0.004669189453125, 0.028076171875, -0.01129150390625, 0.006591796875, ...	[ 44084, 366, 2189, 22321, 1290, 184, 864, 61924, 678, 89817, 136, 65395, 19, 1556, 142508, 123309, 28966, 2392, 83, 71, 22230, 28219, 17368, 40, 35064, 37105, 7, 1314, 8512, 370, 99726, 50339, 163, 46048, 45258, 71864, 2967, 65508, 2667, 1...	[ 0.1424560546875, 0.166259765625, 0.1884765625, 0.2418212890625, 0.1651611328125, 0.15380859375, 0.2298583984375, 0.1839599609375, 0.0777587890625, 0.2156982421875, 0.0938720703125, 0.1947021484375, 0.0985107421875, 0.077392578125, 0.17724609375, 0.0877685546875, 0.0345458984375, 0....	embed
26416821_c0	26416821	haskell	0	Title: Deriving a Generic instance of my type doesn't automatically create other instances as intended Problem title: Deriving a Generic instance of my type doesn't automatically create other instances as intended Tags: haskell, generics Problem: Deriving a Generic instance of my type doesn't automatically cr...	Deriving a Generic instance of my type doesn't automatically create other instances as intended Deriving a Generic instance of my type doesn't automatically create other instances as intended haskell generics Data.Binary GHC.Generics Deriving Generic LANGUAGE DeriveGeneric BinaryTest Option Yes Binary Derivin...	[ 0.017822265625, 0.005126953125, 0.010498046875, 0.00079345703125, 0.011474609375, 0.01708984375, 0.013671875, -0.0164794921875, 0.01434326171875, 0.00994873046875, -0.0205078125, -0.017333984375, 0.0123291015625, 0.01513671875, -0.0196533203125, 0.01141357421875, 0.006256103515625, ...	[ 1310, 14, 6496, 88342, 1771, 110527, 759, 10644, 22027, 3768, 18, 191082, 28282, 3789, 237, 179140, 111, 1556, 142508, 189534, 11809, 571, 73, 6635, 527, 73265, 135932, 12259, 98064, 5844, 54092, 111337, 86769, 1294, 31577, 139392, 114122, 99...	[ 0.140869140625, 0.06927490234375, 0.07421875, 0.2056884765625, 0.1190185546875, 0.222412109375, 0.015533447265625, 0.15869140625, 0.050537109375, 0.0280303955078125, 0.0794677734375, 0.1842041015625, 0.1124267578125, 0.052978515625, 0.0355224609375, 0.1241455078125, 0.03167724609375,...	embed
7501037_c1	7501037	haskell	1	Content MyType where parseContents = do { e@(Elem t _ _) <- elementWith (flip isPrefixOf) ["B","A"] ; case t of _ \| "B" `isPrefixOf` t -> interior e $ fmap B parseContents \| "A" `isPrefixOf` t -> interior e $ return A } toContents v@A = [mkElemC (showConstr 0 (toHType v)) []] toContents v@(B aa) = [mkElemC (showConstr ...	Content MyType where parseContents = do { e@(Elem t _ _) <- elementWith (flip isPrefixOf) ["B","A"] ; case t of _ \| "B" `isPrefixOf` t -> interior e $ fmap B parseContents \| "A" `isPrefixOf` t -> interior e $ return A } toContents v@A = [mkElemC (showConstr 0 (toHType v)) []] toContents v@(B aa) = [mkElemC (showConstr ...	[ -0.0003185272216796875, 0.01458740234375, -0.0147705078125, 0.00225830078125, 0.011962890625, 0.004791259765625, -0.00848388671875, -0.0281982421875, 0.0106201171875, -0.026123046875, 0.01434326171875, -0.0016632080078125, 0.01116943359375, -0.0238037109375, 0.00933837890625, 0.0061340...	[ 70870, 2646, 196707, 7440, 366, 184, 11935, 25352, 7, 54, 28, 981, 7623, 195, 808, 12830, 194583, 21392, 83, 19273, 55923, 132887, 571, 7225, 111, 164, 14566, 3650, 1238, 62346, 335, 284, 30646, 47, 81, 19201, 441, 31374, 9297, 757, 188...	[ 0.298828125, 0.18798828125, 0.32080078125, 0.055389404296875, 0.15869140625, 0.129638671875, 0.1219482421875, 0.2413330078125, 0.06060791015625, 0.0657958984375, 0.098388671875, 0.04254150390625, 0.009918212890625, 0.0989990234375, 0.1077880859375, 0.1397705078125, 0.1612548828125, ...	embed
41727562_c0	41727562	haskell	0	Title: Haskell - no output from within StateT monad Problem title: Haskell - no output from within StateT monad Tags: haskell Problem: Haskell - no output from within StateT monad Trying to familiarize myself with monad transformers, I wrote the following piece of code: data GlobalState = GlobalState { rng :: StdGen } ...	Haskell - no output from within StateT monad Haskell - no output from within StateT monad haskell within Haskell StateT GlobalState StdGen See Haskell - no output from within StateT monad Trying to familiarize myself with monad transformers, I wrote the following piece of code: The idea was to initialize state, use it ...	[ -0.01177978515625, 0.01177978515625, -0.0194091796875, -0.0228271484375, 0.00604248046875, 0.000652313232421875, 0.00750732421875, -0.0150146484375, -0.026123046875, 0.0006256103515625, 0.01385498046875, 0.013671875, -0.019287109375, 0.0269775390625, -0.00186920166015625, -0.005859375,...	[ 20625, 142508, 110, 140992, 1295, 28032, 22836, 618, 2667, 712, 1556, 13453, 135206, 2907, 105376, 6872, 27198, 18151, 6528, 61475, 20650, 11341, 4527, 17780, 22631, 30646, 111719, 44691, 4734, 81779, 398, 33662, 62163, 28412, 3884, 71713, 866,...	[ 0.138916015625, 0.2421875, 0.126953125, 0.226806640625, 0.066650390625, 0.1700439453125, 0.1341552734375, 0.134033203125, 0.0989990234375, 0.13623046875, 0.120361328125, 0.0914306640625, 0.131591796875, 0.100830078125, 0.151123046875, 0.081298828125, 0.1556396484375, 0.032043457031...	embed
43419562_c0	43419562	haskell	0	Title: Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype Problem title: Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype Tags: aeson, haskell Problem: Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtyp...	Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype aeson haskell the Automatically PersonName Text PetName ToJSON FromJSON Automatically deriving toJSON/fromJSON using the instances of the in...	[ 0.003448486328125, -0.0003509521484375, -0.000701904296875, 0.0213623046875, -0.01031494140625, 0.0169677734375, 0.006683349609375, 0.0220947265625, -0.00872802734375, -0.00958251953125, -0.00531005859375, 0.034423828125, -0.0029296875, 0.0111083984375, 0.0074462890625, -0.0185546875, ...	[ 51719, 71407, 16406, 6496, 47, 1375, 58627, 64, 161063, 17368, 110527, 75414, 10644, 3525, 50986, 10, 90, 191, 1556, 142508, 15270, 163612, 24129, 26516, 717, 28090, 18151, 4527, 5915, 21635, 41361, 96, 47754, 71864, 1297, 123055, 97841, 3235...	[ 0.1927490234375, 0.06463623046875, 0.1607666015625, 0.06097412109375, 0.1871337890625, 0.146484375, 0.2120361328125, 0.042755126953125, 0.13232421875, 0.016998291015625, 0.188232421875, 0.149658203125, 0.1776123046875, 0.10589599609375, 0.251708984375, 0.01275634765625, 0.02589416503...	embed
54886646_c0	54886646	haskell	0	Title: what is an ambigous type in the context with the function? Problem title: what is an ambigous type in the context with the function? Tags: haskell Problem: what is an ambigous type in the context with the function? I am reading the following doc about functional dependencies. On the page 5, it describes the ambi...	what is an ambigous type in the context with the function? what is an ambigous type in the context with the function? haskell Collects what is an ambigous type in the context with the function? I am reading the following doc about functional dependencies. On the page 5, it describes the ambiguous type: I have a few que...	[ 0.0224609375, -0.0068359375, 0.00823974609375, 0.0322265625, 0.004486083984375, 0.01007080078125, -0.030029296875, 0.01025390625, -0.00628662109375, 0.0074462890625, 0.01495361328125, -0.0089111328125, -0.00213623046875, 0.0091552734375, 0.0120849609375, 0.005462646484375, -0.0003089...	[ 142, 920, 20828, 223, 10644, 23, 43701, 678, 32354, 1556, 142508, 138521, 2367, 123309, 42548, 12282, 10821, 4865, 83, 66161, 53418, 142027, 61924, 484, 109109, 13579, 79507 ]	[ 0.0704345703125, 0.1732177734375, 0.1607666015625, 0.1624755859375, 0.22705078125, 0.0139923095703125, 0.1773681640625, 0.1044921875, 0.1180419921875, 0.10693359375, 0.194091796875, 0.1278076171875, 0.00018310546875, 0.0875244140625, 0.1160888671875, 0.2158203125, 0.173828125, 0.00...	embed
6088540_c0	6088540	haskell	0	Title: How to automatically translate pure code into code that uses mutable arrays for efficiency? Problem title: How to automatically translate pure code into code that uses mutable arrays for efficiency? Tags: optimization, mutable, haskell, code-generation, arrays Problem: How to automatically translate pure code in...	How to automatically translate pure code into code that uses mutable arrays for efficiency? How to automatically translate pure code into code that uses mutable arrays for efficiency? optimization mutable haskell code-generation arrays How How to automatically translate pure code into code that uses mutable arrays for ...	[ 0.01220703125, 0.005126953125, 0.01287841796875, -0.01055908203125, -0.007568359375, 0.01385498046875, -0.008056640625, -0.00543212890625, 0.00787353515625, -0.027587890625, -0.018798828125, -0.00518798828125, -0.019287109375, -0.00439453125, 0.0023345947265625, 0.006927490234375, 0....	[ 11249, 191082, 3900, 19309, 34166, 18151, 3934, 4527, 842, 22819, 10298, 4778, 100, 227066, 47, 87235, 1556, 142508, 48281, 20625, 60892, 35166, 46876, 3917, 123309, 59121, 9433, 40101, 5303, 561, 15490, 36716, 114419, 139392, 2806, 11675, 1699...	[ 0.058502197265625, 0.23291015625, 0.1826171875, 0.1839599609375, 0.22412109375, 0.2103271484375, 0.1295166015625, 0.05426025390625, 0.1614990234375, 0.1915283203125, 0.1260986328125, 0.1695556640625, 0.0484619140625, 0.1741943359375, 0.020965576171875, 0.093994140625, 0.0823364257812...	embed
11929657_c0	11929657	haskell	0	Title: How can I specify which LLVM binaries GHC should use? Problem title: How can I specify which LLVM binaries GHC should use? Tags: llvm, haskell, ghc, compilation Problem: How can I specify which LLVM binaries GHC should use? I have successfully built PortFusion with the brand new 64-bit GHC 7.6.1 Release Candidat...	How can I specify which LLVM binaries GHC should use? How can I specify which LLVM binaries GHC should use? llvm haskell ghc compilation How LLVM GHC PortFusion mingw64 optlo-O3 Main.hs How can I specify which LLVM binaries GHC should use? I have successfully built PortFusion with the brand new 64-bit GHC 7.6.1 Release...	[ 0.0030059814453125, -0.0147705078125, 0.0054931640625, 0.01611328125, 0.004364013671875, -0.0037994384765625, -0.015625, -0.0113525390625, -0.01055908203125, 0.0040283203125, 0.01287841796875, -0.020751953125, 0.010498046875, 0.000545501708984375, 0.01287841796875, 0.006317138671875, ...	[ 11249, 40140, 18929, 3129, 99954, 47599, 23035, 10484, 527, 73265, 5608, 4527, 831, 87, 3723, 39, 1556, 142508, 31380, 238, 98352, 13791, 80163, 6889, 46996, 434, 13307, 43922, 365, 670, 363, 12321, 5, 127, 65771, 88303, 678, 8796, 7911, ...	[ 0.054931640625, 0.19189453125, 0.1219482421875, 0.050689697265625, 0.114990234375, 0.256103515625, 0.2213134765625, 0.1162109375, 0.0892333984375, 0.2274169921875, 0.066650390625, 0.1304931640625, 0.006103515625, 0.00128173828125, 0.1263427734375, 0.1416015625, 0.08599853515625, 0....	embed
15823805_c0	15823805	haskell	0	Title: Interpreting unsigned integers as signed while widening Problem title: Interpreting unsigned integers as signed while widening Tags: integer, haskell Problem: Interpreting unsigned integers as signed while widening Suppose I've got a lot of values of type Word8 , Word16 , and Word32 lying around. I want to widen...	Interpreting unsigned integers as signed while widening Interpreting unsigned integers as signed while widening integer haskell Interpreting Word8 Word16 Word32 Int64 convert8 Bool Int8 Main Word Interpreting unsigned integers as signed while widening Suppose I've got a lot of values of type Word8 , Word16 , and Word32...	[ -0.0184326171875, -0.00787353515625, 0.01226806640625, 0.005950927734375, -0.0213623046875, 0.01446533203125, -0.00164031982421875, -0.0037384033203125, -0.0093994140625, 0.0255126953125, 0.0020599365234375, -0.03076171875, -0.0277099609375, 0.00714111328125, -0.0037689208984375, -0.00...	[ 5337, 4692, 51, 31304, 892, 26255, 237, 181141, 12960, 38134, 592, 297, 1556, 142508, 22543, 1019, 2485, 6460, 13307, 96760, 2460, 929, 360, 18, 12321, 5915, 142424, 10644, 16500, 10932, 3444, 19, 29481, 4343, 756, 33022, 32354, 5117, 10750...	[ 0.0975341796875, 0.1812744140625, 0.0926513671875, 0.1966552734375, 0.162109375, 0.0897216796875, 0.07977294921875, 0.2255859375, 0.08642578125, 0.1558837890625, 0.0811767578125, 0.0263214111328125, 0.107666015625, 0.2049560546875, 0.18017578125, 0.1923828125, 0.1622314453125, 0.18...	embed
17158510_c1	17158510	haskell	1	"" Loading package SDL-0.6.4 ... <interactive>: Unknown PEi386 section name `.idata$4' (while processing: C:\sdl\SDL-1.2.15\lib\libSDL.dll.a) ghc.exe: panic! (the 'impossible' happened) (GHC version 7.6.3 for i386-unknown-mingw32): loadArchive "C:\\sdl\\SDL-1.2.15\\lib\\libSDL.dll.a": failed Please report this as a GH...	"" Loading package SDL-0.6.4 ... <interactive>: Unknown PEi386 section name `.idata$4' (while processing: C:\sdl\SDL-1.2.15\lib\libSDL.dll.a) ghc.exe: panic! (the 'impossible' happened) (GHC version 7.6.3 for i386-unknown-mingw32): loadArchive "C:\\sdl\\SDL-1.2.15\\lib\\libSDL.dll.a": failed Please report this as a GH...	[ -0.0038909912109375, 0.002716064453125, 0.0228271484375, 0.00531005859375, 0.0012359619140625, -0.0004215240478515625, -0.023681640625, 0.0255126953125, -0.02685546875, -0.0257568359375, -0.0029144287109375, -0.023193359375, -0.005615234375, -0.0042724609375, 0.00579833984375, 0.006195...	[ 44, 58, 228006, 98169, 159, 27502, 9, 122887, 617, 153, 10433, 71232, 992, 69723, 17051, 14, 105742, 40059, 9351, 5, 10135, 4369, 204610, 9433, 313, 20469, 294, 48400, 1837, 5612, 71, 1181, 11, 31380, 238, 46480, 249, 6402, 38, 464, 752...	[ 0.1341552734375, 0.0816650390625, 0.26708984375, 0.219482421875, 0.108642578125, 0.2467041015625, 0.025634765625, 0.2099609375, 0.20458984375, 0.028228759765625, 0.08154296875, 0.113525390625, 0.05780029296875, 0.18212890625, 0.097412109375, 0.06158447265625, 0.240478515625, 0.1394...	embed
53400522_c0	53400522	haskell	0	Title: How to check if the input is a specific type? Problem title: How to check if the input is a specific type? Tags: haskell Problem: How to check if the input is a specific type? data Term = TNull -- null term \| TBool Bool -- boolean data \| TInt Int -- integer data \| TSymbol String -- symbolic data \| TPair Term Ter...	How to check if the input is a specific type? How to check if the input is a specific type? haskell How Term TNull TBool Bool TInt TSymbol TPair TVar LVar Show Ord Substitution Map.Map How to check if the input is a specific type? I want to check if term is a logic variable. If it is not a logic variable or not in Subs...	[ -0.015869140625, 0.0198974609375, 0.0179443359375, 0.01031494140625, 0.002777099609375, -0.01214599609375, -0.0106201171875, -0.010986328125, -0.00125885009765625, -0.0101318359375, 0.015869140625, 0.0037994384765625, -0.0052490234375, 0.0162353515625, -0.0003108978271484375, 0.0077209...	[ 11249, 47, 12765, 2174, 107730, 83, 10, 29458, 10644, 1556, 142508, 2994, 39, 43806, 43386, 2460, 929, 660, 53, 36846, 7341, 1910, 147, 17367, 35379, 8273, 13480, 42719, 166179, 70, 3444, 13579, 62775, 77336, 959, 291, 26783, 30646, 11782, ...	[ 0.064453125, 0.086669921875, 0.2421875, 0.1466064453125, 0.26513671875, 0.10791015625, 0.069091796875, 0.2371826171875, 0.2353515625, 0.1319580078125, 0.232666015625, 0.159912109375, 0.120361328125, 0.1412353515625, 0.141845703125, 0.00372314453125, 0.07379150390625, 0.035339355468...	embed
28436633_c0	28436633	haskell	0	Title: How to get the Wadler/Leijen pretty printer to render braces on separate lines Problem title: How to get the Wadler/Leijen pretty printer to render braces on separate lines Tags: pretty-print, haskell Problem: How to get the Wadler/Leijen pretty printer to render braces on separate lines I'm using the wl-pprint-...	How to get the Wadler/Leijen pretty printer to render braces on separate lines How to get the Wadler/Leijen pretty printer to render braces on separate lines pretty-print haskell How Wadler Leijen TeXComm TeXArg How to get the Wadler/Leijen pretty printer to render braces on separate lines I'm using the wl-pprint-extra...	[ -0.025634765625, -0.007171630859375, -0.0125732421875, -0.031005859375, -0.01251220703125, 0.00445556640625, 0.004180908203125, -0.015869140625, 0.00518798828125, 0.01483154296875, 0.00335693359375, 0.01019287109375, 0.0157470703125, -0.01312255859375, 0.0036163330078125, 0.00433349609...	[ 11249, 2046, 92009, 603, 5267, 14, 1390, 28875, 110264, 47, 89159, 1620, 5170, 98, 84797, 124519, 64, 35662, 1556, 142508, 9335, 1413, 1542, 10770, 39, 65415, 10566, 148, 141, 254, 112779, 98169, 239, 10476, 224588, 1391, 27781, 140992, 126...	[ 0.04217529296875, 0.067626953125, 0.14453125, 0.1805419921875, 0.0217132568359375, 0.0609130859375, 0.1837158203125, 0.185546875, 0.20849609375, 0.034210205078125, 0.1700439453125, 0.195556640625, 0.146484375, 0.0303802490234375, 0.1798095703125, 0.151123046875, 0.0048828125, 0.145...	embed
48619450_c1	48619450	haskell	1	-> \n -> case n of Zero -> f Succ n' -> z n') (\n -> Nothing) applmatch :: Nat -> Nat -> Maybe () applmatch x = appl (match x) The fusion can be verified by inspecting Core with -ddump-simpl . Now we would like to do the same for Tree . data Tree = Leaf \| Node Tree Tree data TreeMap a = TreeMap { tm_leaf :: Maybe a, t...	-> \n -> case n of Zero -> f Succ n' -> z n') (\n -> Nothing) applmatch :: Nat -> Nat -> Maybe () applmatch x = appl (match x) The fusion can be verified by inspecting Core with -ddump-simpl . Now we would like to do the same for Tree . data Tree = Leaf \| Node Tree Tree data TreeMap a = TreeMap { tm_leaf :: Maybe a, t...	[ -0.0142822265625, 0.013671875, 0.001800537109375, -0.0072021484375, 0.01495361328125, 0.007781982421875, -0.0125732421875, -0.004425048828125, 0.03173828125, -0.018310546875, -0.00970458984375, -0.014404296875, 0.0004291534423828125, 0.01123046875, 0.017822265625, -0.0181884765625, 0...	[ 33079, 7225, 653, 111, 83947, 1238, 1832, 10060, 25, 97, 182747, 4027, 141, 98753, 68875, 83425, 1022, 2203, 119485, 493, 47314, 134071, 31365, 54645, 2676, 116120, 1884, 101344, 2053, 636, 2407, 438, 166179, 10, 133, 157, 62731, 31678, 939...	[ 0.00079345703125, 0.106689453125, 0.0711669921875, 0.07037353515625, 0.191162109375, 0.0911865234375, 0.1300048828125, 0.16748046875, 0.0253753662109375, 0.07757568359375, 0.1414794921875, 0.117431640625, 0.0703125, 0.253662109375, 0.1728515625, 0.2183837890625, 0.036865234375, 0.0...	embed
65870923_c0	65870923	haskell	0	Title: Trouble instancing Eq in my Relation data type Problem title: Trouble instancing Eq in my Relation data type Tags: haskell Problem: Trouble instancing Eq in my Relation data type I'm stuck instancing the following: data Rel a = R [(a,a)] deriving (Read, Show) listaPares:: Rel a -> [(a,a)] listaPares (R rel) = re...	Trouble instancing Eq in my Relation data type Trouble instancing Eq in my Relation data type haskell Trouble Relation Rel Read Show Trouble instancing Eq in my Relation data type I'm stuck instancing the following: Rel is a datatype that holds a list of tuples, and the elements inside the tuples can be anything, from ...	[ -0.007232666015625, 0.031494140625, 0.01104736328125, 0.01495361328125, 0.0130615234375, -0.00421142578125, 0.00897216796875, -0.01397705078125, 0.0135498046875, -0.00689697265625, -0.0098876953125, 0.01214599609375, 0.0023193359375, -0.00567626953125, -0.0281982421875, 0.0028228759765...	[ 119671, 2661, 50631, 21896, 241, 864, 23, 759, 116822, 2053, 10644, 1556, 142508, 853, 141, 4764, 17367, 179933, 25632, 50986, 16401, 5303, 370, 99726, 80854, 46132, 831, 23937, 892, 21441, 55300, 5875, 28636, 90, 51776, 30646, 45258, 6183, ...	[ 0.166748046875, 0.0941162109375, 0.2178955078125, 0.117919921875, 0.101806640625, 0.227294921875, 0.038055419921875, 0.05438232421875, 0.2255859375, 0.1195068359375, 0.165283203125, 0.1358642578125, 0.197509765625, 0.16650390625, 0.1649169921875, 0.1114501953125, 0.1041259765625, 0...	embed
32668969_c0	32668969	haskell	0	Title: trace can give 'inversion' of processing in folds Problem title: trace can give 'inversion' of processing in folds Tags: haskell Problem: trace can give 'inversion' of processing in folds When I compile the "modified sum" (« _sum_folds.hs ») file : *--------------------------- [ import Debug....	trace can give 'inversion' of processing in folds trace can give 'inversion' of processing in folds haskell Debug.Trace _sum Compiling Main _sum_folds Integer trace can give 'inversion' of processing in folds When I compile the "modified sum" (« _sum_folds.hs ») file : ... and apply it to '[1..5]', ...	[ 0.004730224609375, 0.00372314453125, 0.0206298828125, 0.035400390625, -0.020751953125, 0.017333984375, -0.00933837890625, 0.005279541015625, -0.0020599365234375, -0.0111083984375, 0.01806640625, -0.0067138671875, -0.005523681640625, 0.0030975341796875, 0.0047607421875, 0.01385498046875...	[ 144851, 831, 8337, 3768, 73, 46354, 111, 9433, 214, 23, 42822, 7, 1556, 142508, 262, 85779, 28542, 329, 11832, 15612, 49725, 12321, 44401, 9969, 1340, 13415, 47314, 10554, 127, 11435, 59911, 758, 80596, 141, 83, 14315, 87388, 37223, 7639, ...	[ 0.280029296875, 0.0780029296875, 0.1002197265625, 0.044158935546875, 0.10662841796875, 0.2249755859375, 0.0171966552734375, 0.126953125, 0.056671142578125, 0.0802001953125, 0.19775390625, 0.03643798828125, 0.098388671875, 0.21044921875, 0.06103515625, 0.1976318359375, 0.177001953125,...	embed
55549883_c0	55549883	haskell	0	Title: Define takeword, dropword and words function in Haskell Problem title: Define takeword, dropword and words function in Haskell Tags: haskell Problem: Define takeword, dropword and words function in Haskell I am trying to Define a takeWord function in Haskell which takes a string and returns its first word. It sh...	Define takeword, dropword and words function in Haskell Define takeword, dropword and words function in Haskell haskell Define Haskell x:xs Main Char Define takeword, dropword and words function in Haskell I am trying to Define a takeWord function in Haskell which takes a string and returns its first word. It should ta...	[ 0.016357421875, 0.007568359375, 0.00133514404296875, 0.0164794921875, -0.01153564453125, -0.007049560546875, 0.01708984375, -0.0028076171875, -0.00244140625, 0.005218505859375, 0.0167236328125, -0.01348876953125, -0.00518798828125, 0.01953125, -0.00836181640625, 0.0152587890625, 0.01...	[ 262, 64552, 5646, 47416, 36069, 136, 34153, 32354, 20625, 142508, 23, 1556, 1022, 12, 425, 12321, 21656, 4, 164805, 51776, 79315, 30646, 5117, 2565, 5608, 12638, 62816, 1733, 86595, 3564, 24189, 32628, 124850, 8108, 21373, 1284, 10588, 54304,...	[ 0.052764892578125, 0.1396484375, 0.1871337890625, 0.2498779296875, 0.20263671875, 0.06890869140625, 0.2379150390625, 0.20263671875, 0.1279296875, 0.2398681640625, 0.0276336669921875, 0.09808349609375, 0.051025390625, 0.05816650390625, 0.07958984375, 0.0687255859375, 0.099853515625, ...	embed
11214167_c0	11214167	haskell	0	Title: How to run Snap haskell webapp in production? Problem title: How to run Snap haskell webapp in production? Tags: haskell, haskell-snap-framework Problem: How to run Snap haskell webapp in production? I've installed Snap/Haskell on my production Ubuntu server (on EC2), and checked-out my project - but how do I ru...	How to run Snap haskell webapp in production? How to run Snap haskell webapp in production? haskell haskell-snap-framework How Snap How to run Snap haskell webapp in production? I've installed Snap/Haskell on my production Ubuntu server (on EC2), and checked-out my project - but how do I run it? I mean, locally, I run ...	[ -0.00372314453125, 0.0174560546875, -0.00130462646484375, 0.00726318359375, -0.033203125, 0.0177001953125, -0.004669189453125, -0.004150390625, 0.00139617919921875, -0.0084228515625, -0.0035858154296875, -0.005767822265625, 0.00007343292236328125, -0.0015869140625, -0.002044677734375, ...	[ 11249, 47, 11675, 121190, 1556, 142508, 1467, 9007, 23, 36049, 7, 10957, 160328, 18244, 20600, 64, 6495, 759, 116890, 10723, 191, 59947, 10461, 12765, 13452, 3642, 54, 442, 4000, 1295, 75101, 13315, 76685, 1380, 678, 10002, 39642, 33342, 59...	[ 0.114990234375, 0.06201171875, 0.17919921875, 0.284912109375, 0.166015625, 0.258544921875, 0.1431884765625, 0.2325439453125, 0.1202392578125, 0.25927734375, 0.106201171875, 0.2169189453125, 0.09783935546875, 0.069091796875, 0.13232421875, 0.03387451171875, 0.120361328125, 0.0015869...	embed
11695373_c0	11695373	haskell	0	Title: Lazy decoding of a list with Data.Binary Problem title: Lazy decoding of a list with Data.Binary Tags: haskell, lazy-evaluation Problem: Lazy decoding of a list with Data.Binary I am lazily encoding lists using this code (taken from this SO question ): import Data.Binary newtype Stream a = Stream { unstream :: [...	Lazy decoding of a list with Data.Binary Lazy decoding of a list with Data.Binary haskell lazy-evaluation Data.Binary Lazy Stream Binary putWord8 x:xs getWord8 Integer Lazy decoding of a list with Data.Binary I am lazily encoding lists using this code (taken from this SO question ): The problem is that the decoding imp...	[ 0.002899169921875, 0.01531982421875, -0.0007171630859375, -0.005950927734375, 0.024169921875, 0.006134033203125, 0.00103759765625, 0.0024261474609375, 0.01385498046875, 0.0038299560546875, -0.0002613067626953125, -0.02685546875, 0.01153564453125, 0.01446533203125, -0.00250244140625, 0....	[ 239, 3285, 8, 587, 6238, 5303, 678, 11809, 571, 73, 6635, 1556, 142508, 21, 159258, 115061, 54092, 1294, 3884, 164805, 1019, 1022, 425, 44401, 708, 538, 22, 18151, 2967, 208124, 959, 33342, 1884, 5608, 11675, 3034, 98323, 127689, 24649, 9...	[ 0.1400146484375, 0.18359375, 0.1435546875, 0.1575927734375, 0.0621337890625, 0.1607666015625, 0.022796630859375, 0.100341796875, 0.027008056640625, 0.11865234375, 0.1243896484375, 0.06976318359375, 0.1617431640625, 0.133544921875, 0.1136474609375, 0.1181640625, 0.1483154296875, 0.0...	embed
18321516_c0	18321516	haskell	0	Title: 8 queens in Haskell, unknown error? Problem title: 8 queens in Haskell, unknown error? Tags: haskell, haskell-platform Problem: 8 queens in Haskell, unknown error? I'm trying to solve the 8 queens problem in Haskell without the use of any advanced functions, only with basic knowledge. I have come this far only b...	8 queens in Haskell, unknown error? 8 queens in Haskell, unknown error? haskell haskell-platform the Haskell y.hs:1:42 Num Bool Possible Compiling Main y.hs Failed 8 queens in Haskell, unknown error? I'm trying to solve the 8 queens problem in Haskell without the use of any advanced functions, only with basic knowledge...	[ 0.004364013671875, 0.01904296875, 0.03369140625, -0.007049560546875, 0.0081787109375, 0.01123046875, -0.00848388671875, -0.0031280517578125, -0.005126953125, -0.0257568359375, -0.0185546875, -0.0093994140625, 0.0031890869140625, -0.00848388671875, -0.0164794921875, -0.004150390625, -...	[ 382, 41, 1755, 23, 20625, 142508, 51, 69723, 19, 18499, 1556, 172121, 113, 127, 7, 19721, 33529, 52782, 2460, 929, 115861, 15612, 49725, 12321, 190355, 297, 31577, 86869, 2967, 15490, 175961, 32354, 678, 62822, 51359, 765, 1380, 903, 2060, ...	[ 0.22998046875, 0.196533203125, 0.1949462890625, 0.049224853515625, 0.164794921875, 0.2486572265625, 0.05517578125, 0.1551513671875, 0.03204345703125, 0.1722412109375, 0.141357421875, 0.142822265625, 0.1136474609375, 0.0960693359375, 0.030670166015625, 0.013397216796875, 0.18994140625...	embed
22882228_c0	22882228	haskell	0	Title: How to store a Haskell data type in an Unboxed Vector in continuous memory Problem title: How to store a Haskell data type in an Unboxed Vector in continuous memory Tags: haskell Problem: How to store a Haskell data type in an Unboxed Vector in continuous memory I would like to store a non-parametric, unpacked d...	How to store a Haskell data type in an Unboxed Vector in continuous memory How to store a Haskell data type in an Unboxed Vector in continuous memory haskell How Haskell Unboxed Vector Point3D UNPACK Vector.Unboxed Unbox How to store a Haskell data type in an Unboxed Vector in continuous memory I would like to store a ...	[ 0.022705078125, 0.024658203125, -0.00982666015625, 0.00640869140625, -0.000225067138671875, 0.021484375, -0.01263427734375, -0.01556396484375, 0.005157470703125, -0.0299072265625, -0.0128173828125, -0.01556396484375, 0.0106201171875, 0.016357421875, -0.0269775390625, 0.0223388671875, ...	[ 11249, 4343, 20625, 142508, 2053, 10644, 23, 992, 11728, 2609, 18770, 62005, 223, 98323, 142, 1556, 297, 41097, 363, 397, 8274, 98701, 605, 14256, 1884, 351, 6276, 186518, 51, 29102, 360, 173, 11809, 26455, 44084, 2806, 12601, 4271, 82365, ...	[ 0.049835205078125, 0.201171875, 0.1474609375, 0.261474609375, 0.142333984375, 0.221435546875, 0.05078125, 0.12353515625, 0.2210693359375, 0.1910400390625, 0.198974609375, 0.1402587890625, 0.055999755859375, 0.1619873046875, 0.013397216796875, 0.121337890625, 0.0799560546875, 0.1486...	embed
54019789_c0	54019789	haskell	0	Title: Where is the Monoid instance on Comparison defined? Problem title: Where is the Monoid instance on Comparison defined? Tags: monoids, haskell Problem: Where is the Monoid instance on Comparison defined? newtype Comparison a is defined in Data.Functor.Contravariant . In the version of this module defined in contr...	Where is the Monoid instance on Comparison defined? Where is the Monoid instance on Comparison defined? monoids haskell Where Monoid Comparison Data.Functor.Contravariant contravariant-1.5 Contravariant Semigroup Where is the Monoid instance on Comparison defined? newtype Comparison a is defined in Data.Functor.Contrav...	[ -0.01336669921875, -0.002410888671875, 0.014404296875, 0.023681640625, 0.0257568359375, 0.019775390625, 0.0067138671875, -0.00946044921875, 0.0224609375, -0.0021514892578125, -0.01446533203125, -0.004058837890625, 0.00982666015625, -0.003173828125, -0.00628662109375, -0.0101318359375, ...	[ 78662, 77879, 532, 110527, 98, 113307, 40514, 61924, 71, 22460, 30185, 1556, 142508, 11809, 97249, 18770, 11935, 1517, 162591, 2304, 42876, 45380, 84420, 51588, 83, 70, 3525, 50986, 10, 11389, 88996, 3647, 527, 73265, 3217, 173245, 19736, 108...	[ 0.098388671875, 0.2283935546875, 0.2392578125, 0.2890625, 0.1270751953125, 0.2239990234375, 0.197265625, 0.2216796875, 0.0958251953125, 0.173583984375, 0.17529296875, 0.1220703125, 0.21826171875, 0.0870361328125, 0.0692138671875, 0.118896484375, 0.0723876953125, 0.11962890625, 0....	embed
27171979_c0	27171979	haskell	0	Title: How can I constraint QuickCheck parameters, e.g. only use non-negative ints? Problem title: How can I constraint QuickCheck parameters, e.g. only use non-negative ints? Tags: quickcheck, haskell Problem: How can I constraint QuickCheck parameters, e.g. only use non-negative ints? I'm new to Haskell. It's very ni...	How can I constraint QuickCheck parameters, e.g. only use non-negative ints? How can I constraint QuickCheck parameters, e.g. only use non-negative ints? quickcheck haskell How QuickCheck e.g prop_Myfunc Bool Failed Exception Prelude How can I constraint QuickCheck parameters, e.g. only use non-negative ints? I'm new t...	[ -0.0274658203125, -0.0037689208984375, 0.00167083740234375, -0.006927490234375, -0.006683349609375, 0.0014190673828125, 0.00885009765625, -0.021240234375, -0.010498046875, -0.007415771484375, -0.00133514404296875, -0.01904296875, -0.004913330078125, 0.0164794921875, 0.0015716552734375, ...	[ 158, 2816, 4288, 89038, 202567, 171859, 4734, 4527, 351, 3331, 4935, 23, 933, 831, 63773, 78292, 1556, 142508, 25793, 31852, 16498, 238, 2460, 929, 190355, 5443, 63928, 1914, 822, 20625, 26267, 43658, 183871, 1884, 30022, 27781, 23742, 18, ...	[ 0.06927490234375, 0.168212890625, 0.11767578125, 0.1573486328125, 0.284423828125, 0.2200927734375, 0.07562255859375, 0.05902099609375, 0.148193359375, 0.158935546875, 0.1392822265625, 0.1143798828125, 0.10498046875, 0.005340576171875, 0.1107177734375, 0.2392578125, 0.0634765625, 0....	embed
46227562_c0	46227562	haskell	0	Title: Understanding the MonadIO Laws Problem title: Understanding the MonadIO Laws Tags: haskell Problem: Understanding the MonadIO Laws From source : module Control.Monad.IO.Class ( MonadIO(..) ) where -- \| Monads in which 'IO' computations may be embedded. -- Any monad built by applying a sequence of monad transform...	Understanding the MonadIO Laws Understanding the MonadIO Laws haskell the Understanding MonadIO Laws Control.Monad.IO.Class Monads Any Instances Monad Lift Understanding the MonadIO Laws From source : What is meant by And in particular, what is meant by (m >>= f) ? Here m is a function on types and f a function on valu...	[ 0.0037078857421875, 0.000911712646484375, 0.0062255859375, 0.02294921875, 0.019775390625, 0.00135040283203125, 0.0003986358642578125, -0.00189971923828125, 0.004486083984375, 0.012939453125, 0.0155029296875, -0.0517578125, 0.00299072265625, 0.0064697265625, 0.01092529296875, -0.0100708...	[ 9626, 144057, 60331, 71, 17780, 36293, 70, 1556, 142508, 27131, 46674, 712, 140803, 6468, 28541, 116071, 166562, 7, 31344, 4865, 83, 131148, 390, 17311, 2367, 39, 6396, 1369, 1238, 16, 11853, 347, 32354, 98, 52895, 10, 142424, 450, 110, 2...	[ 0.09375, 0.063720703125, 0.1781005859375, 0.1219482421875, 0.2666015625, 0.1810302734375, 0.01422119140625, 0.091796875, 0.1954345703125, 0.1407470703125, 0.0173492431640625, 0.043365478515625, 0.127197265625, 0.0635986328125, 0.01177978515625, 0.0682373046875, 0.208740234375, 0.03...	embed
79501314_c0	79501314	haskell	0	Title: Showing Functor result in Haskell Problem title: Showing Functor result in Haskell Tags: typeclass, haskell, functor Problem: Showing Functor result in Haskell I have defined the following Functor with the following type class ... -- Let's suppose we want to create a functor that -- performs the opperation : -- ...	Showing Functor result in Haskell Showing Functor result in Haskell typeclass haskell functor a being Showing Functor Haskell Strength Stat Agility Constitution Show Then Type Inc Num Ambiguous Probable Potentially Ordering Defined GHC.Show characteristicsFunctor.hs:9:24 GHCi Showing Functor result in Haskell I have de...	[ 0.00701904296875, -0.01239013671875, -0.0054931640625, 0.017822265625, 0.0081787109375, -0.0021514892578125, 0.00933837890625, -0.036376953125, -0.00921630859375, 0.0140380859375, -0.0184326171875, -0.02978515625, -0.007476806640625, 0.026611328125, 0.0005950927734375, -0.0194091796875...	[ 17367, 214, 28670, 18770, 16750, 20625, 142508, 23, 10644, 67413, 1556, 7477, 8035, 24714, 449, 23888, 12342, 103133, 163965, 60457, 8942, 52782, 10250, 12282, 1250, 275, 229677, 81206, 5983, 527, 73265, 168660, 62816, 48242, 97249, 127, 1126, ...	[ 0.1689453125, 0.055755615234375, 0.1727294921875, 0.1951904296875, 0.172607421875, 0.1339111328125, 0.229248046875, 0.0146026611328125, 0.1397705078125, 0.162841796875, 0.117919921875, 0.149658203125, 0.0892333984375, 0.060546875, 0.037109375, 0.130126953125, 0.0875244140625, 0.093...	embed
8992040_c0	8992040	haskell	0	Title: Making Custom Instances of PersistBackend Problem title: Making Custom Instances of PersistBackend Tags: haskell, persistent, yesod Problem: Making Custom Instances of PersistBackend I have a monad transformer stack of the form: newtype T m a = T { unT :: StateT State (SqlPersist m) a } deriving (Monad, MonadSta...	Making Custom Instances of PersistBackend Making Custom Instances of PersistBackend haskell persistent yesod Making Custom Instances PersistBackend StateT State SqlPersist Monad MonadState Key MonadIO MonadBaseControl Making Custom Instances of PersistBackend I have a monad transformer stack of the form: And want to us...	[ -0.002288818359375, 0.021484375, 0.01348876953125, -0.01025390625, -0.0111083984375, 0.0052490234375, -0.004608154296875, -0.0205078125, 0.0079345703125, -0.04052734375, 0.00726318359375, 0.003326416015625, 0.005401611328125, 0.005035400390625, -0.0235595703125, 0.004364013671875, 0....	[ 13676, 214, 130664, 360, 116071, 111, 57309, 271, 152470, 3611, 1556, 142508, 70560, 2517, 2422, 23722, 22836, 618, 99247, 15277, 57702, 60331, 71, 135206, 26824, 17780, 63473, 175904, 2667, 712, 27198, 56, 177261, 3173, 3444, 4527, 183540, 1...	[ 0.1024169921875, 0.0230560302734375, 0.223388671875, 0.08203125, 0.2257080078125, 0.036376953125, 0.191162109375, 0.1280517578125, 0.2020263671875, 0.2059326171875, 0.10986328125, 0.2440185546875, 0.2392578125, 0.1026611328125, 0.1375732421875, 0.20751953125, 0.101318359375, 0.1617...	embed
35050730_c0	35050730	haskell	0	Title: I have problems understanding the syntax of this code. Can someone explain it line by line? Problem title: I have problems understanding the syntax of this code. Can someone explain it line by line? Tags: functional-programming, haskell Problem: I have problems understanding the syntax of this code. Can someone ...	I have problems understanding the syntax of this code. Can someone explain it line by line? I have problems understanding the syntax of this code. Can someone explain it line by line? functional-programming haskell Can Integer Bool n-1 I have problems understanding the syntax of this code. Can someone explain it line b...	[ -0.027099609375, 0.0155029296875, 0.01171875, 0.00872802734375, 0.0008087158203125, 0.0133056640625, 0.032958984375, -0.018798828125, 0.01141357421875, -0.0152587890625, -0.004180908203125, -0.0255126953125, -0.00860595703125, -0.0225830078125, -0.01483154296875, 0.00909423828125, -0...	[ 765, 44402, 100094, 6002, 86531, 903, 18151, 4171, 22008, 73342, 442, 13315, 390, 123309, 28966, 1556, 142508, 44401, 2460, 929, 653, 5759, 52080, 56037, 449, 217064, 24702, 30698, 29458, 134598, 7413, 1810, 2174, 83, 10, 20809, 707, 959, 2...	[ 0.010650634765625, 0.0911865234375, 0.1495361328125, 0.12548828125, 0.2410888671875, 0.06195068359375, 0.1881103515625, 0.126220703125, 0.0306396484375, 0.130615234375, 0.019561767578125, 0.16943359375, 0.03302001953125, 0.177734375, 0.0928955078125, 0.1044921875, 0.2222900390625, ...	embed
21144912_c0	21144912	haskell	0	Title: Control.Monad.Writer found in multiple packages haskell Problem title: Control.Monad.Writer found in multiple packages haskell Tags: haskell, cabal, hackage, ghc Problem: Control.Monad.Writer found in multiple packages haskell I tried to import the Control.Monad.Writer module like this: import Control.Monad.Writ...	Control.Monad.Writer found in multiple packages haskell Control.Monad.Writer found in multiple packages haskell haskell cabal hackage ghc Control.Monad.Writer Ambiguous monads-tf-0.1.0.1 mtl-2.1.1 Control.Monad.Writer found in multiple packages haskell I tried to import the Control.Monad.Writer module like this: ghc ve...	[ -0.004119873046875, 0.004730224609375, -0.004425048828125, 0.01177978515625, 0.0074462890625, -0.00457763671875, -0.0010528564453125, -0.0164794921875, -0.01043701171875, -0.01068115234375, 0.00066375732421875, -0.01031494140625, 0.00726318359375, -0.0113525390625, 0.00213623046875, 0....	[ 27131, 46674, 712, 1456, 2783, 56, 14037, 23, 48716, 98169, 1556, 142508, 109524, 85526, 4588, 31380, 238, 10250, 12282, 2667, 7, 420, 102014, 141, 5428, 83783, 37842, 24927, 5, 88996, 1884, 903, 11389, 2861, 120518, 25632, 18499, 21373, 29...	[ 0.225830078125, 0.1214599609375, 0.167236328125, 0.09222412109375, 0.1815185546875, 0.132568359375, 0.0985107421875, 0.0806884765625, 0.17431640625, 0.2254638671875, 0.104736328125, 0.20458984375, 0.254638671875, 0.1708984375, 0.01068115234375, 0.1480712890625, 0.148681640625, 0.09...	embed
73924436_c1	73924436	haskell	1	a = Graph [Node a] deriving Show However, what I am a bit unsure about is whether this representation makes it possible to insert new edges later on. With this definition a graph is just a list of nodes that in turn contains list of nodes they link/edge to. After doing research about how to represent a graph in Haskel...	a = Graph [Node a] deriving Show However, what I am a bit unsure about is whether this representation makes it possible to insert new edges later on. With this definition a graph is just a list of nodes that in turn contains list of nodes they link/edge to. After doing research about how to represent a graph in Haskel...	[ -0.016845703125, 0.03076171875, -0.0004138946533203125, 0.024169921875, -0.0091552734375, 0.00848388671875, -0.0284423828125, -0.01043701171875, 0.0002346038818359375, -0.0113525390625, -0.0152587890625, -0.05908203125, 0.0091552734375, 0.01953125, -0.017578125, 0.0064697265625, 0.02...	[ 10, 2203, 6524, 11727, 5021, 112, 16406, 17367, 51646, 18811, 30482, 7722, 183540, 3525, 121303, 14432, 80934, 41382, 83, 1660, 5303, 110, 988, 70541, 3126, 297, 33636, 23, 20625, 142508, 49041, 25647, 61924, 10644, 164661, 438, 360, 48325, ...	[ 0.115234375, 0.07568359375, 0.2236328125, 0.25146484375, 0.128173828125, 0.109619140625, 0.078125, 0.2257080078125, 0.0450439453125, 0.184326171875, 0.020416259765625, 0.06170654296875, 0.160888671875, 0.0728759765625, 0.209716796875, 0.04052734375, 0.1513671875, 0.294189453125, ...	embed
67080550_c1	67080550	haskell	1	Flush stdout trim <$> getLine exitOnCtrlC :: IO String exitOnCtrlC = do tid <- myThreadId installHandler keyboardSignal (Catch (throwTo tid UserInterrupt)) Nothing solve :: String -> String solve = intercalate " + " . map show . sort . map readNum . splitOn "+" where readNum :: String -> Int readNum = read . trim main ...	Flush stdout trim <$> getLine exitOnCtrlC :: IO String exitOnCtrlC = do tid <- myThreadId installHandler keyboardSignal (Catch (throwTo tid UserInterrupt)) Nothing solve :: String -> String solve = intercalate " + " . map show . sort . map readNum . splitOn "+" where readNum :: String -> Int readNum = read . trim main ...	[ -0.0159912109375, 0.0024261474609375, 0.006622314453125, 0.0225830078125, -0.00982666015625, 0.0224609375, 0.01092529296875, 0.000392913818359375, -0.017822265625, -0.0250244140625, -0.0257568359375, 0.00909423828125, -0.031982421875, 0.00093841552734375, 0.0054931640625, 0.00518798828...	[ 36157, 1495, 6138, 246, 1003, 85247, 4369, 2046, 93232, 82230, 20320, 4448, 141, 441, 17780, 23351, 54, 2936, 759, 39116, 568, 71, 20600, 135679, 603, 149186, 218723, 289, 76775, 15555, 7763, 53400, 44851, 9167, 18, 182747, 86869, 1940, 623...	[ 0.2490234375, 0.16357421875, 0.1688232421875, 0.0682373046875, 0.1676025390625, 0.2203369140625, 0.06573486328125, 0.06463623046875, 0.184814453125, 0.2225341796875, 0.13916015625, 0.1102294921875, 0.009857177734375, 0.09820556640625, 0.1890869140625, 0.1888427734375, 0.0056457519531...	embed
27381133_c0	27381133	haskell	0	Title: List based on right Kan extension Problem title: List based on right Kan extension Tags: category-theory, haskell Problem: List based on right Kan extension In the `` Kan Extensions for Program Optimisation '' by Ralf Hinze there is the definition of List type based on right Kan extension of the forgetful functo...	List based on right Kan extension List based on right Kan extension category-theory haskell List Kan Abstr Monoid Maybe Nothing Just List based on right Kan extension In the `` Kan Extensions for Program Optimisation '' by Ralf Hinze there is the definition of List type based on right Kan extension of the forgetful fun...	[ 0.0189208984375, 0.0033416748046875, 0.0274658203125, 0.01275634765625, 0.01092529296875, 0.0074462890625, -0.0228271484375, 0.00028228759765625, -0.0078125, -0.0020751953125, 0.01275634765625, -0.01531982421875, 0, -0.0031585693359375, 0.004486083984375, -0.001739501953125, 0.022338...	[ 32036, 35509, 7108, 2734, 111938, 98, 95487, 2347, 1556, 142508, 3157, 9297, 77879, 532, 83425, 182747, 9563, 224545, 7663, 43938, 17463, 19895, 731, 80934, 10644, 90820, 7844, 7477, 18770, 22460, 30185, 33233, 68034, 15122, 20625, 208124, 6192...	[ 0.231689453125, 0.126220703125, 0.1624755859375, 0.224853515625, 0.212646484375, 0.012603759765625, 0.16845703125, 0.0516357421875, 0.1063232421875, 0.2509765625, 0.05224609375, 0.09613037109375, 0.15234375, 0.105712890625, 0.2259521484375, 0.1439208984375, 0.00628662109375, 0.1917...	embed
22622816_c0	22622816	haskell	0	Title: Haskell parameter is not right? Problem title: Haskell parameter is not right? Tags: haskell Problem: Haskell parameter is not right? I am new haskell leaner, my code as follows: {-- snippet all --} {- \| Our usual CustomColor type to play with -} data CustomColor = CustomColor {red :: Int, green :: Int, blue :: ...	Haskell parameter is not right? Haskell parameter is not right? haskell Haskell Our CustomColor Show Read FuncRec plus5func plus5 always0 Haskell parameter is not right? I am new haskell leaner, my code as follows: In the line "colorCalc=plus5func purple", why there are just one parameter("purple") after plus5func, act...	[ -0.005859375, -0.01080322265625, -0.00323486328125, 0.0228271484375, 0.00145721435546875, 0.003875732421875, -0.00830078125, -0.003326416015625, 0.00927734375, -0.00982666015625, -0.0079345703125, -0.01275634765625, -0.003753662109375, 0.022216796875, 0.004425048828125, -0.015380859375...	[ 20625, 142508, 171859, 83, 959, 7108, 1556, 22929, 130664, 10625, 1484, 17367, 4764, 28670, 4332, 238, 1001, 758, 16498, 11343, 2389, 65342, 56, 18151, 13315, 46133, 94553, 32108, 7398, 8705, 15400, 621, 1660, 1632, 4717, 7103, 5608, 3871, ...	[ 0.136962890625, 0.2744140625, 0.2471923828125, 0.0584716796875, 0.1298828125, 0.164306640625, 0.11328125, 0.055511474609375, 0.1380615234375, 0.06103515625, 0.1494140625, 0.1177978515625, 0.1319580078125, 0.096923828125, 0.07293701171875, 0.1004638671875, 0.14892578125, 0.176879882...	embed
58443284_c0	58443284	haskell	0	Title: Passing Variables in Function and compare each? Problem title: Passing Variables in Function and compare each? Tags: haskell Problem: Passing Variables in Function and compare each? I'm trying to practice Haskell returns and datatypes. I'm trying to pass the following information into the program: worm = 1:2:3:w...	Passing Variables in Function and compare each? Passing Variables in Function and compare each? haskell string use Passing Variables Could Num Char Arising Passing Variables in Function and compare each? I'm trying to practice Haskell returns and datatypes. I'm trying to pass the following information into the program:...	[ 0.00726318359375, 0.0034027099609375, -0.01275634765625, 0.00014781951904296875, 0.0004711151123046875, -0.0172119140625, 0.005218505859375, -0.003753662109375, 0.006011962890625, 0.036865234375, 0.0147705078125, -0.012451171875, 0.002471923828125, -0.00543212890625, 0.0042724609375, -...	[ 28872, 214, 111477, 13566, 23, 28670, 10763, 136, 69101, 12638, 1556, 142508, 79315, 4527, 191147, 52782, 21656, 1172, 72219, 31577, 41361, 20625, 30646, 2053, 50986, 27875, 4677, 1528, 28282, 32354, 101089, 2046, 14858, 80934, 145581, 5303, 11...	[ 0.1402587890625, 0.096923828125, 0.208984375, 0.1796875, 0.1134033203125, 0.1427001953125, 0.0911865234375, 0.046630859375, 0.207763671875, 0.117431640625, 0.1248779296875, 0.2139892578125, 0.150634765625, 0.0943603515625, 0.1094970703125, 0.1568603515625, 0.188720703125, 0.1177978...	embed
62441129_c0	62441129	haskell	0	Title: Lookup parameter arrays from URL Queries in Yesod Problem title: Lookup parameter arrays from URL Queries in Yesod Tags: haskell, yesod Problem: Lookup parameter arrays from URL Queries in Yesod I am fairly new to Haskell and Yesod so I've been looking through many tutorials and documentation. I found another St...	Lookup parameter arrays from URL Queries in Yesod Lookup parameter arrays from URL Queries in Yesod haskell yesod URL Lookup Queries Yesod localhost:3000 test1 test2 test3 Lookup parameter arrays from URL Queries in Yesod I am fairly new to Haskell and Yesod so I've been looking through many tutorials and documentation...	[ -0.01953125, 0.0169677734375, 0.00103759765625, -0.0048828125, -0.005645751953125, 0.005828857421875, -0.0032196044921875, -0.00518798828125, -0.0004119873046875, -0.031005859375, 0.00194549560546875, -0.034912109375, -0.02001953125, -0.01708984375, -0.0103759765625, -0.020263671875, ...	[ 60818, 2037, 171859, 10298, 4778, 1295, 31862, 5813, 10484, 32635, 2199, 23, 1556, 142508, 2422, 23722, 4000, 40294, 36605, 3034, 418, 304, 363, 3525, 20625, 57143, 209806, 156673, 118664, 366, 25002, 41, 1294, 29806, 959, 20697, 98908, 51734...	[ 0.144775390625, 0.165283203125, 0.2425537109375, 0.154296875, 0.09759521484375, 0.051605224609375, 0.1695556640625, 0.12158203125, 0.08477783203125, 0.159912109375, 0.25927734375, 0.01361083984375, 0.0870361328125, 0.1983642578125, 0.1121826171875, 0.1949462890625, 0.0662841796875, ...	embed

9190638_c0

9190638

haskell

0

Title: How, why and when to use the ".Internal" modules pattern? Problem title: How, why and when to use the ".Internal" modules pattern? Tags: haskell Problem: How, why and when to use the ".Internal" modules pattern? I've seen a couple of package on hackage which contain module names with .Interna...

How, why and when to use the ".Internal" modules pattern? How, why and when to use the ".Internal" modules pattern? haskell How Internal Data.ByteString.Internal How, why and when to use the ".Internal" modules pattern? I've seen a couple of package on hackage which contain module names with .Intern...

[ -0.00860595703125, 0.0103759765625, 0.0103759765625, 0.0213623046875, -0.0135498046875, 0.021728515625, -0.01275634765625, -0.0036163330078125, -0.00439453125, 0.035888671875, 0.01312255859375, -0.01031494140625, 0.004058837890625, 0.029052734375, -0.0003032684326171875, -0.0048828125,...

[ 11249, 15400, 3229, 4527, 5, 44851, 6236, 41502, 88996, 7, 103510, 1556, 142508, 106745, 141, 11809, 75358, 67, 71713, 136, 98169, 85526, 4588, 70541, 123055, 678, 237, 4568, 9351, 82761, 155965, 140773, 28129, 138414, 11814, 23282, 18151, 80...

[ 0.127685546875, 0.142578125, 0.111328125, 0.1202392578125, 0.0404052734375, 0.214111328125, 0.233154296875, 0.0261993408203125, 0.245361328125, 0.06756591796875, 0.25341796875, 0.1314697265625, 0.2220458984375, 0.2059326171875, 0.05889892578125, 0.10040283203125, 0.06854248046875, ...

embed

63909870_c0

63909870

haskell

0

Title: Pattern Matching Time Complexity Haskell Problem title: Pattern Matching Time Complexity Haskell Tags: haskell, pattern-matching Problem: Pattern Matching Time Complexity Haskell I'm trying to understand time complexity of pattern matching. I thought matching types like in foo would take constant time while matc...

Pattern Matching Time Complexity Haskell Pattern Matching Time Complexity Haskell haskell pattern-matching Pattern Matching Time Complexity Haskell Main Foo Bar Baz Cat Constructors Elements x:xs y:x:xs Pattern Matching Time Complexity Haskell I'm trying to understand time complexity of pattern matching. I thought matc...

[ -0.00653076171875, 0.003082275390625, -0.00154876708984375, 0.0003185272216796875, 0.004852294921875, -0.0027618408203125, -0.0133056640625, 0.01031494140625, 0.0091552734375, -0.030517578125, 0.021240234375, -0.021240234375, 0.01251220703125, 0.007232666015625, -0.013427734375, -0.007...

[ 9876, 22766, 67407, 214, 19055, 113197, 20625, 142508, 2481, 1556, 103510, 98753, 12321, 9572, 31, 3253, 36490, 18826, 82084, 18770, 48325, 425, 113, 31577, 28219, 1733, 27140, 14858, 17569, 52895, 1884, 23, 5775, 2806, 5646, 53697, 12960, 19...

[ 0.1519775390625, 0.1241455078125, 0.218505859375, 0.07977294921875, 0.146484375, 0.1995849609375, 0.1158447265625, 0.2076416015625, 0.10205078125, 0.10308837890625, 0.2073974609375, 0.1246337890625, 0.0693359375, 0.138916015625, 0.148193359375, 0.130859375, 0.121337890625, 0.122802...

embed

15054329_c1

15054329

haskell

1

elements being no "location" getName &&& (getChildren) -- get the name and the value for each element ) <+> ( hasName "location" >>> -- work on all nodes within the "location" subcontainer getChildren >>> isElem >>> ( getName &&& (getChildren) ) -- get the name and the value for each element ) getAllAddressesUsages ::...

[ 0.0191650390625, 0.0031890869140625, 0.00830078125, -0.000713348388671875, -0.0062255859375, 0.0166015625, -0.01123046875, -0.01068115234375, 0.00897216796875, -0.004058837890625, 0.00494384765625, 0.01055908203125, -0.0081787109375, 0.005462646484375, 0.004669189453125, -0.01141357421...

[ 80854, 8035, 110, 87632, 2046, 163612, 619, 1230, 15, 3794, 441, 102656, 982, 4210, 9351, 136, 34292, 100, 12638, 12830, 1328, 1556, 4488, 98, 756, 988, 28032, 1614, 98102, 20037, 58142, 83, 7623, 195, 1388, 43512, 161007, 1062, 7, 42724,...

[ 0.224365234375, 0.1541748046875, 0.1805419921875, 0.2347412109375, 0.168212890625, 0.2509765625, 0.0997314453125, 0.169189453125, 0.0059814453125, 0.152587890625, 0.05096435546875, 0.1619873046875, 0.1785888671875, 0.09320068359375, 0.170166015625, 0.1116943359375, 0.1805419921875, ...

embed

38552441_c0

38552441

haskell

0

Title: PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" Problem title: PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" Tags: postgresql-simple, postgresql, haskell Problem: PostgreSQL-simple `execute` on a f...

PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" PostgreSQL-simple `execute` on a function fails with "execute resulted in Col 1-column result" postgresql-simple postgresql haskell SomeException QueryError PostgreSQL-simple Col RETURNS id1 id2 Exception ...

[ 0.0087890625, -0.01141357421875, -0.00897216796875, 0.0233154296875, 0.009033203125, -0.00628662109375, -0.001190185546875, -0.0291748046875, 0.0023345947265625, -0.005645751953125, 0.01495361328125, -0.01092529296875, -0.021728515625, -0.01361083984375, 0.0028533935546875, -0.01110839...

[ 2795, 7134, 158897, 191560, 46480, 85691, 98, 32354, 35782, 678, 16750, 11554, 4317, 8447, 316, 1305, 17562, 99247, 1556, 142508, 31384, 63928, 58836, 9069, 56943, 3447, 418, 304, 23, 3444, 71924, 1295, 20625, 114419, 138, 15555, 1284, 159978...

[ 0.0985107421875, 0.1646728515625, 0.175537109375, 0.214111328125, 0.1318359375, 0.159912109375, 0.1080322265625, 0.17431640625, 0.1488037109375, 0.032684326171875, 0.136962890625, 0.13818359375, 0.047271728515625, 0.07958984375, 0.08245849609375, 0.060302734375, 0.215576171875, 0.1...

embed

28579534_c0

28579534

haskell

0

Title: How do you filter a list of strings by a string in haskell? Problem title: How do you filter a list of strings by a string in haskell? Tags: filtering, haskell, string Problem: How do you filter a list of strings by a string in haskell? I have a string containing letters I want to be sure are in the words in the...

How do you filter a list of strings by a string in haskell? How do you filter a list of strings by a string in haskell? filtering haskell string Data.List How How do you filter a list of strings by a string in haskell? I have a string containing letters I want to be sure are in the words in the list. Running it however...

[ -0.00982666015625, 0.007171630859375, -0.027587890625, 0.00086212158203125, 0.004669189453125, 0.0081787109375, 0.023193359375, -0.0125732421875, -0.003662109375, -0.00167083740234375, -0.014404296875, 0.00531005859375, -0.007568359375, 0.00128936767578125, -0.0283203125, 0.01489257812...

[ 11249, 46312, 5303, 79315, 7, 390, 23, 1556, 142508, 214, 11809, 154663, 10, 70541, 120820, 3444, 9077, 34153, 28398, 7464, 137802, 50155, 165, 7373, 2822, 32354, 15549, 4488, 34735, 16065, 959, 202, 15123, 1810, 14817, 10840, 2565, 46799, ...

[ 0.049713134765625, 0.259765625, 0.1748046875, 0.2196044921875, 0.0161285400390625, 0.1136474609375, 0.04266357421875, 0.145263671875, 0.241943359375, 0.0146636962890625, 0.0706787109375, 0.0928955078125, 0.00244140625, 0.0838623046875, 0.13232421875, 0.005584716796875, 0.104370117187...

embed

66008338_c0

66008338

haskell

0

Title: Filter bigger element of two lists Problem title: Filter bigger element of two lists Tags: haskell, list, filter Problem: Filter bigger element of two lists I am trying to write a Haskell programm which outputs a list of primes, but only those where the square is bigger than the product of the previous and follo...

Filter bigger element of two lists Filter bigger element of two lists haskell list filter Filter Filter bigger element of two lists I am trying to write a Haskell programm which outputs a list of primes, but only those where the square is bigger than the product of the previous and following prime. For example, given M...

[ 0.005035400390625, 0.0279541015625, -0.00714111328125, -0.00433349609375, -0.0028533935546875, -0.00518798828125, -0.000035762786865234375, -0.0106201171875, 0.0272216796875, 0.027587890625, 0.004669189453125, -0.002288818359375, -0.020751953125, -0.0186767578125, -0.0152587890625, 0.0...

[ 128896, 167785, 12830, 111, 6626, 5303, 1556, 142508, 46312, 31577, 33022, 20625, 28966, 140992, 20809, 7, 4734, 8382, 7440, 108047, 3501, 12996, 96362, 25632, 1774, 28282, 6958, 38648, 38742, 80854, 2060, 171581, 43240, 4127, 145111, 90, 32354...

[ 0.2191162109375, 0.236083984375, 0.2242431640625, 0.039031982421875, 0.179443359375, 0.2227783203125, 0.124267578125, 0.19921875, 0.2078857421875, 0.058990478515625, 0.0738525390625, 0.09698486328125, 0.107421875, 0.116455078125, 0.1650390625, 0.02996826171875, 0.032958984375, 0.01...

embed

68537997_c0

68537997

haskell

0

Title: Why does the type of local variables that are values affect the type of input variables in the type signature of a function? Problem title: Why does the type of local variables that are values affect the type of input variables in the type signature of a function? Tags: haskell Problem: Why does the type of loca...

Why does the type of local variables that are values affect the type of input variables in the type signature of a function? Why does the type of local variables that are values affect the type of input variables in the type signature of a function? haskell Why Prelude Num Enum Show Bool Why does the type of local vari...

[ 0.0035858154296875, 0.0020599365234375, -0.0018157958984375, 0.0152587890625, 0.00323486328125, -0.004974365234375, -0.0228271484375, -0.010498046875, -0.0107421875, -0.004608154296875, -0.01068115234375, -0.006866455078125, 0.004364013671875, 0.0145263671875, 0.007171630859375, -0.010...

[ 44084, 10644, 4000, 77336, 142424, 52490, 107730, 138256, 32354, 7, 1556, 142508, 1914, 822, 112, 52782, 357, 316, 17367, 2460, 929, 621, 2806, 41206, 1238, 110527, 864, 10, 756, 18507, 158, 2816, 4288, 190659, 91, 2843, 31635, 853, 133266,...

[ 0.111328125, 0.178955078125, 0.139404296875, 0.2244873046875, 0.1971435546875, 0.1484375, 0.1827392578125, 0.1842041015625, 0.13623046875, 0.0145721435546875, 0.10711669921875, 0.2030029296875, 0.06378173828125, 0.142822265625, 0.042266845703125, 0.1268310546875, 0.041839599609375, ...

embed

57514838_c0

57514838

haskell

0

Title: Why is a universally quantified variable not in scope in this Haskell function? Problem title: Why is a universally quantified variable not in scope in this Haskell function? Tags: haskell Problem: Why is a universally quantified variable not in scope in this Haskell function? I'm sure I've been able to do somet...

Why is a universally quantified variable not in scope in this Haskell function? Why is a universally quantified variable not in scope in this Haskell function? haskell Data.Typeable RIO Why Haskell LANGUAGE TypeApplications FDS.Database IsCowRec CowMark FdsEnv type2tblName Proxy Not Why is a universally quantified vari...

[ 0.01385498046875, 0.005767822265625, -0.020263671875, 0.0037384033203125, -0.006805419921875, -0.01177978515625, -0.01190185546875, 0.026611328125, -0.008544921875, -0.01373291015625, 0.006317138671875, -0.0283203125, 0.00311279296875, -0.016357421875, 0.00299072265625, 0.0133056640625...

[ 44084, 83, 32813, 538, 55230, 47314, 77336, 959, 23, 70820, 903, 20625, 142508, 32354, 1556, 11809, 196707, 2886, 92823, 98064, 60457, 47677, 182867, 563, 13526, 137989, 37382, 2071, 8770, 4332, 238, 1311, 434, 73484, 6468, 7768, 334, 10644, ...

[ 0.11572265625, 0.0347900390625, 0.163818359375, 0.0911865234375, 0.16748046875, 0.166259765625, 0.2587890625, 0.1788330078125, 0.117431640625, 0.227294921875, 0.0540771484375, 0.1312255859375, 0.2568359375, 0.165283203125, 0.1024169921875, 0.0384521484375, 0.1417236328125, 0.125244...

embed

61453455_c0

61453455

haskell

0

Title: Finding the bit length of an Integer in haskell Problem title: Finding the bit length of an Integer in haskell Tags: haskell Problem: Finding the bit length of an Integer in haskell I want to find the bit-length (i.e., the index of the highest set bit) of an Integral type in Haskell - like the corresponding meth...

Finding the bit length of an Integer in haskell Finding the bit length of an Integer in haskell haskell Finding Integer Integral Bits Finding the bit length of an Integer in haskell I want to find the bit-length (i.e., the index of the highest set bit) of an Integral type in Haskell - like the corresponding methods in ...

[ -0.0299072265625, 0.020263671875, -0.01019287109375, 0.00860595703125, 0.002410888671875, 0.0198974609375, -0.0059814453125, -0.005218505859375, 0.0029449462890625, -0.024658203125, -0.00133514404296875, -0.0034637451171875, 0.00112152099609375, 0.0341796875, 0.0260009765625, -0.008911...

[ 26040, 214, 70, 4785, 140909, 111, 44401, 23, 1556, 142508, 204681, 27774, 3444, 7413, 23986, 927, 63262, 167375, 5423, 10644, 20625, 1884, 42518, 150624, 41925, 707, 145581, 2965, 10, 2394, 6635, 33938, 17368, 7108, 122925, 221, 4966, 12319,...

[ 0.1231689453125, 0.0194549560546875, 0.0037841796875, 0.2215576171875, 0.2271728515625, 0.046356201171875, 0.271484375, 0.07562255859375, 0.1636962890625, 0.25390625, 0.2449951171875, 0.189453125, 0.0897216796875, 0.140625, 0.1737060546875, 0.1075439453125, 0.1568603515625, 0.18359...

embed

25963297_c0

25963297

haskell

0

Title: Haskell - how to wire together components that have different subsets of dependencies? Problem title: Haskell - how to wire together components that have different subsets of dependencies? Tags: haskell, dependency-injection Problem: Haskell - how to wire together components that have different subsets of depend...

Haskell - how to wire together components that have different subsets of dependencies? Haskell - how to wire together components that have different subsets of dependencies? haskell dependency-injection Haskell MonadIO Haskell - how to wire together components that have different subsets of dependencies? How can I inte...

[ -0.0086669921875, -0.0057373046875, -0.01104736328125, 0.0032501220703125, -0.00927734375, 0.024658203125, -0.007720947265625, -0.00616455078125, 0.007080078125, 0.014892578125, 0.00177001953125, -0.0213623046875, 0.000530242919921875, 0.035400390625, -0.006011962890625, -0.02124023437...

[ 20625, 142508, 3642, 1439, 13, 25842, 82761, 765, 12921, 1614, 3509, 42548, 117538, 47, 1556, 27771, 73, 236, 60331, 71, 17780, 450, 11249, 831, 87, 78779, 38415, 1295, 64209, 67842, 150449, 123309, 8781, 180346, 155255, 3444, 172554, 4734, ...

[ 0.1617431640625, 0.279296875, 0.0810546875, 0.114501953125, 0.0948486328125, 0.191650390625, 0.2230224609375, 0.022552490234375, 0.1422119140625, 0.13916015625, 0.1400146484375, 0.218994140625, 0.1226806640625, 0.012298583984375, 0.1322021484375, 0.13134765625, 0.05767822265625, 0....

embed

53724107_c0

53724107

haskell

0

Title: Map function at Haskell Problem title: Map function at Haskell Tags: haskell Problem: Map function at Haskell The question : Define the function setElements, which takes a list indxs of pairs of (n, x) (where n is an Int), and a list xs, and for each pair (n, x) it sets the n’th element in xs to be x. If a pair ...

Map function at Haskell Map function at Haskell haskell Map Haskell x:tail x:xs Map function at Haskell The question : Define the function setElements, which takes a list indxs of pairs of (n, x) (where n is an Int), and a list xs, and for each pair (n, x) it sets the n’th element in xs to be x. If a pair contains in i...

[ -0.00170135498046875, 0.004486083984375, 0.02392578125, 0.00139617919921875, -0.0189208984375, 0.01434326171875, -0.00640869140625, -0.005828857421875, 0.028564453125, 0.007080078125, 0.0159912109375, -0.002532958984375, 0.0106201171875, 0.007720947265625, 0.00628662109375, -0.00668334...

[ 42719, 32354, 99, 20625, 142508, 1556, 1022, 46741, 12, 425, 9655, 262, 64552, 5423, 647, 19929, 7, 51776, 5303, 2752, 80836, 19, 653, 360, 18, 12638, 927, 12830, 47, 186, 70541, 5117, 82761, 40907, 63262, 150679, 140909, 124962, 1286, 16...

[ 0.2783203125, 0.22412109375, 0.095947265625, 0.1630859375, 0.271240234375, 0.1304931640625, 0.091064453125, 0.2021484375, 0.01959228515625, 0.1241455078125, 0.05523681640625, 0.010711669921875, 0.1339111328125, 0.24853515625, 0.142578125, 0.2724609375, 0.1351318359375, 0.1149902343...

embed

21696933_c0

21696933

haskell

0

Title: How to pass type which got FromJSON implemented as argument to anoter function? Problem title: How to pass type which got FromJSON implemented as argument to anoter function? Tags: interface, haskell Problem: How to pass type which got FromJSON implemented as argument to anoter function? Here is my try: decode :...

How to pass type which got FromJSON implemented as argument to anoter function? How to pass type which got FromJSON implemented as argument to anoter function? interface haskell How FromJSON BS.ByteString BS.readFile Maybe Data.Yaml.decode Couldn Yaml.decode Yaml.hs:46:11 Expected Actual How to pass type which got From...

[ 0.02001953125, 0.001434326171875, -0.004486083984375, 0.00860595703125, 0.0036163330078125, 0.01043701171875, -0.00933837890625, -0.00147247314453125, -0.0220947265625, -0.0191650390625, -0.004119873046875, -0.017822265625, -0.0145263671875, -0.0181884765625, 0.001953125, -0.0103759765...

[ 11249, 47, 27875, 10644, 3129, 4163, 28090, 1375, 58627, 29479, 237, 10750, 2373, 720, 32354, 101758, 1556, 142508, 84145, 75358, 67, 71713, 39116, 174350, 83425, 11809, 21566, 7237, 112, 40899, 191147, 2369, 5, 127, 32909, 19993, 60075, 13, ...

[ 0.0545654296875, 0.0845947265625, 0.134033203125, 0.228271484375, 0.041412353515625, 0.02935791015625, 0.22705078125, 0.12353515625, 0.2095947265625, 0.134033203125, 0.06982421875, 0.228759765625, 0.1719970703125, 0.242919921875, 0.1673583984375, 0.1036376953125, 0.10211181640625, ...

embed

71243589_c1

71243589

haskell

1

a Maybe m1 traverse-like an async operation over m1 if m1 is Nothing , short-circuit out of the computation, i.e. traverse-like returns m2 == Nothing to the computation if m1 is Just x , perform the async effect which may return async Nothing or async Just x , s.t. traverse-like returns m2 == Nothing or Just async x t...

[ -0.0201416015625, 0.0223388671875, -0.0024566650390625, -0.01275634765625, 0.0177001953125, 0.018798828125, 0.0157470703125, -0.0130615234375, 0.01434326171875, -0.0242919921875, 0.0029144287109375, 0.0067138671875, -0.005035400390625, -0.01275634765625, 0.01251220703125, 0.00386047363...

[ 83425, 347, 418, 37317, 13, 5062, 10, 12654, 238, 41018, 645, 2174, 83, 182747, 16610, 82063, 7143, 1810, 181135, 30646, 304, 69112, 9563, 1022, 51339, 21543, 1543, 18, 5201, 19537, 939, 903, 49878, 67, 592, 3934, 28271, 8999, 3525, 22253...

[ 0.28759765625, 0.1038818359375, 0.126953125, 0.2275390625, 0.109375, 0.2071533203125, 0.1312255859375, 0.21923828125, 0.0916748046875, 0.230712890625, 0.1063232421875, 0.0596923828125, 0.060882568359375, 0.1678466796875, 0.107666015625, 0.0660400390625, 0.10443115234375, 0.09875488...

embed

7815402_c0

7815402

haskell

0

Title: Convert a Lazy ByteString to a strict ByteString Problem title: Convert a Lazy ByteString to a strict ByteString Tags: haskell, lazy-evaluation, strict, chunking, bytestring Problem: Convert a Lazy ByteString to a strict ByteString I have a function that takes a lazy ByteString , that I wish to have return lists...

Convert a Lazy ByteString to a strict ByteString Convert a Lazy ByteString to a strict ByteString haskell lazy-evaluation strict chunking bytestring qualified Convert Lazy ByteString ByteStrings Data.ByteString Data.ByteString.Lazy L.ByteString B.ByteString Convert a Lazy ByteString to a strict ByteString I have a func...

[ 0.005523681640625, 0.00787353515625, 0.0067138671875, -0.0225830078125, -0.001556396484375, 0.03076171875, -0.005157470703125, -0.00007486343383789062, 0.01422119140625, -0.007049560546875, 0.00836181640625, 0.0084228515625, 0.007354736328125, 0.00830078125, -0.01708984375, 0.011230468...

[ 1657, 11549, 239, 3285, 3311, 67, 71713, 214, 47, 10, 81113, 1556, 142508, 21, 159258, 7839, 6048, 390, 91693, 217225, 11809, 75358, 2729, 339, 335, 32354, 51776, 32599, 30646, 5303, 5180, 708, 7432, 12302, 10644, 140992, 3444, 75675, 64209...

[ 0.024078369140625, 0.146240234375, 0.1534423828125, 0.197998046875, 0.1231689453125, 0.1392822265625, 0.198486328125, 0.10125732421875, 0.07366943359375, 0.04254150390625, 0.253173828125, 0.091796875, 0.2012939453125, 0.13525390625, 0.135986328125, 0.1351318359375, 0.066650390625, ...

embed

67757976_c0

67757976

haskell

0

Title: How can the reader monad be bound like this Problem title: How can the reader monad be bound like this Tags: haskell, monads Problem: How can the reader monad be bound like this import Control.Monad.Reader tom :: Reader String String tom = do env <- ask -- gives you the environment which in this case is a String...

How can the reader monad be bound like this How can the reader monad be bound like this haskell monads Control.Monad.Reader How Reader Tom Jerry Who How can the reader monad be bound like this In this example, tom:: Reader (String -> String) . So is the same as (supposing tom is Reader (f) and jerry is Reader (g) ): th...

[ -0.00909423828125, 0.004058837890625, 0.005950927734375, 0.0079345703125, 0.00102996826171875, 0.005767822265625, -0.0072021484375, -0.0146484375, -0.00555419921875, -0.03369140625, 0.015625, 0.00689697265625, -0.01312255859375, 0.00726318359375, 0.0181884765625, -0.003753662109375, ...

[ 11249, 831, 155255, 2667, 712, 186, 99091, 1884, 903, 70, 1556, 142508, 27131, 46674, 31345, 56, 122636, 8352, 138171, 40469, 27781, 3627, 12, 71713, 214, 33079, 23351, 5701, 67565, 83, 420, 136, 55, 56216, 177, 26950, 1238, 47, 808, 706,...

[ 0.08343505859375, 0.09423828125, 0.275634765625, 0.12451171875, 0.1771240234375, 0.066650390625, 0.2447509765625, 0.145263671875, 0.10638427734375, 0.0228424072265625, 0.11474609375, 0.2135009765625, 0.1656494140625, 0.0958251953125, 0.2098388671875, 0.094482421875, 0.30029296875, ...

embed

30744680_c1

30744680

haskell

1

File = "test_ascii.pgm" main = B.readFile logFile >>= print . parseOnly parseASCIIGreymap A example file (test_ascii.pgm) looks like this: P2 # CREATOR: GIMP PNM Filter Version 1.1 10 10 255 0 0 0 0 0 64 255 255 255 179 0 0 0 0 0 159 255 255 255 243 0 0 0 0 96 223 255 255 255 255 0 0 64 96 223 255 255 255 255 255 128 1...

[ -0.00848388671875, -0.00799560546875, -0.01373291015625, 0.02880859375, 0.004669189453125, 0.03662109375, -0.009765625, -0.0111083984375, 0.0086669921875, 0.034423828125, 0.030517578125, -0.010986328125, -0.00927734375, -0.01287841796875, -0.000911712646484375, 0.003387451171875, -0....

[ 42724, 6954, 162, 26506, 254, 177, 39, 5201, 335, 39116, 174350, 12684, 28412, 366, 184, 20320, 538, 284, 134165, 36840, 62346, 27781, 11435, 33342, 1884, 903, 436, 304, 175151, 527, 169937, 70480, 128896, 40647, 38245, 209, 86565, 7911, 64...

[ 0.174072265625, 0.192138671875, 0.043487548828125, 0.236328125, 0.04913330078125, 0.1201171875, 0.166015625, 0.0892333984375, 0.09686279296875, 0.171142578125, 0.1693115234375, 0.13916015625, 0.07122802734375, 0.1722412109375, 0.092041015625, 0.0609130859375, 0.028228759765625, 0.0...

embed

10408046_c0

10408046

haskell

0

Title: Implementing `read` for a left-associative tree in Haskell Problem title: Implementing `read` for a left-associative tree in Haskell Tags: haskell Problem: Implementing `read` for a left-associative tree in Haskell I'm having a hard time implementing Read for a tree structure. I want to take a left-associative s...

Implementing `read` for a left-associative tree in Haskell Implementing `read` for a left-associative tree in Haskell haskell Implementing Haskell ABC Tree Branch Leaf Char Show Implementing `read` for a left-associative tree in Haskell I'm having a hard time implementing Read for a tree structure. I want to take a lef...

[ 0.00518798828125, 0.013427734375, -0.003662109375, 0.0225830078125, 0.0145263671875, 0.0211181640625, 0.00592041015625, -0.049560546875, 0.00055694580078125, -0.038330078125, 0.0028839111328125, -0.035400390625, -0.00579833984375, 0.00836181640625, 0.0057373046875, 0.00147247314453125,...

[ 153941, 39116, 100, 25737, 162, 45388, 45023, 53201, 20625, 142508, 1556, 47457, 101344, 21110, 636, 2407, 21656, 17367, 7941, 1733, 29479, 4764, 45646, 3444, 5646, 10, 79315, 76228, 366, 1755, 1884, 8399, 919, 96760, 3934, 17311, 27781, 4251...

[ 0.21142578125, 0.27490234375, 0.08575439453125, 0.2073974609375, 0.03369140625, 0.150634765625, 0.050048828125, 0.2427978515625, 0.1339111328125, 0.2213134765625, 0.1229248046875, 0.1380615234375, 0.172119140625, 0.0775146484375, 0.021209716796875, 0.09600830078125, 0.1221923828125, ...

embed

4463154_c0

4463154

haskell

0

Title: Haskell overlapping instances and type functions Problem title: Haskell overlapping instances and type functions Tags: overlapping-instances, metaprogramming, typeclass, haskell Problem: Haskell overlapping instances and type functions I have the following typeclass which models a SQL-like query optimization: cl...

Haskell overlapping instances and type functions Haskell overlapping instances and type functions overlapping-instances metaprogramming typeclass haskell Haskell OptimizableQuery Optimized Query Select Haskell overlapping instances and type functions I have the following typeclass which models a SQL-like query optimiza...

[ 0.0240478515625, -0.0037994384765625, -0.0086669921875, 0.006134033203125, -0.018310546875, -0.001708984375, -0.0224609375, -0.0299072265625, -0.0022735595703125, -0.000640869140625, 0.00164031982421875, -0.014892578125, 0.009765625, -0.003082275390625, -0.0220947265625, -0.00183868408...

[ 20625, 142508, 645, 143, 26783, 110527, 136, 10644, 32354, 116071, 23550, 28966, 67413, 1556, 43938, 2886, 41732, 1294, 29367, 58836, 51620, 25632, 115774, 80866, 5062, 41, 87235, 2967, 18499, 11935, 134225, 214, 14449, 21635, 5256, 44084, 8686...

[ 0.12255859375, 0.2271728515625, 0.1171875, 0.1783447265625, 0.08978271484375, 0.2225341796875, 0.0286865234375, 0.173828125, 0.1414794921875, 0.168701171875, 0.079345703125, 0.08184814453125, 0.1903076171875, 0.099609375, 0.1361083984375, 0.04718017578125, 0.016357421875, 0.0335693...

embed

3206869_c1

3206869

haskell

1

-> Operation -> fs (Path, Response) step currentDir op = case op of ChangeDir d -> return (d, "") Ls -> do { files <- children currentDir ; return (currentDir, unlines files) } At this point I am totally stuck. What I want to do is write an interactive loop in the IO monad, which can read Operation s and print Respons...

[ -0.031982421875, -0.01055908203125, -0.00013446807861328125, 0.0031890869140625, 0.00482177734375, 0.022705078125, 0.002593994140625, -0.0301513671875, -0.00016307830810546875, -0.035888671875, -0.0005645751953125, 0.033935546875, -0.0240478515625, 0.0177001953125, 0.00176239013671875, ...

[ 33079, 102203, 1238, 7, 683, 10519, 92748, 29954, 43581, 397, 481, 233, 2203, 7225, 87377, 104, 30646, 71, 339, 54, 102158, 20020, 163812, 51, 59801, 903, 6275, 444, 112668, 179933, 3444, 33022, 212398, 40956, 17780, 2667, 712, 831, 12301, ...

[ 0.016448974609375, 0.2056884765625, 0.1025390625, 0.059814453125, 0.039337158203125, 0.143310546875, 0.224853515625, 0.2440185546875, 0.235107421875, 0.142333984375, 0.180908203125, 0.2315673828125, 0.043182373046875, 0.12744140625, 0.21826171875, 0.1329345703125, 0.1568603515625, ...

embed

35733921_c0

35733921

haskell

0

Title: Compose lenses with accessing outer type during getter and setter Problem title: Compose lenses with accessing outer type during getter and setter Tags: haskell-lens, haskell Problem: Compose lenses with accessing outer type during getter and setter Suppose I have a function which extracts some inner value using...

Compose lenses with accessing outer type during getter and setter Compose lenses with accessing outer type during getter and setter haskell-lens haskell Compose inner1 inner2 Lens Compose lenses with accessing outer type during getter and setter Suppose I have a function which extracts some inner value using other inne...

[ -0.0062255859375, -0.009033203125, -0.004974365234375, 0.01177978515625, 0.0206298828125, 0.0120849609375, -0.000255584716796875, 0.000629425048828125, -0.00738525390625, -0.01708984375, -0.004058837890625, 0.050048828125, 0.0054931640625, -0.005859375, 0.012451171875, -0.0006561279296...

[ 15612, 8364, 96, 47754, 678, 17203, 1810, 56, 10644, 20271, 2046, 720, 136, 88685, 1556, 142508, 1977, 75414, 418, 304, 18226, 32354, 125663, 34292, 17368, 3789, 7359, 1636, 3098, 17721, 3917, 28282, 15700, 7, 1600, 1177, 16750, 11522, 3302...

[ 0.147216796875, 0.0850830078125, 0.1448974609375, 0.151123046875, 0.014404296875, 0.1243896484375, 0.130126953125, 0.1024169921875, 0.135498046875, 0.0811767578125, 0.0904541015625, 0.12890625, 0.04248046875, 0.1640625, 0.0902099609375, 0.200927734375, 0.1387939453125, 0.1694335937...

embed

70006438_c0

70006438

haskell

0

Title: Suppress module details when building Haskell project with Cabal Problem title: Suppress module details when building Haskell project with Cabal Tags: cabal, haskell Problem: Suppress module details when building Haskell project with Cabal I've recently switched from building my project with Stack to building it...

Suppress module details when building Haskell project with Cabal Suppress module details when building Haskell project with Cabal cabal haskell Suppress Haskell Cabal Compiling Vehicle Vehicle.hs AISEC x86_64-linux ghc-9.0.1 vehicle-0.1.0.1 Vehicle.o Vehicle.dyn_o Suppress module details when building Haskell project w...

[ 0.0146484375, 0.0034942626953125, 0.0115966796875, 0.01025390625, 0.0108642578125, -0.004150390625, 0.0062255859375, -0.006927490234375, -0.0042724609375, 0.023681640625, -0.0296630859375, -0.055419921875, 0.006805419921875, 0.00634765625, -0.0228271484375, 0.00927734375, -0.01477050...

[ 47004, 11856, 88996, 41653, 3229, 33976, 20625, 142508, 13452, 30438, 289, 678, 109524, 1556, 15612, 232362, 127, 49054, 16546, 15276, 13307, 2397, 6077, 31380, 15205, 102014, 80939, 31, 17872, 101089, 6512, 2594, 12638, 11814, 140992, 21373, 2...

[ 0.2130126953125, 0.23046875, 0.2393798828125, 0.182861328125, 0.03192138671875, 0.15234375, 0.134033203125, 0.22998046875, 0.1217041015625, 0.2015380859375, 0.1865234375, 0.060791015625, 0.2325439453125, 0.0924072265625, 0.0927734375, 0.2017822265625, 0.061492919921875, 0.022171020...

embed

13869979_c0

13869979

haskell

0

Title: printing menu in terminal and choosing an option, how to? Problem title: printing menu in terminal and choosing an option, how to? Tags: buffering, command-line, haskell, io Problem: printing menu in terminal and choosing an option, how to? Possible Duplicate: Wrong IO actions order using putStr and getLine I'm ...

printing menu in terminal and choosing an option, how to? printing menu in terminal and choosing an option, how to? buffering command-line haskell io Hello Choose World printing menu in terminal and choosing an option, how to? I'm a haskell beginner. I'm trying to make a program that shows a menu through terminal and a...

[ -0.0130615234375, -0.0003509521484375, -0.0047607421875, 0.0186767578125, -0.005279541015625, -0.014404296875, 0.00469970703125, -0.0086669921875, -0.004425048828125, -0.005645751953125, 0.003173828125, -0.0400390625, -0.00147247314453125, -0.004425048828125, -0.0012359619140625, 0.000...

[ 2448, 1916, 8026, 23, 33949, 136, 218873, 35829, 3642, 123759, 4209, 75101, 2256, 1556, 142508, 22995, 35378, 211525, 6661, 142, 47, 9842, 1679, 31577, 1528, 45831, 8305, 26458, 38937, 65508, 18151, 88996, 31380, 318, 29481, 56, 26818, 43240,...

[ 0.1903076171875, 0.051055908203125, 0.237548828125, 0.062286376953125, 0.240966796875, 0.0386962890625, 0.153564453125, 0.236328125, 0.044921875, 0.123779296875, 0.052032470703125, 0.0892333984375, 0.0625, 0.0966796875, 0.184814453125, 0.1812744140625, 0.14013671875, 0.181030273437...

embed

38154295_c0

38154295

haskell

0

Title: trouble installing accelerate-cuda Problem title: trouble installing accelerate-cuda Tags: accelerate, haskell Problem: trouble installing accelerate-cuda I have been trying to run cabal install accelerate-cuda -fdebug to no avail. at first i had some issues i think with my version of cuda, so i upgraded ghc to ...

trouble installing accelerate-cuda trouble installing accelerate-cuda accelerate haskell trouble installing accelerate-cuda I have been trying to run cabal install accelerate-cuda -fdebug to no avail. at first i had some issues i think with my version of cuda, so i upgraded ghc to version 8.0.1 and cabal to version 1.2...

[ 0.01507568359375, -0.00885009765625, 0.0106201171875, -0.005279541015625, 0.00628662109375, -0.02197265625, -0.0169677734375, -0.01220703125, -0.003570556640625, 0.0123291015625, 0.004730224609375, -0.05126953125, 0.01348876953125, -0.0030975341796875, 0.0024261474609375, 0.00207519531...

[ 63134, 20600, 197108, 13, 1010, 85, 9, 1556, 142508, 214, 31577, 11675, 109524, 420, 112, 85779, 47, 110, 25820, 5117, 37348, 5351, 11389, 314, 116086, 31380, 238, 3217, 102014, 4015, 187461, 19048, 79786, 1284, 16750 ]

[ 0.1243896484375, 0.183349609375, 0.1988525390625, 0.1522216796875, 0.1832275390625, 0.1832275390625, 0.0160064697265625, 0.1077880859375, 0.1934814453125, 0.022369384765625, 0.0416259765625, 0.05072021484375, 0.189208984375, 0.04302978515625, 0.1123046875, 0.2122802734375, 0.00708007...

embed

71605899_c0

71605899

haskell

0

Title: haskell another function as input parameter Problem title: haskell another function as input parameter Tags: haskell Problem: haskell another function as input parameter hi_copy.hs waxOn = x where z = 7 y = z + 18 k = y ^ 2 x = k * 5 triple = a where a = a * 3 then load. ghci> :load hi_copy.hs [1 of 1] Compiling...

haskell another function as input parameter haskell another function as input parameter haskell it hi_copy.hs Compiling Main Couldn Integer Relevant haskell another function as input parameter hi_copy.hs then load. then run triple waxOn run 3 * waxOn will work. but now I don't how to make triple waxOn working. meta: ti...

[ -0.023681640625, 0.007720947265625, 0.00016880035400390625, 0.011962890625, 0.000835418701171875, -0.0035400390625, -0.010986328125, -0.008544921875, 0.0031585693359375, -0.041015625, 0.0087890625, 0.0047607421875, 0.00008153915405273438, 0.01165771484375, -0.00162506103515625, -0.0004...

[ 1556, 142508, 15700, 32354, 237, 107730, 171859, 1274, 137366, 127, 15612, 49725, 12321, 191147, 19, 44401, 133, 30624, 72367, 11675, 162738, 7866, 20320, 138, 661, 4488, 3642, 3249, 20697, 23550, 570, 959, 52080, 10644, 23, 35166, 28219, 678...

[ 0.1829833984375, 0.240966796875, 0.1480712890625, 0.2119140625, 0.094482421875, 0.2005615234375, 0.2406005859375, 0.16357421875, 0.1943359375, 0.1102294921875, 0.0579833984375, 0.05499267578125, 0.081787109375, 0.130859375, 0.03826904296875, 0.1351318359375, 0.0960693359375, 0.0780...

embed

56292345_c0

56292345

haskell

0

Title: How does this usage of the composition operator work without a second argument? Problem title: How does this usage of the composition operator work without a second argument? Tags: function-composition, haskell Problem: How does this usage of the composition operator work without a second argument? I came across...

How does this usage of the composition operator work without a second argument? How does this usage of the composition operator work without a second argument? function-composition haskell How How does this usage of the composition operator work without a second argument? I came across a usage of the . operator that I ...

[ -0.01055908203125, 0.005645751953125, 0.00069427490234375, 0.03076171875, -0.01153564453125, 0.01031494140625, -0.013671875, 0.005828857421875, 0.0009613037109375, -0.0208740234375, -0.0159912109375, -0.0157470703125, -0.0037841796875, 0.0067138671875, -0.01171875, -0.0205078125, 0.0...

[ 11249, 903, 127689, 166577, 39933, 4488, 15490, 17932, 10750, 32354, 277, 40322, 1556, 142508, 14602, 5, 28219, 31635, 12921, 41877, 17304, 27489, 17368, 152, 18, 134071, 10644, 125195, 7, 4568, 136, 138256, 55681, 64549, 21373, 2806, 41206, ...

[ 0.0625, 0.0714111328125, 0.144287109375, 0.250732421875, 0.2276611328125, 0.1278076171875, 0.119384765625, 0.12255859375, 0.2117919921875, 0.153564453125, 0.13720703125, 0.178466796875, 0.14111328125, 0.2452392578125, 0.0330810546875, 0.152099609375, 0.056304931640625, 0.0205993652...

embed

34141165_c0

34141165

haskell

0

Title: foldl compiles but not foldr Problem title: foldl compiles but not foldr Tags: functional-programming, haskell Problem: foldl compiles but not foldr As a small exercise, I am trying to recode all. This code seems to work (except for infinite list): allComp f acc x = acc && f x all :: (a -> Bool) -> [a] -> Bool a...

foldl compiles but not foldr foldl compiles but not foldr functional-programming haskell Bool Couldn Main.hs:8:8 Expected Actual foldl compiles but not foldr As a small exercise, I am trying to recode all. This code seems to work (except for infinite list): But this one does not compile if I keep the same signature: An...

[ -0.004974365234375, 0.007568359375, 0.00860595703125, 0.01470947265625, -0.0059814453125, 0.0220947265625, -0.00946044921875, 0.013427734375, -0.01190185546875, 0.007354736328125, -0.005279541015625, -0.0255126953125, 0.007171630859375, 0.031494140625, -0.003265380859375, -0.0105590820...

[ 18344, 20469, 9969, 1340, 1284, 959, 7569, 123309, 28966, 1556, 142508, 2460, 929, 191147, 19, 12321, 127, 1019, 60075, 13, 100582, 19336, 81979, 31577, 33844, 112, 756, 18151, 4488, 54241, 5303, 903, 13695, 5701, 138256, 98352, 18499, 73342,...

[ 0.189453125, 0.229248046875, 0.18505859375, 0.161865234375, 0.0577392578125, 0.1097412109375, 0.1953125, 0.1270751953125, 0.0604248046875, 0.08758544921875, 0.198974609375, 0.0438232421875, 0.15478515625, 0.123046875, 0.0147705078125, 0.0955810546875, 0.0426025390625, 0.10034179687...

embed

36967622_c1

36967622

haskell

1

In this question, please trace the execution/reduction of the following function: foldl (toggle //) nil (“foo” “bar” “baz”) Below is a Hint I am Given: foldl (toggle //) nil (“foo” “bar” “baz”) Step1: Start with (1b), left side, foldl f x (cons a list) with f = (toggle //), x = nil, and list = (“foo” “bar” “baz”) Step...

[ -0.0011444091796875, -0.01495361328125, 0.0166015625, 0.017822265625, -0.00799560546875, 0.02197265625, -0.028076171875, 0.0040283203125, 0.01068115234375, 0.01177978515625, 0.0091552734375, 0.000946044921875, 0.018798828125, 0.009521484375, -0.005889892578125, -0.0194091796875, -0.0...

[ 360, 903, 9655, 22936, 144851, 71924, 1830, 64, 107, 77391, 25632, 32354, 18344, 20469, 15, 188, 129384, 4666, 17324, 3584, 31, 1299, 40300, 17336, 83, 19895, 18, 87, 444, 77878, 50478, 82825, 13794, 275, 25737, 5609, 1238, 1022, 25553, 5...

[ 0.0098876953125, 0.024871826171875, 0.0633544921875, 0.081298828125, 0.2109375, 0.2110595703125, 0.06396484375, 0.03826904296875, 0.152587890625, 0.226318359375, 0.095703125, 0.2215576171875, 0.194580078125, 0.245849609375, 0.04010009765625, 0.1368408203125, 0.2293701171875, 0.1975...

embed

24141972_c0

24141972

haskell

0

Title: How to apply higher order function to an effectful function in Haskell? Problem title: How to apply higher order function to an effectful function in Haskell? Tags: monads, haskell Problem: How to apply higher order function to an effectful function in Haskell? I have too functions: higherOrderPure :: (a -> b) -...

How to apply higher order function to an effectful function in Haskell? How to apply higher order function to an effectful function in Haskell? monads haskell How Haskell Monad Double Dia Any Either Left Parse Right How to apply higher order function to an effectful function in Haskell? I have too functions: I'd like t...

[ 0.0098876953125, -0.014892578125, -0.000827789306640625, -0.006011962890625, 0.006927490234375, 0.026611328125, 0.000484466552734375, 0.0052490234375, 0.011474609375, -0.0250244140625, -0.000919342041015625, -0.00994873046875, -0.0213623046875, -0.0322265625, 0.00543212890625, -0.00811...

[ 11249, 47, 59911, 77546, 12989, 32354, 21543, 7844, 23, 20625, 142508, 2667, 712, 7, 1556, 60331, 71, 107172, 4512, 28541, 9319, 636, 2480, 2392, 184, 90911, 765, 5792, 1884, 5117, 17932, 7440, 89536 ]

[ 0.100341796875, 0.1143798828125, 0.1856689453125, 0.177978515625, 0.2093505859375, 0.2310791015625, 0.1820068359375, 0.159423828125, 0.029815673828125, 0.146484375, 0.27783203125, 0.08935546875, 0.13330078125, 0.06097412109375, 0.1378173828125, 0.154541015625, 0.0982666015625, 0.13...

embed

20086030_c1

20086030

haskell

1

can do: runState (pushQueue 2 >> pushQueue 3 >> popQueue >> pushQueue 1 >> popQueue) emptyQueue and get back (Just 3,Queue {inbox = [1], outbox = []}) , which is what I wanted. But I can't do something like: runState (pushQueue 2 >> popQueue >>= pushQueue) emptyQueue which results in an: Occurs check: cannot construct...

[ -0.00897216796875, -0.00592041015625, -0.007110595703125, 0.003997802734375, -0.0012054443359375, 0.01434326171875, -0.0093994140625, -0.01953125, -0.0033111572265625, 0.0021209716796875, 0.0238037109375, 0.0306396484375, 0.003936767578125, -0.005615234375, 0.001556396484375, 0.0026245...

[ 831, 54, 11675, 135206, 13, 7332, 127, 41732, 13388, 116, 25944, 138, 7426, 106, 201505, 2046, 4420, 127794, 73, 11728, 17550, 1810, 36663, 4966, 18, 50339, 180, 48650, 12765, 53418, 64549, 54241, 10644, 10, 2389, 83425, 60075, 22836, 618, ...

[ 0.0899658203125, 0.05120849609375, 0.16748046875, 0.2210693359375, 0.092529296875, 0.1156005859375, 0.05706787109375, 0.1719970703125, 0.1439208984375, 0.09130859375, 0.237548828125, 0.136474609375, 0.177490234375, 0.0205841064453125, 0.2001953125, 0.044586181640625, 0.1492919921875,...

embed

2226833_c0

2226833

haskell

0

Title: Haskell confusion with ContT, callCC, when Problem title: Haskell confusion with ContT, callCC, when Tags: monads, continuations, haskell Problem: Haskell confusion with ContT, callCC, when Continuing quest to make sense of ContT and friends. Please consider the (absurd but illustrative) code below: v :: IO (Eit...

Haskell confusion with ContT, callCC, when Haskell confusion with ContT, callCC, when monads continuations haskell Haskell ContT Either Left Error Right Haskell confusion with ContT, callCC, when Continuing quest to make sense of ContT and friends. Please consider the (absurd but illustrative) code below: This code doe...

[ -0.0035552978515625, 0.004058837890625, -0.0012969970703125, -0.0174560546875, 0.005523681640625, -0.0003681182861328125, 0.010986328125, -0.0155029296875, -0.003692626953125, 0.00115966796875, 0.0025177001953125, -0.001922607421875, 0.005645751953125, 0.009765625, 0.00592041015625, -0...

[ 20625, 142508, 169463, 678, 1657, 18, 618, 11782, 13709, 3229, 2667, 712, 9454, 1556, 2480, 212059, 90911, 100761, 214, 38694, 10422, 136, 23902, 16916, 7, 84093, 58755, 18151, 35064, 3293, 14602, 959, 9969, 1340, 2174, 91995, 6868, 297, 47...

[ 0.1199951171875, 0.229736328125, 0.1854248046875, 0.049896240234375, 0.111328125, 0.0933837890625, 0.1416015625, 0.158447265625, 0.13916015625, 0.156494140625, 0.07904052734375, 0.0963134765625, 0.1527099609375, 0.101806640625, 0.07098388671875, 0.1085205078125, 0.099365234375, 0.1...

embed

24837844_c0

24837844

haskell

0

Title: Modify text being inserted into GTK TextBuffer Problem title: Modify text being inserted into GTK TextBuffer Tags: gtk, haskell, gtk3 Problem: Modify text being inserted into GTK TextBuffer I have a TextView and I want to automatically convert all typed, pasted, etc. text to uppercase, is it possible? I tried ad...

Modify text being inserted into GTK TextBuffer Modify text being inserted into GTK TextBuffer gtk haskell gtk3 Modify GTK TextBuffer TextView Gtk-WARNING Invalid You gtk3 Modify text being inserted into GTK TextBuffer I have a TextView and I want to automatically convert all typed, pasted, etc. text to uppercase, is it...

[ -0.021728515625, 0.004425048828125, 0.026611328125, 0.005767822265625, 0.000820159912109375, -0.00567626953125, -0.007171630859375, -0.00811767578125, -0.0001678466796875, -0.007659912109375, -0.004119873046875, -0.051513671875, 0.007537841796875, -0.016357421875, 0, -0.00921630859375,...

[ 16269, 40383, 7986, 8035, 183540, 297, 3934, 527, 29735, 24129, 7235, 18234, 706, 31472, 1556, 142508, 363, 100474, 60873, 25795, 7013, 2583, 3444, 191082, 96760, 756, 10644, 452, 47, 1407, 56, 58437, 7722, 154107, 373, 33657, 174379, 35863, ...

[ 0.1556396484375, 0.1370849609375, 0.201171875, 0.03900146484375, 0.229736328125, 0.04241943359375, 0.139404296875, 0.0782470703125, 0.244140625, 0.18212890625, 0.1549072265625, 0.1943359375, 0.060333251953125, 0.2037353515625, 0.10186767578125, 0.209228515625, 0.15673828125, 0.2553...

embed

52434603_c0

52434603

haskell

0

Title: Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) Problem title: Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) Tags: functional-programming, ghc, haskell, lazy-evaluation, sieve-of-eratosthenes Problem: Understanding the Limitations of Lazy Evaluation (Sieve of E...

Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) Understanding the Limitations of Lazy Evaluation (Sieve of Eratosthenes) functional-programming ghc haskell lazy-evaluation sieve-of-eratosthenes Understanding Limitations Lazy Evaluation Sieve Eratosthenes Understanding the Limitations of Lazy Ev...

[ -0.006500244140625, 0.03515625, 0.0294189453125, -0.0023193359375, 0.012939453125, 0.0008544921875, -0.0072021484375, -0.0137939453125, 0.0196533203125, -0.0111083984375, 0.023681640625, -0.0054931640625, 0.0228271484375, 0.00250244140625, 0.0167236328125, 0.0120849609375, 0.01831054...

[ 9626, 144057, 125177, 21094, 239, 3285, 151228, 99266, 272, 111, 14825, 1952, 2347, 1444, 123309, 28966, 31380, 238, 1556, 142508, 21, 159258, 78, 3134, 4390, 13164, 232, 727, 20625, 39418, 20809, 101935, 208124, 151552, 14847, 20594, 125296, ...

[ 0.034423828125, 0.017120361328125, 0.192626953125, 0.04742431640625, 0.111328125, 0.201171875, 0.175537109375, 0.150390625, 0.1956787109375, 0.1683349609375, 0.135498046875, 0.1295166015625, 0.16552734375, 0.1326904296875, 0.09185791015625, 0.070068359375, 0.00665283203125, 0.00805...

embed

5320528_c0

5320528

haskell

0

Title: Monadic type confusion Problem title: Monadic type confusion Tags: parsec, types, monads, haskell Problem: Monadic type confusion I am going through Write Yourself a Scheme in Haskell . Its a great tutorial, but I've run into a wall with one of the parsing exercises : parseNumber :: Parser LispVal parseNumber = ...

Monadic type confusion Monadic type confusion parsec types monads haskell Monadic Parser LispVal Number many1 Monadic type confusion I am going through Write Yourself a Scheme in Haskell . Its a great tutorial, but I've run into a wall with one of the parsing exercises : Rewrite parseNumber using: Do-notation explicit ...

[ -0.0238037109375, 0.0177001953125, -0.01141357421875, 0.009765625, -0.006561279296875, 0.027587890625, -0.01220703125, -0.00445556640625, 0.0130615234375, -0.03076171875, -0.004364013671875, -0.0302734375, -0.0072021484375, 0.00023555755615234375, 0.00060272216796875, -0.00073623657226...

[ 60331, 18403, 10644, 169463, 366, 39797, 52895, 2667, 712, 1556, 142508, 2392, 2189, 1261, 7008, 42272, 103332, 5941, 418, 18781, 14804, 39379, 34702, 282, 20625, 6782, 57143, 11675, 3934, 58982, 70, 81979, 853, 434, 184, 18444, 26278, 984, ...

[ 0.195068359375, 0.1632080078125, 0.21923828125, 0.206787109375, 0.11328125, 0.149169921875, 0.2105712890625, 0.1282958984375, 0.1038818359375, 0.0986328125, 0.2322998046875, 0.10711669921875, 0.06866455078125, 0.0601806640625, 0.06744384765625, 0.17578125, 0.1292724609375, 0.130371...

embed

29449754_c1

29449754

haskell

1

.0.0) rejecting: parsec-3.1.9/installed-3e8... (package is broken) trying: parsec-3.1.9 next goal: text (dependency of parsec-3.1.9) rejecting: text-1.2.0.4/installed-3df... (conflict: text => bytestring==0.10.6.0/installed-768..., netcore => bytestring==0.9.*) trying: text-1.2.0.4 next goal: bytestring (dependency of ...

[ -0.01171875, 0.0052490234375, 0.022216796875, 0.04296875, -0.0106201171875, -0.00604248046875, -0.0108642578125, -0.0162353515625, 0.017333984375, 0.020751953125, 0.0014801025390625, -0.005767822265625, -0.01251220703125, -0.01068115234375, -0.000446319580078125, -0.004608154296875, ...

[ 5, 99929, 456, 75161, 366, 39797, 97109, 92419, 80383, 297, 8316, 13, 1019, 27, 29102, 4588, 83, 148431, 31577, 158304, 11737, 69236, 7986, 105254, 48400, 121254, 71, 420, 2271, 134225, 390, 67, 91693, 102014, 122887, 84453, 2043, 30854, 14...

[ 0.05889892578125, 0.262451171875, 0.096435546875, 0.2193603515625, 0.10626220703125, 0.21240234375, 0.146240234375, 0.1190185546875, 0.1484375, 0.04656982421875, 0.08026123046875, 0.0570068359375, 0.1737060546875, 0.00543212890625, 0.1751708984375, 0.055694580078125, 0.01235961914062...

embed

9592191_c0

9592191

haskell

0

Title: The type signature of a combinator does not match the type signature of its equivalent Lambda function Problem title: The type signature of a combinator does not match the type signature of its equivalent Lambda function Tags: combinators, combinatory-logic, haskell, lambda-calculus, type-signature Problem: The ...

The type signature of a combinator does not match the type signature of its equivalent Lambda function The type signature of a combinator does not match the type signature of its equivalent Lambda function combinators combinatory-logic haskell lambda-calculus type-signature Lambda The type signature of a combinator doe...

[ 0.003692626953125, 0.020751953125, -0.0130615234375, -0.0162353515625, -0.0113525390625, -0.00799560546875, 0.005096435546875, 0.017333984375, -0.0076904296875, 0.012939453125, -0.0025787353515625, -0.0087890625, 0.00014209747314453125, -0.0111083984375, 0.00225830078125, 0.00179290771...

[ 10644, 138256, 22321, 1290, 14602, 959, 14858, 183234, 122930, 85, 32354, 22230, 31667, 137043, 1556, 142508, 6492, 6827, 94739, 137432, 5659, 10750, 1193, 990, 18264, 117176, 159, 294, 341, 69407, 20625, 17686, 41877, 40658, 55516, 113, 33079,...

[ 0.2529296875, 0.253173828125, 0.2347412109375, 0.181396484375, 0.056732177734375, 0.1192626953125, 0.1864013671875, 0.111328125, 0.1480712890625, 0.1048583984375, 0.10986328125, 0.0526123046875, 0.056549072265625, 0.0931396484375, 0.048675537109375, 0.2059326171875, 0.128173828125, ...

embed

59074808_c1

59074808

haskell

1

wanted to write my own custom data types and use my own tokens such as data Token = Zero | One [Char] | Two [Char] [Char] token :: Parser Token token = twoParser <|> oneParser <|> zeroParser twoParser :: Parser Token twoParser = do two <- tExpression a <- var b <- var return $ two a b tExpression :: Parser Token tExpr...

[ 0.00982666015625, 0.0081787109375, -0.0225830078125, 0.033203125, 0.0045166015625, 0.01361083984375, 0.0086669921875, -0.00171661376953125, 0.00127410888671875, -0.022705078125, 0.0078125, 0.007415771484375, -0.0150146484375, -0.01318359375, -0.009033203125, 0.01300048828125, 0.00903...

[ 36663, 33022, 10002, 114122, 2053, 52895, 4527, 47, 84694, 717, 1098, 83947, 6561, 84068, 32964, 2392, 2189, 6626, 28636, 1632, 45234, 808, 178752, 285, 30646, 3650, 10, 876, 23351, 54, 140443, 5117, 10588, 5941, 351, 56644, 40407, 83, 5267...

[ 0.0543212890625, 0.1419677734375, 0.10382080078125, 0.1876220703125, 0.1524658203125, 0.2166748046875, 0.09576416015625, 0.1365966796875, 0.2103271484375, 0.0994873046875, 0.1982421875, 0.1513671875, 0.0953369140625, 0.1292724609375, 0.119873046875, 0.1077880859375, 0.1109619140625, ...

embed

14034764_c1

14034764

haskell

1

es the list twice pickRandomWithLen :: [a] -> IO a pickRandomWithLen [] = error "List is empty" pickRandomWithLen xs = do gen <- newStdGen (e, _) <- return $ randomR (0, (length xs) - 1) gen return $ xs !! e Here is the code I use for benchmarking these two functions: main :: IO () main = do gen <- newStdGen let size =...

[ -0.0291748046875, 0.00982666015625, 0.01904296875, -0.00958251953125, 0.0146484375, -0.0020904541015625, -0.00445556640625, -0.01275634765625, 0.018310546875, -0.04296875, 0.02978515625, 0.010498046875, 0.017333984375, 0.0005950927734375, 0.00164031982421875, -0.01031494140625, -0.00...

[ 198, 70, 5303, 186351, 39580, 126525, 3815, 194583, 866, 33, 11, 17780, 18499, 154663, 83, 201505, 1022, 7, 54, 9226, 3525, 37455, 71, 105376, 13, 30646, 3650, 96759, 1052, 22085, 23986, 4879, 6506, 28, 18151, 4527, 240057, 214, 6097, 662...

[ 0.108154296875, 0.0107421875, 0.22216796875, 0.22119140625, 0.20556640625, 0.134521484375, 0.1407470703125, 0.180419921875, 0.141845703125, 0.1680908203125, 0.037078857421875, 0.205078125, 0.16162109375, 0.1990966796875, 0.049102783203125, 0.200927734375, 0.134765625, 0.08538818359...

embed

16160012_c0

16160012

haskell

0

Title: Parsec unexpected character after function call Problem title: Parsec unexpected character after function call Tags: haskell, parsec Problem: Parsec unexpected character after function call Here is my code so far: http://hpaste.org/86353 . I'm building w/ GHC on Windows. The code above produces the following out...

Parsec unexpected character after function call Parsec unexpected character after function call haskell parsec Parsec Parsec unexpected character after function call Here is my code so far: http://hpaste.org/86353 . I'm building w/ GHC on Windows. The code above produces the following output on my test file: Here is my...

[ -0.0081787109375, 0.01385498046875, 0.00274658203125, 0.041748046875, -0.0023651123046875, 0.00677490234375, 0.0036163330078125, -0.0135498046875, -0.00396728515625, 0.0024261474609375, 0.0003910064697265625, 0.006439208984375, -0.01324462890625, -0.00433349609375, -0.0036163330078125, ...

[ 2392, 39797, 241957, 62816, 7103, 32354, 11782, 1556, 142508, 366, 18151, 2060, 127, 134665, 127875, 33976, 148, 527, 73265, 3773, 36917, 27489, 140992, 3034, 11435, 11853, 107730, 15400, 70, 32628, 125195, 57357, 1636, 221, 5045, 87388, 36137,...

[ 0.1385498046875, 0.2374267578125, 0.193359375, 0.185546875, 0.1383056640625, 0.1717529296875, 0.192138671875, 0.1185302734375, 0.212646484375, 0.1622314453125, 0.0928955078125, 0.052490234375, 0.006378173828125, 0.1231689453125, 0.0784912109375, 0.052978515625, 0.0013427734375, 0.0...

embed

4124282_c0

4124282

haskell

0

Title: New to Haskell, don't understand why I'm getting an infinite type error Problem title: New to Haskell, don't understand why I'm getting an infinite type error Tags: haskell Problem: New to Haskell, don't understand why I'm getting an infinite type error module Main where rev :: [a] -> [a] rev...

New to Haskell, don't understand why I'm getting an infinite type error New to Haskell, don't understand why I'm getting an infinite type error haskell Haskell Main x:xs Occurs New to Haskell, don't understand why I'm getting an infinite type error I'm working my way through 99 Haskell Problems and ...

[ -0.0123291015625, 0.010986328125, 0.00396728515625, 0.019287109375, -0.0189208984375, 0.0037078857421875, 0.002899169921875, 0.0076904296875, 0.0020599365234375, -0.0194091796875, 0.01904296875, -0.0269775390625, 0.006805419921875, -0.005157470703125, 0.004058837890625, 0.0191650390625...

[ 2356, 47, 20625, 142508, 3768, 28219, 15400, 20949, 54241, 13, 10644, 18499, 1556, 425, 48650, 18, 10078, 15649, 31577, 33022, 32354, 39531, 184, 5303, 107419, 21771, 23, 479, 822, 2967, 9790, 9969, 1340, 18151, 36917, 80934, 3934, 527, 732...

[ 0.06591796875, 0.0384521484375, 0.0947265625, 0.1795654296875, 0.041839599609375, 0.0927734375, 0.07763671875, 0.035736083984375, 0.162109375, 0.053466796875, 0.1998291015625, 0.17578125, 0.05328369140625, 0.037811279296875, 0.0968017578125, 0.00555419921875, 0.1484375, 0.101074218...

embed

33378977_c0

33378977

haskell

0

Title: Infinite Loop Haskell Problem title: Infinite Loop Haskell Tags: haskell, infinite-loop, ghci Problem: Infinite Loop Haskell data Node = Node Char [Node] deriving(Eq) nodeA = Node 'A' [nodeB, nodeC, nodeD] nodeB = Node 'B' [] nodeC = Node 'C' [nodeE, nodeF] nodeD = Node 'D' [] nodeE = Node 'E' [nodeB] nodeF = No...

Infinite Loop Haskell Infinite Loop Haskell haskell infinite-loop ghci Infinite Loop Haskell Node Char Main ABCEBF Infinite Loop Haskell Whenever I call deepTraverse nodeA it loops gets hung up. In ghci it does spit out: Leading me to suspect the "then" part of the if. I have been banging my head against this problem f...

[ 0.00933837890625, -0.0120849609375, 0.0036163330078125, 0.0026397705078125, 0.016845703125, 0.00885009765625, 0.0038299560546875, -0.0169677734375, 0.0218505859375, -0.038330078125, 0.0228271484375, -0.025634765625, 0.0140380859375, 0.0341796875, 0.01361083984375, 0.008544921875, 0.0...

[ 134322, 199694, 20625, 142508, 13, 1556, 54241, 28354, 31380, 318, 438, 112, 21656, 12321, 47457, 24162, 919, 30441, 11782, 53894, 28542, 37676, 110, 284, 442, 40956, 7, 62163, 80756, 1257, 14602, 16195, 18, 1810, 92610, 92733, 2831, 2174, ...

[ 0.150146484375, 0.201904296875, 0.1446533203125, 0.237060546875, 0.0703125, 0.1199951171875, 0.1171875, 0.19921875, 0.09552001953125, 0.1319580078125, 0.130859375, 0.1258544921875, 0.1229248046875, 0.07012939453125, 0.06585693359375, 0.0889892578125, 0.07476806640625, 0.05715942382...

embed

64275943_c0

64275943

haskell

0

Title: How to prevent type scoping in such situation? Problem title: How to prevent type scoping in such situation? Tags: haskell Problem: How to prevent type scoping in such situation? instance IsString Escaped where fromString a = Escaped a instance ConvertibleStrings URI.URI String where convertString = show data Es...

How to prevent type scoping in such situation? How to prevent type scoping in such situation? haskell How IsString Escaped ConvertibleStrings URI.URI Show Escaping esc1 esc2 escape1 escape2 OverloadedStrings sec1 How to prevent type scoping in such situation? Now, with the OverloadedStrings extension enabled, if I use ...

[ 0.0074462890625, -0.005615234375, -0.01287841796875, 0.003631591796875, -0.004669189453125, -0.01373291015625, 0.010498046875, 0.021240234375, -0.000789642333984375, -0.025390625, -0.0002956390380859375, -0.02099609375, -0.00083160400390625, 0.014404296875, 0.005950927734375, -0.018798...

[ 11249, 56282, 10644, 44679, 214, 23, 6044, 16648, 47, 1556, 142508, 2071, 71713, 181540, 71, 1657, 41418, 2661, 5180, 46492, 17367, 156704, 10366, 6964, 418, 304, 144281, 9578, 63033, 297, 19216, 111938, 225081, 4527, 5608, 678, 6936, 39797, ...

[ 0.053802490234375, 0.22119140625, 0.2476806640625, 0.1871337890625, 0.133544921875, 0.036956787109375, 0.058837890625, 0.1112060546875, 0.01055908203125, 0.1214599609375, 0.206298828125, 0.034912109375, 0.1552734375, 0.166748046875, 0.09130859375, 0.010833740234375, 0.11962890625, ...

embed

40007277_c0

40007277

haskell

0

Title: Ambiguous type variable from use of array freeze in ST monad Problem title: Ambiguous type variable from use of array freeze in ST monad Tags: arrays, haskell Problem: Ambiguous type variable from use of array freeze in ST monad Following code creates array, initializes, then returns immutable array. import Data...

Ambiguous type variable from use of array freeze in ST monad Ambiguous type variable from use of array freeze in ST monad arrays haskell use Data.Array Control.Monad.ST Data.Array.ST qualified a Ambiguous Data.Array.IArray STArray IA.IArray Array Ambiguous type variable from use of array freeze in ST monad Following co...

[ 0.004791259765625, -0.004425048828125, -0.015625, -0.00750732421875, 0.00933837890625, -0.0244140625, -0.005462646484375, 0.0235595703125, -0.001251220703125, 0.005279541015625, 0.02490234375, -0.00156402587890625, -0.006927490234375, 0.0091552734375, 0.000644683837890625, 0.0110473632...

[ 10250, 12282, 10821, 10644, 77336, 4527, 10298, 53, 4092, 731, 16992, 2667, 712, 1556, 142508, 11809, 7614, 7092, 27131, 46674, 8545, 217225, 69253, 77168, 18151, 28282, 61475, 30646, 561, 22819, 4773, 42, 4426, 187, 113660, 18499, 6868, 1382...

[ 0.1339111328125, 0.175537109375, 0.0484619140625, 0.2025146484375, 0.2274169921875, 0.05316162109375, 0.1246337890625, 0.06304931640625, 0.1441650390625, 0.168212890625, 0.116455078125, 0.09112548828125, 0.1329345703125, 0.1002197265625, 0.20166015625, 0.033599853515625, 0.0483398437...

embed

65853147_c0

65853147

haskell

0

Title: How to interpret a Traversable type as an Applicative in this function? Problem title: How to interpret a Traversable type as an Applicative in this function? Tags: list, cartesian-product, haskell, traversable Problem: How to interpret a Traversable type as an Applicative in this function? I was experimenting w...

How to interpret a Traversable type as an Applicative in this function? How to interpret a Traversable type as an Applicative in this function? list cartesian-product haskell traversable How Traversable Applicative How to interpret a Traversable type as an Applicative in this function? I was experimenting with haskell ...

[ 0.0137939453125, 0.0162353515625, -0.01141357421875, 0.036376953125, 0.021484375, 0.006561279296875, 0.005584716796875, 0.02880859375, 0.007568359375, -0.0277099609375, 0.003875732421875, 0.00689697265625, 0.0064697265625, 0.040771484375, -0.0181884765625, -0.003662109375, -0.0035095...

[ 11249, 29481, 4937, 7864, 2886, 10644, 237, 5659, 11048, 4935, 23, 903, 32354, 5303, 129912, 3378, 57877, 1556, 142508, 37317, 10, 28007, 61112, 134053, 19713, 3060, 2053, 45646, 2843, 80934, 831, 61924, 40, 944, 3956, 284, 2046, 12996, 116...

[ 0.07275390625, 0.2139892578125, 0.1495361328125, 0.2149658203125, 0.243896484375, 0.232421875, 0.033050537109375, 0.151611328125, 0.2020263671875, 0.1629638671875, 0.0209503173828125, 0.040435791015625, 0.1708984375, 0.1781005859375, 0.1298828125, 0.09478759765625, 0.175048828125, ...

embed

55957712_c1

55957712

haskell

1

init $ drop 7 $ show nsalbum .... 60 artist ++ " - " ++ album I'm having trouble understanding why this is happening. Running a similar command in a test program of mine: main = do artg <- getTags "/home/spilskinanke/backlogtest/02 - await rescue.mp3" artistGetter let test = init $ drop 8 $ show artg print test this w...

[ -0.00102996826171875, 0.01416015625, 0.0106201171875, 0.005767822265625, -0.00970458984375, 0.0145263671875, 0.037109375, -0.023193359375, -0.002960205078125, -0.01055908203125, 0.006103515625, 0.000263214111328125, -0.0089111328125, -0.0027008056640625, -0.00958251953125, 0.0019836425...

[ 23, 217, 3650, 36069, 361, 7639, 1779, 54981, 1496, 22104, 37223, 20, 7156, 19441, 63134, 100094, 15400, 903, 123087, 28398, 21373, 75101, 3034, 1528, 5201, 4927, 177, 66448, 29552, 40277, 1336, 76, 13116, 4867, 6954, 97564, 634, 114777, 26...

[ 0.04693603515625, 0.07666015625, 0.10748291015625, 0.183837890625, 0.1282958984375, 0.1279296875, 0.0687255859375, 0.179443359375, 0.1961669921875, 0.1727294921875, 0.09136962890625, 0.017547607421875, 0.1771240234375, 0.002685546875, 0.058807373046875, 0.0826416015625, 0.08587646484...

embed

56209194_c0

56209194

haskell

0

Title: Non-exhaustive patterns in a function [Haskell] Problem title: Non-exhaustive patterns in a function [Haskell] Tags: haskell Problem: Non-exhaustive patterns in a function [Haskell] I have to make a function neighbours :: [((String, String), Int)] -> String -> [(String, Int)] This is the function I came up with:...

Non-exhaustive patterns in a function [Haskell] Non-exhaustive patterns in a function [Haskell] haskell Non-exhaustive Haskell Non-exhaustive patterns in a function [Haskell] I have to make a function neighbours :: [((String, String), Int)] -> String -> [(String, Int)] This is the function I came up with: The output is...

[ -0.009033203125, 0.0128173828125, -0.002410888671875, -0.004486083984375, 0.01165771484375, 0.0054931640625, -0.01043701171875, -0.0234375, 0.01287841796875, -0.01434326171875, 0.00946044921875, -0.00872802734375, 0.010009765625, 0.0096435546875, -0.00112152099609375, 0.017333984375, ...

[ 3775, 3355, 18391, 4935, 103510, 23, 32354, 6495, 7, 142508, 1556, 20625, 765, 108, 6958, 38648, 1984, 71713, 23351, 360, 18, 33079, 1257, 140992, 134598, 5303, 370, 99726, 79315, 80836, 107730, 164805, 8705, 1022, 418, 892, 1505, 304, 2967...

[ 0.1923828125, 0.03533935546875, 0.14453125, 0.0804443359375, 0.2303466796875, 0.03619384765625, 0.1824951171875, 0.07012939453125, 0.06353759765625, 0.201904296875, 0.110595703125, 0.108642578125, 0.0040283203125, 0.087158203125, 0.1256103515625, 0.197509765625, 0.07305908203125, 0...

embed

26385809_c0

26385809

haskell

0

Title: Catch SomeException with ExceptT Problem title: Catch SomeException with ExceptT Tags: monad-transformers, haskell, exception Problem: Catch SomeException with ExceptT I'm trying to use the ExceptT monad transformer to catch any exception thrown by a function, like so: import Control.Exception import Control.Mon...

Catch SomeException with ExceptT Catch SomeException with ExceptT monad-transformers haskell exception SomeException Control.Exception Control.Monad.Trans.Except Catch ExceptT DivideByZero Left Right Catch SomeException with ExceptT I'm trying to use the ExceptT monad transformer to catch any exception thrown by a func...

[ 0.015869140625, 0.01287841796875, 0.0093994140625, -0.0164794921875, 0.0093994140625, -0.01416015625, 0.0035400390625, -0.019287109375, -0.00616455078125, -0.00390625, 0.00726318359375, -0.006591796875, -0.0030975341796875, 0.010986328125, 0.0233154296875, -0.01104736328125, 0.004150...

[ 18826, 206, 31384, 19279, 63928, 678, 218288, 618, 2667, 712, 215175, 1314, 1556, 142508, 131527, 27131, 46674, 62624, 19462, 76278, 112, 75358, 4036, 2480, 90911, 31577, 4527, 27198, 56, 105556, 2499, 104250, 390, 32354, 1884, 221, 1284, 256...

[ 0.15087890625, 0.0823974609375, 0.1192626953125, 0.092041015625, 0.2120361328125, 0.050506591796875, 0.2198486328125, 0.2193603515625, 0.09967041015625, 0.1463623046875, 0.1728515625, 0.037017822265625, 0.0865478515625, 0.1776123046875, 0.235595703125, 0.1175537109375, 0.04248046875,...

embed

41078686_c2

41078686

haskell

2

.0 monad-par-0.3.4.8 monad-par-extras-0.3.3 mono-traversable-1.0.1 mtl-2.2.1 mwc-random-0.13.5.0 network-2.6.3.1 network-conduit-1.1.0 parallel-3.2.1.0 parallel-io-0.3.3 parseargs-0.2.0.8 primitive-0.6.1.0 random-1.1 resourcet-1.1.8.1 scientific-0.3.4.9 semigroups-0.18.2 split-0.2.3.1 stm-2.4.4.1 streaming-commons-0.1....

[ -0.0181884765625, 0.01422119140625, -0.006317138671875, 0.00872802734375, 0.009033203125, 0.0196533203125, -0.0033721923828125, -0.006072998046875, -0.016845703125, 0.00787353515625, -0.0223388671875, -0.0155029296875, -0.003021240234375, 0.0155029296875, 0.000545501708984375, 0.012878...

[ 6, 5, 2389, 2667, 712, 2500, 170179, 29485, 1019, 112779, 7, 23320, 134693, 22460, 1517, 7864, 2886, 5759, 102014, 18, 141, 5428, 68107, 43879, 238, 46258, 2681, 187461, 33120, 154784, 97109, 2271, 112061, 102107, 95103, 107033, 846, 366, 6...

[ 0.061431884765625, 0.0782470703125, 0.1505126953125, 0.1728515625, 0.1788330078125, 0.1739501953125, 0.1456298828125, 0.130859375, 0.153564453125, 0.1566162109375, 0.129638671875, 0.04351806640625, 0.0965576171875, 0.20751953125, 0.0599365234375, 0.1129150390625, 0.12353515625, 0.0...

embed

53994854_c0

53994854

haskell

0

Title: How to bring a monadic interpreter to the IO monad? Problem title: How to bring a monadic interpreter to the IO monad? Tags: haskell, interpreter Problem: How to bring a monadic interpreter to the IO monad? My question relates to the simple interpreter written in in this answer . I already asked a similar questi...

How to bring a monadic interpreter to the IO monad? How to bring a monadic interpreter to the IO monad? haskell interpreter How Stmt Exp While Seq Print How to bring a monadic interpreter to the IO monad? My question relates to the simple interpreter written in in this answer . I already asked a similar question before...

[ -0.001739501953125, 0.00189971923828125, -0.00885009765625, 0.033935546875, 0.0111083984375, 0.0025787353515625, 0.0118408203125, -0.0034332275390625, -0.005615234375, -0.048828125, -0.0078125, -0.029052734375, -0.00360107421875, 0.00286865234375, 0, 0.00994873046875, -0.0341796875, ...

[ 11249, 47, 19095, 2667, 11, 18403, 29481, 56, 17780, 712, 10, 1556, 142508, 2907, 18, 60075, 51404, 503, 864, 39754, 8781, 351, 17932, 5809, 15190, 130732, 31075, 192046, 6626, 20117, 87039, 154107, 63805, 4527, 3884, 71713, 866, 19, 20625,...

[ 0.0830078125, 0.11279296875, 0.141357421875, 0.1339111328125, 0.09185791015625, 0.1090087890625, 0.2349853515625, 0.1536865234375, 0.203857421875, 0.1982421875, 0.03350830078125, 0.095947265625, 0.2210693359375, 0.01275634765625, 0.02227783203125, 0.144775390625, 0.060089111328125, ...

embed

28142914_c0

28142914

haskell

0

Title: Managing explosion of constraints (Haskell) Problem title: Managing explosion of constraints (Haskell) Tags: typeclass, constraints, haskell Problem: Managing explosion of constraints (Haskell) I am writing a function which I would like to be generic over Vectors. In other words, I have something like: import qu...

Managing explosion of constraints (Haskell) Managing explosion of constraints (Haskell) typeclass constraints haskell qualified Managing Haskell Data.Vector.Generic G.Vector Unboxed Storable Managing explosion of constraints (Haskell) I am writing a function which I would like to be generic over Vectors. In other words...

[ -0.0034637451171875, 0.0252685546875, -0.0228271484375, 0.0203857421875, 0.012451171875, -0.01519775390625, -0.0240478515625, -0.01220703125, -0.003387451171875, -0.0264892578125, -0.0181884765625, -0.026123046875, 0.005706787109375, 0.0108642578125, -0.0269775390625, 0.0068359375, 0...

[ 1572, 66398, 24649, 6889, 111, 158, 2816, 4288, 6495, 7, 142508, 10644, 67413, 1556, 217225, 20625, 11809, 26455, 18770, 135932, 12259, 527, 992, 11728, 23604, 2886, 32562, 32354, 2806, 1884, 186, 189534, 645, 52884, 22230, 38937, 55076, 4527...

[ 0.1097412109375, 0.076904296875, 0.2044677734375, 0.11474609375, 0.06854248046875, 0.1116943359375, 0.20068359375, 0.1663818359375, 0.0914306640625, 0.09222412109375, 0.2374267578125, 0.1282958984375, 0.1748046875, 0.1163330078125, 0.1431884765625, 0.1197509765625, 0.067626953125, ...

embed

31214814_c0

31214814

haskell

0

Title: Haskell reuse patterns Problem title: Haskell reuse patterns Tags: haskell, pattern-matching Problem: Haskell reuse patterns In the code below, the same pattern match (Node n left right) is used by three different functions. If I want to add a pattern, e.g. (Node n (Leaf) (Leaf)) or change my datatype, I have to...

Haskell reuse patterns Haskell reuse patterns haskell pattern-matching Haskell Tree Node Leaf PNode Haskell reuse patterns In the code below, the same pattern match (Node n left right) is used by three different functions. If I want to add a pattern, e.g. (Node n (Leaf) (Leaf)) or change my datatype, I have to change a...

[ -0.0211181640625, 0.02001953125, 0.014892578125, 0.00041961669921875, 0.002044677734375, -0.0106201171875, -0.032470703125, -0.0125732421875, 0.0177001953125, -0.0576171875, -0.0003376007080078125, -0.0126953125, 0.0025177001953125, -0.01251220703125, 0.0034332275390625, -0.00018024444...

[ 20625, 142508, 156883, 103510, 1556, 98753, 101344, 438, 112, 636, 2407, 436, 5021, 18151, 35064, 70, 5701, 14858, 653, 25737, 7108, 11814, 390, 17262, 12921, 32354, 3444, 15190, 5267, 15549, 2053, 50986, 756, 3917, 6097, 4734, 61924, 24145, ...

[ 0.1470947265625, 0.215576171875, 0.265625, 0.244384765625, 0.146240234375, 0.2056884765625, 0.162841796875, 0.11865234375, 0.1163330078125, 0.049530029296875, 0.1580810546875, 0.039215087890625, 0.138427734375, 0.07098388671875, 0.05999755859375, 0.008697509765625, 0.1092529296875, ...

embed

54369864_c0

54369864

haskell

0

Title: Exercise with functor, applicative and monads in Haskell Problem title: Exercise with functor, applicative and monads in Haskell Tags: haskell Problem: Exercise with functor, applicative and monads in Haskell I'm doing exercises from the book "Programming in Haskell (2nd Edition)" and I have some problems in und...

Exercise with functor, applicative and monads in Haskell Exercise with functor, applicative and monads in Haskell haskell Exercise Haskell Expr Val Add Show Exercise with functor, applicative and monads in Haskell I'm doing exercises from the book "Programming in Haskell (2nd Edition)" and I have some problems in under...

[ 0.00555419921875, -0.000774383544921875, 0.008544921875, 0.0230712890625, 0.025146484375, 0.0234375, 0.000881195068359375, -0.01373291015625, 0.006500244140625, -0.00787353515625, 0.0033721923828125, -0.037109375, 0.0035247802734375, 0.01483154296875, 0.00145721435546875, 0.009765625, ...

[ 155534, 184, 678, 7477, 18770, 41816, 4935, 136, 2667, 712, 20625, 142508, 7, 23, 1556, 60075, 42, 4769, 29117, 17367, 81979, 12877, 172895, 44965, 44402, 100094, 25632, 10644, 125195, 70541, 77336, 10, 7639, 3642, 3249, 110527, 28670, 5659, ...

[ 0.205078125, 0.002197265625, 0.1246337890625, 0.1728515625, 0.1949462890625, 0.1871337890625, 0.1412353515625, 0.0295257568359375, 0.1268310546875, 0.1734619140625, 0.1451416015625, 0.2347412109375, 0.049835205078125, 0.0288848876953125, 0.111083984375, 0.075927734375, 0.089599609375...

embed

10641391_c0

10641391

haskell

0

Title: Haskell compiling DLL "undefined reference" Problem title: Haskell compiling DLL "undefined reference" Tags: haskell, linker Problem: Haskell compiling DLL "undefined reference" I was following the guide for making DLL's to be called from other languages here: http://www.haskell.org/ghc/docs/...

Haskell compiling DLL "undefined reference" Haskell compiling DLL "undefined reference" haskell linker Haskell DLL Haskell compiling DLL "undefined reference" I was following the guide for making DLL's to be called from other languages here: http://www.haskell.org/ghc/docs/7.0.4/html/users_guide/win...

[ 0.02294921875, 0.03369140625, 0.00860595703125, -0.00848388671875, -0.007720947265625, -0.00140380859375, -0.00885009765625, 0.004852294921875, -0.011474609375, -0.0067138671875, -0.0220947265625, -0.040283203125, 0.02685546875, 0.0223388671875, 0.01446533203125, -0.0054931640625, 0....

[ 20625, 142508, 9969, 391, 23708, 59437, 5983, 297, 91067, 49725, 1556, 3126, 56, 25632, 17997, 35839, 1295, 3789, 46876, 10557, 9486, 64527, 6460, 71, 42458, 1340, 88996, 4358, 313, 11435, 1884, 9790, 756, 25842, 71358, 18499, 89914, 903, 1...

[ 0.1561279296875, 0.244384765625, 0.110107421875, 0.0623779296875, 0.218994140625, 0.07952880859375, 0.166748046875, 0.06256103515625, 0.2415771484375, 0.0079345703125, 0.12548828125, 0.1903076171875, 0.0966796875, 0.005889892578125, 0.039459228515625, 0.10491943359375, 0.062042236328...

embed

1414497_c0

1414497

haskell

0

Title: Complex iterations in haskell Problem title: Complex iterations in haskell Tags: haskell, math, functional-programming, complex-numbers Problem: Complex iterations in haskell I have this complex iterations program I wrote in TI Basic to perform a basic iteration on a complex number and then give the magnitude of...

Complex iterations in haskell Complex iterations in haskell haskell math functional-programming complex-numbers Complex INPUT SEED ITERATIONS DISP MAGNITUDE PAUSE END RealFloat Integer Finished Complex iterations in haskell I have this complex iterations program I wrote in TI Basic to perform a basic iteration on a com...

[ -0.0032958984375, 0.017333984375, 0.00183868408203125, 0.0033416748046875, 0.01611328125, 0.01092529296875, 0.012939453125, -0.0059814453125, 0.007659912109375, -0.0240478515625, 0.006317138671875, -0.0155029296875, -0.0103759765625, 0.00823974609375, 0, 0.0108642578125, -0.017822265...

[ 113197, 17, 720, 21094, 1556, 142508, 23, 48909, 123309, 28966, 27140, 2606, 1297, 5881, 124599, 159, 138911, 87, 136265, 209973, 157684, 11107, 39015, 5120, 365, 257, 44401, 13316, 164, 765, 903, 1528, 54397, 26906, 91692, 51339, 62822, 1401...

[ 0.256103515625, 0.09307861328125, 0.2432861328125, 0.08154296875, 0.1519775390625, 0.23583984375, 0.007537841796875, 0.08551025390625, 0.125244140625, 0.0948486328125, 0.244384765625, 0.0718994140625, 0.0611572265625, 0.058837890625, 0.03472900390625, 0.044769287109375, 0.16369628906...

embed

16222203_c0

16222203

haskell

0

Title: Migrating Applicative Form to Monadic - get current timestamp Problem title: Migrating Applicative Form to Monadic - get current timestamp Tags: forms, haskell, yesod Problem: Migrating Applicative Form to Monadic - get current timestamp I have a working applicative form, but I want to add a textField that doesn...

Migrating Applicative Form to Monadic - get current timestamp Migrating Applicative Form to Monadic - get current timestamp forms haskell yesod Migrating Applicative Form Monadic Migrating Applicative Form to Monadic - get current timestamp I have a working applicative form, but I want to add a textField that doesn't c...

[ -0.0264892578125, 0.00982666015625, -0.00054168701171875, -0.00848388671875, 0.01068115234375, -0.015380859375, -0.00640869140625, 0.0050048828125, 0.0038909912109375, -0.0869140625, 0.031982421875, -0.008056640625, -0.00799560546875, 0.000751495361328125, -0.0018310546875, -0.02258300...

[ 130446, 1916, 5659, 11048, 4935, 15236, 47, 60331, 18403, 2046, 43581, 1733, 590, 2676, 3173, 1556, 142508, 2422, 23722, 765, 20697, 41816, 3444, 15190, 7986, 6159, 19388, 42518, 2499, 44457, 3299, 171581, 68403, 40494, 1632, 16995, 99577, 70...

[ 0.1644287109375, 0.07763671875, 0.11376953125, 0.1363525390625, 0.17431640625, 0.2401123046875, 0.11083984375, 0.185791015625, 0.1839599609375, 0.10693359375, 0.2210693359375, 0.1571044921875, 0.20458984375, 0.201171875, 0.2393798828125, 0.10986328125, 0.2196044921875, 0.1121826171...

embed

7252493_c0

7252493

haskell

0

Title: library for affine k-algebra computations? Problem title: library for affine k-algebra computations? Tags: polynomial-math, computer-algebra-systems, haskell Problem: library for affine k-algebra computations? I'm looking for a library or computer algebra system that will help compute operations on polynomials i...

library for affine k-algebra computations? library for affine k-algebra computations? polynomial-math computer-algebra-systems haskell F_2 x_1 x_n poly_xn x_2 library for affine k-algebra computations? I'm looking for a library or computer algebra system that will help compute operations on polynomials in the ring wher...

[ 0.01470947265625, 0.0179443359375, -0.0019683837890625, 0.020751953125, -0.0000400543212890625, 0.0033111572265625, 0.0289306640625, 0.0238037109375, -0.0030975341796875, -0.0021514892578125, 0.0238037109375, 0.0081787109375, 0.0203857421875, 0.01373291015625, -0.0177001953125, -0.0170...

[ 35773, 1294, 100, 261, 64552, 472, 9, 289, 429, 2844, 181135, 5256, 35874, 1687, 15403, 125458, 13909, 16751, 1556, 142508, 563, 454, 304, 1022, 115187, 425, 16487, 144, 5426, 4358, 9969, 6743, 41018, 15789, 4720, 62766, 94418, 44457, 420, ...

[ 0.2110595703125, 0.126953125, 0.0809326171875, 0.1256103515625, 0.233642578125, 0.1927490234375, 0.00372314453125, 0.0601806640625, 0.1143798828125, 0.1475830078125, 0.1602783203125, 0.042266845703125, 0.1322021484375, 0.1138916015625, 0.0980224609375, 0.0733642578125, 0.092590332031...

embed

47745674_c0

47745674

haskell

0

Title: Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell Problem title: Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell Tags: tree, haskell Problem: Creating a Binary Tree from a list of a preorder traversal with known Interna...

Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell Creating a Binary Tree from a list of a preorder traversal with known Internal nodes in Haskell tree haskell a Creating Binary Tree Internal Haskell Empty Branch Show Char x:xs Creating a Binary Tree from a list of a preorde...

[ 0.0035247802734375, -0.0021209716796875, -0.006134033203125, 0.014404296875, 0.0267333984375, 0.0267333984375, -0.005645751953125, -0.041259765625, 0.0196533203125, -0.015625, 0.019775390625, -0.020751953125, 0.00445556640625, 0.018798828125, 0.00701904296875, 0.00799560546875, 0.031...

[ 56781, 54092, 1294, 101344, 1295, 5303, 479, 80596, 37317, 678, 51529, 106745, 110, 988, 20625, 142508, 289, 53201, 1556, 31678, 21110, 17367, 21656, 1022, 425, 81887, 44188, 36716, 34475, 1914, 756, 70796, 34292, 661, 438, 173591, 765, 3034,...

[ 0.1136474609375, 0.194091796875, 0.134521484375, 0.24560546875, 0.042449951171875, 0.11669921875, 0.1185302734375, 0.207763671875, 0.1173095703125, 0.0574951171875, 0.13671875, 0.139892578125, 0.100830078125, 0.04998779296875, 0.1236572265625, 0.20361328125, 0.018585205078125, 0.19...

embed

47800046_c0

47800046

haskell

0

Title: Augmenting type aliases in elm or haskell Problem title: Augmenting type aliases in elm or haskell Tags: haskell, elm Problem: Augmenting type aliases in elm or haskell Say I have a type in elm (0.18) like this: type alias CatSimple = { color : String , age : Int , name : String , breed : String } My project req...

Augmenting type aliases in elm or haskell Augmenting type aliases in elm or haskell haskell elm Augmenting CatSimple CatComplex Bool Augmenting type aliases in elm or haskell Say I have a type in elm (0.18) like this: My project requires that I also have a type that has all the fields of the previous one, but with a fe...

[ 0.004974365234375, 0.0128173828125, 0.01080322265625, 0.0341796875, 0.003692626953125, -0.006622314453125, -0.01171875, 0.0125732421875, -0.0150146484375, -0.0026397705078125, 0.004730224609375, -0.003936767578125, -0.0079345703125, 0.0194091796875, 0.003265380859375, -0.00595092773437...

[ 23177, 674, 214, 10644, 55109, 90, 88, 39, 707, 1556, 142508, 23, 18826, 8859, 33209, 10770, 44974, 2460, 929, 765, 22085, 5, 56641, 1884, 13452, 144570, 2843, 756, 44457, 96362, 10846, 78301, 3871, 15190, 15700, 37629, 19048, 84079, 9620, ...

[ 0.1558837890625, 0.1651611328125, 0.028839111328125, 0.2197265625, 0.2071533203125, 0.1126708984375, 0.1580810546875, 0.196533203125, 0.06787109375, 0.113037109375, 0.2265625, 0.03411865234375, 0.140869140625, 0.1302490234375, 0.1929931640625, 0.0882568359375, 0.1793212890625, 0.06...

embed

48731094_c1

48731094

haskell

1

BS.ByteString) <> bs)) output :: Consumer BS.ByteString IO () output = toConsumer $ CL.mapM_ BS.putStrLn _ <- forkIO (sourceProcessWithStreams chat input output output >> pure ()) pure req With newer lts it seems like the problem is not with communication via TQueue , as uncommenting the line which prints content from...

[ 0.006317138671875, 0.015869140625, -0.0205078125, 0.00164031982421875, 0.0078125, -0.003753662109375, 0.0040283203125, -0.022216796875, -0.0081787109375, -0.02197265625, -0.011962890625, 0.007293701171875, 0.0216064453125, 0.02490234375, -0.0029144287109375, 0.00469970703125, -0.0020...

[ 84145, 5, 75358, 67, 71713, 214, 876, 7, 16, 140992, 76980, 56, 17780, 2203, 47, 11935, 11832, 3650, 46323, 62346, 594, 7077, 100, 92, 60427, 10752, 26531, 194583, 115061, 3245, 107730, 34166, 456, 864, 3525, 96, 933, 2967, 959, 36398, ...

[ 0.171875, 0.0170745849609375, 0.1016845703125, 0.07012939453125, 0.1817626953125, 0.0849609375, 0.055877685546875, 0.08123779296875, 0.01190185546875, 0.197265625, 0.208251953125, 0.1129150390625, 0.2027587890625, 0.0155792236328125, 0.1373291015625, 0.031097412109375, 0.217651367187...

embed

77233248_c0

77233248

haskell

0

Title: Does GHC reuse recursive function computations? Problem title: Does GHC reuse recursive function computations? Tags: optimization, recursion, haskell Problem: Does GHC reuse recursive function computations? Let's say I have the following function myFunction :: Integer->Integer->Integer->Rational myFunction n m l...

Does GHC reuse recursive function computations? Does GHC reuse recursive function computations? optimization recursion haskell Does GHC Integer Rational l-1 n-1 m-1 Does GHC reuse recursive function computations? Let's say I have the following function The details are not so important, the key point being that in order...

[ -0.015380859375, 0.003997802734375, 0.01806640625, 0.00103759765625, 0.0006103515625, -0.003997802734375, -0.0201416015625, -0.01373291015625, -0.007232666015625, -0.015869140625, 0.0106201171875, 0.002532958984375, 0.012939453125, -0.00909423828125, 0.0123291015625, 0.00848388671875, ...

[ 101790, 527, 73265, 156883, 195625, 5844, 32354, 181135, 5256, 87235, 1830, 1556, 142508, 44401, 2552, 43315, 96, 5759, 653, 347, 25632, 41653, 5526, 22799, 151575, 3559, 5955, 18151, 27117, 86869, 2967, 141, 5046, 39, 12989, 30646, 23937, 58...

[ 0.0821533203125, 0.1357421875, 0.2431640625, 0.254638671875, 0.2237548828125, 0.1435546875, 0.1875, 0.1827392578125, 0.07958984375, 0.1513671875, 0.0255279541015625, 0.09564208984375, 0.20849609375, 0.1588134765625, 0.156494140625, 0.08758544921875, 0.1097412109375, 0.1455078125, ...

embed

37577227_c0

37577227

haskell

0

Title: Simple Haskell program not behaving correct Problem title: Simple Haskell program not behaving correct Tags: haskell Problem: Simple Haskell program not behaving correct I'm new to Haskell and trying to write simple program to find maximal element and it's index from intput. I receive values to compare one by on...

Simple Haskell program not behaving correct Simple Haskell program not behaving correct haskell Simple Haskell input_line INNER CHECK OUTER Simple Haskell program not behaving correct I'm new to Haskell and trying to write simple program to find maximal element and it's index from intput. I receive values to compare on...

[ -0.01165771484375, 0.0034942626953125, 0.006744384765625, 0.0185546875, -0.00469970703125, 0.0220947265625, 0.01068115234375, 0.01446533203125, 0.0128173828125, -0.02880859375, 0.0089111328125, -0.0028076171875, -0.01513671875, -0.003570556640625, 0.012939453125, -0.013427734375, 0.0...

[ 60552, 20625, 142508, 1528, 959, 186, 528, 26785, 1556, 107730, 2256, 5881, 52952, 83556, 20572, 32616, 3525, 33022, 8781, 7413, 111340, 12830, 63262, 23, 18, 7077, 53299, 142424, 69101, 1632, 46540, 289, 104064, 142555, 77336, 18389, 568, 71...

[ 0.2000732421875, 0.15185546875, 0.2205810546875, 0.182373046875, 0.0885009765625, 0.03668212890625, 0.10595703125, 0.179443359375, 0.144775390625, 0.10491943359375, 0.097900390625, 0.1109619140625, 0.164306640625, 0.2110595703125, 0.1566162109375, 0.0960693359375, 0.01287841796875, ...

embed

60960469_c0

60960469

haskell

0

Title: How to properly implement a helper function in Haskell Problem title: How to properly implement a helper function in Haskell Tags: syntax-error, haskell, functional-programming Problem: How to properly implement a helper function in Haskell The 'gridList' function description: Takes two Integer inputs, x and y ,...

How to properly implement a helper function in Haskell How to properly implement a helper function in Haskell syntax-error haskell functional-programming How Haskell Integer x-1 y-1 Variable How to properly implement a helper function in Haskell The 'gridList' function description: Takes two Integer inputs, x and y , a...

[ -0.0035552978515625, 0.0155029296875, -0.004791259765625, -0.008544921875, -0.004119873046875, 0.0174560546875, -0.0142822265625, -0.00162506103515625, -0.00469970703125, -0.000286102294921875, 0.00146484375, -0.0283203125, 0.0089111328125, -0.01171875, 0.0262451171875, 0.0072631835937...

[ 11249, 155965, 29479, 4358, 56, 32354, 20625, 142508, 47, 10, 23, 6002, 86531, 188800, 1556, 123309, 44401, 1022, 5759, 113, 84572, 2886, 120067, 154663, 76811, 2561, 6626, 107730, 136, 30646, 5303, 370, 99726, 33636, 176866, 12638, 38750, 12...

[ 0.038330078125, 0.1746826171875, 0.220947265625, 0.258056640625, 0.2486572265625, 0.2021484375, 0.175537109375, 0.25244140625, 0.08258056640625, 0.005889892578125, 0.017333984375, 0.0224151611328125, 0.123779296875, 0.128173828125, 0.158203125, 0.131591796875, 0.1578369140625, 0.07...

embed

11396178_c0

11396178

haskell

0

Title: Haskell recursive function without stack overflow Problem title: Haskell recursive function without stack overflow Tags: haskell, recursion, stack-overflow, tail-recursion Problem: Haskell recursive function without stack overflow I have a recursive function which index a textile and if I use it for huge textfil...

Haskell recursive function without stack overflow Haskell recursive function without stack overflow haskell recursion stack-overflow tail-recursion Haskell Map M.Map Word TextLocation x:xs lineNumber-1 Haskell recursive function without stack overflow I have a recursive function which index a textile and if I use it fo...

[ -0.0135498046875, -0.003021240234375, -0.00078582763671875, 0.011474609375, -0.01318359375, -0.003082275390625, -0.00836181640625, -0.00811767578125, 0.01141357421875, -0.0185546875, -0.00112152099609375, -0.0096435546875, 0.00848388671875, 0.0159912109375, 0.031494140625, 0.0113525390...

[ 20625, 142508, 195625, 5844, 32354, 15490, 177261, 645, 118664, 1556, 1830, 5465, 46741, 107, 48650, 42719, 276, 5, 166179, 22543, 24129, 15363, 1022, 425, 13315, 26278, 5759, 63262, 67773, 4527, 58696, 7986, 29822, 32628, 17569, 2831, 2633, ...

[ 0.122314453125, 0.225341796875, 0.2188720703125, 0.1585693359375, 0.1536865234375, 0.140380859375, 0.1507568359375, 0.095947265625, 0.2247314453125, 0.1197509765625, 0.021087646484375, 0.1044921875, 0.2169189453125, 0.055999755859375, 0.157470703125, 0.1436767578125, 0.02577209472656...

embed

34302616_c0

34302616

haskell

0

Title: Can you define `Comonads` based on `Monads`? Problem title: Can you define `Comonads` based on `Monads`? Tags: transform, haskell, comonad, monads Problem: Can you define `Comonads` based on `Monads`? Okay, so let's say you have the type newtype Dual f a = Dual {dual :: forall r. f(a -> r)->r} As it turns out, w...

Can you define `Comonads` based on `Monads`? Can you define `Comonads` based on `Monads`? transform haskell comonad monads Can Comonads Monads Dual Comonad MonadPlus Reader Env Writer Traced State Store Can you define `Comonads` based on `Monads`? Okay, so let's say you have the type As it turns out, when f is a Comona...

[ -0.013427734375, -0.005950927734375, 0.0037994384765625, 0.0255126953125, 0.00543212890625, 0.0014801025390625, -0.026123046875, -0.011962890625, -0.00982666015625, -0.013427734375, -0.0096435546875, -0.01336669921875, -0.00109100341796875, 0.0186767578125, -0.008056640625, -0.00218200...

[ 4171, 61924, 10770, 2477, 6468, 35509, 46674, 712, 7, 98, 27198, 1556, 142508, 533, 9169, 2667, 6646, 60331, 114421, 71, 88225, 122636, 334, 2783, 4937, 37534, 22836, 14934, 10644, 3229, 1238, 83, 10, 16498, 81979, 4488, 3789, 3917, 10932, ...

[ 0.03558349609375, 0.2120361328125, 0.1556396484375, 0.197021484375, 0.2135009765625, 0.135498046875, 0.166015625, 0.2169189453125, 0.079345703125, 0.029571533203125, 0.205078125, 0.0936279296875, 0.1947021484375, 0.1595458984375, 0.2266845703125, 0.1143798828125, 0.1876220703125, 0...

embed

15039285_c1

15039285

haskell

1

but there they don't seem to mention how to expose the test and I don't seem to manage to make that run. I'm a bit at a loss now, I can run those quickcheck tests with quickcheck itself but not with cabal and I would like to have this to be able to quickly verify all my tests and code and use it in a Jenkins or so. An...

[ 0.0169677734375, -0.0025177001953125, -0.0113525390625, 0.00537109375, -0.01263427734375, -0.00927734375, -0.00165557861328125, -0.0032806396484375, 0.0220947265625, 0.0291748046875, -0.0218505859375, 0.006317138671875, 0.01123046875, 0.002777099609375, 0.004913330078125, 0.00885009765...

[ 41392, 3642, 47, 172554, 70, 3034, 111240, 3249, 11675, 86669, 831, 8382, 63773, 78292, 109921, 68034, 678, 109524, 1884, 69405, 493, 40383, 756, 18151, 4527, 234339, 6528, 37842, 3004, 63559, 52721, 11435, 21373, 17368, 185688, 143161, 13380, ...

[ 0.07098388671875, 0.0809326171875, 0.015380859375, 0.233154296875, 0.026885986328125, 0.255126953125, 0.0968017578125, 0.03204345703125, 0.10247802734375, 0.06048583984375, 0.03436279296875, 0.00531005859375, 0.1082763671875, 0.2607421875, 0.216064453125, 0.1304931640625, 0.040466308...

embed

22885638_c0

22885638

haskell

0

Title: Type checking and the Haskell hint interpreter library Problem title: Type checking and the Haskell hint interpreter library Tags: haskell, hint, types Problem: Type checking and the Haskell hint interpreter library How can I get this Haskell code to type check? aesonLensInterpreter :: String -> String -> Interp...

Type checking and the Haskell hint interpreter library Type checking and the Haskell hint interpreter library haskell hint types Type Haskell Interpreter Maybe Value Prelude Nothing Data.Map Just Control.Lens Data.Aeson.Lens Data.Aeson OverloadedStrings ToJSON Type checking and the Haskell hint interpreter library How ...

[ -0.017333984375, -0.0216064453125, -0.002471923828125, 0.0133056640625, -0.0233154296875, 0.00457763671875, 0.00927734375, 0.00543212890625, -0.0159912109375, -0.036865234375, -0.006072998046875, 0.01019287109375, 0.00921630859375, -0.011474609375, 0.017578125, -0.00921630859375, 0.0...

[ 60457, 175199, 136, 20625, 142508, 5122, 29481, 35773, 1556, 18, 52895, 5337, 56359, 83425, 190060, 1914, 822, 182747, 11809, 166179, 9563, 27131, 866, 1755, 191, 90, 9578, 63033, 71713, 717, 1375, 58627, 831, 2046, 903, 18151, 47, 10644, 1...

[ 0.2225341796875, 0.18994140625, 0.023651123046875, 0.1221923828125, 0.2037353515625, 0.1314697265625, 0.104736328125, 0.0732421875, 0.0994873046875, 0.020355224609375, 0.1829833984375, 0.07635498046875, 0.1474609375, 0.08001708984375, 0.138671875, 0.012054443359375, 0.07373046875, ...

embed

48045500_c0

48045500

haskell

0

Title: function that accepts a function and a list and returns boolean Problem title: function that accepts a function and a list and returns boolean Tags: function, functional-programming, haskell Problem: function that accepts a function and a list and returns boolean I am very new to Haskell and functional programmi...

function that accepts a function and a list and returns boolean function that accepts a function and a list and returns boolean function functional-programming haskell Foldable Bool function that accepts a function and a list and returns boolean I am very new to Haskell and functional programming. I am trying to implem...

[ 0.006256103515625, -0.007049560546875, 0.0120849609375, 0.01324462890625, -0.008056640625, 0.033447265625, -0.005767822265625, 0.004302978515625, 0.0067138671875, -0.00885009765625, 0.0123291015625, -0.0208740234375, 0.0014190673828125, 0.01312255859375, -0.005035400390625, -0.00244140...

[ 32354, 450, 26946, 7, 136, 5303, 30646, 337, 31, 34677, 123309, 28966, 1556, 142508, 30077, 71, 2886, 2460, 929, 3525, 20625, 56037, 31577, 29479, 66211, 35064, 151313, 29568, 2174, 19713, 1632, 35735, 98320, 120262, 4488, 35874, 178851, 4832...

[ 0.2315673828125, 0.06854248046875, 0.2156982421875, 0.0743408203125, 0.145263671875, 0.20068359375, 0.18505859375, 0.06317138671875, 0.128173828125, 0.2027587890625, 0.1431884765625, 0.09088134765625, 0.09619140625, 0.2103271484375, 0.1368408203125, 0.08441162109375, 0.1248779296875,...

embed

8791768_c0

8791768

haskell

0

Title: Haskell: selecting lists from a list when a condition is true Problem title: Haskell: selecting lists from a list when a condition is true Tags: list, select, haskell Problem: Haskell: selecting lists from a list when a condition is true i'm trying to select some lists from a list when a condition is true, somet...

Haskell: selecting lists from a list when a condition is true Haskell: selecting lists from a list when a condition is true list select haskell a Haskell File Integer Show coment1 coment2 coment3 Haskell: selecting lists from a list when a condition is true i'm trying to select some lists from a list when a condition i...

[ -0.00604248046875, -0.007598876953125, 0.00689697265625, 0.01806640625, -0.020263671875, -0.005859375, 0.008544921875, 0.00921630859375, 0.0101318359375, 0.0250244140625, 0.016845703125, -0.001861572265625, -0.0022125244140625, 0.01202392578125, -0.0142822265625, -0.0019378662109375, ...

[ 20625, 142508, 36849, 5303, 7, 1295, 3229, 35431, 83, 29568, 214, 1556, 42724, 44401, 17367, 552, 674, 363, 31577, 2053, 45646, 11627, 23351, 13267, 6868, 21771, 35773, 756, 102158, 25632, 903, 3871, 32354, 2101, 4283, 62539, 2174, 1902, 16...

[ 0.150634765625, 0.2425537109375, 0.189208984375, 0.2427978515625, 0.0653076171875, 0.0865478515625, 0.09002685546875, 0.2320556640625, 0.0875244140625, 0.201171875, 0.0262603759765625, 0.149658203125, 0.1536865234375, 0.1318359375, 0.166748046875, 0.0643310546875, 0.139892578125, 0...

embed

25080979_c0

25080979

haskell

0

Title: Why is parser combinator "seq" defined with "bind" and "return"? Problem title: Why is parser combinator "seq" defined with "bind" and "return"? Tags: haskell, functional-programming, parsing Problem: Why is parser combinator "seq" defined with "bind" a...

Why is parser combinator "seq" defined with "bind" and "return"? Why is parser combinator "seq" defined with "bind" and "return"? haskell functional-programming parsing Why Parser Why is parser combinator "seq" defined with "bind" and "return"? I am reading th...

[ -0.0218505859375, 0.041748046875, -0.000514984130859375, 0.0400390625, 0.0194091796875, 0.0277099609375, -0.00213623046875, -0.017822265625, -0.00701904296875, -0.03271484375, -0.005279541015625, -0.00836181640625, -0.004669189453125, 0.028076171875, -0.01129150390625, 0.006591796875, ...

[ 44084, 366, 2189, 22321, 1290, 184, 864, 61924, 678, 89817, 136, 65395, 19, 1556, 142508, 123309, 28966, 2392, 83, 71, 22230, 28219, 17368, 40, 35064, 37105, 7, 1314, 8512, 370, 99726, 50339, 163, 46048, 45258, 71864, 2967, 65508, 2667, 1...

[ 0.1424560546875, 0.166259765625, 0.1884765625, 0.2418212890625, 0.1651611328125, 0.15380859375, 0.2298583984375, 0.1839599609375, 0.0777587890625, 0.2156982421875, 0.0938720703125, 0.1947021484375, 0.0985107421875, 0.077392578125, 0.17724609375, 0.0877685546875, 0.0345458984375, 0....

embed

26416821_c0

26416821

haskell

0

Title: Deriving a Generic instance of my type doesn't automatically create other instances as intended Problem title: Deriving a Generic instance of my type doesn't automatically create other instances as intended Tags: haskell, generics Problem: Deriving a Generic instance of my type doesn't automatically cr...

Deriving a Generic instance of my type doesn't automatically create other instances as intended Deriving a Generic instance of my type doesn't automatically create other instances as intended haskell generics Data.Binary GHC.Generics Deriving Generic LANGUAGE DeriveGeneric BinaryTest Option Yes Binary Derivin...

[ 0.017822265625, 0.005126953125, 0.010498046875, 0.00079345703125, 0.011474609375, 0.01708984375, 0.013671875, -0.0164794921875, 0.01434326171875, 0.00994873046875, -0.0205078125, -0.017333984375, 0.0123291015625, 0.01513671875, -0.0196533203125, 0.01141357421875, 0.006256103515625, ...

[ 1310, 14, 6496, 88342, 1771, 110527, 759, 10644, 22027, 3768, 18, 191082, 28282, 3789, 237, 179140, 111, 1556, 142508, 189534, 11809, 571, 73, 6635, 527, 73265, 135932, 12259, 98064, 5844, 54092, 111337, 86769, 1294, 31577, 139392, 114122, 99...

[ 0.140869140625, 0.06927490234375, 0.07421875, 0.2056884765625, 0.1190185546875, 0.222412109375, 0.015533447265625, 0.15869140625, 0.050537109375, 0.0280303955078125, 0.0794677734375, 0.1842041015625, 0.1124267578125, 0.052978515625, 0.0355224609375, 0.1241455078125, 0.03167724609375,...

embed

7501037_c1

7501037

haskell

1

Content MyType where parseContents = do { e@(Elem t _ _) <- elementWith (flip isPrefixOf) ["B","A"] ; case t of _ | "B" `isPrefixOf` t -> interior e $ fmap B parseContents | "A" `isPrefixOf` t -> interior e $ return A } toContents v@A = [mkElemC (showConstr 0 (toHType v)) []] toContents v@(B aa) = [mkElemC (showConstr ...

[ -0.0003185272216796875, 0.01458740234375, -0.0147705078125, 0.00225830078125, 0.011962890625, 0.004791259765625, -0.00848388671875, -0.0281982421875, 0.0106201171875, -0.026123046875, 0.01434326171875, -0.0016632080078125, 0.01116943359375, -0.0238037109375, 0.00933837890625, 0.0061340...

[ 70870, 2646, 196707, 7440, 366, 184, 11935, 25352, 7, 54, 28, 981, 7623, 195, 808, 12830, 194583, 21392, 83, 19273, 55923, 132887, 571, 7225, 111, 164, 14566, 3650, 1238, 62346, 335, 284, 30646, 47, 81, 19201, 441, 31374, 9297, 757, 188...

[ 0.298828125, 0.18798828125, 0.32080078125, 0.055389404296875, 0.15869140625, 0.129638671875, 0.1219482421875, 0.2413330078125, 0.06060791015625, 0.0657958984375, 0.098388671875, 0.04254150390625, 0.009918212890625, 0.0989990234375, 0.1077880859375, 0.1397705078125, 0.1612548828125, ...

embed

41727562_c0

41727562

haskell

0

Title: Haskell - no output from within StateT monad Problem title: Haskell - no output from within StateT monad Tags: haskell Problem: Haskell - no output from within StateT monad Trying to familiarize myself with monad transformers, I wrote the following piece of code: data GlobalState = GlobalState { rng :: StdGen } ...

Haskell - no output from within StateT monad Haskell - no output from within StateT monad haskell within Haskell StateT GlobalState StdGen See Haskell - no output from within StateT monad Trying to familiarize myself with monad transformers, I wrote the following piece of code: The idea was to initialize state, use it ...

[ -0.01177978515625, 0.01177978515625, -0.0194091796875, -0.0228271484375, 0.00604248046875, 0.000652313232421875, 0.00750732421875, -0.0150146484375, -0.026123046875, 0.0006256103515625, 0.01385498046875, 0.013671875, -0.019287109375, 0.0269775390625, -0.00186920166015625, -0.005859375,...

[ 20625, 142508, 110, 140992, 1295, 28032, 22836, 618, 2667, 712, 1556, 13453, 135206, 2907, 105376, 6872, 27198, 18151, 6528, 61475, 20650, 11341, 4527, 17780, 22631, 30646, 111719, 44691, 4734, 81779, 398, 33662, 62163, 28412, 3884, 71713, 866,...

[ 0.138916015625, 0.2421875, 0.126953125, 0.226806640625, 0.066650390625, 0.1700439453125, 0.1341552734375, 0.134033203125, 0.0989990234375, 0.13623046875, 0.120361328125, 0.0914306640625, 0.131591796875, 0.100830078125, 0.151123046875, 0.081298828125, 0.1556396484375, 0.032043457031...

embed

43419562_c0

43419562

haskell

0

Title: Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype Problem title: Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype Tags: aeson, haskell Problem: Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtyp...

Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype Automatically deriving toJSON/fromJSON using the instances of the inner type of a newtype aeson haskell the Automatically PersonName Text PetName ToJSON FromJSON Automatically deriving toJSON/fromJSON using the instances of the in...

[ 0.003448486328125, -0.0003509521484375, -0.000701904296875, 0.0213623046875, -0.01031494140625, 0.0169677734375, 0.006683349609375, 0.0220947265625, -0.00872802734375, -0.00958251953125, -0.00531005859375, 0.034423828125, -0.0029296875, 0.0111083984375, 0.0074462890625, -0.0185546875, ...

[ 51719, 71407, 16406, 6496, 47, 1375, 58627, 64, 161063, 17368, 110527, 75414, 10644, 3525, 50986, 10, 90, 191, 1556, 142508, 15270, 163612, 24129, 26516, 717, 28090, 18151, 4527, 5915, 21635, 41361, 96, 47754, 71864, 1297, 123055, 97841, 3235...

[ 0.1927490234375, 0.06463623046875, 0.1607666015625, 0.06097412109375, 0.1871337890625, 0.146484375, 0.2120361328125, 0.042755126953125, 0.13232421875, 0.016998291015625, 0.188232421875, 0.149658203125, 0.1776123046875, 0.10589599609375, 0.251708984375, 0.01275634765625, 0.02589416503...

embed

54886646_c0

54886646

haskell

0

Title: what is an ambigous type in the context with the function? Problem title: what is an ambigous type in the context with the function? Tags: haskell Problem: what is an ambigous type in the context with the function? I am reading the following doc about functional dependencies. On the page 5, it describes the ambi...

what is an ambigous type in the context with the function? what is an ambigous type in the context with the function? haskell Collects what is an ambigous type in the context with the function? I am reading the following doc about functional dependencies. On the page 5, it describes the ambiguous type: I have a few que...

[ 0.0224609375, -0.0068359375, 0.00823974609375, 0.0322265625, 0.004486083984375, 0.01007080078125, -0.030029296875, 0.01025390625, -0.00628662109375, 0.0074462890625, 0.01495361328125, -0.0089111328125, -0.00213623046875, 0.0091552734375, 0.0120849609375, 0.005462646484375, -0.0003089...

[ 142, 920, 20828, 223, 10644, 23, 43701, 678, 32354, 1556, 142508, 138521, 2367, 123309, 42548, 12282, 10821, 4865, 83, 66161, 53418, 142027, 61924, 484, 109109, 13579, 79507 ]

[ 0.0704345703125, 0.1732177734375, 0.1607666015625, 0.1624755859375, 0.22705078125, 0.0139923095703125, 0.1773681640625, 0.1044921875, 0.1180419921875, 0.10693359375, 0.194091796875, 0.1278076171875, 0.00018310546875, 0.0875244140625, 0.1160888671875, 0.2158203125, 0.173828125, 0.00...

embed

6088540_c0

6088540

haskell

0

Title: How to automatically translate pure code into code that uses mutable arrays for efficiency? Problem title: How to automatically translate pure code into code that uses mutable arrays for efficiency? Tags: optimization, mutable, haskell, code-generation, arrays Problem: How to automatically translate pure code in...

How to automatically translate pure code into code that uses mutable arrays for efficiency? How to automatically translate pure code into code that uses mutable arrays for efficiency? optimization mutable haskell code-generation arrays How How to automatically translate pure code into code that uses mutable arrays for ...

[ 0.01220703125, 0.005126953125, 0.01287841796875, -0.01055908203125, -0.007568359375, 0.01385498046875, -0.008056640625, -0.00543212890625, 0.00787353515625, -0.027587890625, -0.018798828125, -0.00518798828125, -0.019287109375, -0.00439453125, 0.0023345947265625, 0.006927490234375, 0....

[ 11249, 191082, 3900, 19309, 34166, 18151, 3934, 4527, 842, 22819, 10298, 4778, 100, 227066, 47, 87235, 1556, 142508, 48281, 20625, 60892, 35166, 46876, 3917, 123309, 59121, 9433, 40101, 5303, 561, 15490, 36716, 114419, 139392, 2806, 11675, 1699...

[ 0.058502197265625, 0.23291015625, 0.1826171875, 0.1839599609375, 0.22412109375, 0.2103271484375, 0.1295166015625, 0.05426025390625, 0.1614990234375, 0.1915283203125, 0.1260986328125, 0.1695556640625, 0.0484619140625, 0.1741943359375, 0.020965576171875, 0.093994140625, 0.0823364257812...

embed

11929657_c0

11929657

haskell

0

Title: How can I specify which LLVM binaries GHC should use? Problem title: How can I specify which LLVM binaries GHC should use? Tags: llvm, haskell, ghc, compilation Problem: How can I specify which LLVM binaries GHC should use? I have successfully built PortFusion with the brand new 64-bit GHC 7.6.1 Release Candidat...

How can I specify which LLVM binaries GHC should use? How can I specify which LLVM binaries GHC should use? llvm haskell ghc compilation How LLVM GHC PortFusion mingw64 optlo-O3 Main.hs How can I specify which LLVM binaries GHC should use? I have successfully built PortFusion with the brand new 64-bit GHC 7.6.1 Release...

[ 0.0030059814453125, -0.0147705078125, 0.0054931640625, 0.01611328125, 0.004364013671875, -0.0037994384765625, -0.015625, -0.0113525390625, -0.01055908203125, 0.0040283203125, 0.01287841796875, -0.020751953125, 0.010498046875, 0.000545501708984375, 0.01287841796875, 0.006317138671875, ...

[ 11249, 40140, 18929, 3129, 99954, 47599, 23035, 10484, 527, 73265, 5608, 4527, 831, 87, 3723, 39, 1556, 142508, 31380, 238, 98352, 13791, 80163, 6889, 46996, 434, 13307, 43922, 365, 670, 363, 12321, 5, 127, 65771, 88303, 678, 8796, 7911, ...

[ 0.054931640625, 0.19189453125, 0.1219482421875, 0.050689697265625, 0.114990234375, 0.256103515625, 0.2213134765625, 0.1162109375, 0.0892333984375, 0.2274169921875, 0.066650390625, 0.1304931640625, 0.006103515625, 0.00128173828125, 0.1263427734375, 0.1416015625, 0.08599853515625, 0....

embed

15823805_c0

15823805

haskell

0

Title: Interpreting unsigned integers as signed while widening Problem title: Interpreting unsigned integers as signed while widening Tags: integer, haskell Problem: Interpreting unsigned integers as signed while widening Suppose I've got a lot of values of type Word8 , Word16 , and Word32 lying around. I want to widen...

Interpreting unsigned integers as signed while widening Interpreting unsigned integers as signed while widening integer haskell Interpreting Word8 Word16 Word32 Int64 convert8 Bool Int8 Main Word Interpreting unsigned integers as signed while widening Suppose I've got a lot of values of type Word8 , Word16 , and Word32...

[ -0.0184326171875, -0.00787353515625, 0.01226806640625, 0.005950927734375, -0.0213623046875, 0.01446533203125, -0.00164031982421875, -0.0037384033203125, -0.0093994140625, 0.0255126953125, 0.0020599365234375, -0.03076171875, -0.0277099609375, 0.00714111328125, -0.0037689208984375, -0.00...

[ 5337, 4692, 51, 31304, 892, 26255, 237, 181141, 12960, 38134, 592, 297, 1556, 142508, 22543, 1019, 2485, 6460, 13307, 96760, 2460, 929, 360, 18, 12321, 5915, 142424, 10644, 16500, 10932, 3444, 19, 29481, 4343, 756, 33022, 32354, 5117, 10750...

[ 0.0975341796875, 0.1812744140625, 0.0926513671875, 0.1966552734375, 0.162109375, 0.0897216796875, 0.07977294921875, 0.2255859375, 0.08642578125, 0.1558837890625, 0.0811767578125, 0.0263214111328125, 0.107666015625, 0.2049560546875, 0.18017578125, 0.1923828125, 0.1622314453125, 0.18...

embed

17158510_c1

17158510

haskell

1

"" Loading package SDL-0.6.4 ... <interactive>: Unknown PEi386 section name `.idata$4' (while processing: C:\sdl\SDL-1.2.15\lib\libSDL.dll.a) ghc.exe: panic! (the 'impossible' happened) (GHC version 7.6.3 for i386-unknown-mingw32): loadArchive "C:\\sdl\\SDL-1.2.15\\lib\\libSDL.dll.a": failed Please report this as a GH...

[ -0.0038909912109375, 0.002716064453125, 0.0228271484375, 0.00531005859375, 0.0012359619140625, -0.0004215240478515625, -0.023681640625, 0.0255126953125, -0.02685546875, -0.0257568359375, -0.0029144287109375, -0.023193359375, -0.005615234375, -0.0042724609375, 0.00579833984375, 0.006195...

[ 44, 58, 228006, 98169, 159, 27502, 9, 122887, 617, 153, 10433, 71232, 992, 69723, 17051, 14, 105742, 40059, 9351, 5, 10135, 4369, 204610, 9433, 313, 20469, 294, 48400, 1837, 5612, 71, 1181, 11, 31380, 238, 46480, 249, 6402, 38, 464, 752...

[ 0.1341552734375, 0.0816650390625, 0.26708984375, 0.219482421875, 0.108642578125, 0.2467041015625, 0.025634765625, 0.2099609375, 0.20458984375, 0.028228759765625, 0.08154296875, 0.113525390625, 0.05780029296875, 0.18212890625, 0.097412109375, 0.06158447265625, 0.240478515625, 0.1394...

embed

53400522_c0

53400522

haskell

0

Title: How to check if the input is a specific type? Problem title: How to check if the input is a specific type? Tags: haskell Problem: How to check if the input is a specific type? data Term = TNull -- null term | TBool Bool -- boolean data | TInt Int -- integer data | TSymbol String -- symbolic data | TPair Term Ter...

How to check if the input is a specific type? How to check if the input is a specific type? haskell How Term TNull TBool Bool TInt TSymbol TPair TVar LVar Show Ord Substitution Map.Map How to check if the input is a specific type? I want to check if term is a logic variable. If it is not a logic variable or not in Subs...

[ -0.015869140625, 0.0198974609375, 0.0179443359375, 0.01031494140625, 0.002777099609375, -0.01214599609375, -0.0106201171875, -0.010986328125, -0.00125885009765625, -0.0101318359375, 0.015869140625, 0.0037994384765625, -0.0052490234375, 0.0162353515625, -0.0003108978271484375, 0.0077209...

[ 11249, 47, 12765, 2174, 107730, 83, 10, 29458, 10644, 1556, 142508, 2994, 39, 43806, 43386, 2460, 929, 660, 53, 36846, 7341, 1910, 147, 17367, 35379, 8273, 13480, 42719, 166179, 70, 3444, 13579, 62775, 77336, 959, 291, 26783, 30646, 11782, ...

[ 0.064453125, 0.086669921875, 0.2421875, 0.1466064453125, 0.26513671875, 0.10791015625, 0.069091796875, 0.2371826171875, 0.2353515625, 0.1319580078125, 0.232666015625, 0.159912109375, 0.120361328125, 0.1412353515625, 0.141845703125, 0.00372314453125, 0.07379150390625, 0.035339355468...

embed

28436633_c0

28436633

haskell

0

Title: How to get the Wadler/Leijen pretty printer to render braces on separate lines Problem title: How to get the Wadler/Leijen pretty printer to render braces on separate lines Tags: pretty-print, haskell Problem: How to get the Wadler/Leijen pretty printer to render braces on separate lines I'm using the wl-pprint-...

How to get the Wadler/Leijen pretty printer to render braces on separate lines How to get the Wadler/Leijen pretty printer to render braces on separate lines pretty-print haskell How Wadler Leijen TeXComm TeXArg How to get the Wadler/Leijen pretty printer to render braces on separate lines I'm using the wl-pprint-extra...

[ -0.025634765625, -0.007171630859375, -0.0125732421875, -0.031005859375, -0.01251220703125, 0.00445556640625, 0.004180908203125, -0.015869140625, 0.00518798828125, 0.01483154296875, 0.00335693359375, 0.01019287109375, 0.0157470703125, -0.01312255859375, 0.0036163330078125, 0.00433349609...

[ 11249, 2046, 92009, 603, 5267, 14, 1390, 28875, 110264, 47, 89159, 1620, 5170, 98, 84797, 124519, 64, 35662, 1556, 142508, 9335, 1413, 1542, 10770, 39, 65415, 10566, 148, 141, 254, 112779, 98169, 239, 10476, 224588, 1391, 27781, 140992, 126...

[ 0.04217529296875, 0.067626953125, 0.14453125, 0.1805419921875, 0.0217132568359375, 0.0609130859375, 0.1837158203125, 0.185546875, 0.20849609375, 0.034210205078125, 0.1700439453125, 0.195556640625, 0.146484375, 0.0303802490234375, 0.1798095703125, 0.151123046875, 0.0048828125, 0.145...

embed

48619450_c1

48619450

haskell

1

-> \n -> case n of Zero -> f Succ n' -> z n') (\n -> Nothing) applmatch :: Nat -> Nat -> Maybe () applmatch x = appl (match x) The fusion can be verified by inspecting Core with -ddump-simpl . Now we would like to do the same for Tree . data Tree = Leaf | Node Tree Tree data TreeMap a = TreeMap { tm_leaf :: Maybe a, t...

[ -0.0142822265625, 0.013671875, 0.001800537109375, -0.0072021484375, 0.01495361328125, 0.007781982421875, -0.0125732421875, -0.004425048828125, 0.03173828125, -0.018310546875, -0.00970458984375, -0.014404296875, 0.0004291534423828125, 0.01123046875, 0.017822265625, -0.0181884765625, 0...

[ 33079, 7225, 653, 111, 83947, 1238, 1832, 10060, 25, 97, 182747, 4027, 141, 98753, 68875, 83425, 1022, 2203, 119485, 493, 47314, 134071, 31365, 54645, 2676, 116120, 1884, 101344, 2053, 636, 2407, 438, 166179, 10, 133, 157, 62731, 31678, 939...

[ 0.00079345703125, 0.106689453125, 0.0711669921875, 0.07037353515625, 0.191162109375, 0.0911865234375, 0.1300048828125, 0.16748046875, 0.0253753662109375, 0.07757568359375, 0.1414794921875, 0.117431640625, 0.0703125, 0.253662109375, 0.1728515625, 0.2183837890625, 0.036865234375, 0.0...

embed

65870923_c0

65870923

haskell

0

Title: Trouble instancing Eq in my Relation data type Problem title: Trouble instancing Eq in my Relation data type Tags: haskell Problem: Trouble instancing Eq in my Relation data type I'm stuck instancing the following: data Rel a = R [(a,a)] deriving (Read, Show) listaPares:: Rel a -> [(a,a)] listaPares (R rel) = re...

Trouble instancing Eq in my Relation data type Trouble instancing Eq in my Relation data type haskell Trouble Relation Rel Read Show Trouble instancing Eq in my Relation data type I'm stuck instancing the following: Rel is a datatype that holds a list of tuples, and the elements inside the tuples can be anything, from ...

[ -0.007232666015625, 0.031494140625, 0.01104736328125, 0.01495361328125, 0.0130615234375, -0.00421142578125, 0.00897216796875, -0.01397705078125, 0.0135498046875, -0.00689697265625, -0.0098876953125, 0.01214599609375, 0.0023193359375, -0.00567626953125, -0.0281982421875, 0.0028228759765...

[ 119671, 2661, 50631, 21896, 241, 864, 23, 759, 116822, 2053, 10644, 1556, 142508, 853, 141, 4764, 17367, 179933, 25632, 50986, 16401, 5303, 370, 99726, 80854, 46132, 831, 23937, 892, 21441, 55300, 5875, 28636, 90, 51776, 30646, 45258, 6183, ...

[ 0.166748046875, 0.0941162109375, 0.2178955078125, 0.117919921875, 0.101806640625, 0.227294921875, 0.038055419921875, 0.05438232421875, 0.2255859375, 0.1195068359375, 0.165283203125, 0.1358642578125, 0.197509765625, 0.16650390625, 0.1649169921875, 0.1114501953125, 0.1041259765625, 0...

embed

32668969_c0

32668969

haskell

0

Title: trace can give 'inversion' of processing in folds Problem title: trace can give 'inversion' of processing in folds Tags: haskell Problem: trace can give 'inversion' of processing in folds When I compile the "modified sum" (« _sum_folds.hs ») file : *--------------------------- [ import Debug....

trace can give 'inversion' of processing in folds trace can give 'inversion' of processing in folds haskell Debug.Trace _sum Compiling Main _sum_folds Integer trace can give 'inversion' of processing in folds When I compile the "modified sum" (« _sum_folds.hs ») file : ... and apply it to '[1..5]', ...

[ 0.004730224609375, 0.00372314453125, 0.0206298828125, 0.035400390625, -0.020751953125, 0.017333984375, -0.00933837890625, 0.005279541015625, -0.0020599365234375, -0.0111083984375, 0.01806640625, -0.0067138671875, -0.005523681640625, 0.0030975341796875, 0.0047607421875, 0.01385498046875...

[ 144851, 831, 8337, 3768, 73, 46354, 111, 9433, 214, 23, 42822, 7, 1556, 142508, 262, 85779, 28542, 329, 11832, 15612, 49725, 12321, 44401, 9969, 1340, 13415, 47314, 10554, 127, 11435, 59911, 758, 80596, 141, 83, 14315, 87388, 37223, 7639, ...

[ 0.280029296875, 0.0780029296875, 0.1002197265625, 0.044158935546875, 0.10662841796875, 0.2249755859375, 0.0171966552734375, 0.126953125, 0.056671142578125, 0.0802001953125, 0.19775390625, 0.03643798828125, 0.098388671875, 0.21044921875, 0.06103515625, 0.1976318359375, 0.177001953125,...

embed

55549883_c0

55549883

haskell

0

Title: Define takeword, dropword and words function in Haskell Problem title: Define takeword, dropword and words function in Haskell Tags: haskell Problem: Define takeword, dropword and words function in Haskell I am trying to Define a takeWord function in Haskell which takes a string and returns its first word. It sh...

Define takeword, dropword and words function in Haskell Define takeword, dropword and words function in Haskell haskell Define Haskell x:xs Main Char Define takeword, dropword and words function in Haskell I am trying to Define a takeWord function in Haskell which takes a string and returns its first word. It should ta...

[ 0.016357421875, 0.007568359375, 0.00133514404296875, 0.0164794921875, -0.01153564453125, -0.007049560546875, 0.01708984375, -0.0028076171875, -0.00244140625, 0.005218505859375, 0.0167236328125, -0.01348876953125, -0.00518798828125, 0.01953125, -0.00836181640625, 0.0152587890625, 0.01...

[ 262, 64552, 5646, 47416, 36069, 136, 34153, 32354, 20625, 142508, 23, 1556, 1022, 12, 425, 12321, 21656, 4, 164805, 51776, 79315, 30646, 5117, 2565, 5608, 12638, 62816, 1733, 86595, 3564, 24189, 32628, 124850, 8108, 21373, 1284, 10588, 54304,...

[ 0.052764892578125, 0.1396484375, 0.1871337890625, 0.2498779296875, 0.20263671875, 0.06890869140625, 0.2379150390625, 0.20263671875, 0.1279296875, 0.2398681640625, 0.0276336669921875, 0.09808349609375, 0.051025390625, 0.05816650390625, 0.07958984375, 0.0687255859375, 0.099853515625, ...

embed

11214167_c0

11214167

haskell

0

Title: How to run Snap haskell webapp in production? Problem title: How to run Snap haskell webapp in production? Tags: haskell, haskell-snap-framework Problem: How to run Snap haskell webapp in production? I've installed Snap/Haskell on my production Ubuntu server (on EC2), and checked-out my project - but how do I ru...

How to run Snap haskell webapp in production? How to run Snap haskell webapp in production? haskell haskell-snap-framework How Snap How to run Snap haskell webapp in production? I've installed Snap/Haskell on my production Ubuntu server (on EC2), and checked-out my project - but how do I run it? I mean, locally, I run ...

[ -0.00372314453125, 0.0174560546875, -0.00130462646484375, 0.00726318359375, -0.033203125, 0.0177001953125, -0.004669189453125, -0.004150390625, 0.00139617919921875, -0.0084228515625, -0.0035858154296875, -0.005767822265625, 0.00007343292236328125, -0.0015869140625, -0.002044677734375, ...

[ 11249, 47, 11675, 121190, 1556, 142508, 1467, 9007, 23, 36049, 7, 10957, 160328, 18244, 20600, 64, 6495, 759, 116890, 10723, 191, 59947, 10461, 12765, 13452, 3642, 54, 442, 4000, 1295, 75101, 13315, 76685, 1380, 678, 10002, 39642, 33342, 59...

[ 0.114990234375, 0.06201171875, 0.17919921875, 0.284912109375, 0.166015625, 0.258544921875, 0.1431884765625, 0.2325439453125, 0.1202392578125, 0.25927734375, 0.106201171875, 0.2169189453125, 0.09783935546875, 0.069091796875, 0.13232421875, 0.03387451171875, 0.120361328125, 0.0015869...

embed

11695373_c0

11695373

haskell

0

Title: Lazy decoding of a list with Data.Binary Problem title: Lazy decoding of a list with Data.Binary Tags: haskell, lazy-evaluation Problem: Lazy decoding of a list with Data.Binary I am lazily encoding lists using this code (taken from this SO question ): import Data.Binary newtype Stream a = Stream { unstream :: [...

Lazy decoding of a list with Data.Binary Lazy decoding of a list with Data.Binary haskell lazy-evaluation Data.Binary Lazy Stream Binary putWord8 x:xs getWord8 Integer Lazy decoding of a list with Data.Binary I am lazily encoding lists using this code (taken from this SO question ): The problem is that the decoding imp...

[ 0.002899169921875, 0.01531982421875, -0.0007171630859375, -0.005950927734375, 0.024169921875, 0.006134033203125, 0.00103759765625, 0.0024261474609375, 0.01385498046875, 0.0038299560546875, -0.0002613067626953125, -0.02685546875, 0.01153564453125, 0.01446533203125, -0.00250244140625, 0....

[ 239, 3285, 8, 587, 6238, 5303, 678, 11809, 571, 73, 6635, 1556, 142508, 21, 159258, 115061, 54092, 1294, 3884, 164805, 1019, 1022, 425, 44401, 708, 538, 22, 18151, 2967, 208124, 959, 33342, 1884, 5608, 11675, 3034, 98323, 127689, 24649, 9...

[ 0.1400146484375, 0.18359375, 0.1435546875, 0.1575927734375, 0.0621337890625, 0.1607666015625, 0.022796630859375, 0.100341796875, 0.027008056640625, 0.11865234375, 0.1243896484375, 0.06976318359375, 0.1617431640625, 0.133544921875, 0.1136474609375, 0.1181640625, 0.1483154296875, 0.0...

embed

18321516_c0

18321516

haskell

0

Title: 8 queens in Haskell, unknown error? Problem title: 8 queens in Haskell, unknown error? Tags: haskell, haskell-platform Problem: 8 queens in Haskell, unknown error? I'm trying to solve the 8 queens problem in Haskell without the use of any advanced functions, only with basic knowledge. I have come this far only b...

8 queens in Haskell, unknown error? 8 queens in Haskell, unknown error? haskell haskell-platform the Haskell y.hs:1:42 Num Bool Possible Compiling Main y.hs Failed 8 queens in Haskell, unknown error? I'm trying to solve the 8 queens problem in Haskell without the use of any advanced functions, only with basic knowledge...

[ 0.004364013671875, 0.01904296875, 0.03369140625, -0.007049560546875, 0.0081787109375, 0.01123046875, -0.00848388671875, -0.0031280517578125, -0.005126953125, -0.0257568359375, -0.0185546875, -0.0093994140625, 0.0031890869140625, -0.00848388671875, -0.0164794921875, -0.004150390625, -...

[ 382, 41, 1755, 23, 20625, 142508, 51, 69723, 19, 18499, 1556, 172121, 113, 127, 7, 19721, 33529, 52782, 2460, 929, 115861, 15612, 49725, 12321, 190355, 297, 31577, 86869, 2967, 15490, 175961, 32354, 678, 62822, 51359, 765, 1380, 903, 2060, ...

[ 0.22998046875, 0.196533203125, 0.1949462890625, 0.049224853515625, 0.164794921875, 0.2486572265625, 0.05517578125, 0.1551513671875, 0.03204345703125, 0.1722412109375, 0.141357421875, 0.142822265625, 0.1136474609375, 0.0960693359375, 0.030670166015625, 0.013397216796875, 0.18994140625...

embed

22882228_c0

22882228

haskell

0

Title: How to store a Haskell data type in an Unboxed Vector in continuous memory Problem title: How to store a Haskell data type in an Unboxed Vector in continuous memory Tags: haskell Problem: How to store a Haskell data type in an Unboxed Vector in continuous memory I would like to store a non-parametric, unpacked d...

How to store a Haskell data type in an Unboxed Vector in continuous memory How to store a Haskell data type in an Unboxed Vector in continuous memory haskell How Haskell Unboxed Vector Point3D UNPACK Vector.Unboxed Unbox How to store a Haskell data type in an Unboxed Vector in continuous memory I would like to store a ...

[ 0.022705078125, 0.024658203125, -0.00982666015625, 0.00640869140625, -0.000225067138671875, 0.021484375, -0.01263427734375, -0.01556396484375, 0.005157470703125, -0.0299072265625, -0.0128173828125, -0.01556396484375, 0.0106201171875, 0.016357421875, -0.0269775390625, 0.0223388671875, ...

[ 11249, 4343, 20625, 142508, 2053, 10644, 23, 992, 11728, 2609, 18770, 62005, 223, 98323, 142, 1556, 297, 41097, 363, 397, 8274, 98701, 605, 14256, 1884, 351, 6276, 186518, 51, 29102, 360, 173, 11809, 26455, 44084, 2806, 12601, 4271, 82365, ...

[ 0.049835205078125, 0.201171875, 0.1474609375, 0.261474609375, 0.142333984375, 0.221435546875, 0.05078125, 0.12353515625, 0.2210693359375, 0.1910400390625, 0.198974609375, 0.1402587890625, 0.055999755859375, 0.1619873046875, 0.013397216796875, 0.121337890625, 0.0799560546875, 0.1486...

embed

54019789_c0

54019789

haskell

0

Title: Where is the Monoid instance on Comparison defined? Problem title: Where is the Monoid instance on Comparison defined? Tags: monoids, haskell Problem: Where is the Monoid instance on Comparison defined? newtype Comparison a is defined in Data.Functor.Contravariant . In the version of this module defined in contr...

Where is the Monoid instance on Comparison defined? Where is the Monoid instance on Comparison defined? monoids haskell Where Monoid Comparison Data.Functor.Contravariant contravariant-1.5 Contravariant Semigroup Where is the Monoid instance on Comparison defined? newtype Comparison a is defined in Data.Functor.Contrav...

[ -0.01336669921875, -0.002410888671875, 0.014404296875, 0.023681640625, 0.0257568359375, 0.019775390625, 0.0067138671875, -0.00946044921875, 0.0224609375, -0.0021514892578125, -0.01446533203125, -0.004058837890625, 0.00982666015625, -0.003173828125, -0.00628662109375, -0.0101318359375, ...

[ 78662, 77879, 532, 110527, 98, 113307, 40514, 61924, 71, 22460, 30185, 1556, 142508, 11809, 97249, 18770, 11935, 1517, 162591, 2304, 42876, 45380, 84420, 51588, 83, 70, 3525, 50986, 10, 11389, 88996, 3647, 527, 73265, 3217, 173245, 19736, 108...

[ 0.098388671875, 0.2283935546875, 0.2392578125, 0.2890625, 0.1270751953125, 0.2239990234375, 0.197265625, 0.2216796875, 0.0958251953125, 0.173583984375, 0.17529296875, 0.1220703125, 0.21826171875, 0.0870361328125, 0.0692138671875, 0.118896484375, 0.0723876953125, 0.11962890625, 0....

embed

27171979_c0

27171979

haskell

0

Title: How can I constraint QuickCheck parameters, e.g. only use non-negative ints? Problem title: How can I constraint QuickCheck parameters, e.g. only use non-negative ints? Tags: quickcheck, haskell Problem: How can I constraint QuickCheck parameters, e.g. only use non-negative ints? I'm new to Haskell. It's very ni...

How can I constraint QuickCheck parameters, e.g. only use non-negative ints? How can I constraint QuickCheck parameters, e.g. only use non-negative ints? quickcheck haskell How QuickCheck e.g prop_Myfunc Bool Failed Exception Prelude How can I constraint QuickCheck parameters, e.g. only use non-negative ints? I'm new t...

[ -0.0274658203125, -0.0037689208984375, 0.00167083740234375, -0.006927490234375, -0.006683349609375, 0.0014190673828125, 0.00885009765625, -0.021240234375, -0.010498046875, -0.007415771484375, -0.00133514404296875, -0.01904296875, -0.004913330078125, 0.0164794921875, 0.0015716552734375, ...

[ 158, 2816, 4288, 89038, 202567, 171859, 4734, 4527, 351, 3331, 4935, 23, 933, 831, 63773, 78292, 1556, 142508, 25793, 31852, 16498, 238, 2460, 929, 190355, 5443, 63928, 1914, 822, 20625, 26267, 43658, 183871, 1884, 30022, 27781, 23742, 18, ...

[ 0.06927490234375, 0.168212890625, 0.11767578125, 0.1573486328125, 0.284423828125, 0.2200927734375, 0.07562255859375, 0.05902099609375, 0.148193359375, 0.158935546875, 0.1392822265625, 0.1143798828125, 0.10498046875, 0.005340576171875, 0.1107177734375, 0.2392578125, 0.0634765625, 0....

embed

46227562_c0

46227562

haskell

0

Title: Understanding the MonadIO Laws Problem title: Understanding the MonadIO Laws Tags: haskell Problem: Understanding the MonadIO Laws From source : module Control.Monad.IO.Class ( MonadIO(..) ) where -- | Monads in which 'IO' computations may be embedded. -- Any monad built by applying a sequence of monad transform...

Understanding the MonadIO Laws Understanding the MonadIO Laws haskell the Understanding MonadIO Laws Control.Monad.IO.Class Monads Any Instances Monad Lift Understanding the MonadIO Laws From source : What is meant by And in particular, what is meant by (m >>= f) ? Here m is a function on types and f a function on valu...

[ 0.0037078857421875, 0.000911712646484375, 0.0062255859375, 0.02294921875, 0.019775390625, 0.00135040283203125, 0.0003986358642578125, -0.00189971923828125, 0.004486083984375, 0.012939453125, 0.0155029296875, -0.0517578125, 0.00299072265625, 0.0064697265625, 0.01092529296875, -0.0100708...

[ 9626, 144057, 60331, 71, 17780, 36293, 70, 1556, 142508, 27131, 46674, 712, 140803, 6468, 28541, 116071, 166562, 7, 31344, 4865, 83, 131148, 390, 17311, 2367, 39, 6396, 1369, 1238, 16, 11853, 347, 32354, 98, 52895, 10, 142424, 450, 110, 2...

[ 0.09375, 0.063720703125, 0.1781005859375, 0.1219482421875, 0.2666015625, 0.1810302734375, 0.01422119140625, 0.091796875, 0.1954345703125, 0.1407470703125, 0.0173492431640625, 0.043365478515625, 0.127197265625, 0.0635986328125, 0.01177978515625, 0.0682373046875, 0.208740234375, 0.03...

embed

79501314_c0

79501314

haskell

0

Title: Showing Functor result in Haskell Problem title: Showing Functor result in Haskell Tags: typeclass, haskell, functor Problem: Showing Functor result in Haskell I have defined the following Functor with the following type class ... -- Let's suppose we want to create a functor that -- performs the opperation : -- ...

Showing Functor result in Haskell Showing Functor result in Haskell typeclass haskell functor a being Showing Functor Haskell Strength Stat Agility Constitution Show Then Type Inc Num Ambiguous Probable Potentially Ordering Defined GHC.Show characteristicsFunctor.hs:9:24 GHCi Showing Functor result in Haskell I have de...

[ 0.00701904296875, -0.01239013671875, -0.0054931640625, 0.017822265625, 0.0081787109375, -0.0021514892578125, 0.00933837890625, -0.036376953125, -0.00921630859375, 0.0140380859375, -0.0184326171875, -0.02978515625, -0.007476806640625, 0.026611328125, 0.0005950927734375, -0.0194091796875...

[ 17367, 214, 28670, 18770, 16750, 20625, 142508, 23, 10644, 67413, 1556, 7477, 8035, 24714, 449, 23888, 12342, 103133, 163965, 60457, 8942, 52782, 10250, 12282, 1250, 275, 229677, 81206, 5983, 527, 73265, 168660, 62816, 48242, 97249, 127, 1126, ...

[ 0.1689453125, 0.055755615234375, 0.1727294921875, 0.1951904296875, 0.172607421875, 0.1339111328125, 0.229248046875, 0.0146026611328125, 0.1397705078125, 0.162841796875, 0.117919921875, 0.149658203125, 0.0892333984375, 0.060546875, 0.037109375, 0.130126953125, 0.0875244140625, 0.093...

embed

8992040_c0

8992040

haskell

0

Title: Making Custom Instances of PersistBackend Problem title: Making Custom Instances of PersistBackend Tags: haskell, persistent, yesod Problem: Making Custom Instances of PersistBackend I have a monad transformer stack of the form: newtype T m a = T { unT :: StateT State (SqlPersist m) a } deriving (Monad, MonadSta...

Making Custom Instances of PersistBackend Making Custom Instances of PersistBackend haskell persistent yesod Making Custom Instances PersistBackend StateT State SqlPersist Monad MonadState Key MonadIO MonadBaseControl Making Custom Instances of PersistBackend I have a monad transformer stack of the form: And want to us...

[ -0.002288818359375, 0.021484375, 0.01348876953125, -0.01025390625, -0.0111083984375, 0.0052490234375, -0.004608154296875, -0.0205078125, 0.0079345703125, -0.04052734375, 0.00726318359375, 0.003326416015625, 0.005401611328125, 0.005035400390625, -0.0235595703125, 0.004364013671875, 0....

[ 13676, 214, 130664, 360, 116071, 111, 57309, 271, 152470, 3611, 1556, 142508, 70560, 2517, 2422, 23722, 22836, 618, 99247, 15277, 57702, 60331, 71, 135206, 26824, 17780, 63473, 175904, 2667, 712, 27198, 56, 177261, 3173, 3444, 4527, 183540, 1...

[ 0.1024169921875, 0.0230560302734375, 0.223388671875, 0.08203125, 0.2257080078125, 0.036376953125, 0.191162109375, 0.1280517578125, 0.2020263671875, 0.2059326171875, 0.10986328125, 0.2440185546875, 0.2392578125, 0.1026611328125, 0.1375732421875, 0.20751953125, 0.101318359375, 0.1617...

embed

35050730_c0

35050730

haskell

0

Title: I have problems understanding the syntax of this code. Can someone explain it line by line? Problem title: I have problems understanding the syntax of this code. Can someone explain it line by line? Tags: functional-programming, haskell Problem: I have problems understanding the syntax of this code. Can someone ...

I have problems understanding the syntax of this code. Can someone explain it line by line? I have problems understanding the syntax of this code. Can someone explain it line by line? functional-programming haskell Can Integer Bool n-1 I have problems understanding the syntax of this code. Can someone explain it line b...

[ -0.027099609375, 0.0155029296875, 0.01171875, 0.00872802734375, 0.0008087158203125, 0.0133056640625, 0.032958984375, -0.018798828125, 0.01141357421875, -0.0152587890625, -0.004180908203125, -0.0255126953125, -0.00860595703125, -0.0225830078125, -0.01483154296875, 0.00909423828125, -0...

[ 765, 44402, 100094, 6002, 86531, 903, 18151, 4171, 22008, 73342, 442, 13315, 390, 123309, 28966, 1556, 142508, 44401, 2460, 929, 653, 5759, 52080, 56037, 449, 217064, 24702, 30698, 29458, 134598, 7413, 1810, 2174, 83, 10, 20809, 707, 959, 2...

[ 0.010650634765625, 0.0911865234375, 0.1495361328125, 0.12548828125, 0.2410888671875, 0.06195068359375, 0.1881103515625, 0.126220703125, 0.0306396484375, 0.130615234375, 0.019561767578125, 0.16943359375, 0.03302001953125, 0.177734375, 0.0928955078125, 0.1044921875, 0.2222900390625, ...

embed

21144912_c0

21144912

haskell

0

Title: Control.Monad.Writer found in multiple packages haskell Problem title: Control.Monad.Writer found in multiple packages haskell Tags: haskell, cabal, hackage, ghc Problem: Control.Monad.Writer found in multiple packages haskell I tried to import the Control.Monad.Writer module like this: import Control.Monad.Writ...

Control.Monad.Writer found in multiple packages haskell Control.Monad.Writer found in multiple packages haskell haskell cabal hackage ghc Control.Monad.Writer Ambiguous monads-tf-0.1.0.1 mtl-2.1.1 Control.Monad.Writer found in multiple packages haskell I tried to import the Control.Monad.Writer module like this: ghc ve...

[ -0.004119873046875, 0.004730224609375, -0.004425048828125, 0.01177978515625, 0.0074462890625, -0.00457763671875, -0.0010528564453125, -0.0164794921875, -0.01043701171875, -0.01068115234375, 0.00066375732421875, -0.01031494140625, 0.00726318359375, -0.0113525390625, 0.00213623046875, 0....

[ 27131, 46674, 712, 1456, 2783, 56, 14037, 23, 48716, 98169, 1556, 142508, 109524, 85526, 4588, 31380, 238, 10250, 12282, 2667, 7, 420, 102014, 141, 5428, 83783, 37842, 24927, 5, 88996, 1884, 903, 11389, 2861, 120518, 25632, 18499, 21373, 29...

[ 0.225830078125, 0.1214599609375, 0.167236328125, 0.09222412109375, 0.1815185546875, 0.132568359375, 0.0985107421875, 0.0806884765625, 0.17431640625, 0.2254638671875, 0.104736328125, 0.20458984375, 0.254638671875, 0.1708984375, 0.01068115234375, 0.1480712890625, 0.148681640625, 0.09...

embed

73924436_c1

73924436

haskell

1

a = Graph [Node a] deriving Show However, what I am a bit unsure about is whether this representation makes it possible to insert new edges later on. With this definition a graph is just a list of nodes that in turn contains list of nodes they link/edge to. After doing research about how to represent a graph in Haskel...

[ -0.016845703125, 0.03076171875, -0.0004138946533203125, 0.024169921875, -0.0091552734375, 0.00848388671875, -0.0284423828125, -0.01043701171875, 0.0002346038818359375, -0.0113525390625, -0.0152587890625, -0.05908203125, 0.0091552734375, 0.01953125, -0.017578125, 0.0064697265625, 0.02...

[ 10, 2203, 6524, 11727, 5021, 112, 16406, 17367, 51646, 18811, 30482, 7722, 183540, 3525, 121303, 14432, 80934, 41382, 83, 1660, 5303, 110, 988, 70541, 3126, 297, 33636, 23, 20625, 142508, 49041, 25647, 61924, 10644, 164661, 438, 360, 48325, ...

[ 0.115234375, 0.07568359375, 0.2236328125, 0.25146484375, 0.128173828125, 0.109619140625, 0.078125, 0.2257080078125, 0.0450439453125, 0.184326171875, 0.020416259765625, 0.06170654296875, 0.160888671875, 0.0728759765625, 0.209716796875, 0.04052734375, 0.1513671875, 0.294189453125, ...

embed

67080550_c1

67080550

haskell

1

Flush stdout trim <$> getLine exitOnCtrlC :: IO String exitOnCtrlC = do tid <- myThreadId installHandler keyboardSignal (Catch (throwTo tid UserInterrupt)) Nothing solve :: String -> String solve = intercalate " + " . map show . sort . map readNum . splitOn "+" where readNum :: String -> Int readNum = read . trim main ...

[ -0.0159912109375, 0.0024261474609375, 0.006622314453125, 0.0225830078125, -0.00982666015625, 0.0224609375, 0.01092529296875, 0.000392913818359375, -0.017822265625, -0.0250244140625, -0.0257568359375, 0.00909423828125, -0.031982421875, 0.00093841552734375, 0.0054931640625, 0.00518798828...

[ 36157, 1495, 6138, 246, 1003, 85247, 4369, 2046, 93232, 82230, 20320, 4448, 141, 441, 17780, 23351, 54, 2936, 759, 39116, 568, 71, 20600, 135679, 603, 149186, 218723, 289, 76775, 15555, 7763, 53400, 44851, 9167, 18, 182747, 86869, 1940, 623...

[ 0.2490234375, 0.16357421875, 0.1688232421875, 0.0682373046875, 0.1676025390625, 0.2203369140625, 0.06573486328125, 0.06463623046875, 0.184814453125, 0.2225341796875, 0.13916015625, 0.1102294921875, 0.009857177734375, 0.09820556640625, 0.1890869140625, 0.1888427734375, 0.0056457519531...

embed

27381133_c0

27381133

haskell

0

Title: List based on right Kan extension Problem title: List based on right Kan extension Tags: category-theory, haskell Problem: List based on right Kan extension In the `` Kan Extensions for Program Optimisation '' by Ralf Hinze there is the definition of List type based on right Kan extension of the forgetful functo...

List based on right Kan extension List based on right Kan extension category-theory haskell List Kan Abstr Monoid Maybe Nothing Just List based on right Kan extension In the `` Kan Extensions for Program Optimisation '' by Ralf Hinze there is the definition of List type based on right Kan extension of the forgetful fun...

[ 0.0189208984375, 0.0033416748046875, 0.0274658203125, 0.01275634765625, 0.01092529296875, 0.0074462890625, -0.0228271484375, 0.00028228759765625, -0.0078125, -0.0020751953125, 0.01275634765625, -0.01531982421875, 0, -0.0031585693359375, 0.004486083984375, -0.001739501953125, 0.022338...

[ 32036, 35509, 7108, 2734, 111938, 98, 95487, 2347, 1556, 142508, 3157, 9297, 77879, 532, 83425, 182747, 9563, 224545, 7663, 43938, 17463, 19895, 731, 80934, 10644, 90820, 7844, 7477, 18770, 22460, 30185, 33233, 68034, 15122, 20625, 208124, 6192...

[ 0.231689453125, 0.126220703125, 0.1624755859375, 0.224853515625, 0.212646484375, 0.012603759765625, 0.16845703125, 0.0516357421875, 0.1063232421875, 0.2509765625, 0.05224609375, 0.09613037109375, 0.15234375, 0.105712890625, 0.2259521484375, 0.1439208984375, 0.00628662109375, 0.1917...

embed

22622816_c0

22622816

haskell

0

Title: Haskell parameter is not right? Problem title: Haskell parameter is not right? Tags: haskell Problem: Haskell parameter is not right? I am new haskell leaner, my code as follows: {-- snippet all --} {- | Our usual CustomColor type to play with -} data CustomColor = CustomColor {red :: Int, green :: Int, blue :: ...

Haskell parameter is not right? Haskell parameter is not right? haskell Haskell Our CustomColor Show Read FuncRec plus5func plus5 always0 Haskell parameter is not right? I am new haskell leaner, my code as follows: In the line "colorCalc=plus5func purple", why there are just one parameter("purple") after plus5func, act...

[ -0.005859375, -0.01080322265625, -0.00323486328125, 0.0228271484375, 0.00145721435546875, 0.003875732421875, -0.00830078125, -0.003326416015625, 0.00927734375, -0.00982666015625, -0.0079345703125, -0.01275634765625, -0.003753662109375, 0.022216796875, 0.004425048828125, -0.015380859375...

[ 20625, 142508, 171859, 83, 959, 7108, 1556, 22929, 130664, 10625, 1484, 17367, 4764, 28670, 4332, 238, 1001, 758, 16498, 11343, 2389, 65342, 56, 18151, 13315, 46133, 94553, 32108, 7398, 8705, 15400, 621, 1660, 1632, 4717, 7103, 5608, 3871, ...

[ 0.136962890625, 0.2744140625, 0.2471923828125, 0.0584716796875, 0.1298828125, 0.164306640625, 0.11328125, 0.055511474609375, 0.1380615234375, 0.06103515625, 0.1494140625, 0.1177978515625, 0.1319580078125, 0.096923828125, 0.07293701171875, 0.1004638671875, 0.14892578125, 0.176879882...

embed

58443284_c0

58443284

haskell

0

Title: Passing Variables in Function and compare each? Problem title: Passing Variables in Function and compare each? Tags: haskell Problem: Passing Variables in Function and compare each? I'm trying to practice Haskell returns and datatypes. I'm trying to pass the following information into the program: worm = 1:2:3:w...

Passing Variables in Function and compare each? Passing Variables in Function and compare each? haskell string use Passing Variables Could Num Char Arising Passing Variables in Function and compare each? I'm trying to practice Haskell returns and datatypes. I'm trying to pass the following information into the program:...

[ 0.00726318359375, 0.0034027099609375, -0.01275634765625, 0.00014781951904296875, 0.0004711151123046875, -0.0172119140625, 0.005218505859375, -0.003753662109375, 0.006011962890625, 0.036865234375, 0.0147705078125, -0.012451171875, 0.002471923828125, -0.00543212890625, 0.0042724609375, -...

[ 28872, 214, 111477, 13566, 23, 28670, 10763, 136, 69101, 12638, 1556, 142508, 79315, 4527, 191147, 52782, 21656, 1172, 72219, 31577, 41361, 20625, 30646, 2053, 50986, 27875, 4677, 1528, 28282, 32354, 101089, 2046, 14858, 80934, 145581, 5303, 11...

[ 0.1402587890625, 0.096923828125, 0.208984375, 0.1796875, 0.1134033203125, 0.1427001953125, 0.0911865234375, 0.046630859375, 0.207763671875, 0.117431640625, 0.1248779296875, 0.2139892578125, 0.150634765625, 0.0943603515625, 0.1094970703125, 0.1568603515625, 0.188720703125, 0.1177978...

embed

62441129_c0

62441129

haskell

0

Title: Lookup parameter arrays from URL Queries in Yesod Problem title: Lookup parameter arrays from URL Queries in Yesod Tags: haskell, yesod Problem: Lookup parameter arrays from URL Queries in Yesod I am fairly new to Haskell and Yesod so I've been looking through many tutorials and documentation. I found another St...

Lookup parameter arrays from URL Queries in Yesod Lookup parameter arrays from URL Queries in Yesod haskell yesod URL Lookup Queries Yesod localhost:3000 test1 test2 test3 Lookup parameter arrays from URL Queries in Yesod I am fairly new to Haskell and Yesod so I've been looking through many tutorials and documentation...

[ -0.01953125, 0.0169677734375, 0.00103759765625, -0.0048828125, -0.005645751953125, 0.005828857421875, -0.0032196044921875, -0.00518798828125, -0.0004119873046875, -0.031005859375, 0.00194549560546875, -0.034912109375, -0.02001953125, -0.01708984375, -0.0103759765625, -0.020263671875, ...

[ 60818, 2037, 171859, 10298, 4778, 1295, 31862, 5813, 10484, 32635, 2199, 23, 1556, 142508, 2422, 23722, 4000, 40294, 36605, 3034, 418, 304, 363, 3525, 20625, 57143, 209806, 156673, 118664, 366, 25002, 41, 1294, 29806, 959, 20697, 98908, 51734...

[ 0.144775390625, 0.165283203125, 0.2425537109375, 0.154296875, 0.09759521484375, 0.051605224609375, 0.1695556640625, 0.12158203125, 0.08477783203125, 0.159912109375, 0.25927734375, 0.01361083984375, 0.0870361328125, 0.1983642578125, 0.1121826171875, 0.1949462890625, 0.0662841796875, ...

embed