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
78455573_c0	78455573	haskell	0	Title: Haskell Caesar Cipher Problem title: Haskell Caesar Cipher Tags: haskell, encryption Problem: Haskell Caesar Cipher i'm having trouble with this. my decrypt is not working as intended. i've been trying this for a while and still don't understand why it's showing error. module CaesarCipher where shift :: Char -> ...	Haskell Caesar Cipher Haskell Caesar Cipher haskell encryption Haskell Caesar Cipher CaesarCipher Char Lambda Haskell Caesar Cipher i'm having trouble with this. my decrypt is not working as intended. i've been trying this for a while and still don't understand why it's showing error.	[ 0.003753662109375, -0.00006961822509765625, 0.010986328125, 0.01116943359375, 0.006866455078125, -0.0279541015625, 0.0174560546875, -0.01220703125, -0.0096435546875, 0.0257568359375, -0.00677490234375, -0.01116943359375, -0.003387451171875, 0.0361328125, 0.001220703125, -0.001152038574...	[ 20625, 142508, 64914, 2079, 94266, 1556, 22, 136791, 1830, 40658, 21656, 122930, 85, 17, 19441, 63134, 903, 759, 8, 83, 959, 20697, 237, 179140, 31577, 12960, 7464, 18, 28219, 15400, 141377, 18499 ]	[ 0.11907958984375, 0.2288818359375, 0.240966796875, 0.11859130859375, 0.212646484375, 0.12103271484375, 0.01983642578125, 0.271728515625, 0.0011463165283203125, 0.074462890625, 0.129638671875, 0.142578125, 0.09783935546875, 0.019256591796875, 0.053558349609375, 0.1138916015625, 0.0640...	embed
66180076_c0	66180076	haskell	0	Title: Fibonacci numbers without using zipWith Problem title: Fibonacci numbers without using zipWith Tags: haskell, fibonacci Problem: Fibonacci numbers without using zipWith I have been trying to implement a list of Fibonacci number sequence from 0 to n without using the lazy zipwith method. What I have so far is cod...	Fibonacci numbers without using zipWith Fibonacci numbers without using zipWith haskell fibonacci zipWith Fibonacci fib_seq n-1 Fibonacci numbers without using zipWith I have been trying to implement a list of Fibonacci number sequence from 0 to n without using the lazy zipwith method. What I have so far is code that r...	[ -0.00396728515625, 0.0224609375, -0.01446533203125, 0.0010223388671875, -0.01611328125, 0.0137939453125, -0.01397705078125, 0.007568359375, 0.00150299072265625, -0.0242919921875, -0.000021696090698242188, -0.0135498046875, -0.0057373046875, 0.039306640625, 0.00982666015625, 0.017578125...	[ 3698, 20990, 52544, 101935, 15490, 17368, 68330, 194583, 1556, 142508, 809, 275, 184, 864, 653, 5759, 31577, 29479, 5303, 14012, 40, 944, 3956, 1295, 757, 47, 21, 3285, 76228, 55300, 765, 2060, 18151, 30646, 615, 3917, 15549, 9, 756, 8953...	[ 0.166259765625, 0.1734619140625, 0.21142578125, 0.1796875, 0.1181640625, 0.0380859375, 0.2086181640625, 0.222412109375, 0.0767822265625, 0.19091796875, 0.142578125, 0.091064453125, 0.04827880859375, 0.149658203125, 0.0799560546875, 0.1761474609375, 0.06658935546875, 0.1109619140625...	embed
33470266_c0	33470266	haskell	0	Title: Language.Haskell.Exts.Syntax.Module to Template Haskell data structure Problem title: Language.Haskell.Exts.Syntax.Module to Template Haskell data structure Tags: haskell, template-haskell Problem: Language.Haskell.Exts.Syntax.Module to Template Haskell data structure I've got a Module ( Language.Haskell.Exts.Sy...	Language.Haskell.Exts.Syntax.Module to Template Haskell data structure Language.Haskell.Exts.Syntax.Module to Template Haskell data structure haskell template-haskell Language.Haskell.Exts.Syntax.Module Template Haskell Module Language.Haskell.TH.Syntax PkgName ModName Language.Haskell.Exts.Syntax.Module to Template Ha...	[ 0.0032501220703125, -0.000621795654296875, -0.00518798828125, 0.023193359375, -0.004669189453125, 0.0264892578125, 0.0113525390625, -0.016845703125, -0.005645751953125, -0.056396484375, 0.004974365234375, -0.023681640625, 0.01080322265625, -0.0185546875, -0.017578125, -0.00273132324218...	[ 83658, 6495, 7, 142508, 19279, 933, 3371, 86531, 91616, 8782, 47, 196631, 20625, 2053, 45646, 1556, 110934, 10557, 63014, 23415, 8517, 163612, 16269, 3444, 15504, 3934, 10, 169463, 13, 10644, 6713, 1884, 18811, 88996, 136, 183234, 3917, 96760...	[ 0.1297607421875, 0.073486328125, 0.0767822265625, 0.2088623046875, 0.1019287109375, 0.13720703125, 0.0821533203125, 0.1712646484375, 0.1429443359375, 0.1656494140625, 0.125, 0.252685546875, 0.1551513671875, 0.09619140625, 0.1849365234375, 0.1290283203125, 0.281494140625, 0.09851074...	embed
27409692_c0	27409692	haskell	0	Title: Finding the middle of a list - Haskell Problem title: Finding the middle of a list - Haskell Tags: list, haskell Problem: Finding the middle of a list - Haskell I'm new to haskell and I need some help. I wrote something very simple which calculates the sum of the squares of a list of numbers. sumOfSquares:: [Int...	Finding the middle of a list - Haskell Finding the middle of a list - Haskell list haskell Finding Haskell Integer x:xs Finding the middle of a list - Haskell I'm new to haskell and I need some help. I wrote something very simple which calculates the sum of the squares of a list of numbers. so sumOfSquares [1..10] woul...	[ -0.003448486328125, 0.011474609375, 0.017333984375, -0.021484375, -0.00506591796875, 0.0191650390625, -0.0037994384765625, 0.000476837158203125, 0.0224609375, -0.0224609375, 0.01434326171875, -0.01171875, 0.0264892578125, 0.00311279296875, 0.006988525390625, -0.01116943359375, 0.0011...	[ 26040, 214, 70, 86991, 111, 5303, 20625, 142508, 1556, 44401, 1022, 12, 425, 3525, 3871, 4358, 54397, 4552, 8781, 74481, 10554, 108047, 101935, 132887, 294, 94727, 68252, 5, 963, 2806, 186, 104342, 237875, 7413, 59911, 11832, 90, 4734, 1283...	[ 0.126953125, 0.0219573974609375, 0.0850830078125, 0.268310546875, 0.1474609375, 0.2154541015625, 0.1376953125, 0.21484375, 0.12060546875, 0.15380859375, 0.0694580078125, 0.0662841796875, 0.0904541015625, 0.068603515625, 0.0025634765625, 0.058563232421875, 0.044036865234375, 0.01762...	embed
29332229_c0	29332229	haskell	0	Title: Is there a function in Prelude to pair a value with that value applied to a function? Problem title: Is there a function in Prelude to pair a value with that value applied to a function? Tags: haskell-prelude, haskell Problem: Is there a function in Prelude to pair a value with that value applied to a function? ...	Is there a function in Prelude to pair a value with that value applied to a function? Is there a function in Prelude to pair a value with that value applied to a function? haskell-prelude haskell Prelude Data.Tuple Is there a function in Prelude to pair a value with that value applied to a function? I am searching for ...	[ 0.032958984375, -0.0011444091796875, 0.00152587890625, 0.004547119140625, -0.0228271484375, 0.0164794921875, -0.020751953125, -0.022216796875, 0.01287841796875, -0.034423828125, -0.0169677734375, 0.0030517578125, -0.03125, 0.0108642578125, 0.00311279296875, -0.00701904296875, 0.00212...	[ 2071, 2685, 10, 32354, 23, 1914, 822, 112, 47, 80836, 34292, 678, 450, 190659, 1556, 142508, 4692, 11809, 15665, 8705, 157318, 33342, 21373, 903, 104475, 420, 1984, 33079, 876, 1238, 1022, 2203, 425, 33938, 152488, 133, 6044, 52922, 4588, ...	[ 0.0289154052734375, 0.08795166015625, 0.0911865234375, 0.251708984375, 0.0880126953125, 0.158203125, 0.214111328125, 0.2020263671875, 0.0816650390625, 0.269775390625, 0.220703125, 0.1785888671875, 0.044219970703125, 0.170654296875, 0.10687255859375, 0.20849609375, 0.0970458984375, ...	embed
48349476_c0	48349476	haskell	0	Title: Serialize a program written in a free monad? Problem title: Serialize a program written in a free monad? Tags: haskell, monads, serialization Problem: Serialize a program written in a free monad? I would like to serialize small drawings in Rasterific to JSON. I want to serialize programs/drawing actions such as:...	Serialize a program written in a free monad? Serialize a program written in a free monad? haskell monads serialization Serialize JoinRound CapRound Serialize a program written in a free monad? I would like to serialize small drawings in Rasterific to JSON. I want to serialize programs/drawing actions such as: How can I...	[ -0.017333984375, 0.004974365234375, -0.02294921875, 0.007537841796875, -0.0233154296875, 0.0022125244140625, -0.007720947265625, 0.0196533203125, -0.0037689208984375, -0.0142822265625, -0.00274658203125, 0.01806640625, -0.001800537109375, 0.0047607421875, -0.011962890625, 0.01391601562...	[ 135188, 20650, 1528, 59121, 23, 4092, 2667, 712, 1556, 142508, 7, 35686, 47691, 113053, 12724, 7030, 14304, 2806, 1884, 19336, 188304, 2552, 1515, 14486, 47, 821, 58627, 3444, 103391, 64, 86905, 61972, 6044, 11249, 831, 54, 25647, 2060, 181...	[ 0.2264404296875, 0.1663818359375, 0.181884765625, 0.1114501953125, 0.05535888671875, 0.1416015625, 0.13427734375, 0.197265625, 0.1295166015625, 0.23974609375, 0.0211029052734375, 0.2083740234375, 0.1234130859375, 0.125732421875, 0.1197509765625, 0.109619140625, 0.0806884765625, 0.0...	embed
78732991_c1	78732991	haskell	1	I initially just placed the brackets because it is easier to read. But turns out my code only works when I remove the brackets. I tried working with it and realized this works too: t = satisfy isAlpha <<<= (\x -> satisfy isDigit <<<= \y -> char x) Question 1) But why? If it does (\x -> satisfy isDigit <<<= \y -> char ...	I initially just placed the brackets because it is easier to read. But turns out my code only works when I remove the brackets. I tried working with it and realized this works too: t = satisfy isAlpha <<<= (\x -> satisfy isDigit <<<= \y -> char x) Question 1) But why? If it does (\x -> satisfy isDigit <<<= \y -> char ...	[ -0.010498046875, 0.0238037109375, 0.00099945068359375, 0.01507568359375, 0.018310546875, -0.004974365234375, 0.004791259765625, 0.004241943359375, 0.0201416015625, -0.008544921875, -0.0079345703125, -0.0113525390625, 0.00946044921875, 0.001983642578125, 0.0020751953125, -0.010009765625...	[ 61475, 1660, 158012, 1620, 27853, 7, 99156, 12301, 4966, 18151, 4734, 43240, 3229, 87388, 20697, 808, 40407, 53, 83, 6210, 14612, 425, 14055, 15769, 21441, 1022, 15400, 234015, 5117, 18, 3714, 2367, 3642, 4488, 219836, 12989, 2301, 4527, 95...	[ 0.048370361328125, 0.01324462890625, 0.0965576171875, 0.2021484375, 0.2327880859375, 0.0546875, 0.097412109375, 0.0745849609375, 0.00201416015625, 0.1785888671875, 0.06195068359375, 0.136474609375, 0.040771484375, 0.1759033203125, 0.001190185546875, 0.1351318359375, 0.194580078125, ...	embed
8116262_c0	8116262	haskell	0	Title: How to get Haskell QuickCheck 2.4 to increase # tests? Problem title: How to get Haskell QuickCheck 2.4 to increase # tests? Tags: quickcheck, haskell Problem: How to get Haskell QuickCheck 2.4 to increase # tests? Okay, as I learned via my previous question , the RWH book is already out of date for QuickCheck. ...	How to get Haskell QuickCheck 2.4 to increase # tests? How to get Haskell QuickCheck 2.4 to increase # tests? quickcheck haskell How Haskell QuickCheck How to get Haskell QuickCheck 2.4 to increase # tests? Okay, as I learned via my previous question , the RWH book is already out of date for QuickCheck. And despite all...	[ -0.01336669921875, 0.0029754638671875, 0.002471923828125, 0.006500244140625, 0.0101318359375, 0.01202392578125, -0.019775390625, -0.0247802734375, 0.0208740234375, -0.0027008056640625, -0.003204345703125, -0.0162353515625, 0.00007390975952148438, -0.01025390625, 0.01373291015625, 0.001...	[ 11249, 2046, 20625, 142508, 89038, 202567, 66207, 51312, 468, 109921, 63773, 78292, 1556, 78691, 841, 12877, 5622, 219176, 8781, 4527, 53418, 3687, 15549, 14012, 11675, 100, 57266, 903, 14037, 35978, 26366, 61687, 209806 ]	[ 0.0386962890625, 0.048614501953125, 0.11962890625, 0.2022705078125, 0.16845703125, 0.2861328125, 0.2230224609375, 0.1778564453125, 0.11669921875, 0.253662109375, 0.113037109375, 0.2005615234375, 0.11376953125, 0.0748291015625, 0.08251953125, 0.0955810546875, 0.014190673828125, 0.02...	embed
33557692_c0	33557692	haskell	0	Title: List comprehension in haskell, String -> [String], empty characters not being removed Problem title: List comprehension in haskell, String -> [String], empty characters not being removed Tags: list-comprehension, list, haskell Problem: List comprehension in haskell, String -> [String], empty characters not...	List comprehension in haskell, String -> [String], empty characters not being removed List comprehension in haskell, String -> [String], empty characters not being removed list-comprehension list haskell List List comprehension in haskell, String -> [String], empty characters not being removed I am trying to spli...	[ -0.01434326171875, 0.005828857421875, -0.01080322265625, -0.006256103515625, 0.01318359375, 0.00958251953125, 0.0281982421875, 0.00604248046875, 0.0086669921875, 0.0196533203125, 0.00341796875, -0.0081787109375, -0.005401611328125, 0.0225830078125, -0.01708984375, 0.0206298828125, 0....	[ 32036, 46683, 3220, 6889, 1556, 142508, 23351, 214, 5386, 71713, 201505, 124850, 959, 8035, 184750, 5303, 4692, 31577, 65450, 79315, 23, 49146, 351, 63049, 9433, 18151, 2060, 140992, 53299, 27781, 73342, 15400, 903, 18, 48903, 19048, 87388 ]	[ 0.170166015625, 0.13037109375, 0.117431640625, 0.011444091796875, 0.1082763671875, 0.19189453125, 0.1158447265625, 0.09033203125, 0.09051513671875, 0.1470947265625, 0.2061767578125, 0.17724609375, 0.115478515625, 0.013092041015625, 0.1201171875, 0.1243896484375, 0.0914306640625, 0....	embed
14583197_c0	14583197	haskell	0	Title: haskell function signature Problem title: haskell function signature Tags: haskell, signature, type-variables Problem: haskell function signature I'm having a doubt about type signature in haskell. Reading about applicative functor, I have found: pure (+) <*> Just 3 which gives back Just (+3) which is of type Ma...	haskell function signature haskell function signature haskell signature type-variables Just Maybe Applicative haskell function signature I'm having a doubt about type signature in haskell. Reading about applicative functor, I have found: which gives back Just (+3) which is of type Maybe (a->a) . Now the signature of <*...	[ 0.0234375, 0.0034332275390625, 0.006866455078125, 0.0157470703125, -0.01324462890625, 0.01519775390625, -0.0135498046875, 0.004486083984375, 0.0103759765625, -0.0052490234375, 0.0091552734375, -0.03125, -0.0089111328125, 0.01031494140625, -0.00457763671875, -0.0179443359375, 0.008117...	[ 1556, 142508, 32354, 138256, 10644, 21690, 19736, 9563, 83425, 5659, 11048, 92814, 23, 41816, 4935, 7477, 18770, 14037, 76199, 4420, 22183, 21320, 11, 103607, 111, 4426, 1639, 2740, 26950, 2446, 1238, 876, 27781, 113054, 161740, 678, 10, 1442...	[ 0.1390380859375, 0.2213134765625, 0.1715087890625, 0.2626953125, 0.210205078125, 0.1478271484375, 0.0732421875, 0.149169921875, 0.253173828125, 0.077880859375, 0.123291015625, 0.09228515625, 0.00933837890625, 0.1591796875, 0.103271484375, 0.1131591796875, 0.1231689453125, 0.0064697...	embed
24536673_c0	24536673	haskell	0	Title: How are variable names chosen in type signatures inferred by GHC? Problem title: How are variable names chosen in type signatures inferred by GHC? Tags: ghc, haskell Problem: How are variable names chosen in type signatures inferred by GHC? When I play with checking types of functions in Haskell with :t , for ex...	How are variable names chosen in type signatures inferred by GHC? How are variable names chosen in type signatures inferred by GHC? ghc haskell How GHC Bool Ord Num Enum How are variable names chosen in type signatures inferred by GHC? When I play with checking types of functions in Haskell with :t , for example like t...	[ 0.021240234375, -0.0035400390625, 0.0054931640625, 0.02294921875, -0.0021514892578125, -0.00299072265625, -0.0181884765625, 0.006378173828125, -0.005889892578125, 0.034423828125, -0.0020904541015625, -0.031005859375, -0.000278472900390625, -0.004119873046875, -0.0024871826171875, 0.011...	[ 11249, 77336, 123055, 19667, 10644, 138256, 53498, 527, 73265, 2822, 31380, 238, 1556, 142508, 2460, 929, 35379, 52782, 357, 316, 23, 11301, 175199, 52895, 32354, 20625, 152, 18, 17660, 50339, 9655, 3642, 29481, 56, 39580, 15659, 16765, 12820...	[ 0.06842041015625, 0.266357421875, 0.1878662109375, 0.1270751953125, 0.22509765625, 0.201416015625, 0.164794921875, 0.09765625, 0.1910400390625, 0.014434814453125, 0.0889892578125, 0.073486328125, 0.110107421875, 0.2257080078125, 0.045989990234375, 0.1341552734375, 0.1485595703125, ...	embed
69709935_c0	69709935	haskell	0	Title: I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in funcp Problem title: I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in func...	I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in funcp I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in funcp haskell I am trying ...	[ -0.007171630859375, 0.00714111328125, 0.013427734375, -0.002105712890625, 0.00457763671875, 0.01446533203125, 0.023193359375, -0.034423828125, 0.01531982421875, 0.0048828125, -0.002349853515625, -0.013916015625, 0.0157470703125, -0.005767822265625, -0.00677490234375, 0.0172119140625, ...	[ 31577, 28412, 756, 17198, 3238, 519, 9893, 162738, 933, 570, 653, 19, 18499, 2500, 184, 7522, 172, 214552, 18597, 22062, 1239, 98753, 1620, 27853, 7477, 121422, 1556, 142508, 20949, 23, 27512, 6504, 5073, 62775, 26785, 366, 6953, 13315, 198...	[ 0.07952880859375, 0.140625, 0.0645751953125, 0.050689697265625, 0.1153564453125, 0.108154296875, 0.076416015625, 0.2032470703125, 0.087158203125, 0.1163330078125, 0.0248565673828125, 0.0850830078125, 0.191162109375, 0.155517578125, 0.1290283203125, 0.03564453125, 0.012725830078125, ...	embed
32808639_c0	32808639	haskell	0	Title: Process Haskell list from right to left keeping origin order Problem title: Process Haskell list from right to left keeping origin order Tags: iteration, haskell, reverse, list Problem: Process Haskell list from right to left keeping origin order Need increment every second item starting from the right in Haskel...	Process Haskell list from right to left keeping origin order Process Haskell list from right to left keeping origin order iteration haskell reverse list right Process Haskell x:xs x:y:tail Process Haskell list from right to left keeping origin order Need increment every second item starting from the right in Haskell li...	[ 0.0029144287109375, 0.0172119140625, -0.000518798828125, 0.004913330078125, 0.003997802734375, 0.019287109375, -0.0084228515625, -0.00074005126953125, 0.0115966796875, -0.0159912109375, 0.00836181640625, -0.015869140625, 0.0150146484375, 0.021240234375, 0.00160980224609375, 0.013000488...	[ 123996, 20625, 142508, 5303, 1295, 7108, 47, 25737, 120260, 59665, 12989, 17, 720, 1556, 39531, 184, 1022, 425, 53, 46741, 52889, 158661, 11907, 17932, 35735, 72134, 1284, 959, 7225, 37842, 1884, 25632, 5809, 12601, 28219, 7311, 66211, 186351...	[ 0.1781005859375, 0.1715087890625, 0.2371826171875, 0.2132568359375, 0.0672607421875, 0.1951904296875, 0.120849609375, 0.210693359375, 0.14892578125, 0.2083740234375, 0.20458984375, 0.000579833984375, 0.18603515625, 0.1654052734375, 0.189697265625, 0.1129150390625, 0.038116455078125, ...	embed
37573019_c0	37573019	haskell	0	Title: Compose function with two arguments Problem title: Compose function with two arguments Tags: function, function-composition, haskell, pointfree Problem: Compose function with two arguments I ran into something that threw me off today. I was trying to define a function equivalent to Data.Text.commonPrefixes that ...	Compose function with two arguments Compose function with two arguments function function-composition haskell pointfree Compose Data.Text.commonPrefixes Text Maybe Text.commonPrefixes Compose function with two arguments I ran into something that threw me off today. I was trying to define a function equivalent to Data.T...	[ 0.0062255859375, -0.0205078125, 0.010498046875, 0.0291748046875, -0.00714111328125, 0.018310546875, -0.000499725341796875, -0.006134033203125, -0.000415802001953125, -0.0272216796875, -0.003692626953125, 0.0311279296875, 0.0169677734375, 0.007293701171875, 0.0096435546875, 0.0112304687...	[ 15612, 8364, 32354, 678, 6626, 10750, 277, 40322, 1556, 142508, 6275, 32087, 11809, 174379, 3796, 19273, 55923, 90, 24129, 83425, 13028, 159399, 5773, 18925, 31577, 61924, 183234, 104250, 16065, 26818, 1284, 183114, 25632, 43240, 37842, 1884, 1...	[ 0.196044921875, 0.1688232421875, 0.1982421875, 0.08203125, 0.1759033203125, 0.2318115234375, 0.1427001953125, 0.1588134765625, 0.0966796875, 0.1878662109375, 0.0631103515625, 0.1531982421875, 0.088623046875, 0.1328125, 0.10491943359375, 0.046630859375, 0.147705078125, 0.0458984375,...	embed
28955122_c0	28955122	haskell	0	Title: Continuation Monad - Int and String Problem title: Continuation Monad - Int and String Tags: haskell Problem: Continuation Monad - Int and String The Mother of all Monads article presents this code: ex3 = do a <- return 1 b <- ContT (\fred -> "escape") return $ a+b Then I can execute it: ghci> runContT ex3 show ...	Continuation Monad - Int and String Continuation Monad - Int and String haskell Continuation Monad ex3 ContT Couldn Char Integer Expected Actual Continuation Monad - Int and String The Mother of all Monads article presents this code: Then I can execute it: But I can't run: How does return $ a+b type-check? What's going...	[ -0.00665283203125, -0.006683349609375, 0.000972747802734375, 0.015625, 0.000934600830078125, 0.0169677734375, 0.01287841796875, -0.0283203125, -0.0107421875, -0.00927734375, -0.0235595703125, -0.031005859375, 0.0026397705078125, 0.0201416015625, 0.004730224609375, -0.0196533203125, 0...	[ 50343, 1363, 60331, 71, 360, 18, 136, 23351, 214, 1556, 142508, 1119, 363, 1657, 618, 191147, 19, 21656, 44401, 60075, 13, 100582, 115217, 111, 756, 6468, 5582, 13379, 18151, 831, 71924, 442, 4966, 87, 11675, 11249, 30646, 3650, 10, 1328,...	[ 0.1463623046875, 0.0418701171875, 0.191162109375, 0.128662109375, 0.05712890625, 0.1810302734375, 0.07379150390625, 0.1572265625, 0.005889892578125, 0.0802001953125, 0.2049560546875, 0.09857177734375, 0.1636962890625, 0.077880859375, 0.03851318359375, 0.0841064453125, 0.0012512207031...	embed
21226186_c0	21226186	haskell	0	Title: Learn You a Haskell For Great Good "Syntax in Functions" Error Problem title: Learn You a Haskell For Great Good "Syntax in Functions" Error Tags: haskell Problem: Learn You a Haskell For Great Good "Syntax in Functions" Error I am new to Haskell, and am following the tutorial given in: http:...	Learn You a Haskell For Great Good "Syntax in Functions" Error Learn You a Haskell For Great Good "Syntax in Functions" Error haskell Learn You Haskell Great Good Syntax Functions Error Integral LUCKY NUMBER SEVEN Sorry Not Learn You a Haskell For Great Good "Syntax in Functions" Error I am new to H...	[ -0.0126953125, 0.01214599609375, -0.0032958984375, 0.00160980224609375, 0.00115966796875, 0.01513671875, -0.0159912109375, -0.0086669921875, 0.006988525390625, -0.007415771484375, -0.0027618408203125, -0.0194091796875, -0.017333984375, -0.006591796875, 0.032958984375, -0.00141906738281...	[ 134031, 2583, 10, 20625, 142508, 1326, 32774, 18621, 41502, 3371, 86531, 23, 28670, 10763, 212059, 1556, 19010, 204681, 30684, 441, 32272, 109020, 24480, 6755, 30223, 90502, 11205, 3525, 25632, 57143, 147, 796, 7232, 7, 12654, 73, 137175, 277...	[ 0.148193359375, 0.15380859375, 0.0902099609375, 0.1680908203125, 0.25244140625, 0.120849609375, 0.0782470703125, 0.143310546875, 0.016204833984375, 0.10638427734375, 0.2091064453125, 0.14599609375, 0.1434326171875, 0.124755859375, 0.218017578125, 0.13037109375, 0.11328125, 0.203857...	embed
7141287_c0	7141287	haskell	0	Title: Haskell cartesian product of infinite lists Problem title: Haskell cartesian product of infinite lists Tags: infinite, haskell, cartesian-product Problem: Haskell cartesian product of infinite lists I want to generate a vectorspace from a basis pair, which looks something like: genFromPair (e1, e2) = [xe1 + ye...	Haskell cartesian product of infinite lists Haskell cartesian product of infinite lists infinite haskell cartesian-product Haskell Haskell cartesian product of infinite lists I want to generate a vectorspace from a basis pair, which looks something like: When I examine the output though, it sems like I'm getting [0, e2...	[ 0.005767822265625, 0.01708984375, -0.0311279296875, 0.010986328125, -0.007354736328125, 0.00799560546875, -0.00421142578125, -0.0174560546875, 0.004302978515625, -0.03466796875, 0.0024871826171875, 0.00897216796875, 0.0029144287109375, -0.004669189453125, -0.038330078125, 0.01019287109...	[ 20625, 142508, 129912, 3378, 12996, 54241, 5303, 1556, 57877, 13, 3444, 139392, 173, 18770, 65421, 1295, 18231, 80836, 33342, 1884, 160477, 140992, 484, 20949, 2389, 28, 304, 116, 1639, 1022, 8306, 62163, 36917, 757, 10422, 33022, 18151, 4668...	[ 0.1302490234375, 0.215576171875, 0.1474609375, 0.10748291015625, 0.1881103515625, 0.136474609375, 0.2044677734375, 0.1357421875, 0.1976318359375, 0.034942626953125, 0.07928466796875, 0.1610107421875, 0.14794921875, 0.1568603515625, 0.2291259765625, 0.0592041015625, 0.2103271484375, ...	embed
7302378_c0	7302378	haskell	0	Title: Remove duplicates with a different equality test in Python Problem title: Remove duplicates with a different equality test in Python Tags: duplicates, haskell, python Problem: Remove duplicates with a different equality test in Python I'm looking for a Python function similar to nubBy in Haskell , which removes ...	Remove duplicates with a different equality test in Python Remove duplicates with a different equality test in Python duplicates haskell python Remove Python Out Remove duplicates with a different equality test in Python I'm looking for a Python function similar to nubBy in Haskell , which removes duplicate but with a ...	[ -0.007080078125, 0.0225830078125, 0.01361083984375, 0.00083160400390625, -0.00173187255859375, -0.0023345947265625, -0.0006561279296875, 0.00823974609375, -0.006011962890625, -0.01324462890625, -0.0303955078125, 0.0054931640625, 0.00811767578125, -0.003021240234375, -0.0238037109375, 0...	[ 181139, 171763, 1636, 678, 12921, 28, 161789, 3034, 145581, 23, 1556, 142508, 17198, 50828, 13538, 16487, 32354, 21373, 315, 275, 75358, 20625, 87388, 7, 67, 1284, 2806, 5646, 136, 5303, 171859, 30646, 80854, 110, 89536, 3688, 4700, 209, 23...	[ 0.1826171875, 0.2705078125, 0.1741943359375, 0.1190185546875, 0.229248046875, 0.08245849609375, 0.2081298828125, 0.2169189453125, 0.275390625, 0.04046630859375, 0.1104736328125, 0.1910400390625, 0.10003662109375, 0.034942626953125, 0.1676025390625, 0.033477783203125, 0.148193359375, ...	embed
69608195_c0	69608195	haskell	0	Title: Why is my ByteString in BigEndian Format on my x86_64 architecture? Problem title: Why is my ByteString in BigEndian Format on my x86_64 architecture? Tags: endianness, haskell, x86 Problem: Why is my ByteString in BigEndian Format on my x86_64 architecture? This code: import Data.Binary import qualified Data.By...	Why is my ByteString in BigEndian Format on my x86_64 architecture? Why is my ByteString in BigEndian Format on my x86_64 architecture? endianness haskell x86 Data.Binary qualified Data.Int Why ByteString BigEndian Format x86_64 Data.ByteString.Internal c2w w2c Data.ByteString.Lazy B.putStr Int32 x86 Why is my ByteStri...	[ 0.01611328125, 0.01434326171875, 0.000278472900390625, 0.00982666015625, -0.0205078125, 0.01361083984375, 0.00628662109375, -0.006439208984375, -0.0079345703125, 0.025390625, 0.0118408203125, -0.020751953125, -0.000850677490234375, 0.013916015625, -0.00457763671875, 0.01409912109375, ...	[ 44084, 83, 759, 3311, 67, 71713, 214, 23, 14195, 7768, 27201, 60972, 15276, 13307, 159958, 1022, 22, 7432, 1556, 142508, 11809, 73, 6635, 217225, 4153, 18, 75358, 5, 44851, 304, 434, 148, 2729, 3285, 335, 7077, 6460, 3293, 18151, 27489, ...	[ 0.14404296875, 0.05108642578125, 0.0361328125, 0.101806640625, 0.158203125, 0.2161865234375, 0.1265869140625, 0.071533203125, 0.102294921875, 0.13037109375, 0.19482421875, 0.2093505859375, 0.243896484375, 0.1939697265625, 0.119384765625, 0.010406494140625, 0.11962890625, 0.09594726...	embed
69988886_c0	69988886	haskell	0	Title: Converting string to list in newType Problem title: Converting string to list in newType Tags: haskell Problem: Converting string to list in newType I am trying to create a new data type called BigNumber which consists of a list of its digits. But when I try to create a function that receives a String and conver...	Converting string to list in newType Converting string to list in newType haskell Converting BigNumber Digits Char Couldn Expected Actual Wdeferred-type-errors Converting string to list in newType I am trying to create a new data type called BigNumber which consists of a list of its digits. But when I try to create a f...	[ -0.01611328125, -0.004058837890625, -0.003509521484375, 0.021240234375, -0.00799560546875, 0.029296875, -0.0128173828125, -0.01171875, 0.00104522705078125, 0.005584716796875, -0.001129150390625, -0.033203125, -0.0034942626953125, -0.005767822265625, -0.016845703125, -0.002655029296875,...	[ 1657, 814, 79315, 47, 5303, 3525, 196707, 23, 1556, 142508, 14195, 18444, 26278, 51174, 933, 21656, 191147, 60075, 13, 100582, 112, 2875, 2822, 50986, 188800, 31577, 28282, 2053, 10644, 58055, 6863, 153939, 9790, 32354, 53299, 23351, 214, 967...	[ 0.00250244140625, 0.10400390625, 0.209716796875, 0.051483154296875, 0.188232421875, 0.1334228515625, 0.286865234375, 0.024200439453125, 0.08331298828125, 0.1788330078125, 0.1458740234375, 0.16357421875, 0.183349609375, 0.078125, 0.0311431884765625, 0.1134033203125, 0.044769287109375,...	embed
11112287_c0	11112287	haskell	0	Title: Warning: newtype `CInt' is used in an FFI declaration, Problem title: Warning: newtype `CInt' is used in an FFI declaration, Tags: ffi, haskell Problem: Warning: newtype `CInt' is used in an FFI declaration, When building gtk2hs-buildtools with ghc 7.4.2, I get the following warning: c2hs/toplevel/C2HS...	Warning: newtype `CInt' is used in an FFI declaration, Warning: newtype `CInt' is used in an FFI declaration, ffi haskell ccall Foreign.C.Types Warning CInt FFI c2hs C2HSConfig.hs:110:1 GHC When bitfield_direction Warning: newtype `CInt' is used in an FFI declaration, When building gtk2hs-buildtools with ghc ...	[ 0.0048828125, 0.00439453125, 0.0198974609375, 0.002410888671875, -0.01422119140625, 0.0157470703125, -0.007232666015625, -0.01043701171875, -0.00830078125, -0.0296630859375, 0.005523681640625, -0.04052734375, -0.0115966796875, 0.006011962890625, -0.002716064453125, -0.0152587890625, ...	[ 5550, 592, 3525, 50986, 17304, 660, 3768, 11814, 563, 22724, 21635, 9473, 74, 1363, 24500, 1556, 142508, 501, 85763, 184293, 196707, 26550, 304, 127, 38131, 83671, 36053, 19721, 527, 73265, 4785, 28394, 936, 58994, 83, 33976, 706, 31472, 7,...	[ 0.15771484375, 0.09619140625, 0.1278076171875, 0.2822265625, 0.13232421875, 0.2021484375, 0.114013671875, 0.1558837890625, 0.1114501953125, 0.2247314453125, 0.18994140625, 0.0013427734375, 0.006256103515625, 0.023162841796875, 0.1900634765625, 0.10675048828125, 0.1976318359375, 0.0...	embed
13637286_c0	13637286	haskell	0	Title: Need help converting Maybe to Char Problem title: Need help converting Maybe to Char Tags: haskell Problem: Need help converting Maybe to Char I'm trying to convert a Maybe value to a Char. I get the following error and despite my best efforts I can't figure out how to correct this. convertmaybe.hs:18:22: No ins...	Need help converting Maybe to Char Need help converting Maybe to Char haskell a Need Maybe Char convertmaybe.hs:18:22 ToChar Just Failed Nothing Need help converting Maybe to Char I'm trying to convert a Maybe value to a Char. I get the following error and despite my best efforts I can't figure out how to correct this....	[ -0.00138092041015625, -0.0084228515625, 0.020263671875, 0.0012664794921875, 0.01312255859375, 0.02978515625, 0.0019989013671875, -0.01458740234375, 0.002105712890625, 0.01708984375, -0.01953125, -0.0230712890625, 0.0032806396484375, 0.026611328125, -0.018310546875, -0.029541015625, -...	[ 52889, 4358, 96760, 214, 83425, 47, 21656, 1556, 142508, 11354, 372, 127, 24033, 24070, 717, 84068, 9563, 190355, 297, 182747, 31577, 34292, 10, 25632, 18499, 2965, 79825, 26366, 26785, 3293, 18151, 4865, 444, 87, 20594, 44691, 3688 ]	[ 0.2078857421875, 0.15283203125, 0.1492919921875, 0.030181884765625, 0.31396484375, 0.1260986328125, 0.258056640625, 0.1170654296875, 0.1966552734375, 0.102294921875, 0.211669921875, 0.06768798828125, 0.075439453125, 0.0528564453125, 0.1444091796875, 0.2467041015625, 0.08544921875, ...	embed
3787960_c0	3787960	haskell	0	Title: What makes Haskell's type system more "powerful" than other languages' type systems? Problem title: What makes Haskell's type system more "powerful" than other languages' type systems? Tags: haskell, hindley-milner, type-inference, type-systems, types Problem: What makes H...	What makes Haskell's type system more "powerful" than other languages' type systems? What makes Haskell's type system more "powerful" than other languages' type systems? haskell hindley-milner type-inference type-systems types What Haskell What makes Haskell's type system more "p...	[ 0.0257568359375, 0.006683349609375, 0.01361083984375, 0.003936767578125, -0.00787353515625, -0.0030517578125, -0.01287841796875, 0.001373291015625, 0.0030059814453125, -0.0096435546875, 0.004547119140625, -0.0189208984375, -0.01507568359375, 0.0067138671875, -0.0201416015625, 0.0117797...	[ 4865, 30482, 20625, 142508, 3768, 10644, 5426, 1286, 62783, 7844, 3789, 46876, 76519, 1556, 34866, 4293, 12397, 1679, 73, 69988, 16751, 52895, 3501, 104951, 6206, 712, 2187, 152653, 11, 119475, 183037, 113138, 441, 37223, 41925, 3853, 831, 18...	[ 0.04559326171875, 0.05511474609375, 0.139404296875, 0.25830078125, 0.042999267578125, 0.2081298828125, 0.146240234375, 0.09527587890625, 0.1357421875, 0.1126708984375, 0.02716064453125, 0.137939453125, 0.141845703125, 0.09466552734375, 0.08062744140625, 0.14306640625, 0.0780029296875...	embed
49949580_c0	49949580	haskell	0	Title: How can I convert a Cons list to a Haskell list without (explicit) recursion? Problem title: How can I convert a Cons list to a Haskell list without (explicit) recursion? Tags: haskell Problem: How can I convert a Cons list to a Haskell list without (explicit) recursion? I have the following type: data ConsList ...	How can I convert a Cons list to a Haskell list without (explicit) recursion? How can I convert a Cons list to a Haskell list without (explicit) recursion? haskell How Cons Haskell ConsList Nil How can I convert a Cons list to a Haskell list without (explicit) recursion? I have the following type: data ConsList elem = ...	[ -0.0152587890625, 0.011962890625, -0.00179290771484375, -0.01513671875, 0.0130615234375, 0.0252685546875, -0.029052734375, -0.015625, 0.00133514404296875, -0.04931640625, -0.002197265625, -0.03662109375, 0.0162353515625, 0.0157470703125, 0.000904083251953125, -0.002838134765625, -0.0...	[ 11249, 831, 96760, 39215, 5303, 47, 10, 20625, 142508, 15490, 60923, 195625, 83613, 1830, 1556, 154663, 77175, 10644, 2053, 88, 195, 11935, 7, 903, 3173, 3934, 142477, 959, 8035, 5844, 3444, 138, 190, 361, 122101, 135461, 6896, 104116, 3259...	[ 0.0234527587890625, 0.041961669921875, 0.1650390625, 0.25732421875, 0.2171630859375, 0.0810546875, 0.066650390625, 0.1337890625, 0.2188720703125, 0.1143798828125, 0.1112060546875, 0.1600341796875, 0.01214599609375, 0.0570068359375, 0.09967041015625, 0.179931640625, 0.168701171875, ...	embed
53395955_c1	53395955	haskell	1	however, I don't like this pattern/style to handle exception, because in order to handle the exception from getEnv "HOST" , I have to put the handler outside of the entire readEnv , and parse the error message in order to distinguish if the error is MissingHost or MissingPort . If the error message doesn't contain "HO...	however, I don't like this pattern/style to handle exception, because in order to handle the exception from getEnv "HOST" , I have to put the handler outside of the entire readEnv , and parse the error message in order to distinguish if the error is MissingHost or MissingPort . If the error message doesn't contain "HO...	[ -0.0186767578125, 0.01055908203125, -0.0223388671875, 0.0008087158203125, 0.000827789306640625, -0.003997802734375, -0.000247955322265625, -0.03515625, -0.0037841796875, 0.00787353515625, 0.00616455078125, -0.0115966796875, 0.0185546875, -0.02783203125, 0.0137939453125, 0.0028533935546...	[ 49903, 87, 2301, 18, 1884, 903, 103510, 40946, 34831, 131527, 2046, 7768, 334, 841, 34274, 35863, 50782, 64194, 12301, 366, 184, 18499, 26008, 157167, 1495, 16771, 214, 11193, 271, 60006, 70541, 707, 91599, 132283, 11782, 41143, 99, 7440, 7...	[ 0.051788330078125, 0.000946044921875, 0.08624267578125, 0.10076904296875, 0.1331787109375, 0.041107177734375, 0.14404296875, 0.1114501953125, 0.146484375, 0.2406005859375, 0.1246337890625, 0.1351318359375, 0.1962890625, 0.1517333984375, 0.2093505859375, 0.2242431640625, 0.11169433593...	embed
19533599_c0	19533599	haskell	0	Title: How to map a function over the arguments of another function in Haskell? Problem title: How to map a function over the arguments of another function in Haskell? Tags: haskell Problem: How to map a function over the arguments of another function in Haskell? So initially I wrote: xs <- getAddrInfo (Just hints) (Ju...	How to map a function over the arguments of another function in Haskell? How to map a function over the arguments of another function in Haskell? haskell How Haskell Just map_arg How to map a function over the arguments of another function in Haskell? So initially I wrote: then it seemed to me that the function 'Just :...	[ -0.00023937225341796875, 0.00836181640625, -0.0038604736328125, 0.002166748046875, 0.0106201171875, 0.01513671875, 0.0027008056640625, 0.00665283203125, 0.031005859375, -0.037841796875, 0.0059814453125, -0.038818359375, 0.00433349609375, 0.0185546875, -0.00140380859375, -0.011535644531...	[ 11249, 47, 22288, 32354, 645, 10750, 7, 15700, 20625, 142508, 1556, 9563, 61477, 10, 23, 115058, 127794, 1984, 33079, 83425, 192, 48398, 4505, 933, 7569, 6982, 1257, 1884, 903, 527, 73265, 41206, 876, 501, 5701, 10644, 18, 12765, 3917, 11...	[ 0.07586669921875, 0.0278167724609375, 0.2208251953125, 0.216796875, 0.15966796875, 0.18994140625, 0.04180908203125, 0.06207275390625, 0.1290283203125, 0.2357177734375, 0.1031494140625, 0.112548828125, 0.159912109375, 0.1204833984375, 0.021453857421875, 0.0210723876953125, 0.157592773...	embed
49072552_c0	49072552	haskell	0	Title: Building a Docker container with stack and custom options Problem title: Building a Docker container with stack and custom options Tags: haskell, haskell-stack, docker Problem: Building a Docker container with stack and custom options There are instructions in the "Docker" section of the stack guide on how to bu...	Building a Docker container with stack and custom options Building a Docker container with stack and custom options haskell haskell-stack docker Building Docker RUN VOLUME WORKDIR USER Reset ENTRYPOINT CMD stack.yaml Building a Docker container with stack and custom options There are instructions in the "Docker" sectio...	[ 0.002044677734375, 0.00811767578125, 0.00012493133544921875, -0.011962890625, -0.0140380859375, 0.0032501220703125, -0.00433349609375, -0.006805419921875, 0.000823974609375, 0.0167236328125, 0.002166748046875, 0.00116729736328125, 0.01324462890625, 0.0167236328125, -0.01275634765625, 0...	[ 104919, 984, 11050, 116419, 678, 177261, 136, 114122, 50717, 1556, 142508, 590, 2594, 54, 130747, 90597, 231355, 123237, 345, 50184, 9624, 126, 193413, 9698, 59537, 44644, 14520, 141, 167934, 8331, 17997, 45367, 17368, 3871, 100677, 78301, 23, ...	[ 0.117919921875, 0.1492919921875, 0.25146484375, 0.2369384765625, 0.0673828125, 0.23291015625, 0.024200439453125, 0.182373046875, 0.2088623046875, 0.05474853515625, 0.1453857421875, 0.123046875, 0.04010009765625, 0.0848388671875, 0.074462890625, 0.074462890625, 0.046722412109375, 0....	embed
8762943_c0	8762943	haskell	0	Title: Which applicative functor is used for passing shared parameters? Problem title: Which applicative functor is used for passing shared parameters? Tags: haskell, applicative Problem: Which applicative functor is used for passing shared parameters? I think I kind of understand how applicative functors work in Haske...	Which applicative functor is used for passing shared parameters? Which applicative functor is used for passing shared parameters? haskell applicative Which Which applicative functor is used for passing shared parameters? I think I kind of understand how applicative functors work in Haskell and I'm using them for basic ...	[ 0.00193023681640625, 0.0002460479736328125, -0.01007080078125, 0.0004444122314453125, -0.00193023681640625, -0.00390625, -0.001068115234375, -0.0181884765625, 0.01025390625, -0.0242919921875, 0.01129150390625, -0.044677734375, -0.002044677734375, 0.0269775390625, -0.0078125, -0.0043945...	[ 130078, 41816, 4935, 7477, 18770, 83, 11814, 100, 452, 6953, 99764, 171859, 7, 1556, 142508, 28219, 4488, 23, 20625, 17368, 62822, 2053, 50986, 82419, 4565, 9319, 27781, 831, 456, 5429, 75639, 20623, 144285, 5974, 43240, 84751, 3129, 5659, ...	[ 0.1451416015625, 0.226318359375, 0.190185546875, 0.1768798828125, 0.2166748046875, 0.05548095703125, 0.182861328125, 0.104736328125, 0.0941162109375, 0.093017578125, 0.2403564453125, 0.2274169921875, 0.0718994140625, 0.1314697265625, 0.238525390625, 0.04412841796875, 0.097412109375, ...	embed
33304155_c0	33304155	haskell	0	Title: How to automatically build test modules with stack? Problem title: How to automatically build test modules with stack? Tags: testing, haskell, haskell-stack Problem: How to automatically build test modules with stack? I have this Spec.hs : import qualified OtherSpec main :: IO () main = do putStrLn "Test..." Oth...	How to automatically build test modules with stack? How to automatically build test modules with stack? testing haskell haskell-stack qualified How Spec.hs OtherSpec Test OtherSpec.main OtherSpec.hs How to automatically build test modules with stack? I have this Spec.hs : And I am planning to add more test suites from ...	[ -0.012939453125, 0.011962890625, -0.0162353515625, -0.003997802734375, 0.00347900390625, 0.00762939453125, 0.01165771484375, 0.00762939453125, 0.009033203125, -0.01263427734375, 0.004119873046875, -0.0036773681640625, 0.000926971435546875, 0.0291748046875, 0.00946044921875, 0.016479492...	[ 11249, 191082, 45367, 3034, 88996, 7, 678, 177261, 47, 134234, 1556, 142508, 590, 2594, 217225, 24990, 127, 64511, 47107, 8647, 24931, 58136, 15190, 1286, 14947, 3789, 5201, 11675, 109921, 237, 456, 16428, 98816, 71924, 2886, 978, 15549, 6557...	[ 0.050018310546875, 0.2327880859375, 0.191162109375, 0.2333984375, 0.2142333984375, 0.05859375, 0.1319580078125, 0.25390625, 0.007904052734375, 0.154541015625, 0.1131591796875, 0.171875, 0.124755859375, 0.1134033203125, 0.1375732421875, 0.15625, 0.08880615234375, 0.138671875, 0.15...	embed
33330919_c0	33330919	haskell	0	Title: Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? Problem title: Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? Tags: haskell, morte, dependent-type, functional-programming Problem: Is it possible to expr...	Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? haskell morte dependent-type functional-programming Tree Nat Type Leaf Is it possible to express the type of balan...	[ 0.0213623046875, 0.00060272216796875, -0.0091552734375, -0.00933837890625, 0.026123046875, -0.0028533935546875, 0.004150390625, -0.000244140625, 0.0025482177734375, -0.033935546875, -0.0213623046875, -0.0361328125, 0.00182342529296875, -0.0029144287109375, 0.0198974609375, 0.0090332031...	[ 7722, 36510, 10644, 40197, 51, 102, 134229, 2394, 1360, 44805, 223, 50961, 71, 6635, 90, 111, 1556, 142508, 20055, 108750, 50986, 123309, 28966, 101344, 68875, 60457, 2407, 13452, 5919, 67, 33636, 2053, 12342, 85, 163504, 65998, 181545 ]	[ 0.1092529296875, 0.1429443359375, 0.1363525390625, 0.2147216796875, 0.050018310546875, 0.130859375, 0.09222412109375, 0.1240234375, 0.1727294921875, 0.142822265625, 0.058074951171875, 0.138671875, 0.03497314453125, 0.0261077880859375, 0.0292510986328125, 0.0079345703125, 0.0334777832...	embed
22828137_c1	22828137	haskell	1	replicate k ['a'..'z'] \| k <- [1..]] >>= sequence Looks like what I want! Once I got the module to compile I checked the type of this function in the interpreter: > :t runSupplyVars runSupplyVars :: Supply [Char] a -> Identity (a, [[Char]]) I've tried passing lots (hours worth) of different things to this function, wit...	replicate k ['a'..'z'] \| k <- [1..]] >>= sequence Looks like what I want! Once I got the module to compile I checked the type of this function in the interpreter: > :t runSupplyVars runSupplyVars :: Supply [Char] a -> Identity (a, [[Char]]) I've tried passing lots (hours worth) of different things to this function, wit...	[ 0.0020751953125, -0.0002803802490234375, -0.0194091796875, 0.0252685546875, -0.01446533203125, 0.016357421875, 0.025390625, 0.004547119140625, -0.00080108642578125, 0.00124359130859375, 0.0208740234375, 0.01080322265625, 0.00274658203125, 0.0186767578125, -0.01251220703125, -0.01275634...	[ 143126, 67, 472, 11, 5, 169, 58745, 4426, 9, 68252, 6396, 1369, 40, 944, 3956, 60818, 1884, 2367, 87, 3444, 38, 88996, 9969, 1340, 12765, 70, 10644, 903, 32354, 29481, 56, 18, 11675, 294, 23157, 538, 81827, 7, 1984, 121691, 84068, 10,...	[ 0.284423828125, 0.1448974609375, 0.169921875, 0.1251220703125, 0.0322265625, 0.110107421875, 0.014373779296875, 0.057403564453125, 0.055145263671875, 0.0780029296875, 0.04327392578125, 0.03875732421875, 0.0673828125, 0.129638671875, 0.08673095703125, 0.07763671875, 0.06207275390625, ...	embed
28508522_c0	28508522	haskell	0	Title: Tracing a tree? Problem title: Tracing a tree? Tags: haskell Problem: Tracing a tree? I have a type for a tree like so: data Tree a = EmptyTree \| Tree a [Tree a] deriving (Show, Ord, Eq) freeTree :: Tree Integer freeTree = Tree 2 [Tree 5 [], Tree 6 [Tree 8 [], Tree 9 []], Tree 7 []] main = print freeTree What I ...	Tracing a tree? Tracing a tree? haskell Tracing Tree EmptyTree Show Ord Integer Tracing a tree? I have a type for a tree like so: What I am trying to do is to write a function that could be used say like so: And what a trace on this tree would return is: [2],[2,5],[2,6],[2,7],[2,6,8],[2,6,9] Basically what it does is: ...	[ 0.010986328125, 0.01531982421875, -0.0027618408203125, 0.00811767578125, 0.00081634521484375, 0.007598876953125, -0.030517578125, -0.010986328125, -0.009521484375, -0.056884765625, 0.0034027099609375, -0.01177978515625, 0.00250244140625, 0.005767822265625, -0.002227783203125, 0.0152587...	[ 4937, 21896, 10, 53201, 32, 1556, 142508, 101344, 31678, 939, 62731, 17367, 35379, 44401, 10644, 100, 1884, 221, 31577, 33022, 32354, 5809, 11814, 2367, 144851, 98, 903, 2806, 30646, 83, 33579, 71928, 189126, 304, 966, 151664, 171379, 14602, ...	[ 0.2548828125, 0.19482421875, 0.06640625, 0.281494140625, 0.043487548828125, 0.140380859375, 0.2230224609375, 0.2342529296875, 0.1826171875, 0.092529296875, 0.236083984375, 0.134765625, 0.1842041015625, 0.1927490234375, 0.1859130859375, 0.004180908203125, 0.07855224609375, 0.0646362...	embed
29576695_c0	29576695	haskell	0	Title: Why `where` produces a parse error inside list comprehension, but `let` doesn't? Problem title: Why `where` produces a parse error inside list comprehension, but `let` doesn't? Tags: where-clause, list-comprehension, haskell Problem: Why `where` produces a parse error inside list comprehension, but `le...	Why `where` produces a parse error inside list comprehension, but `let` doesn't? Why `where` produces a parse error inside list comprehension, but `let` doesn't? where-clause list-comprehension haskell Why Why `where` produces a parse error inside list comprehension, but `let` doesn't? Let's define a simple f...	[ 0.0032806396484375, 0.0086669921875, -0.0113525390625, -0.025146484375, -0.0030517578125, 0.0189208984375, -0.007568359375, -0.01031494140625, 0.0078125, 0.000858306884765625, -0.030517578125, -0.0234375, 0.0196533203125, -0.00909423828125, -0.00640869140625, 0.003326416015625, -0.00...	[ 44084, 136913, 27489, 366, 184, 18499, 46132, 5303, 46683, 3220, 1974, 3768, 1284, 22027, 18, 7440, 18347, 4032, 277, 4692, 1556, 142508, 6889, 61924, 8781, 32354, 7477, 238, 1884, 4527, 70731, 13, 13204, 12050, 223, 185397, 31577, 9969, 13...	[ 0.0933837890625, 0.2196044921875, 0.1265869140625, 0.0931396484375, 0.065673828125, 0.2030029296875, 0.09332275390625, 0.1710205078125, 0.1409912109375, 0.144775390625, 0.2154541015625, 0.051605224609375, 0.039337158203125, 0.03125, 0.0823974609375, 0.2327880859375, 0.07476806640625,...	embed
63642608_c0	63642608	haskell	0	Title: Can't write a type declaration in playground of Haskell IDE Problem title: Can't write a type declaration in playground of Haskell IDE Tags: haskell Problem: Can't write a type declaration in playground of Haskell IDE I'm writing Haskell with the ‎Haskell on the Mac App Store tool. I can't write a type...	Can't write a type declaration in playground of Haskell IDE Can't write a type declaration in playground of Haskell IDE haskell Can Haskell IDE Foo Bar FooBar Variable Can't write a type declaration in playground of Haskell IDE I'm writing Haskell with the ‎Haskell on the Mac App Store tool. I can't write a t...	[ 0.00225830078125, 0.025390625, -0.0113525390625, 0.02392578125, 0.0128173828125, -0.00836181640625, -0.00469970703125, 0.007293701171875, -0.006866455078125, 0.00360107421875, -0.00238037109375, -0.03369140625, -0.006683349609375, 0.004180908203125, 0.0169677734375, 0.0103759765625, ...	[ 4171, 3768, 18, 33022, 10644, 21635, 1363, 23, 11301, 64330, 20625, 142508, 36497, 1556, 9572, 31, 3253, 25267, 84572, 2886, 32562, 678, 98, 4727, 5659, 14934, 55516, 831, 25632, 6002, 86531, 15490, 14315, 20623, 959, 213850, 18499, 26008, ...	[ 0.084716796875, 0.044586181640625, 0.077392578125, 0.153564453125, 0.241455078125, 0.20556640625, 0.051025390625, 0.0245513916015625, 0.139892578125, 0.177001953125, 0.1380615234375, 0.22412109375, 0.1654052734375, 0.10302734375, 0.1046142578125, 0.07470703125, 0.1392822265625, 0.1...	embed
6365748_c0	6365748	haskell	0	Title: How to serve an image of the screen as an input to a program, in Haskell Problem title: How to serve an image of the screen as an input to a program, in Haskell Tags: screenshot, haskell, graphics Problem: How to serve an image of the screen as an input to a program, in Haskell I'd like to write a function (I'm ...	How to serve an image of the screen as an input to a program, in Haskell How to serve an image of the screen as an input to a program, in Haskell screenshot haskell graphics How Haskell How to serve an image of the screen as an input to a program, in Haskell I'd like to write a function (I'm using Haskell) that's capab...	[ 0.00189971923828125, 0.0074462890625, -0.00762939453125, 0.036376953125, -0.00028228759765625, 0.016845703125, 0.00021266937255859375, -0.01348876953125, -0.010986328125, -0.041015625, 0.01251220703125, -0.01806640625, -0.00006866455078125, 0.00311279296875, 0.0234375, -0.0120239257812...	[ 11249, 47, 21265, 29569, 111, 49119, 237, 107730, 1528, 20625, 142508, 142, 70, 23, 209647, 1556, 48461, 1884, 33022, 32354, 87709, 97351, 6496, 8561, 10941, 21455, 38937, 479, 26439, 5739, 16275, 36669, 13003, 137089, 10958, 11, 98169, 61590...	[ 0.0699462890625, 0.119140625, 0.2320556640625, 0.2288818359375, 0.09552001953125, 0.1995849609375, 0.1107177734375, 0.2197265625, 0.170654296875, 0.1453857421875, 0.2479248046875, 0.035369873046875, 0.0362548828125, 0.049041748046875, 0.240234375, 0.11328125, 0.1365966796875, 0.066...	embed
28327491_c0	28327491	haskell	0	Title: Cabal: Does not exists message in windows 7 Problem title: Cabal: Does not exists message in windows 7 Tags: haskell, cabal Problem: Cabal: Does not exists message in windows 7 When I try to update cabal, I get this. Resolving dependencies... Configuring cabal-install-1.22.0.0... cabal: does not exist Failed to ...	Cabal: Does not exists message in windows 7 Cabal: Does not exists message in windows 7 haskell cabal Cabal Does Resolving Configuring cabal-install-1.22.0.0 Failed Error ExitFailure Users AppData Roaming Cabal: Does not exists message in windows 7 When I try to update cabal, I get this. Content of my PATH variable is ...	[ 0.01104736328125, 0.001190185546875, 0.0125732421875, 0.01318359375, -0.01239013671875, 0.00994873046875, -0.00136566162109375, 0.009521484375, -0.0038909912109375, 0.0277099609375, 0.003021240234375, -0.0283203125, -0.00555419921875, -0.005279541015625, 0.00830078125, -0.0001640319824...	[ 30438, 289, 101790, 959, 32316, 7, 26008, 23, 54825, 361, 1556, 142508, 109524, 132944, 59994, 80383, 4015, 99929, 190355, 212059, 5443, 217, 17647, 379, 53400, 5659, 137989, 2777, 302, 9790, 28350, 2046, 903, 70870, 436, 139909, 77336, 4865,...	[ 0.212646484375, 0.2127685546875, 0.0966796875, 0.144287109375, 0.2061767578125, 0.09844970703125, 0.217529296875, 0.091552734375, 0.13720703125, 0.1961669921875, 0.1014404296875, 0.1802978515625, 0.2442626953125, 0.1224365234375, 0.1326904296875, 0.141357421875, 0.084228515625, 0.0...	embed
30770361_c0	30770361	haskell	0	Title: within a project can I compile a module and interactively load the compiled module within ghci? Problem title: within a project can I compile a module and interactively load the compiled module within ghci? Tags: compilation, ghc, ghci, read-eval-print-loop, haskell Problem: within a project can I compile a modu...	within a project can I compile a module and interactively load the compiled module within ghci? within a project can I compile a module and interactively load the compiled module within ghci? compilation ghc ghci read-eval-print-loop haskell within a project can I compile a module and interactively load the compiled mo...	[ -0.00872802734375, -0.0106201171875, -0.0023651123046875, 0.00970458984375, -0.001922607421875, 0.012451171875, 0.01275634765625, -0.005645751953125, -0.0010528564453125, -0.029296875, -0.0106201171875, -0.0108642578125, -0.0040283203125, -0.01324462890625, 0.00927734375, 0.00708007812...	[ 28032, 13452, 831, 9969, 1340, 88996, 136, 212398, 72367, 375, 5974, 31380, 318, 87, 98352, 238, 12301, 1405, 35662, 28354, 1556, 142508, 10, 23, 20625, 4488, 678, 64194, 109524, 45367, 3060, 4527, 1543, 181135, 40894, 124374, 77546, 17366, ...	[ 0.16455078125, 0.1751708984375, 0.1181640625, 0.1834716796875, 0.1744384765625, 0.260009765625, 0.0467529296875, 0.18505859375, 0.1927490234375, 0.06817626953125, 0.172607421875, 0.1517333984375, 0.1981201171875, 0.015533447265625, 0.1734619140625, 0.12158203125, 0.1004638671875, 0...	embed
55053645_c0	55053645	haskell	0	Title: How would I remove borders from all Floating windows in XMonad Problem title: How would I remove borders from all Floating windows in XMonad Tags: haskell, xmonad Problem: How would I remove borders from all Floating windows in XMonad There are several similar questions but none quite solve it for me, for exampl...	How would I remove borders from all Floating windows in XMonad How would I remove borders from all Floating windows in XMonad haskell xmonad all How Floating XMonad How would I remove borders from all Floating windows in XMonad There are several similar questions but none quite solve it for me, for example this questio...	[ 0.01318359375, 0.042236328125, -0.01251220703125, 0.003997802734375, 0.01495361328125, 0.0130615234375, 0.0235595703125, -0.0240478515625, 0.00811767578125, -0.006378173828125, 0.00830078125, -0.0026702880859375, 0.008056640625, 0.0152587890625, -0.015869140625, -0.01214599609375, -0...	[ 11249, 2806, 87388, 132988, 7, 756, 38699, 26518, 54825, 1193, 46674, 712, 1295, 23, 1556, 142508, 1022, 3796, 86869, 3642, 4393, 86667, 21917, 6056, 5021, 113469, 14202, 21185, 41884, 4734, 76896, 23937, 55516, 4527, 12765, 959, 85526, 29806...	[ 0.028350830078125, 0.05352783203125, 0.1695556640625, 0.2269287109375, 0.09613037109375, 0.10491943359375, 0.1778564453125, 0.142822265625, 0.1695556640625, 0.07598876953125, 0.152099609375, 0.1611328125, 0.04595947265625, 0.011810302734375, 0.05859375, 0.175048828125, 0.020675659179...	embed
55874465_c1	55874465	haskell	1	verification. 3) Lift any data processing that could fail into the IO monad and use Control.Exception.throwIO . 4) Lift any data processing that could fail into the IO monad and use fail (I've read that using fail frowned on by the community?) 5) Return an Either or something similar, and let that bubble up through al...	verification. 3) Lift any data processing that could fail into the IO monad and use Control.Exception.throwIO . 4) Lift any data processing that could fail into the IO monad and use fail (I've read that using fail frowned on by the community?) 5) Return an Either or something similar, and let that bubble up through al...	[ -0.00189208984375, 0.024658203125, -0.00142669677734375, 0.0174560546875, 0.022705078125, 0.00433349609375, 0.0216064453125, -0.0189208984375, 0.01251220703125, -0.007415771484375, -0.000640869140625, -0.031005859375, 0.0174560546875, -0.0164794921875, -0.00634765625, -0.01458740234375...	[ 493, 41274, 8439, 166562, 2499, 2053, 9433, 214, 5809, 35782, 3934, 17780, 2667, 712, 4527, 27131, 19279, 63928, 927, 15555, 13956, 17368, 70, 26908, 21162, 173340, 142, 4565, 9319, 21373, 2633, 73163, 62775, 272, 58621, 1902, 3060, 50218, ...	[ 0.182861328125, 0.209716796875, 0.09063720703125, 0.1954345703125, 0.030670166015625, 0.111572265625, 0.087646484375, 0.0279998779296875, 0.05194091796875, 0.2083740234375, 0.050384521484375, 0.2054443359375, 0.11962890625, 0.16064453125, 0.07049560546875, 0.1966552734375, 0.07946777...	embed
40761424_c0	40761424	haskell	0	Title: Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ Problem title: Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ Tags: haskell Problem: Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ This is the code of my program: funct :: Double -> Double ...	Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ haskell Haskell Couldn Double x..y Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ This is the code of my program: and error, which I'm getting: I real...	[ -0.01171875, -0.00823974609375, 0.00933837890625, -0.0028228759765625, -0.010009765625, 0.0091552734375, -0.013671875, -0.01177978515625, 0.0084228515625, 0.01129150390625, -0.005584716796875, -0.0091552734375, 0.01531982421875, -0.039794921875, -0.002532958984375, 0.00482177734375, ...	[ 20625, 142508, 191147, 3768, 18, 14858, 84751, 10644, 8331, 34, 2661, 678, 8561, 4153, 1556, 19, 107172, 1022, 53, 18151, 1528, 18499, 20949, 6183, 3525, 9014, 31577, 30022, 65771, 7477, 15390, 30646, 214, 831, 28219, 15400, 17378, 83, 360,...	[ 0.138916015625, 0.237060546875, 0.1173095703125, 0.0906982421875, 0.183349609375, 0.18701171875, 0.1595458984375, 0.212646484375, 0.103515625, 0.1390380859375, 0.208984375, 0.06414794921875, 0.18603515625, 0.1339111328125, 0.118896484375, 0.0247802734375, 0.2412109375, 0.0797119140...	embed
51089784_c0	51089784	haskell	0	Title: How can I desugar my GADTs? Problem title: How can I desugar my GADTs? Tags: haskell, syntactic-sugar, gadt Problem: How can I desugar my GADTs? I was reading Coercions and Roles for Dummies and the author off handedly mentioned that GADTs were just syntactic sugar. GADTs are syntactic sugar on top of (~) so exp...	How can I desugar my GADTs? How can I desugar my GADTs? haskell syntactic-sugar gadt How GADTs Language DataKinds TypeOperators HList Empty Cons How can I desugar my GADTs? I was reading Coercions and Roles for Dummies and the author off handedly mentioned that GADTs were just syntactic sugar. Now the author didn't go ...	[ 0.01123046875, 0.0113525390625, -0.008056640625, -0.004058837890625, 0.01104736328125, 0.00933837890625, -0.0157470703125, -0.01611328125, -0.0036773681640625, 0.0120849609375, 0.0037689208984375, -0.033447265625, -0.0279541015625, 0.005615234375, 0.0062255859375, 0.00130462646484375, ...	[ 11249, 831, 224, 34, 1970, 23749, 41072, 7, 87, 759, 1556, 142508, 6002, 102, 49086, 1159, 13384, 83658, 11809, 7250, 60457, 156823, 572, 154663, 31678, 39215, 1311, 56, 5746, 136, 2777, 100, 27919, 32747, 101087, 241522, 16565, 2852, 8781,...	[ 0.054595947265625, 0.06207275390625, 0.168212890625, 0.1365966796875, 0.197998046875, 0.1702880859375, 0.241943359375, 0.16064453125, 0.0158538818359375, 0.049591064453125, 0.11328125, 0.2110595703125, 0.07879638671875, 0.1112060546875, 0.07421875, 0.08770751953125, 0.17138671875, ...	embed
76420632_c0	76420632	haskell	0	Title: Why the prism _Show does not work for a list? Problem title: Why the prism _Show does not work for a list? Tags: haskell-lens, haskell Problem: Why the prism _Show does not work for a list? How to explain the 3rd result? Why is the returned list empty? >[Just 1, Just 2, Nothing, Just 3]^..folded._Just [1,2,3] >"...	Why the prism _Show does not work for a list? Why the prism _Show does not work for a list? haskell-lens haskell Why _Show Just Nothing folded._Just _Show::Maybe folded._Show Maybe _Just Prism Read Show Why the prism _Show does not work for a list? How to explain the 3rd result? Why is the returned list empty? _Just an...	[ -0.0208740234375, -0.005157470703125, 0.0084228515625, 0.01416015625, -0.015869140625, 0.033447265625, 0.019775390625, -0.01318359375, 0.0111083984375, 0.022216796875, 0.01080322265625, 0.005218505859375, -0.000156402587890625, 0.0198974609375, -0.016845703125, -0.01318359375, -0.003...	[ 44084, 4067, 39, 101, 168660, 959, 4488, 5303, 100, 1556, 142508, 1977, 9563, 182747, 18344, 48141, 127794, 82419, 372, 83425, 20204, 4764, 17367, 73342, 138, 4216, 16750, 176377, 201505, 136, 4432, 14602, 41206, 2046, 106, 116, 678, 3098, ...	[ 0.060302734375, 0.15283203125, 0.1363525390625, 0.0174560546875, 0.253173828125, 0.05926513671875, 0.0950927734375, 0.162841796875, 0.0163726806640625, 0.0706787109375, 0.2001953125, 0.1048583984375, 0.101806640625, 0.1204833984375, 0.08795166015625, 0.08544921875, 0.1473388671875, ...	embed
45840094_c0	45840094	haskell	0	Title: When does `modify` copy the vector? Problem title: When does `modify` copy the vector? Tags: immutability, vector, haskell, functional-programming, performance Problem: When does `modify` copy the vector? From https://hackage.haskell.org/package/vector-0.12.0.1/docs/Data-Vector.html#v:modify Apply a destructive ...	When does `modify` copy the vector? When does `modify` copy the vector? immutability vector haskell functional-programming performance When When does `modify` copy the vector? From https://hackage.haskell.org/package/vector-0.12.0.1/docs/Data-Vector.html#v:modify This sounds like it can have drastically different perfo...	[ -0.013916015625, 0.026611328125, -0.0159912109375, 0.0113525390625, 0.004486083984375, -0.006591796875, -0.00836181640625, -0.00897216796875, 0.005645751953125, 0.021240234375, 0.008056640625, -0.0283203125, 0.00567626953125, 0.00142669677734375, -0.0086669921875, 0.00848388671875, -...	[ 14847, 14602, 13415, 40383, 43658, 173, 18770, 566, 14311, 41159, 1556, 142508, 123309, 28966, 23718, 9473, 70, 139509, 10557, 29102, 272, 23320, 15654, 102014, 137989, 26455, 7693, 334, 102678, 831, 211228, 12921, 62816, 115840, 2811, 3687, 16...	[ 0.16259765625, 0.07745361328125, 0.1983642578125, 0.2349853515625, 0.2479248046875, 0.192626953125, 0.19921875, 0.0418701171875, 0.1453857421875, 0.08447265625, 0.132080078125, 0.2301025390625, 0.11572265625, 0.08453369140625, 0.160888671875, 0.00640869140625, 0.005645751953125, 0....	embed
54261834_c0	54261834	haskell	0	Title: Simple example of call-by-need Problem title: Simple example of call-by-need Tags: r, lazy-evaluation, haskell, call-by-need Problem: Simple example of call-by-need I'm trying to understand the theorem behind "call-by-need." I do understand the definition, but I'm a bit confused. I would like to see a simple exa...	Simple example of call-by-need Simple example of call-by-need r lazy-evaluation haskell call-by-need Simple Simple example of call-by-need I'm trying to understand the theorem behind "call-by-need." I do understand the definition, but I'm a bit confused. I would like to see a simple example which shows how call-by-need...	[ 0.016845703125, 0.0294189453125, 0.01031494140625, 0.01409912109375, 0.0089111328125, 0.01409912109375, 0.01708984375, -0.00130462646484375, 0.0150146484375, -0.0235595703125, -0.005645751953125, -0.0272216796875, -0.0118408203125, 0.004486083984375, 0.03173828125, 0.00372314453125, ...	[ 60552, 27781, 11782, 1272, 86, 297, 1690, 21, 3285, 159258, 1556, 142508, 28219, 58391, 50155, 85763, 9, 80934, 55681, 8781, 45831, 3642, 43240, 20625, 4527, 903, 8562, 219836, 56037, 46876, 8060, 60213, 11627, 152653, 11, 136, 21373, 12921, ...	[ 0.1634521484375, 0.1868896484375, 0.1929931640625, 0.20166015625, 0.153564453125, 0.189453125, 0.1219482421875, 0.09552001953125, 0.1744384765625, 0.151123046875, 0.11328125, 0.24609375, 0.057952880859375, 0.139404296875, 0.052581787109375, 0.1878662109375, 0.046600341796875, 0.071...	embed
63561210_c0	63561210	haskell	0	Title: Is there any general functor (not limited to endofunctor) usage in programming? Problem title: Is there any general functor (not limited to endofunctor) usage in programming? Tags: functor, category-theory, haskell, javascript Problem: Is there any general functor (not limited to endofunctor) usage in programmin...	Is there any general functor (not limited to endofunctor) usage in programming? Is there any general functor (not limited to endofunctor) usage in programming? functor category-theory haskell javascript Is there any general functor (not limited to endofunctor) usage in programming? Is there any general functor (not lim...	[ 0.00732421875, -0.00531005859375, 0.011962890625, -0.0052490234375, 0.0035247802734375, 0.00909423828125, -0.0093994140625, -0.0206298828125, -0.00177764892578125, -0.0233154296875, -0.006927490234375, -0.030517578125, 0.009765625, 0.0032501220703125, -0.021240234375, -0.00170135498046...	[ 2499, 4537, 7477, 18770, 84046, 22, 246, 16498, 127689, 23, 56037, 449, 2685, 10869, 95487, 2347, 30675, 1556, 142508, 136951, 2071, 28219, 31635, 212423, 3249, 45646, 8781, 1884, 22460, 532, 2667, 712, 34292, 9615, 46876, 1391, 1042, 17721, ...	[ 0.06549072265625, 0.205322265625, 0.1947021484375, 0.22216796875, 0.08087158203125, 0.1263427734375, 0.172607421875, 0.198974609375, 0.18994140625, 0.053985595703125, 0.14794921875, 0.07244873046875, 0.0625, 0.045013427734375, 0.2032470703125, 0.045166015625, 0.0048828125, 0.107604...	embed
24183749_c0	24183749	haskell	0	Title: Use type synonym in type declaration mapping Problem title: Use type synonym in type declaration mapping Tags: haskell, type-families Problem: Use type synonym in type declaration mapping I've implemented a map type type family like this type family MapT (t :: * -> ) (e::[]) type instance MapT t '[] = '[] type...	Use type synonym in type declaration mapping Use type synonym in type declaration mapping haskell type-families Use MapT MList Maybe Type Use type synonym in type declaration mapping I've implemented a map type type family like this It works with a type constructor : gives However, I try It doesn't work. I tried type f...	[ -0.0062255859375, 0.0172119140625, 0.002777099609375, -0.01507568359375, -0.0169677734375, -0.00634765625, 0.01025390625, 0.018798828125, 0.0159912109375, -0.00982666015625, -0.0010833740234375, -0.0101318359375, -0.004425048828125, 0.017822265625, -0.005950927734375, 0.008544921875, ...	[ 36836, 10644, 164661, 21635, 291, 26783, 1556, 142508, 69128, 42719, 618, 276, 154663, 83425, 60457, 29479, 22288, 14449, 43240, 678, 64549, 748, 76199, 9790, 18, 4488, 86869, 2053, 50986 ]	[ 0.06982421875, 0.2308349609375, 0.2196044921875, 0.1197509765625, 0.14208984375, 0.04229736328125, 0.078857421875, 0.1629638671875, 0.1002197265625, 0.117431640625, 0.102294921875, 0.027557373046875, 0.171142578125, 0.0164947509765625, 0.2027587890625, 0.049835205078125, 0.1257324218...	embed
21056605_c0	21056605	haskell	0	Title: Self generating list where each element appends some elements to the end Problem title: Self generating list where each element appends some elements to the end Tags: haskell Problem: Self generating list where each element appends some elements to the end I'm looking for a way to do something like this. Say we ...	Self generating list where each element appends some elements to the end Self generating list where each element appends some elements to the end haskell Self generating list where each element appends some elements to the end I'm looking for a way to do something like this. Say we start with 1. For every number odd nu...	[ 0.0025177001953125, 0.02978515625, 0.004241943359375, 0.0086669921875, -0.00384521484375, 0.021240234375, -0.020751953125, 0.01287841796875, 0.031494140625, -0.0439453125, 0.019287109375, -0.0255126953125, 0.0003204345703125, 0.03515625, 0.000949859619140625, 0.000446319580078125, 0....	[ 55347, 12663, 1916, 5303, 7440, 12638, 12830, 114689, 6468, 3060, 80854, 47, 70, 3564, 1556, 142508, 16487, 3917, 54, 1884, 903, 4034, 678, 615, 1326, 11907, 14012, 70270, 15190, 131815, 3853, 85398, 160743, 6713, 305, 483, 17480, 616, 543,...	[ 0.1927490234375, 0.2103271484375, 0.1005859375, 0.25146484375, 0.057464599609375, 0.14697265625, 0.196044921875, 0.15625, 0.122314453125, 0.046600341796875, 0.18603515625, 0.1007080078125, 0.009124755859375, 0.21142578125, 0.1597900390625, 0.260009765625, 0.04193115234375, 0.050567...	embed
39319706_c0	39319706	haskell	0	Title: How to pattern match against Text without using OverloadedStrings? Problem title: How to pattern match against Text without using OverloadedStrings? Tags: haskell, pattern-matching, string Problem: How to pattern match against Text without using OverloadedStrings? This works: {-# LANGUAGE OverloadedStrings #-} m...	How to pattern match against Text without using OverloadedStrings? How to pattern match against Text without using OverloadedStrings? haskell pattern-matching string OverloadedStrings How Text LANGUAGE How to pattern match against Text without using OverloadedStrings? This works: Without the OverloadedStrings extension...	[ 0.007476806640625, -0.01409912109375, 0.0084228515625, 0.0218505859375, -0.0126953125, -0.005035400390625, -0.000812530517578125, -0.016357421875, 0.01397705078125, -0.00555419921875, 0.029296875, -0.026611328125, -0.00543212890625, -0.006927490234375, 0.01324462890625, -0.003372192382...	[ 11249, 103510, 14858, 26548, 24129, 15490, 9578, 63033, 71713, 5180, 47, 1556, 142508, 98753, 79315, 297, 98064, 17368, 43240, 177417, 111938, 44, 58, 111, 10644, 23351, 214, 22027, 18, 9969, 1340, 32354, 759, 97249, 29102, 107003, 20625, 695...	[ 0.04534912109375, 0.2205810546875, 0.2244873046875, 0.2060546875, 0.173583984375, 0.09173583984375, 0.0972900390625, 0.1424560546875, 0.126953125, 0.08380126953125, 0.0239410400390625, 0.066650390625, 0.1666259765625, 0.1851806640625, 0.131591796875, 0.010986328125, 0.048614501953125...	embed
70131338_c0	70131338	haskell	0	Title: Infinite loop with [2,2..20] in Haskell using ghci Problem title: Infinite loop with [2,2..20] in Haskell using ghci Tags: haskell Problem: Infinite loop with [2,2..20] in Haskell using ghci I am just staring with Haskell reading the http://learnyouahaskell.com book. In the Texas Ranges section the author shows ...	Infinite loop with [2,2..20] in Haskell using ghci Infinite loop with [2,2..20] in Haskell using ghci haskell ghci Infinite Haskell Infinite loop with [2,2..20] in Haskell using ghci I am just staring with Haskell reading the http://learnyouahaskell.com book. In the Texas Ranges section the author shows code for specif...	[ -0.0067138671875, -0.003753662109375, -0.0025482177734375, 0.011962890625, 0.005096435546875, 0.0185546875, -0.006317138671875, 0.00090789794921875, 0.01416015625, -0.003875732421875, 0.0208740234375, -0.01123046875, 0.008056640625, 0.01361083984375, 0.01153564453125, 0.01409912109375,...	[ 134322, 13, 40956, 678, 304, 5442, 1549, 20625, 142508, 17368, 31380, 318, 23, 1556, 5, 6057, 16454, 796, 7232, 12877, 31464, 142462, 7, 18151, 48502, 151138, 29954, 37457, 6002, 86531, 53, 169, 27781, 617, 127877, 156100, 3229, 11675, 2046...	[ 0.1790771484375, 0.012969970703125, 0.213134765625, 0.05352783203125, 0.131591796875, 0.1973876953125, 0.2047119140625, 0.1405029296875, 0.239501953125, 0.025726318359375, 0.1204833984375, 0.1502685546875, 0.003173828125, 0.0875244140625, 0.0074462890625, 0.04486083984375, 0.05627441...	embed
32250989_c1	32250989	haskell	1	htTypes. DhtTypes> Hash20Bytes [0..10] Loading package array-0.4.0.1 ... linking ... done. Loading package deepseq-1.3.0.1 ... linking ... done. Loading package bytestring-0.10.0.2 ... linking ... done. Loading package bytestring-builder-0.10.6.0.0 ... linking ... done. 0123456789a DhtTypes> I have already read ghci ...	htTypes. DhtTypes> Hash20Bytes [0..10] Loading package array-0.4.0.1 ... linking ... done. Loading package deepseq-1.3.0.1 ... linking ... done. Loading package bytestring-0.10.0.2 ... linking ... done. Loading package bytestring-builder-0.10.6.0.0 ... linking ... done. 0123456789a DhtTypes> I have already read ghci ...	[ 0.01361083984375, -0.003692626953125, -0.01806640625, 0.0093994140625, -0.01422119140625, 0.0118408203125, -0.002105712890625, -0.006378173828125, -0.0057373046875, -0.00689697265625, 0.0005950927734375, -0.040771484375, 0.0033416748046875, -0.0177001953125, -0.014892578125, 0.00805664...	[ 9703, 196707, 397, 162087, 1549, 75358, 963, 228006, 98169, 10298, 53, 121254, 102014, 3126, 16940, 53894, 184, 864, 81046, 390, 67, 91693, 10179, 133684, 177149, 56, 122887, 99929, 3742, 121317, 153781, 11, 12301, 31380, 318, 959, 72367, 214...	[ 0.170654296875, 0.295166015625, 0.0208282470703125, 0.13134765625, 0.096435546875, 0.04852294921875, 0.0517578125, 0.17626953125, 0.1324462890625, 0.07037353515625, 0.006591796875, 0.0992431640625, 0.1251220703125, 0.08172607421875, 0.0287322998046875, 0.1173095703125, 0.047882080078...	embed
11069136_c0	11069136	haskell	0	Title: Haskell Parse Error - Naked Expression at Top Level Problem title: Haskell Parse Error - Naked Expression at Top Level Tags: haskell Problem: Haskell Parse Error - Naked Expression at Top Level I have a haskell file test.hs. In this file I have written a function doubleMe x: x + x this is the only function in th...	Haskell Parse Error - Naked Expression at Top Level Haskell Parse Error - Naked Expression at Top Level haskell Haskell Parse Error Naked Expression Top Level test.hs test.hs:1:1 Failed loaded:none Haskell Parse Error - Naked Expression at Top Level I have a haskell file test.hs. In this file I have written a function ...	[ -0.00921630859375, 0.01531982421875, -0.005950927734375, -0.00726318359375, 0.005340576171875, 0.036865234375, -0.001129150390625, -0.006622314453125, 0.0089111328125, -0.0322265625, -0.0130615234375, -0.032470703125, 0.0057373046875, -0.00897216796875, 0.0194091796875, 0.0017318725585...	[ 20625, 142508, 2392, 184, 212059, 353, 12225, 25129, 1830, 99, 4792, 84136, 1556, 3034, 127, 7, 19721, 190355, 72367, 157, 11435, 59121, 32354, 903, 4734, 31380, 318, 75101, 105876, 10644, 141, 5, 15490, 66747, 25632, 18499, 22304, 366, 24,...	[ 0.113525390625, 0.2252197265625, 0.149658203125, 0.08544921875, 0.150390625, 0.1634521484375, 0.2000732421875, 0.1474609375, 0.054595947265625, 0.054901123046875, 0.1239013671875, 0.1884765625, 0.1031494140625, 0.197265625, 0.09686279296875, 0.0160064697265625, 0.030914306640625, 0...	embed
36899597_c0	36899597	haskell	0	Title: Why can't I replace libraries distributed with GHC? What would happen if I did? Problem title: Why can't I replace libraries distributed with GHC? What would happen if I did? Tags: ghc, haskell-stack, haskell Problem: Why can't I replace libraries distributed with GHC? What would happen if I did? I see...	Why can't I replace libraries distributed with GHC? What would happen if I did? Why can't I replace libraries distributed with GHC? What would happen if I did? ghc haskell-stack haskell Why GHC What Why can't I replace libraries distributed with GHC? What would happen if I did? I see in this answer and this o...	[ -0.0107421875, 0.005523681640625, 0.00689697265625, 0.006072998046875, -0.000827789306640625, -0.00537109375, -0.0341796875, -0.001495361328125, -0.00469970703125, 0.018310546875, 0.003997802734375, -0.0174560546875, -0.00537109375, 0.010498046875, -0.0002918243408203125, 0.00643920898...	[ 44084, 831, 3768, 18, 91995, 35773, 10484, 15917, 678, 527, 73265, 53383, 2174, 31380, 238, 1556, 142508, 9, 590, 2594, 4865, 2806, 104643, 64113, 1221, 36356, 152240, 38526, 6512, 23742, 2633, 3647, 390, 67, 91693, 2967, 46002, 15490, 3384...	[ 0.084716796875, 0.0985107421875, 0.0098876953125, 0.06927490234375, 0.205078125, 0.199951171875, 0.094482421875, 0.160888671875, 0.07415771484375, 0.138916015625, 0.248291015625, 0.0266876220703125, 0.007781982421875, 0.10546875, 0.10687255859375, 0.1158447265625, 0.2158203125, 0.0...	embed
74160076_c0	74160076	haskell	0	Title: Creating instance of custom class Problem title: Creating instance of custom class Tags: graph, haskell, instance Problem: Creating instance of custom class I seem to get an error message when trying to create an instance of IntegerGraph . I do not understand the error message. Any tips? Here's the code: import ...	Creating instance of custom class Creating instance of custom class graph haskell instance Data.Map qualified Data.Set Creating Map Set IntGraph MyGraph Creating instance of custom class I seem to get an error message when trying to create an instance of IntegerGraph . I do not understand the error message. Any tips? H...	[ -0.02294921875, 0.00738525390625, 0.0025787353515625, 0.00982666015625, -0.0174560546875, 0.0234375, -0.0076904296875, -0.0169677734375, 0.002960205078125, -0.0115966796875, -0.004669189453125, -0.0289306640625, 0.0167236328125, 0.0079345703125, -0.00897216796875, 0.001983642578125, ...	[ 56781, 110527, 111, 114122, 18507, 41382, 1556, 142508, 11809, 166179, 217225, 294, 126, 42719, 19943, 360, 18, 37878, 11727, 2646, 142, 18499, 26008, 31577, 28282, 44401, 959, 28219, 6305, 18151, 212059, 60075, 1632, 1286, 10750, 47, 31852, ...	[ 0.13671875, 0.260009765625, 0.056549072265625, 0.2039794921875, 0.2294921875, 0.22021484375, 0.1099853515625, 0.1976318359375, 0.049774169921875, 0.1138916015625, 0.131103515625, 0.012939453125, 0.052337646484375, 0.141357421875, 0.09716796875, 0.049835205078125, 0.125, 0.206787109...	embed
42457167_c0	42457167	haskell	0	Title: How to give a more general type to these two functions that have identical definitions? Problem title: How to give a more general type to these two functions that have identical definitions? Tags: types, haskell Problem: How to give a more general type to these two functions that have identical definitions? Is i...	How to give a more general type to these two functions that have identical definitions? How to give a more general type to these two functions that have identical definitions? types haskell How Maybe Nothing Just unsafeListHandling2 How to give a more general type to these two functions that have identical definitions?...	[ -0.010986328125, 0.00083160400390625, 0.01080322265625, -0.0172119140625, -0.000659942626953125, 0.0179443359375, 0.012451171875, -0.0234375, 0.01373291015625, -0.0019073486328125, 0.0068359375, 0.0028533935546875, 0.00836181640625, -0.00872802734375, -0.012939453125, -0.0107421875, ...	[ 11249, 8337, 1286, 4537, 10644, 6626, 32354, 31943, 6827, 80934, 6097, 52895, 1556, 142508, 83425, 182747, 9563, 51, 115840, 154663, 135679, 2069, 304, 10, 47, 765, 7722, 25632, 18151, 58134, 189534, 116, 678, 60212, 164789, 16065 ]	[ 0.034454345703125, 0.07440185546875, 0.0885009765625, 0.14794921875, 0.191162109375, 0.09613037109375, 0.158935546875, 0.15673828125, 0.09222412109375, 0.1578369140625, 0.0309295654296875, 0.172119140625, 0.11962890625, 0.1968994140625, 0.107666015625, 0.1051025390625, 0.001525878906...	embed
49497808_c0	49497808	haskell	0	Title: Pattern matching on hmatrix Vector type in haskell Problem title: Pattern matching on hmatrix Vector type in haskell Tags: haskell, hmatrix, pattern-matching Problem: Pattern matching on hmatrix Vector type in haskell That question sounds trivial but I really can't find anything helping me on how to deal with it...	Pattern matching on hmatrix Vector type in haskell Pattern matching on hmatrix Vector type in haskell haskell hmatrix pattern-matching Numeric.LinearAlgebra.HMatrix Pattern Vector Double Couldn Pattern matching on hmatrix Vector type in haskell That question sounds trivial but I really can't find anything helping me on...	[ -0.025634765625, 0.0262451171875, -0.01153564453125, 0.006927490234375, 0.01708984375, -0.002288818359375, -0.03564453125, 0.0120849609375, 0.00634765625, -0.033447265625, 0.0015411376953125, -0.0284423828125, -0.0089111328125, -0.0245361328125, -0.03076171875, -0.0024871826171875, 0...	[ 9876, 22766, 14858, 214, 98, 1096, 192, 87427, 2609, 18770, 10644, 23, 1556, 142508, 103510, 98753, 93511, 93232, 429, 2844, 46592, 11, 107172, 191147, 19, 102678, 35142, 678, 8781, 27781, 42238, 20625, 72367, 186992, 5351, 81, 83, 12960, 5...	[ 0.1895751953125, 0.1737060546875, 0.2451171875, 0.07586669921875, 0.089599609375, 0.1298828125, 0.065673828125, 0.17041015625, 0.1549072265625, 0.1644287109375, 0.1466064453125, 0.0113525390625, 0.1439208984375, 0.2318115234375, 0.2275390625, 0.223388671875, 0.0159454345703125, 0.0...	embed
11382211_c0	11382211	haskell	0	Title: Is it possible to use Text or ByteString on HXT in Haskell? Problem title: Is it possible to use Text or ByteString on HXT in Haskell? Tags: web-scraping, text, hxt, haskell, bytestring Problem: Is it possible to use Text or ByteString on HXT in Haskell? I think HXT, a XML/HTML processing library in Haskell, has...	Is it possible to use Text or ByteString on HXT in Haskell? Is it possible to use Text or ByteString on HXT in Haskell? web-scraping text hxt haskell bytestring Text ByteString HXT Haskell Is it possible to use Text or ByteString on HXT in Haskell? I think HXT, a XML/HTML processing library in Haskell, has really flexi...	[ 0.022705078125, 0.01275634765625, 0.00860595703125, -0.002288818359375, -0.00070953369140625, 0.0118408203125, 0.0086669921875, -0.00885009765625, -0.0208740234375, -0.02099609375, -0.00007486343383789062, -0.038818359375, -0.01422119140625, -0.002227783203125, -0.00058746337890625, -0...	[ 2071, 442, 7722, 4527, 24129, 707, 3311, 67, 71713, 214, 98, 572, 70981, 23, 20625, 142508, 1467, 15182, 10366, 7986, 1096, 29062, 1556, 390, 91693, 92537, 127068, 9433, 35773, 6183, 110677, 113138, 150624, 37317, 45258, 69285, 1360, 1172, ...	[ 0.04205322265625, 0.0176544189453125, 0.1690673828125, 0.1590576171875, 0.248046875, 0.1126708984375, 0.09912109375, 0.1640625, 0.2255859375, 0.1414794921875, 0.06982421875, 0.1297607421875, 0.254150390625, 0.08966064453125, 0.1365966796875, 0.2509765625, 0.055389404296875, 0.10803...	embed
29002881_c1	29002881	haskell	1	still ways to optimize I am not aware of? Edit: GHC: -O -fllvm: 0.54s GHC (with unsafeWrite/unsafeRead and Word32): 0.34s g++: 0.24s g++ -O2: 0.05s python3: 2.66s Also when I change foldr to foldl' it starts allocating some memory and is 4 times slower as a result, why is that? Here is a C++ version I compared it to: ...	still ways to optimize I am not aware of? Edit: GHC: -O -fllvm: 0.54s GHC (with unsafeWrite/unsafeRead and Word32): 0.34s g++: 0.24s g++ -O2: 0.05s python3: 2.66s Also when I change foldr to foldl' it starts allocating some memory and is 4 times slower as a result, why is that? Here is a C++ version I compared it to: ...	[ -0.0235595703125, 0.00860595703125, -0.009033203125, -0.02001953125, -0.00946044921875, -0.00750732421875, -0.006011962890625, -0.010986328125, 0.0019073486328125, -0.047119140625, -0.00186920166015625, -0.005035400390625, 0.0087890625, 0.0096435546875, 0.0003108978271484375, 0.0037689...	[ 7464, 48322, 15572, 20650, 107419, 527, 73265, 670, 15991, 3723, 39, 81730, 617, 7, 76228, 51, 115840, 1456, 18781, 309, 31345, 22543, 91887, 127089, 706, 37223, 126175, 304, 89678, 758, 17198, 50828, 363, 787, 14604, 15549, 18344, 7569, 47...	[ 0.148193359375, 0.10516357421875, 0.2027587890625, 0.1534423828125, 0.1044921875, 0.088134765625, 0.2164306640625, 0.1007080078125, 0.07269287109375, 0.0762939453125, 0.10638427734375, 0.091064453125, 0.11474609375, 0.09326171875, 0.00433349609375, 0.05145263671875, 0.1917724609375, ...	embed
20237554_c0	20237554	haskell	0	Title: How to generate a list of repeated applications of a function to the previous result of it in IO context Problem title: How to generate a list of repeated applications of a function to the previous result of it in IO context Tags: haskell Problem: How to generate a list of repeated applications of a function to ...	How to generate a list of repeated applications of a function to the previous result of it in IO context How to generate a list of repeated applications of a function to the previous result of it in IO context haskell How How to generate a list of repeated applications of a function to the previous result of it in IO c...	[ 0.004852294921875, -0.01324462890625, -0.00003981590270996094, -0.0025787353515625, -0.01483154296875, 0.0194091796875, 0.007781982421875, -0.0128173828125, -0.001129150390625, -0.060791015625, 0.00157928466796875, -0.0220947265625, -0.0054931640625, 0.00579833984375, 0.0042724609375, ...	[ 11249, 47, 139392, 10, 5303, 111, 119140, 297, 86685, 32354, 96362, 16750, 17780, 43701, 23, 1556, 142508, 29806, 2967, 31577, 86869, 3871, 38415, 42413, 5045, 1884, 8560, 67, 131527, 138256, 60742, 46132, 96759, 101935, 9844, 1286, 54811, 99...	[ 0.079833984375, 0.1685791015625, 0.2076416015625, 0.05499267578125, 0.1826171875, 0.0780029296875, 0.254638671875, 0.147216796875, 0.220458984375, 0.1575927734375, 0.1259765625, 0.1273193359375, 0.19775390625, 0.1744384765625, 0.0232391357421875, 0.151611328125, 0.2213134765625, 0....	embed
10954237_c0	10954237	haskell	0	Title: Design of a 2d coordinate vector Problem title: Design of a 2d coordinate vector Tags: haskell, types Problem: Design of a 2d coordinate vector I'm looking for a simple representation of a 2d coordinate vector. My first idea was a simple (c, c) tuple, but this doesn't suit my needs. This is what I'd want: Instan...	Design of a 2d coordinate vector Design of a 2d coordinate vector haskell types Design ScreenCoord GameCoord Coord Design of a 2d coordinate vector I'm looking for a simple representation of a 2d coordinate vector. My first idea was a simple (c, c) tuple, but this doesn't suit my needs. This is what I'd want: Instances...	[ 0.01556396484375, 0.0201416015625, -0.01483154296875, 0.019287109375, 0.01348876953125, -0.005035400390625, -0.00421142578125, -0.019287109375, 0.005889892578125, -0.004150390625, 0.001983642578125, -0.03369140625, -0.0040283203125, 0.0021209716796875, -0.046630859375, 0.0223388671875,...	[ 11724, 116, 71, 176866, 173, 18770, 13, 1556, 142508, 52895, 94831, 10625, 6651, 13547, 1311, 16487, 8781, 18811, 1363, 5117, 6528, 10, 238, 501, 370, 8705, 18, 60813, 27117, 2367, 3444, 116071, 111, 28670, 136, 5659, 11048, 83259, 117781, ...	[ 0.1934814453125, 0.162841796875, 0.136962890625, 0.1949462890625, 0.169921875, 0.17919921875, 0.0287017822265625, 0.111083984375, 0.214599609375, 0.1737060546875, 0.1597900390625, 0.1336669921875, 0.18017578125, 0.14306640625, 0.0994873046875, 0.0709228515625, 0.12109375, 0.1804199...	embed
24708918_c1	24708918	haskell	1	), OtherType, (Double, [String])) res3 <- bar inputC :: IO (([Int],String), (Int, String, Int), YetAnotherType, (Double, [String])) Is there a way to avoid this? I'm aware it would be possible to bind the result of bar inputA and use it in a function expecting a MyType , allowing the type engine to infer that the a in ...	), OtherType, (Double, [String])) res3 <- bar inputC :: IO (([Int],String), (Int, String, Int), YetAnotherType, (Double, [String])) Is there a way to avoid this? I'm aware it would be possible to bind the result of bar inputA and use it in a function expecting a MyType , allowing the type engine to infer that the a in ...	[ -0.0096435546875, 0.01251220703125, -0.0040283203125, 0.009033203125, 0.00830078125, 0.00072479248046875, -0.027099609375, 0.00060272216796875, 0.01446533203125, -0.015625, -0.000759124755859375, -0.004913330078125, -0.00008058547973632812, 0.0035552978515625, -0.0126953125, -0.0030212...	[ 247, 64511, 196707, 34, 2661, 71713, 214, 3332, 363, 4426, 1909, 107730, 441, 17780, 18, 23351, 63519, 7251, 126340, 3917, 71864, 903, 7722, 68557, 16750, 284, 4527, 32354, 41206, 2646, 10644, 87907, 53498, 10, 15490, 143726, 8668, 209201, ...	[ 0.001556396484375, 0.1693115234375, 0.29345703125, 0.031646728515625, 0.0938720703125, 0.1031494140625, 0.000885009765625, 0.151611328125, 0.1708984375, 0.016265869140625, 0.1546630859375, 0.171142578125, 0.0433349609375, 0.1688232421875, 0.055145263671875, 0.0755615234375, 0.1431884...	embed
26050460_c0	26050460	haskell	0	Title: Excluding Numbers for Sieve of Sundaram Problem title: Excluding Numbers for Sieve of Sundaram Tags: sieve-algorithm, haskell Problem: Excluding Numbers for Sieve of Sundaram I'm working on implementing the Sieve of Sundaram . The first step is to get a list of Integer's such that: i, j are Natural Numbers, 1 <=...	Excluding Numbers for Sieve of Sundaram Excluding Numbers for Sieve of Sundaram sieve-algorithm haskell Excluding Numbers Sieve Sundaram Integer Excluding Numbers for Sieve of Sundaram I'm working on implementing the Sieve of Sundaram . The first step is to get a list of Integer's such that: Here's my function. It's su...	[ -0.021240234375, 0.0057373046875, -0.00860595703125, 0.0208740234375, 0.00274658203125, 0.0198974609375, -0.0115966796875, 0.0086669921875, -0.021484375, -0.00177764892578125, -0.0059814453125, -0.017822265625, 0.004791259765625, -0.0101318359375, -0.001556396484375, 0.007049560546875,...	[ 110823, 822, 6238, 103332, 100, 727, 272, 111, 96155, 2198, 78, 3134, 100628, 2783, 1556, 142508, 44401, 20697, 29479, 5117, 29954, 2046, 5303, 6044, 11853, 32354, 134598, 139392, 370, 99726, 756, 14, 1647, 14858, 36917, 185190, 20949, 351, ...	[ 0.1109619140625, 0.154052734375, 0.0374755859375, 0.2012939453125, 0.05194091796875, 0.1767578125, 0.19775390625, 0.109130859375, 0.1380615234375, 0.2213134765625, 0.1312255859375, 0.2041015625, 0.07098388671875, 0.0687255859375, 0.1156005859375, 0.205322265625, 0.2012939453125, 0....	embed
46481633_c1	46481633	haskell	1	.0.0-HnYRxRg1qoiyMKwsCMtby:Lib" { tick function "otherFunc" on line 9; } when we then do the next step and try to generate the overlay stack exec hpc -- overlay --hpcdir=.stack-work/dist/x86_64-linux/Cabal-1.24.2.0/hpc/ --srcdir=. myDraft.txt the process falls over and we get the following error: hpc: can not find hpcT...	.0.0-HnYRxRg1qoiyMKwsCMtby:Lib" { tick function "otherFunc" on line 9; } when we then do the next step and try to generate the overlay stack exec hpc -- overlay --hpcdir=.stack-work/dist/x86_64-linux/Cabal-1.24.2.0/hpc/ --srcdir=. myDraft.txt the process falls over and we get the following error: hpc: can not find hpcT...	[ 0.01531982421875, 0.0079345703125, 0.00180816650390625, 0.0252685546875, -0.010986328125, -0.006103515625, -0.0216064453125, -0.0007476806640625, -0.0001277923583984375, -0.036376953125, -0.01177978515625, -0.0174560546875, 0.00830078125, -0.0029754638671875, 0.0069580078125, 0.0015792...	[ 5, 99929, 841, 85054, 10618, 19725, 36498, 1272, 104820, 1053, 2594, 32354, 126340, 97249, 238, 13315, 483, 11737, 29954, 9790, 139392, 645, 5259, 177261, 1119, 3240, 118258, 127, 57095, 936, 590, 18244, 46295, 15276, 13307, 2397, 6077, 20370...	[ 0.00830078125, 0.185791015625, 0.0552978515625, 0.03948974609375, 0.05731201171875, 0.0838623046875, 0.0208587646484375, 0.2108154296875, 0.210693359375, 0.06402587890625, 0.11962890625, 0.0921630859375, 0.114501953125, 0.151611328125, 0.1239013671875, 0.000213623046875, 0.0739746093...	embed
55821151_c0	55821151	haskell	0	Title: How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? Problem title: How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? Tags: haskell Problem: How does Haskell know to retain Nothing as nothing when passed to a lambda that ret...	How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? haskell How Haskell Nothing Just Prelude Non Num Maybe Use FlexibleContexts When How does Haskell know to retain Nothing as noth...	[ -0.0111083984375, 0.008056640625, 0.0284423828125, -0.0177001953125, 0.021484375, 0.026611328125, 0.0203857421875, -0.0031890869140625, 0.022216796875, -0.00119781494140625, -0.0111083984375, -0.056396484375, -0.0230712890625, 0.00154876708984375, 0.004547119140625, -0.01953125, -0.0...	[ 11249, 20625, 142508, 3714, 112033, 73, 182747, 237, 33720, 115081, 47, 21, 6492, 85, 30646, 9563, 1022, 1556, 1914, 822, 112, 3775, 52782, 83425, 36836, 180842, 2661, 22829, 14847, 3229, 28219, 15400, 22027, 18, 18499, 36356, 7565, 3934, 1...	[ 0.048309326171875, 0.138427734375, 0.27392578125, 0.1165771484375, 0.152587890625, 0.1114501953125, 0.2005615234375, 0.1153564453125, 0.1815185546875, 0.093017578125, 0.049407958984375, 0.0160675048828125, 0.1702880859375, 0.1190185546875, 0.1136474609375, 0.10546875, 0.1102294921875...	embed
42133257_c0	42133257	haskell	0	Title: Data constructor error when implementing state monad? Problem title: Data constructor error when implementing state monad? Tags: haskell, monads Problem: Data constructor error when implementing state monad? I'm going through the state monad here and I'm trying to implement: import Control.Monad.Reader import Co...	Data constructor error when implementing state monad? Data constructor error when implementing state monad? haskell monads Control.Monad.Reader Control.Monad.Writer Control.Monad.State Data Stack State Perhaps StateT Data constructor error when implementing state monad? I'm going through the state monad here and I'm tr...	[ -0.005340576171875, 0.00457763671875, -0.011474609375, 0.001708984375, 0.0032196044921875, 0.0040283203125, -0.006103515625, -0.000270843505859375, -0.01361083984375, -0.0301513671875, 0.0152587890625, -0.01470947265625, 0.00799560546875, -0.0081787109375, -0.012939453125, -0.007873535...	[ 11809, 64549, 748, 18499, 3229, 29479, 11341, 2667, 712, 1556, 142508, 27131, 46674, 31345, 135206, 6512, 2594, 22836, 181799, 618, 8305, 3688, 31577, 33306, 25632, 2022, 87, 132283, 9844, 62822 ]	[ 0.135986328125, 0.2144775390625, 0.1568603515625, 0.18359375, 0.03204345703125, 0.166259765625, 0.1802978515625, 0.146728515625, 0.2080078125, 0.095458984375, 0.210205078125, 0.15673828125, 0.10430908203125, 0.0865478515625, 0.1171875, 0.07275390625, 0.0858154296875, 0.154418945312...	embed
48768131_c0	48768131	haskell	0	Title: Happstack SSL error - wrong tag Problem title: Happstack SSL error - wrong tag Tags: happstack, certbot, haskell, ssl Problem: Happstack SSL error - wrong tag I am trying to run happstack-tls server using certificate generated by certbot, however, when I run it I get user error (error:0D0680A8:asn1 encoding rout...	Happstack SSL error - wrong tag Happstack SSL error - wrong tag happstack certbot haskell ssl Happstack SSL error:0D0680A8:asn1 routines:asn1_check_tlen:wrong TLSConf csr-certbot.der key-certbot.pem Server Happstack SSL error - wrong tag I am trying to run happstack-tls server using certificate generated by certbot, ho...	[ 0.020263671875, 0.0147705078125, 0.00604248046875, 0.006591796875, -0.00958251953125, -0.01165771484375, -0.0130615234375, 0.00714111328125, -0.0164794921875, -0.0164794921875, 0.00005054473876953125, -0.017333984375, 0.01080322265625, 0.011474609375, -0.01220703125, 0.002716064453125,...	[ 208612, 590, 2594, 103527, 18499, 44691, 7909, 256, 6366, 35649, 9190, 1556, 142508, 24861, 53861, 397, 9016, 4836, 284, 1019, 162, 19, 418, 124374, 78292, 55957, 35133, 20602, 420, 84563, 820, 22799, 72508, 22687, 31577, 11675, 18, 8080, 1...	[ 0.2393798828125, 0.203125, 0.172119140625, 0.2061767578125, 0.1734619140625, 0.18994140625, 0.2138671875, 0.12939453125, 0.1558837890625, 0.124755859375, 0.181884765625, 0.08953857421875, 0.1820068359375, 0.1519775390625, 0.0260467529296875, 0.0181732177734375, 0.123291015625, 0.16...	embed
9306871_c1	9306871	haskell	1	v a) -> v a -> a foo = fold (+) 1 Looks fairly sane to me. Right? Wrong. > foo ((1::Int) :. ()) Couldn't match type `Int' with `()' When using functional dependencies to combine Fold (a :. ()) a, arising from the dependency `v -> a' in the instance declaration in `Data.Vec.Base' Fold (Int :. ()) (), arising from a use...	v a) -> v a -> a foo = fold (+) 1 Looks fairly sane to me. Right? Wrong. > foo ((1::Int) :. ()) Couldn't match type `Int' with `()' When using functional dependencies to combine Fold (a :. ()) a, arising from the dependency `v -> a' in the instance declaration in `Data.Vec.Base' Fold (Int :. ()) (), arising from a use...	[ -0.00836181640625, 0.003936767578125, -0.01055908203125, -0.01055908203125, 0.00182342529296875, -0.004119873046875, -0.0361328125, -0.005645751953125, -0.006134033203125, -0.0279541015625, -0.0191650390625, -0.022216796875, -0.003448486328125, 0.0184326171875, -0.017578125, -0.0327148...	[ 81, 10, 33079, 5775, 31, 2203, 42822, 22183, 106, 60818, 180663, 57, 86, 35133, 41600, 12, 4153, 18, 152, 191147, 14858, 10644, 678, 132, 123309, 42548, 117538, 70163, 30077, 71, 11, 187, 27771, 334, 110527, 21635, 137989, 856, 3240, 6347...	[ 0.207763671875, 0.13427734375, 0.14501953125, 0.219482421875, 0.2197265625, 0.044921875, 0.2255859375, 0.135986328125, 0.05145263671875, 0.051025390625, 0.0190582275390625, 0.0294036865234375, 0.036956787109375, 0.08544921875, 0.0958251953125, 0.04046630859375, 0.09149169921875, 0....	embed
9624655_c0	9624655	haskell	0	Title: How can i use haskell to check if a list contains the values in a tuple Problem title: How can i use haskell to check if a list contains the values in a tuple Tags: haskell Problem: How can i use haskell to check if a list contains the values in a tuple I am writing some functions for graphs in Haskell, and I wa...	How can i use haskell to check if a list contains the values in a tuple How can i use haskell to check if a list contains the values in a tuple haskell How Bool How can i use haskell to check if a list contains the values in a tuple I am writing some functions for graphs in Haskell, and I want to check if a list of int...	[ -0.00185394287109375, -0.00823974609375, -0.0015411376953125, 0.0264892578125, -0.01708984375, -0.00494384765625, 0.004486083984375, -0.0089111328125, 0.006622314453125, -0.0205078125, 0.00537109375, -0.021484375, -0.002471923828125, 0.0157470703125, -0.00445556640625, 0.00582885742187...	[ 11249, 831, 17, 4527, 1556, 142508, 12765, 2174, 5303, 70541, 142424, 23, 370, 8705, 7, 70, 2460, 929, 47, 32562, 32354, 41382, 20625, 892, 26255, 95378, 5170, 3249, 121303, 33636, 51776, 136, 30646, 29568, 106, 10, 1892, 31089, 9077, 364...	[ 0.042938232421875, 0.045684814453125, 0.039703369140625, 0.1290283203125, 0.1602783203125, 0.2481689453125, 0.2044677734375, 0.0970458984375, 0.2154541015625, 0.1519775390625, 0.1845703125, 0.083984375, 0.125732421875, 0.203369140625, 0.0255279541015625, 0.0252685546875, 0.0720214843...	embed
17292048_c0	17292048	haskell	0	Title: Segfault reading lazy bytestring past 2^18 bytes Problem title: Segfault reading lazy bytestring past 2^18 bytes Tags: ghc, bytestring, mmap, lazy-evaluation, haskell Problem: Segfault reading lazy bytestring past 2^18 bytes Consider the following code: http://hpaste.org/90394 I am memory mapping a large 460mb f...	Segfault reading lazy bytestring past 2^18 bytes Segfault reading lazy bytestring past 2^18 bytes ghc bytestring mmap lazy-evaluation haskell Segfault Segmentation Segfault reading lazy bytestring past 2^18 bytes Consider the following code: http://hpaste.org/90394 I am memory mapping a large 460mb file to a lazy ByteS...	[ 0.0223388671875, 0.01904296875, 0.0068359375, -0.0164794921875, 0.003265380859375, 0.0035552978515625, 0.005035400390625, 0.0228271484375, 0.00011014938354492188, -0.0213623046875, 0.0162353515625, -0.0208740234375, 0.0050048828125, 0.00830078125, 0.0174560546875, -0.000457763671875, ...	[ 38462, 1021, 7136, 16454, 21, 3285, 390, 67, 91693, 11015, 116, 8353, 1819, 31380, 238, 2631, 159258, 1556, 142508, 674, 137399, 18151, 134665, 5039, 161787, 98323, 291, 26783, 21334, 116773, 6492, 11435, 47, 3311, 71713, 214, 140909, 117729,...	[ 0.2008056640625, 0.1456298828125, 0.08209228515625, 0.19189453125, 0.15625, 0.199951171875, 0.1072998046875, 0.138916015625, 0.2005615234375, 0.134521484375, 0.117431640625, 0.06170654296875, 0.237060546875, 0.06396484375, 0.0687255859375, 0.08404541015625, 0.107177734375, 0.055389...	embed
17853232_c0	17853232	haskell	0	Title: Haskell newtype with parentheses Problem title: Haskell newtype with parentheses Tags: haskell, newtype Problem: Haskell newtype with parentheses I'm trying to understand the explaination in Monads made difficult and I have a hard time figuring out the following newtype definition: newtype (FComp g f) x = FComp ...	Haskell newtype with parentheses Haskell newtype with parentheses haskell newtype Haskell FComp Functor Haskell newtype with parentheses I'm trying to understand the explaination in Monads made difficult and I have a hard time figuring out the following newtype definition: I have nowhere seen an explaination of what ne...	[ -0.0106201171875, -0.017822265625, 0.0130615234375, 0.032470703125, 0.00191497802734375, 0.0230712890625, 0.00469970703125, -0.00182342529296875, 0.0289306640625, 0.015869140625, -0.00390625, -0.027099609375, -0.003997802734375, -0.0015106201171875, -0.01220703125, -0.010009765625, -...	[ 20625, 142508, 3525, 50986, 678, 49129, 35412, 1556, 563, 108161, 28670, 18770, 28219, 73342, 60331, 6468, 34844, 7941, 26747, 80934, 26950, 125195, 3687, 10644, 21635, 26366, 1238, 62346, 32354, 51, 10770, 78381, 44457, 97841, 42, 61924, 1284,...	[ 0.12646484375, 0.2310791015625, 0.17626953125, 0.313720703125, 0.06103515625, 0.113037109375, 0.1217041015625, 0.1209716796875, 0.1234130859375, 0.1815185546875, 0.089599609375, 0.0823974609375, 0.045166015625, 0.0919189453125, 0.1314697265625, 0.0975341796875, 0.032196044921875, 0...	embed
24876175_c0	24876175	haskell	0	Title: GHC options in cabal sandboxes Problem title: GHC options in cabal sandboxes Tags: haskell, ghc, cabal Problem: GHC options in cabal sandboxes I'm doing cabal builds in various sandboxes with different combinations of GHC options. The flags I'm interested in are -O2 , -O0 , -threaded , and -feager-blackholing . ...	GHC options in cabal sandboxes GHC options in cabal sandboxes haskell ghc cabal GHC cabal.config GHC options in cabal sandboxes I'm doing cabal builds in various sandboxes with different combinations of GHC options. The flags I'm interested in are -O2 , -O0 , -threaded , and -feager-blackholing . Firstly, for which of ...	[ 0.0034637451171875, -0.00579833984375, 0.01263427734375, -0.0115966796875, -0.006317138671875, -0.0137939453125, -0.01434326171875, 0.026611328125, 0.0033416748046875, 0.01611328125, -0.01239013671875, -0.01708984375, 0.000579833984375, -0.01611328125, -0.001434326171875, 0.02819824218...	[ 527, 73265, 50717, 23, 109524, 19096, 11728, 1556, 142508, 31380, 238, 153837, 45367, 162515, 49938, 7, 60892, 20, 670, 304, 2389, 39116, 2242, 33730, 151675, 497, 2069, 10422, 59911, 756, 98169, 2704, 71924, 18822, 297, 52490, 3126, 14192, ...	[ 0.1019287109375, 0.21240234375, 0.19873046875, 0.0103759765625, 0.252197265625, 0.1396484375, 0.171630859375, 0.0830078125, 0.1845703125, 0.115234375, 0.0977783203125, 0.14208984375, 0.1072998046875, 0.05218505859375, 0.2332763671875, 0.05267333984375, 0.0223236083984375, 0.0343017...	embed
40688286_c0	40688286	haskell	0	Title: Why Symbol's value as variable is void: haskell-mode-map? Problem title: Why Symbol's value as variable is void: haskell-mode-map? Tags: emacs, haskell Problem: Why Symbol's value as variable is void: haskell-mode-map? I am config a haskell environment with this installation-from-git-repository : (add-...	Why Symbol's value as variable is void: haskell-mode-map? Why Symbol's value as variable is void: haskell-mode-map? emacs haskell Why Symbol Info-default-directory-list Why Symbol's value as variable is void: haskell-mode-map? I am config a haskell environment with this installation-from-git-repository : and ...	[ -0.0091552734375, -0.00726318359375, 0.0166015625, -0.007598876953125, -0.0189208984375, 0.031005859375, -0.015625, 0.015625, 0.003326416015625, -0.00439453125, -0.00634765625, -0.030029296875, 0.017578125, 0.0157470703125, 0.003936767578125, -0.00970458984375, -0.0103759765625, -0...	[ 44084, 131899, 3768, 34292, 237, 77336, 83, 2292, 71, 1556, 142508, 61170, 62346, 352, 2263, 7, 14048, 214810, 80581, 30675, 6562, 153837, 65998, 59720, 161063, 15769, 22799, 56136, 9803, 18499, 831, 7026, 3173, 98169, 9879, 33120, 162711, 45...	[ 0.10791015625, 0.275634765625, 0.091064453125, 0.210205078125, 0.0833740234375, 0.26611328125, 0.025177001953125, 0.1898193359375, 0.1209716796875, 0.1251220703125, 0.218505859375, 0.164306640625, 0.2066650390625, 0.087158203125, 0.1578369140625, 0.0938720703125, 0.1844482421875, 0...	embed
5073058_c0	5073058	haskell	0	Title: haskell function declaration Problem title: haskell function declaration Tags: haskell Problem: haskell function declaration I have been playing around with haskell and I found out that if I write the following function in a code file: f :: Int -> [a] -> a f idx str = last $ (take . succ) idx str then this works...	haskell function declaration haskell function declaration haskell Couldn haskell function declaration I have been playing around with haskell and I found out that if I write the following function in a code file: then this works totally fine. Naturally, I figured the code would look better without the arguments. But th...	[ 0.0169677734375, 0.00274658203125, -0.0015411376953125, 0.00131988525390625, -0.0162353515625, -0.0018463134765625, 0.000904083251953125, -0.01470947265625, 0.0003223419189453125, -0.0162353515625, 0.003509521484375, -0.00537109375, -0.016845703125, -0.004302978515625, 0.01220703125, 0...	[ 1556, 142508, 32354, 21635, 191147, 19, 75169, 33022, 25632, 18151, 11435, 903, 43240, 112668, 5885, 6713, 11522, 15490, 10750, 139392, 18499, 9790, 72367, 3934, 706, 1861, 190355, 88996, 297, 351, 13, 5809 ]	[ 0.1400146484375, 0.239990234375, 0.1973876953125, 0.1851806640625, 0.1141357421875, 0.116455078125, 0.00830078125, 0.0772705078125, 0.1036376953125, 0.12158203125, 0.089111328125, 0.01507568359375, 0.0604248046875, 0.0152435302734375, 0.047698974609375, 0.0667724609375, 0.02262878417...	embed
54078660_c0	54078660	haskell	0	Title: List operations on own types consisting of one list Problem title: List operations on own types consisting of one list Tags: ghci, haskell Problem: List operations on own types consisting of one list I got the type " Signal " that is only a list of doubles and I want to use normal list-operations like on a nativ...	List operations on own types consisting of one list List operations on own types consisting of one list ghci haskell List Signal Double Show take2 Couldn List operations on own types consisting of one list I got the type " Signal " that is only a list of doubles and I want to use normal list-operations like on a native...	[ 0.00787353515625, 0.00860595703125, -0.0032196044921875, -0.003265380859375, -0.018310546875, -0.004913330078125, -0.0135498046875, 0.0279541015625, 0.01214599609375, -0.0118408203125, -0.01025390625, -0.0184326171875, -0.004486083984375, -0.0018768310546875, -0.02685546875, -0.0014648...	[ 32036, 41018, 98, 10002, 52895, 58055, 1632, 5303, 31380, 318, 1556, 142508, 144000, 107172, 17367, 5646, 304, 191147, 19, 7, 214, 111, 10644, 4734, 41929, 3444, 4527, 3638, 21473, 1884, 24, 4935, 8331, 34, 2661, 5608, 7722, 1660, 23742, ...	[ 0.231201171875, 0.2095947265625, 0.051300048828125, 0.1448974609375, 0.2266845703125, 0.1083984375, 0.12060546875, 0.209228515625, 0.0711669921875, 0.08734130859375, 0.0938720703125, 0.1973876953125, 0.227783203125, 0.1563720703125, 0.1456298828125, 0.1854248046875, 0.1953125, 0.08...	embed
19673383_c0	19673383	haskell	0	Title: How does one use monadic properties in SmallCheck? Problem title: How does one use monadic properties in SmallCheck? Tags: testing, smallcheck, monads, haskell Problem: How does one use monadic properties in SmallCheck? I would like to write a SmallCheck property that uses IO, but I can't figure out how I am sup...	How does one use monadic properties in SmallCheck? How does one use monadic properties in SmallCheck? testing smallcheck monads haskell How SmallCheck Testable Bool How does one use monadic properties in SmallCheck? I would like to write a SmallCheck property that uses IO, but I can't figure out how I am supposed to do...	[ -0.009521484375, -0.00160980224609375, 0.0208740234375, 0.003082275390625, 0.0054931640625, 0.015869140625, -0.008544921875, -0.03466796875, -0.00421142578125, -0.02587890625, -0.002593994140625, -0.022216796875, -0.010986328125, 0.0159912109375, 0.0128173828125, 0.0047607421875, -0....	[ 11249, 14602, 1632, 4527, 2667, 11, 18403, 183871, 23, 105508, 202567, 134234, 19336, 78292, 712, 1556, 142508, 8647, 2886, 2460, 929, 1884, 33022, 57266, 17780, 26366, 3642, 134598, 69236, 110527, 61590, 3034, 10752, 1264, 160328, 18244, 2965,...	[ 0.11962890625, 0.00689697265625, 0.0220184326171875, 0.166748046875, 0.147705078125, 0.1290283203125, 0.1805419921875, 0.2159423828125, 0.027587890625, 0.180419921875, 0.30224609375, 0.1865234375, 0.133056640625, 0.2626953125, 0.14697265625, 0.08087158203125, 0.1920166015625, 0.166...	embed
63036177_c0	63036177	haskell	0	Title: What is wrong with my Longest Common Subsequence Haskell function? Problem title: What is wrong with my Longest Common Subsequence Haskell function? Tags: haskell, dynamic-programming Problem: What is wrong with my Longest Common Subsequence Haskell function? I've been following Haskell tutorials online, and I t...	What is wrong with my Longest Common Subsequence Haskell function? What is wrong with my Longest Common Subsequence Haskell function? haskell dynamic-programming What Longest Common Subsequence Haskell What is wrong with my Longest Common Subsequence Haskell function? I've been following Haskell tutorials online, and I...	[ 0.01416015625, 0.0302734375, -0.00396728515625, 0.0081787109375, 0.01409912109375, 0.007720947265625, -0.007171630859375, 0.01531982421875, -0.01141357421875, 0, -0.00125885009765625, -0.01446533203125, 0.0040283203125, 0.025146484375, 0.015625, -0.0037689208984375, 0.01513671875, ...	[ 4865, 83, 44691, 678, 759, 14407, 525, 151301, 8273, 184, 944, 3956, 20625, 142508, 32354, 1556, 84079, 28966, 25632, 57143, 1118, 5351, 6183, 21185, 10336, 46741, 23, 217, 4568, 756, 88303, 73, 17569, 3034, 33022, 234873, 1632, 13315, 1815...	[ 0.07232666015625, 0.063232421875, 0.20361328125, 0.09039306640625, 0.0831298828125, 0.1510009765625, 0.178466796875, 0.1956787109375, 0.1666259765625, 0.14208984375, 0.1387939453125, 0.0333251953125, 0.1295166015625, 0.2340087890625, 0.1954345703125, 0.09112548828125, 0.1083984375, ...	embed
36658890_c0	36658890	haskell	0	Title: Is there a way to use print with the formats of printf in Haskell? Problem title: Is there a way to use print with the formats of printf in Haskell? Tags: haskell, functional-programming Problem: Is there a way to use print with the formats of printf in Haskell? On my quest to acquire further experience in Haske...	Is there a way to use print with the formats of printf in Haskell? Is there a way to use print with the formats of printf in Haskell? haskell functional-programming Haskell Is there a way to use print with the formats of printf in Haskell? On my quest to acquire further experience in Haskell, I started working with pri...	[ -0.0101318359375, 0.004302978515625, 0.00506591796875, -0.000698089599609375, -0.00335693359375, 0.006561279296875, -0.00762939453125, 0.004913330078125, 0.0098876953125, 0.0250244140625, 0.005279541015625, -0.0284423828125, -0.002593994140625, -0.028564453125, -0.01611328125, -0.01208...	[ 2071, 2685, 3917, 4527, 28412, 678, 9384, 7, 420, 23, 20625, 142508, 10, 111, 1556, 123309, 28966, 38694, 16981, 20697, 136, 9790, 10298, 40368, 4034, 36663, 3949, 1328, 5, 617, 91084, 156672, 28875, 7941, 53, 17368, 37842, 101089, 99156, ...	[ 0.00677490234375, 0.02899169921875, 0.093994140625, 0.1416015625, 0.272705078125, 0.1431884765625, 0.2208251953125, 0.009796142578125, 0.2188720703125, 0.042724609375, 0.1182861328125, 0.2470703125, 0.0175628662109375, 0.01275634765625, 0.07159423828125, 0.09375, 0.0193634033203125, ...	embed
65692148_c0	65692148	haskell	0	Title: Haskell instance: how could this be some valid code? Problem title: Haskell instance: how could this be some valid code? Tags: haskell Problem: Haskell instance: how could this be some valid code? While I was writing a small example of the Show instance, I had made an indentation error: module Main where data B=...	Haskell instance: how could this be some valid code? Haskell instance: how could this be some valid code? haskell Haskell Main Show example.hs Haskell instance: how could this be some valid code? While I was writing a small example of the Show instance, I had made an indentation error: Where, clearly, the working code ...	[ 0.0030670166015625, -0.016845703125, 0.00665283203125, 0.021728515625, -0.003387451171875, 0.0194091796875, -0.01385498046875, -0.0162353515625, 0.00579833984375, -0.01275634765625, -0.016357421875, -0.007049560546875, 0.01373291015625, 0.019287109375, 0.0113525390625, -0.0062561035156...	[ 20625, 142508, 110527, 3642, 5809, 903, 186, 3060, 35604, 18151, 12, 1556, 12321, 17367, 27781, 127, 32562, 19336, 7228, 18597, 22062, 18499, 123019, 70, 20697, 509, 41206, 9969, 1340, 5117, 64457, 11675, 134620, 7, 177261, 645, 118664, 44084...	[ 0.1199951171875, 0.2218017578125, 0.2391357421875, 0.0872802734375, 0.10986328125, 0.1175537109375, 0.07318115234375, 0.047149658203125, 0.18603515625, 0.2047119140625, 0.00469970703125, 0.09027099609375, 0.07421875, 0.185791015625, 0.157958984375, 0.1075439453125, 0.000946044921875,...	embed
55559896_c0	55559896	haskell	0	Title: How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? Problem title: How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? Tags: haskell, haskell-lucid Problem: How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? How can I parse an html s...	How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? haskell haskell-lucid How HTML Haskell Lucid Test How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? How can I parse an html string for ...	[ -0.01202392578125, 0.0172119140625, -0.005615234375, 0.00897216796875, -0.018798828125, 0.007110595703125, 0.000720977783203125, -0.02587890625, -0.003692626953125, -0.05322265625, 0.013427734375, -0.031005859375, -0.01165771484375, 0.0009307861328125, 0.017333984375, 0.003509521484375...	[ 11249, 47, 352, 13482, 61799, 1294, 84079, 19097, 23351, 214, 3934, 20625, 142508, 3768, 51181, 71, 572, 18, 7237, 10644, 1556, 71865, 8647, 831, 366, 184, 7693, 79315, 27781, 254, 111337, 765, 117176, 34292, 2806, 21373, 915, 454, 3444, ...	[ 0.061492919921875, 0.013458251953125, 0.0936279296875, 0.2169189453125, 0.1641845703125, 0.0670166015625, 0.203857421875, 0.25146484375, 0.2130126953125, 0.13427734375, 0.1202392578125, 0.12548828125, 0.2333984375, 0.059051513671875, 0.173828125, 0.1553955078125, 0.06646728515625, ...	embed
10417821_c0	10417821	haskell	0	Title: Partitioning different types of terms during parsing Problem title: Partitioning different types of terms during parsing Tags: haskell, parsec, parsing Problem: Partitioning different types of terms during parsing I have two parsers for different types of terms. a :: Parser A b :: Parser B I have a data type rep...	Partitioning different types of terms during parsing Partitioning different types of terms during parsing haskell parsec parsing Partitioning Parser Char StateT Partitioning different types of terms during parsing I have two parsers for different types of terms. I have a data type representing sequences of these terms....	[ 0.01031494140625, 0.0076904296875, -0.01141357421875, 0.0267333984375, -0.01470947265625, 0.01483154296875, 0.00029754638671875, -0.00970458984375, -0.005126953125, -0.0069580078125, -0.005096435546875, 0.02490234375, 0.00054168701171875, 0.0191650390625, -0.017822265625, 0.00280761718...	[ 9148, 1363, 12921, 52895, 69407, 20271, 366, 6953, 1556, 142508, 39797, 2392, 2189, 21656, 22836, 618, 6626, 7, 1314, 2053, 10644, 33636, 26513, 4263, 107730, 944, 17664, 4127, 3917, 32562, 501, 1984, 313, 84797, 62, 91, 1295, 335, 9498, ...	[ 0.2169189453125, 0.151123046875, 0.1590576171875, 0.206298828125, 0.213134765625, 0.113037109375, 0.1636962890625, 0.10791015625, 0.12255859375, 0.2127685546875, 0.1605224609375, 0.1529541015625, 0.146484375, 0.1376953125, 0.1502685546875, 0.1539306640625, 0.092041015625, 0.0722656...	embed
24468061_c0	24468061	haskell	0	Title: Are there infinite lists with unboxed vector performance? Problem title: Are there infinite lists with unboxed vector performance? Tags: signal-processing, lazy-evaluation, haskell Problem: Are there infinite lists with unboxed vector performance? I'm thinking specifically for signal processing. Let's say I want...	Are there infinite lists with unboxed vector performance? Are there infinite lists with unboxed vector performance? signal-processing lazy-evaluation haskell Are there infinite lists with unboxed vector performance? I'm thinking specifically for signal processing. Let's say I wanted to do something like double the magn...	[ 0.00872802734375, 0.024658203125, -0.0079345703125, -0.01202392578125, -0.011474609375, -0.004150390625, 0.00811767578125, -0.0260009765625, 0.010009765625, -0.044677734375, -0.00372314453125, -0.006317138671875, 0.029296875, 0.00469970703125, -0.0274658203125, 0.01348876953125, -0.0...	[ 15901, 2685, 54241, 13, 5303, 7, 678, 51, 11728, 297, 173, 18770, 23718, 26073, 63923, 21, 3285, 159258, 1556, 142508, 47644, 9433, 36663, 41929, 101668, 277, 3444, 4552, 4271, 34658, 22832, 12282, 98323, 22834, 22230, 5809, 738, 98, 49919,...	[ 0.0175018310546875, 0.0609130859375, 0.1785888671875, 0.12060546875, 0.242431640625, 0.07171630859375, 0.0413818359375, 0.1207275390625, 0.20849609375, 0.0645751953125, 0.1727294921875, 0.15771484375, 0.1981201171875, 0.171630859375, 0.051300048828125, 0.0243682861328125, 0.100463867...	embed
76928070_c0	76928070	haskell	0	Title: Configure/disable request logging in yesod Problem title: Configure/disable request logging in yesod Tags: haskell, yesod Problem: Configure/disable request logging in yesod Using yesod 1.6.2.1, when creating a new application (regardless of whether using the scaffolding or using the builtin warp port foundation...	Configure/disable request logging in yesod Configure/disable request logging in yesod haskell yesod Configure Aug GET HTTP Yesod Configure/disable request logging in yesod Using yesod 1.6.2.1, when creating a new application (regardless of whether using the scaffolding or using the builtin warp port foundation ), you g...	[ -0.01214599609375, 0.028564453125, 0.01513671875, -0.017333984375, -0.00225830078125, 0.0255126953125, -0.0185546875, -0.0037078857421875, -0.01025390625, 0.019287109375, 0.00830078125, -0.011474609375, -0.01275634765625, 0.0036773681640625, -0.006103515625, -0.022216796875, -0.00451...	[ 59994, 3827, 2886, 50336, 459, 36659, 2422, 23722, 23, 1556, 142508, 23177, 79794, 135913, 32635, 2199, 51748, 68107, 105233, 3525, 38415, 42822, 88303, 73, 1631, 254, 11469, 137374, 2046, 12684, 1884, 903, 1957, 7440, 222495, 10644, 67413, 6...	[ 0.1654052734375, 0.079833984375, 0.1463623046875, 0.20263671875, 0.128662109375, 0.1494140625, 0.1597900390625, 0.235595703125, 0.011138916015625, 0.0657958984375, 0.17919921875, 0.1285400390625, 0.1025390625, 0.1304931640625, 0.174072265625, 0.2181396484375, 0.1484375, 0.113037109...	embed
25235402_c0	25235402	haskell	0	Title: Specifying a dependency constraint in a cabal file Problem title: Specifying a dependency constraint in a cabal file Tags: haskell, cabal Problem: Specifying a dependency constraint in a cabal file A bug in using the latest attoparsec with hedis needs hedis to be installed in the following way: cabal install hed...	Specifying a dependency constraint in a cabal file Specifying a dependency constraint in a cabal file haskell cabal Specifying zeromq4-haskell Specifying a dependency constraint in a cabal file A bug in using the latest attoparsec with hedis needs hedis to be installed in the following way: so that it doesn't use the l...	[ -0.0032196044921875, 0.0034942626953125, 0.00145721435546875, 0.003753662109375, 0.0026702880859375, 0.010986328125, -0.0084228515625, 0.003173828125, 0.0164794921875, 0.0037689208984375, -0.01092529296875, -0.03759765625, 0.002685546875, 0.00457763671875, 0.00090789794921875, 0.006378...	[ 24990, 151138, 42548, 27771, 158, 2816, 4288, 109524, 11435, 1556, 142508, 45234, 39, 864, 35748, 10557, 54608, 17368, 70, 42850, 243, 31, 2500, 39797, 764, 3827, 27117, 186, 20600, 297, 25632, 3917, 18, 4527, 11389, 3714, 3900, 19309, 3934...	[ 0.164794921875, 0.044769287109375, 0.1993408203125, 0.08184814453125, 0.07843017578125, 0.1590576171875, 0.083740234375, 0.248291015625, 0.151123046875, 0.1256103515625, 0.204833984375, 0.1319580078125, 0.009490966796875, 0.081298828125, 0.109375, 0.1094970703125, 0.1556396484375, ...	embed
4996514_c1	4996514	haskell	1	.Monad import Data.Char (isSpace) import Text.ParserCombinators.Parsec data Node = Node { level :: Int, keyword :: Maybe String, heading :: String, tags :: Maybe [String] } deriving (Show) parseNode = Node <$> level <> (optionMaybe keyword) <> name <> (optionMaybe tags) where level = length <$> many1 (char '') <* s...	.Monad import Data.Char (isSpace) import Text.ParserCombinators.Parsec data Node = Node { level :: Int, keyword :: Maybe String, heading :: String, tags :: Maybe [String] } deriving (Show) parseNode = Node <$> level <> (optionMaybe keyword) <> name <> (optionMaybe tags) where level = length <$> many1 (char '') <* s...	[ -0.023681640625, -0.00799560546875, -0.01177978515625, 0.018798828125, 0.0181884765625, 0.022216796875, -0.01220703125, -0.032470703125, 0.01116943359375, -0.00372314453125, 0.00811767578125, -0.000606536865234375, -0.0223388671875, 0.005889892578125, -0.02294921875, 0.002777099609375,...	[ 5, 46674, 712, 24927, 11809, 84068, 164, 141012, 16, 24129, 28636, 2189, 10770, 19155, 22230, 39797, 2053, 438, 112, 2203, 17366, 18, 166117, 83425, 23351, 10336, 214, 69141, 71713, 16406, 6496, 168660, 366, 184, 5021, 109585, 82419, 372, 9...	[ 0.0904541015625, 0.1903076171875, 0.2293701171875, 0.2188720703125, 0.1239013671875, 0.1771240234375, 0.152587890625, 0.2415771484375, 0.017425537109375, 0.16259765625, 0.1185302734375, 0.0830078125, 0.010772705078125, 0.1866455078125, 0.1263427734375, 0.18701171875, 0.1600341796875,...	embed
71197765_c0	71197765	haskell	0	Title: Running this Haskell code in Powershell does nothing Problem title: Running this Haskell code in Powershell does nothing Tags: haskell Problem: Running this Haskell code in Powershell does nothing I'm learning Haskell for a school project and am going through Hudak's Haskell School of Expression . I have written...	Running this Haskell code in Powershell does nothing Running this Haskell code in Powershell does nothing haskell Running Haskell Powershell Float test.exe Running this Haskell code in Powershell does nothing I'm learning Haskell for a school project and am going through Hudak's Haskell School of Expression . I have wr...	[ 0.0213623046875, 0.00506591796875, 0.007659912109375, 0.0230712890625, -0.006011962890625, 0.0233154296875, 0.001861572265625, -0.00958251953125, -0.00811767578125, -0.0111083984375, -0.007080078125, 0.006317138671875, -0.0125732421875, 0.00787353515625, 0.0230712890625, 0.012756347656...	[ 28398, 903, 20625, 142508, 18151, 23, 17170, 128019, 14602, 33720, 592, 1556, 38699, 257, 3034, 46480, 52080, 10696, 13452, 74151, 344, 19188, 111, 25129, 59121, 25632, 3293, 9969, 1340, 5885, 3642, 54, 20653, 11675, 442, 10644, 3934, 6954, ...	[ 0.1351318359375, 0.10687255859375, 0.1265869140625, 0.22802734375, 0.1724853515625, 0.059906005859375, 0.1419677734375, 0.2388916015625, 0.06884765625, 0.1734619140625, 0.01898193359375, 0.111083984375, 0.176025390625, 0.0672607421875, 0.210205078125, 0.122802734375, 0.036865234375, ...	embed
17329083_c0	17329083	haskell	0	Title: Javascript lazy evaluation fibonacci function Problem title: Javascript lazy evaluation fibonacci function Tags: haskell, javascript, lazy-evaluation Problem: Javascript lazy evaluation fibonacci function I asked a question before about using lazy evaluation in Scala. I was trying to write the following Haskell ...	Javascript lazy evaluation fibonacci function Javascript lazy evaluation fibonacci function haskell javascript lazy-evaluation RangeError Javascript console.log Maximum Javascript lazy evaluation fibonacci function I asked a question before about using lazy evaluation in Scala. I was trying to write the following Haske...	[ 0.004913330078125, 0.0264892578125, -0.0028839111328125, -0.00958251953125, 0.01220703125, 0.00147247314453125, 0.00958251953125, 0.01214599609375, -0.003936767578125, -0.03515625, -0.000362396240234375, -0.021484375, 0.00147247314453125, 0.00750732421875, 0.0301513671875, 0.0152587890...	[ 74181, 21, 3285, 219836, 809, 20990, 52544, 32354, 1556, 142508, 136951, 159258, 142462, 18468, 130250, 4867, 46540, 316, 17368, 152653, 11, 31577, 33022, 25632, 20625, 69427, 18, 4527, 32036, 5608, 43257, 115061, 5701, 13580, 3900, 143, 37842,...	[ 0.2381591796875, 0.166015625, 0.2269287109375, 0.208984375, 0.105712890625, 0.1231689453125, 0.1470947265625, 0.1683349609375, 0.10211181640625, 0.2327880859375, 0.2109375, 0.1898193359375, 0.1353759765625, 0.08538818359375, 0.1461181640625, 0.12939453125, 0.158447265625, 0.0407714...	embed
49962583_c0	49962583	haskell	0	Title: Extracting elements from the start of a list in Haskell without the builtin function Problem title: Extracting elements from the start of a list in Haskell without the builtin function Tags: haskell Problem: Extracting elements from the start of a list in Haskell without the builtin function I want to write a fu...	Extracting elements from the start of a list in Haskell without the builtin function Extracting elements from the start of a list in Haskell without the builtin function haskell the Extracting Haskell x:xs n-1 Extracting elements from the start of a list in Haskell without the builtin function I want to write a functio...	[ 0.00946044921875, 0.00179290771484375, 0.0034637451171875, 0.008544921875, -0.00084686279296875, 0.01373291015625, 0.002197265625, -0.00144195556640625, 0.0189208984375, -0.024658203125, 0.028076171875, -0.0274658203125, 0.0012359619140625, 0.01104736328125, -0.005828857421875, -0.0068...	[ 31501, 238, 1916, 80854, 1295, 4034, 5303, 20625, 142508, 15490, 88303, 73, 32354, 111, 1556, 1022, 12, 425, 7, 653, 5759, 70, 23, 3444, 33022, 125663, 14012, 78219, 43240, 831, 48903, 5646, 18151, 9969, 25720, 5885, 3034, 27781, 30646, 1...	[ 0.1973876953125, 0.10400390625, 0.07025146484375, 0.2044677734375, 0.1058349609375, 0.16796875, 0.1710205078125, 0.158447265625, 0.23583984375, 0.1480712890625, 0.1207275390625, 0.100341796875, 0.177734375, 0.06768798828125, 0.1456298828125, 0.05499267578125, 0.013397216796875, 0.0...	embed
50781571_c0	50781571	haskell	0	Title: Append a delay to each chunk with the streaming library? Problem title: Append a delay to each chunk with the streaming library? Tags: haskell, haskell-streaming Problem: Append a delay to each chunk with the streaming library? newbie to Streaming and Haskell here. I've been playing around with the streaming lib...	Append a delay to each chunk with the streaming library? Append a delay to each chunk with the streaming library? haskell haskell-streaming Append S.print S.delay S.each S.maps Append a delay to each chunk with the streaming library? newbie to Streaming and Haskell here. I've been playing around with the streaming libr...	[ 0.005584716796875, 0.002960205078125, 0.03173828125, -0.0240478515625, -0.003265380859375, -0.00045013427734375, 0.007415771484375, -0.017333984375, 0.00921630859375, -0.0147705078125, -0.0009613037109375, -0.024658203125, 0.0208740234375, 0.01611328125, -0.0062255859375, 0.01312255859...	[ 5659, 3611, 10, 8, 5259, 47, 12638, 7839, 92, 678, 65296, 35773, 1294, 1556, 142508, 86429, 159, 35662, 112, 41581, 62346, 9014, 163274, 136, 20625, 75169, 60892, 100094, 1224, 2831, 65508, 7103, 12830, 3444, 765, 11907, 17932, 37842, 1284,...	[ 0.1102294921875, 0.095458984375, 0.03704833984375, 0.1800537109375, 0.270751953125, 0.10693359375, 0.14599609375, 0.1947021484375, 0.158447265625, 0.092529296875, 0.2196044921875, 0.16796875, 0.095458984375, 0.08056640625, 0.205078125, 0.12255859375, 0.057403564453125, 0.1429443359...	embed
53015583_c0	53015583	haskell	0	Title: How to use a ZMQ subscriber in Haskell with pipes Problem title: How to use a ZMQ subscriber in Haskell with pipes Tags: zeromq, haskell, haskell-pipes Problem: How to use a ZMQ subscriber in Haskell with pipes fromZMQ :: (Receiver r) => Socket z r -> Producer String (ZMQ z) () fromZMQ sock = do msg <- lift $ re...	How to use a ZMQ subscriber in Haskell with pipes How to use a ZMQ subscriber in Haskell with pipes zeromq haskell haskell-pipes Control.Monad Pipes qualified System.ZMQ4.Monadic How ZMQ Haskell LANGUAGE OverloadedStrings Main Pipes.Prelude Data.ByteString.Char8 Receiver Socket Producer CS.unpack Sub P.take P.print How...	[ 0.00970458984375, 0.0020599365234375, -0.0089111328125, 0.0177001953125, -0.000579833984375, 0.0057373046875, -0.0225830078125, -0.0224609375, -0.016357421875, -0.052978515625, -0.0208740234375, 0.00592041015625, 0.038330078125, 0.0098876953125, 0.000640869140625, 0.004730224609375, ...	[ 11249, 4527, 567, 594, 2737, 1614, 34601, 42, 20625, 142508, 678, 137158, 10, 45234, 39, 864, 1556, 1434, 13569, 27131, 46674, 712, 93128, 90, 217225, 1511, 617, 18403, 3358, 98064, 9578, 63033, 71713, 12321, 822, 11809, 84068, 1019, 93908,...	[ 0.016357421875, 0.1343994140625, 0.1439208984375, 0.152099609375, 0.2017822265625, 0.13525390625, 0.188720703125, 0.1300048828125, 0.148193359375, 0.224853515625, 0.117431640625, 0.19091796875, 0.0341796875, 0.1136474609375, 0.07379150390625, 0.141845703125, 0.107666015625, 0.11877...	embed
28288118_c0	28288118	haskell	0	Title: How to know maximum at an irregular tree? Problem title: How to know maximum at an irregular tree? Tags: haskell Problem: How to know maximum at an irregular tree? I have an irregularly defined tree, how can i run through it and find the maximum value in it? My strategy was to build a list and take out the bigge...	How to know maximum at an irregular tree? How to know maximum at an irregular tree? haskell How Node Empty TreeIrr ArvIrr How to know maximum at an irregular tree? I have an irregularly defined tree, how can i run through it and find the maximum value in it? My strategy was to build a list and take out the bigger value...	[ -0.016357421875, 0.00518798828125, -0.008056640625, -0.0045166015625, 0.00726318359375, 0.0296630859375, -0.0196533203125, -0.0172119140625, 0.005645751953125, -0.03955078125, 0.002716064453125, -0.01287841796875, -0.006622314453125, -0.004913330078125, 0.03662109375, -0.025146484375, ...	[ 11249, 47, 3714, 38132, 99, 105843, 53201, 1556, 142508, 438, 112, 31678, 939, 101344, 29161, 1172, 61924, 3642, 11675, 8305, 7413, 34292, 23, 113857, 5303, 167785, 2967, 2394, 6635, 1360, 25737, 7108, 1022, 45646, 134598, 37317, 297, 2965 ]	[ 0.043975830078125, 0.0162506103515625, 0.1064453125, 0.2169189453125, 0.084228515625, 0.23046875, 0.1929931640625, 0.060394287109375, 0.15966796875, 0.08270263671875, 0.1107177734375, 0.130615234375, 0.08447265625, 0.108154296875, 0.033599853515625, 0.00384521484375, 0.10693359375, ...	embed
28631065_c0	28631065	haskell	0	Title: Is there an AsValue instance for nested Vectors of Aeson Values? Problem title: Is there an AsValue instance for nested Vectors of Aeson Values? Tags: haskell, aeson Problem: Is there an AsValue instance for nested Vectors of Aeson Values? I'm trying to get the feel of aeson package. Am I using its Lens API inco...	Is there an AsValue instance for nested Vectors of Aeson Values? Is there an AsValue instance for nested Vectors of Aeson Values? haskell aeson a AsValue Vectors Aeson Values Lens _Array Maybe vector-0.10.12.2:Data.Vector.Vector Value Is there an AsValue instance for nested Vectors of Aeson Values? I'm trying to get th...	[ -0.013916015625, 0.0035858154296875, -0.003814697265625, -0.001068115234375, -0.01434326171875, 0.00665283203125, 0.003662109375, -0.024658203125, -0.004669189453125, 0.00095367431640625, 0.0047607421875, 0.026123046875, 0.004974365234375, -0.0069580078125, 0.0003108978271484375, -0.01...	[ 2071, 2685, 142, 1301, 856, 50770, 110527, 100, 8512, 71, 52884, 22230, 111, 62, 90, 191, 190060, 1556, 142508, 10, 18226, 7, 7614, 7092, 83425, 173, 18770, 10179, 70147, 137989, 26455, 12319, 98169, 17368, 61687, 214552 ]	[ 0.042327880859375, 0.089599609375, 0.103759765625, 0.1776123046875, 0.213623046875, 0.272705078125, 0.2476806640625, 0.06591796875, 0.2037353515625, 0.093994140625, 0.1927490234375, 0.1417236328125, 0.05987548828125, 0.0838623046875, 0.1263427734375, 0.184326171875, 0.22412109375, ...	embed
19773785_c0	19773785	haskell	0	Title: Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? Problem title: Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? Tags: haskell, parsec, parsing Problem: Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integer...	Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? haskell parsec parsing Haskell Parsec Word8 Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? I wrote the fol...	[ 0.009033203125, 0.00186920166015625, 0.0140380859375, 0.057373046875, -0.015380859375, 0.03564453125, -0.0103759765625, -0.02587890625, 0.01007080078125, 0.01373291015625, -0.0169677734375, -0.030029296875, 0.0091552734375, 0.0133056640625, -0.02685546875, -0.00087738037109375, 0.004...	[ 2071, 2685, 99156, 3917, 33022, 903, 20625, 142508, 2392, 39797, 366, 2189, 100, 15045, 3137, 32380, 2749, 892, 26255, 142, 1556, 6953, 22543, 1019, 47, 54397, 25632, 18151, 8, 40899, 7986, 33636, 309, 31304, 831, 12319, 20016, 33 ]	[ 0.01129150390625, 0.0421142578125, 0.1927490234375, 0.0894775390625, 0.1669921875, 0.091552734375, 0.133056640625, 0.23193359375, 0.139404296875, 0.2457275390625, 0.1580810546875, 0.1885986328125, 0.0791015625, 0.1732177734375, 0.138671875, 0.1456298828125, 0.093505859375, 0.106262...	embed
74755452_c0	74755452	haskell	0	Title: Create a function with take the first n and last n elements Problem title: Create a function with take the first n and last n elements Tags: function, haskell Problem: Create a function with take the first n and last n elements I want to create a function that keep the first n as well as the last n elements are,...	Create a function with take the first n and last n elements Create a function with take the first n and last n elements function haskell Create x:xs Vorraussetzung Create a function with take the first n and last n elements I want to create a function that keep the first n as well as the last n elements are, all other ...	[ -0.001953125, 0.0123291015625, 0.0005035400390625, -0.003875732421875, -0.015625, 0.01806640625, 0.01806640625, -0.0081787109375, 0.0123291015625, 0.00628662109375, 0.01318359375, -0.0159912109375, 0.01214599609375, -0.00372314453125, 0.002532958984375, 0.0142822265625, 0.009765625, ...	[ 151313, 32354, 678, 5646, 5117, 653, 136, 4568, 80854, 1556, 142508, 1022, 12, 425, 7, 4855, 219, 223, 91052, 3444, 28282, 13695, 237, 5299, 621, 756, 3789, 36069, 20051, 4263, 40715, 105950, 116, 19, 93544, 6528, 75101, 3501, 707, 132283...	[ 0.1422119140625, 0.229248046875, 0.08404541015625, 0.17919921875, 0.11181640625, 0.146240234375, 0.09454345703125, 0.174560546875, 0.2044677734375, 0.1473388671875, 0.228271484375, 0.064697265625, 0.0187835693359375, 0.0838623046875, 0.062255859375, 0.09942626953125, 0.0584716796875,...	embed
8564921_c0	8564921	haskell	0	Title: Parsec match single unicode character Problem title: Parsec match single unicode character Tags: parsec, unicode, haskell Problem: Parsec match single unicode character I'm trying to create a parser (with parsec), that parses tokens, delimited by newlines, commas, semicolons and unicode dashes (ndash and mdash):...	Parsec match single unicode character Parsec match single unicode character parsec unicode haskell Parsec many1 Parsec match single unicode character I'm trying to create a parser (with parsec), that parses tokens, delimited by newlines, commas, semicolons and unicode dashes (ndash and mdash): But the ndash-mdash (\821...	[ -0.010009765625, 0.01202392578125, 0.01300048828125, 0.0250244140625, -0.0164794921875, 0.005889892578125, 0.0179443359375, -0.00628662109375, 0.0023040771484375, -0.017822265625, -0.0028228759765625, -0.026123046875, 0.007659912109375, -0.00982666015625, -0.021484375, -0.0072937011718...	[ 2392, 39797, 14858, 11001, 60347, 112, 62816, 366, 1556, 142508, 5941, 418, 31577, 28282, 2189, 76228, 5908, 47, 84694, 93343, 3525, 59801, 375, 1510, 36137, 22796, 48, 114942, 1127, 1495, 136, 155892, 4966, 653, 41872, 12012, 1530, 63258, ...	[ 0.167724609375, 0.25390625, 0.18505859375, 0.1778564453125, 0.1929931640625, 0.1412353515625, 0.168701171875, 0.17724609375, 0.123779296875, 0.2000732421875, 0.157470703125, 0.068359375, 0.0251007080078125, 0.0806884765625, 0.164306640625, 0.04034423828125, 0.0111083984375, 0.07476...	embed
63008058_c0	63008058	haskell	0	Title: how do you determine if a type is a functor or not in haskell? Problem title: how do you determine if a type is a functor or not in haskell? Tags: functor, haskell Problem: how do you determine if a type is a functor or not in haskell? I have a data type: data Tree a = Leaf \| Branch a (Tree a) (Tree a) I want to...	how do you determine if a type is a functor or not in haskell? how do you determine if a type is a functor or not in haskell? functor haskell Tree Leaf Branch how do you determine if a type is a functor or not in haskell? I have a data type: I want to determine, and not just for this data type, but for others such as S...	[ 0.0181884765625, -0.0022735595703125, -0.00156402587890625, 0.017333984375, 0.018310546875, 0.01019287109375, -0.0078125, -0.0205078125, 0.00157928466796875, -0.0027618408203125, -0.01611328125, -0.047607421875, 0.00946044921875, -0.00003719329833984375, -0.0208740234375, 0.01440429687...	[ 3642, 83324, 2174, 10644, 83, 10, 7477, 18770, 707, 959, 23, 1556, 142508, 101344, 636, 2407, 21110, 54, 398, 2053, 23351, 214, 52895, 27165, 14508, 110527, 139509, 10557, 37382, 2592, 99929, 137989, 97249, 3126, 23534, 32354, 1238, 62346, ...	[ 0.037628173828125, 0.1668701171875, 0.0855712890625, 0.282470703125, 0.08123779296875, 0.08563232421875, 0.205810546875, 0.2088623046875, 0.0732421875, 0.1494140625, 0.07208251953125, 0.13671875, 0.2430419921875, 0.1766357421875, 0.015869140625, 0.105712890625, 0.0279693603515625, ...	embed
33657566_c0	33657566	haskell	0	Title: Deploying Yesod web app Problem title: Deploying Yesod web app Tags: deployment, haskell, ubuntu, yesod Problem: Deploying Yesod web app I have a simple Yesod web app. I could follow the instruction in http://www.yesodweb.com/page/quickstart , and checked stack exec -- Yesod devel is working fine. The server tha...	Deploying Yesod web app Deploying Yesod web app deployment haskell ubuntu yesod Deploying Yesod Deploying Yesod web app I have a simple Yesod web app. I could follow the instruction in http://www.yesodweb.com/page/quickstart , and checked stack exec -- Yesod devel is working fine. The server that I use (Amazon EC2) has...	[ -0.0096435546875, 0.0115966796875, -0.00640869140625, 0.002166748046875, -0.01611328125, 0.044921875, -0.0106201171875, -0.022216796875, 0.003570556640625, 0.004302978515625, 0.00482177734375, -0.0284423828125, -0.0006103515625, 0.0076904296875, 0.000904083251953125, 0.0000486373901367...	[ 262, 13158, 38543, 32635, 2199, 1467, 4027, 8, 53, 1556, 142508, 198996, 2422, 23722, 8781, 28960, 188336, 1033, 14051, 3181, 17137, 12765, 177261, 1119, 3240, 2601, 20697, 5885, 10723, 4527, 147218, 59947, 10461, 4734, 1632, 169858, 61028, 9...	[ 0.0523681640625, 0.1602783203125, 0.058746337890625, 0.19189453125, 0.28076171875, 0.1396484375, 0.1510009765625, 0.09490966796875, 0.01727294921875, 0.10986328125, 0.2120361328125, 0.14111328125, 0.12890625, 0.2152099609375, 0.0736083984375, 0.05938720703125, 0.062744140625, 0.105...	embed
26230530_c1	26230530	haskell	1	> [1..3] `mappend` [4..6] [1,2,3,4,5,6] λ> [1..3] ++ [4..6] [1,2,3,4,5,6] λ> mconcat [[1,2],[3,6],[9]] [1,2,3,6,9] λ> concat [[1,2],[3,6],[9]] [1,2,3,6,9] λ> getProduct $ Product 3 `mappend` Product 9 27 λ> 3 * 9 27 λ> getProduct $ Product 3 `mappend` Product 4 `mappend` Product 2 24 λ> product [3,4,2] 24 λ> getSum . m...	> [1..3] `mappend` [4..6] [1,2,3,4,5,6] λ> [1..3] ++ [4..6] [1,2,3,4,5,6] λ> mconcat [[1,2],[3,6],[9]] [1,2,3,6,9] λ> concat [[1,2],[3,6],[9]] [1,2,3,6,9] λ> getProduct $ Product 3 `mappend` Product 9 27 λ> 3 * 9 27 λ> getProduct $ Product 3 `mappend` Product 4 `mappend` Product 2 24 λ> product [3,4,2] 24 λ> getSum . m...	[ -0.02001953125, 0.0030364990234375, 0.01055908203125, 0.022705078125, 0.0021820068359375, 0.031005859375, -0.000339508056640625, 0.0120849609375, 0.0228271484375, -0.005828857421875, -0.00170135498046875, -0.02490234375, -0.00335693359375, -0.00555419921875, -0.002777099609375, -0.0098...	[ 977, 68252, 96386, 192, 9858, 71, 617, 910, 268, 133063, 82449, 104629, 111147, 5, 37223, 4, 347, 2271, 4460, 363, 55737, 155761, 171379, 158, 1065, 2046, 10752, 77193, 73111, 138, 483, 1438, 661, 1135, 201, 116, 744, 12996, 90173, 316, ...	[ 0.0927734375, 0.046234130859375, 0.1463623046875, 0.17041015625, 0.1971435546875, 0.16845703125, 0.090576171875, 0.1507568359375, 0.00640869140625, 0.081787109375, 0.16064453125, 0.180908203125, 0.1484375, 0.006683349609375, 0.176513671875, 0.0062255859375, 0.1219482421875, 0.17956...	embed
26688346_c0	26688346	haskell	0	Title: haskell evaluation $ sign Problem title: haskell evaluation $ sign Tags: composition, haskell, operator-keyword Problem: haskell evaluation $ sign I am going through 'learn you some haskell' and I have written following application: import System.IO main = do filename <- getLine handle <- openFile filename ReadM...	haskell evaluation $ sign haskell evaluation $ sign composition haskell operator-keyword System.IO ReadMode haskell evaluation $ sign I am going through 'learn you some haskell' and I have written following application: And it works but when I remove "$" between lines and content a compilation fails. Could you help me ...	[ -0.00787353515625, 0.018798828125, 0.01348876953125, 0.016845703125, -0.0184326171875, 0.005706787109375, -0.0032958984375, 0.0257568359375, -0.005767822265625, -0.026611328125, -0.016357421875, -0.004547119140625, 0.00567626953125, -0.0028533935546875, -0.0159912109375, -0.00224304199...	[ 1556, 142508, 219836, 3650, 24092, 166577, 39933, 19770, 47416, 12353, 17780, 4764, 9083, 147, 398, 3060, 59121, 25632, 38415, 43240, 1284, 3229, 87388, 4369, 17721, 124519, 136, 10941, 98352, 1363, 35782, 28219, 15400, 44691, 47644, 150350, 63...	[ 0.13720703125, 0.2216796875, 0.1923828125, 0.1285400390625, 0.2120361328125, 0.1573486328125, 0.1385498046875, 0.000274658203125, 0.121337890625, 0.082275390625, 0.175537109375, 0.1456298828125, 0.123291015625, 0.0506591796875, 0.009307861328125, 0.0148773193359375, 0.062744140625, ...	embed
22682469_c0	22682469	haskell	0	Title: Concrete example of functional knowledge allowing you to write better imperative/OO code Problem title: Concrete example of functional knowledge allowing you to write better imperative/OO code Tags: haskell, functional-programming Problem: Concrete example of functional knowledge allowing you to write better imp...	Concrete example of functional knowledge allowing you to write better imperative/OO code Concrete example of functional knowledge allowing you to write better imperative/OO code haskell functional-programming Concrete Concrete example of functional knowledge allowing you to write better imperative/OO code I've been wor...	[ 0.033935546875, -0.00141143798828125, 0.003692626953125, -0.006256103515625, 0.00775146484375, 0.02099609375, -0.00457763671875, 0.016845703125, 0.0181884765625, -0.00830078125, 0.009521484375, -0.0311279296875, 0.00185394287109375, 0.03662109375, 0.0002956390380859375, 0.0004444122314...	[ 225111, 13, 27781, 123309, 51359, 190358, 33022, 11522, 222530, 30563, 18151, 1556, 142508, 28966, 20697, 56037, 449, 12960, 5036, 5351, 6782, 1884, 94957, 23902, 20625, 831, 17311, 63847, 7639, 2856, 81779, 903, 3642, 2806, 6713, 1957, 5045, ...	[ 0.2225341796875, 0.0968017578125, 0.200927734375, 0.241943359375, 0.2181396484375, 0.07080078125, 0.1378173828125, 0.1551513671875, 0.2430419921875, 0.1815185546875, 0.1829833984375, 0.125244140625, 0.240234375, 0.1234130859375, 0.05181884765625, 0.1126708984375, 0.0186614990234375, ...	embed
70478263_c0	70478263	haskell	0	Title: Product type convert to tuple Problem title: Product type convert to tuple Tags: haskell Problem: Product type convert to tuple I've got this data Pair = P Int Double deriving Show myP1 = P 1 2.0 getPairVal (P i d) = (i,d) getPairVal' (P i d) = (,) i d which work, both producing (1,2.0) . Is there any way to mak...	Product type convert to tuple Product type convert to tuple haskell Product Pair Double Show myP1 Pair2 myP21 Product type convert to tuple I've got this which work, both producing (1,2.0) . Is there any way to make a straight (,) myP1 work? But then this would require some sort of "cast" I'm guessing. is a tuple versi...	[ 0.00131988525390625, 0.0123291015625, -0.003204345703125, 0.0205078125, -0.007598876953125, 0.006927490234375, -0.048583984375, -0.011962890625, 0.01385498046875, 0.007781982421875, 0.00469970703125, -0.0009765625, 0.00396728515625, -0.019775390625, -0.0224609375, -0.0087890625, 0.00...	[ 73111, 10644, 96760, 47, 370, 8705, 1556, 142508, 1342, 481, 107172, 17367, 759, 683, 418, 304, 3117, 3129, 4488, 15044, 27024, 73011, 3917, 80560, 64209, 55741, 11389, 146625, 56, 92940, 12996, 678, 15490, 80934, 159, 39456, 20903, 76755, ...	[ 0.2279052734375, 0.24267578125, 0.1778564453125, 0.09332275390625, 0.1549072265625, 0.226806640625, 0.130859375, 0.24462890625, 0.160888671875, 0.148193359375, 0.10888671875, 0.1402587890625, 0.1146240234375, 0.105712890625, 0.0980224609375, 0.06683349609375, 0.145751953125, 0.0159...	embed
46547208_c0	46547208	haskell	0	Title: Why is my Haskell code saying 'variable not in scope: main'? Problem title: Why is my Haskell code saying 'variable not in scope: main'? Tags: haskell, compiler-errors Problem: Why is my Haskell code saying 'variable not in scope: main'? When I type the following in the interactive shell of H...	Why is my Haskell code saying 'variable not in scope: main'? Why is my Haskell code saying 'variable not in scope: main'? haskell compiler-errors Prelude Why Haskell Variable Perhaps Why is my Haskell code saying 'variable not in scope: main'? When I type the following in the interactive shell of Ha...	[ 0.00909423828125, 0.0177001953125, -0.00001239776611328125, 0.02099609375, -0.006805419921875, 0.015625, -0.00408935546875, 0.006072998046875, -0.01513671875, -0.019775390625, -0.012451171875, -0.02734375, -0.01019287109375, -0.0037689208984375, 0.048828125, 0.0036468505859375, -0.01...	[ 44084, 83, 759, 20625, 142508, 18151, 54433, 3768, 21690, 2886, 959, 23, 70820, 12, 5201, 54764, 1556, 9969, 34759, 188800, 822, 84572, 181799, 10644, 25632, 212398, 128019, 456, 2424, 217, 4165, 43240, 169123, 31344, 11435, 18158, 163321, 18...	[ 0.1478271484375, 0.0224761962890625, 0.03857421875, 0.1456298828125, 0.2376708984375, 0.164794921875, 0.0965576171875, 0.1563720703125, 0.2235107421875, 0.1927490234375, 0.2086181640625, 0.1854248046875, 0.2330322265625, 0.0587158203125, 0.193115234375, 0.032470703125, 0.09814453125,...	embed

78455573_c0

78455573

haskell

0

Title: Haskell Caesar Cipher Problem title: Haskell Caesar Cipher Tags: haskell, encryption Problem: Haskell Caesar Cipher i'm having trouble with this. my decrypt is not working as intended. i've been trying this for a while and still don't understand why it's showing error. module CaesarCipher where shift :: Char -> ...

Haskell Caesar Cipher Haskell Caesar Cipher haskell encryption Haskell Caesar Cipher CaesarCipher Char Lambda Haskell Caesar Cipher i'm having trouble with this. my decrypt is not working as intended. i've been trying this for a while and still don't understand why it's showing error.

[ 0.003753662109375, -0.00006961822509765625, 0.010986328125, 0.01116943359375, 0.006866455078125, -0.0279541015625, 0.0174560546875, -0.01220703125, -0.0096435546875, 0.0257568359375, -0.00677490234375, -0.01116943359375, -0.003387451171875, 0.0361328125, 0.001220703125, -0.001152038574...

[ 20625, 142508, 64914, 2079, 94266, 1556, 22, 136791, 1830, 40658, 21656, 122930, 85, 17, 19441, 63134, 903, 759, 8, 83, 959, 20697, 237, 179140, 31577, 12960, 7464, 18, 28219, 15400, 141377, 18499 ]

[ 0.11907958984375, 0.2288818359375, 0.240966796875, 0.11859130859375, 0.212646484375, 0.12103271484375, 0.01983642578125, 0.271728515625, 0.0011463165283203125, 0.074462890625, 0.129638671875, 0.142578125, 0.09783935546875, 0.019256591796875, 0.053558349609375, 0.1138916015625, 0.0640...

embed

66180076_c0

66180076

haskell

0

Title: Fibonacci numbers without using zipWith Problem title: Fibonacci numbers without using zipWith Tags: haskell, fibonacci Problem: Fibonacci numbers without using zipWith I have been trying to implement a list of Fibonacci number sequence from 0 to n without using the lazy zipwith method. What I have so far is cod...

Fibonacci numbers without using zipWith Fibonacci numbers without using zipWith haskell fibonacci zipWith Fibonacci fib_seq n-1 Fibonacci numbers without using zipWith I have been trying to implement a list of Fibonacci number sequence from 0 to n without using the lazy zipwith method. What I have so far is code that r...

[ -0.00396728515625, 0.0224609375, -0.01446533203125, 0.0010223388671875, -0.01611328125, 0.0137939453125, -0.01397705078125, 0.007568359375, 0.00150299072265625, -0.0242919921875, -0.000021696090698242188, -0.0135498046875, -0.0057373046875, 0.039306640625, 0.00982666015625, 0.017578125...

[ 3698, 20990, 52544, 101935, 15490, 17368, 68330, 194583, 1556, 142508, 809, 275, 184, 864, 653, 5759, 31577, 29479, 5303, 14012, 40, 944, 3956, 1295, 757, 47, 21, 3285, 76228, 55300, 765, 2060, 18151, 30646, 615, 3917, 15549, 9, 756, 8953...

[ 0.166259765625, 0.1734619140625, 0.21142578125, 0.1796875, 0.1181640625, 0.0380859375, 0.2086181640625, 0.222412109375, 0.0767822265625, 0.19091796875, 0.142578125, 0.091064453125, 0.04827880859375, 0.149658203125, 0.0799560546875, 0.1761474609375, 0.06658935546875, 0.1109619140625...

embed

33470266_c0

33470266

haskell

0

Title: Language.Haskell.Exts.Syntax.Module to Template Haskell data structure Problem title: Language.Haskell.Exts.Syntax.Module to Template Haskell data structure Tags: haskell, template-haskell Problem: Language.Haskell.Exts.Syntax.Module to Template Haskell data structure I've got a Module ( Language.Haskell.Exts.Sy...

Language.Haskell.Exts.Syntax.Module to Template Haskell data structure Language.Haskell.Exts.Syntax.Module to Template Haskell data structure haskell template-haskell Language.Haskell.Exts.Syntax.Module Template Haskell Module Language.Haskell.TH.Syntax PkgName ModName Language.Haskell.Exts.Syntax.Module to Template Ha...

[ 0.0032501220703125, -0.000621795654296875, -0.00518798828125, 0.023193359375, -0.004669189453125, 0.0264892578125, 0.0113525390625, -0.016845703125, -0.005645751953125, -0.056396484375, 0.004974365234375, -0.023681640625, 0.01080322265625, -0.0185546875, -0.017578125, -0.00273132324218...

[ 83658, 6495, 7, 142508, 19279, 933, 3371, 86531, 91616, 8782, 47, 196631, 20625, 2053, 45646, 1556, 110934, 10557, 63014, 23415, 8517, 163612, 16269, 3444, 15504, 3934, 10, 169463, 13, 10644, 6713, 1884, 18811, 88996, 136, 183234, 3917, 96760...

[ 0.1297607421875, 0.073486328125, 0.0767822265625, 0.2088623046875, 0.1019287109375, 0.13720703125, 0.0821533203125, 0.1712646484375, 0.1429443359375, 0.1656494140625, 0.125, 0.252685546875, 0.1551513671875, 0.09619140625, 0.1849365234375, 0.1290283203125, 0.281494140625, 0.09851074...

embed

27409692_c0

27409692

haskell

0

Title: Finding the middle of a list - Haskell Problem title: Finding the middle of a list - Haskell Tags: list, haskell Problem: Finding the middle of a list - Haskell I'm new to haskell and I need some help. I wrote something very simple which calculates the sum of the squares of a list of numbers. sumOfSquares:: [Int...

Finding the middle of a list - Haskell Finding the middle of a list - Haskell list haskell Finding Haskell Integer x:xs Finding the middle of a list - Haskell I'm new to haskell and I need some help. I wrote something very simple which calculates the sum of the squares of a list of numbers. so sumOfSquares [1..10] woul...

[ -0.003448486328125, 0.011474609375, 0.017333984375, -0.021484375, -0.00506591796875, 0.0191650390625, -0.0037994384765625, 0.000476837158203125, 0.0224609375, -0.0224609375, 0.01434326171875, -0.01171875, 0.0264892578125, 0.00311279296875, 0.006988525390625, -0.01116943359375, 0.0011...

[ 26040, 214, 70, 86991, 111, 5303, 20625, 142508, 1556, 44401, 1022, 12, 425, 3525, 3871, 4358, 54397, 4552, 8781, 74481, 10554, 108047, 101935, 132887, 294, 94727, 68252, 5, 963, 2806, 186, 104342, 237875, 7413, 59911, 11832, 90, 4734, 1283...

[ 0.126953125, 0.0219573974609375, 0.0850830078125, 0.268310546875, 0.1474609375, 0.2154541015625, 0.1376953125, 0.21484375, 0.12060546875, 0.15380859375, 0.0694580078125, 0.0662841796875, 0.0904541015625, 0.068603515625, 0.0025634765625, 0.058563232421875, 0.044036865234375, 0.01762...

embed

29332229_c0

29332229

haskell

0

Title: Is there a function in Prelude to pair a value with that value applied to a function? Problem title: Is there a function in Prelude to pair a value with that value applied to a function? Tags: haskell-prelude, haskell Problem: Is there a function in Prelude to pair a value with that value applied to a function? ...

Is there a function in Prelude to pair a value with that value applied to a function? Is there a function in Prelude to pair a value with that value applied to a function? haskell-prelude haskell Prelude Data.Tuple Is there a function in Prelude to pair a value with that value applied to a function? I am searching for ...

[ 0.032958984375, -0.0011444091796875, 0.00152587890625, 0.004547119140625, -0.0228271484375, 0.0164794921875, -0.020751953125, -0.022216796875, 0.01287841796875, -0.034423828125, -0.0169677734375, 0.0030517578125, -0.03125, 0.0108642578125, 0.00311279296875, -0.00701904296875, 0.00212...

[ 2071, 2685, 10, 32354, 23, 1914, 822, 112, 47, 80836, 34292, 678, 450, 190659, 1556, 142508, 4692, 11809, 15665, 8705, 157318, 33342, 21373, 903, 104475, 420, 1984, 33079, 876, 1238, 1022, 2203, 425, 33938, 152488, 133, 6044, 52922, 4588, ...

[ 0.0289154052734375, 0.08795166015625, 0.0911865234375, 0.251708984375, 0.0880126953125, 0.158203125, 0.214111328125, 0.2020263671875, 0.0816650390625, 0.269775390625, 0.220703125, 0.1785888671875, 0.044219970703125, 0.170654296875, 0.10687255859375, 0.20849609375, 0.0970458984375, ...

embed

48349476_c0

48349476

haskell

0

Title: Serialize a program written in a free monad? Problem title: Serialize a program written in a free monad? Tags: haskell, monads, serialization Problem: Serialize a program written in a free monad? I would like to serialize small drawings in Rasterific to JSON. I want to serialize programs/drawing actions such as:...

Serialize a program written in a free monad? Serialize a program written in a free monad? haskell monads serialization Serialize JoinRound CapRound Serialize a program written in a free monad? I would like to serialize small drawings in Rasterific to JSON. I want to serialize programs/drawing actions such as: How can I...

[ -0.017333984375, 0.004974365234375, -0.02294921875, 0.007537841796875, -0.0233154296875, 0.0022125244140625, -0.007720947265625, 0.0196533203125, -0.0037689208984375, -0.0142822265625, -0.00274658203125, 0.01806640625, -0.001800537109375, 0.0047607421875, -0.011962890625, 0.01391601562...

[ 135188, 20650, 1528, 59121, 23, 4092, 2667, 712, 1556, 142508, 7, 35686, 47691, 113053, 12724, 7030, 14304, 2806, 1884, 19336, 188304, 2552, 1515, 14486, 47, 821, 58627, 3444, 103391, 64, 86905, 61972, 6044, 11249, 831, 54, 25647, 2060, 181...

[ 0.2264404296875, 0.1663818359375, 0.181884765625, 0.1114501953125, 0.05535888671875, 0.1416015625, 0.13427734375, 0.197265625, 0.1295166015625, 0.23974609375, 0.0211029052734375, 0.2083740234375, 0.1234130859375, 0.125732421875, 0.1197509765625, 0.109619140625, 0.0806884765625, 0.0...

embed

78732991_c1

78732991

haskell

1

I initially just placed the brackets because it is easier to read. But turns out my code only works when I remove the brackets. I tried working with it and realized this works too: t = satisfy isAlpha <<<= (\x -> satisfy isDigit <<<= \y -> char x) Question 1) But why? If it does (\x -> satisfy isDigit <<<= \y -> char ...

[ -0.010498046875, 0.0238037109375, 0.00099945068359375, 0.01507568359375, 0.018310546875, -0.004974365234375, 0.004791259765625, 0.004241943359375, 0.0201416015625, -0.008544921875, -0.0079345703125, -0.0113525390625, 0.00946044921875, 0.001983642578125, 0.0020751953125, -0.010009765625...

[ 61475, 1660, 158012, 1620, 27853, 7, 99156, 12301, 4966, 18151, 4734, 43240, 3229, 87388, 20697, 808, 40407, 53, 83, 6210, 14612, 425, 14055, 15769, 21441, 1022, 15400, 234015, 5117, 18, 3714, 2367, 3642, 4488, 219836, 12989, 2301, 4527, 95...

[ 0.048370361328125, 0.01324462890625, 0.0965576171875, 0.2021484375, 0.2327880859375, 0.0546875, 0.097412109375, 0.0745849609375, 0.00201416015625, 0.1785888671875, 0.06195068359375, 0.136474609375, 0.040771484375, 0.1759033203125, 0.001190185546875, 0.1351318359375, 0.194580078125, ...

embed

8116262_c0

8116262

haskell

0

Title: How to get Haskell QuickCheck 2.4 to increase # tests? Problem title: How to get Haskell QuickCheck 2.4 to increase # tests? Tags: quickcheck, haskell Problem: How to get Haskell QuickCheck 2.4 to increase # tests? Okay, as I learned via my previous question , the RWH book is already out of date for QuickCheck. ...

How to get Haskell QuickCheck 2.4 to increase # tests? How to get Haskell QuickCheck 2.4 to increase # tests? quickcheck haskell How Haskell QuickCheck How to get Haskell QuickCheck 2.4 to increase # tests? Okay, as I learned via my previous question , the RWH book is already out of date for QuickCheck. And despite all...

[ -0.01336669921875, 0.0029754638671875, 0.002471923828125, 0.006500244140625, 0.0101318359375, 0.01202392578125, -0.019775390625, -0.0247802734375, 0.0208740234375, -0.0027008056640625, -0.003204345703125, -0.0162353515625, 0.00007390975952148438, -0.01025390625, 0.01373291015625, 0.001...

[ 11249, 2046, 20625, 142508, 89038, 202567, 66207, 51312, 468, 109921, 63773, 78292, 1556, 78691, 841, 12877, 5622, 219176, 8781, 4527, 53418, 3687, 15549, 14012, 11675, 100, 57266, 903, 14037, 35978, 26366, 61687, 209806 ]

[ 0.0386962890625, 0.048614501953125, 0.11962890625, 0.2022705078125, 0.16845703125, 0.2861328125, 0.2230224609375, 0.1778564453125, 0.11669921875, 0.253662109375, 0.113037109375, 0.2005615234375, 0.11376953125, 0.0748291015625, 0.08251953125, 0.0955810546875, 0.014190673828125, 0.02...

embed

33557692_c0

33557692

haskell

0

Title: List comprehension in haskell, String -> [String], empty characters not being removed Problem title: List comprehension in haskell, String -> [String], empty characters not being removed Tags: list-comprehension, list, haskell Problem: List comprehension in haskell, String -> [String], empty characters not...

List comprehension in haskell, String -> [String], empty characters not being removed List comprehension in haskell, String -> [String], empty characters not being removed list-comprehension list haskell List List comprehension in haskell, String -> [String], empty characters not being removed I am trying to spli...

[ -0.01434326171875, 0.005828857421875, -0.01080322265625, -0.006256103515625, 0.01318359375, 0.00958251953125, 0.0281982421875, 0.00604248046875, 0.0086669921875, 0.0196533203125, 0.00341796875, -0.0081787109375, -0.005401611328125, 0.0225830078125, -0.01708984375, 0.0206298828125, 0....

[ 32036, 46683, 3220, 6889, 1556, 142508, 23351, 214, 5386, 71713, 201505, 124850, 959, 8035, 184750, 5303, 4692, 31577, 65450, 79315, 23, 49146, 351, 63049, 9433, 18151, 2060, 140992, 53299, 27781, 73342, 15400, 903, 18, 48903, 19048, 87388 ]

[ 0.170166015625, 0.13037109375, 0.117431640625, 0.011444091796875, 0.1082763671875, 0.19189453125, 0.1158447265625, 0.09033203125, 0.09051513671875, 0.1470947265625, 0.2061767578125, 0.17724609375, 0.115478515625, 0.013092041015625, 0.1201171875, 0.1243896484375, 0.0914306640625, 0....

embed

14583197_c0

14583197

haskell

0

Title: haskell function signature Problem title: haskell function signature Tags: haskell, signature, type-variables Problem: haskell function signature I'm having a doubt about type signature in haskell. Reading about applicative functor, I have found: pure (+) <*> Just 3 which gives back Just (+3) which is of type Ma...

haskell function signature haskell function signature haskell signature type-variables Just Maybe Applicative haskell function signature I'm having a doubt about type signature in haskell. Reading about applicative functor, I have found: which gives back Just (+3) which is of type Maybe (a->a) . Now the signature of <*...

[ 0.0234375, 0.0034332275390625, 0.006866455078125, 0.0157470703125, -0.01324462890625, 0.01519775390625, -0.0135498046875, 0.004486083984375, 0.0103759765625, -0.0052490234375, 0.0091552734375, -0.03125, -0.0089111328125, 0.01031494140625, -0.00457763671875, -0.0179443359375, 0.008117...

[ 1556, 142508, 32354, 138256, 10644, 21690, 19736, 9563, 83425, 5659, 11048, 92814, 23, 41816, 4935, 7477, 18770, 14037, 76199, 4420, 22183, 21320, 11, 103607, 111, 4426, 1639, 2740, 26950, 2446, 1238, 876, 27781, 113054, 161740, 678, 10, 1442...

[ 0.1390380859375, 0.2213134765625, 0.1715087890625, 0.2626953125, 0.210205078125, 0.1478271484375, 0.0732421875, 0.149169921875, 0.253173828125, 0.077880859375, 0.123291015625, 0.09228515625, 0.00933837890625, 0.1591796875, 0.103271484375, 0.1131591796875, 0.1231689453125, 0.0064697...

embed

24536673_c0

24536673

haskell

0

Title: How are variable names chosen in type signatures inferred by GHC? Problem title: How are variable names chosen in type signatures inferred by GHC? Tags: ghc, haskell Problem: How are variable names chosen in type signatures inferred by GHC? When I play with checking types of functions in Haskell with :t , for ex...

How are variable names chosen in type signatures inferred by GHC? How are variable names chosen in type signatures inferred by GHC? ghc haskell How GHC Bool Ord Num Enum How are variable names chosen in type signatures inferred by GHC? When I play with checking types of functions in Haskell with :t , for example like t...

[ 0.021240234375, -0.0035400390625, 0.0054931640625, 0.02294921875, -0.0021514892578125, -0.00299072265625, -0.0181884765625, 0.006378173828125, -0.005889892578125, 0.034423828125, -0.0020904541015625, -0.031005859375, -0.000278472900390625, -0.004119873046875, -0.0024871826171875, 0.011...

[ 11249, 77336, 123055, 19667, 10644, 138256, 53498, 527, 73265, 2822, 31380, 238, 1556, 142508, 2460, 929, 35379, 52782, 357, 316, 23, 11301, 175199, 52895, 32354, 20625, 152, 18, 17660, 50339, 9655, 3642, 29481, 56, 39580, 15659, 16765, 12820...

[ 0.06842041015625, 0.266357421875, 0.1878662109375, 0.1270751953125, 0.22509765625, 0.201416015625, 0.164794921875, 0.09765625, 0.1910400390625, 0.014434814453125, 0.0889892578125, 0.073486328125, 0.110107421875, 0.2257080078125, 0.045989990234375, 0.1341552734375, 0.1485595703125, ...

embed

69709935_c0

69709935

haskell

0

Title: I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in funcp Problem title: I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in func...

I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in funcp I am trying to print all pythagorian triplets till nn and getting error :parse error (possibly incorrect indentation or mismatched brackets) in funcp haskell I am trying ...

[ -0.007171630859375, 0.00714111328125, 0.013427734375, -0.002105712890625, 0.00457763671875, 0.01446533203125, 0.023193359375, -0.034423828125, 0.01531982421875, 0.0048828125, -0.002349853515625, -0.013916015625, 0.0157470703125, -0.005767822265625, -0.00677490234375, 0.0172119140625, ...

[ 31577, 28412, 756, 17198, 3238, 519, 9893, 162738, 933, 570, 653, 19, 18499, 2500, 184, 7522, 172, 214552, 18597, 22062, 1239, 98753, 1620, 27853, 7477, 121422, 1556, 142508, 20949, 23, 27512, 6504, 5073, 62775, 26785, 366, 6953, 13315, 198...

[ 0.07952880859375, 0.140625, 0.0645751953125, 0.050689697265625, 0.1153564453125, 0.108154296875, 0.076416015625, 0.2032470703125, 0.087158203125, 0.1163330078125, 0.0248565673828125, 0.0850830078125, 0.191162109375, 0.155517578125, 0.1290283203125, 0.03564453125, 0.012725830078125, ...

embed

32808639_c0

32808639

haskell

0

Title: Process Haskell list from right to left keeping origin order Problem title: Process Haskell list from right to left keeping origin order Tags: iteration, haskell, reverse, list Problem: Process Haskell list from right to left keeping origin order Need increment every second item starting from the right in Haskel...

Process Haskell list from right to left keeping origin order Process Haskell list from right to left keeping origin order iteration haskell reverse list right Process Haskell x:xs x:y:tail Process Haskell list from right to left keeping origin order Need increment every second item starting from the right in Haskell li...

[ 0.0029144287109375, 0.0172119140625, -0.000518798828125, 0.004913330078125, 0.003997802734375, 0.019287109375, -0.0084228515625, -0.00074005126953125, 0.0115966796875, -0.0159912109375, 0.00836181640625, -0.015869140625, 0.0150146484375, 0.021240234375, 0.00160980224609375, 0.013000488...

[ 123996, 20625, 142508, 5303, 1295, 7108, 47, 25737, 120260, 59665, 12989, 17, 720, 1556, 39531, 184, 1022, 425, 53, 46741, 52889, 158661, 11907, 17932, 35735, 72134, 1284, 959, 7225, 37842, 1884, 25632, 5809, 12601, 28219, 7311, 66211, 186351...

[ 0.1781005859375, 0.1715087890625, 0.2371826171875, 0.2132568359375, 0.0672607421875, 0.1951904296875, 0.120849609375, 0.210693359375, 0.14892578125, 0.2083740234375, 0.20458984375, 0.000579833984375, 0.18603515625, 0.1654052734375, 0.189697265625, 0.1129150390625, 0.038116455078125, ...

embed

37573019_c0

37573019

haskell

0

Title: Compose function with two arguments Problem title: Compose function with two arguments Tags: function, function-composition, haskell, pointfree Problem: Compose function with two arguments I ran into something that threw me off today. I was trying to define a function equivalent to Data.Text.commonPrefixes that ...

Compose function with two arguments Compose function with two arguments function function-composition haskell pointfree Compose Data.Text.commonPrefixes Text Maybe Text.commonPrefixes Compose function with two arguments I ran into something that threw me off today. I was trying to define a function equivalent to Data.T...

[ 0.0062255859375, -0.0205078125, 0.010498046875, 0.0291748046875, -0.00714111328125, 0.018310546875, -0.000499725341796875, -0.006134033203125, -0.000415802001953125, -0.0272216796875, -0.003692626953125, 0.0311279296875, 0.0169677734375, 0.007293701171875, 0.0096435546875, 0.0112304687...

[ 15612, 8364, 32354, 678, 6626, 10750, 277, 40322, 1556, 142508, 6275, 32087, 11809, 174379, 3796, 19273, 55923, 90, 24129, 83425, 13028, 159399, 5773, 18925, 31577, 61924, 183234, 104250, 16065, 26818, 1284, 183114, 25632, 43240, 37842, 1884, 1...

[ 0.196044921875, 0.1688232421875, 0.1982421875, 0.08203125, 0.1759033203125, 0.2318115234375, 0.1427001953125, 0.1588134765625, 0.0966796875, 0.1878662109375, 0.0631103515625, 0.1531982421875, 0.088623046875, 0.1328125, 0.10491943359375, 0.046630859375, 0.147705078125, 0.0458984375,...

embed

28955122_c0

28955122

haskell

0

Title: Continuation Monad - Int and String Problem title: Continuation Monad - Int and String Tags: haskell Problem: Continuation Monad - Int and String The Mother of all Monads article presents this code: ex3 = do a <- return 1 b <- ContT (\fred -> "escape") return $ a+b Then I can execute it: ghci> runContT ex3 show ...

Continuation Monad - Int and String Continuation Monad - Int and String haskell Continuation Monad ex3 ContT Couldn Char Integer Expected Actual Continuation Monad - Int and String The Mother of all Monads article presents this code: Then I can execute it: But I can't run: How does return $ a+b type-check? What's going...

[ -0.00665283203125, -0.006683349609375, 0.000972747802734375, 0.015625, 0.000934600830078125, 0.0169677734375, 0.01287841796875, -0.0283203125, -0.0107421875, -0.00927734375, -0.0235595703125, -0.031005859375, 0.0026397705078125, 0.0201416015625, 0.004730224609375, -0.0196533203125, 0...

[ 50343, 1363, 60331, 71, 360, 18, 136, 23351, 214, 1556, 142508, 1119, 363, 1657, 618, 191147, 19, 21656, 44401, 60075, 13, 100582, 115217, 111, 756, 6468, 5582, 13379, 18151, 831, 71924, 442, 4966, 87, 11675, 11249, 30646, 3650, 10, 1328,...

[ 0.1463623046875, 0.0418701171875, 0.191162109375, 0.128662109375, 0.05712890625, 0.1810302734375, 0.07379150390625, 0.1572265625, 0.005889892578125, 0.0802001953125, 0.2049560546875, 0.09857177734375, 0.1636962890625, 0.077880859375, 0.03851318359375, 0.0841064453125, 0.0012512207031...

embed

21226186_c0

21226186

haskell

0

Title: Learn You a Haskell For Great Good "Syntax in Functions" Error Problem title: Learn You a Haskell For Great Good "Syntax in Functions" Error Tags: haskell Problem: Learn You a Haskell For Great Good "Syntax in Functions" Error I am new to Haskell, and am following the tutorial given in: http:...

Learn You a Haskell For Great Good "Syntax in Functions" Error Learn You a Haskell For Great Good "Syntax in Functions" Error haskell Learn You Haskell Great Good Syntax Functions Error Integral LUCKY NUMBER SEVEN Sorry Not Learn You a Haskell For Great Good "Syntax in Functions" Error I am new to H...

[ -0.0126953125, 0.01214599609375, -0.0032958984375, 0.00160980224609375, 0.00115966796875, 0.01513671875, -0.0159912109375, -0.0086669921875, 0.006988525390625, -0.007415771484375, -0.0027618408203125, -0.0194091796875, -0.017333984375, -0.006591796875, 0.032958984375, -0.00141906738281...

[ 134031, 2583, 10, 20625, 142508, 1326, 32774, 18621, 41502, 3371, 86531, 23, 28670, 10763, 212059, 1556, 19010, 204681, 30684, 441, 32272, 109020, 24480, 6755, 30223, 90502, 11205, 3525, 25632, 57143, 147, 796, 7232, 7, 12654, 73, 137175, 277...

[ 0.148193359375, 0.15380859375, 0.0902099609375, 0.1680908203125, 0.25244140625, 0.120849609375, 0.0782470703125, 0.143310546875, 0.016204833984375, 0.10638427734375, 0.2091064453125, 0.14599609375, 0.1434326171875, 0.124755859375, 0.218017578125, 0.13037109375, 0.11328125, 0.203857...

embed

7141287_c0

7141287

haskell

0

Title: Haskell cartesian product of infinite lists Problem title: Haskell cartesian product of infinite lists Tags: infinite, haskell, cartesian-product Problem: Haskell cartesian product of infinite lists I want to generate a vectorspace from a basis pair, which looks something like: genFromPair (e1, e2) = [x*e1 + y*e...

Haskell cartesian product of infinite lists Haskell cartesian product of infinite lists infinite haskell cartesian-product Haskell Haskell cartesian product of infinite lists I want to generate a vectorspace from a basis pair, which looks something like: When I examine the output though, it sems like I'm getting [0, e2...

[ 0.005767822265625, 0.01708984375, -0.0311279296875, 0.010986328125, -0.007354736328125, 0.00799560546875, -0.00421142578125, -0.0174560546875, 0.004302978515625, -0.03466796875, 0.0024871826171875, 0.00897216796875, 0.0029144287109375, -0.004669189453125, -0.038330078125, 0.01019287109...

[ 20625, 142508, 129912, 3378, 12996, 54241, 5303, 1556, 57877, 13, 3444, 139392, 173, 18770, 65421, 1295, 18231, 80836, 33342, 1884, 160477, 140992, 484, 20949, 2389, 28, 304, 116, 1639, 1022, 8306, 62163, 36917, 757, 10422, 33022, 18151, 4668...

[ 0.1302490234375, 0.215576171875, 0.1474609375, 0.10748291015625, 0.1881103515625, 0.136474609375, 0.2044677734375, 0.1357421875, 0.1976318359375, 0.034942626953125, 0.07928466796875, 0.1610107421875, 0.14794921875, 0.1568603515625, 0.2291259765625, 0.0592041015625, 0.2103271484375, ...

embed

7302378_c0

7302378

haskell

0

Title: Remove duplicates with a different equality test in Python Problem title: Remove duplicates with a different equality test in Python Tags: duplicates, haskell, python Problem: Remove duplicates with a different equality test in Python I'm looking for a Python function similar to nubBy in Haskell , which removes ...

Remove duplicates with a different equality test in Python Remove duplicates with a different equality test in Python duplicates haskell python Remove Python Out Remove duplicates with a different equality test in Python I'm looking for a Python function similar to nubBy in Haskell , which removes duplicate but with a ...

[ -0.007080078125, 0.0225830078125, 0.01361083984375, 0.00083160400390625, -0.00173187255859375, -0.0023345947265625, -0.0006561279296875, 0.00823974609375, -0.006011962890625, -0.01324462890625, -0.0303955078125, 0.0054931640625, 0.00811767578125, -0.003021240234375, -0.0238037109375, 0...

[ 181139, 171763, 1636, 678, 12921, 28, 161789, 3034, 145581, 23, 1556, 142508, 17198, 50828, 13538, 16487, 32354, 21373, 315, 275, 75358, 20625, 87388, 7, 67, 1284, 2806, 5646, 136, 5303, 171859, 30646, 80854, 110, 89536, 3688, 4700, 209, 23...

[ 0.1826171875, 0.2705078125, 0.1741943359375, 0.1190185546875, 0.229248046875, 0.08245849609375, 0.2081298828125, 0.2169189453125, 0.275390625, 0.04046630859375, 0.1104736328125, 0.1910400390625, 0.10003662109375, 0.034942626953125, 0.1676025390625, 0.033477783203125, 0.148193359375, ...

embed

69608195_c0

69608195

haskell

0

Title: Why is my ByteString in BigEndian Format on my x86_64 architecture? Problem title: Why is my ByteString in BigEndian Format on my x86_64 architecture? Tags: endianness, haskell, x86 Problem: Why is my ByteString in BigEndian Format on my x86_64 architecture? This code: import Data.Binary import qualified Data.By...

Why is my ByteString in BigEndian Format on my x86_64 architecture? Why is my ByteString in BigEndian Format on my x86_64 architecture? endianness haskell x86 Data.Binary qualified Data.Int Why ByteString BigEndian Format x86_64 Data.ByteString.Internal c2w w2c Data.ByteString.Lazy B.putStr Int32 x86 Why is my ByteStri...

[ 0.01611328125, 0.01434326171875, 0.000278472900390625, 0.00982666015625, -0.0205078125, 0.01361083984375, 0.00628662109375, -0.006439208984375, -0.0079345703125, 0.025390625, 0.0118408203125, -0.020751953125, -0.000850677490234375, 0.013916015625, -0.00457763671875, 0.01409912109375, ...

[ 44084, 83, 759, 3311, 67, 71713, 214, 23, 14195, 7768, 27201, 60972, 15276, 13307, 159958, 1022, 22, 7432, 1556, 142508, 11809, 73, 6635, 217225, 4153, 18, 75358, 5, 44851, 304, 434, 148, 2729, 3285, 335, 7077, 6460, 3293, 18151, 27489, ...

[ 0.14404296875, 0.05108642578125, 0.0361328125, 0.101806640625, 0.158203125, 0.2161865234375, 0.1265869140625, 0.071533203125, 0.102294921875, 0.13037109375, 0.19482421875, 0.2093505859375, 0.243896484375, 0.1939697265625, 0.119384765625, 0.010406494140625, 0.11962890625, 0.09594726...

embed

69988886_c0

69988886

haskell

0

Title: Converting string to list in newType Problem title: Converting string to list in newType Tags: haskell Problem: Converting string to list in newType I am trying to create a new data type called BigNumber which consists of a list of its digits. But when I try to create a function that receives a String and conver...

Converting string to list in newType Converting string to list in newType haskell Converting BigNumber Digits Char Couldn Expected Actual Wdeferred-type-errors Converting string to list in newType I am trying to create a new data type called BigNumber which consists of a list of its digits. But when I try to create a f...

[ -0.01611328125, -0.004058837890625, -0.003509521484375, 0.021240234375, -0.00799560546875, 0.029296875, -0.0128173828125, -0.01171875, 0.00104522705078125, 0.005584716796875, -0.001129150390625, -0.033203125, -0.0034942626953125, -0.005767822265625, -0.016845703125, -0.002655029296875,...

[ 1657, 814, 79315, 47, 5303, 3525, 196707, 23, 1556, 142508, 14195, 18444, 26278, 51174, 933, 21656, 191147, 60075, 13, 100582, 112, 2875, 2822, 50986, 188800, 31577, 28282, 2053, 10644, 58055, 6863, 153939, 9790, 32354, 53299, 23351, 214, 967...

[ 0.00250244140625, 0.10400390625, 0.209716796875, 0.051483154296875, 0.188232421875, 0.1334228515625, 0.286865234375, 0.024200439453125, 0.08331298828125, 0.1788330078125, 0.1458740234375, 0.16357421875, 0.183349609375, 0.078125, 0.0311431884765625, 0.1134033203125, 0.044769287109375,...

embed

11112287_c0

11112287

haskell

0

Title: Warning: newtype `CInt' is used in an FFI declaration, Problem title: Warning: newtype `CInt' is used in an FFI declaration, Tags: ffi, haskell Problem: Warning: newtype `CInt' is used in an FFI declaration, When building gtk2hs-buildtools with ghc 7.4.2, I get the following warning: c2hs/toplevel/C2HS...

Warning: newtype `CInt' is used in an FFI declaration, Warning: newtype `CInt' is used in an FFI declaration, ffi haskell ccall Foreign.C.Types Warning CInt FFI c2hs C2HSConfig.hs:110:1 GHC When bitfield_direction Warning: newtype `CInt' is used in an FFI declaration, When building gtk2hs-buildtools with ghc ...

[ 0.0048828125, 0.00439453125, 0.0198974609375, 0.002410888671875, -0.01422119140625, 0.0157470703125, -0.007232666015625, -0.01043701171875, -0.00830078125, -0.0296630859375, 0.005523681640625, -0.04052734375, -0.0115966796875, 0.006011962890625, -0.002716064453125, -0.0152587890625, ...

[ 5550, 592, 3525, 50986, 17304, 660, 3768, 11814, 563, 22724, 21635, 9473, 74, 1363, 24500, 1556, 142508, 501, 85763, 184293, 196707, 26550, 304, 127, 38131, 83671, 36053, 19721, 527, 73265, 4785, 28394, 936, 58994, 83, 33976, 706, 31472, 7,...

[ 0.15771484375, 0.09619140625, 0.1278076171875, 0.2822265625, 0.13232421875, 0.2021484375, 0.114013671875, 0.1558837890625, 0.1114501953125, 0.2247314453125, 0.18994140625, 0.0013427734375, 0.006256103515625, 0.023162841796875, 0.1900634765625, 0.10675048828125, 0.1976318359375, 0.0...

embed

13637286_c0

13637286

haskell

0

Title: Need help converting Maybe to Char Problem title: Need help converting Maybe to Char Tags: haskell Problem: Need help converting Maybe to Char I'm trying to convert a Maybe value to a Char. I get the following error and despite my best efforts I can't figure out how to correct this. convertmaybe.hs:18:22: No ins...

Need help converting Maybe to Char Need help converting Maybe to Char haskell a Need Maybe Char convertmaybe.hs:18:22 ToChar Just Failed Nothing Need help converting Maybe to Char I'm trying to convert a Maybe value to a Char. I get the following error and despite my best efforts I can't figure out how to correct this....

[ -0.00138092041015625, -0.0084228515625, 0.020263671875, 0.0012664794921875, 0.01312255859375, 0.02978515625, 0.0019989013671875, -0.01458740234375, 0.002105712890625, 0.01708984375, -0.01953125, -0.0230712890625, 0.0032806396484375, 0.026611328125, -0.018310546875, -0.029541015625, -...

[ 52889, 4358, 96760, 214, 83425, 47, 21656, 1556, 142508, 11354, 372, 127, 24033, 24070, 717, 84068, 9563, 190355, 297, 182747, 31577, 34292, 10, 25632, 18499, 2965, 79825, 26366, 26785, 3293, 18151, 4865, 444, 87, 20594, 44691, 3688 ]

[ 0.2078857421875, 0.15283203125, 0.1492919921875, 0.030181884765625, 0.31396484375, 0.1260986328125, 0.258056640625, 0.1170654296875, 0.1966552734375, 0.102294921875, 0.211669921875, 0.06768798828125, 0.075439453125, 0.0528564453125, 0.1444091796875, 0.2467041015625, 0.08544921875, ...

embed

3787960_c0

3787960

haskell

0

Title: What makes Haskell's type system more "powerful" than other languages' type systems? Problem title: What makes Haskell's type system more "powerful" than other languages' type systems? Tags: haskell, hindley-milner, type-inference, type-systems, types Problem: What makes H...

What makes Haskell's type system more "powerful" than other languages' type systems? What makes Haskell's type system more "powerful" than other languages' type systems? haskell hindley-milner type-inference type-systems types What Haskell What makes Haskell's type system more "p...

[ 0.0257568359375, 0.006683349609375, 0.01361083984375, 0.003936767578125, -0.00787353515625, -0.0030517578125, -0.01287841796875, 0.001373291015625, 0.0030059814453125, -0.0096435546875, 0.004547119140625, -0.0189208984375, -0.01507568359375, 0.0067138671875, -0.0201416015625, 0.0117797...

[ 4865, 30482, 20625, 142508, 3768, 10644, 5426, 1286, 62783, 7844, 3789, 46876, 76519, 1556, 34866, 4293, 12397, 1679, 73, 69988, 16751, 52895, 3501, 104951, 6206, 712, 2187, 152653, 11, 119475, 183037, 113138, 441, 37223, 41925, 3853, 831, 18...

[ 0.04559326171875, 0.05511474609375, 0.139404296875, 0.25830078125, 0.042999267578125, 0.2081298828125, 0.146240234375, 0.09527587890625, 0.1357421875, 0.1126708984375, 0.02716064453125, 0.137939453125, 0.141845703125, 0.09466552734375, 0.08062744140625, 0.14306640625, 0.0780029296875...

embed

49949580_c0

49949580

haskell

0

Title: How can I convert a Cons list to a Haskell list without (explicit) recursion? Problem title: How can I convert a Cons list to a Haskell list without (explicit) recursion? Tags: haskell Problem: How can I convert a Cons list to a Haskell list without (explicit) recursion? I have the following type: data ConsList ...

How can I convert a Cons list to a Haskell list without (explicit) recursion? How can I convert a Cons list to a Haskell list without (explicit) recursion? haskell How Cons Haskell ConsList Nil How can I convert a Cons list to a Haskell list without (explicit) recursion? I have the following type: data ConsList elem = ...

[ -0.0152587890625, 0.011962890625, -0.00179290771484375, -0.01513671875, 0.0130615234375, 0.0252685546875, -0.029052734375, -0.015625, 0.00133514404296875, -0.04931640625, -0.002197265625, -0.03662109375, 0.0162353515625, 0.0157470703125, 0.000904083251953125, -0.002838134765625, -0.0...

[ 11249, 831, 96760, 39215, 5303, 47, 10, 20625, 142508, 15490, 60923, 195625, 83613, 1830, 1556, 154663, 77175, 10644, 2053, 88, 195, 11935, 7, 903, 3173, 3934, 142477, 959, 8035, 5844, 3444, 138, 190, 361, 122101, 135461, 6896, 104116, 3259...

[ 0.0234527587890625, 0.041961669921875, 0.1650390625, 0.25732421875, 0.2171630859375, 0.0810546875, 0.066650390625, 0.1337890625, 0.2188720703125, 0.1143798828125, 0.1112060546875, 0.1600341796875, 0.01214599609375, 0.0570068359375, 0.09967041015625, 0.179931640625, 0.168701171875, ...

embed

53395955_c1

53395955

haskell

1

however, I don't like this pattern/style to handle exception, because in order to handle the exception from getEnv "HOST" , I have to put the handler outside of the entire readEnv , and parse the error message in order to distinguish if the error is MissingHost or MissingPort . If the error message doesn't contain "HO...

[ -0.0186767578125, 0.01055908203125, -0.0223388671875, 0.0008087158203125, 0.000827789306640625, -0.003997802734375, -0.000247955322265625, -0.03515625, -0.0037841796875, 0.00787353515625, 0.00616455078125, -0.0115966796875, 0.0185546875, -0.02783203125, 0.0137939453125, 0.0028533935546...

[ 49903, 87, 2301, 18, 1884, 903, 103510, 40946, 34831, 131527, 2046, 7768, 334, 841, 34274, 35863, 50782, 64194, 12301, 366, 184, 18499, 26008, 157167, 1495, 16771, 214, 11193, 271, 60006, 70541, 707, 91599, 132283, 11782, 41143, 99, 7440, 7...

[ 0.051788330078125, 0.000946044921875, 0.08624267578125, 0.10076904296875, 0.1331787109375, 0.041107177734375, 0.14404296875, 0.1114501953125, 0.146484375, 0.2406005859375, 0.1246337890625, 0.1351318359375, 0.1962890625, 0.1517333984375, 0.2093505859375, 0.2242431640625, 0.11169433593...

embed

19533599_c0

19533599

haskell

0

Title: How to map a function over the arguments of another function in Haskell? Problem title: How to map a function over the arguments of another function in Haskell? Tags: haskell Problem: How to map a function over the arguments of another function in Haskell? So initially I wrote: xs <- getAddrInfo (Just hints) (Ju...

How to map a function over the arguments of another function in Haskell? How to map a function over the arguments of another function in Haskell? haskell How Haskell Just map_arg How to map a function over the arguments of another function in Haskell? So initially I wrote: then it seemed to me that the function 'Just :...

[ -0.00023937225341796875, 0.00836181640625, -0.0038604736328125, 0.002166748046875, 0.0106201171875, 0.01513671875, 0.0027008056640625, 0.00665283203125, 0.031005859375, -0.037841796875, 0.0059814453125, -0.038818359375, 0.00433349609375, 0.0185546875, -0.00140380859375, -0.011535644531...

[ 11249, 47, 22288, 32354, 645, 10750, 7, 15700, 20625, 142508, 1556, 9563, 61477, 10, 23, 115058, 127794, 1984, 33079, 83425, 192, 48398, 4505, 933, 7569, 6982, 1257, 1884, 903, 527, 73265, 41206, 876, 501, 5701, 10644, 18, 12765, 3917, 11...

[ 0.07586669921875, 0.0278167724609375, 0.2208251953125, 0.216796875, 0.15966796875, 0.18994140625, 0.04180908203125, 0.06207275390625, 0.1290283203125, 0.2357177734375, 0.1031494140625, 0.112548828125, 0.159912109375, 0.1204833984375, 0.021453857421875, 0.0210723876953125, 0.157592773...

embed

49072552_c0

49072552

haskell

0

Title: Building a Docker container with stack and custom options Problem title: Building a Docker container with stack and custom options Tags: haskell, haskell-stack, docker Problem: Building a Docker container with stack and custom options There are instructions in the "Docker" section of the stack guide on how to bu...

Building a Docker container with stack and custom options Building a Docker container with stack and custom options haskell haskell-stack docker Building Docker RUN VOLUME WORKDIR USER Reset ENTRYPOINT CMD stack.yaml Building a Docker container with stack and custom options There are instructions in the "Docker" sectio...

[ 0.002044677734375, 0.00811767578125, 0.00012493133544921875, -0.011962890625, -0.0140380859375, 0.0032501220703125, -0.00433349609375, -0.006805419921875, 0.000823974609375, 0.0167236328125, 0.002166748046875, 0.00116729736328125, 0.01324462890625, 0.0167236328125, -0.01275634765625, 0...

[ 104919, 984, 11050, 116419, 678, 177261, 136, 114122, 50717, 1556, 142508, 590, 2594, 54, 130747, 90597, 231355, 123237, 345, 50184, 9624, 126, 193413, 9698, 59537, 44644, 14520, 141, 167934, 8331, 17997, 45367, 17368, 3871, 100677, 78301, 23, ...

[ 0.117919921875, 0.1492919921875, 0.25146484375, 0.2369384765625, 0.0673828125, 0.23291015625, 0.024200439453125, 0.182373046875, 0.2088623046875, 0.05474853515625, 0.1453857421875, 0.123046875, 0.04010009765625, 0.0848388671875, 0.074462890625, 0.074462890625, 0.046722412109375, 0....

embed

8762943_c0

8762943

haskell

0

Title: Which applicative functor is used for passing shared parameters? Problem title: Which applicative functor is used for passing shared parameters? Tags: haskell, applicative Problem: Which applicative functor is used for passing shared parameters? I think I kind of understand how applicative functors work in Haske...

Which applicative functor is used for passing shared parameters? Which applicative functor is used for passing shared parameters? haskell applicative Which Which applicative functor is used for passing shared parameters? I think I kind of understand how applicative functors work in Haskell and I'm using them for basic ...

[ 0.00193023681640625, 0.0002460479736328125, -0.01007080078125, 0.0004444122314453125, -0.00193023681640625, -0.00390625, -0.001068115234375, -0.0181884765625, 0.01025390625, -0.0242919921875, 0.01129150390625, -0.044677734375, -0.002044677734375, 0.0269775390625, -0.0078125, -0.0043945...

[ 130078, 41816, 4935, 7477, 18770, 83, 11814, 100, 452, 6953, 99764, 171859, 7, 1556, 142508, 28219, 4488, 23, 20625, 17368, 62822, 2053, 50986, 82419, 4565, 9319, 27781, 831, 456, 5429, 75639, 20623, 144285, 5974, 43240, 84751, 3129, 5659, ...

[ 0.1451416015625, 0.226318359375, 0.190185546875, 0.1768798828125, 0.2166748046875, 0.05548095703125, 0.182861328125, 0.104736328125, 0.0941162109375, 0.093017578125, 0.2403564453125, 0.2274169921875, 0.0718994140625, 0.1314697265625, 0.238525390625, 0.04412841796875, 0.097412109375, ...

embed

33304155_c0

33304155

haskell

0

Title: How to automatically build test modules with stack? Problem title: How to automatically build test modules with stack? Tags: testing, haskell, haskell-stack Problem: How to automatically build test modules with stack? I have this Spec.hs : import qualified OtherSpec main :: IO () main = do putStrLn "Test..." Oth...

How to automatically build test modules with stack? How to automatically build test modules with stack? testing haskell haskell-stack qualified How Spec.hs OtherSpec Test OtherSpec.main OtherSpec.hs How to automatically build test modules with stack? I have this Spec.hs : And I am planning to add more test suites from ...

[ -0.012939453125, 0.011962890625, -0.0162353515625, -0.003997802734375, 0.00347900390625, 0.00762939453125, 0.01165771484375, 0.00762939453125, 0.009033203125, -0.01263427734375, 0.004119873046875, -0.0036773681640625, 0.000926971435546875, 0.0291748046875, 0.00946044921875, 0.016479492...

[ 11249, 191082, 45367, 3034, 88996, 7, 678, 177261, 47, 134234, 1556, 142508, 590, 2594, 217225, 24990, 127, 64511, 47107, 8647, 24931, 58136, 15190, 1286, 14947, 3789, 5201, 11675, 109921, 237, 456, 16428, 98816, 71924, 2886, 978, 15549, 6557...

[ 0.050018310546875, 0.2327880859375, 0.191162109375, 0.2333984375, 0.2142333984375, 0.05859375, 0.1319580078125, 0.25390625, 0.007904052734375, 0.154541015625, 0.1131591796875, 0.171875, 0.124755859375, 0.1134033203125, 0.1375732421875, 0.15625, 0.08880615234375, 0.138671875, 0.15...

embed

33330919_c0

33330919

haskell

0

Title: Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? Problem title: Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? Tags: haskell, morte, dependent-type, functional-programming Problem: Is it possible to expr...

Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? Is it possible to express the type of balanced untagged binary trees on the calculus of constructions? haskell morte dependent-type functional-programming Tree Nat Type Leaf Is it possible to express the type of balan...

[ 0.0213623046875, 0.00060272216796875, -0.0091552734375, -0.00933837890625, 0.026123046875, -0.0028533935546875, 0.004150390625, -0.000244140625, 0.0025482177734375, -0.033935546875, -0.0213623046875, -0.0361328125, 0.00182342529296875, -0.0029144287109375, 0.0198974609375, 0.0090332031...

[ 7722, 36510, 10644, 40197, 51, 102, 134229, 2394, 1360, 44805, 223, 50961, 71, 6635, 90, 111, 1556, 142508, 20055, 108750, 50986, 123309, 28966, 101344, 68875, 60457, 2407, 13452, 5919, 67, 33636, 2053, 12342, 85, 163504, 65998, 181545 ]

[ 0.1092529296875, 0.1429443359375, 0.1363525390625, 0.2147216796875, 0.050018310546875, 0.130859375, 0.09222412109375, 0.1240234375, 0.1727294921875, 0.142822265625, 0.058074951171875, 0.138671875, 0.03497314453125, 0.0261077880859375, 0.0292510986328125, 0.0079345703125, 0.0334777832...

embed

22828137_c1

22828137

haskell

1

replicate k ['a'..'z'] | k <- [1..]] >>= sequence Looks like what I want! Once I got the module to compile I checked the type of this function in the interpreter: > :t runSupplyVars runSupplyVars :: Supply [Char] a -> Identity (a, [[Char]]) I've tried passing lots (hours worth) of different things to this function, wit...

[ 0.0020751953125, -0.0002803802490234375, -0.0194091796875, 0.0252685546875, -0.01446533203125, 0.016357421875, 0.025390625, 0.004547119140625, -0.00080108642578125, 0.00124359130859375, 0.0208740234375, 0.01080322265625, 0.00274658203125, 0.0186767578125, -0.01251220703125, -0.01275634...

[ 143126, 67, 472, 11, 5, 169, 58745, 4426, 9, 68252, 6396, 1369, 40, 944, 3956, 60818, 1884, 2367, 87, 3444, 38, 88996, 9969, 1340, 12765, 70, 10644, 903, 32354, 29481, 56, 18, 11675, 294, 23157, 538, 81827, 7, 1984, 121691, 84068, 10,...

[ 0.284423828125, 0.1448974609375, 0.169921875, 0.1251220703125, 0.0322265625, 0.110107421875, 0.014373779296875, 0.057403564453125, 0.055145263671875, 0.0780029296875, 0.04327392578125, 0.03875732421875, 0.0673828125, 0.129638671875, 0.08673095703125, 0.07763671875, 0.06207275390625, ...

embed

28508522_c0

28508522

haskell

0

Title: Tracing a tree? Problem title: Tracing a tree? Tags: haskell Problem: Tracing a tree? I have a type for a tree like so: data Tree a = EmptyTree | Tree a [Tree a] deriving (Show, Ord, Eq) freeTree :: Tree Integer freeTree = Tree 2 [Tree 5 [], Tree 6 [Tree 8 [], Tree 9 []], Tree 7 []] main = print freeTree What I ...

Tracing a tree? Tracing a tree? haskell Tracing Tree EmptyTree Show Ord Integer Tracing a tree? I have a type for a tree like so: What I am trying to do is to write a function that could be used say like so: And what a trace on this tree would return is: [2],[2,5],[2,6],[2,7],[2,6,8],[2,6,9] Basically what it does is: ...

[ 0.010986328125, 0.01531982421875, -0.0027618408203125, 0.00811767578125, 0.00081634521484375, 0.007598876953125, -0.030517578125, -0.010986328125, -0.009521484375, -0.056884765625, 0.0034027099609375, -0.01177978515625, 0.00250244140625, 0.005767822265625, -0.002227783203125, 0.0152587...

[ 4937, 21896, 10, 53201, 32, 1556, 142508, 101344, 31678, 939, 62731, 17367, 35379, 44401, 10644, 100, 1884, 221, 31577, 33022, 32354, 5809, 11814, 2367, 144851, 98, 903, 2806, 30646, 83, 33579, 71928, 189126, 304, 966, 151664, 171379, 14602, ...

[ 0.2548828125, 0.19482421875, 0.06640625, 0.281494140625, 0.043487548828125, 0.140380859375, 0.2230224609375, 0.2342529296875, 0.1826171875, 0.092529296875, 0.236083984375, 0.134765625, 0.1842041015625, 0.1927490234375, 0.1859130859375, 0.004180908203125, 0.07855224609375, 0.0646362...

embed

29576695_c0

29576695

haskell

0

Title: Why `where` produces a parse error inside list comprehension, but `let` doesn't? Problem title: Why `where` produces a parse error inside list comprehension, but `let` doesn't? Tags: where-clause, list-comprehension, haskell Problem: Why `where` produces a parse error inside list comprehension, but `le...

Why `where` produces a parse error inside list comprehension, but `let` doesn't? Why `where` produces a parse error inside list comprehension, but `let` doesn't? where-clause list-comprehension haskell Why Why `where` produces a parse error inside list comprehension, but `let` doesn't? Let's define a simple f...

[ 0.0032806396484375, 0.0086669921875, -0.0113525390625, -0.025146484375, -0.0030517578125, 0.0189208984375, -0.007568359375, -0.01031494140625, 0.0078125, 0.000858306884765625, -0.030517578125, -0.0234375, 0.0196533203125, -0.00909423828125, -0.00640869140625, 0.003326416015625, -0.00...

[ 44084, 136913, 27489, 366, 184, 18499, 46132, 5303, 46683, 3220, 1974, 3768, 1284, 22027, 18, 7440, 18347, 4032, 277, 4692, 1556, 142508, 6889, 61924, 8781, 32354, 7477, 238, 1884, 4527, 70731, 13, 13204, 12050, 223, 185397, 31577, 9969, 13...

[ 0.0933837890625, 0.2196044921875, 0.1265869140625, 0.0931396484375, 0.065673828125, 0.2030029296875, 0.09332275390625, 0.1710205078125, 0.1409912109375, 0.144775390625, 0.2154541015625, 0.051605224609375, 0.039337158203125, 0.03125, 0.0823974609375, 0.2327880859375, 0.07476806640625,...

embed

63642608_c0

63642608

haskell

0

Title: Can't write a type declaration in playground of Haskell IDE Problem title: Can't write a type declaration in playground of Haskell IDE Tags: haskell Problem: Can't write a type declaration in playground of Haskell IDE I'm writing Haskell with the ‎Haskell on the Mac App Store tool. I can't write a type...

Can't write a type declaration in playground of Haskell IDE Can't write a type declaration in playground of Haskell IDE haskell Can Haskell IDE Foo Bar FooBar Variable Can't write a type declaration in playground of Haskell IDE I'm writing Haskell with the ‎Haskell on the Mac App Store tool. I can't write a t...

[ 0.00225830078125, 0.025390625, -0.0113525390625, 0.02392578125, 0.0128173828125, -0.00836181640625, -0.00469970703125, 0.007293701171875, -0.006866455078125, 0.00360107421875, -0.00238037109375, -0.03369140625, -0.006683349609375, 0.004180908203125, 0.0169677734375, 0.0103759765625, ...

[ 4171, 3768, 18, 33022, 10644, 21635, 1363, 23, 11301, 64330, 20625, 142508, 36497, 1556, 9572, 31, 3253, 25267, 84572, 2886, 32562, 678, 98, 4727, 5659, 14934, 55516, 831, 25632, 6002, 86531, 15490, 14315, 20623, 959, 213850, 18499, 26008, ...

[ 0.084716796875, 0.044586181640625, 0.077392578125, 0.153564453125, 0.241455078125, 0.20556640625, 0.051025390625, 0.0245513916015625, 0.139892578125, 0.177001953125, 0.1380615234375, 0.22412109375, 0.1654052734375, 0.10302734375, 0.1046142578125, 0.07470703125, 0.1392822265625, 0.1...

embed

6365748_c0

6365748

haskell

0

Title: How to serve an image of the screen as an input to a program, in Haskell Problem title: How to serve an image of the screen as an input to a program, in Haskell Tags: screenshot, haskell, graphics Problem: How to serve an image of the screen as an input to a program, in Haskell I'd like to write a function (I'm ...

How to serve an image of the screen as an input to a program, in Haskell How to serve an image of the screen as an input to a program, in Haskell screenshot haskell graphics How Haskell How to serve an image of the screen as an input to a program, in Haskell I'd like to write a function (I'm using Haskell) that's capab...

[ 0.00189971923828125, 0.0074462890625, -0.00762939453125, 0.036376953125, -0.00028228759765625, 0.016845703125, 0.00021266937255859375, -0.01348876953125, -0.010986328125, -0.041015625, 0.01251220703125, -0.01806640625, -0.00006866455078125, 0.00311279296875, 0.0234375, -0.0120239257812...

[ 11249, 47, 21265, 29569, 111, 49119, 237, 107730, 1528, 20625, 142508, 142, 70, 23, 209647, 1556, 48461, 1884, 33022, 32354, 87709, 97351, 6496, 8561, 10941, 21455, 38937, 479, 26439, 5739, 16275, 36669, 13003, 137089, 10958, 11, 98169, 61590...

[ 0.0699462890625, 0.119140625, 0.2320556640625, 0.2288818359375, 0.09552001953125, 0.1995849609375, 0.1107177734375, 0.2197265625, 0.170654296875, 0.1453857421875, 0.2479248046875, 0.035369873046875, 0.0362548828125, 0.049041748046875, 0.240234375, 0.11328125, 0.1365966796875, 0.066...

embed

28327491_c0

28327491

haskell

0

Title: Cabal: Does not exists message in windows 7 Problem title: Cabal: Does not exists message in windows 7 Tags: haskell, cabal Problem: Cabal: Does not exists message in windows 7 When I try to update cabal, I get this. Resolving dependencies... Configuring cabal-install-1.22.0.0... cabal: does not exist Failed to ...

Cabal: Does not exists message in windows 7 Cabal: Does not exists message in windows 7 haskell cabal Cabal Does Resolving Configuring cabal-install-1.22.0.0 Failed Error ExitFailure Users AppData Roaming Cabal: Does not exists message in windows 7 When I try to update cabal, I get this. Content of my PATH variable is ...

[ 0.01104736328125, 0.001190185546875, 0.0125732421875, 0.01318359375, -0.01239013671875, 0.00994873046875, -0.00136566162109375, 0.009521484375, -0.0038909912109375, 0.0277099609375, 0.003021240234375, -0.0283203125, -0.00555419921875, -0.005279541015625, 0.00830078125, -0.0001640319824...

[ 30438, 289, 101790, 959, 32316, 7, 26008, 23, 54825, 361, 1556, 142508, 109524, 132944, 59994, 80383, 4015, 99929, 190355, 212059, 5443, 217, 17647, 379, 53400, 5659, 137989, 2777, 302, 9790, 28350, 2046, 903, 70870, 436, 139909, 77336, 4865,...

[ 0.212646484375, 0.2127685546875, 0.0966796875, 0.144287109375, 0.2061767578125, 0.09844970703125, 0.217529296875, 0.091552734375, 0.13720703125, 0.1961669921875, 0.1014404296875, 0.1802978515625, 0.2442626953125, 0.1224365234375, 0.1326904296875, 0.141357421875, 0.084228515625, 0.0...

embed

30770361_c0

30770361

haskell

0

Title: within a project can I compile a module and interactively load the compiled module within ghci? Problem title: within a project can I compile a module and interactively load the compiled module within ghci? Tags: compilation, ghc, ghci, read-eval-print-loop, haskell Problem: within a project can I compile a modu...

within a project can I compile a module and interactively load the compiled module within ghci? within a project can I compile a module and interactively load the compiled module within ghci? compilation ghc ghci read-eval-print-loop haskell within a project can I compile a module and interactively load the compiled mo...

[ -0.00872802734375, -0.0106201171875, -0.0023651123046875, 0.00970458984375, -0.001922607421875, 0.012451171875, 0.01275634765625, -0.005645751953125, -0.0010528564453125, -0.029296875, -0.0106201171875, -0.0108642578125, -0.0040283203125, -0.01324462890625, 0.00927734375, 0.00708007812...

[ 28032, 13452, 831, 9969, 1340, 88996, 136, 212398, 72367, 375, 5974, 31380, 318, 87, 98352, 238, 12301, 1405, 35662, 28354, 1556, 142508, 10, 23, 20625, 4488, 678, 64194, 109524, 45367, 3060, 4527, 1543, 181135, 40894, 124374, 77546, 17366, ...

[ 0.16455078125, 0.1751708984375, 0.1181640625, 0.1834716796875, 0.1744384765625, 0.260009765625, 0.0467529296875, 0.18505859375, 0.1927490234375, 0.06817626953125, 0.172607421875, 0.1517333984375, 0.1981201171875, 0.015533447265625, 0.1734619140625, 0.12158203125, 0.1004638671875, 0...

embed

55053645_c0

55053645

haskell

0

Title: How would I remove borders from all Floating windows in XMonad Problem title: How would I remove borders from all Floating windows in XMonad Tags: haskell, xmonad Problem: How would I remove borders from all Floating windows in XMonad There are several similar questions but none quite solve it for me, for exampl...

How would I remove borders from all Floating windows in XMonad How would I remove borders from all Floating windows in XMonad haskell xmonad all How Floating XMonad How would I remove borders from all Floating windows in XMonad There are several similar questions but none quite solve it for me, for example this questio...

[ 0.01318359375, 0.042236328125, -0.01251220703125, 0.003997802734375, 0.01495361328125, 0.0130615234375, 0.0235595703125, -0.0240478515625, 0.00811767578125, -0.006378173828125, 0.00830078125, -0.0026702880859375, 0.008056640625, 0.0152587890625, -0.015869140625, -0.01214599609375, -0...

[ 11249, 2806, 87388, 132988, 7, 756, 38699, 26518, 54825, 1193, 46674, 712, 1295, 23, 1556, 142508, 1022, 3796, 86869, 3642, 4393, 86667, 21917, 6056, 5021, 113469, 14202, 21185, 41884, 4734, 76896, 23937, 55516, 4527, 12765, 959, 85526, 29806...

[ 0.028350830078125, 0.05352783203125, 0.1695556640625, 0.2269287109375, 0.09613037109375, 0.10491943359375, 0.1778564453125, 0.142822265625, 0.1695556640625, 0.07598876953125, 0.152099609375, 0.1611328125, 0.04595947265625, 0.011810302734375, 0.05859375, 0.175048828125, 0.020675659179...

embed

55874465_c1

55874465

haskell

1

verification. 3) Lift any data processing that could fail into the IO monad and use Control.Exception.throwIO . 4) Lift any data processing that could fail into the IO monad and use fail (I've read that using fail frowned on by the community?) 5) Return an Either or something similar, and let that bubble up through al...

[ -0.00189208984375, 0.024658203125, -0.00142669677734375, 0.0174560546875, 0.022705078125, 0.00433349609375, 0.0216064453125, -0.0189208984375, 0.01251220703125, -0.007415771484375, -0.000640869140625, -0.031005859375, 0.0174560546875, -0.0164794921875, -0.00634765625, -0.01458740234375...

[ 493, 41274, 8439, 166562, 2499, 2053, 9433, 214, 5809, 35782, 3934, 17780, 2667, 712, 4527, 27131, 19279, 63928, 927, 15555, 13956, 17368, 70, 26908, 21162, 173340, 142, 4565, 9319, 21373, 2633, 73163, 62775, 272, 58621, 1902, 3060, 50218, ...

[ 0.182861328125, 0.209716796875, 0.09063720703125, 0.1954345703125, 0.030670166015625, 0.111572265625, 0.087646484375, 0.0279998779296875, 0.05194091796875, 0.2083740234375, 0.050384521484375, 0.2054443359375, 0.11962890625, 0.16064453125, 0.07049560546875, 0.1966552734375, 0.07946777...

embed

40761424_c0

40761424

haskell

0

Title: Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ Problem title: Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ Tags: haskell Problem: Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ This is the code of my program: funct :: Double -> Double ...

Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ haskell Haskell Couldn Double x..y Haskell Couldn't match expected type ‘Double’ with actual type ‘Int’ This is the code of my program: and error, which I'm getting: I real...

[ -0.01171875, -0.00823974609375, 0.00933837890625, -0.0028228759765625, -0.010009765625, 0.0091552734375, -0.013671875, -0.01177978515625, 0.0084228515625, 0.01129150390625, -0.005584716796875, -0.0091552734375, 0.01531982421875, -0.039794921875, -0.002532958984375, 0.00482177734375, ...

[ 20625, 142508, 191147, 3768, 18, 14858, 84751, 10644, 8331, 34, 2661, 678, 8561, 4153, 1556, 19, 107172, 1022, 53, 18151, 1528, 18499, 20949, 6183, 3525, 9014, 31577, 30022, 65771, 7477, 15390, 30646, 214, 831, 28219, 15400, 17378, 83, 360,...

[ 0.138916015625, 0.237060546875, 0.1173095703125, 0.0906982421875, 0.183349609375, 0.18701171875, 0.1595458984375, 0.212646484375, 0.103515625, 0.1390380859375, 0.208984375, 0.06414794921875, 0.18603515625, 0.1339111328125, 0.118896484375, 0.0247802734375, 0.2412109375, 0.0797119140...

embed

51089784_c0

51089784

haskell

0

Title: How can I desugar my GADTs? Problem title: How can I desugar my GADTs? Tags: haskell, syntactic-sugar, gadt Problem: How can I desugar my GADTs? I was reading Coercions and Roles for Dummies and the author off handedly mentioned that GADTs were just syntactic sugar. GADTs are syntactic sugar on top of (~) so exp...

How can I desugar my GADTs? How can I desugar my GADTs? haskell syntactic-sugar gadt How GADTs Language DataKinds TypeOperators HList Empty Cons How can I desugar my GADTs? I was reading Coercions and Roles for Dummies and the author off handedly mentioned that GADTs were just syntactic sugar. Now the author didn't go ...

[ 0.01123046875, 0.0113525390625, -0.008056640625, -0.004058837890625, 0.01104736328125, 0.00933837890625, -0.0157470703125, -0.01611328125, -0.0036773681640625, 0.0120849609375, 0.0037689208984375, -0.033447265625, -0.0279541015625, 0.005615234375, 0.0062255859375, 0.00130462646484375, ...

[ 11249, 831, 224, 34, 1970, 23749, 41072, 7, 87, 759, 1556, 142508, 6002, 102, 49086, 1159, 13384, 83658, 11809, 7250, 60457, 156823, 572, 154663, 31678, 39215, 1311, 56, 5746, 136, 2777, 100, 27919, 32747, 101087, 241522, 16565, 2852, 8781,...

[ 0.054595947265625, 0.06207275390625, 0.168212890625, 0.1365966796875, 0.197998046875, 0.1702880859375, 0.241943359375, 0.16064453125, 0.0158538818359375, 0.049591064453125, 0.11328125, 0.2110595703125, 0.07879638671875, 0.1112060546875, 0.07421875, 0.08770751953125, 0.17138671875, ...

embed

76420632_c0

76420632

haskell

0

Title: Why the prism _Show does not work for a list? Problem title: Why the prism _Show does not work for a list? Tags: haskell-lens, haskell Problem: Why the prism _Show does not work for a list? How to explain the 3rd result? Why is the returned list empty? >[Just 1, Just 2, Nothing, Just 3]^..folded._Just [1,2,3] >"...

Why the prism _Show does not work for a list? Why the prism _Show does not work for a list? haskell-lens haskell Why _Show Just Nothing folded._Just _Show::Maybe folded._Show Maybe _Just Prism Read Show Why the prism _Show does not work for a list? How to explain the 3rd result? Why is the returned list empty? _Just an...

[ -0.0208740234375, -0.005157470703125, 0.0084228515625, 0.01416015625, -0.015869140625, 0.033447265625, 0.019775390625, -0.01318359375, 0.0111083984375, 0.022216796875, 0.01080322265625, 0.005218505859375, -0.000156402587890625, 0.0198974609375, -0.016845703125, -0.01318359375, -0.003...

[ 44084, 4067, 39, 101, 168660, 959, 4488, 5303, 100, 1556, 142508, 1977, 9563, 182747, 18344, 48141, 127794, 82419, 372, 83425, 20204, 4764, 17367, 73342, 138, 4216, 16750, 176377, 201505, 136, 4432, 14602, 41206, 2046, 106, 116, 678, 3098, ...

[ 0.060302734375, 0.15283203125, 0.1363525390625, 0.0174560546875, 0.253173828125, 0.05926513671875, 0.0950927734375, 0.162841796875, 0.0163726806640625, 0.0706787109375, 0.2001953125, 0.1048583984375, 0.101806640625, 0.1204833984375, 0.08795166015625, 0.08544921875, 0.1473388671875, ...

embed

45840094_c0

45840094

haskell

0

Title: When does `modify` copy the vector? Problem title: When does `modify` copy the vector? Tags: immutability, vector, haskell, functional-programming, performance Problem: When does `modify` copy the vector? From https://hackage.haskell.org/package/vector-0.12.0.1/docs/Data-Vector.html#v:modify Apply a destructive ...

When does `modify` copy the vector? When does `modify` copy the vector? immutability vector haskell functional-programming performance When When does `modify` copy the vector? From https://hackage.haskell.org/package/vector-0.12.0.1/docs/Data-Vector.html#v:modify This sounds like it can have drastically different perfo...

[ -0.013916015625, 0.026611328125, -0.0159912109375, 0.0113525390625, 0.004486083984375, -0.006591796875, -0.00836181640625, -0.00897216796875, 0.005645751953125, 0.021240234375, 0.008056640625, -0.0283203125, 0.00567626953125, 0.00142669677734375, -0.0086669921875, 0.00848388671875, -...

[ 14847, 14602, 13415, 40383, 43658, 173, 18770, 566, 14311, 41159, 1556, 142508, 123309, 28966, 23718, 9473, 70, 139509, 10557, 29102, 272, 23320, 15654, 102014, 137989, 26455, 7693, 334, 102678, 831, 211228, 12921, 62816, 115840, 2811, 3687, 16...

[ 0.16259765625, 0.07745361328125, 0.1983642578125, 0.2349853515625, 0.2479248046875, 0.192626953125, 0.19921875, 0.0418701171875, 0.1453857421875, 0.08447265625, 0.132080078125, 0.2301025390625, 0.11572265625, 0.08453369140625, 0.160888671875, 0.00640869140625, 0.005645751953125, 0....

embed

54261834_c0

54261834

haskell

0

Title: Simple example of call-by-need Problem title: Simple example of call-by-need Tags: r, lazy-evaluation, haskell, call-by-need Problem: Simple example of call-by-need I'm trying to understand the theorem behind "call-by-need." I do understand the definition, but I'm a bit confused. I would like to see a simple exa...

Simple example of call-by-need Simple example of call-by-need r lazy-evaluation haskell call-by-need Simple Simple example of call-by-need I'm trying to understand the theorem behind "call-by-need." I do understand the definition, but I'm a bit confused. I would like to see a simple example which shows how call-by-need...

[ 0.016845703125, 0.0294189453125, 0.01031494140625, 0.01409912109375, 0.0089111328125, 0.01409912109375, 0.01708984375, -0.00130462646484375, 0.0150146484375, -0.0235595703125, -0.005645751953125, -0.0272216796875, -0.0118408203125, 0.004486083984375, 0.03173828125, 0.00372314453125, ...

[ 60552, 27781, 11782, 1272, 86, 297, 1690, 21, 3285, 159258, 1556, 142508, 28219, 58391, 50155, 85763, 9, 80934, 55681, 8781, 45831, 3642, 43240, 20625, 4527, 903, 8562, 219836, 56037, 46876, 8060, 60213, 11627, 152653, 11, 136, 21373, 12921, ...

[ 0.1634521484375, 0.1868896484375, 0.1929931640625, 0.20166015625, 0.153564453125, 0.189453125, 0.1219482421875, 0.09552001953125, 0.1744384765625, 0.151123046875, 0.11328125, 0.24609375, 0.057952880859375, 0.139404296875, 0.052581787109375, 0.1878662109375, 0.046600341796875, 0.071...

embed

63561210_c0

63561210

haskell

0

Title: Is there any general functor (not limited to endofunctor) usage in programming? Problem title: Is there any general functor (not limited to endofunctor) usage in programming? Tags: functor, category-theory, haskell, javascript Problem: Is there any general functor (not limited to endofunctor) usage in programmin...

Is there any general functor (not limited to endofunctor) usage in programming? Is there any general functor (not limited to endofunctor) usage in programming? functor category-theory haskell javascript Is there any general functor (not limited to endofunctor) usage in programming? Is there any general functor (not lim...

[ 0.00732421875, -0.00531005859375, 0.011962890625, -0.0052490234375, 0.0035247802734375, 0.00909423828125, -0.0093994140625, -0.0206298828125, -0.00177764892578125, -0.0233154296875, -0.006927490234375, -0.030517578125, 0.009765625, 0.0032501220703125, -0.021240234375, -0.00170135498046...

[ 2499, 4537, 7477, 18770, 84046, 22, 246, 16498, 127689, 23, 56037, 449, 2685, 10869, 95487, 2347, 30675, 1556, 142508, 136951, 2071, 28219, 31635, 212423, 3249, 45646, 8781, 1884, 22460, 532, 2667, 712, 34292, 9615, 46876, 1391, 1042, 17721, ...

[ 0.06549072265625, 0.205322265625, 0.1947021484375, 0.22216796875, 0.08087158203125, 0.1263427734375, 0.172607421875, 0.198974609375, 0.18994140625, 0.053985595703125, 0.14794921875, 0.07244873046875, 0.0625, 0.045013427734375, 0.2032470703125, 0.045166015625, 0.0048828125, 0.107604...

embed

24183749_c0

24183749

haskell

0

Title: Use type synonym in type declaration mapping Problem title: Use type synonym in type declaration mapping Tags: haskell, type-families Problem: Use type synonym in type declaration mapping I've implemented a map type type family like this type family MapT (t :: * -> *) (e::[*]) type instance MapT t '[] = '[] type...

Use type synonym in type declaration mapping Use type synonym in type declaration mapping haskell type-families Use MapT MList Maybe Type Use type synonym in type declaration mapping I've implemented a map type type family like this It works with a type constructor : gives However, I try It doesn't work. I tried type f...

[ -0.0062255859375, 0.0172119140625, 0.002777099609375, -0.01507568359375, -0.0169677734375, -0.00634765625, 0.01025390625, 0.018798828125, 0.0159912109375, -0.00982666015625, -0.0010833740234375, -0.0101318359375, -0.004425048828125, 0.017822265625, -0.005950927734375, 0.008544921875, ...

[ 36836, 10644, 164661, 21635, 291, 26783, 1556, 142508, 69128, 42719, 618, 276, 154663, 83425, 60457, 29479, 22288, 14449, 43240, 678, 64549, 748, 76199, 9790, 18, 4488, 86869, 2053, 50986 ]

[ 0.06982421875, 0.2308349609375, 0.2196044921875, 0.1197509765625, 0.14208984375, 0.04229736328125, 0.078857421875, 0.1629638671875, 0.1002197265625, 0.117431640625, 0.102294921875, 0.027557373046875, 0.171142578125, 0.0164947509765625, 0.2027587890625, 0.049835205078125, 0.1257324218...

embed

21056605_c0

21056605

haskell

0

Title: Self generating list where each element appends some elements to the end Problem title: Self generating list where each element appends some elements to the end Tags: haskell Problem: Self generating list where each element appends some elements to the end I'm looking for a way to do something like this. Say we ...

Self generating list where each element appends some elements to the end Self generating list where each element appends some elements to the end haskell Self generating list where each element appends some elements to the end I'm looking for a way to do something like this. Say we start with 1. For every number odd nu...

[ 0.0025177001953125, 0.02978515625, 0.004241943359375, 0.0086669921875, -0.00384521484375, 0.021240234375, -0.020751953125, 0.01287841796875, 0.031494140625, -0.0439453125, 0.019287109375, -0.0255126953125, 0.0003204345703125, 0.03515625, 0.000949859619140625, 0.000446319580078125, 0....

[ 55347, 12663, 1916, 5303, 7440, 12638, 12830, 114689, 6468, 3060, 80854, 47, 70, 3564, 1556, 142508, 16487, 3917, 54, 1884, 903, 4034, 678, 615, 1326, 11907, 14012, 70270, 15190, 131815, 3853, 85398, 160743, 6713, 305, 483, 17480, 616, 543,...

[ 0.1927490234375, 0.2103271484375, 0.1005859375, 0.25146484375, 0.057464599609375, 0.14697265625, 0.196044921875, 0.15625, 0.122314453125, 0.046600341796875, 0.18603515625, 0.1007080078125, 0.009124755859375, 0.21142578125, 0.1597900390625, 0.260009765625, 0.04193115234375, 0.050567...

embed

39319706_c0

39319706

haskell

0

Title: How to pattern match against Text without using OverloadedStrings? Problem title: How to pattern match against Text without using OverloadedStrings? Tags: haskell, pattern-matching, string Problem: How to pattern match against Text without using OverloadedStrings? This works: {-# LANGUAGE OverloadedStrings #-} m...

How to pattern match against Text without using OverloadedStrings? How to pattern match against Text without using OverloadedStrings? haskell pattern-matching string OverloadedStrings How Text LANGUAGE How to pattern match against Text without using OverloadedStrings? This works: Without the OverloadedStrings extension...

[ 0.007476806640625, -0.01409912109375, 0.0084228515625, 0.0218505859375, -0.0126953125, -0.005035400390625, -0.000812530517578125, -0.016357421875, 0.01397705078125, -0.00555419921875, 0.029296875, -0.026611328125, -0.00543212890625, -0.006927490234375, 0.01324462890625, -0.003372192382...

[ 11249, 103510, 14858, 26548, 24129, 15490, 9578, 63033, 71713, 5180, 47, 1556, 142508, 98753, 79315, 297, 98064, 17368, 43240, 177417, 111938, 44, 58, 111, 10644, 23351, 214, 22027, 18, 9969, 1340, 32354, 759, 97249, 29102, 107003, 20625, 695...

[ 0.04534912109375, 0.2205810546875, 0.2244873046875, 0.2060546875, 0.173583984375, 0.09173583984375, 0.0972900390625, 0.1424560546875, 0.126953125, 0.08380126953125, 0.0239410400390625, 0.066650390625, 0.1666259765625, 0.1851806640625, 0.131591796875, 0.010986328125, 0.048614501953125...

embed

70131338_c0

70131338

haskell

0

Title: Infinite loop with [2,2..20] in Haskell using ghci Problem title: Infinite loop with [2,2..20] in Haskell using ghci Tags: haskell Problem: Infinite loop with [2,2..20] in Haskell using ghci I am just staring with Haskell reading the http://learnyouahaskell.com book. In the Texas Ranges section the author shows ...

Infinite loop with [2,2..20] in Haskell using ghci Infinite loop with [2,2..20] in Haskell using ghci haskell ghci Infinite Haskell Infinite loop with [2,2..20] in Haskell using ghci I am just staring with Haskell reading the http://learnyouahaskell.com book. In the Texas Ranges section the author shows code for specif...

[ -0.0067138671875, -0.003753662109375, -0.0025482177734375, 0.011962890625, 0.005096435546875, 0.0185546875, -0.006317138671875, 0.00090789794921875, 0.01416015625, -0.003875732421875, 0.0208740234375, -0.01123046875, 0.008056640625, 0.01361083984375, 0.01153564453125, 0.01409912109375,...

[ 134322, 13, 40956, 678, 304, 5442, 1549, 20625, 142508, 17368, 31380, 318, 23, 1556, 5, 6057, 16454, 796, 7232, 12877, 31464, 142462, 7, 18151, 48502, 151138, 29954, 37457, 6002, 86531, 53, 169, 27781, 617, 127877, 156100, 3229, 11675, 2046...

[ 0.1790771484375, 0.012969970703125, 0.213134765625, 0.05352783203125, 0.131591796875, 0.1973876953125, 0.2047119140625, 0.1405029296875, 0.239501953125, 0.025726318359375, 0.1204833984375, 0.1502685546875, 0.003173828125, 0.0875244140625, 0.0074462890625, 0.04486083984375, 0.05627441...

embed

32250989_c1

32250989

haskell

1

htTypes. *DhtTypes> Hash20Bytes [0..10] Loading package array-0.4.0.1 ... linking ... done. Loading package deepseq-1.3.0.1 ... linking ... done. Loading package bytestring-0.10.0.2 ... linking ... done. Loading package bytestring-builder-0.10.6.0.0 ... linking ... done. 0123456789a *DhtTypes> I have already read ghci ...

[ 0.01361083984375, -0.003692626953125, -0.01806640625, 0.0093994140625, -0.01422119140625, 0.0118408203125, -0.002105712890625, -0.006378173828125, -0.0057373046875, -0.00689697265625, 0.0005950927734375, -0.040771484375, 0.0033416748046875, -0.0177001953125, -0.014892578125, 0.00805664...

[ 9703, 196707, 397, 162087, 1549, 75358, 963, 228006, 98169, 10298, 53, 121254, 102014, 3126, 16940, 53894, 184, 864, 81046, 390, 67, 91693, 10179, 133684, 177149, 56, 122887, 99929, 3742, 121317, 153781, 11, 12301, 31380, 318, 959, 72367, 214...

[ 0.170654296875, 0.295166015625, 0.0208282470703125, 0.13134765625, 0.096435546875, 0.04852294921875, 0.0517578125, 0.17626953125, 0.1324462890625, 0.07037353515625, 0.006591796875, 0.0992431640625, 0.1251220703125, 0.08172607421875, 0.0287322998046875, 0.1173095703125, 0.047882080078...

embed

11069136_c0

11069136

haskell

0

Title: Haskell Parse Error - Naked Expression at Top Level Problem title: Haskell Parse Error - Naked Expression at Top Level Tags: haskell Problem: Haskell Parse Error - Naked Expression at Top Level I have a haskell file test.hs. In this file I have written a function doubleMe x: x + x this is the only function in th...

Haskell Parse Error - Naked Expression at Top Level Haskell Parse Error - Naked Expression at Top Level haskell Haskell Parse Error Naked Expression Top Level test.hs test.hs:1:1 Failed loaded:none Haskell Parse Error - Naked Expression at Top Level I have a haskell file test.hs. In this file I have written a function ...

[ -0.00921630859375, 0.01531982421875, -0.005950927734375, -0.00726318359375, 0.005340576171875, 0.036865234375, -0.001129150390625, -0.006622314453125, 0.0089111328125, -0.0322265625, -0.0130615234375, -0.032470703125, 0.0057373046875, -0.00897216796875, 0.0194091796875, 0.0017318725585...

[ 20625, 142508, 2392, 184, 212059, 353, 12225, 25129, 1830, 99, 4792, 84136, 1556, 3034, 127, 7, 19721, 190355, 72367, 157, 11435, 59121, 32354, 903, 4734, 31380, 318, 75101, 105876, 10644, 141, 5, 15490, 66747, 25632, 18499, 22304, 366, 24,...

[ 0.113525390625, 0.2252197265625, 0.149658203125, 0.08544921875, 0.150390625, 0.1634521484375, 0.2000732421875, 0.1474609375, 0.054595947265625, 0.054901123046875, 0.1239013671875, 0.1884765625, 0.1031494140625, 0.197265625, 0.09686279296875, 0.0160064697265625, 0.030914306640625, 0...

embed

36899597_c0

36899597

haskell

0

Title: Why can't I replace libraries distributed with GHC? What would happen if I did? Problem title: Why can't I replace libraries distributed with GHC? What would happen if I did? Tags: ghc, haskell-stack, haskell Problem: Why can't I replace libraries distributed with GHC? What would happen if I did? I see...

Why can't I replace libraries distributed with GHC? What would happen if I did? Why can't I replace libraries distributed with GHC? What would happen if I did? ghc haskell-stack haskell Why GHC What Why can't I replace libraries distributed with GHC? What would happen if I did? I see in this answer and this o...

[ -0.0107421875, 0.005523681640625, 0.00689697265625, 0.006072998046875, -0.000827789306640625, -0.00537109375, -0.0341796875, -0.001495361328125, -0.00469970703125, 0.018310546875, 0.003997802734375, -0.0174560546875, -0.00537109375, 0.010498046875, -0.0002918243408203125, 0.00643920898...

[ 44084, 831, 3768, 18, 91995, 35773, 10484, 15917, 678, 527, 73265, 53383, 2174, 31380, 238, 1556, 142508, 9, 590, 2594, 4865, 2806, 104643, 64113, 1221, 36356, 152240, 38526, 6512, 23742, 2633, 3647, 390, 67, 91693, 2967, 46002, 15490, 3384...

[ 0.084716796875, 0.0985107421875, 0.0098876953125, 0.06927490234375, 0.205078125, 0.199951171875, 0.094482421875, 0.160888671875, 0.07415771484375, 0.138916015625, 0.248291015625, 0.0266876220703125, 0.007781982421875, 0.10546875, 0.10687255859375, 0.1158447265625, 0.2158203125, 0.0...

embed

74160076_c0

74160076

haskell

0

Title: Creating instance of custom class Problem title: Creating instance of custom class Tags: graph, haskell, instance Problem: Creating instance of custom class I seem to get an error message when trying to create an instance of IntegerGraph . I do not understand the error message. Any tips? Here's the code: import ...

Creating instance of custom class Creating instance of custom class graph haskell instance Data.Map qualified Data.Set Creating Map Set IntGraph MyGraph Creating instance of custom class I seem to get an error message when trying to create an instance of IntegerGraph . I do not understand the error message. Any tips? H...

[ -0.02294921875, 0.00738525390625, 0.0025787353515625, 0.00982666015625, -0.0174560546875, 0.0234375, -0.0076904296875, -0.0169677734375, 0.002960205078125, -0.0115966796875, -0.004669189453125, -0.0289306640625, 0.0167236328125, 0.0079345703125, -0.00897216796875, 0.001983642578125, ...

[ 56781, 110527, 111, 114122, 18507, 41382, 1556, 142508, 11809, 166179, 217225, 294, 126, 42719, 19943, 360, 18, 37878, 11727, 2646, 142, 18499, 26008, 31577, 28282, 44401, 959, 28219, 6305, 18151, 212059, 60075, 1632, 1286, 10750, 47, 31852, ...

[ 0.13671875, 0.260009765625, 0.056549072265625, 0.2039794921875, 0.2294921875, 0.22021484375, 0.1099853515625, 0.1976318359375, 0.049774169921875, 0.1138916015625, 0.131103515625, 0.012939453125, 0.052337646484375, 0.141357421875, 0.09716796875, 0.049835205078125, 0.125, 0.206787109...

embed

42457167_c0

42457167

haskell

0

Title: How to give a more general type to these two functions that have identical definitions? Problem title: How to give a more general type to these two functions that have identical definitions? Tags: types, haskell Problem: How to give a more general type to these two functions that have identical definitions? Is i...

How to give a more general type to these two functions that have identical definitions? How to give a more general type to these two functions that have identical definitions? types haskell How Maybe Nothing Just unsafeListHandling2 How to give a more general type to these two functions that have identical definitions?...

[ -0.010986328125, 0.00083160400390625, 0.01080322265625, -0.0172119140625, -0.000659942626953125, 0.0179443359375, 0.012451171875, -0.0234375, 0.01373291015625, -0.0019073486328125, 0.0068359375, 0.0028533935546875, 0.00836181640625, -0.00872802734375, -0.012939453125, -0.0107421875, ...

[ 11249, 8337, 1286, 4537, 10644, 6626, 32354, 31943, 6827, 80934, 6097, 52895, 1556, 142508, 83425, 182747, 9563, 51, 115840, 154663, 135679, 2069, 304, 10, 47, 765, 7722, 25632, 18151, 58134, 189534, 116, 678, 60212, 164789, 16065 ]

[ 0.034454345703125, 0.07440185546875, 0.0885009765625, 0.14794921875, 0.191162109375, 0.09613037109375, 0.158935546875, 0.15673828125, 0.09222412109375, 0.1578369140625, 0.0309295654296875, 0.172119140625, 0.11962890625, 0.1968994140625, 0.107666015625, 0.1051025390625, 0.001525878906...

embed

49497808_c0

49497808

haskell

0

Title: Pattern matching on hmatrix Vector type in haskell Problem title: Pattern matching on hmatrix Vector type in haskell Tags: haskell, hmatrix, pattern-matching Problem: Pattern matching on hmatrix Vector type in haskell That question sounds trivial but I really can't find anything helping me on how to deal with it...

Pattern matching on hmatrix Vector type in haskell Pattern matching on hmatrix Vector type in haskell haskell hmatrix pattern-matching Numeric.LinearAlgebra.HMatrix Pattern Vector Double Couldn Pattern matching on hmatrix Vector type in haskell That question sounds trivial but I really can't find anything helping me on...

[ -0.025634765625, 0.0262451171875, -0.01153564453125, 0.006927490234375, 0.01708984375, -0.002288818359375, -0.03564453125, 0.0120849609375, 0.00634765625, -0.033447265625, 0.0015411376953125, -0.0284423828125, -0.0089111328125, -0.0245361328125, -0.03076171875, -0.0024871826171875, 0...

[ 9876, 22766, 14858, 214, 98, 1096, 192, 87427, 2609, 18770, 10644, 23, 1556, 142508, 103510, 98753, 93511, 93232, 429, 2844, 46592, 11, 107172, 191147, 19, 102678, 35142, 678, 8781, 27781, 42238, 20625, 72367, 186992, 5351, 81, 83, 12960, 5...

[ 0.1895751953125, 0.1737060546875, 0.2451171875, 0.07586669921875, 0.089599609375, 0.1298828125, 0.065673828125, 0.17041015625, 0.1549072265625, 0.1644287109375, 0.1466064453125, 0.0113525390625, 0.1439208984375, 0.2318115234375, 0.2275390625, 0.223388671875, 0.0159454345703125, 0.0...

embed

11382211_c0

11382211

haskell

0

Title: Is it possible to use Text or ByteString on HXT in Haskell? Problem title: Is it possible to use Text or ByteString on HXT in Haskell? Tags: web-scraping, text, hxt, haskell, bytestring Problem: Is it possible to use Text or ByteString on HXT in Haskell? I think HXT, a XML/HTML processing library in Haskell, has...

Is it possible to use Text or ByteString on HXT in Haskell? Is it possible to use Text or ByteString on HXT in Haskell? web-scraping text hxt haskell bytestring Text ByteString HXT Haskell Is it possible to use Text or ByteString on HXT in Haskell? I think HXT, a XML/HTML processing library in Haskell, has really flexi...

[ 0.022705078125, 0.01275634765625, 0.00860595703125, -0.002288818359375, -0.00070953369140625, 0.0118408203125, 0.0086669921875, -0.00885009765625, -0.0208740234375, -0.02099609375, -0.00007486343383789062, -0.038818359375, -0.01422119140625, -0.002227783203125, -0.00058746337890625, -0...

[ 2071, 442, 7722, 4527, 24129, 707, 3311, 67, 71713, 214, 98, 572, 70981, 23, 20625, 142508, 1467, 15182, 10366, 7986, 1096, 29062, 1556, 390, 91693, 92537, 127068, 9433, 35773, 6183, 110677, 113138, 150624, 37317, 45258, 69285, 1360, 1172, ...

[ 0.04205322265625, 0.0176544189453125, 0.1690673828125, 0.1590576171875, 0.248046875, 0.1126708984375, 0.09912109375, 0.1640625, 0.2255859375, 0.1414794921875, 0.06982421875, 0.1297607421875, 0.254150390625, 0.08966064453125, 0.1365966796875, 0.2509765625, 0.055389404296875, 0.10803...

embed

29002881_c1

29002881

haskell

1

still ways to optimize I am not aware of? Edit: GHC: -O -fllvm: 0.54s GHC (with unsafeWrite/unsafeRead and Word32): 0.34s g++: 0.24s g++ -O2: 0.05s python3: 2.66s Also when I change foldr to foldl' it starts allocating some memory and is 4 times slower as a result, why is that? Here is a C++ version I compared it to: ...

[ -0.0235595703125, 0.00860595703125, -0.009033203125, -0.02001953125, -0.00946044921875, -0.00750732421875, -0.006011962890625, -0.010986328125, 0.0019073486328125, -0.047119140625, -0.00186920166015625, -0.005035400390625, 0.0087890625, 0.0096435546875, 0.0003108978271484375, 0.0037689...

[ 7464, 48322, 15572, 20650, 107419, 527, 73265, 670, 15991, 3723, 39, 81730, 617, 7, 76228, 51, 115840, 1456, 18781, 309, 31345, 22543, 91887, 127089, 706, 37223, 126175, 304, 89678, 758, 17198, 50828, 363, 787, 14604, 15549, 18344, 7569, 47...

[ 0.148193359375, 0.10516357421875, 0.2027587890625, 0.1534423828125, 0.1044921875, 0.088134765625, 0.2164306640625, 0.1007080078125, 0.07269287109375, 0.0762939453125, 0.10638427734375, 0.091064453125, 0.11474609375, 0.09326171875, 0.00433349609375, 0.05145263671875, 0.1917724609375, ...

embed

20237554_c0

20237554

haskell

0

Title: How to generate a list of repeated applications of a function to the previous result of it in IO context Problem title: How to generate a list of repeated applications of a function to the previous result of it in IO context Tags: haskell Problem: How to generate a list of repeated applications of a function to ...

How to generate a list of repeated applications of a function to the previous result of it in IO context How to generate a list of repeated applications of a function to the previous result of it in IO context haskell How How to generate a list of repeated applications of a function to the previous result of it in IO c...

[ 0.004852294921875, -0.01324462890625, -0.00003981590270996094, -0.0025787353515625, -0.01483154296875, 0.0194091796875, 0.007781982421875, -0.0128173828125, -0.001129150390625, -0.060791015625, 0.00157928466796875, -0.0220947265625, -0.0054931640625, 0.00579833984375, 0.0042724609375, ...

[ 11249, 47, 139392, 10, 5303, 111, 119140, 297, 86685, 32354, 96362, 16750, 17780, 43701, 23, 1556, 142508, 29806, 2967, 31577, 86869, 3871, 38415, 42413, 5045, 1884, 8560, 67, 131527, 138256, 60742, 46132, 96759, 101935, 9844, 1286, 54811, 99...

[ 0.079833984375, 0.1685791015625, 0.2076416015625, 0.05499267578125, 0.1826171875, 0.0780029296875, 0.254638671875, 0.147216796875, 0.220458984375, 0.1575927734375, 0.1259765625, 0.1273193359375, 0.19775390625, 0.1744384765625, 0.0232391357421875, 0.151611328125, 0.2213134765625, 0....

embed

10954237_c0

10954237

haskell

0

Title: Design of a 2d coordinate vector Problem title: Design of a 2d coordinate vector Tags: haskell, types Problem: Design of a 2d coordinate vector I'm looking for a simple representation of a 2d coordinate vector. My first idea was a simple (c, c) tuple, but this doesn't suit my needs. This is what I'd want: Instan...

Design of a 2d coordinate vector Design of a 2d coordinate vector haskell types Design ScreenCoord GameCoord Coord Design of a 2d coordinate vector I'm looking for a simple representation of a 2d coordinate vector. My first idea was a simple (c, c) tuple, but this doesn't suit my needs. This is what I'd want: Instances...

[ 0.01556396484375, 0.0201416015625, -0.01483154296875, 0.019287109375, 0.01348876953125, -0.005035400390625, -0.00421142578125, -0.019287109375, 0.005889892578125, -0.004150390625, 0.001983642578125, -0.03369140625, -0.0040283203125, 0.0021209716796875, -0.046630859375, 0.0223388671875,...

[ 11724, 116, 71, 176866, 173, 18770, 13, 1556, 142508, 52895, 94831, 10625, 6651, 13547, 1311, 16487, 8781, 18811, 1363, 5117, 6528, 10, 238, 501, 370, 8705, 18, 60813, 27117, 2367, 3444, 116071, 111, 28670, 136, 5659, 11048, 83259, 117781, ...

[ 0.1934814453125, 0.162841796875, 0.136962890625, 0.1949462890625, 0.169921875, 0.17919921875, 0.0287017822265625, 0.111083984375, 0.214599609375, 0.1737060546875, 0.1597900390625, 0.1336669921875, 0.18017578125, 0.14306640625, 0.0994873046875, 0.0709228515625, 0.12109375, 0.1804199...

embed

24708918_c1

24708918

haskell

1

), OtherType, (Double, [String])) res3 <- bar inputC :: IO (([Int],String), (Int, String, Int), YetAnotherType, (Double, [String])) Is there a way to avoid this? I'm aware it would be possible to bind the result of bar inputA and use it in a function expecting a MyType , allowing the type engine to infer that the a in ...

[ -0.0096435546875, 0.01251220703125, -0.0040283203125, 0.009033203125, 0.00830078125, 0.00072479248046875, -0.027099609375, 0.00060272216796875, 0.01446533203125, -0.015625, -0.000759124755859375, -0.004913330078125, -0.00008058547973632812, 0.0035552978515625, -0.0126953125, -0.0030212...

[ 247, 64511, 196707, 34, 2661, 71713, 214, 3332, 363, 4426, 1909, 107730, 441, 17780, 18, 23351, 63519, 7251, 126340, 3917, 71864, 903, 7722, 68557, 16750, 284, 4527, 32354, 41206, 2646, 10644, 87907, 53498, 10, 15490, 143726, 8668, 209201, ...

[ 0.001556396484375, 0.1693115234375, 0.29345703125, 0.031646728515625, 0.0938720703125, 0.1031494140625, 0.000885009765625, 0.151611328125, 0.1708984375, 0.016265869140625, 0.1546630859375, 0.171142578125, 0.0433349609375, 0.1688232421875, 0.055145263671875, 0.0755615234375, 0.1431884...

embed

26050460_c0

26050460

haskell

0

Title: Excluding Numbers for Sieve of Sundaram Problem title: Excluding Numbers for Sieve of Sundaram Tags: sieve-algorithm, haskell Problem: Excluding Numbers for Sieve of Sundaram I'm working on implementing the Sieve of Sundaram . The first step is to get a list of Integer's such that: i, j are Natural Numbers, 1 <=...

Excluding Numbers for Sieve of Sundaram Excluding Numbers for Sieve of Sundaram sieve-algorithm haskell Excluding Numbers Sieve Sundaram Integer Excluding Numbers for Sieve of Sundaram I'm working on implementing the Sieve of Sundaram . The first step is to get a list of Integer's such that: Here's my function. It's su...

[ -0.021240234375, 0.0057373046875, -0.00860595703125, 0.0208740234375, 0.00274658203125, 0.0198974609375, -0.0115966796875, 0.0086669921875, -0.021484375, -0.00177764892578125, -0.0059814453125, -0.017822265625, 0.004791259765625, -0.0101318359375, -0.001556396484375, 0.007049560546875,...

[ 110823, 822, 6238, 103332, 100, 727, 272, 111, 96155, 2198, 78, 3134, 100628, 2783, 1556, 142508, 44401, 20697, 29479, 5117, 29954, 2046, 5303, 6044, 11853, 32354, 134598, 139392, 370, 99726, 756, 14, 1647, 14858, 36917, 185190, 20949, 351, ...

[ 0.1109619140625, 0.154052734375, 0.0374755859375, 0.2012939453125, 0.05194091796875, 0.1767578125, 0.19775390625, 0.109130859375, 0.1380615234375, 0.2213134765625, 0.1312255859375, 0.2041015625, 0.07098388671875, 0.0687255859375, 0.1156005859375, 0.205322265625, 0.2012939453125, 0....

embed

46481633_c1

46481633

haskell

1

.0.0-HnYRxRg1qoiyMKwsCMtby:Lib" { tick function "otherFunc" on line 9; } when we then do the next step and try to generate the overlay stack exec hpc -- overlay --hpcdir=.stack-work/dist/x86_64-linux/Cabal-1.24.2.0/hpc/ --srcdir=. myDraft.txt the process falls over and we get the following error: hpc: can not find hpcT...

[ 0.01531982421875, 0.0079345703125, 0.00180816650390625, 0.0252685546875, -0.010986328125, -0.006103515625, -0.0216064453125, -0.0007476806640625, -0.0001277923583984375, -0.036376953125, -0.01177978515625, -0.0174560546875, 0.00830078125, -0.0029754638671875, 0.0069580078125, 0.0015792...

[ 5, 99929, 841, 85054, 10618, 19725, 36498, 1272, 104820, 1053, 2594, 32354, 126340, 97249, 238, 13315, 483, 11737, 29954, 9790, 139392, 645, 5259, 177261, 1119, 3240, 118258, 127, 57095, 936, 590, 18244, 46295, 15276, 13307, 2397, 6077, 20370...

[ 0.00830078125, 0.185791015625, 0.0552978515625, 0.03948974609375, 0.05731201171875, 0.0838623046875, 0.0208587646484375, 0.2108154296875, 0.210693359375, 0.06402587890625, 0.11962890625, 0.0921630859375, 0.114501953125, 0.151611328125, 0.1239013671875, 0.000213623046875, 0.0739746093...

embed

55821151_c0

55821151

haskell

0

Title: How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? Problem title: How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? Tags: haskell Problem: How does Haskell know to retain Nothing as nothing when passed to a lambda that ret...

How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? How does Haskell know to retain Nothing as nothing when passed to a lambda that returns Just x? haskell How Haskell Nothing Just Prelude Non Num Maybe Use FlexibleContexts When How does Haskell know to retain Nothing as noth...

[ -0.0111083984375, 0.008056640625, 0.0284423828125, -0.0177001953125, 0.021484375, 0.026611328125, 0.0203857421875, -0.0031890869140625, 0.022216796875, -0.00119781494140625, -0.0111083984375, -0.056396484375, -0.0230712890625, 0.00154876708984375, 0.004547119140625, -0.01953125, -0.0...

[ 11249, 20625, 142508, 3714, 112033, 73, 182747, 237, 33720, 115081, 47, 21, 6492, 85, 30646, 9563, 1022, 1556, 1914, 822, 112, 3775, 52782, 83425, 36836, 180842, 2661, 22829, 14847, 3229, 28219, 15400, 22027, 18, 18499, 36356, 7565, 3934, 1...

[ 0.048309326171875, 0.138427734375, 0.27392578125, 0.1165771484375, 0.152587890625, 0.1114501953125, 0.2005615234375, 0.1153564453125, 0.1815185546875, 0.093017578125, 0.049407958984375, 0.0160675048828125, 0.1702880859375, 0.1190185546875, 0.1136474609375, 0.10546875, 0.1102294921875...

embed

42133257_c0

42133257

haskell

0

Title: Data constructor error when implementing state monad? Problem title: Data constructor error when implementing state monad? Tags: haskell, monads Problem: Data constructor error when implementing state monad? I'm going through the state monad here and I'm trying to implement: import Control.Monad.Reader import Co...

Data constructor error when implementing state monad? Data constructor error when implementing state monad? haskell monads Control.Monad.Reader Control.Monad.Writer Control.Monad.State Data Stack State Perhaps StateT Data constructor error when implementing state monad? I'm going through the state monad here and I'm tr...

[ -0.005340576171875, 0.00457763671875, -0.011474609375, 0.001708984375, 0.0032196044921875, 0.0040283203125, -0.006103515625, -0.000270843505859375, -0.01361083984375, -0.0301513671875, 0.0152587890625, -0.01470947265625, 0.00799560546875, -0.0081787109375, -0.012939453125, -0.007873535...

[ 11809, 64549, 748, 18499, 3229, 29479, 11341, 2667, 712, 1556, 142508, 27131, 46674, 31345, 135206, 6512, 2594, 22836, 181799, 618, 8305, 3688, 31577, 33306, 25632, 2022, 87, 132283, 9844, 62822 ]

[ 0.135986328125, 0.2144775390625, 0.1568603515625, 0.18359375, 0.03204345703125, 0.166259765625, 0.1802978515625, 0.146728515625, 0.2080078125, 0.095458984375, 0.210205078125, 0.15673828125, 0.10430908203125, 0.0865478515625, 0.1171875, 0.07275390625, 0.0858154296875, 0.154418945312...

embed

48768131_c0

48768131

haskell

0

Title: Happstack SSL error - wrong tag Problem title: Happstack SSL error - wrong tag Tags: happstack, certbot, haskell, ssl Problem: Happstack SSL error - wrong tag I am trying to run happstack-tls server using certificate generated by certbot, however, when I run it I get user error (error:0D0680A8:asn1 encoding rout...

Happstack SSL error - wrong tag Happstack SSL error - wrong tag happstack certbot haskell ssl Happstack SSL error:0D0680A8:asn1 routines:asn1_check_tlen:wrong TLSConf csr-certbot.der key-certbot.pem Server Happstack SSL error - wrong tag I am trying to run happstack-tls server using certificate generated by certbot, ho...

[ 0.020263671875, 0.0147705078125, 0.00604248046875, 0.006591796875, -0.00958251953125, -0.01165771484375, -0.0130615234375, 0.00714111328125, -0.0164794921875, -0.0164794921875, 0.00005054473876953125, -0.017333984375, 0.01080322265625, 0.011474609375, -0.01220703125, 0.002716064453125,...

[ 208612, 590, 2594, 103527, 18499, 44691, 7909, 256, 6366, 35649, 9190, 1556, 142508, 24861, 53861, 397, 9016, 4836, 284, 1019, 162, 19, 418, 124374, 78292, 55957, 35133, 20602, 420, 84563, 820, 22799, 72508, 22687, 31577, 11675, 18, 8080, 1...

[ 0.2393798828125, 0.203125, 0.172119140625, 0.2061767578125, 0.1734619140625, 0.18994140625, 0.2138671875, 0.12939453125, 0.1558837890625, 0.124755859375, 0.181884765625, 0.08953857421875, 0.1820068359375, 0.1519775390625, 0.0260467529296875, 0.0181732177734375, 0.123291015625, 0.16...

embed

9306871_c1

9306871

haskell

1

v a) -> v a -> a foo = fold (+) 1 Looks fairly sane to me. Right? Wrong. > foo ((1::Int) :. ()) Couldn't match type `Int' with `()' When using functional dependencies to combine Fold (a :. ()) a, arising from the dependency `v -> a' in the instance declaration in `Data.Vec.Base' Fold (Int :. ()) (), arising from a use...

[ -0.00836181640625, 0.003936767578125, -0.01055908203125, -0.01055908203125, 0.00182342529296875, -0.004119873046875, -0.0361328125, -0.005645751953125, -0.006134033203125, -0.0279541015625, -0.0191650390625, -0.022216796875, -0.003448486328125, 0.0184326171875, -0.017578125, -0.0327148...

[ 81, 10, 33079, 5775, 31, 2203, 42822, 22183, 106, 60818, 180663, 57, 86, 35133, 41600, 12, 4153, 18, 152, 191147, 14858, 10644, 678, 132, 123309, 42548, 117538, 70163, 30077, 71, 11, 187, 27771, 334, 110527, 21635, 137989, 856, 3240, 6347...

[ 0.207763671875, 0.13427734375, 0.14501953125, 0.219482421875, 0.2197265625, 0.044921875, 0.2255859375, 0.135986328125, 0.05145263671875, 0.051025390625, 0.0190582275390625, 0.0294036865234375, 0.036956787109375, 0.08544921875, 0.0958251953125, 0.04046630859375, 0.09149169921875, 0....

embed

9624655_c0

9624655

haskell

0

Title: How can i use haskell to check if a list contains the values in a tuple Problem title: How can i use haskell to check if a list contains the values in a tuple Tags: haskell Problem: How can i use haskell to check if a list contains the values in a tuple I am writing some functions for graphs in Haskell, and I wa...

How can i use haskell to check if a list contains the values in a tuple How can i use haskell to check if a list contains the values in a tuple haskell How Bool How can i use haskell to check if a list contains the values in a tuple I am writing some functions for graphs in Haskell, and I want to check if a list of int...

[ -0.00185394287109375, -0.00823974609375, -0.0015411376953125, 0.0264892578125, -0.01708984375, -0.00494384765625, 0.004486083984375, -0.0089111328125, 0.006622314453125, -0.0205078125, 0.00537109375, -0.021484375, -0.002471923828125, 0.0157470703125, -0.00445556640625, 0.00582885742187...

[ 11249, 831, 17, 4527, 1556, 142508, 12765, 2174, 5303, 70541, 142424, 23, 370, 8705, 7, 70, 2460, 929, 47, 32562, 32354, 41382, 20625, 892, 26255, 95378, 5170, 3249, 121303, 33636, 51776, 136, 30646, 29568, 106, 10, 1892, 31089, 9077, 364...

[ 0.042938232421875, 0.045684814453125, 0.039703369140625, 0.1290283203125, 0.1602783203125, 0.2481689453125, 0.2044677734375, 0.0970458984375, 0.2154541015625, 0.1519775390625, 0.1845703125, 0.083984375, 0.125732421875, 0.203369140625, 0.0255279541015625, 0.0252685546875, 0.0720214843...

embed

17292048_c0

17292048

haskell

0

Title: Segfault reading lazy bytestring past 2^18 bytes Problem title: Segfault reading lazy bytestring past 2^18 bytes Tags: ghc, bytestring, mmap, lazy-evaluation, haskell Problem: Segfault reading lazy bytestring past 2^18 bytes Consider the following code: http://hpaste.org/90394 I am memory mapping a large 460mb f...

Segfault reading lazy bytestring past 2^18 bytes Segfault reading lazy bytestring past 2^18 bytes ghc bytestring mmap lazy-evaluation haskell Segfault Segmentation Segfault reading lazy bytestring past 2^18 bytes Consider the following code: http://hpaste.org/90394 I am memory mapping a large 460mb file to a lazy ByteS...

[ 0.0223388671875, 0.01904296875, 0.0068359375, -0.0164794921875, 0.003265380859375, 0.0035552978515625, 0.005035400390625, 0.0228271484375, 0.00011014938354492188, -0.0213623046875, 0.0162353515625, -0.0208740234375, 0.0050048828125, 0.00830078125, 0.0174560546875, -0.000457763671875, ...

[ 38462, 1021, 7136, 16454, 21, 3285, 390, 67, 91693, 11015, 116, 8353, 1819, 31380, 238, 2631, 159258, 1556, 142508, 674, 137399, 18151, 134665, 5039, 161787, 98323, 291, 26783, 21334, 116773, 6492, 11435, 47, 3311, 71713, 214, 140909, 117729,...

[ 0.2008056640625, 0.1456298828125, 0.08209228515625, 0.19189453125, 0.15625, 0.199951171875, 0.1072998046875, 0.138916015625, 0.2005615234375, 0.134521484375, 0.117431640625, 0.06170654296875, 0.237060546875, 0.06396484375, 0.0687255859375, 0.08404541015625, 0.107177734375, 0.055389...

embed

17853232_c0

17853232

haskell

0

Title: Haskell newtype with parentheses Problem title: Haskell newtype with parentheses Tags: haskell, newtype Problem: Haskell newtype with parentheses I'm trying to understand the explaination in Monads made difficult and I have a hard time figuring out the following newtype definition: newtype (FComp g f) x = FComp ...

Haskell newtype with parentheses Haskell newtype with parentheses haskell newtype Haskell FComp Functor Haskell newtype with parentheses I'm trying to understand the explaination in Monads made difficult and I have a hard time figuring out the following newtype definition: I have nowhere seen an explaination of what ne...

[ -0.0106201171875, -0.017822265625, 0.0130615234375, 0.032470703125, 0.00191497802734375, 0.0230712890625, 0.00469970703125, -0.00182342529296875, 0.0289306640625, 0.015869140625, -0.00390625, -0.027099609375, -0.003997802734375, -0.0015106201171875, -0.01220703125, -0.010009765625, -...

[ 20625, 142508, 3525, 50986, 678, 49129, 35412, 1556, 563, 108161, 28670, 18770, 28219, 73342, 60331, 6468, 34844, 7941, 26747, 80934, 26950, 125195, 3687, 10644, 21635, 26366, 1238, 62346, 32354, 51, 10770, 78381, 44457, 97841, 42, 61924, 1284,...

[ 0.12646484375, 0.2310791015625, 0.17626953125, 0.313720703125, 0.06103515625, 0.113037109375, 0.1217041015625, 0.1209716796875, 0.1234130859375, 0.1815185546875, 0.089599609375, 0.0823974609375, 0.045166015625, 0.0919189453125, 0.1314697265625, 0.0975341796875, 0.032196044921875, 0...

embed

24876175_c0

24876175

haskell

0

Title: GHC options in cabal sandboxes Problem title: GHC options in cabal sandboxes Tags: haskell, ghc, cabal Problem: GHC options in cabal sandboxes I'm doing cabal builds in various sandboxes with different combinations of GHC options. The flags I'm interested in are -O2 , -O0 , -threaded , and -feager-blackholing . ...

GHC options in cabal sandboxes GHC options in cabal sandboxes haskell ghc cabal GHC cabal.config GHC options in cabal sandboxes I'm doing cabal builds in various sandboxes with different combinations of GHC options. The flags I'm interested in are -O2 , -O0 , -threaded , and -feager-blackholing . Firstly, for which of ...

[ 0.0034637451171875, -0.00579833984375, 0.01263427734375, -0.0115966796875, -0.006317138671875, -0.0137939453125, -0.01434326171875, 0.026611328125, 0.0033416748046875, 0.01611328125, -0.01239013671875, -0.01708984375, 0.000579833984375, -0.01611328125, -0.001434326171875, 0.02819824218...

[ 527, 73265, 50717, 23, 109524, 19096, 11728, 1556, 142508, 31380, 238, 153837, 45367, 162515, 49938, 7, 60892, 20, 670, 304, 2389, 39116, 2242, 33730, 151675, 497, 2069, 10422, 59911, 756, 98169, 2704, 71924, 18822, 297, 52490, 3126, 14192, ...

[ 0.1019287109375, 0.21240234375, 0.19873046875, 0.0103759765625, 0.252197265625, 0.1396484375, 0.171630859375, 0.0830078125, 0.1845703125, 0.115234375, 0.0977783203125, 0.14208984375, 0.1072998046875, 0.05218505859375, 0.2332763671875, 0.05267333984375, 0.0223236083984375, 0.0343017...

embed

40688286_c0

40688286

haskell

0

Title: Why Symbol's value as variable is void: haskell-mode-map? Problem title: Why Symbol's value as variable is void: haskell-mode-map? Tags: emacs, haskell Problem: Why Symbol's value as variable is void: haskell-mode-map? I am config a haskell environment with this installation-from-git-repository : (add-...

Why Symbol's value as variable is void: haskell-mode-map? Why Symbol's value as variable is void: haskell-mode-map? emacs haskell Why Symbol Info-default-directory-list Why Symbol's value as variable is void: haskell-mode-map? I am config a haskell environment with this installation-from-git-repository : and ...

[ -0.0091552734375, -0.00726318359375, 0.0166015625, -0.007598876953125, -0.0189208984375, 0.031005859375, -0.015625, 0.015625, 0.003326416015625, -0.00439453125, -0.00634765625, -0.030029296875, 0.017578125, 0.0157470703125, 0.003936767578125, -0.00970458984375, -0.0103759765625, -0...

[ 44084, 131899, 3768, 34292, 237, 77336, 83, 2292, 71, 1556, 142508, 61170, 62346, 352, 2263, 7, 14048, 214810, 80581, 30675, 6562, 153837, 65998, 59720, 161063, 15769, 22799, 56136, 9803, 18499, 831, 7026, 3173, 98169, 9879, 33120, 162711, 45...

[ 0.10791015625, 0.275634765625, 0.091064453125, 0.210205078125, 0.0833740234375, 0.26611328125, 0.025177001953125, 0.1898193359375, 0.1209716796875, 0.1251220703125, 0.218505859375, 0.164306640625, 0.2066650390625, 0.087158203125, 0.1578369140625, 0.0938720703125, 0.1844482421875, 0...

embed

5073058_c0

5073058

haskell

0

Title: haskell function declaration Problem title: haskell function declaration Tags: haskell Problem: haskell function declaration I have been playing around with haskell and I found out that if I write the following function in a code file: f :: Int -> [a] -> a f idx str = last $ (take . succ) idx str then this works...

haskell function declaration haskell function declaration haskell Couldn haskell function declaration I have been playing around with haskell and I found out that if I write the following function in a code file: then this works totally fine. Naturally, I figured the code would look better without the arguments. But th...

[ 0.0169677734375, 0.00274658203125, -0.0015411376953125, 0.00131988525390625, -0.0162353515625, -0.0018463134765625, 0.000904083251953125, -0.01470947265625, 0.0003223419189453125, -0.0162353515625, 0.003509521484375, -0.00537109375, -0.016845703125, -0.004302978515625, 0.01220703125, 0...

[ 1556, 142508, 32354, 21635, 191147, 19, 75169, 33022, 25632, 18151, 11435, 903, 43240, 112668, 5885, 6713, 11522, 15490, 10750, 139392, 18499, 9790, 72367, 3934, 706, 1861, 190355, 88996, 297, 351, 13, 5809 ]

[ 0.1400146484375, 0.239990234375, 0.1973876953125, 0.1851806640625, 0.1141357421875, 0.116455078125, 0.00830078125, 0.0772705078125, 0.1036376953125, 0.12158203125, 0.089111328125, 0.01507568359375, 0.0604248046875, 0.0152435302734375, 0.047698974609375, 0.0667724609375, 0.02262878417...

embed

54078660_c0

54078660

haskell

0

Title: List operations on own types consisting of one list Problem title: List operations on own types consisting of one list Tags: ghci, haskell Problem: List operations on own types consisting of one list I got the type " Signal " that is only a list of doubles and I want to use normal list-operations like on a nativ...

List operations on own types consisting of one list List operations on own types consisting of one list ghci haskell List Signal Double Show take2 Couldn List operations on own types consisting of one list I got the type " Signal " that is only a list of doubles and I want to use normal list-operations like on a native...

[ 0.00787353515625, 0.00860595703125, -0.0032196044921875, -0.003265380859375, -0.018310546875, -0.004913330078125, -0.0135498046875, 0.0279541015625, 0.01214599609375, -0.0118408203125, -0.01025390625, -0.0184326171875, -0.004486083984375, -0.0018768310546875, -0.02685546875, -0.0014648...

[ 32036, 41018, 98, 10002, 52895, 58055, 1632, 5303, 31380, 318, 1556, 142508, 144000, 107172, 17367, 5646, 304, 191147, 19, 7, 214, 111, 10644, 4734, 41929, 3444, 4527, 3638, 21473, 1884, 24, 4935, 8331, 34, 2661, 5608, 7722, 1660, 23742, ...

[ 0.231201171875, 0.2095947265625, 0.051300048828125, 0.1448974609375, 0.2266845703125, 0.1083984375, 0.12060546875, 0.209228515625, 0.0711669921875, 0.08734130859375, 0.0938720703125, 0.1973876953125, 0.227783203125, 0.1563720703125, 0.1456298828125, 0.1854248046875, 0.1953125, 0.08...

embed

19673383_c0

19673383

haskell

0

Title: How does one use monadic properties in SmallCheck? Problem title: How does one use monadic properties in SmallCheck? Tags: testing, smallcheck, monads, haskell Problem: How does one use monadic properties in SmallCheck? I would like to write a SmallCheck property that uses IO, but I can't figure out how I am sup...

How does one use monadic properties in SmallCheck? How does one use monadic properties in SmallCheck? testing smallcheck monads haskell How SmallCheck Testable Bool How does one use monadic properties in SmallCheck? I would like to write a SmallCheck property that uses IO, but I can't figure out how I am supposed to do...

[ -0.009521484375, -0.00160980224609375, 0.0208740234375, 0.003082275390625, 0.0054931640625, 0.015869140625, -0.008544921875, -0.03466796875, -0.00421142578125, -0.02587890625, -0.002593994140625, -0.022216796875, -0.010986328125, 0.0159912109375, 0.0128173828125, 0.0047607421875, -0....

[ 11249, 14602, 1632, 4527, 2667, 11, 18403, 183871, 23, 105508, 202567, 134234, 19336, 78292, 712, 1556, 142508, 8647, 2886, 2460, 929, 1884, 33022, 57266, 17780, 26366, 3642, 134598, 69236, 110527, 61590, 3034, 10752, 1264, 160328, 18244, 2965,...

[ 0.11962890625, 0.00689697265625, 0.0220184326171875, 0.166748046875, 0.147705078125, 0.1290283203125, 0.1805419921875, 0.2159423828125, 0.027587890625, 0.180419921875, 0.30224609375, 0.1865234375, 0.133056640625, 0.2626953125, 0.14697265625, 0.08087158203125, 0.1920166015625, 0.166...

embed

63036177_c0

63036177

haskell

0

Title: What is wrong with my Longest Common Subsequence Haskell function? Problem title: What is wrong with my Longest Common Subsequence Haskell function? Tags: haskell, dynamic-programming Problem: What is wrong with my Longest Common Subsequence Haskell function? I've been following Haskell tutorials online, and I t...

What is wrong with my Longest Common Subsequence Haskell function? What is wrong with my Longest Common Subsequence Haskell function? haskell dynamic-programming What Longest Common Subsequence Haskell What is wrong with my Longest Common Subsequence Haskell function? I've been following Haskell tutorials online, and I...

[ 0.01416015625, 0.0302734375, -0.00396728515625, 0.0081787109375, 0.01409912109375, 0.007720947265625, -0.007171630859375, 0.01531982421875, -0.01141357421875, 0, -0.00125885009765625, -0.01446533203125, 0.0040283203125, 0.025146484375, 0.015625, -0.0037689208984375, 0.01513671875, ...

[ 4865, 83, 44691, 678, 759, 14407, 525, 151301, 8273, 184, 944, 3956, 20625, 142508, 32354, 1556, 84079, 28966, 25632, 57143, 1118, 5351, 6183, 21185, 10336, 46741, 23, 217, 4568, 756, 88303, 73, 17569, 3034, 33022, 234873, 1632, 13315, 1815...

[ 0.07232666015625, 0.063232421875, 0.20361328125, 0.09039306640625, 0.0831298828125, 0.1510009765625, 0.178466796875, 0.1956787109375, 0.1666259765625, 0.14208984375, 0.1387939453125, 0.0333251953125, 0.1295166015625, 0.2340087890625, 0.1954345703125, 0.09112548828125, 0.1083984375, ...

embed

36658890_c0

36658890

haskell

0

Title: Is there a way to use print with the formats of printf in Haskell? Problem title: Is there a way to use print with the formats of printf in Haskell? Tags: haskell, functional-programming Problem: Is there a way to use print with the formats of printf in Haskell? On my quest to acquire further experience in Haske...

Is there a way to use print with the formats of printf in Haskell? Is there a way to use print with the formats of printf in Haskell? haskell functional-programming Haskell Is there a way to use print with the formats of printf in Haskell? On my quest to acquire further experience in Haskell, I started working with pri...

[ -0.0101318359375, 0.004302978515625, 0.00506591796875, -0.000698089599609375, -0.00335693359375, 0.006561279296875, -0.00762939453125, 0.004913330078125, 0.0098876953125, 0.0250244140625, 0.005279541015625, -0.0284423828125, -0.002593994140625, -0.028564453125, -0.01611328125, -0.01208...

[ 2071, 2685, 3917, 4527, 28412, 678, 9384, 7, 420, 23, 20625, 142508, 10, 111, 1556, 123309, 28966, 38694, 16981, 20697, 136, 9790, 10298, 40368, 4034, 36663, 3949, 1328, 5, 617, 91084, 156672, 28875, 7941, 53, 17368, 37842, 101089, 99156, ...

[ 0.00677490234375, 0.02899169921875, 0.093994140625, 0.1416015625, 0.272705078125, 0.1431884765625, 0.2208251953125, 0.009796142578125, 0.2188720703125, 0.042724609375, 0.1182861328125, 0.2470703125, 0.0175628662109375, 0.01275634765625, 0.07159423828125, 0.09375, 0.0193634033203125, ...

embed

65692148_c0

65692148

haskell

0

Title: Haskell instance: how could this be some valid code? Problem title: Haskell instance: how could this be some valid code? Tags: haskell Problem: Haskell instance: how could this be some valid code? While I was writing a small example of the Show instance, I had made an indentation error: module Main where data B=...

Haskell instance: how could this be some valid code? Haskell instance: how could this be some valid code? haskell Haskell Main Show example.hs Haskell instance: how could this be some valid code? While I was writing a small example of the Show instance, I had made an indentation error: Where, clearly, the working code ...

[ 0.0030670166015625, -0.016845703125, 0.00665283203125, 0.021728515625, -0.003387451171875, 0.0194091796875, -0.01385498046875, -0.0162353515625, 0.00579833984375, -0.01275634765625, -0.016357421875, -0.007049560546875, 0.01373291015625, 0.019287109375, 0.0113525390625, -0.0062561035156...

[ 20625, 142508, 110527, 3642, 5809, 903, 186, 3060, 35604, 18151, 12, 1556, 12321, 17367, 27781, 127, 32562, 19336, 7228, 18597, 22062, 18499, 123019, 70, 20697, 509, 41206, 9969, 1340, 5117, 64457, 11675, 134620, 7, 177261, 645, 118664, 44084...

[ 0.1199951171875, 0.2218017578125, 0.2391357421875, 0.0872802734375, 0.10986328125, 0.1175537109375, 0.07318115234375, 0.047149658203125, 0.18603515625, 0.2047119140625, 0.00469970703125, 0.09027099609375, 0.07421875, 0.185791015625, 0.157958984375, 0.1075439453125, 0.000946044921875,...

embed

55559896_c0

55559896

haskell

0

Title: How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? Problem title: How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? Tags: haskell, haskell-lucid Problem: How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? How can I parse an html s...

How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? haskell haskell-lucid How HTML Haskell Lucid Test How to embed arbitrary dynamic HTML String into Haskell's Lucid Html type? How can I parse an html string for ...

[ -0.01202392578125, 0.0172119140625, -0.005615234375, 0.00897216796875, -0.018798828125, 0.007110595703125, 0.000720977783203125, -0.02587890625, -0.003692626953125, -0.05322265625, 0.013427734375, -0.031005859375, -0.01165771484375, 0.0009307861328125, 0.017333984375, 0.003509521484375...

[ 11249, 47, 352, 13482, 61799, 1294, 84079, 19097, 23351, 214, 3934, 20625, 142508, 3768, 51181, 71, 572, 18, 7237, 10644, 1556, 71865, 8647, 831, 366, 184, 7693, 79315, 27781, 254, 111337, 765, 117176, 34292, 2806, 21373, 915, 454, 3444, ...

[ 0.061492919921875, 0.013458251953125, 0.0936279296875, 0.2169189453125, 0.1641845703125, 0.0670166015625, 0.203857421875, 0.25146484375, 0.2130126953125, 0.13427734375, 0.1202392578125, 0.12548828125, 0.2333984375, 0.059051513671875, 0.173828125, 0.1553955078125, 0.06646728515625, ...

embed

10417821_c0

10417821

haskell

0

Title: Partitioning different types of terms during parsing Problem title: Partitioning different types of terms during parsing Tags: haskell, parsec, parsing Problem: Partitioning different types of terms during parsing I have two parsers for different types of terms. a :: Parser A b :: Parser B I have a data type rep...

Partitioning different types of terms during parsing Partitioning different types of terms during parsing haskell parsec parsing Partitioning Parser Char StateT Partitioning different types of terms during parsing I have two parsers for different types of terms. I have a data type representing sequences of these terms....

[ 0.01031494140625, 0.0076904296875, -0.01141357421875, 0.0267333984375, -0.01470947265625, 0.01483154296875, 0.00029754638671875, -0.00970458984375, -0.005126953125, -0.0069580078125, -0.005096435546875, 0.02490234375, 0.00054168701171875, 0.0191650390625, -0.017822265625, 0.00280761718...

[ 9148, 1363, 12921, 52895, 69407, 20271, 366, 6953, 1556, 142508, 39797, 2392, 2189, 21656, 22836, 618, 6626, 7, 1314, 2053, 10644, 33636, 26513, 4263, 107730, 944, 17664, 4127, 3917, 32562, 501, 1984, 313, 84797, 62, 91, 1295, 335, 9498, ...

[ 0.2169189453125, 0.151123046875, 0.1590576171875, 0.206298828125, 0.213134765625, 0.113037109375, 0.1636962890625, 0.10791015625, 0.12255859375, 0.2127685546875, 0.1605224609375, 0.1529541015625, 0.146484375, 0.1376953125, 0.1502685546875, 0.1539306640625, 0.092041015625, 0.0722656...

embed

24468061_c0

24468061

haskell

0

Title: Are there infinite lists with unboxed vector performance? Problem title: Are there infinite lists with unboxed vector performance? Tags: signal-processing, lazy-evaluation, haskell Problem: Are there infinite lists with unboxed vector performance? I'm thinking specifically for signal processing. Let's say I want...

Are there infinite lists with unboxed vector performance? Are there infinite lists with unboxed vector performance? signal-processing lazy-evaluation haskell Are there infinite lists with unboxed vector performance? I'm thinking specifically for signal processing. Let's say I wanted to do something like double the magn...

[ 0.00872802734375, 0.024658203125, -0.0079345703125, -0.01202392578125, -0.011474609375, -0.004150390625, 0.00811767578125, -0.0260009765625, 0.010009765625, -0.044677734375, -0.00372314453125, -0.006317138671875, 0.029296875, 0.00469970703125, -0.0274658203125, 0.01348876953125, -0.0...

[ 15901, 2685, 54241, 13, 5303, 7, 678, 51, 11728, 297, 173, 18770, 23718, 26073, 63923, 21, 3285, 159258, 1556, 142508, 47644, 9433, 36663, 41929, 101668, 277, 3444, 4552, 4271, 34658, 22832, 12282, 98323, 22834, 22230, 5809, 738, 98, 49919,...

[ 0.0175018310546875, 0.0609130859375, 0.1785888671875, 0.12060546875, 0.242431640625, 0.07171630859375, 0.0413818359375, 0.1207275390625, 0.20849609375, 0.0645751953125, 0.1727294921875, 0.15771484375, 0.1981201171875, 0.171630859375, 0.051300048828125, 0.0243682861328125, 0.100463867...

embed

76928070_c0

76928070

haskell

0

Title: Configure/disable request logging in yesod Problem title: Configure/disable request logging in yesod Tags: haskell, yesod Problem: Configure/disable request logging in yesod Using yesod 1.6.2.1, when creating a new application (regardless of whether using the scaffolding or using the builtin warp port foundation...

Configure/disable request logging in yesod Configure/disable request logging in yesod haskell yesod Configure Aug GET HTTP Yesod Configure/disable request logging in yesod Using yesod 1.6.2.1, when creating a new application (regardless of whether using the scaffolding or using the builtin warp port foundation ), you g...

[ -0.01214599609375, 0.028564453125, 0.01513671875, -0.017333984375, -0.00225830078125, 0.0255126953125, -0.0185546875, -0.0037078857421875, -0.01025390625, 0.019287109375, 0.00830078125, -0.011474609375, -0.01275634765625, 0.0036773681640625, -0.006103515625, -0.022216796875, -0.00451...

[ 59994, 3827, 2886, 50336, 459, 36659, 2422, 23722, 23, 1556, 142508, 23177, 79794, 135913, 32635, 2199, 51748, 68107, 105233, 3525, 38415, 42822, 88303, 73, 1631, 254, 11469, 137374, 2046, 12684, 1884, 903, 1957, 7440, 222495, 10644, 67413, 6...

[ 0.1654052734375, 0.079833984375, 0.1463623046875, 0.20263671875, 0.128662109375, 0.1494140625, 0.1597900390625, 0.235595703125, 0.011138916015625, 0.0657958984375, 0.17919921875, 0.1285400390625, 0.1025390625, 0.1304931640625, 0.174072265625, 0.2181396484375, 0.1484375, 0.113037109...

embed

25235402_c0

25235402

haskell

0

Title: Specifying a dependency constraint in a cabal file Problem title: Specifying a dependency constraint in a cabal file Tags: haskell, cabal Problem: Specifying a dependency constraint in a cabal file A bug in using the latest attoparsec with hedis needs hedis to be installed in the following way: cabal install hed...

Specifying a dependency constraint in a cabal file Specifying a dependency constraint in a cabal file haskell cabal Specifying zeromq4-haskell Specifying a dependency constraint in a cabal file A bug in using the latest attoparsec with hedis needs hedis to be installed in the following way: so that it doesn't use the l...

[ -0.0032196044921875, 0.0034942626953125, 0.00145721435546875, 0.003753662109375, 0.0026702880859375, 0.010986328125, -0.0084228515625, 0.003173828125, 0.0164794921875, 0.0037689208984375, -0.01092529296875, -0.03759765625, 0.002685546875, 0.00457763671875, 0.00090789794921875, 0.006378...

[ 24990, 151138, 42548, 27771, 158, 2816, 4288, 109524, 11435, 1556, 142508, 45234, 39, 864, 35748, 10557, 54608, 17368, 70, 42850, 243, 31, 2500, 39797, 764, 3827, 27117, 186, 20600, 297, 25632, 3917, 18, 4527, 11389, 3714, 3900, 19309, 3934...

[ 0.164794921875, 0.044769287109375, 0.1993408203125, 0.08184814453125, 0.07843017578125, 0.1590576171875, 0.083740234375, 0.248291015625, 0.151123046875, 0.1256103515625, 0.204833984375, 0.1319580078125, 0.009490966796875, 0.081298828125, 0.109375, 0.1094970703125, 0.1556396484375, ...

embed

4996514_c1

4996514

haskell

1

.Monad import Data.Char (isSpace) import Text.ParserCombinators.Parsec data Node = Node { level :: Int, keyword :: Maybe String, heading :: String, tags :: Maybe [String] } deriving (Show) parseNode = Node <$> level <*> (optionMaybe keyword) <*> name <*> (optionMaybe tags) where level = length <$> many1 (char '*') <* s...

[ -0.023681640625, -0.00799560546875, -0.01177978515625, 0.018798828125, 0.0181884765625, 0.022216796875, -0.01220703125, -0.032470703125, 0.01116943359375, -0.00372314453125, 0.00811767578125, -0.000606536865234375, -0.0223388671875, 0.005889892578125, -0.02294921875, 0.002777099609375,...

[ 5, 46674, 712, 24927, 11809, 84068, 164, 141012, 16, 24129, 28636, 2189, 10770, 19155, 22230, 39797, 2053, 438, 112, 2203, 17366, 18, 166117, 83425, 23351, 10336, 214, 69141, 71713, 16406, 6496, 168660, 366, 184, 5021, 109585, 82419, 372, 9...

[ 0.0904541015625, 0.1903076171875, 0.2293701171875, 0.2188720703125, 0.1239013671875, 0.1771240234375, 0.152587890625, 0.2415771484375, 0.017425537109375, 0.16259765625, 0.1185302734375, 0.0830078125, 0.010772705078125, 0.1866455078125, 0.1263427734375, 0.18701171875, 0.1600341796875,...

embed

71197765_c0

71197765

haskell

0

Title: Running this Haskell code in Powershell does nothing Problem title: Running this Haskell code in Powershell does nothing Tags: haskell Problem: Running this Haskell code in Powershell does nothing I'm learning Haskell for a school project and am going through Hudak's Haskell School of Expression . I have written...

Running this Haskell code in Powershell does nothing Running this Haskell code in Powershell does nothing haskell Running Haskell Powershell Float test.exe Running this Haskell code in Powershell does nothing I'm learning Haskell for a school project and am going through Hudak's Haskell School of Expression . I have wr...

[ 0.0213623046875, 0.00506591796875, 0.007659912109375, 0.0230712890625, -0.006011962890625, 0.0233154296875, 0.001861572265625, -0.00958251953125, -0.00811767578125, -0.0111083984375, -0.007080078125, 0.006317138671875, -0.0125732421875, 0.00787353515625, 0.0230712890625, 0.012756347656...

[ 28398, 903, 20625, 142508, 18151, 23, 17170, 128019, 14602, 33720, 592, 1556, 38699, 257, 3034, 46480, 52080, 10696, 13452, 74151, 344, 19188, 111, 25129, 59121, 25632, 3293, 9969, 1340, 5885, 3642, 54, 20653, 11675, 442, 10644, 3934, 6954, ...

[ 0.1351318359375, 0.10687255859375, 0.1265869140625, 0.22802734375, 0.1724853515625, 0.059906005859375, 0.1419677734375, 0.2388916015625, 0.06884765625, 0.1734619140625, 0.01898193359375, 0.111083984375, 0.176025390625, 0.0672607421875, 0.210205078125, 0.122802734375, 0.036865234375, ...

embed

17329083_c0

17329083

haskell

0

Title: Javascript lazy evaluation fibonacci function Problem title: Javascript lazy evaluation fibonacci function Tags: haskell, javascript, lazy-evaluation Problem: Javascript lazy evaluation fibonacci function I asked a question before about using lazy evaluation in Scala. I was trying to write the following Haskell ...

Javascript lazy evaluation fibonacci function Javascript lazy evaluation fibonacci function haskell javascript lazy-evaluation RangeError Javascript console.log Maximum Javascript lazy evaluation fibonacci function I asked a question before about using lazy evaluation in Scala. I was trying to write the following Haske...

[ 0.004913330078125, 0.0264892578125, -0.0028839111328125, -0.00958251953125, 0.01220703125, 0.00147247314453125, 0.00958251953125, 0.01214599609375, -0.003936767578125, -0.03515625, -0.000362396240234375, -0.021484375, 0.00147247314453125, 0.00750732421875, 0.0301513671875, 0.0152587890...

[ 74181, 21, 3285, 219836, 809, 20990, 52544, 32354, 1556, 142508, 136951, 159258, 142462, 18468, 130250, 4867, 46540, 316, 17368, 152653, 11, 31577, 33022, 25632, 20625, 69427, 18, 4527, 32036, 5608, 43257, 115061, 5701, 13580, 3900, 143, 37842,...

[ 0.2381591796875, 0.166015625, 0.2269287109375, 0.208984375, 0.105712890625, 0.1231689453125, 0.1470947265625, 0.1683349609375, 0.10211181640625, 0.2327880859375, 0.2109375, 0.1898193359375, 0.1353759765625, 0.08538818359375, 0.1461181640625, 0.12939453125, 0.158447265625, 0.0407714...

embed

49962583_c0

49962583

haskell

0

Title: Extracting elements from the start of a list in Haskell without the builtin function Problem title: Extracting elements from the start of a list in Haskell without the builtin function Tags: haskell Problem: Extracting elements from the start of a list in Haskell without the builtin function I want to write a fu...

Extracting elements from the start of a list in Haskell without the builtin function Extracting elements from the start of a list in Haskell without the builtin function haskell the Extracting Haskell x:xs n-1 Extracting elements from the start of a list in Haskell without the builtin function I want to write a functio...

[ 0.00946044921875, 0.00179290771484375, 0.0034637451171875, 0.008544921875, -0.00084686279296875, 0.01373291015625, 0.002197265625, -0.00144195556640625, 0.0189208984375, -0.024658203125, 0.028076171875, -0.0274658203125, 0.0012359619140625, 0.01104736328125, -0.005828857421875, -0.0068...

[ 31501, 238, 1916, 80854, 1295, 4034, 5303, 20625, 142508, 15490, 88303, 73, 32354, 111, 1556, 1022, 12, 425, 7, 653, 5759, 70, 23, 3444, 33022, 125663, 14012, 78219, 43240, 831, 48903, 5646, 18151, 9969, 25720, 5885, 3034, 27781, 30646, 1...

[ 0.1973876953125, 0.10400390625, 0.07025146484375, 0.2044677734375, 0.1058349609375, 0.16796875, 0.1710205078125, 0.158447265625, 0.23583984375, 0.1480712890625, 0.1207275390625, 0.100341796875, 0.177734375, 0.06768798828125, 0.1456298828125, 0.05499267578125, 0.013397216796875, 0.0...

embed

50781571_c0

50781571

haskell

0

Title: Append a delay to each chunk with the streaming library? Problem title: Append a delay to each chunk with the streaming library? Tags: haskell, haskell-streaming Problem: Append a delay to each chunk with the streaming library? newbie to Streaming and Haskell here. I've been playing around with the streaming lib...

Append a delay to each chunk with the streaming library? Append a delay to each chunk with the streaming library? haskell haskell-streaming Append S.print S.delay S.each S.maps Append a delay to each chunk with the streaming library? newbie to Streaming and Haskell here. I've been playing around with the streaming libr...

[ 0.005584716796875, 0.002960205078125, 0.03173828125, -0.0240478515625, -0.003265380859375, -0.00045013427734375, 0.007415771484375, -0.017333984375, 0.00921630859375, -0.0147705078125, -0.0009613037109375, -0.024658203125, 0.0208740234375, 0.01611328125, -0.0062255859375, 0.01312255859...

[ 5659, 3611, 10, 8, 5259, 47, 12638, 7839, 92, 678, 65296, 35773, 1294, 1556, 142508, 86429, 159, 35662, 112, 41581, 62346, 9014, 163274, 136, 20625, 75169, 60892, 100094, 1224, 2831, 65508, 7103, 12830, 3444, 765, 11907, 17932, 37842, 1284,...

[ 0.1102294921875, 0.095458984375, 0.03704833984375, 0.1800537109375, 0.270751953125, 0.10693359375, 0.14599609375, 0.1947021484375, 0.158447265625, 0.092529296875, 0.2196044921875, 0.16796875, 0.095458984375, 0.08056640625, 0.205078125, 0.12255859375, 0.057403564453125, 0.1429443359...

embed

53015583_c0

53015583

haskell

0

Title: How to use a ZMQ subscriber in Haskell with pipes Problem title: How to use a ZMQ subscriber in Haskell with pipes Tags: zeromq, haskell, haskell-pipes Problem: How to use a ZMQ subscriber in Haskell with pipes fromZMQ :: (Receiver r) => Socket z r -> Producer String (ZMQ z) () fromZMQ sock = do msg <- lift $ re...

How to use a ZMQ subscriber in Haskell with pipes How to use a ZMQ subscriber in Haskell with pipes zeromq haskell haskell-pipes Control.Monad Pipes qualified System.ZMQ4.Monadic How ZMQ Haskell LANGUAGE OverloadedStrings Main Pipes.Prelude Data.ByteString.Char8 Receiver Socket Producer CS.unpack Sub P.take P.print How...

[ 0.00970458984375, 0.0020599365234375, -0.0089111328125, 0.0177001953125, -0.000579833984375, 0.0057373046875, -0.0225830078125, -0.0224609375, -0.016357421875, -0.052978515625, -0.0208740234375, 0.00592041015625, 0.038330078125, 0.0098876953125, 0.000640869140625, 0.004730224609375, ...

[ 11249, 4527, 567, 594, 2737, 1614, 34601, 42, 20625, 142508, 678, 137158, 10, 45234, 39, 864, 1556, 1434, 13569, 27131, 46674, 712, 93128, 90, 217225, 1511, 617, 18403, 3358, 98064, 9578, 63033, 71713, 12321, 822, 11809, 84068, 1019, 93908,...

[ 0.016357421875, 0.1343994140625, 0.1439208984375, 0.152099609375, 0.2017822265625, 0.13525390625, 0.188720703125, 0.1300048828125, 0.148193359375, 0.224853515625, 0.117431640625, 0.19091796875, 0.0341796875, 0.1136474609375, 0.07379150390625, 0.141845703125, 0.107666015625, 0.11877...

embed

28288118_c0

28288118

haskell

0

Title: How to know maximum at an irregular tree? Problem title: How to know maximum at an irregular tree? Tags: haskell Problem: How to know maximum at an irregular tree? I have an irregularly defined tree, how can i run through it and find the maximum value in it? My strategy was to build a list and take out the bigge...

How to know maximum at an irregular tree? How to know maximum at an irregular tree? haskell How Node Empty TreeIrr ArvIrr How to know maximum at an irregular tree? I have an irregularly defined tree, how can i run through it and find the maximum value in it? My strategy was to build a list and take out the bigger value...

[ -0.016357421875, 0.00518798828125, -0.008056640625, -0.0045166015625, 0.00726318359375, 0.0296630859375, -0.0196533203125, -0.0172119140625, 0.005645751953125, -0.03955078125, 0.002716064453125, -0.01287841796875, -0.006622314453125, -0.004913330078125, 0.03662109375, -0.025146484375, ...

[ 11249, 47, 3714, 38132, 99, 105843, 53201, 1556, 142508, 438, 112, 31678, 939, 101344, 29161, 1172, 61924, 3642, 11675, 8305, 7413, 34292, 23, 113857, 5303, 167785, 2967, 2394, 6635, 1360, 25737, 7108, 1022, 45646, 134598, 37317, 297, 2965 ]

[ 0.043975830078125, 0.0162506103515625, 0.1064453125, 0.2169189453125, 0.084228515625, 0.23046875, 0.1929931640625, 0.060394287109375, 0.15966796875, 0.08270263671875, 0.1107177734375, 0.130615234375, 0.08447265625, 0.108154296875, 0.033599853515625, 0.00384521484375, 0.10693359375, ...

embed

28631065_c0

28631065

haskell

0

Title: Is there an AsValue instance for nested Vectors of Aeson Values? Problem title: Is there an AsValue instance for nested Vectors of Aeson Values? Tags: haskell, aeson Problem: Is there an AsValue instance for nested Vectors of Aeson Values? I'm trying to get the feel of aeson package. Am I using its Lens API inco...

Is there an AsValue instance for nested Vectors of Aeson Values? Is there an AsValue instance for nested Vectors of Aeson Values? haskell aeson a AsValue Vectors Aeson Values Lens _Array Maybe vector-0.10.12.2:Data.Vector.Vector Value Is there an AsValue instance for nested Vectors of Aeson Values? I'm trying to get th...

[ -0.013916015625, 0.0035858154296875, -0.003814697265625, -0.001068115234375, -0.01434326171875, 0.00665283203125, 0.003662109375, -0.024658203125, -0.004669189453125, 0.00095367431640625, 0.0047607421875, 0.026123046875, 0.004974365234375, -0.0069580078125, 0.0003108978271484375, -0.01...

[ 2071, 2685, 142, 1301, 856, 50770, 110527, 100, 8512, 71, 52884, 22230, 111, 62, 90, 191, 190060, 1556, 142508, 10, 18226, 7, 7614, 7092, 83425, 173, 18770, 10179, 70147, 137989, 26455, 12319, 98169, 17368, 61687, 214552 ]

[ 0.042327880859375, 0.089599609375, 0.103759765625, 0.1776123046875, 0.213623046875, 0.272705078125, 0.2476806640625, 0.06591796875, 0.2037353515625, 0.093994140625, 0.1927490234375, 0.1417236328125, 0.05987548828125, 0.0838623046875, 0.1263427734375, 0.184326171875, 0.22412109375, ...

embed

19773785_c0

19773785

haskell

0

Title: Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? Problem title: Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? Tags: haskell, parsec, parsing Problem: Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integer...

Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? haskell parsec parsing Haskell Parsec Word8 Is there an easier way to write this Haskell Parsec parser for 8-bit decimal integers? I wrote the fol...

[ 0.009033203125, 0.00186920166015625, 0.0140380859375, 0.057373046875, -0.015380859375, 0.03564453125, -0.0103759765625, -0.02587890625, 0.01007080078125, 0.01373291015625, -0.0169677734375, -0.030029296875, 0.0091552734375, 0.0133056640625, -0.02685546875, -0.00087738037109375, 0.004...

[ 2071, 2685, 99156, 3917, 33022, 903, 20625, 142508, 2392, 39797, 366, 2189, 100, 15045, 3137, 32380, 2749, 892, 26255, 142, 1556, 6953, 22543, 1019, 47, 54397, 25632, 18151, 8, 40899, 7986, 33636, 309, 31304, 831, 12319, 20016, 33 ]

[ 0.01129150390625, 0.0421142578125, 0.1927490234375, 0.0894775390625, 0.1669921875, 0.091552734375, 0.133056640625, 0.23193359375, 0.139404296875, 0.2457275390625, 0.1580810546875, 0.1885986328125, 0.0791015625, 0.1732177734375, 0.138671875, 0.1456298828125, 0.093505859375, 0.106262...

embed

74755452_c0

74755452

haskell

0

Title: Create a function with take the first n and last n elements Problem title: Create a function with take the first n and last n elements Tags: function, haskell Problem: Create a function with take the first n and last n elements I want to create a function that keep the first n as well as the last n elements are,...

Create a function with take the first n and last n elements Create a function with take the first n and last n elements function haskell Create x:xs Vorraussetzung Create a function with take the first n and last n elements I want to create a function that keep the first n as well as the last n elements are, all other ...

[ -0.001953125, 0.0123291015625, 0.0005035400390625, -0.003875732421875, -0.015625, 0.01806640625, 0.01806640625, -0.0081787109375, 0.0123291015625, 0.00628662109375, 0.01318359375, -0.0159912109375, 0.01214599609375, -0.00372314453125, 0.002532958984375, 0.0142822265625, 0.009765625, ...

[ 151313, 32354, 678, 5646, 5117, 653, 136, 4568, 80854, 1556, 142508, 1022, 12, 425, 7, 4855, 219, 223, 91052, 3444, 28282, 13695, 237, 5299, 621, 756, 3789, 36069, 20051, 4263, 40715, 105950, 116, 19, 93544, 6528, 75101, 3501, 707, 132283...

[ 0.1422119140625, 0.229248046875, 0.08404541015625, 0.17919921875, 0.11181640625, 0.146240234375, 0.09454345703125, 0.174560546875, 0.2044677734375, 0.1473388671875, 0.228271484375, 0.064697265625, 0.0187835693359375, 0.0838623046875, 0.062255859375, 0.09942626953125, 0.0584716796875,...

embed

8564921_c0

8564921

haskell

0

Title: Parsec match single unicode character Problem title: Parsec match single unicode character Tags: parsec, unicode, haskell Problem: Parsec match single unicode character I'm trying to create a parser (with parsec), that parses tokens, delimited by newlines, commas, semicolons and unicode dashes (ndash and mdash):...

Parsec match single unicode character Parsec match single unicode character parsec unicode haskell Parsec many1 Parsec match single unicode character I'm trying to create a parser (with parsec), that parses tokens, delimited by newlines, commas, semicolons and unicode dashes (ndash and mdash): But the ndash-mdash (\821...

[ -0.010009765625, 0.01202392578125, 0.01300048828125, 0.0250244140625, -0.0164794921875, 0.005889892578125, 0.0179443359375, -0.00628662109375, 0.0023040771484375, -0.017822265625, -0.0028228759765625, -0.026123046875, 0.007659912109375, -0.00982666015625, -0.021484375, -0.0072937011718...

[ 2392, 39797, 14858, 11001, 60347, 112, 62816, 366, 1556, 142508, 5941, 418, 31577, 28282, 2189, 76228, 5908, 47, 84694, 93343, 3525, 59801, 375, 1510, 36137, 22796, 48, 114942, 1127, 1495, 136, 155892, 4966, 653, 41872, 12012, 1530, 63258, ...

[ 0.167724609375, 0.25390625, 0.18505859375, 0.1778564453125, 0.1929931640625, 0.1412353515625, 0.168701171875, 0.17724609375, 0.123779296875, 0.2000732421875, 0.157470703125, 0.068359375, 0.0251007080078125, 0.0806884765625, 0.164306640625, 0.04034423828125, 0.0111083984375, 0.07476...

embed

63008058_c0

63008058

haskell

0

Title: how do you determine if a type is a functor or not in haskell? Problem title: how do you determine if a type is a functor or not in haskell? Tags: functor, haskell Problem: how do you determine if a type is a functor or not in haskell? I have a data type: data Tree a = Leaf | Branch a (Tree a) (Tree a) I want to...

how do you determine if a type is a functor or not in haskell? how do you determine if a type is a functor or not in haskell? functor haskell Tree Leaf Branch how do you determine if a type is a functor or not in haskell? I have a data type: I want to determine, and not just for this data type, but for others such as S...

[ 0.0181884765625, -0.0022735595703125, -0.00156402587890625, 0.017333984375, 0.018310546875, 0.01019287109375, -0.0078125, -0.0205078125, 0.00157928466796875, -0.0027618408203125, -0.01611328125, -0.047607421875, 0.00946044921875, -0.00003719329833984375, -0.0208740234375, 0.01440429687...

[ 3642, 83324, 2174, 10644, 83, 10, 7477, 18770, 707, 959, 23, 1556, 142508, 101344, 636, 2407, 21110, 54, 398, 2053, 23351, 214, 52895, 27165, 14508, 110527, 139509, 10557, 37382, 2592, 99929, 137989, 97249, 3126, 23534, 32354, 1238, 62346, ...

[ 0.037628173828125, 0.1668701171875, 0.0855712890625, 0.282470703125, 0.08123779296875, 0.08563232421875, 0.205810546875, 0.2088623046875, 0.0732421875, 0.1494140625, 0.07208251953125, 0.13671875, 0.2430419921875, 0.1766357421875, 0.015869140625, 0.105712890625, 0.0279693603515625, ...

embed

33657566_c0

33657566

haskell

0

Title: Deploying Yesod web app Problem title: Deploying Yesod web app Tags: deployment, haskell, ubuntu, yesod Problem: Deploying Yesod web app I have a simple Yesod web app. I could follow the instruction in http://www.yesodweb.com/page/quickstart , and checked stack exec -- Yesod devel is working fine. The server tha...

Deploying Yesod web app Deploying Yesod web app deployment haskell ubuntu yesod Deploying Yesod Deploying Yesod web app I have a simple Yesod web app. I could follow the instruction in http://www.yesodweb.com/page/quickstart , and checked stack exec -- Yesod devel is working fine. The server that I use (Amazon EC2) has...

[ -0.0096435546875, 0.0115966796875, -0.00640869140625, 0.002166748046875, -0.01611328125, 0.044921875, -0.0106201171875, -0.022216796875, 0.003570556640625, 0.004302978515625, 0.00482177734375, -0.0284423828125, -0.0006103515625, 0.0076904296875, 0.000904083251953125, 0.0000486373901367...

[ 262, 13158, 38543, 32635, 2199, 1467, 4027, 8, 53, 1556, 142508, 198996, 2422, 23722, 8781, 28960, 188336, 1033, 14051, 3181, 17137, 12765, 177261, 1119, 3240, 2601, 20697, 5885, 10723, 4527, 147218, 59947, 10461, 4734, 1632, 169858, 61028, 9...

[ 0.0523681640625, 0.1602783203125, 0.058746337890625, 0.19189453125, 0.28076171875, 0.1396484375, 0.1510009765625, 0.09490966796875, 0.01727294921875, 0.10986328125, 0.2120361328125, 0.14111328125, 0.12890625, 0.2152099609375, 0.0736083984375, 0.05938720703125, 0.062744140625, 0.105...

embed

26230530_c1

26230530

haskell

1

> [1..3] `mappend` [4..6] [1,2,3,4,5,6] λ> [1..3] ++ [4..6] [1,2,3,4,5,6] λ> mconcat [[1,2],[3,6],[9]] [1,2,3,6,9] λ> concat [[1,2],[3,6],[9]] [1,2,3,6,9] λ> getProduct $ Product 3 `mappend` Product 9 27 λ> 3 * 9 27 λ> getProduct $ Product 3 `mappend` Product 4 `mappend` Product 2 24 λ> product [3,4,2] 24 λ> getSum . m...

[ -0.02001953125, 0.0030364990234375, 0.01055908203125, 0.022705078125, 0.0021820068359375, 0.031005859375, -0.000339508056640625, 0.0120849609375, 0.0228271484375, -0.005828857421875, -0.00170135498046875, -0.02490234375, -0.00335693359375, -0.00555419921875, -0.002777099609375, -0.0098...

[ 977, 68252, 96386, 192, 9858, 71, 617, 910, 268, 133063, 82449, 104629, 111147, 5, 37223, 4, 347, 2271, 4460, 363, 55737, 155761, 171379, 158, 1065, 2046, 10752, 77193, 73111, 138, 483, 1438, 661, 1135, 201, 116, 744, 12996, 90173, 316, ...

[ 0.0927734375, 0.046234130859375, 0.1463623046875, 0.17041015625, 0.1971435546875, 0.16845703125, 0.090576171875, 0.1507568359375, 0.00640869140625, 0.081787109375, 0.16064453125, 0.180908203125, 0.1484375, 0.006683349609375, 0.176513671875, 0.0062255859375, 0.1219482421875, 0.17956...

embed

26688346_c0

26688346

haskell

0

Title: haskell evaluation $ sign Problem title: haskell evaluation $ sign Tags: composition, haskell, operator-keyword Problem: haskell evaluation $ sign I am going through 'learn you some haskell' and I have written following application: import System.IO main = do filename <- getLine handle <- openFile filename ReadM...

haskell evaluation $ sign haskell evaluation $ sign composition haskell operator-keyword System.IO ReadMode haskell evaluation $ sign I am going through 'learn you some haskell' and I have written following application: And it works but when I remove "$" between lines and content a compilation fails. Could you help me ...

[ -0.00787353515625, 0.018798828125, 0.01348876953125, 0.016845703125, -0.0184326171875, 0.005706787109375, -0.0032958984375, 0.0257568359375, -0.005767822265625, -0.026611328125, -0.016357421875, -0.004547119140625, 0.00567626953125, -0.0028533935546875, -0.0159912109375, -0.00224304199...

[ 1556, 142508, 219836, 3650, 24092, 166577, 39933, 19770, 47416, 12353, 17780, 4764, 9083, 147, 398, 3060, 59121, 25632, 38415, 43240, 1284, 3229, 87388, 4369, 17721, 124519, 136, 10941, 98352, 1363, 35782, 28219, 15400, 44691, 47644, 150350, 63...

[ 0.13720703125, 0.2216796875, 0.1923828125, 0.1285400390625, 0.2120361328125, 0.1573486328125, 0.1385498046875, 0.000274658203125, 0.121337890625, 0.082275390625, 0.175537109375, 0.1456298828125, 0.123291015625, 0.0506591796875, 0.009307861328125, 0.0148773193359375, 0.062744140625, ...

embed

22682469_c0

22682469

haskell

0

Title: Concrete example of functional knowledge allowing you to write better imperative/OO code Problem title: Concrete example of functional knowledge allowing you to write better imperative/OO code Tags: haskell, functional-programming Problem: Concrete example of functional knowledge allowing you to write better imp...

Concrete example of functional knowledge allowing you to write better imperative/OO code Concrete example of functional knowledge allowing you to write better imperative/OO code haskell functional-programming Concrete Concrete example of functional knowledge allowing you to write better imperative/OO code I've been wor...

[ 0.033935546875, -0.00141143798828125, 0.003692626953125, -0.006256103515625, 0.00775146484375, 0.02099609375, -0.00457763671875, 0.016845703125, 0.0181884765625, -0.00830078125, 0.009521484375, -0.0311279296875, 0.00185394287109375, 0.03662109375, 0.0002956390380859375, 0.0004444122314...

[ 225111, 13, 27781, 123309, 51359, 190358, 33022, 11522, 222530, 30563, 18151, 1556, 142508, 28966, 20697, 56037, 449, 12960, 5036, 5351, 6782, 1884, 94957, 23902, 20625, 831, 17311, 63847, 7639, 2856, 81779, 903, 3642, 2806, 6713, 1957, 5045, ...

[ 0.2225341796875, 0.0968017578125, 0.200927734375, 0.241943359375, 0.2181396484375, 0.07080078125, 0.1378173828125, 0.1551513671875, 0.2430419921875, 0.1815185546875, 0.1829833984375, 0.125244140625, 0.240234375, 0.1234130859375, 0.05181884765625, 0.1126708984375, 0.0186614990234375, ...

embed

70478263_c0

70478263

haskell

0

Title: Product type convert to tuple Problem title: Product type convert to tuple Tags: haskell Problem: Product type convert to tuple I've got this data Pair = P Int Double deriving Show myP1 = P 1 2.0 getPairVal (P i d) = (i,d) getPairVal' (P i d) = (,) i d which work, both producing (1,2.0) . Is there any way to mak...

Product type convert to tuple Product type convert to tuple haskell Product Pair Double Show myP1 Pair2 myP21 Product type convert to tuple I've got this which work, both producing (1,2.0) . Is there any way to make a straight (,) myP1 work? But then this would require some sort of "cast" I'm guessing. is a tuple versi...

[ 0.00131988525390625, 0.0123291015625, -0.003204345703125, 0.0205078125, -0.007598876953125, 0.006927490234375, -0.048583984375, -0.011962890625, 0.01385498046875, 0.007781982421875, 0.00469970703125, -0.0009765625, 0.00396728515625, -0.019775390625, -0.0224609375, -0.0087890625, 0.00...

[ 73111, 10644, 96760, 47, 370, 8705, 1556, 142508, 1342, 481, 107172, 17367, 759, 683, 418, 304, 3117, 3129, 4488, 15044, 27024, 73011, 3917, 80560, 64209, 55741, 11389, 146625, 56, 92940, 12996, 678, 15490, 80934, 159, 39456, 20903, 76755, ...

[ 0.2279052734375, 0.24267578125, 0.1778564453125, 0.09332275390625, 0.1549072265625, 0.226806640625, 0.130859375, 0.24462890625, 0.160888671875, 0.148193359375, 0.10888671875, 0.1402587890625, 0.1146240234375, 0.105712890625, 0.0980224609375, 0.06683349609375, 0.145751953125, 0.0159...

embed

46547208_c0

46547208

haskell

0

Title: Why is my Haskell code saying 'variable not in scope: main'? Problem title: Why is my Haskell code saying 'variable not in scope: main'? Tags: haskell, compiler-errors Problem: Why is my Haskell code saying 'variable not in scope: main'? When I type the following in the interactive shell of H...

Why is my Haskell code saying 'variable not in scope: main'? Why is my Haskell code saying 'variable not in scope: main'? haskell compiler-errors Prelude Why Haskell Variable Perhaps Why is my Haskell code saying 'variable not in scope: main'? When I type the following in the interactive shell of Ha...

[ 0.00909423828125, 0.0177001953125, -0.00001239776611328125, 0.02099609375, -0.006805419921875, 0.015625, -0.00408935546875, 0.006072998046875, -0.01513671875, -0.019775390625, -0.012451171875, -0.02734375, -0.01019287109375, -0.0037689208984375, 0.048828125, 0.0036468505859375, -0.01...

[ 44084, 83, 759, 20625, 142508, 18151, 54433, 3768, 21690, 2886, 959, 23, 70820, 12, 5201, 54764, 1556, 9969, 34759, 188800, 822, 84572, 181799, 10644, 25632, 212398, 128019, 456, 2424, 217, 4165, 43240, 169123, 31344, 11435, 18158, 163321, 18...

[ 0.1478271484375, 0.0224761962890625, 0.03857421875, 0.1456298828125, 0.2376708984375, 0.164794921875, 0.0965576171875, 0.1563720703125, 0.2235107421875, 0.1927490234375, 0.2086181640625, 0.1854248046875, 0.2330322265625, 0.0587158203125, 0.193115234375, 0.032470703125, 0.09814453125,...

embed