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
6312592_c2	6312592	haskell	2	0.5 failed during the configure step. The exception was: ExitFailure 1 Code signals: Haskell, Cabal, How, Reading, Resolving, time-1.2.0.5, Extracting, Users, Marcin, AppData, Roaming, hackage.haskell.org, time-1.2.0.5.tar.gz, time-1.2.0.54736, Creating, Program, Files, x86, Platform, ghc.exe, Setu, p.hs, setup.exe, ti...	0.5 failed during the configure step. The exception was: ExitFailure 1 Code signals: Haskell, Cabal, How, Reading, Resolving, time-1.2.0.5, Extracting, Users, Marcin, AppData, Roaming, hackage.haskell.org, time-1.2.0.5.tar.gz, time-1.2.0.54736, Creating, Program, Files, x86, Platform, ghc.exe, Setu, p.hs, setup.exe, ti...	[ 0.0050048828125, 0.00518798828125, 0.0234375, -0.0091552734375, 0.00408935546875, -0.01220703125, -0.005157470703125, -0.0079345703125, 0.00750732421875, 0.0234375, -0.01348876953125, -0.0115966796875, -0.0023956298828125, -0.00189971923828125, -0.009765625, -0.0130615234375, 0.00976...	[ 81730, 165523, 20271, 222495, 29954, 131527, 5443, 217, 17647, 379, 3408, 106, 28864, 26073, 20625, 142508, 30438, 289, 11249, 104951, 132944, 1733, 48400, 93645, 31501, 53400, 177184, 5659, 137989, 2777, 302, 85526, 4588, 10557, 1478, 867, 730...	[ 0.292236328125, 0.2259521484375, 0.048828125, 0.2548828125, 0.1104736328125, 0.2230224609375, 0.1614990234375, 0.1358642578125, 0.1396484375, 0.10223388671875, 0.07452392578125, 0.08013916015625, 0.1981201171875, 0.179443359375, 0.144775390625, 0.267333984375, 0.1488037109375, 0.15...	embed
27739762_c0	27739762	haskell	0	Title: Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? Problem title: Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? Tags: haskell, functional-programming Problem: Haskell: Why "Nothing<(4::Maybe Int)" g...	Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? haskell functional-programming Haskell Why Nothing Maybe Just Haskell: Why "Nothing<(4::Maybe Int)" gets an ...	[ 0.01031494140625, 0.0035400390625, 0.01483154296875, -0.01031494140625, 0.00885009765625, -0.007476806640625, -0.00244140625, -0.005828857421875, 0.0108642578125, 0.0093994140625, -0.01483154296875, -0.021728515625, 0.0169677734375, 0.01153564453125, 0.0022430419921875, -0.020629882812...	[ 20625, 142508, 44084, 5021, 64113, 105801, 82419, 372, 360, 18, 18499, 1277, 9563, 201, 27875, 1284, 1556, 123309, 28966, 182747, 83425, 16093, 12, 10644, 5809, 15400, 154186 ]	[ 0.1121826171875, 0.2042236328125, 0.07647705078125, 0.06109619140625, 0.1612548828125, 0.157958984375, 0.095703125, 0.08685302734375, 0.0911865234375, 0.0877685546875, 0.1734619140625, 0.041351318359375, 0.1002197265625, 0.18701171875, 0.09210205078125, 0.051422119140625, 0.081726074...	embed
72863962_c1	72863962	haskell	1	.yaml which is currently resolver: lts-14.21 . But what do I change it to? It looks like the most recent version of LTS is 19.14 https://www.stackage.org/lts-19.14 . But I'm a bit nervous about making that change since the page says ghc 9.0.2 not 9.2.2. The entire Haskell ecosystem just seems really finicky and I'm new...	.yaml which is currently resolver: lts-14.21 . But what do I change it to? It looks like the most recent version of LTS is 19.14 https://www.stackage.org/lts-19.14 . But I'm a bit nervous about making that change since the page says ghc 9.0.2 not 9.2.2. The entire Haskell ecosystem just seems really finicky and I'm new...	[ -0.018798828125, 0.00909423828125, -0.0033416748046875, -0.0301513671875, -0.005279541015625, -0.00537109375, -0.0302734375, 0.002685546875, -0.0062255859375, 0.0220947265625, -0.01397705078125, -0.01953125, 0.0009307861328125, 0.007171630859375, 0.01446533203125, 0.00994873046875, -...	[ 5, 14520, 141, 3129, 83, 82424, 58061, 96, 933, 16249, 3117, 4966, 2367, 54, 87, 15549, 442, 47, 33342, 2684, 17309, 11389, 339, 12763, 6529, 2592, 590, 11387, 429, 1478, 1277, 7, 8363, 4785, 11066, 13048, 9191, 17378, 31380, 238, 3569,...	[ 0.1036376953125, 0.24462890625, 0.2398681640625, 0.001251220703125, 0.0283203125, 0.09912109375, 0.279052734375, 0.08673095703125, 0.1502685546875, 0.1737060546875, 0.189453125, 0.0277557373046875, 0.0596923828125, 0.04949951171875, 0.03570556640625, 0.2178955078125, 0.1287841796875,...	embed
75689855_c1	75689855	haskell	1	(on ghc 9.2.7 via Stack LTS-20.13 ). It doesn't happen if instead of importing the module, I directly load Test1.hs code in ghci. If I remove Strict pragma, the issue seems to go away. Perhaps something is going on here that is new to ghc 9.2+ or template haskell derivation in aeson ? Code signals: when, Data.Aeson.TH...	(on ghc 9.2.7 via Stack LTS-20.13 ). It doesn't happen if instead of importing the module, I directly load Test1.hs code in ghci. If I remove Strict pragma, the issue seems to go away. Perhaps something is going on here that is new to ghc 9.2+ or template haskell derivation in aeson ? Code signals: when, Data.Aeson.TH...	[ -0.0030059814453125, -0.01080322265625, -0.01336669921875, 0.006988525390625, -0.003570556640625, -0.00848388671875, 0.0191650390625, -0.00188446044921875, 0.000640869140625, -0.038330078125, 0.0038299560546875, 0.002288818359375, 0.014404296875, -0.00176239013671875, 0.017333984375, 0...	[ 31380, 238, 151309, 966, 6512, 2594, 12763, 11033, 2681, 6, 1650, 18, 53383, 2174, 64457, 24927, 88996, 105237, 72367, 8647, 418, 127, 7, 18151, 318, 87388, 73425, 15390, 58827, 192, 31089, 16065, 181799, 3688, 1328, 110934, 1556, 142508, 3...	[ 0.1339111328125, 0.140380859375, 0.216796875, 0.10211181640625, 0.1011962890625, 0.09857177734375, 0.07159423828125, 0.07513427734375, 0.1280517578125, 0.010345458984375, 0.0283355712890625, 0.0233154296875, 0.0789794921875, 0.003570556640625, 0.0215606689453125, 0.1737060546875, 0.1...	embed
41675391_c0	41675391	haskell	0	Title: Right-tightening ArrowLoop law Problem title: Right-tightening ArrowLoop law Tags: haskell, arrow-abstraction, typeclass Problem: Right-tightening ArrowLoop law According to the Control.Arrow documentation, for many monads (those for which the >>= operation is strict) the instance MonadFix m => ArrowLoop (Kleisl...	Right-tightening ArrowLoop law Right-tightening ArrowLoop law haskell arrow-abstraction typeclass Right-tightening ArrowLoop Control.Arrow MonadFix Kleisli Right-tightening ArrowLoop law According to the Control.Arrow documentation, for many monads (those for which the >>= operation is strict) the instance MonadFix m =...	[ 0.0216064453125, 0.00011014938354492188, 0.036865234375, 0.0311279296875, 0.0230712890625, 0.00396728515625, 0.0021820068359375, 0.01507568359375, 0.0177001953125, 0.01019287109375, 0.01312255859375, -0.0093994140625, -0.02685546875, 0.0123291015625, 0.0390625, -0.0179443359375, -0.0...	[ 90911, 18, 228624, 1172, 15555, 15363, 2146, 27165, 1556, 142508, 118201, 2055, 7, 117474, 10644, 67413, 27131, 60331, 71, 6159, 425, 24798, 164, 150, 5, 7614, 209806, 5941, 2667, 712, 6396, 1369, 41018, 83, 81113, 110527, 347, 44357, 67657...	[ 0.1475830078125, 0.1102294921875, 0.2032470703125, 0.060699462890625, 0.172607421875, 0.13671875, 0.1473388671875, 0.165771484375, 0.055450439453125, 0.1800537109375, 0.183837890625, 0.036529541015625, 0.0025634765625, 0.0699462890625, 0.0740966796875, 0.129638671875, 0.17626953125, ...	embed
48712601_c0	48712601	haskell	0	Title: How can one turn a value of a record type into a JSON String in Haskell? Problem title: How can one turn a value of a record type into a JSON String in Haskell? Tags: haskell, json Problem: How can one turn a value of a record type into a JSON String in Haskell? Let's say I have record type that looks like this ...	How can one turn a value of a record type into a JSON String in Haskell? How can one turn a value of a record type into a JSON String in Haskell? haskell json How JSON Haskell Person Show How can one turn a value of a record type into a JSON String in Haskell? Let's say I have record type that looks like this How would...	[ -0.0198974609375, 0.0037841796875, 0.00335693359375, 0.0269775390625, -0.010498046875, 0.0025177001953125, -0.023681640625, 0.01031494140625, -0.0111083984375, -0.0228271484375, -0.01202392578125, 0.010498046875, 0.01220703125, 0.0155029296875, -0.000896453857421875, -0.007476806640625...	[ 11249, 831, 15504, 34292, 17164, 10644, 3934, 821, 58627, 23351, 214, 23, 20625, 142508, 111, 10, 1556, 1647, 1681, 15270, 17367, 1632, 33342, 1884, 903, 10932, 174548, 134549, 127, 25632 ]	[ 0.049652099609375, 0.053466796875, 0.11328125, 0.1768798828125, 0.2176513671875, 0.190185546875, 0.0860595703125, 0.1409912109375, 0.2203369140625, 0.1646728515625, 0.114990234375, 0.043609619140625, 0.1435546875, 0.225341796875, 0.0196075439453125, 0.0479736328125, 0.1497802734375, ...	embed
32811390_c0	32811390	haskell	0	Title: Foldl on string Problem title: Foldl on string Tags: haskell, fold Problem: Foldl on string I would like to foldl a string so that any occurrence of zero which is preceded by @ is replaced with "k". So "a.@0.1.2.0" becomes, "a.@k.1.2.0". How do I do that? So far my attempt is test = foldl(\x acc-> if((last acc) ...	Foldl on string Foldl on string haskell fold Foldl Foldl on string I would like to foldl a string so that any occurrence of zero which is preceded by @ is replaced with "k". So "a.@0.1.2.0" becomes, "a.@k.1.2.0". How do I do that? So far my attempt is However, it doesn't work. Foldl is expecting list of string and what...	[ -0.00830078125, -0.007476806640625, -0.0177001953125, 0.00640869140625, -0.00457763671875, 0.02099609375, 0.01092529296875, -0.007598876953125, -0.0057373046875, 0.01708984375, 0.02978515625, -0.014892578125, -0.01025390625, 0.01953125, 0.00994873046875, -0.00885009765625, -0.0033874...	[ 30077, 20469, 98, 79315, 1556, 142508, 42822, 87, 2806, 1884, 47, 18344, 10, 221, 450, 2499, 74918, 42, 6620, 111, 45234, 3129, 107671, 1374, 83, 91995, 678, 92, 11, 5, 981, 102014, 73011, 24209, 22892, 11249, 54, 2060, 759, 81887, 3330...	[ 0.20703125, 0.25537109375, 0.1435546875, 0.2490234375, 0.1307373046875, 0.2298583984375, 0.220458984375, 0.048797607421875, 0.0751953125, 0.1126708984375, 0.042724609375, 0.199462890625, 0.01171875, 0.043304443359375, 0.0194854736328125, 0.056915283203125, 0.11572265625, 0.08160400...	embed
11672786_c0	11672786	haskell	0	Title: Cabal preprocessing symbols Problem title: Cabal preprocessing symbols Tags: haskell, cabal, build Problem: Cabal preprocessing symbols Possible Duplicate: Haskell: Correct practice to specify version in source? Is it any way to export cabal metadata to my code? With autotools, I define, for example, program ver...	Cabal preprocessing symbols Cabal preprocessing symbols haskell cabal build Cabal configure.ac Cabal preprocessing symbols Is it any way to export cabal metadata to my code? With autotools, I define, for example, program version in configure.ac and get it as define for my code. In cabal, currently, I have to mantain pr...	[ -0.004547119140625, -0.0030517578125, -0.00238037109375, 0.01397705078125, -0.01220703125, -0.003936767578125, -0.0015869140625, 0.037109375, -0.005462646484375, -0.003692626953125, -0.0120849609375, -0.0133056640625, 0.00130462646484375, -0.01080322265625, -0.003814697265625, 0.014465...	[ 30438, 289, 479, 63923, 26582, 214, 1556, 142508, 109524, 45367, 222495, 2263, 2499, 3917, 47, 31255, 23550, 10135, 18151, 17106, 1809, 89110, 61924, 1528, 11389, 2046, 237, 360, 82424, 765, 332, 25500, 6626, 44677, 23, 5, 408, 3571, 136, ...	[ 0.20361328125, 0.182373046875, 0.131591796875, 0.12451171875, 0.207275390625, 0.0310821533203125, 0.0775146484375, 0.1656494140625, 0.276123046875, 0.1212158203125, 0.2073974609375, 0.1123046875, 0.02838134765625, 0.0545654296875, 0.0706787109375, 0.2059326171875, 0.1707763671875, ...	embed
27715771_c0	27715771	haskell	0	Title: Why is there a Non-exhaustive pattern in this function? Problem title: Why is there a Non-exhaustive pattern in this function? Tags: haskell Problem: Why is there a Non-exhaustive pattern in this function? In this Script, permutations :: Integer -> Integer -> Integer permutations x y \| x==x-(y-1) = x \| (x>0) && ...	Why is there a Non-exhaustive pattern in this function? Why is there a Non-exhaustive pattern in this function? haskell Why Non-exhaustive Integer y-1 x-1 Why is there a Non-exhaustive pattern in this function? In this Script, I wonder why there is Non-exhaustive patterns in the function permutations. Please help me. T...	[ -0.0228271484375, 0.006988525390625, 0.0023651123046875, 0.004913330078125, 0.0020904541015625, 0.01806640625, -0.02685546875, 0.003997802734375, 0.0034637451171875, -0.00135040283203125, 0.014404296875, 0.00860595703125, 0.0203857421875, 0.000560760498046875, 0.01806640625, 0.00482177...	[ 44084, 83, 2685, 10, 3775, 3355, 18391, 4935, 103510, 23, 903, 32354, 1556, 142508, 9, 44401, 113, 5759, 1022, 84654, 32195, 15400, 117, 14311, 21094, 4358, 100, 129745 ]	[ 0.1697998046875, 0.047393798828125, 0.07666015625, 0.0506591796875, 0.2216796875, 0.068603515625, 0.14794921875, 0.0989990234375, 0.2200927734375, 0.019439697265625, 0.07733154296875, 0.159912109375, 0.1470947265625, 0.218017578125, 0.0423583984375, 0.160400390625, 0.1524658203125, ...	embed
57370426_c0	57370426	haskell	0	Title: Why haskell gnuplot code works in ghci, but not from CLI after compiling? Problem title: Why haskell gnuplot code works in ghci, but not from CLI after compiling? Tags: gnuplot, haskell Problem: Why haskell gnuplot code works in ghci, but not from CLI after compiling? The next simple code works fine in GHCi (the...	Why haskell gnuplot code works in ghci, but not from CLI after compiling? Why haskell gnuplot code works in ghci, but not from CLI after compiling? gnuplot haskell CLI Graphics.Gnuplot.Simple Why Double Why haskell gnuplot code works in ghci, but not from CLI after compiling? The next simple code works fine in GHCi (th...	[ 0.000751495361328125, -0.016845703125, 0.004150390625, 0.00153350830078125, -0.002197265625, 0.0245361328125, 0.015869140625, -0.013916015625, 0.001190185546875, -0.004119873046875, -0.0062255859375, -0.0113525390625, 0.0108642578125, -0.0062255859375, 0.004425048828125, 0.015319824218...	[ 44084, 1556, 142508, 104155, 105710, 18151, 43240, 23, 31380, 318, 1284, 959, 1295, 313, 10927, 7103, 9969, 49725, 189682, 539, 8859, 33209, 107172, 11737, 8781, 5885, 527, 73265, 14, 76896, 678, 48461, 135179, 1632, 11675, 75101, 13315, 3372...	[ 0.078369140625, 0.1273193359375, 0.2147216796875, 0.182861328125, 0.2376708984375, 0.1507568359375, 0.1060791015625, 0.06951904296875, 0.1171875, 0.12841796875, 0.03558349609375, 0.0850830078125, 0.100341796875, 0.041473388671875, 0.18212890625, 0.09033203125, 0.131591796875, 0.108...	embed
33715010_c0	33715010	haskell	0	Title: GHC import feature or bug Problem title: GHC import feature or bug Tags: haskell, ghc Problem: GHC import feature or bug I found that the following code is accepted by GHC: import Prelude hiding (filter) import qualified Prelude as P The idea of these two imports is to make all Prelude functions available as usu...	GHC import feature or bug GHC import feature or bug haskell ghc feature Prelude qualified GHC P.filter GHC import feature or bug I found that the following code is accepted by GHC: The idea of these two imports is to make all Prelude functions available as usual, but to require filter to be qualified as P.filter . I ne...	[ 0.00714111328125, -0.002716064453125, 0.00787353515625, 0.00110626220703125, -0.005462646484375, -0.00116729736328125, 0.0021514892578125, -0.0128173828125, 0.0059814453125, -0.01708984375, -0.005828857421875, -0.0026397705078125, -0.0031585693359375, -0.004791259765625, 0.00595092773437...	[ 527, 73265, 24927, 60213, 707, 54608, 1556, 142508, 31380, 238, 1914, 822, 112, 217225, 436, 120337, 14037, 25632, 18151, 68186, 6528, 6626, 3249, 756, 32354, 19882, 115723, 1284, 64209, 46312, 237, 5, 21373, 27781, 83, 903 ]	[ 0.1053466796875, 0.2666015625, 0.240966796875, 0.1947021484375, 0.041717529296875, 0.2061767578125, 0.10272216796875, 0.1966552734375, 0.116455078125, 0.1422119140625, 0.1126708984375, 0.1976318359375, 0.1553955078125, 0.183837890625, 0.0931396484375, 0.2457275390625, 0.0116577148437...	embed
14639335_c0	14639335	haskell	0	Title: Using map and recursive functions in Haskell Problem title: Using map and recursive functions in Haskell Tags: haskell, recursion Problem: Using map and recursive functions in Haskell so I'm learning how to program in Haskell. One thing I would like to see is adding 1 to each element of a list by using map and u...	Using map and recursive functions in Haskell Using map and recursive functions in Haskell haskell recursion Using Haskell Using map and recursive functions in Haskell so I'm learning how to program in Haskell. One thing I would like to see is adding 1 to each element of a list by using map and using recursion that does...	[ -0.011474609375, 0.02734375, -0.00098419189453125, -0.006317138671875, -0.0048828125, 0.020751953125, -0.013427734375, 0.01300048828125, 0.004669189453125, -0.043212890625, 0.006744384765625, -0.038330078125, 0.0026092529296875, 0.03125, 0.01019287109375, -0.015625, 0.007110595703125...	[ 345, 22288, 136, 195625, 5844, 32354, 23, 20625, 142508, 1556, 1830, 52080, 1528, 1884, 1957, 154107, 106, 12638, 12830, 5303, 17368, 22027, 18, 4527, 46683, 3220, 15490, 77546, 80596, 35773, 17569, 442, 21185, 15044, 48322, 208124 ]	[ 0.114501953125, 0.252685546875, 0.1153564453125, 0.2401123046875, 0.1591796875, 0.2105712890625, 0.0256195068359375, 0.1539306640625, 0.259765625, 0.1455078125, 0.14892578125, 0.055633544921875, 0.1070556640625, 0.060028076171875, 0.0675048828125, 0.17724609375, 0.114501953125, 0.0...	embed
18665559_c0	18665559	haskell	0	Title: How to monitor computation process in Haskell Problem title: How to monitor computation process in Haskell Tags: haskell Problem: How to monitor computation process in Haskell I have a function in my main block map anyHeavyFunction [list] I'd like to show a progress bar during the computation process or add addi...	How to monitor computation process in Haskell How to monitor computation process in Haskell haskell How Haskell State How to monitor computation process in Haskell I have a function in my main block I'd like to show a progress bar during the computation process or add additional actions (pause, stop process etc.), but ...	[ -0.0284423828125, -0.003173828125, 0.0037078857421875, 0.0186767578125, 0.0027008056640625, -0.00067138671875, 0.00360107421875, -0.00063323974609375, 0.00092315673828125, -0.033935546875, 0.0101318359375, -0.0181884765625, 0.0115966796875, 0.0233154296875, 0, 0.00156402587890625, 0....	[ 11249, 47, 12983, 181135, 1363, 9433, 23, 20625, 142508, 1556, 22836, 32354, 5201, 46389, 1884, 7639, 42658, 1909, 20271, 15190, 78301, 61972, 149302, 7279, 22288, 83, 34166, 831, 105237, 57767, 4527, 2667, 712, 7, 2367, 95307, 17780 ]	[ 0.08538818359375, 0.080810546875, 0.256591796875, 0.187255859375, 0.09051513671875, 0.1572265625, 0.0826416015625, 0.156494140625, 0.26806640625, 0.14599609375, 0.1873779296875, 0.1361083984375, 0.0677490234375, 0.1510009765625, 0.0736083984375, 0.122314453125, 0.1669921875, 0.1538...	embed
40432743_c0	40432743	haskell	0	Title: Remove commen elements from two lists Problem title: Remove commen elements from two lists Tags: haskell, list Problem: Remove commen elements from two lists I'm trying to make a function that, given two lists, removes from both lists the elements they have in commen. I've been breaking My Head over this but I h...	Remove commen elements from two lists Remove commen elements from two lists haskell list two Remove Remove commen elements from two lists I'm trying to make a function that, given two lists, removes from both lists the elements they have in commen. I've been breaking My Head over this but I haven't been able to come up...	[ -0.0017852783203125, 0.01202392578125, -0.01324462890625, 0.030517578125, -0.004547119140625, 0.0220947265625, 0.005859375, 0.0010986328125, 0.006927490234375, -0.02197265625, 0.0031890869140625, 0.003936767578125, 0.018798828125, 0.0181884765625, -0.0194091796875, -0.0048828125, 0.0...	[ 181139, 3739, 19, 80854, 1295, 6626, 5303, 1556, 142508, 7, 31577, 32354, 34475, 87388, 15044, 1836, 765, 23, 116987, 44816, 16797, 29806, 1238, 5608, 30646, 1884 ]	[ 0.184326171875, 0.2181396484375, 0.17431640625, 0.208251953125, 0.12109375, 0.177734375, 0.21923828125, 0.119873046875, 0.1942138671875, 0.0211944580078125, 0.041229248046875, 0.1510009765625, 0.09881591796875, 0.1549072265625, 0.123291015625, 0.0057373046875, 0.03662109375, 0.0089...	embed
40701595_c0	40701595	haskell	0	Title: Map function is not working properly? Problem title: Map function is not working properly? Tags: haskell Problem: Map function is not working properly? Map functions is not working on this line compPic (a:as) = map (compL a) as It just work on single string but not on a list of string can you find error. compL :...	Map function is not working properly? Map function is not working properly? haskell Map a:as Map function is not working properly? Map functions is not working on this line compPic (a:as) = map (compL a) as It just work on single string but not on a list of string can you find error.	[ -0.017578125, -0.0228271484375, 0.01123046875, 0.0059814453125, -0.01318359375, 0.0150146484375, 0.01031494140625, -0.0050048828125, 0.017333984375, -0.00469970703125, -0.0093994140625, 0.0262451171875, 0.0206298828125, 0.02978515625, -0.004730224609375, -0.007568359375, -0.000625610...	[ 42719, 32354, 83, 959, 20697, 155965, 1556, 142508, 10, 12, 162, 7, 98, 903, 13315, 9969, 683, 1771, 11, 2203, 22288, 58875, 866, 237, 1660, 4488, 11001, 79315, 5303, 831, 7413, 18499 ]	[ 0.282958984375, 0.213134765625, 0.057281494140625, 0.1170654296875, 0.1539306640625, 0.1600341796875, 0.152099609375, 0.2335205078125, 0.135009765625, 0.0892333984375, 0.222412109375, 0.028778076171875, 0.0631103515625, 0.06097412109375, 0.1279296875, 0.142578125, 0.09417724609375, ...	embed
48143692_c0	48143692	haskell	0	Title: Haskell let expression converges while similar expression using fix does not Problem title: Haskell let expression converges while similar expression using fix does not Tags: haskell, mutual-recursion Problem: Haskell let expression converges while similar expression using fix does not I have been having difficu...	Haskell let expression converges while similar expression using fix does not Haskell let expression converges while similar expression using fix does not haskell mutual-recursion fix Haskell Haskell let expression converges while similar expression using fix does not I have been having difficulty understanding why the ...	[ 0.01092529296875, 0.01116943359375, 0.0045166015625, 0.0267333984375, 0.019287109375, 0.0024566650390625, -0.00970458984375, 0.00323486328125, -0.004364013671875, 0.00174713134765625, 0.003143310546875, 0.0186767578125, 0.007476806640625, 0.0086669921875, 0.03662109375, -0.016723632812...	[ 20625, 142508, 2633, 125195, 158, 74789, 12960, 21373, 17368, 30022, 959, 1556, 199849, 107, 48650, 1830, 14602, 34844, 100094, 15400, 425, 4, 53, 2203, 17727, 23, 47, 2858, 84751, 1284, 103607, 50339, 28354, 8035, 104250, 19, 73342 ]	[ 0.121826171875, 0.208251953125, 0.2158203125, 0.2275390625, 0.099853515625, 0.205810546875, 0.0706787109375, 0.15576171875, 0.035888671875, 0.2183837890625, 0.1309814453125, 0.1260986328125, 0.1446533203125, 0.0340576171875, 0.147216796875, 0.018585205078125, 0.007080078125, 0.0253...	embed
35278498_c0	35278498	haskell	0	Title: Haskell get set thread name Problem title: Haskell get set thread name Tags: haskell Problem: Haskell get set thread name When I print something in Java, I usually append the name of the thread to the print statement so I know what thread is running what print statement. How do I get and set the thread name in H...	Haskell get set thread name Haskell get set thread name haskell Haskell Haskell get set thread name When I print something in Java, I usually append the name of the thread to the print statement so I know what thread is running what print statement. How do I get and set the thread name in Haskell? If I can't set the th...	[ 0.02197265625, 0.006195068359375, 0.00927734375, 0.0191650390625, 0.01043701171875, 0.00439453125, 0.01348876953125, 0.002685546875, -0.0093994140625, -0.0244140625, -0.000347137451171875, -0.0086669921875, -0.02294921875, -0.0130615234375, -0.010009765625, 0.01251220703125, 0.006591...	[ 20625, 142508, 2046, 5423, 86997, 9351, 1556, 28412, 23, 41925, 56104, 114689, 71, 111, 63805, 3714, 51042, 11249, 136, 70, 831, 18, 3642, 3249, 34475, 8337, 8, 32032, 123055, 43578, 568, 927, 39116, 24931, 37382 ]	[ 0.13330078125, 0.230224609375, 0.100830078125, 0.1846923828125, 0.2454833984375, 0.1820068359375, 0.12744140625, 0.133544921875, 0.006439208984375, 0.17333984375, 0.03350830078125, 0.0806884765625, 0.010986328125, 0.0032958984375, 0.12451171875, 0.056365966796875, 0.040313720703125, ...	embed
27327970_c0	27327970	haskell	0	Title: Haskell recursion odd Problem title: Haskell recursion odd Tags: list, haskell Problem: Haskell recursion odd I have to define my own predicate function that recursively searches a list of numbers and returns True if it finds an odd number, False otherwise. I have set X = [1..100] for test data that I need to sh...	Haskell recursion odd Haskell recursion odd list haskell Haskell Haskell recursion odd I have to define my own predicate function that recursively searches a list of numbers and returns True if it finds an odd number, False otherwise. I have set X = [1..100] for test data that I need to show. However, I am a bit unsure...	[ -0.02197265625, 0.02978515625, 0.01531982421875, -0.01025390625, 0.0234375, 0.03759765625, -0.001495361328125, -0.0238037109375, 0.01129150390625, -0.0145263671875, 0.0181884765625, -0.031982421875, 0.0034637451171875, 0.004150390625, 0.004852294921875, 0.01312255859375, 0.0234375, ...	[ 20625, 142508, 195625, 1830, 70270, 5303, 1556, 765, 61924, 10002, 1653, 2063, 67, 32354, 5844, 33938, 101935, 30646, 87599, 2174, 7413, 14012, 22225, 184, 120262, 5423, 1193, 2203, 68252, 5, 3559, 3034, 2053, 3871, 7639, 4785, 51646, 3642, ...	[ 0.151611328125, 0.204833984375, 0.251953125, 0.1436767578125, 0.25244140625, 0.1861572265625, 0.1531982421875, 0.01995849609375, 0.117431640625, 0.0885009765625, 0.1400146484375, 0.1451416015625, 0.058258056640625, 0.1279296875, 0.0889892578125, 0.1837158203125, 0.1324462890625, 0....	embed
44167571_c0	44167571	haskell	0	Title: Datatype Person mother from mother (grandmother) Problem title: Datatype Person mother from mother (grandmother) Tags: option-type, types, haskell Problem: Datatype Person mother from mother (grandmother) Imagine I've got a datatype Person . data Person = Person String Person The 2. Person should be the mother. ...	Datatype Person mother from mother (grandmother) Datatype Person mother from mother (grandmother) option-type types haskell mother Datatype Person Maybe Just Datatype Person mother from mother (grandmother) Imagine I've got a datatype Person . The 2. Person should be the mother. Will only show the mother from person x....	[ -0.006378173828125, 0.0260009765625, 0.0274658203125, 0.033935546875, 0.01220703125, 0.0302734375, 0.0211181640625, 0.004180908203125, -0.01318359375, -0.033203125, -0.0016632080078125, -0.0064697265625, -0.00054931640625, 0.00323486328125, 0.017578125, -0.00531005859375, -0.00250244...	[ 11809, 50986, 15270, 42732, 1295, 79139, 432, 9319, 35829, 52895, 1556, 142508, 83425, 133196, 4163, 2053, 787, 5608, 186, 70, 4734, 7639, 3445, 1022, 11249, 831, 9963 ]	[ 0.1358642578125, 0.269775390625, 0.1905517578125, 0.2022705078125, 0.11865234375, 0.097900390625, 0.156982421875, 0.1356201171875, 0.16845703125, 0.1590576171875, 0.1199951171875, 0.239013671875, 0.01324462890625, 0.10009765625, 0.018280029296875, 0.1463623046875, 0.1375732421875, ...	embed
47502136_c0	47502136	haskell	0	Title: Flags in global Stack config.yaml Problem title: Flags in global Stack config.yaml Tags: haskell-stack, haskell Problem: Flags in global Stack config.yaml I tried adding some flags to my global Stack config.yaml : flags: extra-include-dirs: /usr/include/ Alas it's not being recognised: Warning: /Users/vilem/.sta...	Flags in global Stack config.yaml Flags in global Stack config.yaml haskell-stack haskell Flags Stack config.yaml Warning Users Unrecognized ConfigMonoid Flags in global Stack config.yaml I tried adding some flags to my global Stack config.yaml : Alas it's not being recognised: What am I doing wrong? The documentation ...	[ -0.004852294921875, 0.00634765625, -0.005645751953125, -0.00041961669921875, -0.0035552978515625, -0.0089111328125, -0.0174560546875, 0.004364013671875, -0.0208740234375, 0.019775390625, -0.00750732421875, -0.0189208984375, -0.0027313232421875, -0.01324462890625, 0, 0.003997802734375, ...	[ 125726, 7, 23, 7964, 6512, 2594, 153837, 14520, 141, 1556, 142508, 590, 5550, 53400, 992, 107, 115558, 139403, 46674, 48899, 37842, 154107, 3060, 49938, 959, 8035, 75530, 5281, 20594, 44691, 209806, 35166 ]	[ 0.26953125, 0.1046142578125, 0.043060302734375, 0.1473388671875, 0.171875, 0.1689453125, 0.1937255859375, 0.1455078125, 0.122802734375, 0.081298828125, 0.1766357421875, 0.129638671875, 0.0804443359375, 0.1373291015625, 0.0271453857421875, 0.009246826171875, 0.13134765625, 0.1540527...	embed
66251460_c0	66251460	haskell	0	Title: How do I properly use '/=' haskell infix operator for xor? Problem title: How do I properly use '/=' haskell infix operator for xor? Tags: xor, infix-notation, haskell Problem: How do I properly use '/=' haskell infix operator for xor? I'm learning haskell and I'm having an issue getting a li...	How do I properly use '/=' haskell infix operator for xor? How do I properly use '/=' haskell infix operator for xor? xor infix-notation haskell How How do I properly use '/=' haskell infix operator for xor? I'm learning haskell and I'm having an issue getting a line of code to work. The error says ...	[ 0.009765625, 0.0283203125, 0.01165771484375, -0.030517578125, 0.0059814453125, -0.000629425048828125, -0.002288818359375, 0.009033203125, 0.01031494140625, -0.017333984375, 0.0167236328125, 0.004669189453125, 0.0269775390625, -0.00579833984375, -0.01470947265625, 0.0019073486328125, ...	[ 11249, 87, 155965, 4527, 3768, 64, 1369, 54764, 1556, 142508, 23, 55923, 39933, 100, 74706, 54, 157, 22062, 25, 52080, 31089, 20949, 13315, 18151, 47, 4488, 18499, 442, 183037, 22422, 4358 ]	[ 0.059234619140625, 0.015472412109375, 0.1324462890625, 0.1480712890625, 0.14599609375, 0.2060546875, 0.251708984375, 0.0164337158203125, 0.146728515625, 0.2279052734375, 0.1353759765625, 0.2457275390625, 0.20654296875, 0.06365966796875, 0.21875, 0.034393310546875, 0.102783203125, 0...	embed
61850757_c0	61850757	haskell	0	Title: How can I hide the tuple type constructor? Problem title: How can I hide the tuple type constructor? Tags: haskell, tuples Problem: How can I hide the tuple type constructor? I want to write my own tuples (for fun and exercising). Is there a way to hide Haskell's default constructor (,) ? I tried import Prelude ...	How can I hide the tuple type constructor? How can I hide the tuple type constructor? haskell tuples Prelude How Main.hs:5:50 How can I hide the tuple type constructor? I want to write my own tuples (for fun and exercising). Is there a way to hide Haskell's default constructor (,) ? I tried but this results in a parse ...	[ 0.00860595703125, 0.0024566650390625, -0.003173828125, 0.03369140625, -0.006256103515625, -0.0028533935546875, -0.01019287109375, -0.01104736328125, 0.0034942626953125, -0.032470703125, -0.0228271484375, -0.03515625, 0.0162353515625, -0.0004253387451171875, -0.0103759765625, 0.00286865...	[ 11249, 831, 87, 1274, 112, 370, 8705, 10644, 64549, 748, 1556, 142508, 99726, 1914, 822, 12321, 127, 23837, 3444, 33022, 10002, 7477, 56785, 20625, 114977, 4, 366, 184, 18499, 26785, 15 ]	[ 0.036468505859375, 0.03680419921875, 0.01287841796875, 0.1551513671875, 0.127197265625, 0.1024169921875, 0.177978515625, 0.1480712890625, 0.15869140625, 0.130615234375, 0.0838623046875, 0.208740234375, 0.195068359375, 0.005584716796875, 0.08404541015625, 0.007720947265625, 0.00125122...	embed
24611565_c0	24611565	haskell	0	Title: cabal, module and dependencies Problem title: cabal, module and dependencies Tags: haskell, cabal Problem: cabal, module and dependencies I was wondering, when you download and install a package via cabal, does cabal tries to build everything or only what you need. For example lots of package include and Haskell...	cabal, module and dependencies cabal, module and dependencies haskell cabal cabal, module and dependencies I was wondering, when you download and install a package via cabal, does cabal tries to build everything or only what you need. For example lots of package include and HaskellTemplate module which obviously requir...	[ -0.0016021728515625, 0.000579833984375, 0.0152587890625, 0.01318359375, -0.0079345703125, 0.011474609375, -0.001922607421875, -0.000698089599609375, 0.00518798828125, 0.00151824951171875, 0.00408935546875, -0.057373046875, -0.0035400390625, 0.016845703125, 0.00238037109375, 0.001754760...	[ 109524, 88996, 136, 42548, 1556, 142508, 117538, 149016, 3229, 7026, 20600, 98169, 1829, 14602, 1927, 90, 47, 45367, 26818, 707, 4734, 2367, 398, 3871, 1326, 71358, 111, 26698, 20625, 159065, 19309, 171259, 144570, 111938, 53383, 2174, 4527, ...	[ 0.274658203125, 0.21630859375, 0.07061767578125, 0.1800537109375, 0.1268310546875, 0.1976318359375, 0.06561279296875, 0.062408447265625, 0.0172576904296875, 0.12841796875, 0.11865234375, 0.174560546875, 0.0985107421875, 0.04241943359375, 0.1295166015625, 0.045318603515625, 0.06988525...	embed
27687734_c0	27687734	haskell	0	Title: Why error with my code Problem title: Why error with my code Tags: haskell Problem: Why error with my code In this script, data Move = Rock \| Paper \| Scissor deriving (Show,Eq) lose Rock = Scissor lose Paper = Rock lose _ = Paper data Result = Win \| Draw \| Lose deriving (Show,Eq) outcome :: Move -> Move -> Resul...	Why error with my code Why error with my code haskell Why Move Rock Paper Scissor Show Result Win Draw Lose con1 Why error with my code In this script, I wonder why there is a Thanks for your advance!	[ 0.005126953125, 0.016845703125, -0.0235595703125, -0.005126953125, -0.0003376007080078125, 0.02099609375, -0.007232666015625, 0.0091552734375, 0.000652313232421875, 0.005767822265625, -0.001007080078125, -0.00848388671875, 0.0184326171875, -0.016357421875, 0.0020599365234375, -0.002456...	[ 44084, 18499, 678, 759, 18151, 1556, 142508, 135828, 14434, 62323, 49628, 7, 4970, 17367, 126684, 17686, 18186, 434, 3731, 13, 158, 418, 903, 26499, 32195, 15400, 2685, 83, 10, 22362, 129745 ]	[ 0.12939453125, 0.237548828125, 0.180419921875, 0.1282958984375, 0.244384765625, 0.1556396484375, 0.2274169921875, 0.168212890625, 0.204345703125, 0.20068359375, 0.1302490234375, 0.053070068359375, 0.1690673828125, 0.157470703125, 0.12646484375, 0.114990234375, 0.07861328125, 0.0262...	embed
42922217_c0	42922217	haskell	0	Title: Haskell Stack ghci flags Problem title: Haskell Stack ghci flags Tags: haskell, ghci, haskell-stack Problem: Haskell Stack ghci flags Basically, I am trying to achieve the following: stack ghci --flag proj:dev but it seems that flag is not valid for ghci, only for build . How can I achieve this? If possible *Not...	Haskell Stack ghci flags Haskell Stack ghci flags haskell ghci haskell-stack Haskell Stack proj:dev Haskell Stack ghci flags Basically, I am trying to achieve the following: stack ghci --flag proj:dev but it seems that flag is not valid for ghci, only for build . How can I achieve this? If possible *Notes: proj is a cl...	[ -0.006866455078125, -0.00970458984375, 0.006134033203125, 0.00183868408203125, 0.00008296966552734375, -0.008544921875, -0.0146484375, 0.0164794921875, -0.007354736328125, -0.0162353515625, 0.00872802734375, -0.0303955078125, -0.006744384765625, -0.0078125, 0.00193023681640625, 0.01159...	[ 20625, 142508, 6512, 2594, 31380, 318, 49938, 1556, 590, 502, 170, 18548, 31577, 69307, 177261, 4210, 190872, 12, 959, 35604, 4734, 100, 45367, 7722, 20450, 2422, 23722, 17562, 110934, 4527, 8, 2601, 7413, 72803, 21771, 39544, 65572, 31842, ...	[ 0.1268310546875, 0.2158203125, 0.1297607421875, 0.1136474609375, 0.1552734375, 0.18798828125, 0.2471923828125, 0.0977783203125, 0.035919189453125, 0.1158447265625, 0.13134765625, 0.254150390625, 0.054412841796875, 0.0926513671875, 0.224853515625, 0.0648193359375, 0.246337890625, 0....	embed
65955631_c0	65955631	haskell	0	Title: How to sum the value in a key/value list of tuples that has duplicates key? Problem title: How to sum the value in a key/value list of tuples that has duplicates key? Tags: haskell Problem: How to sum the value in a key/value list of tuples that has duplicates key? Consider the exemple: [("AAA",2),("BBB",5),("AA...	How to sum the value in a key/value list of tuples that has duplicates key? How to sum the value in a key/value list of tuples that has duplicates key? haskell How AAA BBB CCC How to sum the value in a key/value list of tuples that has duplicates key? Consider the exemple: And I want to combine the tuples containing th...	[ -0.00518798828125, -0.00060272216796875, 0.015625, 0.004791259765625, -0.010009765625, -0.0040283203125, -0.006378173828125, 0.022216796875, 0.0169677734375, 0.00994873046875, -0.011474609375, -0.005035400390625, 0.0235595703125, 0.01123046875, -0.01336669921875, -0.0030364990234375, ...	[ 11249, 47, 10554, 34292, 23, 22799, 27494, 5303, 370, 99726, 1556, 171763, 1636, 70, 64, 450, 142508, 155616, 22312, 134982, 10, 111, 18632, 3444, 70163, 70541, 5701, 71713, 214, 154107, 142424, 16750, 1884 ]	[ 0.0838623046875, 0.072265625, 0.24365234375, 0.1951904296875, 0.079833984375, 0.1895751953125, 0.10986328125, 0.158203125, 0.1162109375, 0.2022705078125, 0.0880126953125, 0.2218017578125, 0.14794921875, 0.057525634765625, 0.0271759033203125, 0.02716064453125, 0.1824951171875, 0.150...	embed
66106841_c0	66106841	haskell	0	Title: Why doesn't 6 / length [1, 2, 3] work in Haskell Problem title: Why doesn't 6 / length [1, 2, 3] work in Haskell Tags: haskell, types Problem: Why doesn't 6 / length [1, 2, 3] work in Haskell Can someone explain to me why 6 / 3 works but 6 / length [1, 2, 3] errors out? Here's the error in REPL <intera...	Why doesn't 6 / length [1, 2, 3] work in Haskell Why doesn't 6 / length [1, 2, 3] work in Haskell haskell types a Why Haskell Fractional Why doesn't 6 / length [1, 2, 3] work in Haskell Can someone explain to me why 6 / 3 works but 6 / length [1, 2, 3] errors out? Here's the error in REPL	[ -0.00921630859375, 0.010009765625, 0.007293701171875, -0.0011444091796875, 0.003662109375, 0.00994873046875, -0.0037384033203125, -0.00970458984375, 0.00946044921875, -0.0181884765625, -0.00921630859375, -0.0223388671875, 0.0186767578125, -0.0098876953125, -0.0010223388671875, -0.01165...	[ 44084, 22027, 3768, 18, 305, 248, 140909, 68252, 116, 138, 4488, 20625, 142508, 4, 23, 1556, 52895, 7868, 10763, 289, 73342, 15400, 43240, 1284, 18499, 1810, 9069, 21130 ]	[ 0.09906005859375, 0.10382080078125, 0.06976318359375, 0.0955810546875, 0.19970703125, 0.1490478515625, 0.196533203125, 0.096923828125, 0.1405029296875, 0.18798828125, 0.1287841796875, 0.15625, 0.244873046875, 0.010284423828125, 0.043701171875, 0.135498046875, 0.135986328125, 0.1279...	embed
10986474_c0	10986474	haskell	0	Title: How do I stop wxhaskell from beeping on enter in text controls? Problem title: How do I stop wxhaskell from beeping on enter in text controls? Tags: wxwidgets, wxhaskell, haskell Problem: How do I stop wxhaskell from beeping on enter in text controls? I've played around with processEnter , on command , and on an...	How do I stop wxhaskell from beeping on enter in text controls? How do I stop wxhaskell from beeping on enter in text controls? wxwidgets wxhaskell haskell beeping How How do I stop wxhaskell from beeping on enter in text controls? I've played around with processEnter , on command , and on anyKey with textEntry to no a...	[ 0.000926971435546875, 0.00020599365234375, 0.0162353515625, -0.01556396484375, -0.01202392578125, 0.003448486328125, 0.0091552734375, 0.00823974609375, -0.0186767578125, -0.036376953125, -0.006622314453125, -0.0164794921875, -0.0012969970703125, -0.004669189453125, 0.004547119140625, 0...	[ 11249, 7279, 148, 137056, 7, 142508, 1295, 186, 13, 10366, 98, 30957, 23, 7986, 6226, 425, 32306, 3794, 1556, 54, 112730, 9433, 155581, 75101, 2499, 162429, 678, 7768, 15123, 110, 209806, 30854, 4358, 17368, 107754, 363, 5, 68107, 3773, 3...	[ 0.04718017578125, 0.201904296875, 0.1339111328125, 0.1815185546875, 0.09814453125, 0.260009765625, 0.09307861328125, 0.1461181640625, 0.1229248046875, 0.16162109375, 0.042449951171875, 0.205810546875, 0.08843994140625, 0.18115234375, 0.2042236328125, 0.14208984375, 0.1129150390625, ...	embed
37017779_c0	37017779	haskell	0	Title: Haskell Euler's totient error? Problem title: Haskell Euler's totient error? Tags: haskell Problem: Haskell Euler's totient error? I am trying to use Haskell to compute Euler's totient function: totient m = product [(p - 1) * p ^ (c) \| (p, c) <- prime_factors_mult m] However, this does not at all compu...	Haskell Euler's totient error? Haskell Euler's totient error? haskell Haskell Euler prime_factors_mult p-1 Haskell Euler's totient error? I am trying to use Haskell to compute Euler's totient function: However, this does not at all compute the coprime factors less than m. Is there an error in my logic somewhe...	[ -0.0189208984375, 0.0267333984375, 0.01043701171875, 0.00531005859375, 0.00933837890625, -0.011474609375, -0.00193023681640625, -0.020263671875, 0.0021514892578125, -0.044921875, 0.0130615234375, -0.0093994140625, 0.026123046875, 0.000972747802734375, -0.0025787353515625, -0.0005226135...	[ 20625, 142508, 5177, 603, 3768, 7, 1186, 18750, 18499, 32, 1556, 20809, 144810, 81944, 915, 5759, 25, 31577, 4527, 9969, 6743, 32354, 903, 959, 99, 756, 552, 114654, 120103, 40715, 3501, 347, 759, 62775, 5351, 254, 110218, 26785, 14012, 1...	[ 0.151123046875, 0.26025390625, 0.16162109375, 0.2144775390625, 0.10064697265625, 0.032470703125, 0.1580810546875, 0.2049560546875, 0.228515625, 0.0249481201171875, 0.126953125, 0.1746826171875, 0.213134765625, 0.1754150390625, 0.1126708984375, 0.184326171875, 0.0171661376953125, 0....	embed
18421926_c1	18421926	haskell	1	of phi started to look pretty similar to the first argument of apomorphism specialized for lists: xxapo :: ([a] -> Prim [a] (Either [a] [a])) -> [a] -> [a] xxapo = apo ( [a] -> Either [a] [a] vs [a] -> Prim [a] [a] (Either [a] [a] ) So I wonder is it possible to implement filtering using apomorphisms or other generali...	of phi started to look pretty similar to the first argument of apomorphism specialized for lists: xxapo :: ([a] -> Prim [a] (Either [a] [a])) -> [a] -> [a] xxapo = apo ( [a] -> Either [a] [a] vs [a] -> Prim [a] [a] (Either [a] [a] ) So I wonder is it possible to implement filtering using apomorphisms or other generali...	[ -0.00982666015625, 0.0272216796875, 0.01287841796875, -0.0012969970703125, 0.00811767578125, 0.006622314453125, 0.0245361328125, -0.00872802734375, 0.0162353515625, -0.01141357421875, -0.000591278076171875, 0.0098876953125, 0.009765625, 0.00567626953125, -0.0167236328125, -0.0083618164...	[ 111, 44171, 26859, 6713, 28875, 21373, 47, 5117, 10750, 6885, 178851, 8780, 5361, 29367, 5303, 113664, 25395, 1984, 33079, 44506, 9319, 20209, 32195, 7722, 29479, 46312, 214, 17368, 3789, 4537, 51, 42822, 3877, 5, 121, 70, 2965, 831, 15673,...	[ 0.111328125, 0.2138671875, 0.07171630859375, 0.1488037109375, 0.0679931640625, 0.1641845703125, 0.0158233642578125, 0.0921630859375, 0.2489013671875, 0.20751953125, 0.267578125, 0.15087890625, 0.1258544921875, 0.040985107421875, 0.1900634765625, 0.1322021484375, 0.2366943359375, 0....	embed
49518370_c0	49518370	haskell	0	Title: How to move 1 element of a List to right or left in Haskell? Problem title: How to move 1 element of a List to right or left in Haskell? Tags: haskell, list Problem: How to move 1 element of a List to right or left in Haskell? Hi I have been looking for an answer but could not find one. Lets say that we have a l...	How to move 1 element of a List to right or left in Haskell? How to move 1 element of a List to right or left in Haskell? haskell list How List Haskell How to move 1 element of a List to right or left in Haskell? Hi I have been looking for an answer but could not find one. Lets say that we have a list like [1,10,4,5,3]...	[ 0.0064697265625, 0.033447265625, 0.005950927734375, -0.0162353515625, -0.009765625, -0.000812530517578125, -0.0281982421875, 0.009521484375, -0.000713348388671875, -0.0194091796875, 0.00689697265625, -0.002197265625, -0.0045166015625, 0.01214599609375, -0.00177764892578125, 0.003555297...	[ 11249, 47, 25813, 106, 12830, 111, 32036, 7108, 707, 25737, 23, 20625, 142508, 1556, 5303, 10, 2673, 35166, 10842, 963, 80389, 96386, 3642, 831, 87, 122925, 190, 221, 24209, 758, 617, 37842, 202317, 647, 19929, 28848, 90791, 63262, 33342, ...	[ 0.0960693359375, 0.1656494140625, 0.2200927734375, 0.1468505859375, 0.226806640625, 0.045135498046875, 0.201904296875, 0.218505859375, 0.13623046875, 0.2110595703125, 0.062255859375, 0.15966796875, 0.25732421875, 0.1370849609375, 0.1810302734375, 0.00653076171875, 0.0035400390625, ...	embed
29706448_c0	29706448	haskell	0	Title: Dollar sign inside closed parens Problem title: Dollar sign inside closed parens Tags: dollar-sign, syntax, operator-keyword, haskell Problem: Dollar sign inside closed parens Websocket snippet has a statement that has dollar sign inside closed parens like this, any ($ fst client) Since haskellers use $ sign ins...	Dollar sign inside closed parens Dollar sign inside closed parens dollar-sign syntax operator-keyword haskell Dollar Prelude Dollar sign inside closed parens Websocket snippet has a statement that has dollar sign inside closed parens like this, Since haskellers use $ sign instead of parens, why do we need parens here? ...	[ 0.012939453125, 0.0177001953125, 0.0035552978515625, 0.01141357421875, -0.010009765625, 0.035400390625, -0.00872802734375, 0.0194091796875, -0.01513671875, -0.0240478515625, -0.01519775390625, -0.015869140625, -0.0101318359375, 0.0164794921875, -0.00836181640625, 0.0146484375, -0.012...	[ 83393, 24092, 46132, 155738, 366, 1755, 15437, 31304, 6002, 86531, 39933, 47416, 1556, 142508, 1914, 822, 991, 27853, 58134, 63805, 1884, 903, 1314, 4527, 3650, 64457, 15400, 3871, 3688, 44084, 83, 2685, 26582, 17721, 37842, 32354, 390, 20594...	[ 0.191650390625, 0.2142333984375, 0.1510009765625, 0.18701171875, 0.1512451171875, 0.183349609375, 0.2149658203125, 0.1890869140625, 0.008514404296875, 0.133544921875, 0.167236328125, 0.06219482421875, 0.0814208984375, 0.195068359375, 0.048919677734375, 0.1229248046875, 0.029846191406...	embed
58993547_c0	58993547	haskell	0	Title: Walk through a list split function in Haskell Problem title: Walk through a list split function in Haskell Tags: fold, split, haskell, list Problem: Walk through a list split function in Haskell This is a follow up to my previous question . I am trying to understand the list splitting example in Haskell from her...	Walk through a list split function in Haskell Walk through a list split function in Haskell fold split haskell list Walk Haskell a:y Walk through a list split function in Haskell This is a follow up to my previous question . I am trying to understand the list splitting example in Haskell from here : I can read Haskell ...	[ -0.00153350830078125, 0.00469970703125, -0.01214599609375, 0.0052490234375, -0.0242919921875, 0.0059814453125, -0.004241943359375, -0.00994873046875, 0.0198974609375, 0.0169677734375, 0.0059814453125, -0.01806640625, 0.00811767578125, 0.007080078125, -0.00537109375, -0.0019149780273437...	[ 115059, 8305, 5303, 65450, 32354, 20625, 142508, 10, 23, 42822, 1556, 53, 1257, 28219, 1916, 27781, 3688, 831, 12301, 3714, 2367, 18344, 7569, 83, 18, 903, 18151, 35691, 163, 73342, 41653 ]	[ 0.1697998046875, 0.16748046875, 0.2064208984375, 0.246337890625, 0.1898193359375, 0.128662109375, 0.2259521484375, 0.0638427734375, 0.047637939453125, 0.19384765625, 0.1082763671875, 0.12890625, 0.0035400390625, 0.09173583984375, 0.07012939453125, 0.156005859375, 0.001220703125, 0....	embed
64269188_c0	64269188	haskell	0	Title: Beginner's question about function signature Problem title: Beginner's question about function signature Tags: haskell, types Problem: Beginner's question about function signature I wrote the function pop as follows: pop :: Int n => [a] -> n -> a pop xs n = head $ drop n xs When trying to run it, I get...	Beginner's question about function signature Beginner's question about function signature haskell types Beginner Expected Constraint Beginner's question about function signature I wrote the function pop as follows: When trying to run it, I get an error saying: However, changing the signature to Solves the iss...	[ 0.013427734375, 0.0020599365234375, -0.00604248046875, -0.00238037109375, -0.01470947265625, 0.015869140625, -0.004852294921875, -0.0179443359375, 0.00921630859375, -0.01324462890625, 0.008544921875, -0.036376953125, -0.0113525390625, -0.004425048828125, -0.0115966796875, -0.0189208984...	[ 67053, 56, 3768, 9655, 1672, 32354, 138256, 1556, 142508, 52895, 60075, 13, 89829, 1657, 2816, 54397, 7426, 28960, 31577, 11675, 18499, 54433, 33306, 151134, 70, 47, 6678, 3132, 31089, 44084, 14602, 903, 53383 ]	[ 0.096435546875, 0.05560302734375, 0.0679931640625, 0.0887451171875, 0.01043701171875, 0.2286376953125, 0.292724609375, 0.1431884765625, 0.2452392578125, 0.17626953125, 0.03289794921875, 0.050140380859375, 0.002166748046875, 0.0150146484375, 0.1357421875, 0.0985107421875, 0.2937011718...	embed
15870512_c0	15870512	haskell	0	Title: What does the `-O99` flag do? Problem title: What does the `-O99` flag do? Tags: haskell, ghc Problem: What does the `-O99` flag do? The title is a slight joke. I just discovered today that ghc accepts any optimization level without complaining. I know that -O2 is supposed to be the maximum optimization level, a...	What does the `-O99` flag do? What does the `-O99` flag do? haskell ghc What O99 What does the `-O99` flag do? The title is a slight joke. I just discovered today that ghc accepts any optimization level without complaining. I know that -O2 is supposed to be the maximum optimization level, and that there is a proposed -...	[ 0.002593994140625, 0.00897216796875, -0.0052490234375, -0.0130615234375, -0.0015869140625, 0.01190185546875, -0.0172119140625, -0.003997802734375, 0.004486083984375, 0.04638671875, -0.023193359375, -0.0145263671875, 0.01611328125, -0.00543212890625, -0.002899169921875, 0.00086975097656...	[ 4865, 9, 670, 5046, 49938, 54, 1556, 142508, 31380, 238, 180, 14602, 70, 44759, 20016, 122122, 134053, 18925, 26946, 2499, 87235, 1363, 17366, 15490, 186992, 3714, 20, 304, 134598, 38132, 26171, 363, 3688, 193844, 96276, 121742, 40140, 77546,...	[ 0.05450439453125, 0.1275634765625, 0.1839599609375, 0.3583984375, 0.23876953125, 0.111328125, 0.11962890625, 0.2186279296875, 0.1630859375, 0.161865234375, 0.1754150390625, 0.0261383056640625, 0.06109619140625, 0.0178680419921875, 0.06396484375, 0.082763671875, 0.0618896484375, 0.0...	embed
53106042_c0	53106042	haskell	0	Title: How to use `GenT` in `hedgehog` Problem title: How to use `GenT` in `hedgehog` Tags: haskell-hedgehog, property-based-testing, haskell Problem: How to use `GenT` in `hedgehog` In the hedgehog library, there is a GenT monad transformer. However the forAll function takes a Gen type. There is a forAllT function, bu...	How to use `GenT` in `hedgehog` How to use `GenT` in `hedgehog` haskell-hedgehog property-based-testing haskell How GenT Gen Internal State How to use `GenT` in `hedgehog` In the hedgehog library, there is a GenT monad transformer. However the forAll function takes a Gen type. There is a forAllT function, but it is in ...	[ -0.00433349609375, -0.0001735687255859375, 0.003387451171875, -0.0137939453125, 0.0015869140625, -0.0185546875, 0.005401611328125, -0.036376953125, -0.006683349609375, -0.04296875, 0.017822265625, 0.018798828125, -0.006317138671875, 0.023193359375, 0.0033721923828125, -0.0191650390625,...	[ 11249, 4527, 105376, 618, 23, 5252, 60885, 1663, 47, 1556, 142508, 57266, 77007, 6954, 15937, 106745, 141, 22836, 80568, 35773, 2667, 712, 27198, 56, 100, 43512, 32354, 51776, 10644, 88996, 1884, 145823, 29458, 6044 ]	[ 0.047576904296875, 0.1514892578125, 0.2188720703125, 0.24609375, 0.068115234375, 0.07952880859375, 0.126708984375, 0.1685791015625, 0.011505126953125, 0.07513427734375, 0.15869140625, 0.0545654296875, 0.0162506103515625, 0.0751953125, 0.1861572265625, 0.1353759765625, 0.00244140625, ...	embed
1933283_c0	1933283	haskell	0	Title: What's new in QuickCheck 2? Problem title: What's new in QuickCheck 2? Tags: haskell, quickcheck Problem: What's new in QuickCheck 2? What are the major differences between QuickCheck 1 and QuickCheck 2? From looking at Haddock docs I can see that it is split across more modules, coarbitrary has been r...	What's new in QuickCheck 2? What's new in QuickCheck 2? haskell quickcheck What QuickCheck Fun FunArbitrary What's new in QuickCheck 2? What are the major differences between QuickCheck 1 and QuickCheck 2? From looking at Haddock docs I can see that it is split across more modules, coarbitrary has been replac...	[ -0.006103515625, -0.01141357421875, 0.00150299072265625, 0.01708984375, 0.0033111572265625, 0.03759765625, -0.00616455078125, -0.0181884765625, 0.0084228515625, 0.0322265625, 0.00592041015625, -0.01116943359375, -0.00164794921875, -0.0157470703125, 0.002960205078125, 0.00274658203125, ...	[ 4865, 3768, 3525, 23, 89038, 202567, 116, 1556, 142508, 63773, 78292, 28670, 7614, 3137, 3701, 53, 13036, 60212, 17721, 106, 136, 28129, 138414, 54, 65450, 36880, 1286, 88996, 30291, 1517, 1294, 91995, 10644, 18507, 99156, 28219, 134234, 2667...	[ 0.0248565673828125, 0.033477783203125, 0.1129150390625, 0.055419921875, 0.1527099609375, 0.283447265625, 0.183837890625, 0.07513427734375, 0.1707763671875, 0.1138916015625, 0.2203369140625, 0.177734375, 0.0142669677734375, 0.11474609375, 0.05517578125, 0.051605224609375, 0.0187377929...	embed
21504758_c0	21504758	haskell	0	Title: Haskell demonstration of equivalents to OOP Design Patterns Problem title: Haskell demonstration of equivalents to OOP Design Patterns Tags: design-patterns, haskell Problem: Haskell demonstration of equivalents to OOP Design Patterns There are claims that OOP design patterns are irrelevant in functional languag...	Haskell demonstration of equivalents to OOP Design Patterns Haskell demonstration of equivalents to OOP Design Patterns design-patterns haskell Haskell OOP Design Patterns Haskell demonstration of equivalents to OOP Design Patterns There are claims that OOP design patterns are irrelevant in functional languages. Are th...	[ 0.018310546875, 0.02392578125, 0.001922607421875, -0.0034942626953125, 0.00244140625, 0.003692626953125, 0.007354736328125, 0.01129150390625, 0.0084228515625, 0.006439208984375, -0.0069580078125, -0.0311279296875, 0.00726318359375, 0.002899169921875, 0.00494384765625, 0.000583648681640...	[ 20625, 142508, 32837, 183234, 180, 20880, 11724, 9876, 22766, 4331, 4453, 1556, 140526, 103510, 193, 169429, 123309, 46876, 18151, 8, 840, 12638, 831, 29479, 28484, 53397, 2806, 765, 47, 7639, 33636, 36746, 30563, 35874, 178851, 8780 ]	[ 0.143798828125, 0.2410888671875, 0.1392822265625, 0.13427734375, 0.082275390625, 0.23193359375, 0.1728515625, 0.1407470703125, 0.11572265625, 0.2008056640625, 0.1341552734375, 0.1292724609375, 0.0836181640625, 0.21240234375, 0.039031982421875, 0.16357421875, 0.1251220703125, 0.1242...	embed
43524843_c0	43524843	haskell	0	Title: Remove the Server response header in Yesod/Warp Problem title: Remove the Server response header in Yesod/Warp Tags: yesod, haskell-warp, haskell Problem: Remove the Server response header in Yesod/Warp How can I remove the Server HTTP response header in Yesod? I found code that's responsible for setting that he...	Remove the Server response header in Yesod/Warp Remove the Server response header in Yesod/Warp yesod haskell-warp haskell Remove Server Yesod Warp Remove the Server response header in Yesod/Warp How can I remove the Server HTTP response header in Yesod? I found code that's responsible for setting that header , but I d...	[ -0.01483154296875, 0.006134033203125, 0.00836181640625, 0.024169921875, -0.025390625, 0.006561279296875, -0.0172119140625, 0.01129150390625, -0.00921630859375, 0.01531982421875, 0.006561279296875, 0.028076171875, -0.01019287109375, 0.0032196044921875, -0.00970458984375, 0.0068969726562...	[ 181139, 22687, 57553, 10336, 56, 32635, 2199, 64, 71947, 254, 70, 23, 2422, 23722, 1556, 142508, 4205, 5550, 831, 87388, 135913, 18151, 102778, 53550, 91995, 34292, 201505, 79315, 15190, 13025, 38970, 193348, 12601, 442, 167969 ]	[ 0.164794921875, 0.1790771484375, 0.1666259765625, 0.171875, 0.1383056640625, 0.153076171875, 0.236328125, 0.028961181640625, 0.09814453125, 0.127685546875, 0.00079345703125, 0.02984619140625, 0.107666015625, 0.1796875, 0.07916259765625, 0.177001953125, 0.0867919921875, 0.0910644531...	embed
28011067_c1	28011067	haskell	1	,218 bytes per MUT second Productivity 13.4% of total user, 40.3% of total elapsed The GC time is 87% of the total run time! I am running this on a system with a massive amount of RAM, but when I set a high -H value the performance was worse. It seems that both -H and -A controls the size of gen 0 , but what I would re...	,218 bytes per MUT second Productivity 13.4% of total user, 40.3% of total elapsed The GC time is 87% of the total run time! I am running this on a system with a massive amount of RAM, but when I set a high -H value the performance was worse. It seems that both -H and -A controls the size of gen 0 , but what I would re...	[ -0.00167083740234375, 0.0029449462890625, 0.00970458984375, -0.0014190673828125, 0.004119873046875, -0.0169677734375, -0.017578125, -0.0006256103515625, 0.01361083984375, -0.003936767578125, 0.004547119140625, -0.017333984375, 0.005462646484375, -0.005950927734375, 0, -0.00836181640625...	[ 304, 1819, 390, 1636, 117, 276, 17632, 17932, 73111, 54613, 5847, 11267, 111, 3622, 38937, 1112, 11587, 127966, 69657, 1733, 83, 382, 14427, 11675, 38, 51042, 903, 5426, 106750, 41170, 26959, 5423, 11192, 20, 841, 34292, 23718, 124632, 1650...	[ 0.0614013671875, 0.1591796875, 0.1334228515625, 0.047943115234375, 0.080078125, 0.041839599609375, 0.2359619140625, 0.1690673828125, 0.1390380859375, 0.107666015625, 0.0282135009765625, 0.09979248046875, 0.04290771484375, 0.06671142578125, 0.1708984375, 0.0234222412109375, 0.11975097...	embed
28706603_c0	28706603	haskell	0	Title: Haskell (Yesod) on Amazon Problem title: Haskell (Yesod) on Amazon Tags: yesod, amazon-s3, amazon-web-services, haskell, amazon-ec2 Problem: Haskell (Yesod) on Amazon I want to deploy a system made in Yesod using Amazon Web Service. But can't find a good tutorial or steps on how to do it. Looking for a web host ...	Haskell (Yesod) on Amazon Haskell (Yesod) on Amazon yesod amazon-s3 amazon-web-services haskell amazon-ec2 Haskell Yesod Amazon amazon-s3 amazon-ec2 Haskell (Yesod) on Amazon I want to deploy a system made in Yesod using Amazon Web Service. But can't find a good tutorial or steps on how to do it. Looking for a web host...	[ 0.0101318359375, 0.020751953125, 0.0030517578125, -0.0089111328125, -0.0038909912109375, 0.020751953125, -0.00970458984375, -0.007049560546875, -0.00616455078125, -0.0111083984375, 0.005035400390625, -0.03173828125, -0.0172119140625, 0.00421142578125, -0.00396728515625, -0.00927734375,...	[ 20625, 142508, 91480, 2199, 98, 15075, 2422, 23722, 2527, 5870, 7, 363, 14051, 22584, 1556, 3240, 304, 32635, 3444, 8, 13158, 53, 5426, 7228, 23, 17368, 4002, 12349, 4127, 57143, 98441, 3642, 54, 442, 1467, 27980, 831, 34831, 59947, 83, ...	[ 0.1783447265625, 0.28857421875, 0.1563720703125, 0.2420654296875, 0.1192626953125, 0.1934814453125, 0.116455078125, 0.1951904296875, 0.0506591796875, 0.09967041015625, 0.0828857421875, 0.1888427734375, 0.007537841796875, 0.1123046875, 0.1514892578125, 0.0806884765625, 0.157470703125,...	embed
43739760_c0	43739760	haskell	0	Title: What does pipe symbol mean? Problem title: What does pipe symbol mean? Tags: haskell Problem: What does pipe symbol mean? The following is the haskell comprehensions, what I don't understand is the pipe symbol. What does it mean and what is its role in the function? boomBangs xs = [ if x < 10 then "BOOM!" else "...	What does pipe symbol mean? What does pipe symbol mean? haskell What BOOM BANG What does pipe symbol mean? The following is the haskell comprehensions, what I don't understand is the pipe symbol. What does it mean and what is its role in the function?	[ 0.0027313232421875, -0.00086212158203125, -0.00921630859375, 0.01708984375, -0.005889892578125, 0.02880859375, -0.019287109375, 0.006378173828125, 0.00872802734375, 0.0223388671875, -0.004730224609375, -0.0020294189453125, 0.033447265625, -0.01019287109375, -0.0264892578125, 0.01458740...	[ 4865, 14602, 137158, 26582, 29459, 1556, 142508, 335, 158204, 86256, 25632, 46683, 3220, 2301, 18, 28219, 442, 31486, 32354 ]	[ 0.037994384765625, 0.023101806640625, 0.23583984375, 0.2423095703125, 0.11322021484375, 0.12432861328125, 0.2061767578125, 0.0650634765625, 0.148681640625, 0.204345703125, 0.0033893585205078125, 0.03924560546875, 0.0509033203125, 0.00023674964904785156, 0.01018524169921875, 0.087524414...	embed
47730695_c0	47730695	haskell	0	Title: What is strictness? Problem title: What is strictness? Tags: haskell, lazy-evaluation Problem: What is strictness? In Haskell, I try to understand the notion of strictness. I understand that const x y = x is strict on the first argument but not on the second. But is ifFun pred cons alt = if pred then cons else a...	What is strictness? What is strictness? haskell lazy-evaluation What What is strictness? In Haskell, I try to understand the notion of strictness. I understand that is strict on the first argument but not on the second. But is strict? It is strict on the first argument. I understand that the fact that cons and alt are ...	[ 0.0029754638671875, -0.00001895427703857422, 0.0322265625, 0.01080322265625, 0.0147705078125, 0.016357421875, 0.00128173828125, -0.00193023681640625, -0.00537109375, 0.00860595703125, -0.000942230224609375, -0.005096435546875, -0.005584716796875, 0.015625, -0.000579833984375, 0.0311279...	[ 4865, 83, 81113, 7432, 1556, 142508, 21, 3285, 159258, 360, 20625, 28219, 110, 1363, 98, 5117, 10750, 959, 17932, 1650, 158, 7, 136, 2641, 151575, 96819, 34292, 1653, 32354 ]	[ 0.057769775390625, 0.1121826171875, 0.32763671875, 0.236083984375, 0.0966796875, 0.251708984375, 0.055816650390625, 0.156494140625, 0.15625, 0.012481689453125, 0.131591796875, 0.06939697265625, 0.0806884765625, 0.0198211669921875, 0.09063720703125, 0.084228515625, 0.2049560546875, ...	embed
828191_c0	828191	haskell	0	Title: How do I install nano-hmac on Mac OS X? Problem title: How do I install nano-hmac on Mac OS X? Tags: cabal, c, haskell, macos, openssl Problem: How do I install nano-hmac on Mac OS X? "nano-hmac" is a Haskell package which can normally be installed using Cabal. However, Mac OS X has a different OpenSSL library t...	How do I install nano-hmac on Mac OS X? How do I install nano-hmac on Mac OS X? cabal c haskell macos openssl How Mac How do I install nano-hmac on Mac OS X? "nano-hmac" is a Haskell package which can normally be installed using Cabal. However, Mac OS X has a different OpenSSL library than the one it expects, so it fai...	[ 0.001922607421875, 0.0123291015625, 0.0068359375, 0.011962890625, 0.00982666015625, 0.01458740234375, 0.0120849609375, -0.000774383544921875, -0.0185546875, 0.033203125, -0.01312255859375, -0.0498046875, 0.0206298828125, -0.00653076171875, -0.0057373046875, -0.0233154296875, -0.00646...	[ 11249, 54, 87, 20600, 71819, 9, 127, 35572, 98, 4727, 11787, 1193, 109524, 501, 1556, 142508, 291, 7840, 9803, 7, 24861, 76, 157, 83, 20625, 98169, 831, 3638, 17368, 30438, 289, 12921, 13527, 294, 30508, 35773, 3501, 41206, 35782, 9969, ...	[ 0.0906982421875, 0.047149658203125, 0.06170654296875, 0.21044921875, 0.264892578125, 0.10546875, 0.1455078125, 0.252197265625, 0.12060546875, 0.1822509765625, 0.1700439453125, 0.16064453125, 0.203369140625, 0.05938720703125, 0.102783203125, 0.257568359375, 0.040008544921875, 0.1065...	embed
9720172_c0	9720172	haskell	0	Title: Remove LF from the last line in file Problem title: Remove LF from the last line in file Tags: awk, haskell, sed, vim, scala Problem: Remove LF from the last line in file The last line of my file should not have the LF as last character. In vim I can do :set noendofline binary :wq see http://vim.wikia.com/wiki/F...	Remove LF from the last line in file Remove LF from the last line in file awk haskell sed vim scala the Remove Remove LF from the last line in file The last line of my file should not have the LF as last character. In vim I can do see http://vim.wikia.com/wiki/File_format#Terminator_after_last_line How can I do that wi...	[ 0.00439453125, 0.0186767578125, -0.000728607177734375, 0.006011962890625, -0.0167236328125, -0.00970458984375, 0.0036163330078125, 0.0027008056640625, -0.018798828125, -0.005096435546875, -0.01104736328125, 0.0203857421875, 0.01483154296875, 0.020751953125, -0.01953125, -0.012145996093...	[ 181139, 58545, 1295, 4568, 13315, 23, 11435, 434, 92, 1556, 142508, 1736, 119916, 146232, 5608, 959, 765, 70, 237, 62816, 29671, 174350, 51727, 35484, 1249, 4597, 46327, 19777, 2256, 54, 1632, 79852, 46312, 51713, 137158, 55516, 31251, 9393, ...	[ 0.1888427734375, 0.281494140625, 0.0975341796875, 0.200927734375, 0.184326171875, 0.046173095703125, 0.1973876953125, 0.0877685546875, 0.0845947265625, 0.06195068359375, 0.1915283203125, 0.1351318359375, 0.1962890625, 0.1961669921875, 0.0260772705078125, 0.056060791015625, 0.00573730...	embed
5306717_c1	5306717	haskell	1	77028 0.00 0.00 23.50 31.95 0 0 (Gen: 0) 531936 10796 63686488 0.00 0.00 23.51 31.96 0 0 (Gen: 0) 423260 10047016 63680532 0.03 0.03 23.53 31.99 0 0 (Gen: 1) 531864 6996 63693396 0.00 0.00 23.55 32.01 0 0 (Gen: 0) 531852 9160 63703536 0.00 0.00 23.55 32.01 0 0 (Gen: 0) 531888 9572 63711876 0.00 0.00 23.55 32.01 0 0 (Ge...	77028 0.00 0.00 23.50 31.95 0 0 (Gen: 0) 531936 10796 63686488 0.00 0.00 23.51 31.96 0 0 (Gen: 0) 423260 10047016 63680532 0.03 0.03 23.53 31.99 0 0 (Gen: 1) 531864 6996 63693396 0.00 0.00 23.55 32.01 0 0 (Gen: 0) 531852 9160 63703536 0.00 0.00 23.55 32.01 0 0 (Gen: 0) 531888 9572 63711876 0.00 0.00 23.55 32.01 0 0 (Ge...	[ -0.015869140625, -0.0012359619140625, -0.01556396484375, -0.01324462890625, 0.0029144287109375, 0.000865936279296875, -0.0040283203125, -0.0002765655517578125, 0.016845703125, 0.0262451171875, 0.0150146484375, 0.0302734375, -0.012939453125, -0.0322265625, 0.026611328125, 0.000743865966...	[ 6, 100595, 3882, 37509, 9559, 2525, 15554, 8821, 757, 15, 105376, 12, 16, 8934, 200136, 36225, 11648, 12069, 178475, 161414, 11703, 201, 3742, 97544, 805, 13330, 169887, 173300, 186035, 6460, 89678, 363, 14226, 5046, 4879, 1819, 13307, 305, ...	[ 0.064208984375, 0.290283203125, 0.3193359375, 0.27685546875, 0.216064453125, 0.22265625, 0.2413330078125, 0.2734375, 0.1912841796875, 0.05242919921875, 0.2265625, 0.0927734375, 0.051055908203125, 0.2496337890625, 0.302978515625, 0.23583984375, 0.263916015625, 0.21484375, 0.228027...	embed
27102858_c1	27102858	haskell	1	3.1.0 was selected instead base-4.7.0.0 was excluded because of the top level dependency base -any base-4.7.0.1 was excluded because base-4.3.1.0 was selected instead base-4.7.0.1 was excluded because of the top level dependency base -any Note: caball-install version 0.10.2 using version 1.10.2.0 of the Cabal library G...	3.1.0 was selected instead base-4.7.0.0 was excluded because of the top level dependency base -any base-4.7.0.1 was excluded because base-4.3.1.0 was selected instead base-4.7.0.1 was excluded because of the top level dependency base -any Note: caball-install version 0.10.2 using version 1.10.2.0 of the Cabal library G...	[ -0.0184326171875, 0.00433349609375, 0.02001953125, 0.00762939453125, -0.007354736328125, -0.0283203125, -0.023681640625, 0.004058837890625, 0.0162353515625, 0.045654296875, 0.0022430419921875, -0.01275634765625, 0.005096435546875, 0.015625, -0.000659942626953125, -0.002471923828125, ...	[ 1031, 102107, 133291, 64457, 3647, 11565, 53489, 99929, 39041, 48141, 6637, 2663, 17366, 42548, 27771, 4848, 102014, 9, 158406, 5, 509, 70, 18622, 377, 12126, 80383, 11389, 107754, 133684, 10179, 73011, 30438, 289, 35773, 1294, 527, 73265, 28...	[ 0.1494140625, 0.227783203125, 0.179443359375, 0.071044921875, 0.251953125, 0.1600341796875, 0.1436767578125, 0.2078857421875, 0.1759033203125, 0.1080322265625, 0.011505126953125, 0.085205078125, 0.135009765625, 0.1710205078125, 0.01788330078125, 0.08148193359375, 0.228515625, 0.027...	embed
62854947_c0	62854947	haskell	0	Title: why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) Problem title: why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) Tags: haskell, types, infinite Problem: why it was infinite type ? (Occurs check: cannot construct the infinite type: ...	why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) haskell types infinite xs Occurs Tree Branch Leaf Show Integral _____error________ l:r:xs r:xs l:xs Relevant Stuff try.hs:69:16 try.hs:69:14...	[ 0.0032501220703125, -0.0037078857421875, -0.0031585693359375, 0.00189208984375, 0.01104736328125, -0.02783203125, -0.01324462890625, -0.01507568359375, 0.01275634765625, -0.0308837890625, -0.007049560546875, 0.003509521484375, 0.0174560546875, 0.00628662109375, 0.01220703125, 0.0109252...	[ 15400, 509, 54241, 13, 10644, 670, 238, 48650, 12765, 53418, 64549, 101344, 10, 1556, 142508, 52895, 1022, 180, 21110, 636, 2407, 17367, 204681, 188800, 42, 425, 133, 30624, 2907, 21493, 9790, 127, 14212, 22354, 22635, 442, 73, 48310, 67, ...	[ 0.10736083984375, 0.041961669921875, 0.1776123046875, 0.09869384765625, 0.20458984375, 0.008056640625, 0.03265380859375, 0.167236328125, 0.1278076171875, 0.10321044921875, 0.135498046875, 0.1536865234375, 0.07568359375, 0.0941162109375, 0.21875, 0.156005859375, 0.09722900390625, 0....	embed
36682882_c0	36682882	haskell	0	Title: Chaining two parentheses together using $ operator Problem title: Chaining two parentheses together using $ operator Tags: syntax, dollar-sign, haskell, function-composition Problem: Chaining two parentheses together using $ operator I have this function: min (max 10 20) (max 30 40) I can rewrite this as: min (m...	Chaining two parentheses together using $ operator Chaining two parentheses together using $ operator syntax dollar-sign haskell function-composition $ Chaining Chaining two parentheses together using $ operator I have this function: I can rewrite this as: But is there also a way to resolve these last parentheses? Not ...	[ 0.00170135498046875, 0.00958251953125, 0.0216064453125, 0.0274658203125, 0.01055908203125, 0.01953125, -0.0081787109375, 0.005889892578125, 0.016357421875, -0.046142578125, -0.00689697265625, 0.00897216796875, 0.00244140625, 0.00921630859375, -0.004547119140625, 0.0042724609375, 0.00...	[ 4841, 14653, 6626, 49129, 35412, 90, 25842, 17368, 3650, 39933, 6002, 86531, 15437, 31304, 1556, 142508, 32354, 277, 40322, 765, 903, 831, 456, 434, 18781, 237, 3917, 103608, 6097, 4568, 4127, 17569 ]	[ 0.15869140625, 0.0948486328125, 0.129638671875, 0.17041015625, 0.182861328125, 0.06475830078125, 0.1722412109375, 0.045867919921875, 0.1849365234375, 0.2198486328125, 0.038330078125, 0.064697265625, 0.1724853515625, 0.17724609375, 0.10626220703125, 0.192138671875, 0.1689453125, 0.0...	embed
24481113_c0	24481113	haskell	0	Title: What are some examples of type-level programming? Problem title: What are some examples of type-level programming? Tags: type-level-computation, functional-programming, scala, haskell Problem: What are some examples of type-level programming? I do not understand what "type-level programming" means, nor can I fin...	What are some examples of type-level programming? What are some examples of type-level programming? type-level-computation functional-programming scala haskell What What are some examples of type-level programming? I do not understand what "type-level programming" means, nor can I find a suitable explanation using Goog...	[ 0.006500244140625, -0.009765625, 0.007293701171875, -0.000682830810546875, 0.0087890625, -0.0003204345703125, -0.0189208984375, 0.01416015625, -0.0157470703125, -0.003173828125, -0.0140380859375, -0.018798828125, -0.00457763671875, 0.0213623046875, -0.0084228515625, 0.003387451171875, ...	[ 4865, 621, 3060, 27781, 7, 111, 10644, 9, 67919, 56037, 449, 7077, 123309, 28966, 146232, 1556, 142508, 28219, 2367, 50986, 26950, 187136, 1815, 106804, 5868, 80934, 214709, 80234 ]	[ 0.0263214111328125, 0.0142059326171875, 0.040802001953125, 0.20654296875, 0.0909423828125, 0.03668212890625, 0.2183837890625, 0.07159423828125, 0.259521484375, 0.1927490234375, 0.1300048828125, 0.05474853515625, 0.09375, 0.145751953125, 0.1458740234375, 0.07525634765625, 0.1877441406...	embed
28997603_c0	28997603	haskell	0	Title: Haskell counting number of function call Problem title: Haskell counting number of function call Tags: haskell Problem: Haskell counting number of function call Say I have a function concat :: String -> String -> String . So, var :: String var = concat (concat "a" "b") "c") -- "abc" Now, I have a function which ...	Haskell counting number of function call Haskell counting number of function call haskell Haskell Haskell counting number of function call Say I have a function concat :: String -> String -> String . So, Now, I have a function which I want to use to calculate how many times concat is called: So, func var should return ...	[ 0.017578125, -0.007598876953125, -0.00634765625, 0.01214599609375, 0.014892578125, 0.0224609375, -0.01025390625, -0.006805419921875, 0.0098876953125, -0.054443359375, -0.01361083984375, -0.040771484375, 0.01165771484375, 0.023681640625, 0.0164794921875, -0.017578125, -0.0062255859375...	[ 20625, 142508, 54529, 14012, 32354, 11782, 214, 111, 1556, 765, 158, 4460, 1984, 23351, 33079, 6, 3444, 4527, 74481, 67, 3642, 5941, 20028, 35839, 7477, 285, 5608, 30646, 787, 2046, 34292, 51339 ]	[ 0.1236572265625, 0.1807861328125, 0.13818359375, 0.1326904296875, 0.19970703125, 0.190185546875, 0.050689697265625, 0.06317138671875, 0.123779296875, 0.014495849609375, 0.1490478515625, 0.23779296875, 0.033935546875, 0.1025390625, 0.0330810546875, 0.000946044921875, 0.0272216796875, ...	embed
70766748_c0	70766748	haskell	0	Title: Is there a way to define multiple type synonyms in a single line? Problem title: Is there a way to define multiple type synonyms in a single line? Tags: haskell Problem: Is there a way to define multiple type synonyms in a single line? My code is currently like this: type Speed = Float type Height = Float type F...	Is there a way to define multiple type synonyms in a single line? Is there a way to define multiple type synonyms in a single line? haskell Speed Float Height FuelMass Gravity Is there a way to define multiple type synonyms in a single line? My code is currently like this: is there a way to not be wasting so much space...	[ -0.004730224609375, -0.0015716552734375, -0.0184326171875, 0.02001953125, -0.002532958984375, -0.0042724609375, -0.0026397705078125, -0.0230712890625, 0.00787353515625, 0.01470947265625, -0.011962890625, -0.0272216796875, 0.0113525390625, -0.005767822265625, -0.0291748046875, 0.0354003...	[ 3917, 61924, 48716, 10644, 164661, 7, 11001, 13315, 23, 1556, 142508, 63349, 38699, 1529, 22553, 7680, 53049, 178712, 2685, 18151, 82424, 32628, 21115, 21635 ]	[ 0.07232666015625, 0.181396484375, 0.1719970703125, 0.2105712890625, 0.23974609375, 0.0958251953125, 0.1007080078125, 0.14892578125, 0.013458251953125, 0.0753173828125, 0.2003173828125, 0.078125, 0.08868408203125, 0.043914794921875, 0.0193328857421875, 0.050506591796875, 0.04733276367...	embed
47777649_c0	47777649	haskell	0	Title: Can arrows be used as an alternative to monad transformers? Problem title: Can arrows be used as an alternative to monad transformers? Tags: arrow-abstraction, haskell Problem: Can arrows be used as an alternative to monad transformers? Somewhere I read that Arrows allow to avoid/simplify monads' transformations...	Can arrows be used as an alternative to monad transformers? Can arrows be used as an alternative to monad transformers? arrow-abstraction haskell Can Can arrows be used as an alternative to monad transformers? Somewhere I read that Arrows allow to avoid/simplify monads' transformations (as for me, monad transformers lo...	[ -0.013671875, -0.00653076171875, 0.0260009765625, 0.0087890625, 0.007720947265625, -0.0166015625, -0.0242919921875, 0.004852294921875, -0.006591796875, -0.0196533203125, 0.0228271484375, -0.00921630859375, -0.0034637451171875, 0.0022430419921875, 0.018310546875, -0.01806640625, -0.00...	[ 4171, 118201, 7, 11814, 237, 30700, 2667, 712, 27198, 1314, 47, 2055, 117474, 1556, 142508, 142, 1172, 15555, 63769, 71864, 116120, 40383, 167201, 6713, 2684, 1018, 71216, 13373, 306, 20625, 29568, 27781, 86869, 590, 2594, 116, 93425 ]	[ 0.056884765625, 0.259033203125, 0.162353515625, 0.1312255859375, 0.044036865234375, 0.15771484375, 0.102294921875, 0.1593017578125, 0.2109375, 0.08636474609375, 0.057464599609375, 0.060394287109375, 0.137451171875, 0.07415771484375, 0.216552734375, 0.0205078125, 0.104736328125, 0.2...	embed
78923836_c2	78923836	haskell	2	name, Error, Internal, gst_element_release_request_pad, GST_PAD_PARENT, Now, Returned, Unreffing, Deleting, LANGUAGE, OverloadedLabels, OverloadedStrings, Main, Hello, World, Original, gstreamer.freedesktop.org, helloworld.html, Written, Jaro, Reinders, All, GI.GLib, GLib, GI.Gst, Gst, setObjectPropertyInt32, Data.Text...	name, Error, Internal, gst_element_release_request_pad, GST_PAD_PARENT, Now, Returned, Unreffing, Deleting, LANGUAGE, OverloadedLabels, OverloadedStrings, Main, Hello, World, Original, gstreamer.freedesktop.org, helloworld.html, Written, Jaro, Reinders, All, GI.GLib, GLib, GI.Gst, Gst, setObjectPropertyInt32, Data.Text...	[ 0.0113525390625, 0.02001953125, 0.0035247802734375, 0.01708984375, 0.007171630859375, 0.0089111328125, -0.00701904296875, -0.0213623046875, 0.0023040771484375, 0.00506591796875, 0.005340576171875, -0.044677734375, -0.0037841796875, 0.0001354217529296875, -0.01513671875, 0.0011901855468...	[ 9351, 4, 212059, 106745, 141, 57348, 62766, 233707, 107, 75616, 4299, 159424, 116908, 60436, 20157, 14240, 173340, 297, 992, 4902, 214, 262, 133, 1916, 3358, 98064, 75930, 9578, 63033, 97381, 14794, 71713, 5180, 12321, 35378, 6661, 34525, 706...	[ 0.1556396484375, 0.00970458984375, 0.253173828125, 0.18212890625, 0.06536865234375, 0.2366943359375, 0.24951171875, 0.1807861328125, 0.05584716796875, 0.1639404296875, 0.204345703125, 0.287109375, 0.23486328125, 0.1278076171875, 0.1439208984375, 0.137451171875, 0.1441650390625, 0.0...	embed
31896816_c0	31896816	haskell	0	Title: Haskell STM extension Problem title: Haskell STM extension Tags: haskell Problem: Haskell STM extension I am looking for a Haskell STM extension that I read about in a paper some years ago. I still remember that on the one hand the authors claimed to have significantly improved Haskell STM, on the other hand the...	Haskell STM extension Haskell STM extension haskell Haskell STM Haskell STM extension I am looking for a Haskell STM extension that I read about in a paper some years ago. I still remember that on the one hand the authors claimed to have significantly improved Haskell STM, on the other hand they ran into inconsistencie...	[ -0.0020904541015625, 0.01416015625, 0.022705078125, 0.01336669921875, 0.0186767578125, -0.0128173828125, -0.01556396484375, -0.000009119510650634766, -0.00634765625, -0.0311279296875, 0.01397705078125, -0.003387451171875, -0.0167236328125, 0.0093994140625, 0.0174560546875, 0.0056762695...	[ 20625, 142508, 159, 10111, 111938, 1556, 16487, 100, 10, 12301, 1672, 23, 15122, 3060, 5369, 6650, 7464, 37629, 42179, 63043, 207583, 52295, 71, 13028, 3934, 25553, 6892, 72350, 5809, 959, 73342, 32233, 5299, 3714, 154559, 35672, 53418, 7413,...	[ 0.15966796875, 0.278076171875, 0.11669921875, 0.28076171875, 0.261962890625, 0.08160400390625, 0.10205078125, 0.07513427734375, 0.049835205078125, 0.124755859375, 0.038787841796875, 0.038116455078125, 0.150146484375, 0.01373291015625, 0.09332275390625, 0.0616455078125, 0.052673339843...	embed
60660099_c0	60660099	haskell	0	Title: Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Problem title: Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Tags: haskell Problem: Can someone please explain the following code? to retrieve the diagonal of a ...	Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? haskell haskell Can Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Can...	[ 0.00185394287109375, 0.025146484375, 0.0174560546875, 0.00640869140625, -0.000843048095703125, -0.006500244140625, 0.002838134765625, 0.02587890625, -0.000579833984375, -0.03662109375, 0.00946044921875, -0.00921630859375, -0.017578125, -0.000835418701171875, 0.0006256103515625, 0.00643...	[ 4171, 22008, 22936, 73342, 25632, 18151, 47, 456, 3996, 3134, 70, 207997, 111, 50944, 425, 17368, 1556, 142508, 903, 68330, 194583, 1146, 3642, 30646, 7 ]	[ 0.05389404296875, 0.0213470458984375, 0.07049560546875, 0.1654052734375, 0.09503173828125, 0.1607666015625, 0.03778076171875, 0.0701904296875, 0.1229248046875, 0.09820556640625, 0.044830322265625, 0.268310546875, 0.047393798828125, 0.195556640625, 0.091552734375, 0.0772705078125, 0.1...	embed
25737117_c0	25737117	haskell	0	Title: Haskell this file's path Problem title: Haskell this file's path Tags: haskell Problem: Haskell this file's path Is there a way to get the path of the file where the function is defined? For example: rootappdir \|- Foo.hs \|- Bar.hs module Foo where getThisDir :: IO Filepath getThisDir = ... prelude> get...	Haskell this file's path Haskell this file's path haskell Haskell Foo.hs Bar.hs Foo Filepath Haskell this file's path Is there a way to get the path of the file where the function is defined? For example: If it is possible with an even simpler function :: Filepath, that's even better. Maybe we would need to u...	[ 0.03515625, 0.001007080078125, -0.022216796875, 0.0250244140625, -0.0078125, 0.020263671875, 0.0267333984375, 0.00823974609375, 0.0079345703125, -0.0556640625, -0.0029144287109375, -0.00433349609375, -0.023193359375, 0.0301513671875, -0.0025787353515625, 0.00927734375, -0.00381469726...	[ 20625, 142508, 903, 11435, 3768, 7, 60875, 1556, 9572, 31, 127, 3253, 5, 42724, 128405, 2071, 2685, 10, 3917, 47, 2046, 70, 111, 7440, 32354, 83, 61924, 71, 1326, 7722, 678, 8781, 1984, 11522, 83425, 4527, 479, 63923, 748 ]	[ 0.1446533203125, 0.247314453125, 0.119140625, 0.2154541015625, 0.0843505859375, 0.09844970703125, 0.26416015625, 0.1357421875, 0.14697265625, 0.0635986328125, 0.1197509765625, 0.1572265625, 0.005279541015625, 0.1483154296875, 0.228759765625, 0.004974365234375, 0.0220947265625, 0.03...	embed
40257417_c0	40257417	haskell	0	Title: How write the let program in where? Problem title: How write the let program in where? Tags: haskell Problem: How write the let program in where? This is a program in Haskell that with let: slope (x1,y1) (x2,y2) = let dy = y2-y1 dx = x2-x1 in dy/dx Now I try in where but it's not working properly actually I am u...	How write the let program in where? How write the let program in where? haskell How y2-y1 x2-x1 How write the let program in where? This is a program in Haskell that with let: Now I try in where but it's not working properly actually I am unable to build a allgo for where would you like to write it for me :	[ -0.001708984375, 0.01092529296875, -0.027587890625, -0.00811767578125, -0.004791259765625, 0.02001953125, 0.0111083984375, 0.02001953125, 0.002288818359375, 0.01251220703125, -0.0078125, -0.025146484375, 0.005279541015625, -0.00121307373046875, 0.0155029296875, 0.016357421875, 0.0052...	[ 11249, 33022, 70, 2633, 1528, 23, 7440, 1556, 142508, 113, 18504, 53, 418, 1022, 425, 20625, 678, 9790, 1284, 959, 20697, 155965, 20653, 51, 2886, 45367, 756, 519, 100, 1884, 442, 163 ]	[ 0.1058349609375, 0.1805419921875, 0.0753173828125, 0.253662109375, 0.2239990234375, 0.1226806640625, 0.2132568359375, 0.1104736328125, 0.2147216796875, 0.088623046875, 0.1478271484375, 0.048828125, 0.052520751953125, 0.047821044921875, 0.03857421875, 0.12109375, 0.03533935546875, 0...	embed
53238460_c0	53238460	haskell	0	Title: How does Haskell manage its memory? Problem title: How does Haskell manage its memory? Tags: haskell, ghc, functional-programming, memory-management Problem: How does Haskell manage its memory? So, we know that for most languages, throughout a program's execution: Global variables are stored in static memory. Lo...	How does Haskell manage its memory? How does Haskell manage its memory? haskell ghc functional-programming memory-management How Haskell How does Haskell manage its memory? So, we know that for most languages, throughout a program's execution: Global variables are stored in static memory. Local variables are stored in ...	[ -0.0028839111328125, 0.0107421875, 0.01171875, 0.019775390625, -0.0000362396240234375, 0.0308837890625, -0.015869140625, 0.02099609375, -0.0002593994140625, -0.021240234375, 0.0125732421875, -0.00811767578125, 0.026123046875, 0.0186767578125, 0.0123291015625, 0.0166015625, 0.00271606...	[ 11249, 14602, 20625, 142508, 111240, 6863, 98323, 1556, 31380, 238, 123309, 28966, 87140, 3714, 2684, 46876, 87420, 1528, 71924, 13453, 77336, 4343, 23, 201939, 24172, 177261, 242522, 90965, 764, 2631, 1672, 450, 442, 83, 21, 3285, 43701 ]	[ 0.1077880859375, 0.053985595703125, 0.1776123046875, 0.278564453125, 0.1904296875, 0.1116943359375, 0.254638671875, 0.1507568359375, 0.03533935546875, 0.0504150390625, 0.1046142578125, 0.04437255859375, 0.12890625, 0.0772705078125, 0.0751953125, 0.1436767578125, 0.088134765625, 0.0...	embed
70415447_c0	70415447	haskell	0	Title: How to write a case Maybe statement using where Problem title: How to write a case Maybe statement using where Tags: haskell Problem: How to write a case Maybe statement using where In Haskell, I am trying to write something like function x = do y <- get x put y let z = Map.lookup y case y of Nothing -> Nothing ...	How to write a case Maybe statement using where How to write a case Maybe statement using where haskell where How Maybe Map.lookup Nothing Just How to write a case Maybe statement using where In Haskell, I am trying to write something like I want to replace the "let..case of" block with something like a "where..case of...	[ -0.01373291015625, 0.0103759765625, -0.01202392578125, -0.0234375, 0.0081787109375, -0.0029449462890625, 0.01043701171875, -0.00836181640625, 0.014404296875, -0.006103515625, 0.003753662109375, 0.0106201171875, -0.003692626953125, -0.0191650390625, 0.0177001953125, 0.000452041625976562...	[ 11249, 33022, 7225, 83425, 63805, 17368, 7440, 1556, 142508, 42719, 64747, 2037, 182747, 20625, 31577, 3444, 91995, 1974, 58437, 111, 46389, 678, 136913, 7722 ]	[ 0.07244873046875, 0.1641845703125, 0.251708984375, 0.266845703125, 0.2259521484375, 0.09112548828125, 0.229248046875, 0.1282958984375, 0.2069091796875, 0.163330078125, 0.0760498046875, 0.10357666015625, 0.1201171875, 0.1142578125, 0.034393310546875, 0.0241546630859375, 0.139038085937...	embed
4267011_c0	4267011	haskell	0	Title: Using c2hs on Windows Problem title: Using c2hs on Windows Tags: ffi, c2hs, haskell Problem: Using c2hs on Windows I'm trying to use the libxml-enumerator package on Windows, which (ultimately) needs to use c2hs. When trying to build the relevant package, I get the seemingly infamous "does not exist" error from ...	Using c2hs on Windows Using c2hs on Windows ffi c2hs haskell Using c2hs Windows Using c2hs on Windows I'm trying to use the libxml-enumerator package on Windows, which (ultimately) needs to use c2hs. When trying to build the relevant package, I get the seemingly infamous "does not exist" error from c2hs. This seems to ...	[ 0.00311279296875, 0.021484375, -0.01141357421875, -0.007415771484375, 0.00823974609375, 0.0267333984375, -0.0245361328125, -0.0137939453125, -0.015380859375, -0.05615234375, 0.00057220458984375, -0.038330078125, 0.0225830078125, 0.0023956298828125, 0.01226806640625, -0.002716064453125,...	[ 345, 501, 304, 127, 7, 98, 3773, 24500, 1556, 142508, 31577, 4527, 25474, 131492, 33, 316, 56, 4597, 98169, 77968, 27117, 45367, 29191, 2046, 70, 48903, 51840, 246, 90, 959, 32316, 18499, 1295, 62548, 19441, 527, 13709, 20600, 5303, 11445...	[ 0.0927734375, 0.096435546875, 0.17626953125, 0.211669921875, 0.1650390625, 0.06072998046875, 0.1927490234375, 0.112548828125, 0.1279296875, 0.2340087890625, 0.07177734375, 0.1107177734375, 0.1114501953125, 0.214599609375, 0.02203369140625, 0.181640625, 0.0921630859375, 0.0970458984...	embed
30145271_c0	30145271	haskell	0	Title: What is meant by “replace equals by equals” Problem title: What is meant by “replace equals by equals” Tags: haskell Problem: What is meant by “replace equals by equals” I'm Haskell newbie and reading : http://www.seas.upenn.edu/~cis194/spring13/lectures/01-intro.html It states "In Haskell one can always “replac...	What is meant by “replace equals by equals” What is meant by “replace equals by equals” haskell What What is meant by “replace equals by equals” I'm Haskell newbie and reading : http://www.seas.upenn.edu/~cis194/spring13/lectures/01-intro.html It states "In Haskell one can always “replace equals by equals”, just like y...	[ 0.007598876953125, 0.017333984375, 0.0123291015625, 0.018310546875, -0.00860595703125, -0.006195068359375, -0.0020599365234375, 0.009033203125, 0.00347900390625, 0.003265380859375, 0.00250244140625, -0.0091552734375, 0.00616455078125, 0.0021820068359375, -0.0203857421875, -0.0004844665...	[ 4865, 131148, 107, 23935, 105950, 7, 390, 1556, 142508, 20625, 9014, 16454, 79832, 143669, 4153, 831, 11343, 1884, 97384, 429, 2844, 18507, 92940, 52080, 18614 ]	[ 0.042816162109375, 0.1656494140625, 0.1165771484375, 0.2015380859375, 0.2210693359375, 0.1148681640625, 0.157470703125, 0.1339111328125, 0.212646484375, 0.1162109375, 0.038543701171875, 0.038970947265625, 0.03594970703125, 0.04119873046875, 0.008636474609375, 0.06854248046875, 0.1027...	embed
55109509_c0	55109509	haskell	0	Title: define addition as an instance of Num in haskell Problem title: define addition as an instance of Num in haskell Tags: haskell Problem: define addition as an instance of Num in haskell I wish to define addition between two chars as concatination but im unsure of how to properly do so. my attempt: instance Num Ch...	define addition as an instance of Num in haskell define addition as an instance of Num in haskell haskell Num Char define addition as an instance of Num in haskell I wish to define addition between two chars as concatination but im unsure of how to properly do so. my attempt: but the error i get is that the return type...	[ -0.000728607177734375, -0.01373291015625, 0.027099609375, 0.028564453125, 0.01141357421875, 0.0294189453125, -0.005279541015625, -0.0115966796875, -0.000263214111328125, -0.001953125, -0.0091552734375, -0.052734375, 0.002227783203125, 0.00286865234375, -0.0224609375, -0.0167236328125, ...	[ 61924, 66044, 237, 142, 110527, 52782, 23, 1556, 142508, 111, 21656, 32599, 17721, 6626, 21441, 158, 4460, 73, 2320, 566, 51646, 155965, 81887, 18499, 30646, 10644, 83, 959, 84751, 1632, 140992, 5303, 100, 4806, 408, 5516 ]	[ 0.1702880859375, 0.263671875, 0.0867919921875, 0.05499267578125, 0.26123046875, 0.27294921875, 0.09515380859375, 0.14306640625, 0.240478515625, 0.026458740234375, 0.21484375, 0.040740966796875, 0.1395263671875, 0.1103515625, 0.1751708984375, 0.09613037109375, 0.142822265625, 0.1524...	embed
59219705_c0	59219705	haskell	0	Title: Create list of strings Problem title: Create list of strings Tags: haskell, list, string Problem: Create list of strings I have list of strings field :: [String] field = ["......", "......", "......", "......", "......", "......"] But it is static. I am trying to write function, that take two numbers (length of ...	Create list of strings Create list of strings haskell list string Create Create list of strings I have list of strings But it is static. I am trying to write function, that take two numbers (length of one string X and number of all strings Y). For example: createField 4, 5 It should return this Can you help me with thi...	[ 0.0142822265625, -0.00067901611328125, -0.0167236328125, 0.031982421875, 0.0014801025390625, 0.007720947265625, 0.0218505859375, 0.00119781494140625, 0.0242919921875, 0.0185546875, 0.0118408203125, -0.01495361328125, 0.017822265625, -0.0091552734375, -0.0166015625, -0.0103759765625, ...	[ 151313, 5303, 111, 79315, 1556, 142508, 7, 765, 4966, 83, 201939, 31577, 33022, 32354, 5646, 6626, 101935, 23986, 1632, 1193, 14012, 756, 990, 28282, 6159, 19388, 201, 190, 5608, 30646, 903, 4358 ]	[ 0.1815185546875, 0.2218017578125, 0.1275634765625, 0.250244140625, 0.124755859375, 0.1976318359375, 0.047088623046875, 0.064208984375, 0.01605224609375, 0.0141143798828125, 0.1815185546875, 0.0965576171875, 0.1170654296875, 0.1646728515625, 0.08807373046875, 0.11083984375, 0.14672851...	embed
14700773_c0	14700773	haskell	0	Title: understanding types Problem title: understanding types Tags: haskell Problem: understanding types I am learning Haskell and I want to understand types. Assume that I have an object of type Store : import Data.Map (Map) import qualified Data.Map as Map type Variable = String data Value = IntVal Int \| BoolVal Bool...	understanding types understanding types haskell Data.Map qualified Store Map Variable Value IntVal BoolVal Bool understanding types I am learning Haskell and I want to understand types. Assume that I have an object of type Store : How can use this object, say s to get value of variable? And how to save value of a varia...	[ 0.006805419921875, -0.001678466796875, -0.006103515625, 0.0093994140625, 0.0037994384765625, -0.0031280517578125, -0.0208740234375, 0.003875732421875, -0.0020751953125, -0.00836181640625, 0.01544189453125, -0.00011968612670898438, 0.00347900390625, -0.018310546875, 0.018798828125, 0.00...	[ 100094, 52895, 1556, 142508, 11809, 166179, 217225, 14934, 42719, 84572, 2886, 190060, 42272, 929, 2460, 52080, 20625, 3444, 28219, 66596, 36746, 10644, 11249, 831, 4527, 91, 47, 2046, 34292, 111, 77336, 3642, 30098, 23 ]	[ 0.1728515625, 0.275146484375, 0.12200927734375, 0.212890625, 0.0609130859375, 0.135498046875, 0.1732177734375, 0.236328125, 0.1390380859375, 0.10858154296875, 0.0169219970703125, 0.130859375, 0.16357421875, 0.1185302734375, 0.021484375, 0.050933837890625, 0.10455322265625, 0.010528...	embed
23763199_c0	23763199	haskell	0	Title: How to derive scanr f a = map ( foldr f a ) . tails in Haskell? Problem title: How to derive scanr f a = map ( foldr f a ) . tails in Haskell? Tags: haskell Problem: How to derive scanr f a = map ( foldr f a ) . tails in Haskell? I'm taking a course on Haskell and this is one of my assignments. I'm completely cl...	How to derive scanr f a = map ( foldr f a ) . tails in Haskell? How to derive scanr f a = map ( foldr f a ) . tails in Haskell? haskell How Haskell How to derive scanr f a = map ( foldr f a ) . tails in Haskell? I'm taking a course on Haskell and this is one of my assignments. I'm completely clueless as to how to even ...	[ 0.007659912109375, 0.004486083984375, 0.0142822265625, 0.010986328125, -0.03515625, 0.01007080078125, -0.0130615234375, -0.0103759765625, -0.00128173828125, -0.0284423828125, 0.0106201171875, -0.0023345947265625, -0.0081787109375, 0.02392578125, 0.00555419921875, -0.01318359375, 0.00...	[ 11249, 122, 5844, 44954, 42, 1238, 10, 2203, 22288, 18344, 7569, 308, 7870, 23, 20625, 142508, 47, 1556, 5, 15411, 95486, 64557, 29786, 9393, 9842, 3115, 77947, 27958, 17368, 72607, 92009, 603 ]	[ 0.07708740234375, 0.1304931640625, 0.14111328125, 0.17333984375, 0.1910400390625, 0.1964111328125, 0.1810302734375, 0.0947265625, 0.1800537109375, 0.1162109375, 0.1495361328125, 0.1898193359375, 0.231689453125, 0.0771484375, 0.1334228515625, 0.2147216796875, 0.049835205078125, 0.08...	embed
25970139_c1	25970139	haskell	1	, cgi-3001.1.8.3, containers-0.5.0.0, data-default-0.5.1, deepseq-1.3.0.1, directory-1.2.0.1, dlist-0.5, extensible-exceptions-0.1.1.4, fgl-5.4.2.4, filepath-1.3.0.1, ghc-7.6.3, ghc-prim-0.3.0.0, hashable-1.2.1.0, haskell-src-1.0.1.5, haskell2010-1.1.1.0, haskell98-2.0.0.2, hoopl-3.9.0.0, hpc-0.6.0.0, html-1.0.1.2, int...	-1.0.1.5 haskell2010-1.1.1.0 haskell98-2.0.0.2 hoopl-3.9.0.0 hpc-0.6.0.0 html-1.0.1.2 integer-gmp-0.5.0.0 mtl-2.1.2 network-2.4.1.2 old-locale-1.0.0.5 old-time-1.1.0.1 parallel-3.2.0.3 parsec-3.1.3 pretty-1.1.1.0 primitive-0.5.0.1 process-1.1.0.2 random-1.0.1.1 regex-base-0.93.2 regex-compat-0.95.1 How to use Data.Defa...	[ 0.0019683837890625, -0.0125732421875, 0.0025787353515625, 0.0031890869140625, 0.004913330078125, 0.00012493133544921875, -0.0245361328125, 0.00189208984375, -0.0034027099609375, 0.00421142578125, -0.0213623046875, -0.0252685546875, -0.0015411376953125, -0.00872802734375, 0.00133514404296...	[ 102107, 42876, 1556, 142508, 11436, 92134, 16665, 73011, 5, 133684, 32558, 141, 156611, 99929, 118258, 238, 122887, 7693, 48400, 892, 1505, 2676, 93645, 33120, 116591, 10332, 98908, 6032, 102014, 95103, 107033, 170179, 39797, 81046, 28875, 128489...	[ 0.1611328125, 0.2066650390625, 0.141845703125, 0.204833984375, 0.16455078125, 0.1258544921875, 0.16357421875, 0.09039306640625, 0.020233154296875, 0.1263427734375, 0.08184814453125, 0.094970703125, 0.0980224609375, 0.0693359375, 0.0357666015625, 0.0927734375, 0.1009521484375, 0.177...	embed
78602107_c0	78602107	haskell	0	Title: Which is the cost of `div` in Haskell? Problem title: Which is the cost of `div` in Haskell? Tags: haskell, cost-management Problem: Which is the cost of `div` in Haskell? I'm trying to calculate the cost of a function izq where I use the function div inside: izq n \| even (n - 1) = ((n - 1) `div` 2) \| otherwise ...	Which is the cost of `div` in Haskell? Which is the cost of `div` in Haskell? haskell cost-management Which Haskell Which is the cost of `div` in Haskell? I'm trying to calculate the cost of a function izq where I use the function div inside: So work of izq is 1 + the cost of div applied to (n - 1). However, I'm unsure...	[ -0.0069580078125, 0.0181884765625, 0.0086669921875, -0.0069580078125, 0.0150146484375, -0.00457763671875, -0.0126953125, -0.0206298828125, 0.01385498046875, -0.043701171875, 0.0242919921875, -0.0115966796875, -0.005889892578125, 0.01531982421875, -0.00994873046875, 0.003387451171875, ...	[ 130078, 83, 70, 11034, 111, 30618, 23, 20625, 142508, 1556, 87140, 9473, 1135, 31577, 74481, 32354, 445, 864, 4527, 18221, 46132, 4488, 106, 997, 190659, 19, 20, 4879, 51646, 3714, 222201 ]	[ 0.08984375, 0.0911865234375, 0.093994140625, 0.2108154296875, 0.103759765625, 0.26025390625, 0.096923828125, 0.1395263671875, 0.2529296875, 0.1103515625, 0.08721923828125, 0.002105712890625, 0.0035400390625, 0.00830078125, 0.1016845703125, 0.142822265625, 0.13134765625, 0.166381835...	embed
9216944_c0	9216944	haskell	0	Title: Error in cabal-installing hspec Problem title: Error in cabal-installing hspec Tags: cabal-install, cabal, haskell Problem: Error in cabal-installing hspec I'm trying to install hspec, but I'm getting this: $ cabal install hspec Resolving dependencies... cabal: dependencies conflict: ghc-7.2.2 requires container...	Error in cabal-installing hspec Error in cabal-installing hspec cabal-install cabal haskell Error Resolving ghc-7.2.2 containers-0.4.2.0 Error in cabal-installing hspec I'm trying to install hspec, but I'm getting this: What does this even mean? Also, using ghc 7.2.2, cabal 10.2.	[ 0.0036468505859375, 0.00494384765625, -0.00408935546875, 0.0025787353515625, -0.01397705078125, -0.0166015625, -0.0191650390625, 0.00909423828125, 0.0025634765625, 0.02294921875, 0.001190185546875, -0.026611328125, -0.00201416015625, -0.00811767578125, 0.00604248046875, 0.0139770507812...	[ 212059, 23, 109524, 80383, 1096, 16711, 214, 1556, 142508, 132944, 31380, 238, 16709, 70147, 116419, 7, 121254, 73011, 31577, 20600, 4, 1284, 903, 4865, 14602, 29459, 17368, 2861, 4068, 5442 ]	[ 0.1502685546875, 0.054962158203125, 0.209228515625, 0.150390625, 0.155029296875, 0.263916015625, 0.0220489501953125, 0.10009765625, 0.1728515625, 0.1143798828125, 0.1116943359375, 0.101318359375, 0.02655029296875, 0.16357421875, 0.17431640625, 0.016998291015625, 0.1444091796875, 0....	embed
5745302_c1	5745302	haskell	1	-> TyRep -> TyRep -> Bool isNthArg n arg func = Just arg == lookup n (zip [1..] (typeRepArgs func)) nrArgs :: TyRep -> Int nrArgs = (\x -> x - 1) . length . typeRepArgs Is there anything that can implement the magicApplyFunction ? EDIT: I finally got back to playing with this. The magic apply function is: buildFunc ::...	-> TyRep -> TyRep -> Bool isNthArg n arg func = Just arg == lookup n (zip [1..] (typeRepArgs func)) nrArgs :: TyRep -> Int nrArgs = (\x -> x - 1) . length . typeRepArgs Is there anything that can implement the magicApplyFunction ? EDIT: I finally got back to playing with this. The magic apply function is: buildFunc ::...	[ -0.0194091796875, 0.00811767578125, 0.00087738037109375, -0.005767822265625, 0.00396728515625, 0.0135498046875, 0.0021209716796875, 0.007171630859375, 0.015380859375, -0.0169677734375, 0.0150146484375, -0.044189453125, -0.00860595703125, 0.0177001953125, 0.00384521484375, -0.0256347656...	[ 33079, 8064, 4332, 254, 2460, 929, 83, 927, 7614, 177, 653, 79459, 7477, 9563, 69112, 6713, 2037, 50836, 50986, 9405, 4115, 360, 18, 2203, 425, 1022, 4879, 140909, 10644, 2685, 23937, 831, 29479, 49846, 39179, 538, 97249, 10763, 77681, 44...	[ 0.02435302734375, 0.1636962890625, 0.18603515625, 0.1988525390625, 0.0557861328125, 0.202392578125, 0.0855712890625, 0.085693359375, 0.1351318359375, 0.1026611328125, 0.049041748046875, 0.1995849609375, 0.1383056640625, 0.1500244140625, 0.0227508544921875, 0.05828857421875, 0.0916748...	embed
12703151_c0	12703151	haskell	0	Title: Make GHC accept Main module with a main function that isn't IO () Problem title: Make GHC accept Main module with a main function that isn't IO () Tags: ghc, haskell Problem: Make GHC accept Main module with a main function that isn't IO () Is there some way (flag or hack) to make GHC accept a main mod...	Make GHC accept Main module with a main function that isn't IO () Make GHC accept Main module with a main function that isn't IO () ghc haskell Make GHC Main Fay Make GHC accept Main module with a main function that isn't IO () Is there some way (flag or hack) to make GHC accept a main module where the main f...	[ 0.0078125, 0.01953125, 0.01611328125, 0.016845703125, -0.011474609375, 0.00543212890625, 0.004241943359375, -0.003692626953125, -0.010009765625, -0.016845703125, -0.005401611328125, -0.041748046875, 0.01165771484375, -0.0038909912109375, 0.0107421875, -0.01513671875, 0.0140380859375,...	[ 26176, 527, 73265, 26946, 12321, 88996, 678, 5201, 32354, 450, 56112, 3768, 18, 6, 17780, 31380, 238, 1556, 142508, 114162, 3060, 3917, 190872, 707, 85526, 3249, 7440, 70, 138256, 1326, 765, 10644, 14602, 959, 903, 2174, 83, 9351, 25737, ...	[ 0.1395263671875, 0.14599609375, 0.288818359375, 0.2203369140625, 0.1900634765625, 0.236083984375, 0.093505859375, 0.1748046875, 0.2301025390625, 0.06597900390625, 0.146240234375, 0.0748291015625, 0.16064453125, 0.010223388671875, 0.2296142578125, 0.142822265625, 0.134521484375, 0.1...	embed
3533745_c1	3533745	haskell	1	s) = m st in (f a, s)) instance Applicative S where pure a = S (\st -> (a, st)) however nothing runs in GHC due to the fact that the lambda expression is hidden inside that type constructor. Now the only solution I see is to define a function: isntThisAnnoying s (S m) = m s in order to bind s to 'st' and actually retu...	s) = m st in (f a, s)) instance Applicative S where pure a = S (\st -> (a, st)) however nothing runs in GHC due to the fact that the lambda expression is hidden inside that type constructor. Now the only solution I see is to define a function: isntThisAnnoying s (S m) = m s in order to bind s to 'st' and actually retu...	[ -0.0113525390625, 0.0111083984375, 0.0037994384765625, -0.01104736328125, -0.01544189453125, 0.012939453125, 0.00051116943359375, -0.0106201171875, 0.0177001953125, -0.02001953125, 0.00469970703125, 0.01025390625, -0.0233154296875, 0.005523681640625, -0.01068115234375, 0.00059127807617...	[ 91, 16, 2203, 347, 6138, 23, 420, 10, 110527, 5659, 11048, 4935, 159, 34166, 41872, 271, 33079, 11, 33720, 127877, 527, 73265, 21, 6492, 85, 125195, 83, 204105, 46132, 10644, 64549, 748, 4734, 29806, 1957, 61924, 32354, 660, 73243, 7251, ...	[ 0.209228515625, 0.1199951171875, 0.148193359375, 0.13671875, 0.1676025390625, 0.1370849609375, 0.098388671875, 0.1231689453125, 0.2237548828125, 0.1458740234375, 0.1796875, 0.1558837890625, 0.1802978515625, 0.1494140625, 0.0235748291015625, 0.16064453125, 0.026824951171875, 0.07611...	embed
51392021_c0	51392021	haskell	0	Title: Why is colon right associative in this expression? Problem title: Why is colon right associative in this expression? Tags: brackets, haskell Problem: Why is colon right associative in this expression? Because function application is left associative in Haskell, I expect 'x':'y':"z" to be equivalent to ('x':'y'):...	Why is colon right associative in this expression? Why is colon right associative in this expression? brackets haskell Why Why is colon right associative in this expression? Because function application is left associative in Haskell, I expect to be equivalent to ('x':'y'):"z" . ('x':'y') is an error, because 'y' is no...	[ -0.00970458984375, -0.00970458984375, 0.004058837890625, 0.0196533203125, 0.0166015625, -0.002044677734375, 0.0115966796875, -0.004913330078125, 0.021484375, 0.022216796875, 0.0296630859375, -0.02880859375, 0.01708984375, 0.001739501953125, -0.0062255859375, -0.01373291015625, -0.019...	[ 44084, 46512, 7108, 166027, 272, 23, 903, 125195, 1620, 27853, 1556, 142508, 83, 32354, 38415, 25737, 20625, 41206, 183234, 425, 12, 53, 169, 18499, 5303, 5608, 151575, 50878, 1884, 165164, 73342 ]	[ 0.11376953125, 0.2286376953125, 0.2052001953125, 0.1756591796875, 0.10150146484375, 0.0269012451171875, 0.01947021484375, 0.190185546875, 0.132080078125, 0.1761474609375, 0.1119384765625, 0.231201171875, 0.0166473388671875, 0.138671875, 0.1748046875, 0.1435546875, 0.1201171875, 0.0...	embed
19497940_c0	19497940	haskell	0	Title: Haskell: Why does RealFrac not imply Fractional? Problem title: Haskell: Why does RealFrac not imply Fractional? Tags: types, haskell Problem: Haskell: Why does RealFrac not imply Fractional? Code signals: the, a, Haskell, Why, RealFrac, Fractional, S.index, S.sort, Floating, Ord, Random, S.Seq, StateT, Data.Fun...	Haskell: Why does RealFrac not imply Fractional? Haskell: Why does RealFrac not imply Fractional? types haskell the a Haskell Why RealFrac Fractional S.index S.sort Floating Ord Random S.Seq StateT Data.Functor.Identity.Identity S.fromList GA.hs:85:37 Possible Note Double Defined GHC.Float Float Integral GHC.Real.Ratio...	[ -0.0076904296875, 0.00506591796875, 0.0184326171875, -0.0002765655517578125, 0.01373291015625, 0.018310546875, -0.0191650390625, -0.019287109375, 0.007110595703125, 0.0213623046875, -0.005523681640625, -0.0184326171875, -0.01312255859375, -0.01025390625, -0.0031585693359375, 0.01867675...	[ 20625, 142508, 44084, 5120, 919, 20251, 959, 21980, 538, 7868, 10763, 289, 52895, 1556, 10, 159, 4711, 62351, 38699, 35379, 39643, 864, 22836, 11809, 97249, 37379, 161063, 154663, 23749, 12951, 30225, 115861, 107172, 5983, 73265, 365, 204681, ...	[ 0.1119384765625, 0.2333984375, 0.1142578125, 0.20703125, 0.09002685546875, 0.2252197265625, 0.0880126953125, 0.1312255859375, 0.065185546875, 0.2113037109375, 0.1436767578125, 0.114013671875, 0.187255859375, 0.1044921875, 0.08056640625, 0.0771484375, 0.1683349609375, 0.146606445312...	embed
4447130_c0	4447130	haskell	0	Title: make: Could not find module 'System' Problem title: make: Could not find module 'System' Tags: cabal, haskell Problem: make: Could not find module 'System' Yesterday I had a failing darcs install with cabal, today I get this when running ghc --make node.hs: node.hs:13:8: Could not find module...	make: Could not find module 'System' make: Could not find module 'System' cabal haskell Could System make: Could not find module 'System' Yesterday I had a failing darcs install with cabal, today I get this when running ghc --make node.hs: Somewhere along the lines cabal seem to have borked it's sys...	[ 0.00531005859375, 0.0128173828125, 0.002777099609375, 0.0086669921875, 0.01153564453125, 0.010986328125, -0.004150390625, 0.002593994140625, -0.0052490234375, -0.007568359375, -0.019287109375, -0.037841796875, 0.003173828125, -0.005706787109375, -0.005828857421875, -0.00848388671875, ...	[ 3249, 191147, 959, 7413, 88996, 3768, 84293, 109524, 1556, 142508, 12353, 35782, 214, 1011, 4439, 20600, 678, 903, 51042, 31380, 238, 55898, 110, 112, 127, 7, 136913, 124519, 48903, 765, 3017, 12225, 5426, 831, 121461, 4527, 11389, 2861, 10...	[ 0.1324462890625, 0.1044921875, 0.08203125, 0.1522216796875, 0.239501953125, 0.03070068359375, 0.2117919921875, 0.2374267578125, 0.131103515625, 0.233154296875, 0.1571044921875, 0.1026611328125, 0.024627685546875, 0.1240234375, 0.1165771484375, 0.096923828125, 0.00341796875, 0.02571...	embed
62819233_c0	62819233	haskell	0	Title: Best way to do convex optimization in Haskell? Problem title: Best way to do convex optimization in Haskell? Tags: convex-optimization, haskell, mathematical-optimization Problem: Best way to do convex optimization in Haskell? I'm looking to do some simple convex optimization in Haskell; nothing too fancy, just ...	Best way to do convex optimization in Haskell? Best way to do convex optimization in Haskell? convex-optimization haskell mathematical-optimization Best Haskell Best way to do convex optimization in Haskell? I'm looking to do some simple convex optimization in Haskell; nothing too fancy, just minimizing linear function...	[ 0.001861572265625, 0.0021820068359375, 0.0201416015625, 0.009521484375, -0.000640869140625, 0.00372314453125, -0.00543212890625, -0.01104736328125, 0.000667572021484375, -0.009765625, 0.0177001953125, -0.0274658203125, 0.031494140625, 0.002655029296875, -0.00848388671875, 0.00958251953...	[ 11345, 3917, 54, 158, 272, 425, 87235, 1363, 23, 20625, 142508, 47, 100433, 47691, 1556, 140363, 70760, 16487, 8781, 1207, 14786, 84382, 192617, 32354, 68587, 9523, 2816, 36880, 101422, 1542, 2965, 98169, 60042, 5570, 30700 ]	[ 0.1258544921875, 0.0885009765625, 0.052032470703125, 0.1329345703125, 0.224609375, 0.1395263671875, 0.2017822265625, 0.1004638671875, 0.08062744140625, 0.1649169921875, 0.256591796875, 0.0181121826171875, 0.1748046875, 0.0386962890625, 0.146240234375, 0.0253753662109375, 0.0122070312...	embed
14865362_c0	14865362	haskell	0	Title: Parse error in pattern Haskell Problem title: Parse error in pattern Haskell Tags: haskell, parse-error, pattern-matching, operator-precedence Problem: Parse error in pattern Haskell Why am I getting a parse error in this code? data One = H\| I deriving (Read,Show,Eq) data E = A \| B deriving (Read,Show,Eq) type L...	Parse error in pattern Haskell Parse error in pattern Haskell haskell parse-error pattern-matching operator-precedence Parse Haskell One Read Show fun1 fun2 x:xs Parse error in pattern Haskell Why am I getting a parse error in this code?	[ -0.0001583099365234375, 0.00628662109375, -0.0228271484375, 0.0184326171875, 0.005584716796875, 0.01123046875, -0.0211181640625, 0.0006256103515625, 0.02197265625, -0.0238037109375, 0.016357421875, -0.007354736328125, 0.03076171875, -0.01123046875, 0.015380859375, 0.00445556640625, -...	[ 2392, 184, 18499, 103510, 20625, 142508, 23, 1556, 366, 188800, 98753, 214, 39933, 4692, 37534, 6561, 4764, 17367, 7477, 418, 304, 1022, 12, 425, 903, 18151 ]	[ 0.12890625, 0.1514892578125, 0.19091796875, 0.2230224609375, 0.12188720703125, 0.201171875, 0.014892578125, 0.11627197265625, 0.132568359375, 0.1839599609375, 0.15185546875, 0.04193115234375, 0.173828125, 0.031890869140625, 0.09912109375, 0.1097412109375, 0.15576171875, 0.148193359...	embed
8350706_c0	8350706	haskell	0	Title: How do I find the alignment value when defining a storable instance Problem title: How do I find the alignment value when defining a storable instance Tags: alignment, ffi, haskell Problem: How do I find the alignment value when defining a storable instance If I have access to the C struct definition in the head...	How do I find the alignment value when defining a storable instance How do I find the alignment value when defining a storable instance alignment ffi haskell How How do I find the alignment value when defining a storable instance If I have access to the C struct definition in the header files but want to define my stor...	[ 0.01544189453125, 0.0213623046875, -0.00421142578125, -0.00138092041015625, 0.000591278076171875, 0.028076171875, -0.00191497802734375, 0.0279541015625, 0.00970458984375, -0.00185394287109375, 0.0091552734375, -0.01409912109375, -0.000469207763671875, -0.005279541015625, 0.0135498046875,...	[ 11249, 7413, 70, 143420, 674, 34292, 13204, 449, 3082, 2886, 110527, 87, 24500, 1556, 142508, 17203, 313, 36716, 80934, 10336, 56, 102158, 61924, 23009, 1096, 10382, 304, 127, 3642, 5809, 44691, 22304, 150631, 52490, 23718 ]	[ 0.04296875, 0.134033203125, 0.030914306640625, 0.283203125, 0.1649169921875, 0.20458984375, 0.1876220703125, 0.046051025390625, 0.207275390625, 0.1888427734375, 0.2091064453125, 0.0069580078125, 0.1143798828125, 0.112060546875, 0.1959228515625, 0.0238189697265625, 0.0616455078125, ...	embed
61666253_c1	61666253	haskell	1	stmt of a 'do' block: uri <- do scheme <- URI.mkScheme sc host <- URI.mkHost $ (hostName <> "." <> tld) return $ URI.URI (Just scheme) (Right (URI.Authority Nothing host Nothing)) Nothing [] Nothing From the error, I suspect that my intuition about unwrapping and wrapping the URI pieces is wrong. Where do I err? What ...	stmt of a 'do' block: uri <- do scheme <- URI.mkScheme sc host <- URI.mkHost $ (hostName <> "." <> tld) return $ URI.URI (Just scheme) (Right (URI.Authority Nothing host Nothing)) Nothing [] Nothing From the error, I suspect that my intuition about unwrapping and wrapping the URI pieces is wrong. Where do I err? What ...	[ -0.01483154296875, 0.0159912109375, -0.00445556640625, 0.01422119140625, -0.007720947265625, -0.0029296875, 0.00439453125, -0.037353515625, 0.00848388671875, -0.01519775390625, -0.0137939453125, -0.00067138671875, -0.015869140625, -0.01458740234375, -0.01422119140625, 0.00726318359375,...	[ 6138, 39, 18, 111, 246, 46389, 39074, 54, 150370, 46492, 19201, 25452, 12549, 9023, 27980, 11193, 3650, 40294, 75137, 30646, 127794, 22553, 1003, 5922, 182747, 28090, 18499, 92610, 58868, 51, 5429, 11, 26783, 137565, 10366, 126371, 44691, 72,...	[ 0.127685546875, 0.05718994140625, 0.109375, 0.0245513916015625, 0.1766357421875, 0.2076416015625, 0.2083740234375, 0.1151123046875, 0.166015625, 0.222900390625, 0.061614990234375, 0.11865234375, 0.08062744140625, 0.048614501953125, 0.1697998046875, 0.1260986328125, 0.05706787109375, ...	embed
35250876_c0	35250876	haskell	0	Title: Getting Parsed and Type-annotated Haskell Code Problem title: Getting Parsed and Type-annotated Haskell Code Tags: ghc, haskell, parsing Problem: Getting Parsed and Type-annotated Haskell Code I am trying to parse Haskell source code and generate a decision tree to analyze different paths Haskell programs can ta...	Getting Parsed and Type-annotated Haskell Code Getting Parsed and Type-annotated Haskell Code ghc haskell parsing Getting Parsed Type-annotated Haskell Getting Parsed and Type-annotated Haskell Code I am trying to parse Haskell source code and generate a decision tree to analyze different paths Haskell programs can tak...	[ 0.0252685546875, 0.0201416015625, 0.006439208984375, 0.01287841796875, 0.018798828125, 0.01202392578125, -0.0223388671875, -0.01409912109375, -0.0145263671875, -0.04541015625, 0.007354736328125, -0.031494140625, -0.005584716796875, 0.0093994140625, -0.0002727508544921875, 0.0205078125,...	[ 210732, 2392, 5281, 136, 60457, 11071, 102, 20625, 142508, 28864, 31380, 238, 1556, 366, 6953, 31577, 184, 31344, 18151, 139392, 51957, 53201, 7968, 12921, 60875, 103391, 5646, 19437, 3355, 933, 76199, 169022, 18811, 959, 10644, 4677, 137272, ...	[ 0.11669921875, 0.171875, 0.093505859375, 0.0640869140625, 0.20654296875, 0.1148681640625, 0.057098388671875, 0.140869140625, 0.22705078125, 0.177734375, 0.1265869140625, 0.115234375, 0.1275634765625, 0.15234375, 0.021881103515625, 0.0144500732421875, 0.06256103515625, 0.10729980468...	embed
37123671_c0	37123671	haskell	0	Title: haskell, list of lists with a specific form (list comprehension) Problem title: haskell, list of lists with a specific form (list comprehension) Tags: set, haskell, list-comprehension, list Problem: haskell, list of lists with a specific form (list comprehension) i want to create a functions that takes a list an...	haskell, list of lists with a specific form (list comprehension) haskell, list of lists with a specific form (list comprehension) set haskell list-comprehension list Main haskell, list of lists with a specific form (list comprehension) i want to create a functions that takes a list and creates a list of list with list ...	[ 0.0098876953125, 0.0155029296875, 0.01141357421875, -0.0179443359375, 0.00897216796875, 0.0034637451171875, 0.0164794921875, 0.030517578125, -0.0155029296875, -0.007568359375, 0.01177978515625, -0.019775390625, 0.0244140625, 0.0203857421875, -0.0294189453125, -0.0027313232421875, 0.0...	[ 1556, 142508, 5303, 111, 7, 678, 29458, 3173, 6562, 46683, 3220, 6889, 4, 5423, 277, 4692, 12321, 17, 3444, 28282, 32354, 51776, 136, 13, 76172, 418, 90173, 304, 96386, 27781, 2646, 28864 ]	[ 0.1954345703125, 0.272216796875, 0.2303466796875, 0.07318115234375, 0.04803466796875, 0.1036376953125, 0.17626953125, 0.2034912109375, 0.1951904296875, 0.1700439453125, 0.1728515625, 0.05841064453125, 0.0149993896484375, 0.180419921875, 0.06982421875, 0.1466064453125, 0.10302734375, ...	embed
53023462_c0	53023462	haskell	0	Title: How do I create a UTCTime value using the time library in Haskell? Problem title: How do I create a UTCTime value using the time library in Haskell? Tags: haskell-time, haskell Problem: How do I create a UTCTime value using the time library in Haskell? I've got a year, month, day, hour and minute value (all of t...	How do I create a UTCTime value using the time library in Haskell? How do I create a UTCTime value using the time library in Haskell? haskell-time haskell the How UTCTime Haskell How do I create a UTCTime value using the time library in Haskell? I've got a year, month, day, hour and minute value (all of them are of typ...	[ -0.0081787109375, 0.006622314453125, 0.01214599609375, 0.000637054443359375, 0.0036773681640625, -0.03369140625, -0.01336669921875, -0.01251220703125, -0.0103759765625, -0.02392578125, -0.0025482177734375, -0.002166748046875, 0.0308837890625, 0.0166015625, 0.002685546875, -0.0148925781...	[ 11249, 28282, 10, 99577, 70059, 34292, 17368, 1733, 35773, 1294, 20625, 142508, 1556, 6032, 70, 54, 87, 23, 4163, 6602, 31150, 5155, 56816, 15393, 10644, 360, 18, 3642, 96760, 6097, 47, 142424, 96055, 282, 5 ]	[ 0.0791015625, 0.14208984375, 0.05010986328125, 0.210205078125, 0.262451171875, 0.173095703125, 0.0340576171875, 0.1492919921875, 0.1756591796875, 0.04315185546875, 0.123779296875, 0.2303466796875, 0.091064453125, 0.11865234375, 0.013275146484375, 0.01104736328125, 0.029754638671875, ...	embed
21485884_c0	21485884	haskell	0	Title: What does the Haskell function forall do and where is it defined? Problem title: What does the Haskell function forall do and where is it defined? Tags: haskell Problem: What does the Haskell function forall do and where is it defined? I'm reading A Little Lens Starter Tutorial and they use a seemingly magical f...	What does the Haskell function forall do and where is it defined? What does the Haskell function forall do and where is it defined? haskell What Haskell What does the Haskell function forall do and where is it defined? I'm reading A Little Lens Starter Tutorial and they use a seemingly magical function forall like this...	[ 0.0233154296875, 0.00653076171875, -0.0086669921875, -0.001129150390625, 0.01104736328125, 0.01397705078125, 0.01324462890625, -0.010986328125, 0.0086669921875, -0.026611328125, 0.016845703125, -0.00811767578125, 0.0057373046875, -0.004150390625, -0.019287109375, -0.000705718994140625,...	[ 4865, 70, 20625, 142508, 32354, 100, 5584, 54, 7440, 442, 61924, 71, 14602, 1556, 83, 16454, 59784, 18226, 13794, 56, 183447, 4527, 48903, 49846, 903, 66161, 98169, 1295, 7413, 152488, 133 ]	[ 0.08203125, 0.058441162109375, 0.1480712890625, 0.293212890625, 0.1962890625, 0.138671875, 0.25634765625, 0.1068115234375, 0.1044921875, 0.05279541015625, 0.134765625, 0.044830322265625, 0.06842041015625, 0.127685546875, 0.005035400390625, 0.001220703125, 0.07562255859375, 0.136230...	embed
43605754_c1	43605754	haskell	1	6dac65e3174dea79df54ce6d56f3e98bc060ecc (3647 commits) x86_64 hpack-0.14.0 The same after a stack upgrade to 1.4.0 . Passing the entire command as a string (another suggestion) results in a command with that name not being found >stack exec -- "iterate-strict-exe 25 +RTS -s" Executable named iterate-strict-exe 25 +RTS ...	6dac65e3174dea79df54ce6d56f3e98bc060ecc (3647 commits) x86_64 hpack-0.14.0 The same after a stack upgrade to 1.4.0 . Passing the entire command as a string (another suggestion) results in a command with that name not being found >stack exec -- "iterate-strict-exe 25 +RTS -s" Executable named iterate-strict-exe 25 +RTS ...	[ 0.0040283203125, -0.01287841796875, -0.01068115234375, 0.033447265625, -0.0038604736328125, 0.026123046875, 0.0128173828125, -0.011474609375, 0.00408935546875, 0.0005950927734375, 0.00811767578125, -0.004669189453125, -0.0111083984375, 0.000659942626953125, -0.00799560546875, 0.0144042...	[ 305, 12424, 158696, 112, 22377, 16665, 130997, 10060, 195807, 375, 4007, 15276, 13307, 1096, 29102, 102014, 151152, 5701, 7103, 177261, 116086, 615, 28872, 64194, 75101, 237, 10, 79315, 199015, 50339, 9351, 959, 8035, 14037, 590, 2594, 1119, ...	[ 0.05438232421875, 0.0352783203125, 0.04791259765625, 0.0150299072265625, 0.027587890625, 0.009063720703125, 0.02880859375, 0.033294677734375, 0.0555419921875, 0.010986328125, 0.138916015625, 0.1715087890625, 0.15234375, 0.114501953125, 0.26953125, 0.0853271484375, 0.1904296875, 0.0...	embed
47577986_c2	47577986	haskell	2	, Lib.hs, LANGUAGE, OverloadedStrings, OPTIONS_GHC, Just, MonadHttp, One, POST, httpbin.org, URL, ReqBodyJson, Value, basement-0.0.4, zlib-0.6.1.2, aeson-1.1.2.0, network-2.6.3.2, th-lift-instances-0.1.11, Progress, While, stack7830, x86_64-linux-tinfo6-nopie, Cabal-1.24.2.0, x86_64-linux, ghc-tinfo6-nopie-8.0.2, lts-9...	, Lib.hs, LANGUAGE, OverloadedStrings, OPTIONS_GHC, Just, MonadHttp, One, POST, httpbin.org, URL, ReqBodyJson, Value, basement-0.0.4, zlib-0.6.1.2, aeson-1.1.2.0, network-2.6.3.2, th-lift-instances-0.1.11, Progress, While, stack7830, x86_64-linux-tinfo6-nopie, Cabal-1.24.2.0, x86_64-linux, ghc-tinfo6-nopie-8.0.2, lts-9...	[ -0.005615234375, 0.00921630859375, 0.0025482177734375, 0.01153564453125, -0.00848388671875, -0.00164794921875, -0.00726318359375, 0.00286865234375, 0.000659942626953125, 0.0159912109375, 0.004241943359375, 0.000919342041015625, -0.01544189453125, -0.00457763671875, -0.000972747802734375,...	[ 6, 4, 43278, 5, 127, 7, 3358, 98064, 75930, 9578, 63033, 297, 71713, 5180, 28023, 165117, 41877, 441, 9563, 60331, 71, 3062, 254, 6561, 81903, 1621, 7568, 1478, 31862, 853, 864, 12647, 1459, 1375, 1681, 190060, 3647, 674, 23320, 121254, ...	[ 0.05267333984375, 0.1002197265625, 0.1827392578125, 0.07293701171875, 0.1357421875, 0.07269287109375, 0.0738525390625, 0.153564453125, 0.1361083984375, 0.123779296875, 0.183349609375, 0.0501708984375, 0.137939453125, 0.107666015625, 0.2110595703125, 0.1414794921875, 0.1092529296875, ...	embed
68044738_c1	68044738	haskell	1	-> Map.Map Integer Integer factorization 1 = Map.fromList [] factorization x = Map.insertWith (+) factor 1 (factorization (x `div` factor)) where factor = head $ filter (\s -> (x `mod` s) == 0) ls ls = primes This program failed to solve in the time limit. So could anyone point me out where did I do wrong and how to f...	-> Map.Map Integer Integer factorization 1 = Map.fromList [] factorization x = Map.insertWith (+) factor 1 (factorization (x `div` factor)) where factor = head $ filter (\s -> (x `mod` s) == 0) ls ls = primes This program failed to solve in the time limit. So could anyone point me out where did I do wrong and how to f...	[ -0.0322265625, 0.0244140625, 0.0084228515625, -0.0072021484375, -0.00543212890625, -0.00152587890625, -0.0126953125, -0.00689697265625, 0.00830078125, -0.03662109375, 0.00640869140625, 0.00640869140625, 0.0262451171875, 0.0133056640625, -0.00518798828125, 0.00010442733764648438, -0.0...	[ 33079, 42719, 5, 166179, 44401, 31461, 47691, 106, 2203, 161063, 154663, 1022, 73, 33657, 194583, 22183, 144810, 425, 30618, 16, 10336, 3650, 46312, 41872, 7, 13415, 91, 69112, 757, 96, 20809, 3293, 1528, 165523, 86869, 23, 1733, 17475, 580...	[ 0.0665283203125, 0.25830078125, 0.0277099609375, 0.2369384765625, 0.2330322265625, 0.22119140625, 0.1500244140625, 0.1239013671875, 0.006561279296875, 0.1539306640625, 0.178955078125, 0.1148681640625, 0.07696533203125, 0.1512451171875, 0.1651611328125, 0.1480712890625, 0.231323242187...	embed
37374570_c0	37374570	haskell	0	Title: Haskell: fmap on nested functors Problem title: Haskell: fmap on nested functors Tags: applicative, functor, haskell Problem: Haskell: fmap on nested functors What is the way to abstract mapping a function over a list of functors? I understand the basic applicative λ: [(+2),(2)] <> [10,20] [12,22,20,40] but ho...	Haskell: fmap on nested functors Haskell: fmap on nested functors applicative functor haskell Haskell Just Haskell: fmap on nested functors What is the way to abstract mapping a function over a list of functors? I understand the basic applicative but how do I handle [(+2),(*2)] ???? [Just 10, Just 20] ? all the ways I ...	[ -0.002105712890625, 0.005859375, 0.0016937255859375, 0.0087890625, 0.007476806640625, 0.0341796875, -0.00201416015625, -0.005950927734375, 0.00439453125, -0.0267333984375, 0.01171875, -0.035888671875, -0.004791259765625, 0.038330078125, -0.003875732421875, -0.0137939453125, 0.0090332...	[ 20625, 142508, 1238, 62346, 98, 8512, 71, 7477, 18770, 41816, 4935, 1556, 9563, 70, 3917, 47, 164789, 291, 26783, 32354, 645, 10, 5303, 28219, 62822, 3642, 34831, 378, 132, 54651, 247, 88746, 10461, 35042, 127794, 209, 387, 756, 48322, 53...	[ 0.1531982421875, 0.2352294921875, 0.1104736328125, 0.2471923828125, 0.08203125, 0.2041015625, 0.0648193359375, 0.1602783203125, 0.161376953125, 0.1700439453125, 0.1387939453125, 0.1468505859375, 0.1483154296875, 0.01019287109375, 0.10546875, 0.0335693359375, 0.26513671875, 0.202880...	embed
39378493_c1	39378493	haskell	1	' block: f <- param ("f" :: L.Text) In the second argument of ‘($)’, namely ‘do { f <- param ("f" :: L.Text); file "create.html" }’ In a stmt of a 'do' block: post "/create" $ do { f <- param ("f" :: L.Text); file "create.html" } Code signals: a, being, Web.Scotty, Control.Applicative, Control.Monad.IO.Class, Database....	' block: f <- param ("f" :: L.Text) In the second argument of ‘($)’, namely ‘do { f <- param ("f" :: L.Text); file "create.html" }’ In a stmt of a 'do' block: post "/create" $ do { f <- param ("f" :: L.Text); file "create.html" } Code signals: a, being, Web.Scotty, Control.Applicative, Control.Monad.IO.Class, Database....	[ 0.033447265625, -0.0017852783203125, 0.0012969970703125, 0.00909423828125, -0.013916015625, 0.0020599365234375, 0.001068115234375, -0.004669189453125, -0.001983642578125, -0.0250244140625, 0.0238037109375, -0.0162353515625, -0.0218505859375, -0.0264892578125, 0.0036773681640625, 0.0090...	[ 242, 46389, 12, 1238, 4426, 9, 121, 39, 420, 1984, 339, 174379, 70, 17932, 10750, 4369, 16, 246, 11435, 7612, 2182, 7693, 360, 6138, 18, 1305, 3650, 54, 28864, 26073, 7, 10, 8035, 4002, 587, 15145, 27131, 11048, 4935, 46674, 712, 1778...	[ 0.11669921875, 0.241943359375, 0.006561279296875, 0.1798095703125, 0.1241455078125, 0.0986328125, 0.168212890625, 0.1356201171875, 0.152587890625, 0.058990478515625, 0.068359375, 0.1976318359375, 0.0162353515625, 0.131591796875, 0.25927734375, 0.2005615234375, 0.03216552734375, 0.1...	embed
40247339_c0	40247339	haskell	0	Title: Polymorphic recursion - syntax and uses? Problem title: Polymorphic recursion - syntax and uses? Tags: haskell, recursion Problem: Polymorphic recursion - syntax and uses? I've spent significant time looking over learnyouahaskell and I haven't found a good explanation of polymorphic recursion! I understand basic...	Polymorphic recursion - syntax and uses? Polymorphic recursion - syntax and uses? haskell recursion Polymorphic Polymorphic recursion - syntax and uses? I've spent significant time looking over learnyouahaskell and I haven't found a good explanation of polymorphic recursion! I understand basic recursive structures: Wha...	[ -0.0186767578125, 0.0089111328125, 0.005340576171875, -0.0026092529296875, 0.018310546875, 0.027587890625, 0.01202392578125, -0.0181884765625, 0.0250244140625, -0.0296630859375, 0.0218505859375, -0.041015625, -0.0021209716796875, 0.00897216796875, 0.01202392578125, -0.037353515625, -...	[ 63306, 178851, 1771, 195625, 1830, 20, 6002, 86531, 136, 4527, 7, 32, 1556, 142508, 88551, 30698, 53927, 7232, 38246, 4127, 187136, 111, 35874, 28219, 62822, 5844, 45646, 4865, 2806, 6713, 1884, 2367, 621, 6863, 72382, 64, 29001 ]	[ 0.2215576171875, 0.2291259765625, 0.10302734375, 0.22705078125, 0.132080078125, 0.02386474609375, 0.1357421875, 0.2142333984375, 0.09210205078125, 0.18505859375, 0.04998779296875, 0.0160064697265625, 0.115234375, 0.217529296875, 0.05010986328125, 0.047607421875, 0.049346923828125, ...	embed
26606037_c0	26606037	haskell	0	Title: Haskell substring testing Problem title: Haskell substring testing Tags: haskell Problem: Haskell substring testing When I use sub_string("abberr","habberyry") , it returns True, when obviously it should be False. The point of the function is to search for the first argument within the second one. Any ideas what...	Haskell substring testing Haskell substring testing haskell Haskell sub_string Bool a:x b:y Haskell substring testing When I use sub_string("abberr","habberyry") , it returns True, when obviously it should be False. The point of the function is to search for the first argument within the second one. Any ideas what's wr...	[ -0.01171875, 0.001678466796875, 0.0089111328125, 0.0166015625, -0.0240478515625, 0.0201416015625, 0.00848388671875, -0.00616455078125, 0.00118255615234375, 0.041748046875, 0.01324462890625, -0.015380859375, 0.0172119140625, 0.01611328125, -0.00201416015625, -0.01434326171875, 0.02099...	[ 20625, 142508, 1614, 91693, 134234, 1556, 2460, 929, 10, 12, 425, 876, 53, 4527, 454, 10545, 56, 42, 24360, 1297, 1294, 30646, 87599, 3229, 171259, 5608, 186, 22225, 184, 6275, 32354, 33938, 100, 5117, 10750, 28032, 17932, 25647, 44691 ]	[ 0.1158447265625, 0.215576171875, 0.2022705078125, 0.22607421875, 0.211669921875, 0.10736083984375, 0.093994140625, 0.1998291015625, 0.051361083984375, 0.011627197265625, 0.060302734375, 0.06396484375, 0.0755615234375, 0.06805419921875, 0.00286865234375, 0.0867919921875, 0.06640625, ...	embed
30905805_c0	30905805	haskell	0	Title: Understanding `seq` with Example Problem title: Understanding `seq` with Example Tags: haskell Problem: Understanding `seq` with Example I'm trying to understand seq with the following example: Prelude> let x = 100 + 2 sprint -ing the value of x shows _ since it has not been evaluated. Prelude> :sprint x x = _ L...	Understanding `seq` with Example Understanding `seq` with Example haskell Understanding Example Prelude Understanding `seq` with Example I'm trying to understand seq with the following example: sprint -ing the value of x shows _ since it has not been evaluated. Let's, as I understand seq , evaluate x . Now, let's check...	[ 0.0040283203125, 0.0250244140625, -0.0032501220703125, 0.041259765625, 0.020263671875, 0.01361083984375, 0.01080322265625, 0.00604248046875, -0.003082275390625, 0.0026702880859375, -0.01153564453125, 0.0015869140625, -0.00836181640625, 0.032958984375, 0.007110595703125, -0.004943847656...	[ 9626, 144057, 184, 864, 678, 89536, 8705, 1556, 142508, 1914, 822, 31577, 28219, 40, 27781, 145320, 20, 214, 34292, 1022, 45831, 16792, 959, 2809, 151575, 13, 12765, 44084, 19, 18, 297, 47, 30669, 7103, 159029 ]	[ 0.11376953125, 0.101806640625, 0.1689453125, 0.2626953125, 0.09619140625, 0.209716796875, 0.1151123046875, 0.111083984375, 0.2186279296875, 0.0208892822265625, 0.0679931640625, 0.0167083740234375, 0.1116943359375, 0.1405029296875, 0.16162109375, 0.2269287109375, 0.0614013671875, 0....	embed
36227959_c0	36227959	haskell	0	Title: Haskell: How to filter a list of list? Problem title: Haskell: How to filter a list of list? Tags: haskell Problem: Haskell: How to filter a list of list? Given a list of list: xss = [[1,2,3],[4,5,6],[7,8]] I want to filter it by list size then by remainder and then return a list of Int. Here are my two attempts...	Haskell: How to filter a list of list? Haskell: How to filter a list of list? haskell Haskell How Haskell: How to filter a list of list? Given a list of list: I want to filter it by list size then by remainder and then return a list of Int. Here are my two attempts: Is there more expressive way to do the same but with ...	[ -0.00909423828125, 0.02978515625, -0.0052490234375, -0.0146484375, -0.001617431640625, 0.00848388671875, 0.00133514404296875, 0.017333984375, 0.0079345703125, -0.0023040771484375, 0.0045166015625, -0.0283203125, 0.013671875, -0.00138092041015625, -0.032470703125, -0.000820159912109375,...	[ 20625, 142508, 11249, 47, 46312, 10, 5303, 111, 12, 1556, 77878, 3444, 442, 390, 13267, 47143, 820, 30646, 360, 18, 6626, 81887, 1286, 36510, 3917, 5701, 40715, 18151 ]	[ 0.142578125, 0.2227783203125, 0.088134765625, 0.05865478515625, 0.28125, 0.039520263671875, 0.21923828125, 0.1468505859375, 0.011627197265625, 0.12158203125, 0.040130615234375, 0.081298828125, 0.009613037109375, 0.04632568359375, 0.10693359375, 0.0897216796875, 0.080322265625, 0.14...	embed
16746372_c0	16746372	haskell	0	Title: how does xs in this function work? Problem title: how does xs in this function work? Tags: haskell Problem: how does xs in this function work? I am reading Hutton's book, Programming in Haskell. Here is a function: pairs :: [a] -> [(a,a)] pairs xs = zip xs (tail xs) e.g. >pairs [1,2,3,4] >[(1,2),(2,3),(3,4)] --r...	how does xs in this function work? how does xs in this function work? haskell how does xs in this function work? I am reading Hutton's book, Programming in Haskell. Here is a function: e.g. Problem is how to read this function ? from left to right? I am confused how "tail" leave 1 element and then combine it with next ...	[ 0.017333984375, 0.025390625, 0.00787353515625, 0.0024566650390625, -0.002532958984375, 0.0341796875, -0.006561279296875, -0.018798828125, 0.00909423828125, -0.01092529296875, 0.0279541015625, -0.00823974609375, 0.01153564453125, -0.012939453125, 0.003631591796875, 0.00823974609375, 0...	[ 3642, 14602, 1022, 7, 23, 903, 32354, 4488, 1556, 142508, 16454, 97595, 1507, 12877, 27958, 20625, 15649, 47, 12301, 1295, 25737, 7108, 55681, 5281, 46741, 31358, 106, 12830, 70163, 11737, 17368, 50836, 139124, 2046, 756, 47143, 80854, 5303 ]	[ 0.10443115234375, 0.09930419921875, 0.1800537109375, 0.1826171875, 0.13232421875, 0.1119384765625, 0.2001953125, 0.154052734375, 0.12939453125, 0.217529296875, 0.057891845703125, 0.03497314453125, 0.09661865234375, 0.047149658203125, 0.06689453125, 0.10577392578125, 0.07672119140625,...	embed
3876399_c0	3876399	haskell	0	Title: How can monads make my job easier? Show me some cool piece of code Problem title: How can monads make my job easier? Show me some cool piece of code Tags: haskell, monads Problem: How can monads make my job easier? Show me some cool piece of code I like reading snippets of code about concepts that I don't unders...	How can monads make my job easier? Show me some cool piece of code How can monads make my job easier? Show me some cool piece of code haskell monads How Show How can monads make my job easier? Show me some cool piece of code I like reading snippets of code about concepts that I don't understand. Are there any snippets ...	[ 0.006317138671875, 0.014892578125, -0.00016880035400390625, 0.0177001953125, -0.00135040283203125, 0.0093994140625, -0.005523681640625, -0.00439453125, 0.000644683837890625, -0.030029296875, -0.01446533203125, -0.022216796875, -0.009521484375, 0.024658203125, -0.0017547607421875, -0.00...	[ 11249, 831, 2667, 712, 7, 3249, 759, 12447, 99156, 17367, 163, 3060, 21185, 63847, 111, 18151, 1556, 142508, 1884, 16454, 93, 58134, 1672, 23755, 2301, 18, 28219, 2685, 2499, 7639, 5773, 23, 756, 2363, 16712, 1294, 5526, 3642, 59911, 47, ...	[ 0.1114501953125, 0.109375, 0.184326171875, 0.25830078125, 0.1602783203125, 0.126708984375, 0.0804443359375, 0.178955078125, 0.212646484375, 0.1820068359375, 0.069580078125, 0.0477294921875, 0.147705078125, 0.1087646484375, 0.03216552734375, 0.176025390625, 0.129150390625, 0.2281494...	embed
8148253_c0	8148253	haskell	0	Title: How are functions curried? Problem title: How are functions curried? Tags: functional-programming, currying, low-level, pointers, haskell Problem: How are functions curried? I understand what the concept of currying is, and know how to use it. These are not my questions, rather I am curious as to how this is act...	How are functions curried? How are functions curried? functional-programming currying low-level pointers haskell How How are functions curried? I understand what the concept of currying is, and know how to use it. These are not my questions, rather I am curious as to how this is actually implemented at some lower level...	[ 0.004608154296875, 0.0093994140625, 0.01043701171875, 0.00147247314453125, 0.006805419921875, 0.0218505859375, -0.0162353515625, -0.01251220703125, 0.003387451171875, 0.00469970703125, 0.0230712890625, -0.03173828125, -0.01239013671875, 0.0033111572265625, -0.01336669921875, -0.0046081...	[ 11249, 621, 32354, 7, 9709, 46572, 32, 123309, 28966, 198555, 214, 27226, 67919, 6275, 1314, 1556, 142508, 28219, 23755, 111, 83, 3714, 3642, 4527, 442, 193844, 903, 20653, 29479, 92319, 17366, 20625, 18151, 3229, 22183, 116, 201, 56, 47, ...	[ 0.146728515625, 0.1005859375, 0.2413330078125, 0.10205078125, 0.17822265625, 0.2469482421875, 0.0103759765625, 0.1649169921875, 0.1312255859375, 0.248046875, 0.1842041015625, 0.10186767578125, 0.121826171875, 0.179931640625, 0.0966796875, 0.120361328125, 0.2305908203125, 0.0703125,...	embed
31754011_c0	31754011	haskell	0	Title: How does enumFromTo work? Problem title: How does enumFromTo work? Tags: haskell, typeclass Problem: How does enumFromTo work? I cannot add a number to a Char ; the following will fail to compile 'a' + 1 . But yet, ['a'..'z'] successfully creates a string in which each of the character value is incremented. Is t...	How does enumFromTo work? How does enumFromTo work? haskell typeclass How Char How does enumFromTo work? I cannot add a number to a Char ; the following will fail to compile 'a' + 1 . But yet, ['a'..'z'] successfully creates a string in which each of the character value is incremented. Is there a special function that ...	[ 0.005584716796875, -0.00122833251953125, 0.00933837890625, 0.037841796875, 0.0103759765625, 0.0230712890625, 0.0093994140625, -0.004638671875, -0.01373291015625, 0.01220703125, 0.008056640625, -0.027587890625, -0.0034332275390625, 0.0272216796875, -0.01519775390625, -0.0167236328125, ...	[ 11249, 14602, 22, 316, 168407, 7763, 4488, 1556, 142508, 10644, 67413, 21656, 87, 53418, 15190, 14012, 47, 25632, 35782, 9969, 1340, 11, 997, 106, 4966, 14373, 5, 169, 65771, 28282, 79315, 12638, 62816, 34292, 158661, 5361, 32354, 831, 3714...	[ 0.1031494140625, 0.107666015625, 0.1600341796875, 0.243896484375, 0.29052734375, 0.26513671875, 0.1817626953125, 0.1500244140625, 0.2337646484375, 0.09857177734375, 0.136962890625, 0.198974609375, 0.0165557861328125, 0.123046875, 0.119384765625, 0.161376953125, 0.060638427734375, 0...	embed
58776762_c0	58776762	haskell	0	Title: In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 Problem title: In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 Tags: haskell Problem: In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 I'm learning haskell and I came across a weird behavior. I tried Prelude> min 8.0 8 8.0 and Prelude> max 8 8.0 8....	In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 haskell Prelude In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 I'm learning haskell and I came across a weird behavior. I tried and I switch the argument positions for both functions but I got the same res...	[ 0.025634765625, -0.002197265625, 0.037353515625, -0.0087890625, 0.00262451171875, 0.02783203125, -0.001495361328125, -0.01239013671875, -0.0015411376953125, 0.0206298828125, -0.000415802001953125, -0.022705078125, -0.006561279296875, -0.004486083984375, 0.01519775390625, -0.00958251953...	[ 1556, 142508, 15400, 83, 881, 3217, 2389, 382, 2203, 136, 18389, 360, 1914, 822, 112, 52080, 179459, 123166, 101089, 10750, 19069, 15044, 32354, 5701, 16750, 176377, 5608, 18, 186, 237, 22925, 105274, 31380, 318, 11389, 133684, 44084, 53383 ]	[ 0.1402587890625, 0.225830078125, 0.129638671875, 0.06524658203125, 0.2216796875, 0.1978759765625, 0.189208984375, 0.227783203125, 0.08636474609375, 0.1109619140625, 0.205322265625, 0.02471923828125, 0.059326171875, 0.1395263671875, 0.036865234375, 0.005828857421875, 0.099609375, 0....	embed
12901803_c0	12901803	haskell	0	Title: Retrieve the pixel values of an image with Haskell Problem title: Retrieve the pixel values of an image with Haskell Tags: libraries, image-recognition, image-processing, haskell Problem: Retrieve the pixel values of an image with Haskell Is there a way or a library available that can load an image (jpeg, png, e...	Retrieve the pixel values of an image with Haskell Retrieve the pixel values of an image with Haskell libraries image-recognition image-processing haskell Retrieve Haskell Retrieve the pixel values of an image with Haskell Is there a way or a library available that can load an image (jpeg, png, etc) and assign the pixe...	[ 0.005218505859375, -0.00579833984375, -0.006927490234375, 0.019287109375, 0.003814697265625, 0.03369140625, -0.0015716552734375, 0.00173187255859375, -0.0078125, -0.0181884765625, 0.00830078125, -0.01025390625, -0.006591796875, -0.00958251953125, -0.017578125, -0.0108642578125, 0.000...	[ 200451, 98009, 142424, 29569, 678, 20625, 142508, 70, 111, 35773, 107, 115558, 63923, 1556, 2685, 10, 3917, 19882, 450, 831, 72367, 215109, 128468, 136, 95486, 3934, 5303, 707, 50944, 1884, 54, 28007, 103510, 230466, 10176, 315, 61007, 7108, ...	[ 0.2325439453125, 0.25732421875, 0.2138671875, 0.197265625, 0.113525390625, 0.1533203125, 0.25, 0.000640869140625, 0.022918701171875, 0.1937255859375, 0.01220703125, 0.0946044921875, 0.046295166015625, 0.1319580078125, 0.031463623046875, 0.007720947265625, 0.088623046875, 0.08032226...	embed
21660714_c0	21660714	haskell	0	Title: Haskell - Function checks balancing within parenthesis Problem title: Haskell - Function checks balancing within parenthesis Tags: haskell Problem: Haskell - Function checks balancing within parenthesis I have to write a function in Haskell that checks whether a string containing open and closed parenthesis is b...	Haskell - Function checks balancing within parenthesis Haskell - Function checks balancing within parenthesis haskell Haskell Haskell - Function checks balancing within parenthesis I have to write a function in Haskell that checks whether a string containing open and closed parenthesis is balanced. For every opened par...	[ -0.006256103515625, 0.0125732421875, -0.01007080078125, 0.01092529296875, 0.01531982421875, 0.041259765625, 0.00634765625, -0.01446533203125, -0.0032806396484375, 0.006988525390625, 0.011962890625, -0.053955078125, 0.0147705078125, 0.000392913818359375, -0.00531005859375, 0.013671875, ...	[ 20625, 142508, 28670, 10763, 12765, 25168, 60636, 28032, 49129, 160291, 1556, 765, 33022, 32354, 36766, 79315, 70541, 9803, 136, 155738, 7, 83, 40197, 11907, 142096, 8110, 1632, 201505, 90698 ]	[ 0.144775390625, 0.2462158203125, 0.157470703125, 0.084228515625, 0.200439453125, 0.175048828125, 0.1502685546875, 0.15869140625, 0.1552734375, 0.19775390625, 0.13525390625, 0.00933837890625, 0.043426513671875, 0.1644287109375, 0.0115966796875, 0.1920166015625, 0.0687255859375, 0.16...	embed
73029761_c1	73029761	haskell	1	9.2 from ghcup ) does not depend on libtinfo . Under the circumstance that ~/.ghc/x86_64-linux-8.10.7/environments/default does not exist, the generated binary has no dependency to libtinfo . This file is generated when you initialize Cabal. After that, the compiled binary will depend on libtinfo.so. (**) Commands like...	9.2 from ghcup ) does not depend on libtinfo . Under the circumstance that ~/.ghc/x86_64-linux-8.10.7/environments/default does not exist, the generated binary has no dependency to libtinfo . This file is generated when you initialize Cabal. After that, the compiled binary will depend on libtinfo.so. (**) Commands like...	[ 0.01177978515625, 0.01226806640625, 0.007080078125, 0.0228271484375, -0.00787353515625, 0.002685546875, -0.025390625, 0.01611328125, 0.006134033203125, 0.02294921875, -0.00640869140625, 0.001129150390625, -0.00537109375, 0.037841796875, 0.002532958984375, 0.004119873046875, 0.0212402...	[ 151309, 1295, 31380, 33874, 1388, 14602, 959, 56566, 98, 25474, 18, 7319, 75723, 9486, 238, 15276, 13307, 2397, 6077, 17376, 10179, 966, 153210, 214810, 32316, 139392, 71, 2394, 6635, 1556, 110, 42548, 27771, 11435, 3229, 61475, 20650, 30438,...	[ 0.313232421875, 0.03704833984375, 0.12841796875, 0.226806640625, 0.02215576171875, 0.0035400390625, 0.08026123046875, 0.1988525390625, 0.046234130859375, 0.17431640625, 0.1328125, 0.301513671875, 0.005035400390625, 0.1241455078125, 0.1064453125, 0.1815185546875, 0.1326904296875, 0....	embed

6312592_c2

6312592

haskell

2

0.5 failed during the configure step. The exception was: ExitFailure 1 Code signals: Haskell, Cabal, How, Reading, Resolving, time-1.2.0.5, Extracting, Users, Marcin, AppData, Roaming, hackage.haskell.org, time-1.2.0.5.tar.gz, time-1.2.0.54736, Creating, Program, Files, x86, Platform, ghc.exe, Setu, p.hs, setup.exe, ti...

[ 0.0050048828125, 0.00518798828125, 0.0234375, -0.0091552734375, 0.00408935546875, -0.01220703125, -0.005157470703125, -0.0079345703125, 0.00750732421875, 0.0234375, -0.01348876953125, -0.0115966796875, -0.0023956298828125, -0.00189971923828125, -0.009765625, -0.0130615234375, 0.00976...

[ 81730, 165523, 20271, 222495, 29954, 131527, 5443, 217, 17647, 379, 3408, 106, 28864, 26073, 20625, 142508, 30438, 289, 11249, 104951, 132944, 1733, 48400, 93645, 31501, 53400, 177184, 5659, 137989, 2777, 302, 85526, 4588, 10557, 1478, 867, 730...

[ 0.292236328125, 0.2259521484375, 0.048828125, 0.2548828125, 0.1104736328125, 0.2230224609375, 0.1614990234375, 0.1358642578125, 0.1396484375, 0.10223388671875, 0.07452392578125, 0.08013916015625, 0.1981201171875, 0.179443359375, 0.144775390625, 0.267333984375, 0.1488037109375, 0.15...

embed

27739762_c0

27739762

haskell

0

Title: Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? Problem title: Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? Tags: haskell, functional-programming Problem: Haskell: Why "Nothing<(4::Maybe Int)" g...

Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? Haskell: Why "Nothing<(4::Maybe Int)" gets an error but "Nothing< Just 4" pass? haskell functional-programming Haskell Why Nothing Maybe Just Haskell: Why "Nothing<(4::Maybe Int)" gets an ...

[ 0.01031494140625, 0.0035400390625, 0.01483154296875, -0.01031494140625, 0.00885009765625, -0.007476806640625, -0.00244140625, -0.005828857421875, 0.0108642578125, 0.0093994140625, -0.01483154296875, -0.021728515625, 0.0169677734375, 0.01153564453125, 0.0022430419921875, -0.020629882812...

[ 20625, 142508, 44084, 5021, 64113, 105801, 82419, 372, 360, 18, 18499, 1277, 9563, 201, 27875, 1284, 1556, 123309, 28966, 182747, 83425, 16093, 12, 10644, 5809, 15400, 154186 ]

[ 0.1121826171875, 0.2042236328125, 0.07647705078125, 0.06109619140625, 0.1612548828125, 0.157958984375, 0.095703125, 0.08685302734375, 0.0911865234375, 0.0877685546875, 0.1734619140625, 0.041351318359375, 0.1002197265625, 0.18701171875, 0.09210205078125, 0.051422119140625, 0.081726074...

embed

72863962_c1

72863962

haskell

1

.yaml which is currently resolver: lts-14.21 . But what do I change it to? It looks like the most recent version of LTS is 19.14 https://www.stackage.org/lts-19.14 . But I'm a bit nervous about making that change since the page says ghc 9.0.2 not 9.2.2. The entire Haskell ecosystem just seems really finicky and I'm new...

[ -0.018798828125, 0.00909423828125, -0.0033416748046875, -0.0301513671875, -0.005279541015625, -0.00537109375, -0.0302734375, 0.002685546875, -0.0062255859375, 0.0220947265625, -0.01397705078125, -0.01953125, 0.0009307861328125, 0.007171630859375, 0.01446533203125, 0.00994873046875, -...

[ 5, 14520, 141, 3129, 83, 82424, 58061, 96, 933, 16249, 3117, 4966, 2367, 54, 87, 15549, 442, 47, 33342, 2684, 17309, 11389, 339, 12763, 6529, 2592, 590, 11387, 429, 1478, 1277, 7, 8363, 4785, 11066, 13048, 9191, 17378, 31380, 238, 3569,...

[ 0.1036376953125, 0.24462890625, 0.2398681640625, 0.001251220703125, 0.0283203125, 0.09912109375, 0.279052734375, 0.08673095703125, 0.1502685546875, 0.1737060546875, 0.189453125, 0.0277557373046875, 0.0596923828125, 0.04949951171875, 0.03570556640625, 0.2178955078125, 0.1287841796875,...

embed

75689855_c1

75689855

haskell

1

(on ghc 9.2.7 via Stack LTS-20.13 ). It doesn't happen if instead of importing the module, I directly load Test1.hs code in ghci. If I remove Strict pragma, the issue seems to go away. Perhaps something is going on here that is new to ghc 9.2+ or template haskell derivation in aeson ? Code signals: when, Data.Aeson.TH...

[ -0.0030059814453125, -0.01080322265625, -0.01336669921875, 0.006988525390625, -0.003570556640625, -0.00848388671875, 0.0191650390625, -0.00188446044921875, 0.000640869140625, -0.038330078125, 0.0038299560546875, 0.002288818359375, 0.014404296875, -0.00176239013671875, 0.017333984375, 0...

[ 31380, 238, 151309, 966, 6512, 2594, 12763, 11033, 2681, 6, 1650, 18, 53383, 2174, 64457, 24927, 88996, 105237, 72367, 8647, 418, 127, 7, 18151, 318, 87388, 73425, 15390, 58827, 192, 31089, 16065, 181799, 3688, 1328, 110934, 1556, 142508, 3...

[ 0.1339111328125, 0.140380859375, 0.216796875, 0.10211181640625, 0.1011962890625, 0.09857177734375, 0.07159423828125, 0.07513427734375, 0.1280517578125, 0.010345458984375, 0.0283355712890625, 0.0233154296875, 0.0789794921875, 0.003570556640625, 0.0215606689453125, 0.1737060546875, 0.1...

embed

41675391_c0

41675391

haskell

0

Title: Right-tightening ArrowLoop law Problem title: Right-tightening ArrowLoop law Tags: haskell, arrow-abstraction, typeclass Problem: Right-tightening ArrowLoop law According to the Control.Arrow documentation, for many monads (those for which the >>= operation is strict) the instance MonadFix m => ArrowLoop (Kleisl...

Right-tightening ArrowLoop law Right-tightening ArrowLoop law haskell arrow-abstraction typeclass Right-tightening ArrowLoop Control.Arrow MonadFix Kleisli Right-tightening ArrowLoop law According to the Control.Arrow documentation, for many monads (those for which the >>= operation is strict) the instance MonadFix m =...

[ 0.0216064453125, 0.00011014938354492188, 0.036865234375, 0.0311279296875, 0.0230712890625, 0.00396728515625, 0.0021820068359375, 0.01507568359375, 0.0177001953125, 0.01019287109375, 0.01312255859375, -0.0093994140625, -0.02685546875, 0.0123291015625, 0.0390625, -0.0179443359375, -0.0...

[ 90911, 18, 228624, 1172, 15555, 15363, 2146, 27165, 1556, 142508, 118201, 2055, 7, 117474, 10644, 67413, 27131, 60331, 71, 6159, 425, 24798, 164, 150, 5, 7614, 209806, 5941, 2667, 712, 6396, 1369, 41018, 83, 81113, 110527, 347, 44357, 67657...

[ 0.1475830078125, 0.1102294921875, 0.2032470703125, 0.060699462890625, 0.172607421875, 0.13671875, 0.1473388671875, 0.165771484375, 0.055450439453125, 0.1800537109375, 0.183837890625, 0.036529541015625, 0.0025634765625, 0.0699462890625, 0.0740966796875, 0.129638671875, 0.17626953125, ...

embed

48712601_c0

48712601

haskell

0

Title: How can one turn a value of a record type into a JSON String in Haskell? Problem title: How can one turn a value of a record type into a JSON String in Haskell? Tags: haskell, json Problem: How can one turn a value of a record type into a JSON String in Haskell? Let's say I have record type that looks like this ...

How can one turn a value of a record type into a JSON String in Haskell? How can one turn a value of a record type into a JSON String in Haskell? haskell json How JSON Haskell Person Show How can one turn a value of a record type into a JSON String in Haskell? Let's say I have record type that looks like this How would...

[ -0.0198974609375, 0.0037841796875, 0.00335693359375, 0.0269775390625, -0.010498046875, 0.0025177001953125, -0.023681640625, 0.01031494140625, -0.0111083984375, -0.0228271484375, -0.01202392578125, 0.010498046875, 0.01220703125, 0.0155029296875, -0.000896453857421875, -0.007476806640625...

[ 11249, 831, 15504, 34292, 17164, 10644, 3934, 821, 58627, 23351, 214, 23, 20625, 142508, 111, 10, 1556, 1647, 1681, 15270, 17367, 1632, 33342, 1884, 903, 10932, 174548, 134549, 127, 25632 ]

[ 0.049652099609375, 0.053466796875, 0.11328125, 0.1768798828125, 0.2176513671875, 0.190185546875, 0.0860595703125, 0.1409912109375, 0.2203369140625, 0.1646728515625, 0.114990234375, 0.043609619140625, 0.1435546875, 0.225341796875, 0.0196075439453125, 0.0479736328125, 0.1497802734375, ...

embed

32811390_c0

32811390

haskell

0

Title: Foldl on string Problem title: Foldl on string Tags: haskell, fold Problem: Foldl on string I would like to foldl a string so that any occurrence of zero which is preceded by @ is replaced with "k". So "a.@0.1.2.0" becomes, "a.@k.1.2.0". How do I do that? So far my attempt is test = foldl(\x acc-> if((last acc) ...

Foldl on string Foldl on string haskell fold Foldl Foldl on string I would like to foldl a string so that any occurrence of zero which is preceded by @ is replaced with "k". So "a.@0.1.2.0" becomes, "a.@k.1.2.0". How do I do that? So far my attempt is However, it doesn't work. Foldl is expecting list of string and what...

[ -0.00830078125, -0.007476806640625, -0.0177001953125, 0.00640869140625, -0.00457763671875, 0.02099609375, 0.01092529296875, -0.007598876953125, -0.0057373046875, 0.01708984375, 0.02978515625, -0.014892578125, -0.01025390625, 0.01953125, 0.00994873046875, -0.00885009765625, -0.0033874...

[ 30077, 20469, 98, 79315, 1556, 142508, 42822, 87, 2806, 1884, 47, 18344, 10, 221, 450, 2499, 74918, 42, 6620, 111, 45234, 3129, 107671, 1374, 83, 91995, 678, 92, 11, 5, 981, 102014, 73011, 24209, 22892, 11249, 54, 2060, 759, 81887, 3330...

[ 0.20703125, 0.25537109375, 0.1435546875, 0.2490234375, 0.1307373046875, 0.2298583984375, 0.220458984375, 0.048797607421875, 0.0751953125, 0.1126708984375, 0.042724609375, 0.199462890625, 0.01171875, 0.043304443359375, 0.0194854736328125, 0.056915283203125, 0.11572265625, 0.08160400...

embed

11672786_c0

11672786

haskell

0

Title: Cabal preprocessing symbols Problem title: Cabal preprocessing symbols Tags: haskell, cabal, build Problem: Cabal preprocessing symbols Possible Duplicate: Haskell: Correct practice to specify version in source? Is it any way to export cabal metadata to my code? With autotools, I define, for example, program ver...

Cabal preprocessing symbols Cabal preprocessing symbols haskell cabal build Cabal configure.ac Cabal preprocessing symbols Is it any way to export cabal metadata to my code? With autotools, I define, for example, program version in configure.ac and get it as define for my code. In cabal, currently, I have to mantain pr...

[ -0.004547119140625, -0.0030517578125, -0.00238037109375, 0.01397705078125, -0.01220703125, -0.003936767578125, -0.0015869140625, 0.037109375, -0.005462646484375, -0.003692626953125, -0.0120849609375, -0.0133056640625, 0.00130462646484375, -0.01080322265625, -0.003814697265625, 0.014465...

[ 30438, 289, 479, 63923, 26582, 214, 1556, 142508, 109524, 45367, 222495, 2263, 2499, 3917, 47, 31255, 23550, 10135, 18151, 17106, 1809, 89110, 61924, 1528, 11389, 2046, 237, 360, 82424, 765, 332, 25500, 6626, 44677, 23, 5, 408, 3571, 136, ...

[ 0.20361328125, 0.182373046875, 0.131591796875, 0.12451171875, 0.207275390625, 0.0310821533203125, 0.0775146484375, 0.1656494140625, 0.276123046875, 0.1212158203125, 0.2073974609375, 0.1123046875, 0.02838134765625, 0.0545654296875, 0.0706787109375, 0.2059326171875, 0.1707763671875, ...

embed

27715771_c0

27715771

haskell

0

Title: Why is there a Non-exhaustive pattern in this function? Problem title: Why is there a Non-exhaustive pattern in this function? Tags: haskell Problem: Why is there a Non-exhaustive pattern in this function? In this Script, permutations :: Integer -> Integer -> Integer permutations x y | x==x-(y-1) = x | (x>0) && ...

Why is there a Non-exhaustive pattern in this function? Why is there a Non-exhaustive pattern in this function? haskell Why Non-exhaustive Integer y-1 x-1 Why is there a Non-exhaustive pattern in this function? In this Script, I wonder why there is Non-exhaustive patterns in the function permutations. Please help me. T...

[ -0.0228271484375, 0.006988525390625, 0.0023651123046875, 0.004913330078125, 0.0020904541015625, 0.01806640625, -0.02685546875, 0.003997802734375, 0.0034637451171875, -0.00135040283203125, 0.014404296875, 0.00860595703125, 0.0203857421875, 0.000560760498046875, 0.01806640625, 0.00482177...

[ 44084, 83, 2685, 10, 3775, 3355, 18391, 4935, 103510, 23, 903, 32354, 1556, 142508, 9, 44401, 113, 5759, 1022, 84654, 32195, 15400, 117, 14311, 21094, 4358, 100, 129745 ]

[ 0.1697998046875, 0.047393798828125, 0.07666015625, 0.0506591796875, 0.2216796875, 0.068603515625, 0.14794921875, 0.0989990234375, 0.2200927734375, 0.019439697265625, 0.07733154296875, 0.159912109375, 0.1470947265625, 0.218017578125, 0.0423583984375, 0.160400390625, 0.1524658203125, ...

embed

57370426_c0

57370426

haskell

0

Title: Why haskell gnuplot code works in ghci, but not from CLI after compiling? Problem title: Why haskell gnuplot code works in ghci, but not from CLI after compiling? Tags: gnuplot, haskell Problem: Why haskell gnuplot code works in ghci, but not from CLI after compiling? The next simple code works fine in GHCi (the...

Why haskell gnuplot code works in ghci, but not from CLI after compiling? Why haskell gnuplot code works in ghci, but not from CLI after compiling? gnuplot haskell CLI Graphics.Gnuplot.Simple Why Double Why haskell gnuplot code works in ghci, but not from CLI after compiling? The next simple code works fine in GHCi (th...

[ 0.000751495361328125, -0.016845703125, 0.004150390625, 0.00153350830078125, -0.002197265625, 0.0245361328125, 0.015869140625, -0.013916015625, 0.001190185546875, -0.004119873046875, -0.0062255859375, -0.0113525390625, 0.0108642578125, -0.0062255859375, 0.004425048828125, 0.015319824218...

[ 44084, 1556, 142508, 104155, 105710, 18151, 43240, 23, 31380, 318, 1284, 959, 1295, 313, 10927, 7103, 9969, 49725, 189682, 539, 8859, 33209, 107172, 11737, 8781, 5885, 527, 73265, 14, 76896, 678, 48461, 135179, 1632, 11675, 75101, 13315, 3372...

[ 0.078369140625, 0.1273193359375, 0.2147216796875, 0.182861328125, 0.2376708984375, 0.1507568359375, 0.1060791015625, 0.06951904296875, 0.1171875, 0.12841796875, 0.03558349609375, 0.0850830078125, 0.100341796875, 0.041473388671875, 0.18212890625, 0.09033203125, 0.131591796875, 0.108...

embed

33715010_c0

33715010

haskell

0

Title: GHC import feature or bug Problem title: GHC import feature or bug Tags: haskell, ghc Problem: GHC import feature or bug I found that the following code is accepted by GHC: import Prelude hiding (filter) import qualified Prelude as P The idea of these two imports is to make all Prelude functions available as usu...

GHC import feature or bug GHC import feature or bug haskell ghc feature Prelude qualified GHC P.filter GHC import feature or bug I found that the following code is accepted by GHC: The idea of these two imports is to make all Prelude functions available as usual, but to require filter to be qualified as P.filter . I ne...

[ 0.00714111328125, -0.002716064453125, 0.00787353515625, 0.00110626220703125, -0.005462646484375, -0.00116729736328125, 0.0021514892578125, -0.0128173828125, 0.0059814453125, -0.01708984375, -0.005828857421875, -0.0026397705078125, -0.0031585693359375, -0.004791259765625, 0.00595092773437...

[ 527, 73265, 24927, 60213, 707, 54608, 1556, 142508, 31380, 238, 1914, 822, 112, 217225, 436, 120337, 14037, 25632, 18151, 68186, 6528, 6626, 3249, 756, 32354, 19882, 115723, 1284, 64209, 46312, 237, 5, 21373, 27781, 83, 903 ]

[ 0.1053466796875, 0.2666015625, 0.240966796875, 0.1947021484375, 0.041717529296875, 0.2061767578125, 0.10272216796875, 0.1966552734375, 0.116455078125, 0.1422119140625, 0.1126708984375, 0.1976318359375, 0.1553955078125, 0.183837890625, 0.0931396484375, 0.2457275390625, 0.0116577148437...

embed

14639335_c0

14639335

haskell

0

Title: Using map and recursive functions in Haskell Problem title: Using map and recursive functions in Haskell Tags: haskell, recursion Problem: Using map and recursive functions in Haskell so I'm learning how to program in Haskell. One thing I would like to see is adding 1 to each element of a list by using map and u...

Using map and recursive functions in Haskell Using map and recursive functions in Haskell haskell recursion Using Haskell Using map and recursive functions in Haskell so I'm learning how to program in Haskell. One thing I would like to see is adding 1 to each element of a list by using map and using recursion that does...

[ -0.011474609375, 0.02734375, -0.00098419189453125, -0.006317138671875, -0.0048828125, 0.020751953125, -0.013427734375, 0.01300048828125, 0.004669189453125, -0.043212890625, 0.006744384765625, -0.038330078125, 0.0026092529296875, 0.03125, 0.01019287109375, -0.015625, 0.007110595703125...

[ 345, 22288, 136, 195625, 5844, 32354, 23, 20625, 142508, 1556, 1830, 52080, 1528, 1884, 1957, 154107, 106, 12638, 12830, 5303, 17368, 22027, 18, 4527, 46683, 3220, 15490, 77546, 80596, 35773, 17569, 442, 21185, 15044, 48322, 208124 ]

[ 0.114501953125, 0.252685546875, 0.1153564453125, 0.2401123046875, 0.1591796875, 0.2105712890625, 0.0256195068359375, 0.1539306640625, 0.259765625, 0.1455078125, 0.14892578125, 0.055633544921875, 0.1070556640625, 0.060028076171875, 0.0675048828125, 0.17724609375, 0.114501953125, 0.0...

embed

18665559_c0

18665559

haskell

0

Title: How to monitor computation process in Haskell Problem title: How to monitor computation process in Haskell Tags: haskell Problem: How to monitor computation process in Haskell I have a function in my main block map anyHeavyFunction [list] I'd like to show a progress bar during the computation process or add addi...

How to monitor computation process in Haskell How to monitor computation process in Haskell haskell How Haskell State How to monitor computation process in Haskell I have a function in my main block I'd like to show a progress bar during the computation process or add additional actions (pause, stop process etc.), but ...

[ -0.0284423828125, -0.003173828125, 0.0037078857421875, 0.0186767578125, 0.0027008056640625, -0.00067138671875, 0.00360107421875, -0.00063323974609375, 0.00092315673828125, -0.033935546875, 0.0101318359375, -0.0181884765625, 0.0115966796875, 0.0233154296875, 0, 0.00156402587890625, 0....

[ 11249, 47, 12983, 181135, 1363, 9433, 23, 20625, 142508, 1556, 22836, 32354, 5201, 46389, 1884, 7639, 42658, 1909, 20271, 15190, 78301, 61972, 149302, 7279, 22288, 83, 34166, 831, 105237, 57767, 4527, 2667, 712, 7, 2367, 95307, 17780 ]

[ 0.08538818359375, 0.080810546875, 0.256591796875, 0.187255859375, 0.09051513671875, 0.1572265625, 0.0826416015625, 0.156494140625, 0.26806640625, 0.14599609375, 0.1873779296875, 0.1361083984375, 0.0677490234375, 0.1510009765625, 0.0736083984375, 0.122314453125, 0.1669921875, 0.1538...

embed

40432743_c0

40432743

haskell

0

Title: Remove commen elements from two lists Problem title: Remove commen elements from two lists Tags: haskell, list Problem: Remove commen elements from two lists I'm trying to make a function that, given two lists, removes from both lists the elements they have in commen. I've been breaking My Head over this but I h...

Remove commen elements from two lists Remove commen elements from two lists haskell list two Remove Remove commen elements from two lists I'm trying to make a function that, given two lists, removes from both lists the elements they have in commen. I've been breaking My Head over this but I haven't been able to come up...

[ -0.0017852783203125, 0.01202392578125, -0.01324462890625, 0.030517578125, -0.004547119140625, 0.0220947265625, 0.005859375, 0.0010986328125, 0.006927490234375, -0.02197265625, 0.0031890869140625, 0.003936767578125, 0.018798828125, 0.0181884765625, -0.0194091796875, -0.0048828125, 0.0...

[ 181139, 3739, 19, 80854, 1295, 6626, 5303, 1556, 142508, 7, 31577, 32354, 34475, 87388, 15044, 1836, 765, 23, 116987, 44816, 16797, 29806, 1238, 5608, 30646, 1884 ]

[ 0.184326171875, 0.2181396484375, 0.17431640625, 0.208251953125, 0.12109375, 0.177734375, 0.21923828125, 0.119873046875, 0.1942138671875, 0.0211944580078125, 0.041229248046875, 0.1510009765625, 0.09881591796875, 0.1549072265625, 0.123291015625, 0.0057373046875, 0.03662109375, 0.0089...

embed

40701595_c0

40701595

haskell

0

Title: Map function is not working properly? Problem title: Map function is not working properly? Tags: haskell Problem: Map function is not working properly? Map functions is not working on this line compPic (a:as) = map (compL a) as It just work on single string but not on a list of string can you find error. compL :...

Map function is not working properly? Map function is not working properly? haskell Map a:as Map function is not working properly? Map functions is not working on this line compPic (a:as) = map (compL a) as It just work on single string but not on a list of string can you find error.

[ -0.017578125, -0.0228271484375, 0.01123046875, 0.0059814453125, -0.01318359375, 0.0150146484375, 0.01031494140625, -0.0050048828125, 0.017333984375, -0.00469970703125, -0.0093994140625, 0.0262451171875, 0.0206298828125, 0.02978515625, -0.004730224609375, -0.007568359375, -0.000625610...

[ 42719, 32354, 83, 959, 20697, 155965, 1556, 142508, 10, 12, 162, 7, 98, 903, 13315, 9969, 683, 1771, 11, 2203, 22288, 58875, 866, 237, 1660, 4488, 11001, 79315, 5303, 831, 7413, 18499 ]

[ 0.282958984375, 0.213134765625, 0.057281494140625, 0.1170654296875, 0.1539306640625, 0.1600341796875, 0.152099609375, 0.2335205078125, 0.135009765625, 0.0892333984375, 0.222412109375, 0.028778076171875, 0.0631103515625, 0.06097412109375, 0.1279296875, 0.142578125, 0.09417724609375, ...

embed

48143692_c0

48143692

haskell

0

Title: Haskell let expression converges while similar expression using fix does not Problem title: Haskell let expression converges while similar expression using fix does not Tags: haskell, mutual-recursion Problem: Haskell let expression converges while similar expression using fix does not I have been having difficu...

Haskell let expression converges while similar expression using fix does not Haskell let expression converges while similar expression using fix does not haskell mutual-recursion fix Haskell Haskell let expression converges while similar expression using fix does not I have been having difficulty understanding why the ...

[ 0.01092529296875, 0.01116943359375, 0.0045166015625, 0.0267333984375, 0.019287109375, 0.0024566650390625, -0.00970458984375, 0.00323486328125, -0.004364013671875, 0.00174713134765625, 0.003143310546875, 0.0186767578125, 0.007476806640625, 0.0086669921875, 0.03662109375, -0.016723632812...

[ 20625, 142508, 2633, 125195, 158, 74789, 12960, 21373, 17368, 30022, 959, 1556, 199849, 107, 48650, 1830, 14602, 34844, 100094, 15400, 425, 4, 53, 2203, 17727, 23, 47, 2858, 84751, 1284, 103607, 50339, 28354, 8035, 104250, 19, 73342 ]

[ 0.121826171875, 0.208251953125, 0.2158203125, 0.2275390625, 0.099853515625, 0.205810546875, 0.0706787109375, 0.15576171875, 0.035888671875, 0.2183837890625, 0.1309814453125, 0.1260986328125, 0.1446533203125, 0.0340576171875, 0.147216796875, 0.018585205078125, 0.007080078125, 0.0253...

embed

35278498_c0

35278498

haskell

0

Title: Haskell get set thread name Problem title: Haskell get set thread name Tags: haskell Problem: Haskell get set thread name When I print something in Java, I usually append the name of the thread to the print statement so I know what thread is running what print statement. How do I get and set the thread name in H...

Haskell get set thread name Haskell get set thread name haskell Haskell Haskell get set thread name When I print something in Java, I usually append the name of the thread to the print statement so I know what thread is running what print statement. How do I get and set the thread name in Haskell? If I can't set the th...

[ 0.02197265625, 0.006195068359375, 0.00927734375, 0.0191650390625, 0.01043701171875, 0.00439453125, 0.01348876953125, 0.002685546875, -0.0093994140625, -0.0244140625, -0.000347137451171875, -0.0086669921875, -0.02294921875, -0.0130615234375, -0.010009765625, 0.01251220703125, 0.006591...

[ 20625, 142508, 2046, 5423, 86997, 9351, 1556, 28412, 23, 41925, 56104, 114689, 71, 111, 63805, 3714, 51042, 11249, 136, 70, 831, 18, 3642, 3249, 34475, 8337, 8, 32032, 123055, 43578, 568, 927, 39116, 24931, 37382 ]

[ 0.13330078125, 0.230224609375, 0.100830078125, 0.1846923828125, 0.2454833984375, 0.1820068359375, 0.12744140625, 0.133544921875, 0.006439208984375, 0.17333984375, 0.03350830078125, 0.0806884765625, 0.010986328125, 0.0032958984375, 0.12451171875, 0.056365966796875, 0.040313720703125, ...

embed

27327970_c0

27327970

haskell

0

Title: Haskell recursion odd Problem title: Haskell recursion odd Tags: list, haskell Problem: Haskell recursion odd I have to define my own predicate function that recursively searches a list of numbers and returns True if it finds an odd number, False otherwise. I have set X = [1..100] for test data that I need to sh...

Haskell recursion odd Haskell recursion odd list haskell Haskell Haskell recursion odd I have to define my own predicate function that recursively searches a list of numbers and returns True if it finds an odd number, False otherwise. I have set X = [1..100] for test data that I need to show. However, I am a bit unsure...

[ -0.02197265625, 0.02978515625, 0.01531982421875, -0.01025390625, 0.0234375, 0.03759765625, -0.001495361328125, -0.0238037109375, 0.01129150390625, -0.0145263671875, 0.0181884765625, -0.031982421875, 0.0034637451171875, 0.004150390625, 0.004852294921875, 0.01312255859375, 0.0234375, ...

[ 20625, 142508, 195625, 1830, 70270, 5303, 1556, 765, 61924, 10002, 1653, 2063, 67, 32354, 5844, 33938, 101935, 30646, 87599, 2174, 7413, 14012, 22225, 184, 120262, 5423, 1193, 2203, 68252, 5, 3559, 3034, 2053, 3871, 7639, 4785, 51646, 3642, ...

[ 0.151611328125, 0.204833984375, 0.251953125, 0.1436767578125, 0.25244140625, 0.1861572265625, 0.1531982421875, 0.01995849609375, 0.117431640625, 0.0885009765625, 0.1400146484375, 0.1451416015625, 0.058258056640625, 0.1279296875, 0.0889892578125, 0.1837158203125, 0.1324462890625, 0....

embed

44167571_c0

44167571

haskell

0

Title: Datatype Person mother from mother (grandmother) Problem title: Datatype Person mother from mother (grandmother) Tags: option-type, types, haskell Problem: Datatype Person mother from mother (grandmother) Imagine I've got a datatype Person . data Person = Person String Person The 2. Person should be the mother. ...

Datatype Person mother from mother (grandmother) Datatype Person mother from mother (grandmother) option-type types haskell mother Datatype Person Maybe Just Datatype Person mother from mother (grandmother) Imagine I've got a datatype Person . The 2. Person should be the mother. Will only show the mother from person x....

[ -0.006378173828125, 0.0260009765625, 0.0274658203125, 0.033935546875, 0.01220703125, 0.0302734375, 0.0211181640625, 0.004180908203125, -0.01318359375, -0.033203125, -0.0016632080078125, -0.0064697265625, -0.00054931640625, 0.00323486328125, 0.017578125, -0.00531005859375, -0.00250244...

[ 11809, 50986, 15270, 42732, 1295, 79139, 432, 9319, 35829, 52895, 1556, 142508, 83425, 133196, 4163, 2053, 787, 5608, 186, 70, 4734, 7639, 3445, 1022, 11249, 831, 9963 ]

[ 0.1358642578125, 0.269775390625, 0.1905517578125, 0.2022705078125, 0.11865234375, 0.097900390625, 0.156982421875, 0.1356201171875, 0.16845703125, 0.1590576171875, 0.1199951171875, 0.239013671875, 0.01324462890625, 0.10009765625, 0.018280029296875, 0.1463623046875, 0.1375732421875, ...

embed

47502136_c0

47502136

haskell

0

Title: Flags in global Stack config.yaml Problem title: Flags in global Stack config.yaml Tags: haskell-stack, haskell Problem: Flags in global Stack config.yaml I tried adding some flags to my global Stack config.yaml : flags: extra-include-dirs: /usr/include/ Alas it's not being recognised: Warning: /Users/vilem/.sta...

Flags in global Stack config.yaml Flags in global Stack config.yaml haskell-stack haskell Flags Stack config.yaml Warning Users Unrecognized ConfigMonoid Flags in global Stack config.yaml I tried adding some flags to my global Stack config.yaml : Alas it's not being recognised: What am I doing wrong? The documentation ...

[ -0.004852294921875, 0.00634765625, -0.005645751953125, -0.00041961669921875, -0.0035552978515625, -0.0089111328125, -0.0174560546875, 0.004364013671875, -0.0208740234375, 0.019775390625, -0.00750732421875, -0.0189208984375, -0.0027313232421875, -0.01324462890625, 0, 0.003997802734375, ...

[ 125726, 7, 23, 7964, 6512, 2594, 153837, 14520, 141, 1556, 142508, 590, 5550, 53400, 992, 107, 115558, 139403, 46674, 48899, 37842, 154107, 3060, 49938, 959, 8035, 75530, 5281, 20594, 44691, 209806, 35166 ]

[ 0.26953125, 0.1046142578125, 0.043060302734375, 0.1473388671875, 0.171875, 0.1689453125, 0.1937255859375, 0.1455078125, 0.122802734375, 0.081298828125, 0.1766357421875, 0.129638671875, 0.0804443359375, 0.1373291015625, 0.0271453857421875, 0.009246826171875, 0.13134765625, 0.1540527...

embed

66251460_c0

66251460

haskell

0

Title: How do I properly use '/=' haskell infix operator for xor? Problem title: How do I properly use '/=' haskell infix operator for xor? Tags: xor, infix-notation, haskell Problem: How do I properly use '/=' haskell infix operator for xor? I'm learning haskell and I'm having an issue getting a li...

How do I properly use '/=' haskell infix operator for xor? How do I properly use '/=' haskell infix operator for xor? xor infix-notation haskell How How do I properly use '/=' haskell infix operator for xor? I'm learning haskell and I'm having an issue getting a line of code to work. The error says ...

[ 0.009765625, 0.0283203125, 0.01165771484375, -0.030517578125, 0.0059814453125, -0.000629425048828125, -0.002288818359375, 0.009033203125, 0.01031494140625, -0.017333984375, 0.0167236328125, 0.004669189453125, 0.0269775390625, -0.00579833984375, -0.01470947265625, 0.0019073486328125, ...

[ 11249, 87, 155965, 4527, 3768, 64, 1369, 54764, 1556, 142508, 23, 55923, 39933, 100, 74706, 54, 157, 22062, 25, 52080, 31089, 20949, 13315, 18151, 47, 4488, 18499, 442, 183037, 22422, 4358 ]

[ 0.059234619140625, 0.015472412109375, 0.1324462890625, 0.1480712890625, 0.14599609375, 0.2060546875, 0.251708984375, 0.0164337158203125, 0.146728515625, 0.2279052734375, 0.1353759765625, 0.2457275390625, 0.20654296875, 0.06365966796875, 0.21875, 0.034393310546875, 0.102783203125, 0...

embed

61850757_c0

61850757

haskell

0

Title: How can I hide the tuple type constructor? Problem title: How can I hide the tuple type constructor? Tags: haskell, tuples Problem: How can I hide the tuple type constructor? I want to write my own tuples (for fun and exercising). Is there a way to hide Haskell's default constructor (,) ? I tried import Prelude ...

How can I hide the tuple type constructor? How can I hide the tuple type constructor? haskell tuples Prelude How Main.hs:5:50 How can I hide the tuple type constructor? I want to write my own tuples (for fun and exercising). Is there a way to hide Haskell's default constructor (,) ? I tried but this results in a parse ...

[ 0.00860595703125, 0.0024566650390625, -0.003173828125, 0.03369140625, -0.006256103515625, -0.0028533935546875, -0.01019287109375, -0.01104736328125, 0.0034942626953125, -0.032470703125, -0.0228271484375, -0.03515625, 0.0162353515625, -0.0004253387451171875, -0.0103759765625, 0.00286865...

[ 11249, 831, 87, 1274, 112, 370, 8705, 10644, 64549, 748, 1556, 142508, 99726, 1914, 822, 12321, 127, 23837, 3444, 33022, 10002, 7477, 56785, 20625, 114977, 4, 366, 184, 18499, 26785, 15 ]

[ 0.036468505859375, 0.03680419921875, 0.01287841796875, 0.1551513671875, 0.127197265625, 0.1024169921875, 0.177978515625, 0.1480712890625, 0.15869140625, 0.130615234375, 0.0838623046875, 0.208740234375, 0.195068359375, 0.005584716796875, 0.08404541015625, 0.007720947265625, 0.00125122...

embed

24611565_c0

24611565

haskell

0

Title: cabal, module and dependencies Problem title: cabal, module and dependencies Tags: haskell, cabal Problem: cabal, module and dependencies I was wondering, when you download and install a package via cabal, does cabal tries to build everything or only what you need. For example lots of package include and Haskell...

cabal, module and dependencies cabal, module and dependencies haskell cabal cabal, module and dependencies I was wondering, when you download and install a package via cabal, does cabal tries to build everything or only what you need. For example lots of package include and HaskellTemplate module which obviously requir...

[ -0.0016021728515625, 0.000579833984375, 0.0152587890625, 0.01318359375, -0.0079345703125, 0.011474609375, -0.001922607421875, -0.000698089599609375, 0.00518798828125, 0.00151824951171875, 0.00408935546875, -0.057373046875, -0.0035400390625, 0.016845703125, 0.00238037109375, 0.001754760...

[ 109524, 88996, 136, 42548, 1556, 142508, 117538, 149016, 3229, 7026, 20600, 98169, 1829, 14602, 1927, 90, 47, 45367, 26818, 707, 4734, 2367, 398, 3871, 1326, 71358, 111, 26698, 20625, 159065, 19309, 171259, 144570, 111938, 53383, 2174, 4527, ...

[ 0.274658203125, 0.21630859375, 0.07061767578125, 0.1800537109375, 0.1268310546875, 0.1976318359375, 0.06561279296875, 0.062408447265625, 0.0172576904296875, 0.12841796875, 0.11865234375, 0.174560546875, 0.0985107421875, 0.04241943359375, 0.1295166015625, 0.045318603515625, 0.06988525...

embed

27687734_c0

27687734

haskell

0

Title: Why error with my code Problem title: Why error with my code Tags: haskell Problem: Why error with my code In this script, data Move = Rock | Paper | Scissor deriving (Show,Eq) lose Rock = Scissor lose Paper = Rock lose _ = Paper data Result = Win | Draw | Lose deriving (Show,Eq) outcome :: Move -> Move -> Resul...

Why error with my code Why error with my code haskell Why Move Rock Paper Scissor Show Result Win Draw Lose con1 Why error with my code In this script, I wonder why there is a Thanks for your advance!

[ 0.005126953125, 0.016845703125, -0.0235595703125, -0.005126953125, -0.0003376007080078125, 0.02099609375, -0.007232666015625, 0.0091552734375, 0.000652313232421875, 0.005767822265625, -0.001007080078125, -0.00848388671875, 0.0184326171875, -0.016357421875, 0.0020599365234375, -0.002456...

[ 44084, 18499, 678, 759, 18151, 1556, 142508, 135828, 14434, 62323, 49628, 7, 4970, 17367, 126684, 17686, 18186, 434, 3731, 13, 158, 418, 903, 26499, 32195, 15400, 2685, 83, 10, 22362, 129745 ]

[ 0.12939453125, 0.237548828125, 0.180419921875, 0.1282958984375, 0.244384765625, 0.1556396484375, 0.2274169921875, 0.168212890625, 0.204345703125, 0.20068359375, 0.1302490234375, 0.053070068359375, 0.1690673828125, 0.157470703125, 0.12646484375, 0.114990234375, 0.07861328125, 0.0262...

embed

42922217_c0

42922217

haskell

0

Title: Haskell Stack ghci flags Problem title: Haskell Stack ghci flags Tags: haskell, ghci, haskell-stack Problem: Haskell Stack ghci flags Basically, I am trying to achieve the following: stack ghci --flag proj:dev but it seems that flag is not valid for ghci, only for build . How can I achieve this? If possible *Not...

Haskell Stack ghci flags Haskell Stack ghci flags haskell ghci haskell-stack Haskell Stack proj:dev Haskell Stack ghci flags Basically, I am trying to achieve the following: stack ghci --flag proj:dev but it seems that flag is not valid for ghci, only for build . How can I achieve this? If possible *Notes: proj is a cl...

[ -0.006866455078125, -0.00970458984375, 0.006134033203125, 0.00183868408203125, 0.00008296966552734375, -0.008544921875, -0.0146484375, 0.0164794921875, -0.007354736328125, -0.0162353515625, 0.00872802734375, -0.0303955078125, -0.006744384765625, -0.0078125, 0.00193023681640625, 0.01159...

[ 20625, 142508, 6512, 2594, 31380, 318, 49938, 1556, 590, 502, 170, 18548, 31577, 69307, 177261, 4210, 190872, 12, 959, 35604, 4734, 100, 45367, 7722, 20450, 2422, 23722, 17562, 110934, 4527, 8, 2601, 7413, 72803, 21771, 39544, 65572, 31842, ...

[ 0.1268310546875, 0.2158203125, 0.1297607421875, 0.1136474609375, 0.1552734375, 0.18798828125, 0.2471923828125, 0.0977783203125, 0.035919189453125, 0.1158447265625, 0.13134765625, 0.254150390625, 0.054412841796875, 0.0926513671875, 0.224853515625, 0.0648193359375, 0.246337890625, 0....

embed

65955631_c0

65955631

haskell

0

Title: How to sum the value in a key/value list of tuples that has duplicates key? Problem title: How to sum the value in a key/value list of tuples that has duplicates key? Tags: haskell Problem: How to sum the value in a key/value list of tuples that has duplicates key? Consider the exemple: [("AAA",2),("BBB",5),("AA...

How to sum the value in a key/value list of tuples that has duplicates key? How to sum the value in a key/value list of tuples that has duplicates key? haskell How AAA BBB CCC How to sum the value in a key/value list of tuples that has duplicates key? Consider the exemple: And I want to combine the tuples containing th...

[ -0.00518798828125, -0.00060272216796875, 0.015625, 0.004791259765625, -0.010009765625, -0.0040283203125, -0.006378173828125, 0.022216796875, 0.0169677734375, 0.00994873046875, -0.011474609375, -0.005035400390625, 0.0235595703125, 0.01123046875, -0.01336669921875, -0.0030364990234375, ...

[ 11249, 47, 10554, 34292, 23, 22799, 27494, 5303, 370, 99726, 1556, 171763, 1636, 70, 64, 450, 142508, 155616, 22312, 134982, 10, 111, 18632, 3444, 70163, 70541, 5701, 71713, 214, 154107, 142424, 16750, 1884 ]

[ 0.0838623046875, 0.072265625, 0.24365234375, 0.1951904296875, 0.079833984375, 0.1895751953125, 0.10986328125, 0.158203125, 0.1162109375, 0.2022705078125, 0.0880126953125, 0.2218017578125, 0.14794921875, 0.057525634765625, 0.0271759033203125, 0.02716064453125, 0.1824951171875, 0.150...

embed

66106841_c0

66106841

haskell

0

Title: Why doesn't 6 / length [1, 2, 3] work in Haskell Problem title: Why doesn't 6 / length [1, 2, 3] work in Haskell Tags: haskell, types Problem: Why doesn't 6 / length [1, 2, 3] work in Haskell Can someone explain to me why 6 / 3 works but 6 / length [1, 2, 3] errors out? Here's the error in REPL <intera...

Why doesn't 6 / length [1, 2, 3] work in Haskell Why doesn't 6 / length [1, 2, 3] work in Haskell haskell types a Why Haskell Fractional Why doesn't 6 / length [1, 2, 3] work in Haskell Can someone explain to me why 6 / 3 works but 6 / length [1, 2, 3] errors out? Here's the error in REPL

[ -0.00921630859375, 0.010009765625, 0.007293701171875, -0.0011444091796875, 0.003662109375, 0.00994873046875, -0.0037384033203125, -0.00970458984375, 0.00946044921875, -0.0181884765625, -0.00921630859375, -0.0223388671875, 0.0186767578125, -0.0098876953125, -0.0010223388671875, -0.01165...

[ 44084, 22027, 3768, 18, 305, 248, 140909, 68252, 116, 138, 4488, 20625, 142508, 4, 23, 1556, 52895, 7868, 10763, 289, 73342, 15400, 43240, 1284, 18499, 1810, 9069, 21130 ]

[ 0.09906005859375, 0.10382080078125, 0.06976318359375, 0.0955810546875, 0.19970703125, 0.1490478515625, 0.196533203125, 0.096923828125, 0.1405029296875, 0.18798828125, 0.1287841796875, 0.15625, 0.244873046875, 0.010284423828125, 0.043701171875, 0.135498046875, 0.135986328125, 0.1279...

embed

10986474_c0

10986474

haskell

0

Title: How do I stop wxhaskell from beeping on enter in text controls? Problem title: How do I stop wxhaskell from beeping on enter in text controls? Tags: wxwidgets, wxhaskell, haskell Problem: How do I stop wxhaskell from beeping on enter in text controls? I've played around with processEnter , on command , and on an...

How do I stop wxhaskell from beeping on enter in text controls? How do I stop wxhaskell from beeping on enter in text controls? wxwidgets wxhaskell haskell beeping How How do I stop wxhaskell from beeping on enter in text controls? I've played around with processEnter , on command , and on anyKey with textEntry to no a...

[ 0.000926971435546875, 0.00020599365234375, 0.0162353515625, -0.01556396484375, -0.01202392578125, 0.003448486328125, 0.0091552734375, 0.00823974609375, -0.0186767578125, -0.036376953125, -0.006622314453125, -0.0164794921875, -0.0012969970703125, -0.004669189453125, 0.004547119140625, 0...

[ 11249, 7279, 148, 137056, 7, 142508, 1295, 186, 13, 10366, 98, 30957, 23, 7986, 6226, 425, 32306, 3794, 1556, 54, 112730, 9433, 155581, 75101, 2499, 162429, 678, 7768, 15123, 110, 209806, 30854, 4358, 17368, 107754, 363, 5, 68107, 3773, 3...

[ 0.04718017578125, 0.201904296875, 0.1339111328125, 0.1815185546875, 0.09814453125, 0.260009765625, 0.09307861328125, 0.1461181640625, 0.1229248046875, 0.16162109375, 0.042449951171875, 0.205810546875, 0.08843994140625, 0.18115234375, 0.2042236328125, 0.14208984375, 0.1129150390625, ...

embed

37017779_c0

37017779

haskell

0

Title: Haskell Euler's totient error? Problem title: Haskell Euler's totient error? Tags: haskell Problem: Haskell Euler's totient error? I am trying to use Haskell to compute Euler's totient function: totient m = product [(p - 1) * p ^ (c) | (p, c) <- prime_factors_mult m] However, this does not at all compu...

Haskell Euler's totient error? Haskell Euler's totient error? haskell Haskell Euler prime_factors_mult p-1 Haskell Euler's totient error? I am trying to use Haskell to compute Euler's totient function: However, this does not at all compute the coprime factors less than m. Is there an error in my logic somewhe...

[ -0.0189208984375, 0.0267333984375, 0.01043701171875, 0.00531005859375, 0.00933837890625, -0.011474609375, -0.00193023681640625, -0.020263671875, 0.0021514892578125, -0.044921875, 0.0130615234375, -0.0093994140625, 0.026123046875, 0.000972747802734375, -0.0025787353515625, -0.0005226135...

[ 20625, 142508, 5177, 603, 3768, 7, 1186, 18750, 18499, 32, 1556, 20809, 144810, 81944, 915, 5759, 25, 31577, 4527, 9969, 6743, 32354, 903, 959, 99, 756, 552, 114654, 120103, 40715, 3501, 347, 759, 62775, 5351, 254, 110218, 26785, 14012, 1...

[ 0.151123046875, 0.26025390625, 0.16162109375, 0.2144775390625, 0.10064697265625, 0.032470703125, 0.1580810546875, 0.2049560546875, 0.228515625, 0.0249481201171875, 0.126953125, 0.1746826171875, 0.213134765625, 0.1754150390625, 0.1126708984375, 0.184326171875, 0.0171661376953125, 0....

embed

18421926_c1

18421926

haskell

1

of phi started to look pretty similar to the first argument of apomorphism specialized for lists: xxapo :: ([a] -> Prim [a] (Either [a] [a])) -> [a] -> [a] xxapo = apo ( [a] -> Either [a] [a] vs [a] -> Prim [a] [a] (Either [a] [a] ) So I wonder is it possible to implement filtering using apomorphisms or other generali...

[ -0.00982666015625, 0.0272216796875, 0.01287841796875, -0.0012969970703125, 0.00811767578125, 0.006622314453125, 0.0245361328125, -0.00872802734375, 0.0162353515625, -0.01141357421875, -0.000591278076171875, 0.0098876953125, 0.009765625, 0.00567626953125, -0.0167236328125, -0.0083618164...

[ 111, 44171, 26859, 6713, 28875, 21373, 47, 5117, 10750, 6885, 178851, 8780, 5361, 29367, 5303, 113664, 25395, 1984, 33079, 44506, 9319, 20209, 32195, 7722, 29479, 46312, 214, 17368, 3789, 4537, 51, 42822, 3877, 5, 121, 70, 2965, 831, 15673,...

[ 0.111328125, 0.2138671875, 0.07171630859375, 0.1488037109375, 0.0679931640625, 0.1641845703125, 0.0158233642578125, 0.0921630859375, 0.2489013671875, 0.20751953125, 0.267578125, 0.15087890625, 0.1258544921875, 0.040985107421875, 0.1900634765625, 0.1322021484375, 0.2366943359375, 0....

embed

49518370_c0

49518370

haskell

0

Title: How to move 1 element of a List to right or left in Haskell? Problem title: How to move 1 element of a List to right or left in Haskell? Tags: haskell, list Problem: How to move 1 element of a List to right or left in Haskell? Hi I have been looking for an answer but could not find one. Lets say that we have a l...

How to move 1 element of a List to right or left in Haskell? How to move 1 element of a List to right or left in Haskell? haskell list How List Haskell How to move 1 element of a List to right or left in Haskell? Hi I have been looking for an answer but could not find one. Lets say that we have a list like [1,10,4,5,3]...

[ 0.0064697265625, 0.033447265625, 0.005950927734375, -0.0162353515625, -0.009765625, -0.000812530517578125, -0.0281982421875, 0.009521484375, -0.000713348388671875, -0.0194091796875, 0.00689697265625, -0.002197265625, -0.0045166015625, 0.01214599609375, -0.00177764892578125, 0.003555297...

[ 11249, 47, 25813, 106, 12830, 111, 32036, 7108, 707, 25737, 23, 20625, 142508, 1556, 5303, 10, 2673, 35166, 10842, 963, 80389, 96386, 3642, 831, 87, 122925, 190, 221, 24209, 758, 617, 37842, 202317, 647, 19929, 28848, 90791, 63262, 33342, ...

[ 0.0960693359375, 0.1656494140625, 0.2200927734375, 0.1468505859375, 0.226806640625, 0.045135498046875, 0.201904296875, 0.218505859375, 0.13623046875, 0.2110595703125, 0.062255859375, 0.15966796875, 0.25732421875, 0.1370849609375, 0.1810302734375, 0.00653076171875, 0.0035400390625, ...

embed

29706448_c0

29706448

haskell

0

Title: Dollar sign inside closed parens Problem title: Dollar sign inside closed parens Tags: dollar-sign, syntax, operator-keyword, haskell Problem: Dollar sign inside closed parens Websocket snippet has a statement that has dollar sign inside closed parens like this, any ($ fst client) Since haskellers use $ sign ins...

Dollar sign inside closed parens Dollar sign inside closed parens dollar-sign syntax operator-keyword haskell Dollar Prelude Dollar sign inside closed parens Websocket snippet has a statement that has dollar sign inside closed parens like this, Since haskellers use $ sign instead of parens, why do we need parens here? ...

[ 0.012939453125, 0.0177001953125, 0.0035552978515625, 0.01141357421875, -0.010009765625, 0.035400390625, -0.00872802734375, 0.0194091796875, -0.01513671875, -0.0240478515625, -0.01519775390625, -0.015869140625, -0.0101318359375, 0.0164794921875, -0.00836181640625, 0.0146484375, -0.012...

[ 83393, 24092, 46132, 155738, 366, 1755, 15437, 31304, 6002, 86531, 39933, 47416, 1556, 142508, 1914, 822, 991, 27853, 58134, 63805, 1884, 903, 1314, 4527, 3650, 64457, 15400, 3871, 3688, 44084, 83, 2685, 26582, 17721, 37842, 32354, 390, 20594...

[ 0.191650390625, 0.2142333984375, 0.1510009765625, 0.18701171875, 0.1512451171875, 0.183349609375, 0.2149658203125, 0.1890869140625, 0.008514404296875, 0.133544921875, 0.167236328125, 0.06219482421875, 0.0814208984375, 0.195068359375, 0.048919677734375, 0.1229248046875, 0.029846191406...

embed

58993547_c0

58993547

haskell

0

Title: Walk through a list split function in Haskell Problem title: Walk through a list split function in Haskell Tags: fold, split, haskell, list Problem: Walk through a list split function in Haskell This is a follow up to my previous question . I am trying to understand the list splitting example in Haskell from her...

Walk through a list split function in Haskell Walk through a list split function in Haskell fold split haskell list Walk Haskell a:y Walk through a list split function in Haskell This is a follow up to my previous question . I am trying to understand the list splitting example in Haskell from here : I can read Haskell ...

[ -0.00153350830078125, 0.00469970703125, -0.01214599609375, 0.0052490234375, -0.0242919921875, 0.0059814453125, -0.004241943359375, -0.00994873046875, 0.0198974609375, 0.0169677734375, 0.0059814453125, -0.01806640625, 0.00811767578125, 0.007080078125, -0.00537109375, -0.0019149780273437...

[ 115059, 8305, 5303, 65450, 32354, 20625, 142508, 10, 23, 42822, 1556, 53, 1257, 28219, 1916, 27781, 3688, 831, 12301, 3714, 2367, 18344, 7569, 83, 18, 903, 18151, 35691, 163, 73342, 41653 ]

[ 0.1697998046875, 0.16748046875, 0.2064208984375, 0.246337890625, 0.1898193359375, 0.128662109375, 0.2259521484375, 0.0638427734375, 0.047637939453125, 0.19384765625, 0.1082763671875, 0.12890625, 0.0035400390625, 0.09173583984375, 0.07012939453125, 0.156005859375, 0.001220703125, 0....

embed

64269188_c0

64269188

haskell

0

Title: Beginner's question about function signature Problem title: Beginner's question about function signature Tags: haskell, types Problem: Beginner's question about function signature I wrote the function pop as follows: pop :: Int n => [a] -> n -> a pop xs n = head $ drop n xs When trying to run it, I get...

Beginner's question about function signature Beginner's question about function signature haskell types Beginner Expected Constraint Beginner's question about function signature I wrote the function pop as follows: When trying to run it, I get an error saying: However, changing the signature to Solves the iss...

[ 0.013427734375, 0.0020599365234375, -0.00604248046875, -0.00238037109375, -0.01470947265625, 0.015869140625, -0.004852294921875, -0.0179443359375, 0.00921630859375, -0.01324462890625, 0.008544921875, -0.036376953125, -0.0113525390625, -0.004425048828125, -0.0115966796875, -0.0189208984...

[ 67053, 56, 3768, 9655, 1672, 32354, 138256, 1556, 142508, 52895, 60075, 13, 89829, 1657, 2816, 54397, 7426, 28960, 31577, 11675, 18499, 54433, 33306, 151134, 70, 47, 6678, 3132, 31089, 44084, 14602, 903, 53383 ]

[ 0.096435546875, 0.05560302734375, 0.0679931640625, 0.0887451171875, 0.01043701171875, 0.2286376953125, 0.292724609375, 0.1431884765625, 0.2452392578125, 0.17626953125, 0.03289794921875, 0.050140380859375, 0.002166748046875, 0.0150146484375, 0.1357421875, 0.0985107421875, 0.2937011718...

embed

15870512_c0

15870512

haskell

0

Title: What does the `-O99` flag do? Problem title: What does the `-O99` flag do? Tags: haskell, ghc Problem: What does the `-O99` flag do? The title is a slight joke. I just discovered today that ghc accepts any optimization level without complaining. I know that -O2 is supposed to be the maximum optimization level, a...

What does the `-O99` flag do? What does the `-O99` flag do? haskell ghc What O99 What does the `-O99` flag do? The title is a slight joke. I just discovered today that ghc accepts any optimization level without complaining. I know that -O2 is supposed to be the maximum optimization level, and that there is a proposed -...

[ 0.002593994140625, 0.00897216796875, -0.0052490234375, -0.0130615234375, -0.0015869140625, 0.01190185546875, -0.0172119140625, -0.003997802734375, 0.004486083984375, 0.04638671875, -0.023193359375, -0.0145263671875, 0.01611328125, -0.00543212890625, -0.002899169921875, 0.00086975097656...

[ 4865, 9, 670, 5046, 49938, 54, 1556, 142508, 31380, 238, 180, 14602, 70, 44759, 20016, 122122, 134053, 18925, 26946, 2499, 87235, 1363, 17366, 15490, 186992, 3714, 20, 304, 134598, 38132, 26171, 363, 3688, 193844, 96276, 121742, 40140, 77546,...

[ 0.05450439453125, 0.1275634765625, 0.1839599609375, 0.3583984375, 0.23876953125, 0.111328125, 0.11962890625, 0.2186279296875, 0.1630859375, 0.161865234375, 0.1754150390625, 0.0261383056640625, 0.06109619140625, 0.0178680419921875, 0.06396484375, 0.082763671875, 0.0618896484375, 0.0...

embed

53106042_c0

53106042

haskell

0

Title: How to use `GenT` in `hedgehog` Problem title: How to use `GenT` in `hedgehog` Tags: haskell-hedgehog, property-based-testing, haskell Problem: How to use `GenT` in `hedgehog` In the hedgehog library, there is a GenT monad transformer. However the forAll function takes a Gen type. There is a forAllT function, bu...

How to use `GenT` in `hedgehog` How to use `GenT` in `hedgehog` haskell-hedgehog property-based-testing haskell How GenT Gen Internal State How to use `GenT` in `hedgehog` In the hedgehog library, there is a GenT monad transformer. However the forAll function takes a Gen type. There is a forAllT function, but it is in ...

[ -0.00433349609375, -0.0001735687255859375, 0.003387451171875, -0.0137939453125, 0.0015869140625, -0.0185546875, 0.005401611328125, -0.036376953125, -0.006683349609375, -0.04296875, 0.017822265625, 0.018798828125, -0.006317138671875, 0.023193359375, 0.0033721923828125, -0.0191650390625,...

[ 11249, 4527, 105376, 618, 23, 5252, 60885, 1663, 47, 1556, 142508, 57266, 77007, 6954, 15937, 106745, 141, 22836, 80568, 35773, 2667, 712, 27198, 56, 100, 43512, 32354, 51776, 10644, 88996, 1884, 145823, 29458, 6044 ]

[ 0.047576904296875, 0.1514892578125, 0.2188720703125, 0.24609375, 0.068115234375, 0.07952880859375, 0.126708984375, 0.1685791015625, 0.011505126953125, 0.07513427734375, 0.15869140625, 0.0545654296875, 0.0162506103515625, 0.0751953125, 0.1861572265625, 0.1353759765625, 0.00244140625, ...

embed

1933283_c0

1933283

haskell

0

Title: What's new in QuickCheck 2? Problem title: What's new in QuickCheck 2? Tags: haskell, quickcheck Problem: What's new in QuickCheck 2? What are the major differences between QuickCheck 1 and QuickCheck 2? From looking at Haddock docs I can see that it is split across more modules, coarbitrary has been r...

What's new in QuickCheck 2? What's new in QuickCheck 2? haskell quickcheck What QuickCheck Fun FunArbitrary What's new in QuickCheck 2? What are the major differences between QuickCheck 1 and QuickCheck 2? From looking at Haddock docs I can see that it is split across more modules, coarbitrary has been replac...

[ -0.006103515625, -0.01141357421875, 0.00150299072265625, 0.01708984375, 0.0033111572265625, 0.03759765625, -0.00616455078125, -0.0181884765625, 0.0084228515625, 0.0322265625, 0.00592041015625, -0.01116943359375, -0.00164794921875, -0.0157470703125, 0.002960205078125, 0.00274658203125, ...

[ 4865, 3768, 3525, 23, 89038, 202567, 116, 1556, 142508, 63773, 78292, 28670, 7614, 3137, 3701, 53, 13036, 60212, 17721, 106, 136, 28129, 138414, 54, 65450, 36880, 1286, 88996, 30291, 1517, 1294, 91995, 10644, 18507, 99156, 28219, 134234, 2667...

[ 0.0248565673828125, 0.033477783203125, 0.1129150390625, 0.055419921875, 0.1527099609375, 0.283447265625, 0.183837890625, 0.07513427734375, 0.1707763671875, 0.1138916015625, 0.2203369140625, 0.177734375, 0.0142669677734375, 0.11474609375, 0.05517578125, 0.051605224609375, 0.0187377929...

embed

21504758_c0

21504758

haskell

0

Title: Haskell demonstration of equivalents to OOP Design Patterns Problem title: Haskell demonstration of equivalents to OOP Design Patterns Tags: design-patterns, haskell Problem: Haskell demonstration of equivalents to OOP Design Patterns There are claims that OOP design patterns are irrelevant in functional languag...

Haskell demonstration of equivalents to OOP Design Patterns Haskell demonstration of equivalents to OOP Design Patterns design-patterns haskell Haskell OOP Design Patterns Haskell demonstration of equivalents to OOP Design Patterns There are claims that OOP design patterns are irrelevant in functional languages. Are th...

[ 0.018310546875, 0.02392578125, 0.001922607421875, -0.0034942626953125, 0.00244140625, 0.003692626953125, 0.007354736328125, 0.01129150390625, 0.0084228515625, 0.006439208984375, -0.0069580078125, -0.0311279296875, 0.00726318359375, 0.002899169921875, 0.00494384765625, 0.000583648681640...

[ 20625, 142508, 32837, 183234, 180, 20880, 11724, 9876, 22766, 4331, 4453, 1556, 140526, 103510, 193, 169429, 123309, 46876, 18151, 8, 840, 12638, 831, 29479, 28484, 53397, 2806, 765, 47, 7639, 33636, 36746, 30563, 35874, 178851, 8780 ]

[ 0.143798828125, 0.2410888671875, 0.1392822265625, 0.13427734375, 0.082275390625, 0.23193359375, 0.1728515625, 0.1407470703125, 0.11572265625, 0.2008056640625, 0.1341552734375, 0.1292724609375, 0.0836181640625, 0.21240234375, 0.039031982421875, 0.16357421875, 0.1251220703125, 0.1242...

embed

43524843_c0

43524843

haskell

0

Title: Remove the Server response header in Yesod/Warp Problem title: Remove the Server response header in Yesod/Warp Tags: yesod, haskell-warp, haskell Problem: Remove the Server response header in Yesod/Warp How can I remove the Server HTTP response header in Yesod? I found code that's responsible for setting that he...

Remove the Server response header in Yesod/Warp Remove the Server response header in Yesod/Warp yesod haskell-warp haskell Remove Server Yesod Warp Remove the Server response header in Yesod/Warp How can I remove the Server HTTP response header in Yesod? I found code that's responsible for setting that header , but I d...

[ -0.01483154296875, 0.006134033203125, 0.00836181640625, 0.024169921875, -0.025390625, 0.006561279296875, -0.0172119140625, 0.01129150390625, -0.00921630859375, 0.01531982421875, 0.006561279296875, 0.028076171875, -0.01019287109375, 0.0032196044921875, -0.00970458984375, 0.0068969726562...

[ 181139, 22687, 57553, 10336, 56, 32635, 2199, 64, 71947, 254, 70, 23, 2422, 23722, 1556, 142508, 4205, 5550, 831, 87388, 135913, 18151, 102778, 53550, 91995, 34292, 201505, 79315, 15190, 13025, 38970, 193348, 12601, 442, 167969 ]

[ 0.164794921875, 0.1790771484375, 0.1666259765625, 0.171875, 0.1383056640625, 0.153076171875, 0.236328125, 0.028961181640625, 0.09814453125, 0.127685546875, 0.00079345703125, 0.02984619140625, 0.107666015625, 0.1796875, 0.07916259765625, 0.177001953125, 0.0867919921875, 0.0910644531...

embed

28011067_c1

28011067

haskell

1

,218 bytes per MUT second Productivity 13.4% of total user, 40.3% of total elapsed The GC time is 87% of the total run time! I am running this on a system with a massive amount of RAM, but when I set a high -H value the performance was worse. It seems that both -H and -A controls the size of gen 0 , but what I would re...

[ -0.00167083740234375, 0.0029449462890625, 0.00970458984375, -0.0014190673828125, 0.004119873046875, -0.0169677734375, -0.017578125, -0.0006256103515625, 0.01361083984375, -0.003936767578125, 0.004547119140625, -0.017333984375, 0.005462646484375, -0.005950927734375, 0, -0.00836181640625...

[ 304, 1819, 390, 1636, 117, 276, 17632, 17932, 73111, 54613, 5847, 11267, 111, 3622, 38937, 1112, 11587, 127966, 69657, 1733, 83, 382, 14427, 11675, 38, 51042, 903, 5426, 106750, 41170, 26959, 5423, 11192, 20, 841, 34292, 23718, 124632, 1650...

[ 0.0614013671875, 0.1591796875, 0.1334228515625, 0.047943115234375, 0.080078125, 0.041839599609375, 0.2359619140625, 0.1690673828125, 0.1390380859375, 0.107666015625, 0.0282135009765625, 0.09979248046875, 0.04290771484375, 0.06671142578125, 0.1708984375, 0.0234222412109375, 0.11975097...

embed

28706603_c0

28706603

haskell

0

Title: Haskell (Yesod) on Amazon Problem title: Haskell (Yesod) on Amazon Tags: yesod, amazon-s3, amazon-web-services, haskell, amazon-ec2 Problem: Haskell (Yesod) on Amazon I want to deploy a system made in Yesod using Amazon Web Service. But can't find a good tutorial or steps on how to do it. Looking for a web host ...

Haskell (Yesod) on Amazon Haskell (Yesod) on Amazon yesod amazon-s3 amazon-web-services haskell amazon-ec2 Haskell Yesod Amazon amazon-s3 amazon-ec2 Haskell (Yesod) on Amazon I want to deploy a system made in Yesod using Amazon Web Service. But can't find a good tutorial or steps on how to do it. Looking for a web host...

[ 0.0101318359375, 0.020751953125, 0.0030517578125, -0.0089111328125, -0.0038909912109375, 0.020751953125, -0.00970458984375, -0.007049560546875, -0.00616455078125, -0.0111083984375, 0.005035400390625, -0.03173828125, -0.0172119140625, 0.00421142578125, -0.00396728515625, -0.00927734375,...

[ 20625, 142508, 91480, 2199, 98, 15075, 2422, 23722, 2527, 5870, 7, 363, 14051, 22584, 1556, 3240, 304, 32635, 3444, 8, 13158, 53, 5426, 7228, 23, 17368, 4002, 12349, 4127, 57143, 98441, 3642, 54, 442, 1467, 27980, 831, 34831, 59947, 83, ...

[ 0.1783447265625, 0.28857421875, 0.1563720703125, 0.2420654296875, 0.1192626953125, 0.1934814453125, 0.116455078125, 0.1951904296875, 0.0506591796875, 0.09967041015625, 0.0828857421875, 0.1888427734375, 0.007537841796875, 0.1123046875, 0.1514892578125, 0.0806884765625, 0.157470703125,...

embed

43739760_c0

43739760

haskell

0

Title: What does pipe symbol mean? Problem title: What does pipe symbol mean? Tags: haskell Problem: What does pipe symbol mean? The following is the haskell comprehensions, what I don't understand is the pipe symbol. What does it mean and what is its role in the function? boomBangs xs = [ if x < 10 then "BOOM!" else "...

What does pipe symbol mean? What does pipe symbol mean? haskell What BOOM BANG What does pipe symbol mean? The following is the haskell comprehensions, what I don't understand is the pipe symbol. What does it mean and what is its role in the function?

[ 0.0027313232421875, -0.00086212158203125, -0.00921630859375, 0.01708984375, -0.005889892578125, 0.02880859375, -0.019287109375, 0.006378173828125, 0.00872802734375, 0.0223388671875, -0.004730224609375, -0.0020294189453125, 0.033447265625, -0.01019287109375, -0.0264892578125, 0.01458740...

[ 4865, 14602, 137158, 26582, 29459, 1556, 142508, 335, 158204, 86256, 25632, 46683, 3220, 2301, 18, 28219, 442, 31486, 32354 ]

[ 0.037994384765625, 0.023101806640625, 0.23583984375, 0.2423095703125, 0.11322021484375, 0.12432861328125, 0.2061767578125, 0.0650634765625, 0.148681640625, 0.204345703125, 0.0033893585205078125, 0.03924560546875, 0.0509033203125, 0.00023674964904785156, 0.01018524169921875, 0.087524414...

embed

47730695_c0

47730695

haskell

0

Title: What is strictness? Problem title: What is strictness? Tags: haskell, lazy-evaluation Problem: What is strictness? In Haskell, I try to understand the notion of strictness. I understand that const x y = x is strict on the first argument but not on the second. But is ifFun pred cons alt = if pred then cons else a...

What is strictness? What is strictness? haskell lazy-evaluation What What is strictness? In Haskell, I try to understand the notion of strictness. I understand that is strict on the first argument but not on the second. But is strict? It is strict on the first argument. I understand that the fact that cons and alt are ...

[ 0.0029754638671875, -0.00001895427703857422, 0.0322265625, 0.01080322265625, 0.0147705078125, 0.016357421875, 0.00128173828125, -0.00193023681640625, -0.00537109375, 0.00860595703125, -0.000942230224609375, -0.005096435546875, -0.005584716796875, 0.015625, -0.000579833984375, 0.0311279...

[ 4865, 83, 81113, 7432, 1556, 142508, 21, 3285, 159258, 360, 20625, 28219, 110, 1363, 98, 5117, 10750, 959, 17932, 1650, 158, 7, 136, 2641, 151575, 96819, 34292, 1653, 32354 ]

[ 0.057769775390625, 0.1121826171875, 0.32763671875, 0.236083984375, 0.0966796875, 0.251708984375, 0.055816650390625, 0.156494140625, 0.15625, 0.012481689453125, 0.131591796875, 0.06939697265625, 0.0806884765625, 0.0198211669921875, 0.09063720703125, 0.084228515625, 0.2049560546875, ...

embed

828191_c0

828191

haskell

0

Title: How do I install nano-hmac on Mac OS X? Problem title: How do I install nano-hmac on Mac OS X? Tags: cabal, c, haskell, macos, openssl Problem: How do I install nano-hmac on Mac OS X? "nano-hmac" is a Haskell package which can normally be installed using Cabal. However, Mac OS X has a different OpenSSL library t...

How do I install nano-hmac on Mac OS X? How do I install nano-hmac on Mac OS X? cabal c haskell macos openssl How Mac How do I install nano-hmac on Mac OS X? "nano-hmac" is a Haskell package which can normally be installed using Cabal. However, Mac OS X has a different OpenSSL library than the one it expects, so it fai...

[ 0.001922607421875, 0.0123291015625, 0.0068359375, 0.011962890625, 0.00982666015625, 0.01458740234375, 0.0120849609375, -0.000774383544921875, -0.0185546875, 0.033203125, -0.01312255859375, -0.0498046875, 0.0206298828125, -0.00653076171875, -0.0057373046875, -0.0233154296875, -0.00646...

[ 11249, 54, 87, 20600, 71819, 9, 127, 35572, 98, 4727, 11787, 1193, 109524, 501, 1556, 142508, 291, 7840, 9803, 7, 24861, 76, 157, 83, 20625, 98169, 831, 3638, 17368, 30438, 289, 12921, 13527, 294, 30508, 35773, 3501, 41206, 35782, 9969, ...

[ 0.0906982421875, 0.047149658203125, 0.06170654296875, 0.21044921875, 0.264892578125, 0.10546875, 0.1455078125, 0.252197265625, 0.12060546875, 0.1822509765625, 0.1700439453125, 0.16064453125, 0.203369140625, 0.05938720703125, 0.102783203125, 0.257568359375, 0.040008544921875, 0.1065...

embed

9720172_c0

9720172

haskell

0

Title: Remove LF from the last line in file Problem title: Remove LF from the last line in file Tags: awk, haskell, sed, vim, scala Problem: Remove LF from the last line in file The last line of my file should not have the LF as last character. In vim I can do :set noendofline binary :wq see http://vim.wikia.com/wiki/F...

Remove LF from the last line in file Remove LF from the last line in file awk haskell sed vim scala the Remove Remove LF from the last line in file The last line of my file should not have the LF as last character. In vim I can do see http://vim.wikia.com/wiki/File_format#Terminator_after_last_line How can I do that wi...

[ 0.00439453125, 0.0186767578125, -0.000728607177734375, 0.006011962890625, -0.0167236328125, -0.00970458984375, 0.0036163330078125, 0.0027008056640625, -0.018798828125, -0.005096435546875, -0.01104736328125, 0.0203857421875, 0.01483154296875, 0.020751953125, -0.01953125, -0.012145996093...

[ 181139, 58545, 1295, 4568, 13315, 23, 11435, 434, 92, 1556, 142508, 1736, 119916, 146232, 5608, 959, 765, 70, 237, 62816, 29671, 174350, 51727, 35484, 1249, 4597, 46327, 19777, 2256, 54, 1632, 79852, 46312, 51713, 137158, 55516, 31251, 9393, ...

[ 0.1888427734375, 0.281494140625, 0.0975341796875, 0.200927734375, 0.184326171875, 0.046173095703125, 0.1973876953125, 0.0877685546875, 0.0845947265625, 0.06195068359375, 0.1915283203125, 0.1351318359375, 0.1962890625, 0.1961669921875, 0.0260772705078125, 0.056060791015625, 0.00573730...

embed

5306717_c1

5306717

haskell

1

77028 0.00 0.00 23.50 31.95 0 0 (Gen: 0) 531936 10796 63686488 0.00 0.00 23.51 31.96 0 0 (Gen: 0) 423260 10047016 63680532 0.03 0.03 23.53 31.99 0 0 (Gen: 1) 531864 6996 63693396 0.00 0.00 23.55 32.01 0 0 (Gen: 0) 531852 9160 63703536 0.00 0.00 23.55 32.01 0 0 (Gen: 0) 531888 9572 63711876 0.00 0.00 23.55 32.01 0 0 (Ge...

[ -0.015869140625, -0.0012359619140625, -0.01556396484375, -0.01324462890625, 0.0029144287109375, 0.000865936279296875, -0.0040283203125, -0.0002765655517578125, 0.016845703125, 0.0262451171875, 0.0150146484375, 0.0302734375, -0.012939453125, -0.0322265625, 0.026611328125, 0.000743865966...

[ 6, 100595, 3882, 37509, 9559, 2525, 15554, 8821, 757, 15, 105376, 12, 16, 8934, 200136, 36225, 11648, 12069, 178475, 161414, 11703, 201, 3742, 97544, 805, 13330, 169887, 173300, 186035, 6460, 89678, 363, 14226, 5046, 4879, 1819, 13307, 305, ...

[ 0.064208984375, 0.290283203125, 0.3193359375, 0.27685546875, 0.216064453125, 0.22265625, 0.2413330078125, 0.2734375, 0.1912841796875, 0.05242919921875, 0.2265625, 0.0927734375, 0.051055908203125, 0.2496337890625, 0.302978515625, 0.23583984375, 0.263916015625, 0.21484375, 0.228027...

embed

27102858_c1

27102858

haskell

1

3.1.0 was selected instead base-4.7.0.0 was excluded because of the top level dependency base -any base-4.7.0.1 was excluded because base-4.3.1.0 was selected instead base-4.7.0.1 was excluded because of the top level dependency base -any Note: caball-install version 0.10.2 using version 1.10.2.0 of the Cabal library G...

[ -0.0184326171875, 0.00433349609375, 0.02001953125, 0.00762939453125, -0.007354736328125, -0.0283203125, -0.023681640625, 0.004058837890625, 0.0162353515625, 0.045654296875, 0.0022430419921875, -0.01275634765625, 0.005096435546875, 0.015625, -0.000659942626953125, -0.002471923828125, ...

[ 1031, 102107, 133291, 64457, 3647, 11565, 53489, 99929, 39041, 48141, 6637, 2663, 17366, 42548, 27771, 4848, 102014, 9, 158406, 5, 509, 70, 18622, 377, 12126, 80383, 11389, 107754, 133684, 10179, 73011, 30438, 289, 35773, 1294, 527, 73265, 28...

[ 0.1494140625, 0.227783203125, 0.179443359375, 0.071044921875, 0.251953125, 0.1600341796875, 0.1436767578125, 0.2078857421875, 0.1759033203125, 0.1080322265625, 0.011505126953125, 0.085205078125, 0.135009765625, 0.1710205078125, 0.01788330078125, 0.08148193359375, 0.228515625, 0.027...

embed

62854947_c0

62854947

haskell

0

Title: why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) Problem title: why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) Tags: haskell, types, infinite Problem: why it was infinite type ? (Occurs check: cannot construct the infinite type: ...

why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) why it was infinite type ? (Occurs check: cannot construct the infinite type: a ~ Tree a) haskell types infinite xs Occurs Tree Branch Leaf Show Integral _____error________ l:r:xs r:xs l:xs Relevant Stuff try.hs:69:16 try.hs:69:14...

[ 0.0032501220703125, -0.0037078857421875, -0.0031585693359375, 0.00189208984375, 0.01104736328125, -0.02783203125, -0.01324462890625, -0.01507568359375, 0.01275634765625, -0.0308837890625, -0.007049560546875, 0.003509521484375, 0.0174560546875, 0.00628662109375, 0.01220703125, 0.0109252...

[ 15400, 509, 54241, 13, 10644, 670, 238, 48650, 12765, 53418, 64549, 101344, 10, 1556, 142508, 52895, 1022, 180, 21110, 636, 2407, 17367, 204681, 188800, 42, 425, 133, 30624, 2907, 21493, 9790, 127, 14212, 22354, 22635, 442, 73, 48310, 67, ...

[ 0.10736083984375, 0.041961669921875, 0.1776123046875, 0.09869384765625, 0.20458984375, 0.008056640625, 0.03265380859375, 0.167236328125, 0.1278076171875, 0.10321044921875, 0.135498046875, 0.1536865234375, 0.07568359375, 0.0941162109375, 0.21875, 0.156005859375, 0.09722900390625, 0....

embed

36682882_c0

36682882

haskell

0

Title: Chaining two parentheses together using $ operator Problem title: Chaining two parentheses together using $ operator Tags: syntax, dollar-sign, haskell, function-composition Problem: Chaining two parentheses together using $ operator I have this function: min (max 10 20) (max 30 40) I can rewrite this as: min (m...

Chaining two parentheses together using $ operator Chaining two parentheses together using $ operator syntax dollar-sign haskell function-composition $ Chaining Chaining two parentheses together using $ operator I have this function: I can rewrite this as: But is there also a way to resolve these last parentheses? Not ...

[ 0.00170135498046875, 0.00958251953125, 0.0216064453125, 0.0274658203125, 0.01055908203125, 0.01953125, -0.0081787109375, 0.005889892578125, 0.016357421875, -0.046142578125, -0.00689697265625, 0.00897216796875, 0.00244140625, 0.00921630859375, -0.004547119140625, 0.0042724609375, 0.00...

[ 4841, 14653, 6626, 49129, 35412, 90, 25842, 17368, 3650, 39933, 6002, 86531, 15437, 31304, 1556, 142508, 32354, 277, 40322, 765, 903, 831, 456, 434, 18781, 237, 3917, 103608, 6097, 4568, 4127, 17569 ]

[ 0.15869140625, 0.0948486328125, 0.129638671875, 0.17041015625, 0.182861328125, 0.06475830078125, 0.1722412109375, 0.045867919921875, 0.1849365234375, 0.2198486328125, 0.038330078125, 0.064697265625, 0.1724853515625, 0.17724609375, 0.10626220703125, 0.192138671875, 0.1689453125, 0.0...

embed

24481113_c0

24481113

haskell

0

Title: What are some examples of type-level programming? Problem title: What are some examples of type-level programming? Tags: type-level-computation, functional-programming, scala, haskell Problem: What are some examples of type-level programming? I do not understand what "type-level programming" means, nor can I fin...

What are some examples of type-level programming? What are some examples of type-level programming? type-level-computation functional-programming scala haskell What What are some examples of type-level programming? I do not understand what "type-level programming" means, nor can I find a suitable explanation using Goog...

[ 0.006500244140625, -0.009765625, 0.007293701171875, -0.000682830810546875, 0.0087890625, -0.0003204345703125, -0.0189208984375, 0.01416015625, -0.0157470703125, -0.003173828125, -0.0140380859375, -0.018798828125, -0.00457763671875, 0.0213623046875, -0.0084228515625, 0.003387451171875, ...

[ 4865, 621, 3060, 27781, 7, 111, 10644, 9, 67919, 56037, 449, 7077, 123309, 28966, 146232, 1556, 142508, 28219, 2367, 50986, 26950, 187136, 1815, 106804, 5868, 80934, 214709, 80234 ]

[ 0.0263214111328125, 0.0142059326171875, 0.040802001953125, 0.20654296875, 0.0909423828125, 0.03668212890625, 0.2183837890625, 0.07159423828125, 0.259521484375, 0.1927490234375, 0.1300048828125, 0.05474853515625, 0.09375, 0.145751953125, 0.1458740234375, 0.07525634765625, 0.1877441406...

embed

28997603_c0

28997603

haskell

0

Title: Haskell counting number of function call Problem title: Haskell counting number of function call Tags: haskell Problem: Haskell counting number of function call Say I have a function concat :: String -> String -> String . So, var :: String var = concat (concat "a" "b") "c") -- "abc" Now, I have a function which ...

Haskell counting number of function call Haskell counting number of function call haskell Haskell Haskell counting number of function call Say I have a function concat :: String -> String -> String . So, Now, I have a function which I want to use to calculate how many times concat is called: So, func var should return ...

[ 0.017578125, -0.007598876953125, -0.00634765625, 0.01214599609375, 0.014892578125, 0.0224609375, -0.01025390625, -0.006805419921875, 0.0098876953125, -0.054443359375, -0.01361083984375, -0.040771484375, 0.01165771484375, 0.023681640625, 0.0164794921875, -0.017578125, -0.0062255859375...

[ 20625, 142508, 54529, 14012, 32354, 11782, 214, 111, 1556, 765, 158, 4460, 1984, 23351, 33079, 6, 3444, 4527, 74481, 67, 3642, 5941, 20028, 35839, 7477, 285, 5608, 30646, 787, 2046, 34292, 51339 ]

[ 0.1236572265625, 0.1807861328125, 0.13818359375, 0.1326904296875, 0.19970703125, 0.190185546875, 0.050689697265625, 0.06317138671875, 0.123779296875, 0.014495849609375, 0.1490478515625, 0.23779296875, 0.033935546875, 0.1025390625, 0.0330810546875, 0.000946044921875, 0.0272216796875, ...

embed

70766748_c0

70766748

haskell

0

Title: Is there a way to define multiple type synonyms in a single line? Problem title: Is there a way to define multiple type synonyms in a single line? Tags: haskell Problem: Is there a way to define multiple type synonyms in a single line? My code is currently like this: type Speed = Float type Height = Float type F...

Is there a way to define multiple type synonyms in a single line? Is there a way to define multiple type synonyms in a single line? haskell Speed Float Height FuelMass Gravity Is there a way to define multiple type synonyms in a single line? My code is currently like this: is there a way to not be wasting so much space...

[ -0.004730224609375, -0.0015716552734375, -0.0184326171875, 0.02001953125, -0.002532958984375, -0.0042724609375, -0.0026397705078125, -0.0230712890625, 0.00787353515625, 0.01470947265625, -0.011962890625, -0.0272216796875, 0.0113525390625, -0.005767822265625, -0.0291748046875, 0.0354003...

[ 3917, 61924, 48716, 10644, 164661, 7, 11001, 13315, 23, 1556, 142508, 63349, 38699, 1529, 22553, 7680, 53049, 178712, 2685, 18151, 82424, 32628, 21115, 21635 ]

[ 0.07232666015625, 0.181396484375, 0.1719970703125, 0.2105712890625, 0.23974609375, 0.0958251953125, 0.1007080078125, 0.14892578125, 0.013458251953125, 0.0753173828125, 0.2003173828125, 0.078125, 0.08868408203125, 0.043914794921875, 0.0193328857421875, 0.050506591796875, 0.04733276367...

embed

47777649_c0

47777649

haskell

0

Title: Can arrows be used as an alternative to monad transformers? Problem title: Can arrows be used as an alternative to monad transformers? Tags: arrow-abstraction, haskell Problem: Can arrows be used as an alternative to monad transformers? Somewhere I read that Arrows allow to avoid/simplify monads' transformations...

Can arrows be used as an alternative to monad transformers? Can arrows be used as an alternative to monad transformers? arrow-abstraction haskell Can Can arrows be used as an alternative to monad transformers? Somewhere I read that Arrows allow to avoid/simplify monads' transformations (as for me, monad transformers lo...

[ -0.013671875, -0.00653076171875, 0.0260009765625, 0.0087890625, 0.007720947265625, -0.0166015625, -0.0242919921875, 0.004852294921875, -0.006591796875, -0.0196533203125, 0.0228271484375, -0.00921630859375, -0.0034637451171875, 0.0022430419921875, 0.018310546875, -0.01806640625, -0.00...

[ 4171, 118201, 7, 11814, 237, 30700, 2667, 712, 27198, 1314, 47, 2055, 117474, 1556, 142508, 142, 1172, 15555, 63769, 71864, 116120, 40383, 167201, 6713, 2684, 1018, 71216, 13373, 306, 20625, 29568, 27781, 86869, 590, 2594, 116, 93425 ]

[ 0.056884765625, 0.259033203125, 0.162353515625, 0.1312255859375, 0.044036865234375, 0.15771484375, 0.102294921875, 0.1593017578125, 0.2109375, 0.08636474609375, 0.057464599609375, 0.060394287109375, 0.137451171875, 0.07415771484375, 0.216552734375, 0.0205078125, 0.104736328125, 0.2...

embed

78923836_c2

78923836

haskell

2

name, Error, Internal, gst_element_release_request_pad, GST_PAD_PARENT, Now, Returned, Unreffing, Deleting, LANGUAGE, OverloadedLabels, OverloadedStrings, Main, Hello, World, Original, gstreamer.freedesktop.org, helloworld.html, Written, Jaro, Reinders, All, GI.GLib, GLib, GI.Gst, Gst, setObjectPropertyInt32, Data.Text...

[ 0.0113525390625, 0.02001953125, 0.0035247802734375, 0.01708984375, 0.007171630859375, 0.0089111328125, -0.00701904296875, -0.0213623046875, 0.0023040771484375, 0.00506591796875, 0.005340576171875, -0.044677734375, -0.0037841796875, 0.0001354217529296875, -0.01513671875, 0.0011901855468...

[ 9351, 4, 212059, 106745, 141, 57348, 62766, 233707, 107, 75616, 4299, 159424, 116908, 60436, 20157, 14240, 173340, 297, 992, 4902, 214, 262, 133, 1916, 3358, 98064, 75930, 9578, 63033, 97381, 14794, 71713, 5180, 12321, 35378, 6661, 34525, 706...

[ 0.1556396484375, 0.00970458984375, 0.253173828125, 0.18212890625, 0.06536865234375, 0.2366943359375, 0.24951171875, 0.1807861328125, 0.05584716796875, 0.1639404296875, 0.204345703125, 0.287109375, 0.23486328125, 0.1278076171875, 0.1439208984375, 0.137451171875, 0.1441650390625, 0.0...

embed

31896816_c0

31896816

haskell

0

Title: Haskell STM extension Problem title: Haskell STM extension Tags: haskell Problem: Haskell STM extension I am looking for a Haskell STM extension that I read about in a paper some years ago. I still remember that on the one hand the authors claimed to have significantly improved Haskell STM, on the other hand the...

Haskell STM extension Haskell STM extension haskell Haskell STM Haskell STM extension I am looking for a Haskell STM extension that I read about in a paper some years ago. I still remember that on the one hand the authors claimed to have significantly improved Haskell STM, on the other hand they ran into inconsistencie...

[ -0.0020904541015625, 0.01416015625, 0.022705078125, 0.01336669921875, 0.0186767578125, -0.0128173828125, -0.01556396484375, -0.000009119510650634766, -0.00634765625, -0.0311279296875, 0.01397705078125, -0.003387451171875, -0.0167236328125, 0.0093994140625, 0.0174560546875, 0.0056762695...

[ 20625, 142508, 159, 10111, 111938, 1556, 16487, 100, 10, 12301, 1672, 23, 15122, 3060, 5369, 6650, 7464, 37629, 42179, 63043, 207583, 52295, 71, 13028, 3934, 25553, 6892, 72350, 5809, 959, 73342, 32233, 5299, 3714, 154559, 35672, 53418, 7413,...

[ 0.15966796875, 0.278076171875, 0.11669921875, 0.28076171875, 0.261962890625, 0.08160400390625, 0.10205078125, 0.07513427734375, 0.049835205078125, 0.124755859375, 0.038787841796875, 0.038116455078125, 0.150146484375, 0.01373291015625, 0.09332275390625, 0.0616455078125, 0.052673339843...

embed

60660099_c0

60660099

haskell

0

Title: Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Problem title: Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Tags: haskell Problem: Can someone please explain the following code? to retrieve the diagonal of a ...

Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? haskell haskell Can Can someone please explain the following code? to retrieve the diagonal of a matrix using haskell? Can...

[ 0.00185394287109375, 0.025146484375, 0.0174560546875, 0.00640869140625, -0.000843048095703125, -0.006500244140625, 0.002838134765625, 0.02587890625, -0.000579833984375, -0.03662109375, 0.00946044921875, -0.00921630859375, -0.017578125, -0.000835418701171875, 0.0006256103515625, 0.00643...

[ 4171, 22008, 22936, 73342, 25632, 18151, 47, 456, 3996, 3134, 70, 207997, 111, 50944, 425, 17368, 1556, 142508, 903, 68330, 194583, 1146, 3642, 30646, 7 ]

[ 0.05389404296875, 0.0213470458984375, 0.07049560546875, 0.1654052734375, 0.09503173828125, 0.1607666015625, 0.03778076171875, 0.0701904296875, 0.1229248046875, 0.09820556640625, 0.044830322265625, 0.268310546875, 0.047393798828125, 0.195556640625, 0.091552734375, 0.0772705078125, 0.1...

embed

25737117_c0

25737117

haskell

0

Title: Haskell this file's path Problem title: Haskell this file's path Tags: haskell Problem: Haskell this file's path Is there a way to get the path of the file where the function is defined? For example: rootappdir |- Foo.hs |- Bar.hs module Foo where getThisDir :: IO Filepath getThisDir = ... prelude> get...

Haskell this file's path Haskell this file's path haskell Haskell Foo.hs Bar.hs Foo Filepath Haskell this file's path Is there a way to get the path of the file where the function is defined? For example: If it is possible with an even simpler function :: Filepath, that's even better. Maybe we would need to u...

[ 0.03515625, 0.001007080078125, -0.022216796875, 0.0250244140625, -0.0078125, 0.020263671875, 0.0267333984375, 0.00823974609375, 0.0079345703125, -0.0556640625, -0.0029144287109375, -0.00433349609375, -0.023193359375, 0.0301513671875, -0.0025787353515625, 0.00927734375, -0.00381469726...

[ 20625, 142508, 903, 11435, 3768, 7, 60875, 1556, 9572, 31, 127, 3253, 5, 42724, 128405, 2071, 2685, 10, 3917, 47, 2046, 70, 111, 7440, 32354, 83, 61924, 71, 1326, 7722, 678, 8781, 1984, 11522, 83425, 4527, 479, 63923, 748 ]

[ 0.1446533203125, 0.247314453125, 0.119140625, 0.2154541015625, 0.0843505859375, 0.09844970703125, 0.26416015625, 0.1357421875, 0.14697265625, 0.0635986328125, 0.1197509765625, 0.1572265625, 0.005279541015625, 0.1483154296875, 0.228759765625, 0.004974365234375, 0.0220947265625, 0.03...

embed

40257417_c0

40257417

haskell

0

Title: How write the let program in where? Problem title: How write the let program in where? Tags: haskell Problem: How write the let program in where? This is a program in Haskell that with let: slope (x1,y1) (x2,y2) = let dy = y2-y1 dx = x2-x1 in dy/dx Now I try in where but it's not working properly actually I am u...

How write the let program in where? How write the let program in where? haskell How y2-y1 x2-x1 How write the let program in where? This is a program in Haskell that with let: Now I try in where but it's not working properly actually I am unable to build a allgo for where would you like to write it for me :

[ -0.001708984375, 0.01092529296875, -0.027587890625, -0.00811767578125, -0.004791259765625, 0.02001953125, 0.0111083984375, 0.02001953125, 0.002288818359375, 0.01251220703125, -0.0078125, -0.025146484375, 0.005279541015625, -0.00121307373046875, 0.0155029296875, 0.016357421875, 0.0052...

[ 11249, 33022, 70, 2633, 1528, 23, 7440, 1556, 142508, 113, 18504, 53, 418, 1022, 425, 20625, 678, 9790, 1284, 959, 20697, 155965, 20653, 51, 2886, 45367, 756, 519, 100, 1884, 442, 163 ]

[ 0.1058349609375, 0.1805419921875, 0.0753173828125, 0.253662109375, 0.2239990234375, 0.1226806640625, 0.2132568359375, 0.1104736328125, 0.2147216796875, 0.088623046875, 0.1478271484375, 0.048828125, 0.052520751953125, 0.047821044921875, 0.03857421875, 0.12109375, 0.03533935546875, 0...

embed

53238460_c0

53238460

haskell

0

Title: How does Haskell manage its memory? Problem title: How does Haskell manage its memory? Tags: haskell, ghc, functional-programming, memory-management Problem: How does Haskell manage its memory? So, we know that for most languages, throughout a program's execution: Global variables are stored in static memory. Lo...

How does Haskell manage its memory? How does Haskell manage its memory? haskell ghc functional-programming memory-management How Haskell How does Haskell manage its memory? So, we know that for most languages, throughout a program's execution: Global variables are stored in static memory. Local variables are stored in ...

[ -0.0028839111328125, 0.0107421875, 0.01171875, 0.019775390625, -0.0000362396240234375, 0.0308837890625, -0.015869140625, 0.02099609375, -0.0002593994140625, -0.021240234375, 0.0125732421875, -0.00811767578125, 0.026123046875, 0.0186767578125, 0.0123291015625, 0.0166015625, 0.00271606...

[ 11249, 14602, 20625, 142508, 111240, 6863, 98323, 1556, 31380, 238, 123309, 28966, 87140, 3714, 2684, 46876, 87420, 1528, 71924, 13453, 77336, 4343, 23, 201939, 24172, 177261, 242522, 90965, 764, 2631, 1672, 450, 442, 83, 21, 3285, 43701 ]

[ 0.1077880859375, 0.053985595703125, 0.1776123046875, 0.278564453125, 0.1904296875, 0.1116943359375, 0.254638671875, 0.1507568359375, 0.03533935546875, 0.0504150390625, 0.1046142578125, 0.04437255859375, 0.12890625, 0.0772705078125, 0.0751953125, 0.1436767578125, 0.088134765625, 0.0...

embed

70415447_c0

70415447

haskell

0

Title: How to write a case Maybe statement using where Problem title: How to write a case Maybe statement using where Tags: haskell Problem: How to write a case Maybe statement using where In Haskell, I am trying to write something like function x = do y <- get x put y let z = Map.lookup y case y of Nothing -> Nothing ...

How to write a case Maybe statement using where How to write a case Maybe statement using where haskell where How Maybe Map.lookup Nothing Just How to write a case Maybe statement using where In Haskell, I am trying to write something like I want to replace the "let..case of" block with something like a "where..case of...

[ -0.01373291015625, 0.0103759765625, -0.01202392578125, -0.0234375, 0.0081787109375, -0.0029449462890625, 0.01043701171875, -0.00836181640625, 0.014404296875, -0.006103515625, 0.003753662109375, 0.0106201171875, -0.003692626953125, -0.0191650390625, 0.0177001953125, 0.000452041625976562...

[ 11249, 33022, 7225, 83425, 63805, 17368, 7440, 1556, 142508, 42719, 64747, 2037, 182747, 20625, 31577, 3444, 91995, 1974, 58437, 111, 46389, 678, 136913, 7722 ]

[ 0.07244873046875, 0.1641845703125, 0.251708984375, 0.266845703125, 0.2259521484375, 0.09112548828125, 0.229248046875, 0.1282958984375, 0.2069091796875, 0.163330078125, 0.0760498046875, 0.10357666015625, 0.1201171875, 0.1142578125, 0.034393310546875, 0.0241546630859375, 0.139038085937...

embed

4267011_c0

4267011

haskell

0

Title: Using c2hs on Windows Problem title: Using c2hs on Windows Tags: ffi, c2hs, haskell Problem: Using c2hs on Windows I'm trying to use the libxml-enumerator package on Windows, which (ultimately) needs to use c2hs. When trying to build the relevant package, I get the seemingly infamous "does not exist" error from ...

Using c2hs on Windows Using c2hs on Windows ffi c2hs haskell Using c2hs Windows Using c2hs on Windows I'm trying to use the libxml-enumerator package on Windows, which (ultimately) needs to use c2hs. When trying to build the relevant package, I get the seemingly infamous "does not exist" error from c2hs. This seems to ...

[ 0.00311279296875, 0.021484375, -0.01141357421875, -0.007415771484375, 0.00823974609375, 0.0267333984375, -0.0245361328125, -0.0137939453125, -0.015380859375, -0.05615234375, 0.00057220458984375, -0.038330078125, 0.0225830078125, 0.0023956298828125, 0.01226806640625, -0.002716064453125,...

[ 345, 501, 304, 127, 7, 98, 3773, 24500, 1556, 142508, 31577, 4527, 25474, 131492, 33, 316, 56, 4597, 98169, 77968, 27117, 45367, 29191, 2046, 70, 48903, 51840, 246, 90, 959, 32316, 18499, 1295, 62548, 19441, 527, 13709, 20600, 5303, 11445...

[ 0.0927734375, 0.096435546875, 0.17626953125, 0.211669921875, 0.1650390625, 0.06072998046875, 0.1927490234375, 0.112548828125, 0.1279296875, 0.2340087890625, 0.07177734375, 0.1107177734375, 0.1114501953125, 0.214599609375, 0.02203369140625, 0.181640625, 0.0921630859375, 0.0970458984...

embed

30145271_c0

30145271

haskell

0

Title: What is meant by “replace equals by equals” Problem title: What is meant by “replace equals by equals” Tags: haskell Problem: What is meant by “replace equals by equals” I'm Haskell newbie and reading : http://www.seas.upenn.edu/~cis194/spring13/lectures/01-intro.html It states "In Haskell one can always “replac...

What is meant by “replace equals by equals” What is meant by “replace equals by equals” haskell What What is meant by “replace equals by equals” I'm Haskell newbie and reading : http://www.seas.upenn.edu/~cis194/spring13/lectures/01-intro.html It states "In Haskell one can always “replace equals by equals”, just like y...

[ 0.007598876953125, 0.017333984375, 0.0123291015625, 0.018310546875, -0.00860595703125, -0.006195068359375, -0.0020599365234375, 0.009033203125, 0.00347900390625, 0.003265380859375, 0.00250244140625, -0.0091552734375, 0.00616455078125, 0.0021820068359375, -0.0203857421875, -0.0004844665...

[ 4865, 131148, 107, 23935, 105950, 7, 390, 1556, 142508, 20625, 9014, 16454, 79832, 143669, 4153, 831, 11343, 1884, 97384, 429, 2844, 18507, 92940, 52080, 18614 ]

[ 0.042816162109375, 0.1656494140625, 0.1165771484375, 0.2015380859375, 0.2210693359375, 0.1148681640625, 0.157470703125, 0.1339111328125, 0.212646484375, 0.1162109375, 0.038543701171875, 0.038970947265625, 0.03594970703125, 0.04119873046875, 0.008636474609375, 0.06854248046875, 0.1027...

embed

55109509_c0

55109509

haskell

0

Title: define addition as an instance of Num in haskell Problem title: define addition as an instance of Num in haskell Tags: haskell Problem: define addition as an instance of Num in haskell I wish to define addition between two chars as concatination but im unsure of how to properly do so. my attempt: instance Num Ch...

define addition as an instance of Num in haskell define addition as an instance of Num in haskell haskell Num Char define addition as an instance of Num in haskell I wish to define addition between two chars as concatination but im unsure of how to properly do so. my attempt: but the error i get is that the return type...

[ -0.000728607177734375, -0.01373291015625, 0.027099609375, 0.028564453125, 0.01141357421875, 0.0294189453125, -0.005279541015625, -0.0115966796875, -0.000263214111328125, -0.001953125, -0.0091552734375, -0.052734375, 0.002227783203125, 0.00286865234375, -0.0224609375, -0.0167236328125, ...

[ 61924, 66044, 237, 142, 110527, 52782, 23, 1556, 142508, 111, 21656, 32599, 17721, 6626, 21441, 158, 4460, 73, 2320, 566, 51646, 155965, 81887, 18499, 30646, 10644, 83, 959, 84751, 1632, 140992, 5303, 100, 4806, 408, 5516 ]

[ 0.1702880859375, 0.263671875, 0.0867919921875, 0.05499267578125, 0.26123046875, 0.27294921875, 0.09515380859375, 0.14306640625, 0.240478515625, 0.026458740234375, 0.21484375, 0.040740966796875, 0.1395263671875, 0.1103515625, 0.1751708984375, 0.09613037109375, 0.142822265625, 0.1524...

embed

59219705_c0

59219705

haskell

0

Title: Create list of strings Problem title: Create list of strings Tags: haskell, list, string Problem: Create list of strings I have list of strings field :: [String] field = ["......", "......", "......", "......", "......", "......"] But it is static. I am trying to write function, that take two numbers (length of ...

Create list of strings Create list of strings haskell list string Create Create list of strings I have list of strings But it is static. I am trying to write function, that take two numbers (length of one string X and number of all strings Y). For example: createField 4, 5 It should return this Can you help me with thi...

[ 0.0142822265625, -0.00067901611328125, -0.0167236328125, 0.031982421875, 0.0014801025390625, 0.007720947265625, 0.0218505859375, 0.00119781494140625, 0.0242919921875, 0.0185546875, 0.0118408203125, -0.01495361328125, 0.017822265625, -0.0091552734375, -0.0166015625, -0.0103759765625, ...

[ 151313, 5303, 111, 79315, 1556, 142508, 7, 765, 4966, 83, 201939, 31577, 33022, 32354, 5646, 6626, 101935, 23986, 1632, 1193, 14012, 756, 990, 28282, 6159, 19388, 201, 190, 5608, 30646, 903, 4358 ]

[ 0.1815185546875, 0.2218017578125, 0.1275634765625, 0.250244140625, 0.124755859375, 0.1976318359375, 0.047088623046875, 0.064208984375, 0.01605224609375, 0.0141143798828125, 0.1815185546875, 0.0965576171875, 0.1170654296875, 0.1646728515625, 0.08807373046875, 0.11083984375, 0.14672851...

embed

14700773_c0

14700773

haskell

0

Title: understanding types Problem title: understanding types Tags: haskell Problem: understanding types I am learning Haskell and I want to understand types. Assume that I have an object of type Store : import Data.Map (Map) import qualified Data.Map as Map type Variable = String data Value = IntVal Int | BoolVal Bool...

understanding types understanding types haskell Data.Map qualified Store Map Variable Value IntVal BoolVal Bool understanding types I am learning Haskell and I want to understand types. Assume that I have an object of type Store : How can use this object, say s to get value of variable? And how to save value of a varia...

[ 0.006805419921875, -0.001678466796875, -0.006103515625, 0.0093994140625, 0.0037994384765625, -0.0031280517578125, -0.0208740234375, 0.003875732421875, -0.0020751953125, -0.00836181640625, 0.01544189453125, -0.00011968612670898438, 0.00347900390625, -0.018310546875, 0.018798828125, 0.00...

[ 100094, 52895, 1556, 142508, 11809, 166179, 217225, 14934, 42719, 84572, 2886, 190060, 42272, 929, 2460, 52080, 20625, 3444, 28219, 66596, 36746, 10644, 11249, 831, 4527, 91, 47, 2046, 34292, 111, 77336, 3642, 30098, 23 ]

[ 0.1728515625, 0.275146484375, 0.12200927734375, 0.212890625, 0.0609130859375, 0.135498046875, 0.1732177734375, 0.236328125, 0.1390380859375, 0.10858154296875, 0.0169219970703125, 0.130859375, 0.16357421875, 0.1185302734375, 0.021484375, 0.050933837890625, 0.10455322265625, 0.010528...

embed

23763199_c0

23763199

haskell

0

Title: How to derive scanr f a = map ( foldr f a ) . tails in Haskell? Problem title: How to derive scanr f a = map ( foldr f a ) . tails in Haskell? Tags: haskell Problem: How to derive scanr f a = map ( foldr f a ) . tails in Haskell? I'm taking a course on Haskell and this is one of my assignments. I'm completely cl...

How to derive scanr f a = map ( foldr f a ) . tails in Haskell? How to derive scanr f a = map ( foldr f a ) . tails in Haskell? haskell How Haskell How to derive scanr f a = map ( foldr f a ) . tails in Haskell? I'm taking a course on Haskell and this is one of my assignments. I'm completely clueless as to how to even ...

[ 0.007659912109375, 0.004486083984375, 0.0142822265625, 0.010986328125, -0.03515625, 0.01007080078125, -0.0130615234375, -0.0103759765625, -0.00128173828125, -0.0284423828125, 0.0106201171875, -0.0023345947265625, -0.0081787109375, 0.02392578125, 0.00555419921875, -0.01318359375, 0.00...

[ 11249, 122, 5844, 44954, 42, 1238, 10, 2203, 22288, 18344, 7569, 308, 7870, 23, 20625, 142508, 47, 1556, 5, 15411, 95486, 64557, 29786, 9393, 9842, 3115, 77947, 27958, 17368, 72607, 92009, 603 ]

[ 0.07708740234375, 0.1304931640625, 0.14111328125, 0.17333984375, 0.1910400390625, 0.1964111328125, 0.1810302734375, 0.0947265625, 0.1800537109375, 0.1162109375, 0.1495361328125, 0.1898193359375, 0.231689453125, 0.0771484375, 0.1334228515625, 0.2147216796875, 0.049835205078125, 0.08...

embed

25970139_c1

25970139

haskell

1

, cgi-3001.1.8.3, containers-0.5.0.0, data-default-0.5.1, deepseq-1.3.0.1, directory-1.2.0.1, dlist-0.5, extensible-exceptions-0.1.1.4, fgl-5.4.2.4, filepath-1.3.0.1, ghc-7.6.3, ghc-prim-0.3.0.0, hashable-1.2.1.0, haskell-src-1.0.1.5, haskell2010-1.1.1.0, haskell98-2.0.0.2, hoopl-3.9.0.0, hpc-0.6.0.0, html-1.0.1.2, int...

-1.0.1.5 haskell2010-1.1.1.0 haskell98-2.0.0.2 hoopl-3.9.0.0 hpc-0.6.0.0 html-1.0.1.2 integer-gmp-0.5.0.0 mtl-2.1.2 network-2.4.1.2 old-locale-1.0.0.5 old-time-1.1.0.1 parallel-3.2.0.3 parsec-3.1.3 pretty-1.1.1.0 primitive-0.5.0.1 process-1.1.0.2 random-1.0.1.1 regex-base-0.93.2 regex-compat-0.95.1 How to use Data.Defa...

[ 0.0019683837890625, -0.0125732421875, 0.0025787353515625, 0.0031890869140625, 0.004913330078125, 0.00012493133544921875, -0.0245361328125, 0.00189208984375, -0.0034027099609375, 0.00421142578125, -0.0213623046875, -0.0252685546875, -0.0015411376953125, -0.00872802734375, 0.00133514404296...

[ 102107, 42876, 1556, 142508, 11436, 92134, 16665, 73011, 5, 133684, 32558, 141, 156611, 99929, 118258, 238, 122887, 7693, 48400, 892, 1505, 2676, 93645, 33120, 116591, 10332, 98908, 6032, 102014, 95103, 107033, 170179, 39797, 81046, 28875, 128489...

[ 0.1611328125, 0.2066650390625, 0.141845703125, 0.204833984375, 0.16455078125, 0.1258544921875, 0.16357421875, 0.09039306640625, 0.020233154296875, 0.1263427734375, 0.08184814453125, 0.094970703125, 0.0980224609375, 0.0693359375, 0.0357666015625, 0.0927734375, 0.1009521484375, 0.177...

embed

78602107_c0

78602107

haskell

0

Title: Which is the cost of `div` in Haskell? Problem title: Which is the cost of `div` in Haskell? Tags: haskell, cost-management Problem: Which is the cost of `div` in Haskell? I'm trying to calculate the cost of a function izq where I use the function div inside: izq n | even (n - 1) = ((n - 1) `div` 2) | otherwise ...

Which is the cost of `div` in Haskell? Which is the cost of `div` in Haskell? haskell cost-management Which Haskell Which is the cost of `div` in Haskell? I'm trying to calculate the cost of a function izq where I use the function div inside: So work of izq is 1 + the cost of div applied to (n - 1). However, I'm unsure...

[ -0.0069580078125, 0.0181884765625, 0.0086669921875, -0.0069580078125, 0.0150146484375, -0.00457763671875, -0.0126953125, -0.0206298828125, 0.01385498046875, -0.043701171875, 0.0242919921875, -0.0115966796875, -0.005889892578125, 0.01531982421875, -0.00994873046875, 0.003387451171875, ...

[ 130078, 83, 70, 11034, 111, 30618, 23, 20625, 142508, 1556, 87140, 9473, 1135, 31577, 74481, 32354, 445, 864, 4527, 18221, 46132, 4488, 106, 997, 190659, 19, 20, 4879, 51646, 3714, 222201 ]

[ 0.08984375, 0.0911865234375, 0.093994140625, 0.2108154296875, 0.103759765625, 0.26025390625, 0.096923828125, 0.1395263671875, 0.2529296875, 0.1103515625, 0.08721923828125, 0.002105712890625, 0.0035400390625, 0.00830078125, 0.1016845703125, 0.142822265625, 0.13134765625, 0.166381835...

embed

9216944_c0

9216944

haskell

0

Title: Error in cabal-installing hspec Problem title: Error in cabal-installing hspec Tags: cabal-install, cabal, haskell Problem: Error in cabal-installing hspec I'm trying to install hspec, but I'm getting this: $ cabal install hspec Resolving dependencies... cabal: dependencies conflict: ghc-7.2.2 requires container...

Error in cabal-installing hspec Error in cabal-installing hspec cabal-install cabal haskell Error Resolving ghc-7.2.2 containers-0.4.2.0 Error in cabal-installing hspec I'm trying to install hspec, but I'm getting this: What does this even mean? Also, using ghc 7.2.2, cabal 10.2.

[ 0.0036468505859375, 0.00494384765625, -0.00408935546875, 0.0025787353515625, -0.01397705078125, -0.0166015625, -0.0191650390625, 0.00909423828125, 0.0025634765625, 0.02294921875, 0.001190185546875, -0.026611328125, -0.00201416015625, -0.00811767578125, 0.00604248046875, 0.0139770507812...

[ 212059, 23, 109524, 80383, 1096, 16711, 214, 1556, 142508, 132944, 31380, 238, 16709, 70147, 116419, 7, 121254, 73011, 31577, 20600, 4, 1284, 903, 4865, 14602, 29459, 17368, 2861, 4068, 5442 ]

[ 0.1502685546875, 0.054962158203125, 0.209228515625, 0.150390625, 0.155029296875, 0.263916015625, 0.0220489501953125, 0.10009765625, 0.1728515625, 0.1143798828125, 0.1116943359375, 0.101318359375, 0.02655029296875, 0.16357421875, 0.17431640625, 0.016998291015625, 0.1444091796875, 0....

embed

5745302_c1

5745302

haskell

1

-> TyRep -> TyRep -> Bool isNthArg n arg func = Just arg == lookup n (zip [1..] (typeRepArgs func)) nrArgs :: TyRep -> Int nrArgs = (\x -> x - 1) . length . typeRepArgs Is there anything that can implement the magicApplyFunction ? EDIT: I finally got back to playing with this. The magic apply function is: buildFunc ::...

[ -0.0194091796875, 0.00811767578125, 0.00087738037109375, -0.005767822265625, 0.00396728515625, 0.0135498046875, 0.0021209716796875, 0.007171630859375, 0.015380859375, -0.0169677734375, 0.0150146484375, -0.044189453125, -0.00860595703125, 0.0177001953125, 0.00384521484375, -0.0256347656...

[ 33079, 8064, 4332, 254, 2460, 929, 83, 927, 7614, 177, 653, 79459, 7477, 9563, 69112, 6713, 2037, 50836, 50986, 9405, 4115, 360, 18, 2203, 425, 1022, 4879, 140909, 10644, 2685, 23937, 831, 29479, 49846, 39179, 538, 97249, 10763, 77681, 44...

[ 0.02435302734375, 0.1636962890625, 0.18603515625, 0.1988525390625, 0.0557861328125, 0.202392578125, 0.0855712890625, 0.085693359375, 0.1351318359375, 0.1026611328125, 0.049041748046875, 0.1995849609375, 0.1383056640625, 0.1500244140625, 0.0227508544921875, 0.05828857421875, 0.0916748...

embed

12703151_c0

12703151

haskell

0

Title: Make GHC accept Main module with a main function that isn't IO () Problem title: Make GHC accept Main module with a main function that isn't IO () Tags: ghc, haskell Problem: Make GHC accept Main module with a main function that isn't IO () Is there some way (flag or hack) to make GHC accept a main mod...

Make GHC accept Main module with a main function that isn't IO () Make GHC accept Main module with a main function that isn't IO () ghc haskell Make GHC Main Fay Make GHC accept Main module with a main function that isn't IO () Is there some way (flag or hack) to make GHC accept a main module where the main f...

[ 0.0078125, 0.01953125, 0.01611328125, 0.016845703125, -0.011474609375, 0.00543212890625, 0.004241943359375, -0.003692626953125, -0.010009765625, -0.016845703125, -0.005401611328125, -0.041748046875, 0.01165771484375, -0.0038909912109375, 0.0107421875, -0.01513671875, 0.0140380859375,...

[ 26176, 527, 73265, 26946, 12321, 88996, 678, 5201, 32354, 450, 56112, 3768, 18, 6, 17780, 31380, 238, 1556, 142508, 114162, 3060, 3917, 190872, 707, 85526, 3249, 7440, 70, 138256, 1326, 765, 10644, 14602, 959, 903, 2174, 83, 9351, 25737, ...

[ 0.1395263671875, 0.14599609375, 0.288818359375, 0.2203369140625, 0.1900634765625, 0.236083984375, 0.093505859375, 0.1748046875, 0.2301025390625, 0.06597900390625, 0.146240234375, 0.0748291015625, 0.16064453125, 0.010223388671875, 0.2296142578125, 0.142822265625, 0.134521484375, 0.1...

embed

3533745_c1

3533745

haskell

1

s) = m st in (f a, s)) instance Applicative S where pure a = S (\st -> (a, st)) however nothing runs in GHC due to the fact that the lambda expression is hidden inside that type constructor. Now the only solution I see is to define a function: isntThisAnnoying s (S m) = m s in order to bind s to 'st' and actually retu...

[ -0.0113525390625, 0.0111083984375, 0.0037994384765625, -0.01104736328125, -0.01544189453125, 0.012939453125, 0.00051116943359375, -0.0106201171875, 0.0177001953125, -0.02001953125, 0.00469970703125, 0.01025390625, -0.0233154296875, 0.005523681640625, -0.01068115234375, 0.00059127807617...

[ 91, 16, 2203, 347, 6138, 23, 420, 10, 110527, 5659, 11048, 4935, 159, 34166, 41872, 271, 33079, 11, 33720, 127877, 527, 73265, 21, 6492, 85, 125195, 83, 204105, 46132, 10644, 64549, 748, 4734, 29806, 1957, 61924, 32354, 660, 73243, 7251, ...

[ 0.209228515625, 0.1199951171875, 0.148193359375, 0.13671875, 0.1676025390625, 0.1370849609375, 0.098388671875, 0.1231689453125, 0.2237548828125, 0.1458740234375, 0.1796875, 0.1558837890625, 0.1802978515625, 0.1494140625, 0.0235748291015625, 0.16064453125, 0.026824951171875, 0.07611...

embed

51392021_c0

51392021

haskell

0

Title: Why is colon right associative in this expression? Problem title: Why is colon right associative in this expression? Tags: brackets, haskell Problem: Why is colon right associative in this expression? Because function application is left associative in Haskell, I expect 'x':'y':"z" to be equivalent to ('x':'y'):...

Why is colon right associative in this expression? Why is colon right associative in this expression? brackets haskell Why Why is colon right associative in this expression? Because function application is left associative in Haskell, I expect to be equivalent to ('x':'y'):"z" . ('x':'y') is an error, because 'y' is no...

[ -0.00970458984375, -0.00970458984375, 0.004058837890625, 0.0196533203125, 0.0166015625, -0.002044677734375, 0.0115966796875, -0.004913330078125, 0.021484375, 0.022216796875, 0.0296630859375, -0.02880859375, 0.01708984375, 0.001739501953125, -0.0062255859375, -0.01373291015625, -0.019...

[ 44084, 46512, 7108, 166027, 272, 23, 903, 125195, 1620, 27853, 1556, 142508, 83, 32354, 38415, 25737, 20625, 41206, 183234, 425, 12, 53, 169, 18499, 5303, 5608, 151575, 50878, 1884, 165164, 73342 ]

[ 0.11376953125, 0.2286376953125, 0.2052001953125, 0.1756591796875, 0.10150146484375, 0.0269012451171875, 0.01947021484375, 0.190185546875, 0.132080078125, 0.1761474609375, 0.1119384765625, 0.231201171875, 0.0166473388671875, 0.138671875, 0.1748046875, 0.1435546875, 0.1201171875, 0.0...

embed

19497940_c0

19497940

haskell

0

Title: Haskell: Why does RealFrac not imply Fractional? Problem title: Haskell: Why does RealFrac not imply Fractional? Tags: types, haskell Problem: Haskell: Why does RealFrac not imply Fractional? Code signals: the, a, Haskell, Why, RealFrac, Fractional, S.index, S.sort, Floating, Ord, Random, S.Seq, StateT, Data.Fun...

Haskell: Why does RealFrac not imply Fractional? Haskell: Why does RealFrac not imply Fractional? types haskell the a Haskell Why RealFrac Fractional S.index S.sort Floating Ord Random S.Seq StateT Data.Functor.Identity.Identity S.fromList GA.hs:85:37 Possible Note Double Defined GHC.Float Float Integral GHC.Real.Ratio...

[ -0.0076904296875, 0.00506591796875, 0.0184326171875, -0.0002765655517578125, 0.01373291015625, 0.018310546875, -0.0191650390625, -0.019287109375, 0.007110595703125, 0.0213623046875, -0.005523681640625, -0.0184326171875, -0.01312255859375, -0.01025390625, -0.0031585693359375, 0.01867675...

[ 20625, 142508, 44084, 5120, 919, 20251, 959, 21980, 538, 7868, 10763, 289, 52895, 1556, 10, 159, 4711, 62351, 38699, 35379, 39643, 864, 22836, 11809, 97249, 37379, 161063, 154663, 23749, 12951, 30225, 115861, 107172, 5983, 73265, 365, 204681, ...

[ 0.1119384765625, 0.2333984375, 0.1142578125, 0.20703125, 0.09002685546875, 0.2252197265625, 0.0880126953125, 0.1312255859375, 0.065185546875, 0.2113037109375, 0.1436767578125, 0.114013671875, 0.187255859375, 0.1044921875, 0.08056640625, 0.0771484375, 0.1683349609375, 0.146606445312...

embed

4447130_c0

4447130

haskell

0

Title: make: Could not find module 'System' Problem title: make: Could not find module 'System' Tags: cabal, haskell Problem: make: Could not find module 'System' Yesterday I had a failing darcs install with cabal, today I get this when running ghc --make node.hs: node.hs:13:8: Could not find module...

make: Could not find module 'System' make: Could not find module 'System' cabal haskell Could System make: Could not find module 'System' Yesterday I had a failing darcs install with cabal, today I get this when running ghc --make node.hs: Somewhere along the lines cabal seem to have borked it's sys...

[ 0.00531005859375, 0.0128173828125, 0.002777099609375, 0.0086669921875, 0.01153564453125, 0.010986328125, -0.004150390625, 0.002593994140625, -0.0052490234375, -0.007568359375, -0.019287109375, -0.037841796875, 0.003173828125, -0.005706787109375, -0.005828857421875, -0.00848388671875, ...

[ 3249, 191147, 959, 7413, 88996, 3768, 84293, 109524, 1556, 142508, 12353, 35782, 214, 1011, 4439, 20600, 678, 903, 51042, 31380, 238, 55898, 110, 112, 127, 7, 136913, 124519, 48903, 765, 3017, 12225, 5426, 831, 121461, 4527, 11389, 2861, 10...

[ 0.1324462890625, 0.1044921875, 0.08203125, 0.1522216796875, 0.239501953125, 0.03070068359375, 0.2117919921875, 0.2374267578125, 0.131103515625, 0.233154296875, 0.1571044921875, 0.1026611328125, 0.024627685546875, 0.1240234375, 0.1165771484375, 0.096923828125, 0.00341796875, 0.02571...

embed

62819233_c0

62819233

haskell

0

Title: Best way to do convex optimization in Haskell? Problem title: Best way to do convex optimization in Haskell? Tags: convex-optimization, haskell, mathematical-optimization Problem: Best way to do convex optimization in Haskell? I'm looking to do some simple convex optimization in Haskell; nothing too fancy, just ...

Best way to do convex optimization in Haskell? Best way to do convex optimization in Haskell? convex-optimization haskell mathematical-optimization Best Haskell Best way to do convex optimization in Haskell? I'm looking to do some simple convex optimization in Haskell; nothing too fancy, just minimizing linear function...

[ 0.001861572265625, 0.0021820068359375, 0.0201416015625, 0.009521484375, -0.000640869140625, 0.00372314453125, -0.00543212890625, -0.01104736328125, 0.000667572021484375, -0.009765625, 0.0177001953125, -0.0274658203125, 0.031494140625, 0.002655029296875, -0.00848388671875, 0.00958251953...

[ 11345, 3917, 54, 158, 272, 425, 87235, 1363, 23, 20625, 142508, 47, 100433, 47691, 1556, 140363, 70760, 16487, 8781, 1207, 14786, 84382, 192617, 32354, 68587, 9523, 2816, 36880, 101422, 1542, 2965, 98169, 60042, 5570, 30700 ]

[ 0.1258544921875, 0.0885009765625, 0.052032470703125, 0.1329345703125, 0.224609375, 0.1395263671875, 0.2017822265625, 0.1004638671875, 0.08062744140625, 0.1649169921875, 0.256591796875, 0.0181121826171875, 0.1748046875, 0.0386962890625, 0.146240234375, 0.0253753662109375, 0.0122070312...

embed

14865362_c0

14865362

haskell

0

Title: Parse error in pattern Haskell Problem title: Parse error in pattern Haskell Tags: haskell, parse-error, pattern-matching, operator-precedence Problem: Parse error in pattern Haskell Why am I getting a parse error in this code? data One = H| I deriving (Read,Show,Eq) data E = A | B deriving (Read,Show,Eq) type L...

Parse error in pattern Haskell Parse error in pattern Haskell haskell parse-error pattern-matching operator-precedence Parse Haskell One Read Show fun1 fun2 x:xs Parse error in pattern Haskell Why am I getting a parse error in this code?

[ -0.0001583099365234375, 0.00628662109375, -0.0228271484375, 0.0184326171875, 0.005584716796875, 0.01123046875, -0.0211181640625, 0.0006256103515625, 0.02197265625, -0.0238037109375, 0.016357421875, -0.007354736328125, 0.03076171875, -0.01123046875, 0.015380859375, 0.00445556640625, -...

[ 2392, 184, 18499, 103510, 20625, 142508, 23, 1556, 366, 188800, 98753, 214, 39933, 4692, 37534, 6561, 4764, 17367, 7477, 418, 304, 1022, 12, 425, 903, 18151 ]

[ 0.12890625, 0.1514892578125, 0.19091796875, 0.2230224609375, 0.12188720703125, 0.201171875, 0.014892578125, 0.11627197265625, 0.132568359375, 0.1839599609375, 0.15185546875, 0.04193115234375, 0.173828125, 0.031890869140625, 0.09912109375, 0.1097412109375, 0.15576171875, 0.148193359...

embed

8350706_c0

8350706

haskell

0

Title: How do I find the alignment value when defining a storable instance Problem title: How do I find the alignment value when defining a storable instance Tags: alignment, ffi, haskell Problem: How do I find the alignment value when defining a storable instance If I have access to the C struct definition in the head...

How do I find the alignment value when defining a storable instance How do I find the alignment value when defining a storable instance alignment ffi haskell How How do I find the alignment value when defining a storable instance If I have access to the C struct definition in the header files but want to define my stor...

[ 0.01544189453125, 0.0213623046875, -0.00421142578125, -0.00138092041015625, 0.000591278076171875, 0.028076171875, -0.00191497802734375, 0.0279541015625, 0.00970458984375, -0.00185394287109375, 0.0091552734375, -0.01409912109375, -0.000469207763671875, -0.005279541015625, 0.0135498046875,...

[ 11249, 7413, 70, 143420, 674, 34292, 13204, 449, 3082, 2886, 110527, 87, 24500, 1556, 142508, 17203, 313, 36716, 80934, 10336, 56, 102158, 61924, 23009, 1096, 10382, 304, 127, 3642, 5809, 44691, 22304, 150631, 52490, 23718 ]

[ 0.04296875, 0.134033203125, 0.030914306640625, 0.283203125, 0.1649169921875, 0.20458984375, 0.1876220703125, 0.046051025390625, 0.207275390625, 0.1888427734375, 0.2091064453125, 0.0069580078125, 0.1143798828125, 0.112060546875, 0.1959228515625, 0.0238189697265625, 0.0616455078125, ...

embed

61666253_c1

61666253

haskell

1

stmt of a 'do' block: uri <- do scheme <- URI.mkScheme sc host <- URI.mkHost $ (hostName <> "." <> tld) return $ URI.URI (Just scheme) (Right (URI.Authority Nothing host Nothing)) Nothing [] Nothing From the error, I suspect that my intuition about unwrapping and wrapping the URI pieces is wrong. Where do I err? What ...

[ -0.01483154296875, 0.0159912109375, -0.00445556640625, 0.01422119140625, -0.007720947265625, -0.0029296875, 0.00439453125, -0.037353515625, 0.00848388671875, -0.01519775390625, -0.0137939453125, -0.00067138671875, -0.015869140625, -0.01458740234375, -0.01422119140625, 0.00726318359375,...

[ 6138, 39, 18, 111, 246, 46389, 39074, 54, 150370, 46492, 19201, 25452, 12549, 9023, 27980, 11193, 3650, 40294, 75137, 30646, 127794, 22553, 1003, 5922, 182747, 28090, 18499, 92610, 58868, 51, 5429, 11, 26783, 137565, 10366, 126371, 44691, 72,...

[ 0.127685546875, 0.05718994140625, 0.109375, 0.0245513916015625, 0.1766357421875, 0.2076416015625, 0.2083740234375, 0.1151123046875, 0.166015625, 0.222900390625, 0.061614990234375, 0.11865234375, 0.08062744140625, 0.048614501953125, 0.1697998046875, 0.1260986328125, 0.05706787109375, ...

embed

35250876_c0

35250876

haskell

0

Title: Getting Parsed and Type-annotated Haskell Code Problem title: Getting Parsed and Type-annotated Haskell Code Tags: ghc, haskell, parsing Problem: Getting Parsed and Type-annotated Haskell Code I am trying to parse Haskell source code and generate a decision tree to analyze different paths Haskell programs can ta...

Getting Parsed and Type-annotated Haskell Code Getting Parsed and Type-annotated Haskell Code ghc haskell parsing Getting Parsed Type-annotated Haskell Getting Parsed and Type-annotated Haskell Code I am trying to parse Haskell source code and generate a decision tree to analyze different paths Haskell programs can tak...

[ 0.0252685546875, 0.0201416015625, 0.006439208984375, 0.01287841796875, 0.018798828125, 0.01202392578125, -0.0223388671875, -0.01409912109375, -0.0145263671875, -0.04541015625, 0.007354736328125, -0.031494140625, -0.005584716796875, 0.0093994140625, -0.0002727508544921875, 0.0205078125,...

[ 210732, 2392, 5281, 136, 60457, 11071, 102, 20625, 142508, 28864, 31380, 238, 1556, 366, 6953, 31577, 184, 31344, 18151, 139392, 51957, 53201, 7968, 12921, 60875, 103391, 5646, 19437, 3355, 933, 76199, 169022, 18811, 959, 10644, 4677, 137272, ...

[ 0.11669921875, 0.171875, 0.093505859375, 0.0640869140625, 0.20654296875, 0.1148681640625, 0.057098388671875, 0.140869140625, 0.22705078125, 0.177734375, 0.1265869140625, 0.115234375, 0.1275634765625, 0.15234375, 0.021881103515625, 0.0144500732421875, 0.06256103515625, 0.10729980468...

embed

37123671_c0

37123671

haskell

0

Title: haskell, list of lists with a specific form (list comprehension) Problem title: haskell, list of lists with a specific form (list comprehension) Tags: set, haskell, list-comprehension, list Problem: haskell, list of lists with a specific form (list comprehension) i want to create a functions that takes a list an...

haskell, list of lists with a specific form (list comprehension) haskell, list of lists with a specific form (list comprehension) set haskell list-comprehension list Main haskell, list of lists with a specific form (list comprehension) i want to create a functions that takes a list and creates a list of list with list ...

[ 0.0098876953125, 0.0155029296875, 0.01141357421875, -0.0179443359375, 0.00897216796875, 0.0034637451171875, 0.0164794921875, 0.030517578125, -0.0155029296875, -0.007568359375, 0.01177978515625, -0.019775390625, 0.0244140625, 0.0203857421875, -0.0294189453125, -0.0027313232421875, 0.0...

[ 1556, 142508, 5303, 111, 7, 678, 29458, 3173, 6562, 46683, 3220, 6889, 4, 5423, 277, 4692, 12321, 17, 3444, 28282, 32354, 51776, 136, 13, 76172, 418, 90173, 304, 96386, 27781, 2646, 28864 ]

[ 0.1954345703125, 0.272216796875, 0.2303466796875, 0.07318115234375, 0.04803466796875, 0.1036376953125, 0.17626953125, 0.2034912109375, 0.1951904296875, 0.1700439453125, 0.1728515625, 0.05841064453125, 0.0149993896484375, 0.180419921875, 0.06982421875, 0.1466064453125, 0.10302734375, ...

embed

53023462_c0

53023462

haskell

0

Title: How do I create a UTCTime value using the time library in Haskell? Problem title: How do I create a UTCTime value using the time library in Haskell? Tags: haskell-time, haskell Problem: How do I create a UTCTime value using the time library in Haskell? I've got a year, month, day, hour and minute value (all of t...

How do I create a UTCTime value using the time library in Haskell? How do I create a UTCTime value using the time library in Haskell? haskell-time haskell the How UTCTime Haskell How do I create a UTCTime value using the time library in Haskell? I've got a year, month, day, hour and minute value (all of them are of typ...

[ -0.0081787109375, 0.006622314453125, 0.01214599609375, 0.000637054443359375, 0.0036773681640625, -0.03369140625, -0.01336669921875, -0.01251220703125, -0.0103759765625, -0.02392578125, -0.0025482177734375, -0.002166748046875, 0.0308837890625, 0.0166015625, 0.002685546875, -0.0148925781...

[ 11249, 28282, 10, 99577, 70059, 34292, 17368, 1733, 35773, 1294, 20625, 142508, 1556, 6032, 70, 54, 87, 23, 4163, 6602, 31150, 5155, 56816, 15393, 10644, 360, 18, 3642, 96760, 6097, 47, 142424, 96055, 282, 5 ]

[ 0.0791015625, 0.14208984375, 0.05010986328125, 0.210205078125, 0.262451171875, 0.173095703125, 0.0340576171875, 0.1492919921875, 0.1756591796875, 0.04315185546875, 0.123779296875, 0.2303466796875, 0.091064453125, 0.11865234375, 0.013275146484375, 0.01104736328125, 0.029754638671875, ...

embed

21485884_c0

21485884

haskell

0

Title: What does the Haskell function forall do and where is it defined? Problem title: What does the Haskell function forall do and where is it defined? Tags: haskell Problem: What does the Haskell function forall do and where is it defined? I'm reading A Little Lens Starter Tutorial and they use a seemingly magical f...

What does the Haskell function forall do and where is it defined? What does the Haskell function forall do and where is it defined? haskell What Haskell What does the Haskell function forall do and where is it defined? I'm reading A Little Lens Starter Tutorial and they use a seemingly magical function forall like this...

[ 0.0233154296875, 0.00653076171875, -0.0086669921875, -0.001129150390625, 0.01104736328125, 0.01397705078125, 0.01324462890625, -0.010986328125, 0.0086669921875, -0.026611328125, 0.016845703125, -0.00811767578125, 0.0057373046875, -0.004150390625, -0.019287109375, -0.000705718994140625,...

[ 4865, 70, 20625, 142508, 32354, 100, 5584, 54, 7440, 442, 61924, 71, 14602, 1556, 83, 16454, 59784, 18226, 13794, 56, 183447, 4527, 48903, 49846, 903, 66161, 98169, 1295, 7413, 152488, 133 ]

[ 0.08203125, 0.058441162109375, 0.1480712890625, 0.293212890625, 0.1962890625, 0.138671875, 0.25634765625, 0.1068115234375, 0.1044921875, 0.05279541015625, 0.134765625, 0.044830322265625, 0.06842041015625, 0.127685546875, 0.005035400390625, 0.001220703125, 0.07562255859375, 0.136230...

embed

43605754_c1

43605754

haskell

1

6dac65e3174dea79df54ce6d56f3e98bc060ecc (3647 commits) x86_64 hpack-0.14.0 The same after a stack upgrade to 1.4.0 . Passing the entire command as a string (another suggestion) results in a command with that name not being found >stack exec -- "iterate-strict-exe 25 +RTS -s" Executable named iterate-strict-exe 25 +RTS ...

[ 0.0040283203125, -0.01287841796875, -0.01068115234375, 0.033447265625, -0.0038604736328125, 0.026123046875, 0.0128173828125, -0.011474609375, 0.00408935546875, 0.0005950927734375, 0.00811767578125, -0.004669189453125, -0.0111083984375, 0.000659942626953125, -0.00799560546875, 0.0144042...

[ 305, 12424, 158696, 112, 22377, 16665, 130997, 10060, 195807, 375, 4007, 15276, 13307, 1096, 29102, 102014, 151152, 5701, 7103, 177261, 116086, 615, 28872, 64194, 75101, 237, 10, 79315, 199015, 50339, 9351, 959, 8035, 14037, 590, 2594, 1119, ...

[ 0.05438232421875, 0.0352783203125, 0.04791259765625, 0.0150299072265625, 0.027587890625, 0.009063720703125, 0.02880859375, 0.033294677734375, 0.0555419921875, 0.010986328125, 0.138916015625, 0.1715087890625, 0.15234375, 0.114501953125, 0.26953125, 0.0853271484375, 0.1904296875, 0.0...

embed

47577986_c2

47577986

haskell

2

, Lib.hs, LANGUAGE, OverloadedStrings, OPTIONS_GHC, Just, MonadHttp, One, POST, httpbin.org, URL, ReqBodyJson, Value, basement-0.0.4, zlib-0.6.1.2, aeson-1.1.2.0, network-2.6.3.2, th-lift-instances-0.1.11, Progress, While, stack7830, x86_64-linux-tinfo6-nopie, Cabal-1.24.2.0, x86_64-linux, ghc-tinfo6-nopie-8.0.2, lts-9...

[ -0.005615234375, 0.00921630859375, 0.0025482177734375, 0.01153564453125, -0.00848388671875, -0.00164794921875, -0.00726318359375, 0.00286865234375, 0.000659942626953125, 0.0159912109375, 0.004241943359375, 0.000919342041015625, -0.01544189453125, -0.00457763671875, -0.000972747802734375,...

[ 6, 4, 43278, 5, 127, 7, 3358, 98064, 75930, 9578, 63033, 297, 71713, 5180, 28023, 165117, 41877, 441, 9563, 60331, 71, 3062, 254, 6561, 81903, 1621, 7568, 1478, 31862, 853, 864, 12647, 1459, 1375, 1681, 190060, 3647, 674, 23320, 121254, ...

[ 0.05267333984375, 0.1002197265625, 0.1827392578125, 0.07293701171875, 0.1357421875, 0.07269287109375, 0.0738525390625, 0.153564453125, 0.1361083984375, 0.123779296875, 0.183349609375, 0.0501708984375, 0.137939453125, 0.107666015625, 0.2110595703125, 0.1414794921875, 0.1092529296875, ...

embed

68044738_c1

68044738

haskell

1

-> Map.Map Integer Integer factorization 1 = Map.fromList [] factorization x = Map.insertWith (+) factor 1 (factorization (x `div` factor)) where factor = head $ filter (\s -> (x `mod` s) == 0) ls ls = primes This program failed to solve in the time limit. So could anyone point me out where did I do wrong and how to f...

[ -0.0322265625, 0.0244140625, 0.0084228515625, -0.0072021484375, -0.00543212890625, -0.00152587890625, -0.0126953125, -0.00689697265625, 0.00830078125, -0.03662109375, 0.00640869140625, 0.00640869140625, 0.0262451171875, 0.0133056640625, -0.00518798828125, 0.00010442733764648438, -0.0...

[ 33079, 42719, 5, 166179, 44401, 31461, 47691, 106, 2203, 161063, 154663, 1022, 73, 33657, 194583, 22183, 144810, 425, 30618, 16, 10336, 3650, 46312, 41872, 7, 13415, 91, 69112, 757, 96, 20809, 3293, 1528, 165523, 86869, 23, 1733, 17475, 580...

[ 0.0665283203125, 0.25830078125, 0.0277099609375, 0.2369384765625, 0.2330322265625, 0.22119140625, 0.1500244140625, 0.1239013671875, 0.006561279296875, 0.1539306640625, 0.178955078125, 0.1148681640625, 0.07696533203125, 0.1512451171875, 0.1651611328125, 0.1480712890625, 0.231323242187...

embed

37374570_c0

37374570

haskell

0

Title: Haskell: fmap on nested functors Problem title: Haskell: fmap on nested functors Tags: applicative, functor, haskell Problem: Haskell: fmap on nested functors What is the way to abstract mapping a function over a list of functors? I understand the basic applicative λ: [(+2),(*2)] <*> [10,20] [12,22,20,40] but ho...

Haskell: fmap on nested functors Haskell: fmap on nested functors applicative functor haskell Haskell Just Haskell: fmap on nested functors What is the way to abstract mapping a function over a list of functors? I understand the basic applicative but how do I handle [(+2),(*2)] ???? [Just 10, Just 20] ? all the ways I ...

[ -0.002105712890625, 0.005859375, 0.0016937255859375, 0.0087890625, 0.007476806640625, 0.0341796875, -0.00201416015625, -0.005950927734375, 0.00439453125, -0.0267333984375, 0.01171875, -0.035888671875, -0.004791259765625, 0.038330078125, -0.003875732421875, -0.0137939453125, 0.0090332...

[ 20625, 142508, 1238, 62346, 98, 8512, 71, 7477, 18770, 41816, 4935, 1556, 9563, 70, 3917, 47, 164789, 291, 26783, 32354, 645, 10, 5303, 28219, 62822, 3642, 34831, 378, 132, 54651, 247, 88746, 10461, 35042, 127794, 209, 387, 756, 48322, 53...

[ 0.1531982421875, 0.2352294921875, 0.1104736328125, 0.2471923828125, 0.08203125, 0.2041015625, 0.0648193359375, 0.1602783203125, 0.161376953125, 0.1700439453125, 0.1387939453125, 0.1468505859375, 0.1483154296875, 0.01019287109375, 0.10546875, 0.0335693359375, 0.26513671875, 0.202880...

embed

39378493_c1

39378493

haskell

1

' block: f <- param ("f" :: L.Text) In the second argument of ‘($)’, namely ‘do { f <- param ("f" :: L.Text); file "create.html" }’ In a stmt of a 'do' block: post "/create" $ do { f <- param ("f" :: L.Text); file "create.html" } Code signals: a, being, Web.Scotty, Control.Applicative, Control.Monad.IO.Class, Database....

[ 0.033447265625, -0.0017852783203125, 0.0012969970703125, 0.00909423828125, -0.013916015625, 0.0020599365234375, 0.001068115234375, -0.004669189453125, -0.001983642578125, -0.0250244140625, 0.0238037109375, -0.0162353515625, -0.0218505859375, -0.0264892578125, 0.0036773681640625, 0.0090...

[ 242, 46389, 12, 1238, 4426, 9, 121, 39, 420, 1984, 339, 174379, 70, 17932, 10750, 4369, 16, 246, 11435, 7612, 2182, 7693, 360, 6138, 18, 1305, 3650, 54, 28864, 26073, 7, 10, 8035, 4002, 587, 15145, 27131, 11048, 4935, 46674, 712, 1778...

[ 0.11669921875, 0.241943359375, 0.006561279296875, 0.1798095703125, 0.1241455078125, 0.0986328125, 0.168212890625, 0.1356201171875, 0.152587890625, 0.058990478515625, 0.068359375, 0.1976318359375, 0.0162353515625, 0.131591796875, 0.25927734375, 0.2005615234375, 0.03216552734375, 0.1...

embed

40247339_c0

40247339

haskell

0

Title: Polymorphic recursion - syntax and uses? Problem title: Polymorphic recursion - syntax and uses? Tags: haskell, recursion Problem: Polymorphic recursion - syntax and uses? I've spent significant time looking over learnyouahaskell and I haven't found a good explanation of polymorphic recursion! I understand basic...

Polymorphic recursion - syntax and uses? Polymorphic recursion - syntax and uses? haskell recursion Polymorphic Polymorphic recursion - syntax and uses? I've spent significant time looking over learnyouahaskell and I haven't found a good explanation of polymorphic recursion! I understand basic recursive structures: Wha...

[ -0.0186767578125, 0.0089111328125, 0.005340576171875, -0.0026092529296875, 0.018310546875, 0.027587890625, 0.01202392578125, -0.0181884765625, 0.0250244140625, -0.0296630859375, 0.0218505859375, -0.041015625, -0.0021209716796875, 0.00897216796875, 0.01202392578125, -0.037353515625, -...

[ 63306, 178851, 1771, 195625, 1830, 20, 6002, 86531, 136, 4527, 7, 32, 1556, 142508, 88551, 30698, 53927, 7232, 38246, 4127, 187136, 111, 35874, 28219, 62822, 5844, 45646, 4865, 2806, 6713, 1884, 2367, 621, 6863, 72382, 64, 29001 ]

[ 0.2215576171875, 0.2291259765625, 0.10302734375, 0.22705078125, 0.132080078125, 0.02386474609375, 0.1357421875, 0.2142333984375, 0.09210205078125, 0.18505859375, 0.04998779296875, 0.0160064697265625, 0.115234375, 0.217529296875, 0.05010986328125, 0.047607421875, 0.049346923828125, ...

embed

26606037_c0

26606037

haskell

0

Title: Haskell substring testing Problem title: Haskell substring testing Tags: haskell Problem: Haskell substring testing When I use sub_string("abberr","habberyry") , it returns True, when obviously it should be False. The point of the function is to search for the first argument within the second one. Any ideas what...

Haskell substring testing Haskell substring testing haskell Haskell sub_string Bool a:x b:y Haskell substring testing When I use sub_string("abberr","habberyry") , it returns True, when obviously it should be False. The point of the function is to search for the first argument within the second one. Any ideas what's wr...

[ -0.01171875, 0.001678466796875, 0.0089111328125, 0.0166015625, -0.0240478515625, 0.0201416015625, 0.00848388671875, -0.00616455078125, 0.00118255615234375, 0.041748046875, 0.01324462890625, -0.015380859375, 0.0172119140625, 0.01611328125, -0.00201416015625, -0.01434326171875, 0.02099...

[ 20625, 142508, 1614, 91693, 134234, 1556, 2460, 929, 10, 12, 425, 876, 53, 4527, 454, 10545, 56, 42, 24360, 1297, 1294, 30646, 87599, 3229, 171259, 5608, 186, 22225, 184, 6275, 32354, 33938, 100, 5117, 10750, 28032, 17932, 25647, 44691 ]

[ 0.1158447265625, 0.215576171875, 0.2022705078125, 0.22607421875, 0.211669921875, 0.10736083984375, 0.093994140625, 0.1998291015625, 0.051361083984375, 0.011627197265625, 0.060302734375, 0.06396484375, 0.0755615234375, 0.06805419921875, 0.00286865234375, 0.0867919921875, 0.06640625, ...

embed

30905805_c0

30905805

haskell

0

Title: Understanding `seq` with Example Problem title: Understanding `seq` with Example Tags: haskell Problem: Understanding `seq` with Example I'm trying to understand seq with the following example: Prelude> let x = 100 + 2 sprint -ing the value of x shows _ since it has not been evaluated. Prelude> :sprint x x = _ L...

Understanding `seq` with Example Understanding `seq` with Example haskell Understanding Example Prelude Understanding `seq` with Example I'm trying to understand seq with the following example: sprint -ing the value of x shows _ since it has not been evaluated. Let's, as I understand seq , evaluate x . Now, let's check...

[ 0.0040283203125, 0.0250244140625, -0.0032501220703125, 0.041259765625, 0.020263671875, 0.01361083984375, 0.01080322265625, 0.00604248046875, -0.003082275390625, 0.0026702880859375, -0.01153564453125, 0.0015869140625, -0.00836181640625, 0.032958984375, 0.007110595703125, -0.004943847656...

[ 9626, 144057, 184, 864, 678, 89536, 8705, 1556, 142508, 1914, 822, 31577, 28219, 40, 27781, 145320, 20, 214, 34292, 1022, 45831, 16792, 959, 2809, 151575, 13, 12765, 44084, 19, 18, 297, 47, 30669, 7103, 159029 ]

[ 0.11376953125, 0.101806640625, 0.1689453125, 0.2626953125, 0.09619140625, 0.209716796875, 0.1151123046875, 0.111083984375, 0.2186279296875, 0.0208892822265625, 0.0679931640625, 0.0167083740234375, 0.1116943359375, 0.1405029296875, 0.16162109375, 0.2269287109375, 0.0614013671875, 0....

embed

36227959_c0

36227959

haskell

0

Title: Haskell: How to filter a list of list? Problem title: Haskell: How to filter a list of list? Tags: haskell Problem: Haskell: How to filter a list of list? Given a list of list: xss = [[1,2,3],[4,5,6],[7,8]] I want to filter it by list size then by remainder and then return a list of Int. Here are my two attempts...

Haskell: How to filter a list of list? Haskell: How to filter a list of list? haskell Haskell How Haskell: How to filter a list of list? Given a list of list: I want to filter it by list size then by remainder and then return a list of Int. Here are my two attempts: Is there more expressive way to do the same but with ...

[ -0.00909423828125, 0.02978515625, -0.0052490234375, -0.0146484375, -0.001617431640625, 0.00848388671875, 0.00133514404296875, 0.017333984375, 0.0079345703125, -0.0023040771484375, 0.0045166015625, -0.0283203125, 0.013671875, -0.00138092041015625, -0.032470703125, -0.000820159912109375,...

[ 20625, 142508, 11249, 47, 46312, 10, 5303, 111, 12, 1556, 77878, 3444, 442, 390, 13267, 47143, 820, 30646, 360, 18, 6626, 81887, 1286, 36510, 3917, 5701, 40715, 18151 ]

[ 0.142578125, 0.2227783203125, 0.088134765625, 0.05865478515625, 0.28125, 0.039520263671875, 0.21923828125, 0.1468505859375, 0.011627197265625, 0.12158203125, 0.040130615234375, 0.081298828125, 0.009613037109375, 0.04632568359375, 0.10693359375, 0.0897216796875, 0.080322265625, 0.14...

embed

16746372_c0

16746372

haskell

0

Title: how does xs in this function work? Problem title: how does xs in this function work? Tags: haskell Problem: how does xs in this function work? I am reading Hutton's book, Programming in Haskell. Here is a function: pairs :: [a] -> [(a,a)] pairs xs = zip xs (tail xs) e.g. >pairs [1,2,3,4] >[(1,2),(2,3),(3,4)] --r...

how does xs in this function work? how does xs in this function work? haskell how does xs in this function work? I am reading Hutton's book, Programming in Haskell. Here is a function: e.g. Problem is how to read this function ? from left to right? I am confused how "tail" leave 1 element and then combine it with next ...

[ 0.017333984375, 0.025390625, 0.00787353515625, 0.0024566650390625, -0.002532958984375, 0.0341796875, -0.006561279296875, -0.018798828125, 0.00909423828125, -0.01092529296875, 0.0279541015625, -0.00823974609375, 0.01153564453125, -0.012939453125, 0.003631591796875, 0.00823974609375, 0...

[ 3642, 14602, 1022, 7, 23, 903, 32354, 4488, 1556, 142508, 16454, 97595, 1507, 12877, 27958, 20625, 15649, 47, 12301, 1295, 25737, 7108, 55681, 5281, 46741, 31358, 106, 12830, 70163, 11737, 17368, 50836, 139124, 2046, 756, 47143, 80854, 5303 ]

[ 0.10443115234375, 0.09930419921875, 0.1800537109375, 0.1826171875, 0.13232421875, 0.1119384765625, 0.2001953125, 0.154052734375, 0.12939453125, 0.217529296875, 0.057891845703125, 0.03497314453125, 0.09661865234375, 0.047149658203125, 0.06689453125, 0.10577392578125, 0.07672119140625,...

embed

3876399_c0

3876399

haskell

0

Title: How can monads make my job easier? Show me some cool piece of code Problem title: How can monads make my job easier? Show me some cool piece of code Tags: haskell, monads Problem: How can monads make my job easier? Show me some cool piece of code I like reading snippets of code about concepts that I don't unders...

How can monads make my job easier? Show me some cool piece of code How can monads make my job easier? Show me some cool piece of code haskell monads How Show How can monads make my job easier? Show me some cool piece of code I like reading snippets of code about concepts that I don't understand. Are there any snippets ...

[ 0.006317138671875, 0.014892578125, -0.00016880035400390625, 0.0177001953125, -0.00135040283203125, 0.0093994140625, -0.005523681640625, -0.00439453125, 0.000644683837890625, -0.030029296875, -0.01446533203125, -0.022216796875, -0.009521484375, 0.024658203125, -0.0017547607421875, -0.00...

[ 11249, 831, 2667, 712, 7, 3249, 759, 12447, 99156, 17367, 163, 3060, 21185, 63847, 111, 18151, 1556, 142508, 1884, 16454, 93, 58134, 1672, 23755, 2301, 18, 28219, 2685, 2499, 7639, 5773, 23, 756, 2363, 16712, 1294, 5526, 3642, 59911, 47, ...

[ 0.1114501953125, 0.109375, 0.184326171875, 0.25830078125, 0.1602783203125, 0.126708984375, 0.0804443359375, 0.178955078125, 0.212646484375, 0.1820068359375, 0.069580078125, 0.0477294921875, 0.147705078125, 0.1087646484375, 0.03216552734375, 0.176025390625, 0.129150390625, 0.2281494...

embed

8148253_c0

8148253

haskell

0

Title: How are functions curried? Problem title: How are functions curried? Tags: functional-programming, currying, low-level, pointers, haskell Problem: How are functions curried? I understand what the concept of currying is, and know how to use it. These are not my questions, rather I am curious as to how this is act...

How are functions curried? How are functions curried? functional-programming currying low-level pointers haskell How How are functions curried? I understand what the concept of currying is, and know how to use it. These are not my questions, rather I am curious as to how this is actually implemented at some lower level...

[ 0.004608154296875, 0.0093994140625, 0.01043701171875, 0.00147247314453125, 0.006805419921875, 0.0218505859375, -0.0162353515625, -0.01251220703125, 0.003387451171875, 0.00469970703125, 0.0230712890625, -0.03173828125, -0.01239013671875, 0.0033111572265625, -0.01336669921875, -0.0046081...

[ 11249, 621, 32354, 7, 9709, 46572, 32, 123309, 28966, 198555, 214, 27226, 67919, 6275, 1314, 1556, 142508, 28219, 23755, 111, 83, 3714, 3642, 4527, 442, 193844, 903, 20653, 29479, 92319, 17366, 20625, 18151, 3229, 22183, 116, 201, 56, 47, ...

[ 0.146728515625, 0.1005859375, 0.2413330078125, 0.10205078125, 0.17822265625, 0.2469482421875, 0.0103759765625, 0.1649169921875, 0.1312255859375, 0.248046875, 0.1842041015625, 0.10186767578125, 0.121826171875, 0.179931640625, 0.0966796875, 0.120361328125, 0.2305908203125, 0.0703125,...

embed

31754011_c0

31754011

haskell

0

Title: How does enumFromTo work? Problem title: How does enumFromTo work? Tags: haskell, typeclass Problem: How does enumFromTo work? I cannot add a number to a Char ; the following will fail to compile 'a' + 1 . But yet, ['a'..'z'] successfully creates a string in which each of the character value is incremented. Is t...

How does enumFromTo work? How does enumFromTo work? haskell typeclass How Char How does enumFromTo work? I cannot add a number to a Char ; the following will fail to compile 'a' + 1 . But yet, ['a'..'z'] successfully creates a string in which each of the character value is incremented. Is there a special function that ...

[ 0.005584716796875, -0.00122833251953125, 0.00933837890625, 0.037841796875, 0.0103759765625, 0.0230712890625, 0.0093994140625, -0.004638671875, -0.01373291015625, 0.01220703125, 0.008056640625, -0.027587890625, -0.0034332275390625, 0.0272216796875, -0.01519775390625, -0.0167236328125, ...

[ 11249, 14602, 22, 316, 168407, 7763, 4488, 1556, 142508, 10644, 67413, 21656, 87, 53418, 15190, 14012, 47, 25632, 35782, 9969, 1340, 11, 997, 106, 4966, 14373, 5, 169, 65771, 28282, 79315, 12638, 62816, 34292, 158661, 5361, 32354, 831, 3714...

[ 0.1031494140625, 0.107666015625, 0.1600341796875, 0.243896484375, 0.29052734375, 0.26513671875, 0.1817626953125, 0.1500244140625, 0.2337646484375, 0.09857177734375, 0.136962890625, 0.198974609375, 0.0165557861328125, 0.123046875, 0.119384765625, 0.161376953125, 0.060638427734375, 0...

embed

58776762_c0

58776762

haskell

0

Title: In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 Problem title: In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 Tags: haskell Problem: In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 I'm learning haskell and I came across a weird behavior. I tried Prelude> min 8.0 8 8.0 and Prelude> max 8 8.0 8....

In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 haskell Prelude In haskell why is min 8.0 8 = 8.0 and max 8.0 8 = 8.0 I'm learning haskell and I came across a weird behavior. I tried and I switch the argument positions for both functions but I got the same res...

[ 0.025634765625, -0.002197265625, 0.037353515625, -0.0087890625, 0.00262451171875, 0.02783203125, -0.001495361328125, -0.01239013671875, -0.0015411376953125, 0.0206298828125, -0.000415802001953125, -0.022705078125, -0.006561279296875, -0.004486083984375, 0.01519775390625, -0.00958251953...

[ 1556, 142508, 15400, 83, 881, 3217, 2389, 382, 2203, 136, 18389, 360, 1914, 822, 112, 52080, 179459, 123166, 101089, 10750, 19069, 15044, 32354, 5701, 16750, 176377, 5608, 18, 186, 237, 22925, 105274, 31380, 318, 11389, 133684, 44084, 53383 ]

[ 0.1402587890625, 0.225830078125, 0.129638671875, 0.06524658203125, 0.2216796875, 0.1978759765625, 0.189208984375, 0.227783203125, 0.08636474609375, 0.1109619140625, 0.205322265625, 0.02471923828125, 0.059326171875, 0.1395263671875, 0.036865234375, 0.005828857421875, 0.099609375, 0....

embed

12901803_c0

12901803

haskell

0

Title: Retrieve the pixel values of an image with Haskell Problem title: Retrieve the pixel values of an image with Haskell Tags: libraries, image-recognition, image-processing, haskell Problem: Retrieve the pixel values of an image with Haskell Is there a way or a library available that can load an image (jpeg, png, e...

Retrieve the pixel values of an image with Haskell Retrieve the pixel values of an image with Haskell libraries image-recognition image-processing haskell Retrieve Haskell Retrieve the pixel values of an image with Haskell Is there a way or a library available that can load an image (jpeg, png, etc) and assign the pixe...

[ 0.005218505859375, -0.00579833984375, -0.006927490234375, 0.019287109375, 0.003814697265625, 0.03369140625, -0.0015716552734375, 0.00173187255859375, -0.0078125, -0.0181884765625, 0.00830078125, -0.01025390625, -0.006591796875, -0.00958251953125, -0.017578125, -0.0108642578125, 0.000...

[ 200451, 98009, 142424, 29569, 678, 20625, 142508, 70, 111, 35773, 107, 115558, 63923, 1556, 2685, 10, 3917, 19882, 450, 831, 72367, 215109, 128468, 136, 95486, 3934, 5303, 707, 50944, 1884, 54, 28007, 103510, 230466, 10176, 315, 61007, 7108, ...

[ 0.2325439453125, 0.25732421875, 0.2138671875, 0.197265625, 0.113525390625, 0.1533203125, 0.25, 0.000640869140625, 0.022918701171875, 0.1937255859375, 0.01220703125, 0.0946044921875, 0.046295166015625, 0.1319580078125, 0.031463623046875, 0.007720947265625, 0.088623046875, 0.08032226...

embed

21660714_c0

21660714

haskell

0

Title: Haskell - Function checks balancing within parenthesis Problem title: Haskell - Function checks balancing within parenthesis Tags: haskell Problem: Haskell - Function checks balancing within parenthesis I have to write a function in Haskell that checks whether a string containing open and closed parenthesis is b...

Haskell - Function checks balancing within parenthesis Haskell - Function checks balancing within parenthesis haskell Haskell Haskell - Function checks balancing within parenthesis I have to write a function in Haskell that checks whether a string containing open and closed parenthesis is balanced. For every opened par...

[ -0.006256103515625, 0.0125732421875, -0.01007080078125, 0.01092529296875, 0.01531982421875, 0.041259765625, 0.00634765625, -0.01446533203125, -0.0032806396484375, 0.006988525390625, 0.011962890625, -0.053955078125, 0.0147705078125, 0.000392913818359375, -0.00531005859375, 0.013671875, ...

[ 20625, 142508, 28670, 10763, 12765, 25168, 60636, 28032, 49129, 160291, 1556, 765, 33022, 32354, 36766, 79315, 70541, 9803, 136, 155738, 7, 83, 40197, 11907, 142096, 8110, 1632, 201505, 90698 ]

[ 0.144775390625, 0.2462158203125, 0.157470703125, 0.084228515625, 0.200439453125, 0.175048828125, 0.1502685546875, 0.15869140625, 0.1552734375, 0.19775390625, 0.13525390625, 0.00933837890625, 0.043426513671875, 0.1644287109375, 0.0115966796875, 0.1920166015625, 0.0687255859375, 0.16...

embed

73029761_c1

73029761

haskell

1

9.2 from ghcup ) does not depend on libtinfo . Under the circumstance that ~/.ghc/x86_64-linux-8.10.7/environments/default does not exist, the generated binary has no dependency to libtinfo . This file is generated when you initialize Cabal. After that, the compiled binary will depend on libtinfo.so. (**) Commands like...

[ 0.01177978515625, 0.01226806640625, 0.007080078125, 0.0228271484375, -0.00787353515625, 0.002685546875, -0.025390625, 0.01611328125, 0.006134033203125, 0.02294921875, -0.00640869140625, 0.001129150390625, -0.00537109375, 0.037841796875, 0.002532958984375, 0.004119873046875, 0.0212402...

[ 151309, 1295, 31380, 33874, 1388, 14602, 959, 56566, 98, 25474, 18, 7319, 75723, 9486, 238, 15276, 13307, 2397, 6077, 17376, 10179, 966, 153210, 214810, 32316, 139392, 71, 2394, 6635, 1556, 110, 42548, 27771, 11435, 3229, 61475, 20650, 30438,...

[ 0.313232421875, 0.03704833984375, 0.12841796875, 0.226806640625, 0.02215576171875, 0.0035400390625, 0.08026123046875, 0.1988525390625, 0.046234130859375, 0.17431640625, 0.1328125, 0.301513671875, 0.005035400390625, 0.1241455078125, 0.1064453125, 0.1815185546875, 0.1326904296875, 0....

embed