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
30701305_c0	30701305	haskell	0	Title: Specifying Postgres table schemas in Esqueleto/Persistent Problem title: Specifying Postgres table schemas in Esqueleto/Persistent Tags: esqueleto, postgresql, haskell, persistent Problem: Specifying Postgres table schemas in Esqueleto/Persistent I'm using Esqueleto with Postgres and I don't see a way to specify...	Specifying Postgres table schemas in Esqueleto/Persistent Specifying Postgres table schemas in Esqueleto/Persistent esqueleto postgresql haskell persistent Specifying Postgres Esqueleto Persistent search_path Specifying Postgres table schemas in Esqueleto/Persistent I'm using Esqueleto with Postgres and I don't see a w...	[ 0.019775390625, 0.02294921875, -0.004241943359375, 0.01904296875, -0.01397705078125, -0.00063323974609375, 0.0177001953125, -0.01202392578125, -0.015625, -0.0037384033203125, 0.021728515625, 0.01129150390625, -0.01806640625, 0.00213623046875, -0.0250244140625, 0.0198974609375, -0.002...	[ 24990, 151138, 2795, 17562, 23180, 61903, 7, 23, 1184, 37631, 31580, 64, 15277, 6892, 66660, 133, 188, 1305, 99247, 1556, 142508, 70560, 57309, 2581, 33938, 128405, 17368, 678, 3917, 40140, 18929, 450, 157176, 25632, 5423, 114864, 4527, 87, ...	[ 0.1712646484375, 0.0999755859375, 0.0982666015625, 0.210205078125, 0.2257080078125, 0.262939453125, 0.0875244140625, 0.0765380859375, 0.0692138671875, 0.14501953125, 0.181884765625, 0.0182952880859375, 0.0316162109375, 0.1455078125, 0.09124755859375, 0.1103515625, 0.0653076171875, ...	embed
57758951_c0	57758951	haskell	0	Title: What are freer monads? Problem title: What are freer monads? Tags: functional-programming, haskell, monads Problem: What are freer monads? I heard this term a few times, but I still don't know what exactly is a so-called "Freer Monad". The name makes me think about Free Monads, but I don't see how they are actua...	What are freer monads? What are freer monads? functional-programming haskell monads What What are freer monads? I heard this term a few times, but I still don't know what exactly is a so-called "Freer Monad". The name makes me think about Free Monads, but I don't see how they are actually related. There is some library...	[ 0.005340576171875, -0.0086669921875, 0.022216796875, 0.0047607421875, 0.0021514892578125, 0.007781982421875, -0.010986328125, -0.0003147125244140625, -0.0015411376953125, -0.009033203125, 0.001129150390625, -0.0157470703125, -0.0012054443359375, 0.012939453125, -0.0130615234375, -0.013...	[ 4865, 4092, 42, 2667, 712, 7, 123309, 28966, 1556, 142508, 621, 49782, 13579, 10846, 20028, 3714, 81437, 60331, 71, 5351, 5153, 6468, 62548, 35773, 85526, 4588, 139509, 10557, 29102, 12176, 56, 27781, 28219, 6528, 4527, 58437, 32195, 92940, ...	[ 0.048736572265625, 0.1748046875, 0.224365234375, 0.127685546875, 0.2076416015625, 0.1136474609375, 0.113525390625, 0.097412109375, 0.07879638671875, 0.1824951171875, 0.04046630859375, 0.0296783447265625, 0.064208984375, 0.006927490234375, 0.010162353515625, 0.030517578125, 0.16528320...	embed
58625324_c1	58625324	haskell	1	digging into the problem I pinpointed the root cause to be my implementation of the <\|> method. If I use the following implementation then everything goes as expected: instance Alternative Parser where empty = Parser $ \_s -> [] p1 <\|> p2 = Parser $ \s -> case runParser p1 s of [] -> runParser p2 s xs -> xs These two ...	digging into the problem I pinpointed the root cause to be my implementation of the <\|> method. If I use the following implementation then everything goes as expected: instance Alternative Parser where empty = Parser $ \_s -> [] p1 <\|> p2 = Parser $ \s -> case runParser p1 s of [] -> runParser p2 s xs -> xs These two ...	[ 0.005035400390625, 0.0162353515625, 0.03759765625, 0.0038909912109375, -0.0135498046875, 0.0181884765625, -0.014892578125, -0.025634765625, 0.010986328125, 0.019775390625, 0.0128173828125, 0.0267333984375, 0.004608154296875, 0.01611328125, 0.007049560546875, -0.018798828125, 0.015319...	[ 2967, 38496, 74855, 22304, 759, 208124, 58745, 2740, 55300, 4527, 25632, 26818, 60899, 237, 84751, 110527, 103905, 2392, 2189, 201505, 454, 915, 418, 4426, 304, 7225, 11675, 28636, 91, 111, 1022, 7, 33079, 6626, 100094, 32233, 183234, 20625, ...	[ 0.0941162109375, 0.03167724609375, 0.1151123046875, 0.099853515625, 0.0162200927734375, 0.1739501953125, 0.158935546875, 0.09014892578125, 0.1512451171875, 0.0548095703125, 0.05682373046875, 0.091796875, 0.043670654296875, 0.06951904296875, 0.109619140625, 0.1905517578125, 0.18872070...	embed
39501998_c0	39501998	haskell	0	Title: Implementing String join function in Haskell Problem title: Implementing String join function in Haskell Tags: haskell Problem: Implementing String join function in Haskell I'm new to Haskell and trying to implement a function that takes a separator and a list to return a concatenated string (Similar to join fun...	Implementing String join function in Haskell Implementing String join function in Haskell haskell Implementing Haskell Implementing String join function in Haskell I'm new to Haskell and trying to implement a function that takes a separator and a list to return a concatenated string (Similar to join function in Python)...	[ -0.005767822265625, 0.004669189453125, 0.004058837890625, 0.000545501708984375, -0.0027313232421875, 0.01495361328125, -0.0166015625, -0.0019683837890625, 0.0223388671875, 0.028564453125, 0.009521484375, -0.0150146484375, 0.01287841796875, -0.0029449462890625, -0.00091552734375, -0.015...	[ 153941, 23351, 214, 33284, 32354, 23, 20625, 142508, 1556, 3525, 31577, 29479, 51776, 38310, 748, 136, 5303, 30646, 158, 4460, 33, 79315, 2605, 320, 145581, 11782, 7704, 16604, 73, 58745, 3584, 31, 1299, 28412, 1884, 16750, 12301, 126596, 1...	[ 0.2061767578125, 0.2110595703125, 0.10064697265625, 0.25390625, 0.18115234375, 0.040679931640625, 0.1500244140625, 0.253173828125, 0.1334228515625, 0.0615234375, 0.019439697265625, 0.16064453125, 0.06085205078125, 0.1590576171875, 0.1036376953125, 0.0159454345703125, 0.0970458984375,...	embed
28270414_c0	28270414	haskell	0	Title: Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Problem title: Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Tags: netwire, haskell, distributed-computing Problem: Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Basically, I want t...	Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? netwire haskell distributed-computing Cloud Haskell Netwire Can Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Basically, I want to experiment ...	[ 0.0002841949462890625, 0.0174560546875, 0.00628662109375, 0.006256103515625, -0.02001953125, -0.00170135498046875, 0.005462646484375, -0.016357421875, -0.01544189453125, -0.01324462890625, -0.0078125, -0.00927734375, 0.0093994140625, -0.002899169921875, -0.00872802734375, 0.01055908203...	[ 48316, 20625, 142508, 619, 25133, 10086, 17084, 13, 1836, 645, 6324, 4171, 15044, 11814, 191984, 74, 984, 2043, 1556, 15917, 3674, 7077, 3444, 28007, 563, 38796, 136, 32195, 5809, 4527, 47, 63769, 12921, 157, 51139, 21771, 87344, 1439, 90, ...	[ 0.2236328125, 0.1728515625, 0.289794921875, 0.1444091796875, 0.1417236328125, 0.134765625, 0.250244140625, 0.17041015625, 0.040618896484375, 0.1124267578125, 0.238525390625, 0.1181640625, 0.094482421875, 0.1534423828125, 0.1495361328125, 0.010498046875, 0.00146484375, 0.07983398437...	embed
49620356_c0	49620356	haskell	0	Title: Avoiding usage of fail in parsers from Parsers library Problem title: Avoiding usage of fail in parsers from Parsers library Tags: parser-combinators, parsing, haskell Problem: Avoiding usage of fail in parsers from Parsers library From what I was told using fail is not recommended and it will later be removed. ...	Avoiding usage of fail in parsers from Parsers library Avoiding usage of fail in parsers from Parsers library parser-combinators parsing haskell Parsers Avoiding Parser Integer Leading Zeros Avoiding usage of fail in parsers from Parsers library From what I was told using fail is not recommended and it will later be re...	[ -0.01239013671875, 0.012939453125, 0.0164794921875, 0.0081787109375, -0.007659912109375, 0.01495361328125, 0.000614166259765625, 0.000518798828125, 0.0027618408203125, -0.00823974609375, -0.0011444091796875, 0.0078125, 0.00024318695068359375, 0.00171661376953125, 0.01953125, -0.0078735...	[ 84361, 86675, 127689, 111, 35782, 23, 366, 7, 1314, 1295, 2392, 35773, 2189, 277, 19155, 22230, 1556, 142508, 44401, 165507, 83947, 1294, 30745, 17368, 83, 959, 170198, 184750, 4865, 5608, 155965, 11814, 64457, 74257, 17928, 102, 27781 ]	[ 0.1658935546875, 0.0221710205078125, 0.17236328125, 0.040618896484375, 0.2578125, 0.066162109375, 0.1849365234375, 0.123291015625, 0.1597900390625, 0.0751953125, 0.1805419921875, 0.137451171875, 0.1815185546875, 0.0249481201171875, 0.1634521484375, 0.05596923828125, 0.079345703125, ...	embed
66579458_c1	66579458	haskell	1	.hs, interpreted ) Ok, three modules loaded. There seems to be a confusion with autogen and with Paths_primo ( primo is the name of the package). What am I doing wrong? General question: what is the correct way to clean a stack project to "start over" after some experimentation? Is is correct to delete the cabal file a...	.hs, interpreted ) Ok, three modules loaded. There seems to be a confusion with autogen and with Paths_primo ( primo is the name of the package). What am I doing wrong? General question: what is the correct way to clean a stack project to "start over" after some experimentation? Is is correct to delete the cabal file a...	[ -0.004150390625, 0.0211181640625, -0.002288818359375, 0.01904296875, 0.00185394287109375, 0.01446533203125, -0.005401611328125, -0.015869140625, 0.00921630859375, -0.00145721435546875, -0.011474609375, -0.00628662109375, -0.007110595703125, 0.0028228759765625, 0.0005950927734375, 0.001...	[ 5, 127, 7, 29481, 297, 9972, 17262, 88996, 72367, 37202, 169463, 1809, 1409, 108421, 35188, 31, 10014, 98169, 444, 20594, 44691, 9082, 9655, 26785, 3917, 47, 46622, 177261, 13452, 17137, 645, 7103, 28007, 154109, 109524, 11435, 136, 18244, ...	[ 0.047210693359375, 0.142822265625, 0.0926513671875, 0.162841796875, 0.1270751953125, 0.014923095703125, 0.128662109375, 0.2333984375, 0.1495361328125, 0.0177154541015625, 0.17919921875, 0.2091064453125, 0.2230224609375, 0.2120361328125, 0.1942138671875, 0.20556640625, 0.25439453125, ...	embed
32331537_c1	32331537	haskell	1	of ‘bar’ from the context (KnownNat n) bound by a pattern with constructor SomeNat :: forall (n :: Nat). KnownNat n => Proxy n -> SomeNat, in a case alternative at Blag.hs:19:9-30 In the second argument of ‘($)’, namely ‘bar a’ In a stmt of a 'do' block: print $ bar a In the expression: do { let a :: Bar (n + 5) a = B...	of ‘bar’ from the context (KnownNat n) bound by a pattern with constructor SomeNat :: forall (n :: Nat). KnownNat n => Proxy n -> SomeNat, in a case alternative at Blag.hs:19:9-30 In the second argument of ‘($)’, namely ‘bar a’ In a stmt of a 'do' block: print $ bar a In the expression: do { let a :: Bar (n + 5) a = B...	[ 0.005615234375, 0.006683349609375, -0.015380859375, 0.0035247802734375, -0.00115966796875, 0.00081634521484375, -0.00104522705078125, 0.01519775390625, 0.01068115234375, -0.0213623046875, 0.00171661376953125, -0.0030670166015625, 0.01104736328125, 0.00439453125, -0.0009307861328125, -0...	[ 111, 1299, 1295, 43701, 35613, 19, 4645, 18, 653, 99091, 103510, 64549, 748, 31384, 1984, 5584, 68875, 70829, 1250, 50878, 30700, 3668, 23988, 1126, 27000, 17932, 10750, 4369, 10, 6138, 246, 46389, 28412, 3650, 1909, 125195, 54, 2633, 3253,...	[ 0.0728759765625, 0.2119140625, 0.040802001953125, 0.1849365234375, 0.150146484375, 0.056976318359375, 0.20849609375, 0.13623046875, 0.0823974609375, 0.134521484375, 0.1734619140625, 0.1142578125, 0.023406982421875, 0.06964111328125, 0.002288818359375, 0.124755859375, 0.1845703125, ...	embed
10474433_c0	10474433	haskell	0	Title: replace tuple in list of tuples - Haskell Problem title: replace tuple in list of tuples - Haskell Tags: tuples, haskell, list Problem: replace tuple in list of tuples - Haskell Hey guys I want to be able to replace a tuple in a list of tuples. Here is what I am thinking: let lst = [("john",3), ("greg",3), ("tom...	replace tuple in list of tuples - Haskell replace tuple in list of tuples - Haskell tuples haskell list Haskell replace tuple in list of tuples - Haskell Hey guys I want to be able to replace a tuple in a list of tuples. Here is what I am thinking: I want to be able to drop any tuple, say ("rob",7) from the list and th...	[ -0.00103759765625, 0.0223388671875, 0.000614166259765625, 0.006134033203125, -0.002044677734375, -0.004241943359375, -0.0240478515625, -0.0115966796875, 0.0111083984375, 0.007659912109375, 0.004669189453125, -0.0264892578125, 0.0020294189453125, -0.0047607421875, -0.00360107421875, 0.0...	[ 91995, 370, 8705, 23, 5303, 111, 99726, 20625, 142508, 1556, 28240, 51484, 87, 3444, 19048, 47, 10, 47644, 36069, 2499, 5154, 21359, 36076, 678, 3525, 21845, 21320, 3564, 2704, 6713, 1884, 4358, 129745 ]	[ 0.1776123046875, 0.170166015625, 0.225830078125, 0.05908203125, 0.1728515625, 0.06463623046875, 0.233154296875, 0.13134765625, 0.2047119140625, 0.1116943359375, 0.0285491943359375, 0.052154541015625, 0.006195068359375, 0.08837890625, 0.07513427734375, 0.041900634765625, 0.01893615722...	embed
48709079_c0	48709079	haskell	0	Title: How to convert any type to Symbol using type families? Problem title: How to convert any type to Symbol using type families? Tags: haskell, type-families Problem: How to convert any type to Symbol using type families? I want to convert any type to type-level string using some type families. Of course, I can writ...	How to convert any type to Symbol using type families? How to convert any type to Symbol using type families? haskell type-families type How Symbol ShowType Typeable How to convert any type to Symbol using type families? I want to convert any type to type-level string using some type families. Of course, I can write so...	[ 0.002410888671875, -0.0286865234375, -0.006500244140625, 0.01214599609375, -0.02294921875, -0.0002117156982421875, -0.01483154296875, 0.00933837890625, 0.00543212890625, -0.019287109375, -0.0205078125, -0.033203125, 0.0247802734375, 0.03369140625, -0.0135498046875, 0.005523681640625, ...	[ 11249, 47, 96760, 2499, 10644, 131899, 17368, 87143, 1556, 142508, 69128, 17367, 196707, 60457, 2886, 3444, 67919, 79315, 831, 33022, 903, 32195, 144573, 191619, 11675, 6032, 53088, 3642, 191082 ]	[ 0.06036376953125, 0.1024169921875, 0.1480712890625, 0.109375, 0.2474365234375, 0.275146484375, 0.049407958984375, 0.177978515625, 0.08306884765625, 0.1865234375, 0.08489990234375, 0.09814453125, 0.2236328125, 0.1766357421875, 0.143310546875, 0.049652099609375, 0.148193359375, 0.142...	embed
60307082_c0	60307082	haskell	0	Title: Automatically running unit tests in Haskell Problem title: Automatically running unit tests in Haskell Tags: cabal, haskell Problem: Automatically running unit tests in Haskell Is there a way to run my test suites with my build command? All I can find is that I can run e.g. cabal test after cabal build . What I ...	Automatically running unit tests in Haskell Automatically running unit tests in Haskell cabal haskell Automatically Haskell Automatically running unit tests in Haskell Is there a way to run my test suites with my build command? All I can find is that I can run e.g. cabal test after cabal build . What I want is a way to...	[ 0.0126953125, 0.017822265625, 0.01544189453125, -0.01220703125, -0.00323486328125, 0.00311279296875, -0.0036468505859375, 0.007476806640625, -0.00634765625, -0.0034027099609375, -0.00445556640625, -0.00860595703125, -0.007110595703125, 0.02685546875, -0.0093994140625, 0.01055908203125,...	[ 51719, 71407, 51042, 25072, 109921, 20625, 142508, 23, 109524, 1556, 2685, 10, 3917, 11675, 3034, 14947, 7, 678, 759, 45367, 75101, 831, 7103, 3444, 191082, 3229, 29806, 11408, 35672, 33976, 98169, 12921, 26499, 60223, 79, 330, 114977, 30388,...	[ 0.180908203125, 0.045867919921875, 0.148193359375, 0.1824951171875, 0.251953125, 0.136474609375, 0.229736328125, 0.0538330078125, 0.202880859375, 0.1234130859375, 0.0180816650390625, 0.00177001953125, 0.052703857421875, 0.172607421875, 0.2335205078125, 0.17138671875, 0.00262451171875...	embed
64452881_c0	64452881	haskell	0	Title: Non-exhaustive patterns in function lookUp Problem title: Non-exhaustive patterns in function lookUp Tags: pattern-matching, haskell Problem: Non-exhaustive patterns in function lookUp I'm trying to define a function in haskell, that given a search string and a list of string/item pairs, returns the list of item...	Non-exhaustive patterns in function lookUp Non-exhaustive patterns in function lookUp pattern-matching haskell Non-exhaustive Non-exhaustive patterns in function lookUp I'm trying to define a function in haskell, that given a search string and a list of string/item pairs, returns the list of items whose associated stri...	[ -0.0126953125, 0.01458740234375, 0.00677490234375, 0.0155029296875, 0.004669189453125, 0.005157470703125, -0.005706787109375, -0.00927734375, 0.0294189453125, -0.00537109375, 0.017822265625, -0.0296630859375, 0.0152587890625, -0.002685546875, 0.01556396484375, 0.012939453125, 0.02563...	[ 3775, 3355, 18391, 4935, 103510, 32354, 6713, 53234, 23, 98753, 1556, 142508, 7, 31577, 61924, 34475, 33938, 79315, 136, 5303, 217, 195, 80836, 30646, 55769, 124901, 137272, 14858, 83279, 284, 50490, 1126, 43317, 36076, 151117, 186922, 217684, ...	[ 0.1673583984375, 0.0207366943359375, 0.1322021484375, 0.07958984375, 0.240478515625, 0.1585693359375, 0.1273193359375, 0.2032470703125, 0.0226593017578125, 0.1727294921875, 0.1168212890625, 0.2056884765625, 0.007843017578125, 0.0254058837890625, 0.124267578125, 0.023162841796875, 0.1...	embed
19984808_c0	19984808	haskell	0	Title: Meaning of (something -> do) Problem title: Meaning of (something -> do) Tags: haskell Problem: Meaning of (something -> do) I encountered following function on the Real World Haskell book: namesMatching pat \| not (isPattern pat) = do exists <- doesNameExist pat return (if exists then [pat] else []) \| othe...	Meaning of (something -> do) Meaning of (something -> do) haskell Meaning Meaning of (something -> do) I encountered following function on the Real World Haskell book: What does the following line mean: ("", baseName) -> do ? I have seen -> in function type signature but what does this do in this code.	[ 0.0103759765625, -0.007415771484375, 0.0021514892578125, -0.007781982421875, -0.0142822265625, 0.0267333984375, 0.007232666015625, 0.0184326171875, 0.03466796875, -0.015380859375, 0.00836181640625, -0.0174560546875, -0.0164794921875, -0.0036773681640625, -0.01300048828125, -0.008789062...	[ 1215, 11, 592, 111, 43452, 64113, 20, 1230, 5386, 54, 1556, 142508, 33079, 190647, 25632, 32354, 5120, 6661, 20625, 12877, 14602, 13315, 29459, 3647, 163612, 51592, 10644, 138256, 2367, 903, 18151 ]	[ 0.14404296875, 0.151123046875, 0.06024169921875, 0.157958984375, 0.076904296875, 0.149169921875, 0.0867919921875, 0.05023193359375, 0.169921875, 0.20654296875, 0.1097412109375, 0.192626953125, 0.197998046875, 0.0254974365234375, 0.077392578125, 0.1510009765625, 0.09503173828125, 0....	embed
42054650_c0	42054650	haskell	0	Title: Save variable and use it on recursion Problem title: Save variable and use it on recursion Tags: haskell, recursion, functional-programming Problem: Save variable and use it on recursion Suppose I have the following function printVariance :: [Float] -> IO () printVariance [] = return () printVariance (x:xs) \| x ...	Save variable and use it on recursion Save variable and use it on recursion haskell recursion functional-programming Save Float x:xs Save variable and use it on recursion Suppose I have the following function Which gets a list, checks which elements are bigger than the average and prints their value - avg . My problem ...	[ -0.00457763671875, 0.000476837158203125, 0.00653076171875, 0.00469970703125, 0.00848388671875, 0.021240234375, -0.00567626953125, 0.0079345703125, 0.0260009765625, -0.023681640625, 0.0111083984375, -0.0128173828125, 0.019287109375, 0.01287841796875, 0.01202392578125, 0.012939453125, ...	[ 64944, 77336, 136, 4527, 442, 98, 195625, 1830, 1556, 142508, 123309, 28966, 38699, 257, 1022, 425, 25632, 32354, 62163, 5303, 12765, 80854, 167785, 3501, 83080, 28412, 34292, 185, 177, 2967, 65572, 11907, 29954, 831, 61924, 1660, 24145 ]	[ 0.188720703125, 0.28369140625, 0.030792236328125, 0.16650390625, 0.051727294921875, 0.08758544921875, 0.2247314453125, 0.1014404296875, 0.104248046875, 0.19384765625, 0.1468505859375, 0.096923828125, 0.158935546875, 0.048583984375, 0.03839111328125, 0.06695556640625, 0.03472900390625...	embed
55690357_c0	55690357	haskell	0	Title: Higher kinded empty constraint Problem title: Higher kinded empty constraint Tags: constraint-kinds, haskell Problem: Higher kinded empty constraint I want to have an empty constraint at a higher kind. Suppose I have the following class: class Category k where type Obj k :: * -> Constraint id :: Obj k a => a `k`...	Higher kinded empty constraint Higher kinded empty constraint constraint-kinds haskell Higher Category Obj Constraint Higher kinded empty constraint I want to have an empty constraint at a higher kind. Suppose I have the following class: Now I want to make an instance for functions such that it doesn't constrain the el...	[ 0.0096435546875, -0.01251220703125, 0.0031280517578125, -0.0069580078125, -0.00014495849609375, 0.004730224609375, -0.013916015625, -0.02099609375, 0.011474609375, -0.00994873046875, -0.0283203125, -0.03369140625, -0.01507568359375, -0.00170135498046875, -0.01116943359375, -0.013671875...	[ 19694, 56, 8562, 297, 201505, 158, 2816, 4288, 68347, 1556, 142508, 49057, 3545, 170, 1657, 3444, 765, 99, 77546, 25632, 18507, 3249, 110527, 100, 32354, 22027, 18, 73, 80854, 8337, 237 ]	[ 0.1326904296875, 0.0645751953125, 0.1572265625, 0.08355712890625, 0.2108154296875, 0.0792236328125, 0.1734619140625, 0.130615234375, 0.1427001953125, 0.102294921875, 0.2093505859375, 0.1148681640625, 0.13232421875, 0.158203125, 0.040069580078125, 0.076416015625, 0.0265655517578125, ...	embed
57258608_c0	57258608	haskell	0	Title: Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? Problem title: Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? Tags: fold, haskell Problem: Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? In Foldable t , foldMap is defined based on fol...	Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? fold haskell Can Foldable Monoid Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? In Foldable t , foldMap is defined based on foldr Can foldMap f b...	[ -0.01129150390625, -0.00537109375, 0.019775390625, 0.021484375, -0.0166015625, -0.007415771484375, -0.01153564453125, 0.01055908203125, 0.0023956298828125, -0.005218505859375, -0.0159912109375, -0.00714111328125, -0.00023555755615234375, 0.030029296875, -0.0027923583984375, -0.00799560...	[ 4171, 42822, 166179, 1238, 61924, 183234, 141, 420, 69407, 1556, 142508, 30077, 71, 2886, 77879, 532, 64, 808, 35509, 18344, 7569, 136, 166577, 10422, 20469 ]	[ 0.0272674560546875, 0.2135009765625, 0.2449951171875, 0.1939697265625, 0.1572265625, 0.141357421875, 0.1270751953125, 0.1602783203125, 0.0350341796875, 0.076416015625, 0.1722412109375, 0.1534423828125, 0.0921630859375, 0.1351318359375, 0.1181640625, 0.1058349609375, 0.019683837890625...	embed
57345332_c0	57345332	haskell	0	Title: pattern matching on constants Problem title: pattern matching on constants Tags: functional-programming, haskell, pattern-matching, syntax Problem: pattern matching on constants So I have these constant FilePath variables (strings) s1 , s2 , s3 , s4 ... :: Filepath s1 = "help.txt" s2 = "sljdfn" -- ... And I have...	pattern matching on constants pattern matching on constants functional-programming haskell pattern-matching syntax Filepath help.txt pattern matching on constants So I have these constant FilePath variables (strings) And I have a function that takes one of these filepaths and returns a int. However when compiling I get...	[ 0.01043701171875, 0.00457763671875, -0.00052642822265625, 0.0011749267578125, -0.00567626953125, -0.010009765625, -0.0194091796875, 0.0194091796875, 0.006103515625, -0.0164794921875, 0.0025634765625, -0.01324462890625, -0.003997802734375, 0.0019378662109375, 0.0133056640625, 0.01538085...	[ 103510, 14858, 214, 98, 53697, 7, 123309, 28966, 1556, 142508, 98753, 6002, 86531, 42724, 128405, 4358, 124326, 765, 6097, 683, 10519, 77336, 91693, 32354, 51776, 11435, 30646, 23, 18, 9969, 49725, 4842, 35405, 1631, 592, 1528, 68991, 1225, ...	[ 0.25048828125, 0.2359619140625, 0.10009765625, 0.1214599609375, 0.19677734375, 0.06390380859375, 0.1114501953125, 0.0780029296875, 0.10467529296875, 0.2052001953125, 0.226318359375, 0.0271453857421875, 0.06231689453125, 0.15234375, 0.1949462890625, 0.14111328125, 0.152587890625, 0....	embed
60030467_c0	60030467	haskell	0	Title: Example of violating the Functor rules in Haskell Problem title: Example of violating the Functor rules in Haskell Tags: haskell, functor Problem: Example of violating the Functor rules in Haskell I have a data structure for binary tree and a Functor over it data BST a = Empty \| Node (BST a) a (BST a) instance F...	Example of violating the Functor rules in Haskell Example of violating the Functor rules in Haskell haskell functor Example Functor Haskell BST Empty Node Example of violating the Functor rules in Haskell I have a data structure for binary tree and a Functor over it I need to find an example of some BST instance and a ...	[ 0.01470947265625, -0.0007476806640625, 0.0000762939453125, -0.00421142578125, 0.033935546875, 0.021484375, -0.01068115234375, -0.01519775390625, 0.005096435546875, 0.000545501708984375, 0.0036468505859375, -0.030517578125, 0.0133056640625, 0.0206298828125, -0.00116729736328125, -0.0153...	[ 89536, 8705, 111, 54567, 1916, 28670, 18770, 91736, 20625, 142508, 23, 1556, 7477, 335, 8545, 31678, 939, 438, 112, 70, 2053, 45646, 2394, 6635, 53201, 645, 27781, 110527, 32354, 1238, 37379, 2481, 277, 40322, 3674 ]	[ 0.1650390625, 0.056182861328125, 0.031494140625, 0.182861328125, 0.048126220703125, 0.1572265625, 0.1951904296875, 0.1773681640625, 0.1583251953125, 0.263427734375, 0.02508544921875, 0.1285400390625, 0.1082763671875, 0.06182861328125, 0.177490234375, 0.173095703125, 0.08544921875, ...	embed
35805301_c0	35805301	haskell	0	Title: How to prevent all windows from floating (xmonad) Problem title: How to prevent all windows from floating (xmonad) Tags: haskell, xmonad Problem: How to prevent all windows from floating (xmonad) In my system, xmonad floating windows are extremely buggy. Sometimes they appear out of the screen, under main window...	How to prevent all windows from floating (xmonad) How to prevent all windows from floating (xmonad) haskell xmonad floating How How to prevent all windows from floating (xmonad) In my system, xmonad floating windows are extremely buggy. Sometimes they appear out of the screen, under main windows. They may rapidly activ...	[ 0.0035552978515625, 0.0260009765625, -0.0020294189453125, -0.021728515625, 0.02978515625, 0.0191650390625, 0.00799560546875, -0.0302734375, -0.0098876953125, -0.046875, 0.0028228759765625, -0.00860595703125, 0.01190185546875, 0.00958251953125, -0.00830078125, -0.0028533935546875, 0.0...	[ 11249, 47, 56282, 756, 54825, 1295, 21917, 26518, 425, 3796, 712, 1556, 142508, 1022, 5426, 111531, 373, 67192, 160193, 108975, 1810, 49119, 1379, 5201, 25545, 34704, 111438, 4092, 731, 69201, 18158, 98, 37772, 11907, 76896, 237, 3638, 2837, ...	[ 0.0440673828125, 0.035919189453125, 0.199462890625, 0.14013671875, 0.1968994140625, 0.10498046875, 0.191162109375, 0.16748046875, 0.038055419921875, 0.107177734375, 0.174560546875, 0.07037353515625, 0.1910400390625, 0.055419921875, 0.03436279296875, 0.060333251953125, 0.0395202636718...	embed
29432947_c0	29432947	haskell	0	Title: Is there instance Alternative ((->) r)? Problem title: Is there instance Alternative ((->) r)? Tags: haskell, alternative-functor Problem: Is there instance Alternative ((->) r)? I got accustomed to using a <> b where a and b take arguments. > const ["a"] <> const ["b"] $ True ["a","b"] Why there is no a <...	Is there instance Alternative ((->) r)? Is there instance Alternative ((->) r)? haskell alternative-functor a Alternative Bool Is there instance Alternative ((->) r)? I got accustomed to using a <> b where a and b take arguments. Why there is no a <\|> b as well?	[ 0.0146484375, -0.0012664794921875, 0.024658203125, 0.01019287109375, 0.00022792816162109375, 0.01019287109375, -0.021728515625, -0.0067138671875, -0.0047607421875, 0.00025177001953125, -0.01904296875, 0.024658203125, 0.00958251953125, 0.0250244140625, 0.01239013671875, -0.01953125, 0...	[ 2071, 2685, 110527, 103905, 60494, 9, 1230, 5386, 1690, 1556, 142508, 30700, 16498, 18770, 10, 2460, 929, 103607, 16, 4163, 61689, 2785, 4806, 17368, 4426, 2740, 876, 7440, 136, 5646, 10750, 44084, 83, 110, 58745, 5299 ]	[ 0.055450439453125, 0.09326171875, 0.265869140625, 0.2337646484375, 0.0872802734375, 0.0877685546875, 0.07275390625, 0.114990234375, 0.1533203125, 0.1383056640625, 0.243408203125, 0.2227783203125, 0.1131591796875, 0.14208984375, 0.0811767578125, 0.1083984375, 0.1881103515625, 0.1555...	embed
4232511_c0	4232511	haskell	0	Title: 'm a' vs 'm ()' in guard Problem title: 'm a' vs 'm ()' in guard Tags: haskell, monads Problem: 'm a' vs 'm ()' in guard guard :: (MonadPlus m) => Bool -> m () guard True = return () guard False = mzero Prelude Control.Monad> :t mzero mzero :: (MonadPlus m) => m a In the F...	'm a' vs 'm ()' in guard 'm a' vs 'm ()' in guard haskell monads MonadPlus Bool Prelude Control.Monad Maybe 'm a' vs 'm ()' in guard In the False branch of guard , the type of mzero is m a , but the return type of guard has been specified as m () . Hence I don't quite get it why ...	[ 0.005157470703125, 0.01312255859375, 0.0184326171875, 0.00323486328125, 0.01507568359375, -0.0086669921875, -0.007110595703125, -0.00823974609375, 0.0029754638671875, 0.0019989013671875, 0.00421142578125, -0.0274658203125, -0.0159912109375, -0.0091552734375, 0.00909423828125, -0.002853...	[ 3768, 39, 10, 74, 20209, 15, 23, 56050, 1556, 142508, 2667, 712, 60331, 71, 88225, 2460, 929, 1914, 822, 112, 27131, 46674, 83425, 22225, 184, 32845, 206, 10644, 347, 80510, 83, 30646, 111, 58735, 237, 15400, 9969, 34759, 23742, 18, 186...	[ 0.114501953125, 0.1859130859375, 0.1898193359375, 0.0228271484375, 0.2327880859375, 0.05938720703125, 0.092529296875, 0.291015625, 0.079345703125, 0.1923828125, 0.06927490234375, 0.09149169921875, 0.114501953125, 0.050567626953125, 0.1744384765625, 0.0224151611328125, 0.1163330078125...	embed
47157748_c0	47157748	haskell	0	Title: List of functions applying to argument Problem title: List of functions applying to argument Tags: haskell Problem: List of functions applying to argument Task is to make function, taking list of unary functions (+1,*2 etc.) (3 at least) and consistently applying them to argument. For example: func 1 [(+1),(+1),...	List of functions applying to argument List of functions applying to argument haskell List List of functions applying to argument Task is to make function, taking list of unary functions (+1,*2 etc.) (3 at least) and consistently applying them to argument. For example: func 1 [(+1),(+1),(/2)] == 1.5. Here's what i made...	[ -0.0162353515625, 0.011474609375, 0.0098876953125, 0.004791259765625, -0.01495361328125, 0.00372314453125, -0.00860595703125, 0.0191650390625, 0.0115966796875, -0.024169921875, -0.002410888671875, -0.025634765625, 0.0201416015625, 0.033447265625, 0.00885009765625, -0.003997802734375, ...	[ 32036, 32354, 7, 59911, 214, 47, 10750, 1556, 142508, 9598, 92, 83, 3249, 35971, 5303, 220, 1294, 21748, 1639, 304, 6896, 19713, 74729, 27781, 7477, 238, 106, 12477, 69112, 22410, 7228, 3642, 831, 243131, 111, 38937, 86171, 1286, 138, 296...	[ 0.17822265625, 0.26220703125, 0.10455322265625, 0.1331787109375, 0.04058837890625, 0.08624267578125, 0.28466796875, 0.143310546875, 0.237060546875, 0.1663818359375, 0.0712890625, 0.013580322265625, 0.09613037109375, 0.0667724609375, 0.1773681640625, 0.117919921875, 0.0948486328125, ...	embed
33361100_c1	33361100	haskell	1	: let val = convert testfunc1 [VInteger 3, VInteger 5] :: Maybe Value And this, which is my usecase, doesn't either: funclist :: Monad m => [ [Value] -> m Value ] funclist = [ convert testfunc1 ] The error is: No instance for (GHC.Base.Monad m1) arising from a use of ‘Main.testfunc1’ The type variable ‘m1’ is ambiguous...	: let val = convert testfunc1 [VInteger 3, VInteger 5] :: Maybe Value And this, which is my usecase, doesn't either: funclist :: Monad m => [ [Value] -> m Value ] funclist = [ convert testfunc1 ] The error is: No instance for (GHC.Base.Monad m1) arising from a use of ‘Main.testfunc1’ The type variable ‘m1’ is ambiguous...	[ -0.0194091796875, -0.0242919921875, 0.00029754638671875, 0.01409912109375, 0.00933837890625, 0.00640869140625, -0.0012359619140625, -0.007537841796875, 0.01202392578125, -0.023681640625, 0.0012969970703125, -0.01019287109375, -0.005859375, -0.016357421875, 0.00098419189453125, -0.02038...	[ 2633, 3502, 96760, 3034, 16498, 238, 418, 11839, 1479, 1505, 138, 5947, 190, 83425, 190060, 4527, 58437, 22027, 18, 40101, 7477, 6562, 60331, 71, 347, 856, 50770, 18499, 438, 110527, 100, 41877, 441, 63473, 46674, 712, 17727, 187, 72219, ...	[ 0.113037109375, 0.212890625, 0.1761474609375, 0.182861328125, 0.164306640625, 0.06982421875, 0.122802734375, 0.043243408203125, 0.1190185546875, 0.1614990234375, 0.1014404296875, 0.06982421875, 0.1082763671875, 0.19091796875, 0.212890625, 0.080322265625, 0.047943115234375, 0.006439...	embed
60572738_c0	60572738	haskell	0	Title: How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? Problem title: How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? Tags: haskell, option-type, monads Pro...	How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? haskell option-type monads How Maybe Haskell Just How do I s...	[ -0.013427734375, 0.004425048828125, 0.0244140625, 0.00787353515625, -0.01007080078125, 0.01116943359375, 0.006744384765625, 0.0093994140625, 0.000957489013671875, 0.0220947265625, -0.015869140625, -0.000179290771484375, -0.009521484375, 0.0191650390625, 0.00086212158203125, -0.00793457...	[ 11249, 1614, 39989, 18, 83425, 142424, 20625, 142508, 3444, 9563, 382, 190, 138, 3642, 23, 1556, 35829, 50986, 2667, 712, 54, 87, 27781, 20, 2046, 2806, 25632 ]	[ 0.06549072265625, 0.14501953125, 0.16796875, 0.07177734375, 0.30908203125, 0.2186279296875, 0.137939453125, 0.259521484375, 0.0743408203125, 0.1214599609375, 0.181396484375, 0.1624755859375, 0.1634521484375, 0.032135009765625, 0.04229736328125, 0.0997314453125, 0.1358642578125, 0.0...	embed
17674991_c0	17674991	haskell	0	Title: Is there a patten match with Writer Monad in Haskell? Problem title: Is there a patten match with Writer Monad in Haskell? Tags: haskell, monads Problem: Is there a patten match with Writer Monad in Haskell? What is correct way to do pattern match with Writer Monad in Haskell? I want to do like following... impo...	Is there a patten match with Writer Monad in Haskell? Is there a patten match with Writer Monad in Haskell? haskell monads Control.Monad.Writer Writer Monad Haskell WriterT Writer.Identity Is there a patten match with Writer Monad in Haskell? What is correct way to do pattern match with Writer Monad in Haskell? I want ...	[ -0.03466796875, 0.0181884765625, 0.0003108978271484375, 0.003692626953125, -0.0125732421875, -0.01251220703125, -0.01385498046875, -0.002197265625, -0.00335693359375, 0.0159912109375, 0.01104736328125, 0.0054931640625, 0.0108642578125, -0.006805419921875, 0.007232666015625, -0.00704956...	[ 2071, 2685, 10, 2340, 510, 14858, 678, 601, 2783, 56, 60331, 71, 23, 20625, 142508, 1556, 2667, 712, 27131, 46674, 1456, 618, 568, 37379, 2481, 26785, 3917, 47, 54, 103510, 25632, 60212, 17721, 136, 5, 196219, 16454 ]	[ 0.038726806640625, 0.07440185546875, 0.05645751953125, 0.142822265625, 0.1878662109375, 0.2294921875, 0.1236572265625, 0.06427001953125, 0.20361328125, 0.164306640625, 0.199462890625, 0.151123046875, 0.0628662109375, 0.138671875, 0.25048828125, 0.110107421875, 0.0865478515625, 0.13...	embed
26252289_c1	26252289	haskell	1	isson functions for each nested container. Since containers are f1 (f2 (f3 ... (fN a)...) then, criteria could/should be provided as By comparer1 (By comparer2 (By ... . But may be better other approach, of course. moreover, probably exists a better "Haskell approach" BUT I wish (if possible) Exists some direct solutio...	isson functions for each nested container. Since containers are f1 (f2 (f3 ... (fN a)...) then, criteria could/should be provided as By comparer1 (By comparer2 (By ... . But may be better other approach, of course. moreover, probably exists a better "Haskell approach" BUT I wish (if possible) Exists some direct solutio...	[ 0.00445556640625, -0.007232666015625, -0.0086669921875, -0.0196533203125, 0.01153564453125, -0.0091552734375, 0.0196533203125, -0.00946044921875, 0.020751953125, -0.0228271484375, -0.010009765625, 0.00933837890625, 0.00701904296875, 0.013916015625, 0.01019287109375, -0.02685546875, -...	[ 17, 4503, 32354, 7, 100, 12638, 8512, 71, 116419, 621, 1238, 418, 420, 304, 363, 839, 10, 55738, 11, 5809, 11412, 62952, 237, 3311, 37397, 56, 75358, 11522, 51515, 31895, 32316, 6495, 142508, 151654, 32599, 7722, 5443, 8951, 29806, 759, ...	[ 0.1832275390625, 0.26220703125, 0.1905517578125, 0.058837890625, 0.058441162109375, 0.1297607421875, 0.2264404296875, 0.1221923828125, 0.270751953125, 0.0198822021484375, 0.078857421875, 0.06298828125, 0.05877685546875, 0.08575439453125, 0.07916259765625, 0.053985595703125, 0.0734252...	embed
39721081_c0	39721081	haskell	0	Title: Performing operations on custom data types? Problem title: Performing operations on custom data types? Tags: types, haskell Problem: Performing operations on custom data types? I have the following data type: data Users = Height Int \| Age Int I then have a list of ages: myList = [Age 44, Age 54, Age 21, Age 34, ...	Performing operations on custom data types? Performing operations on custom data types? types haskell a Performing Users Height Age Num Performing operations on custom data types? I have the following data type: I then have a list of ages: Which I want to apply to this function: However this causes the following error:...	[ -0.002838134765625, -0.0106201171875, 0.007354736328125, 0.007598876953125, -0.01385498046875, 0.0169677734375, -0.005157470703125, -0.0023345947265625, 0.0203857421875, -0.0267333984375, 0.0048828125, -0.034912109375, 0.0115966796875, -0.0084228515625, -0.00286865234375, -0.0196533203...	[ 169033, 214, 41018, 7, 98, 114122, 2053, 52895, 32, 1556, 142508, 10, 53400, 1529, 22553, 72944, 52782, 70, 25632, 10644, 7068, 765, 5303, 4188, 3444, 47, 59911, 903, 32354, 33306, 113660, 18499, 11249, 831, 3249, 4488, 3871, 84797, 284, ...	[ 0.1658935546875, 0.076904296875, 0.183837890625, 0.0621337890625, 0.1387939453125, 0.240478515625, 0.1346435546875, 0.2264404296875, 0.014007568359375, 0.170166015625, 0.2476806640625, 0.1104736328125, 0.1768798828125, 0.1787109375, 0.1451416015625, 0.17724609375, 0.15625, 0.010101...	embed
52891362_c0	52891362	haskell	0	Title: Empty List of specific type in Haskell Problem title: Empty List of specific type in Haskell Tags: haskell Problem: Empty List of specific type in Haskell I need to create an empty list of specific type. I am creating a stack which in internally a list. To create empty stack I need to pass empty list. But how ca...	Empty List of specific type in Haskell Empty List of specific type in Haskell haskell Empty List Haskell Stack Show MyName Empty List of specific type in Haskell I need to create an empty list of specific type. I am creating a stack which in internally a list. To create empty stack I need to pass empty list. But how ca...	[ 0.0034942626953125, 0.000007212162017822266, 0.0011749267578125, 0.0115966796875, -0.00933837890625, 0.00665283203125, -0.0076904296875, -0.013427734375, -0.000179290771484375, 0.0064697265625, -0.0028228759765625, -0.03515625, 0.000736236572265625, 0.004119873046875, -0.0159912109375, ...	[ 31678, 939, 32036, 29458, 10644, 20625, 142508, 111, 23, 1556, 6512, 2594, 17367, 2646, 163612, 3871, 28282, 201505, 5303, 105233, 177261, 70796, 27875, 3642, 175399, 360, 18, 37842, 12, 4153, 3789, 162515, 1620, 27853, 110, 36272, 9615 ]	[ 0.1942138671875, 0.1429443359375, 0.2086181640625, 0.2213134765625, 0.17333984375, 0.1436767578125, 0.2239990234375, 0.06201171875, 0.04266357421875, 0.1326904296875, 0.0960693359375, 0.08050537109375, 0.117919921875, 0.10321044921875, 0.149658203125, 0.04327392578125, 0.114501953125...	embed
7768066_c0	7768066	haskell	0	Title: How do you define state in Haskell? Problem title: How do you define state in Haskell? Tags: haskell, state Problem: How do you define state in Haskell? How do you define state in Haskell? My first idea was to use algebraic data types. I've also heard about the state monad, but I don't really know what it is. As...	How do you define state in Haskell? How do you define state in Haskell? haskell state How Haskell How do you define state in Haskell? How do you define state in Haskell? My first idea was to use algebraic data types. I've also heard about the state monad, but I don't really know what it is. As an example, lets use Texa...	[ -0.011962890625, 0.003936767578125, 0.007598876953125, 0.007110595703125, 0.000782012939453125, 0.006378173828125, -0.0208740234375, -0.0024566650390625, 0.000713348388671875, -0.01300048828125, -0.0047607421875, 0.002532958984375, -0.01190185546875, 0.027099609375, -0.01904296875, -0....	[ 11249, 61924, 11341, 23, 20625, 142508, 1556, 6528, 4527, 429, 2844, 2053, 52895, 49782, 2667, 712, 83, 27781, 31464, 16401, 195, 25600, 33636, 117249, 6626, 126381, 44540, 45443, 61972, 92865, 8108, 831, 42822, 12765, 1600, 1022, 138804, 154...	[ 0.052276611328125, 0.197509765625, 0.24267578125, 0.076171875, 0.1424560546875, 0.248779296875, 0.1295166015625, 0.0428466796875, 0.0171051025390625, 0.0220794677734375, 0.03582763671875, 0.0987548828125, 0.1256103515625, 0.0086669921875, 0.092041015625, 0.1456298828125, 0.0034790039...	embed
56993991_c1	56993991	haskell	1	tnf <- program output Output when executed after compilation: 1 <- user has to input before the console is printed out Hello world <--┘ 2 <--┘ Would you like to encrypt (1) or decrypt (2)? Enter code for encryption: Enter key for the code: Encrypted message: Jgnnq"yqtnf Is there something about putStrLn and putStr that...	tnf <- program output Output when executed after compilation: 1 <- user has to input before the console is printed out Hello world <--┘ 2 <--┘ Would you like to encrypt (1) or decrypt (2)? Enter code for encryption: Enter key for the code: Encrypted message: Jgnnq"yqtnf Is there something about putStrLn and putStr that...	[ 0.016845703125, -0.0010223388671875, -0.0205078125, 0.00052642822265625, -0.004302978515625, 0.01214599609375, 0.0150146484375, -0.004852294921875, 0.0025482177734375, -0.01361083984375, 0.0005035400390625, -0.0172119140625, -0.00167083740234375, 0.01361083984375, -0.020263671875, 0.00...	[ 808, 19, 420, 1528, 140992, 13538, 7077, 3229, 71924, 7103, 98352, 106, 38937, 1556, 107730, 8108, 130250, 28412, 1810, 35378, 8999, 246429, 116, 154559, 1884, 22, 136791, 707, 8, 1737, 60816, 18151, 22799, 357, 26008, 821, 10713, 864, 3884...	[ 0.011016845703125, 0.1087646484375, 0.15380859375, 0.156005859375, 0.2099609375, 0.126953125, 0.061614990234375, 0.0174407958984375, 0.16357421875, 0.07489013671875, 0.1722412109375, 0.026763916015625, 0.09381103515625, 0.02197265625, 0.1387939453125, 0.06390380859375, 0.177001953125...	embed
23205289_c0	23205289	haskell	0	Title: Why can't ++ be used in pattern matching? Problem title: Why can't ++ be used in pattern matching? Tags: pattern-matching, haskell, list Problem: Why can't ++ be used in pattern matching? From LearnYouAHaskell: One more thing — you can't use ++ in pattern matches. If you tried to pattern match against ...	Why can't ++ be used in pattern matching? Why can't ++ be used in pattern matching? pattern-matching haskell list Why Why can't ++ be used in pattern matching? From LearnYouAHaskell: I'm struggling to reason about what he means by the nature of lists why this can't be.	[ -0.0152587890625, 0.01263427734375, 0.029052734375, -0.00286865234375, -0.008544921875, 0.01953125, -0.00506591796875, -0.0035552978515625, 0.0224609375, -0.0184326171875, 0.0115966796875, -0.023681640625, 0.0189208984375, -0.002471923828125, -0.00173187255859375, -0.00099945068359375,...	[ 44084, 831, 3768, 18, 37223, 11814, 23, 103510, 14858, 214, 98753, 1556, 142508, 5303, 186, 134031, 23562, 162, 237875, 31635, 764, 26950, 15400, 903 ]	[ 0.09942626953125, 0.12109375, 0.02557373046875, 0.10028076171875, 0.2666015625, 0.1185302734375, 0.0457763671875, 0.211181640625, 0.2027587890625, 0.083984375, 0.1993408203125, 0.1036376953125, 0.1634521484375, 0.1309814453125, 0.046875, 0.003326416015625, 0.010009765625, 0.0153045...	embed
8510570_c0	8510570	haskell	0	Title: Restricting values in type constructors Problem title: Restricting values in type constructors Tags: haskell Problem: Restricting values in type constructors Possible Duplicate: How to create a type bounded within a certain range I have the data type: data Expr = Num Int \| Expression Expr Operator Expr In the co...	Restricting values in type constructors Restricting values in type constructors haskell Restricting Expr Num Expression Operator Restricting values in type constructors I have the data type: In the context of the problem, the numbers that (Num Int) will represent are single digit only. Is there a way to ensure that res...	[ -0.0224609375, -0.015625, 0.0089111328125, -0.00506591796875, 0.00714111328125, 0.01361083984375, -0.0130615234375, 0.008544921875, 0.00165557861328125, 0.006988525390625, -0.00732421875, -0.03271484375, 0.0101318359375, -0.005035400390625, -0.005401611328125, 0.01080322265625, -0.00...	[ 853, 144225, 214, 142424, 10644, 64549, 25251, 1556, 142508, 60075, 42, 52782, 25129, 150922, 23, 2053, 43701, 2967, 101935, 839, 316, 360, 18, 1221, 33636, 621, 11001, 153939, 4734, 3917, 63284, 185190, 28032, 21635, 6619, 5809, 61924, 32354...	[ 0.112060546875, 0.228759765625, 0.03460693359375, 0.18798828125, 0.2218017578125, 0.1915283203125, 0.138916015625, 0.11083984375, 0.1923828125, 0.1148681640625, 0.1328125, 0.1473388671875, 0.1571044921875, 0.1781005859375, 0.00799560546875, 0.0816650390625, 0.034637451171875, 0.058...	embed
30022129_c1	30022129	haskell	1	statement in Haskell? The following code is supposed to take in the y variable, to set some variable x to a constant, and then to check if y is greater or lesser than 0 before doing a specific task if it is or isn't. This compiles. plus_or_double :: Double -> Double plus_or_double y = let { x = 2; } in case ( y>= 0 ) ...	statement in Haskell? The following code is supposed to take in the y variable, to set some variable x to a constant, and then to check if y is greater or lesser than 0 before doing a specific task if it is or isn't. This compiles. plus_or_double :: Double -> Double plus_or_double y = let { x = 2; } in case ( y>= 0 ) ...	[ -0.012451171875, -0.000431060791015625, -0.016845703125, -0.010009765625, 0.0294189453125, 0.01007080078125, 0.004119873046875, 0.002960205078125, 0.015869140625, 0.015380859375, 0.004364013671875, 0.00113677978515625, -0.0091552734375, -0.02294921875, 0.017822265625, 0.01141357421875,...	[ 63805, 23, 20625, 142508, 32, 25632, 18151, 134598, 5646, 113, 77336, 5423, 1022, 47, 53697, 12765, 2174, 83, 117396, 707, 199, 2189, 757, 8108, 29458, 66211, 56112, 18, 9969, 1340, 1001, 748, 21555, 2661, 107172, 2203, 2633, 116, 7225, 2...	[ 0.250244140625, 0.072265625, 0.17236328125, 0.281982421875, 0.0176849365234375, 0.08416748046875, 0.16650390625, 0.111572265625, 0.05712890625, 0.1461181640625, 0.1998291015625, 0.10003662109375, 0.07391357421875, 0.04730224609375, 0.144775390625, 0.1695556640625, 0.1611328125, 0.0...	embed
16346293_c1	16346293	haskell	1	result: undefined :: Container LotsOfStrings But if I ask for the Replicate d version, ghci> :t undefined :: Container (Replicate (Succ (Succ (Succ (Succ (Succ Zero))))) String) ghci substitutes in for the type family when it didn't do that for the type synonym: :: Container ((':) * [Char] ((':) * [Char] ((':) * [Char...	result: undefined :: Container LotsOfStrings But if I ask for the Replicate d version, ghci> :t undefined :: Container (Replicate (Succ (Succ (Succ (Succ (Succ Zero))))) String) ghci substitutes in for the type family when it didn't do that for the type synonym: :: Container ((':) * [Char] ((':) * [Char] ((':) * [Char...	[ -0.0125732421875, 0.001007080078125, -0.00927734375, 0.0306396484375, -0.025146484375, -0.00174713134765625, 0.01470947265625, 0.0020904541015625, 0.00335693359375, 0.024658203125, -0.0174560546875, -0.039794921875, 0.0045166015625, 0.0162353515625, -0.016845703125, -0.0093994140625, ...	[ 16750, 9232, 5983, 297, 1984, 34749, 20037, 50462, 132887, 71713, 5180, 26458, 853, 52721, 67, 104, 11389, 31380, 318, 18, 4332, 14168, 10060, 83947, 23351, 214, 161740, 23, 10644, 14449, 164661, 84068, 167089, 44084, 6226, 1830, 28864, 26073...	[ 0.078369140625, 0.0980224609375, 0.181884765625, 0.0494384765625, 0.063720703125, 0.196533203125, 0.2025146484375, 0.104736328125, 0.116943359375, 0.1329345703125, 0.0784912109375, 0.0078125, 0.02215576171875, 0.180419921875, 0.093994140625, 0.10546875, 0.11669921875, 0.12048339843...	embed
52795764_c0	52795764	haskell	0	Title: Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml Problem title: Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml Tags: haskell, haskell-stack Problem: Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml I am using...	Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml haskell haskell-stack Can stack.yaml Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml I am using stack.yaml files in co...	[ -0.0089111328125, -0.000850677490234375, 0.0120849609375, -0.01611328125, -0.002349853515625, -0.021484375, 0.00970458984375, -0.0118408203125, -0.000308990478515625, 0.0216064453125, -0.0086669921875, 0.01470947265625, -0.01318359375, -0.00421142578125, -0.0079345703125, 0.02026367187...	[ 4171, 171, 217, 707, 40140, 18929, 10863, 1176, 34292, 3768, 107, 86918, 42, 177261, 14520, 141, 1556, 142508, 590, 2594, 5, 102158, 58735, 4210, 58061, 22799, 11343, 124962, 15824, 68034, 13373, 306, 36510, 11435, 959, 107003 ]	[ 0.06707763671875, 0.1444091796875, 0.123291015625, 0.0295257568359375, 0.1773681640625, 0.03631591796875, 0.1632080078125, 0.2059326171875, 0.1502685546875, 0.0704345703125, 0.0748291015625, 0.1890869140625, 0.140380859375, 0.19970703125, 0.1707763671875, 0.1451416015625, 0.063781738...	embed
19761498_c0	19761498	haskell	0	Title: How do I constrain QuickCheck when using type synonyms? Problem title: How do I constrain QuickCheck when using type synonyms? Tags: haskell, quickcheck, types Problem: How do I constrain QuickCheck when using type synonyms? I am using QuickCheck to run arbitrary test cases on my code. However, in one portion of...	How do I constrain QuickCheck when using type synonyms? How do I constrain QuickCheck when using type synonyms? haskell quickcheck types type How QuickCheck Vector Double How do I constrain QuickCheck when using type synonyms? I am using QuickCheck to run arbitrary test cases on my code. However, in one portion of my c...	[ -0.0223388671875, 0.019287109375, -0.0159912109375, 0.00830078125, -0.001495361328125, -0.000194549560546875, -0.007080078125, -0.015380859375, -0.00433349609375, -0.0189208984375, -0.0189208984375, -0.01239013671875, 0.00244140625, 0.0003757476806640625, -0.01434326171875, -0.00341796...	[ 11249, 158, 2816, 73, 89038, 202567, 17368, 10644, 164661, 7, 1556, 142508, 63773, 78292, 52895, 2609, 18770, 107172, 61799, 3034, 50218, 18151, 126826, 10846, 32354, 26946, 14012, 107730, 64209, 91, 5701, 140909, 4734, 139392, 5303, 653 ]	[ 0.012298583984375, 0.06341552734375, 0.1407470703125, 0.08154296875, 0.119140625, 0.2578125, 0.013519287109375, 0.18994140625, 0.1796875, 0.0111083984375, 0.070556640625, 0.1583251953125, 0.0838623046875, 0.2117919921875, 0.162353515625, 0.1220703125, 0.1319580078125, 0.13232421875...	embed
76200909_c1	76200909	haskell	1	of ‘parseUnique’ from the context: Applicative f bound by the instance declaration at src/FormInput.hs:41:10-51 Possible fix: add (FromHttpApiData a) to the context of a type expected by the context: forall a. Const Text a -> Either Text (f a) Is it possible to fix that? I kinda feel it's not, mainly because the foral...	of ‘parseUnique’ from the context: Applicative f bound by the instance declaration at src/FormInput.hs:41:10-51 Possible fix: add (FromHttpApiData a) to the context of a type expected by the context: forall a. Const Text a -> Either Text (f a) Is it possible to fix that? I kinda feel it's not, mainly because the foral...	[ -0.01068115234375, 0.024658203125, 0.004425048828125, -0.01470947265625, 0.01416015625, 0.00469970703125, -0.00250244140625, -0.016845703125, 0.021240234375, -0.031494140625, -0.01263427734375, -0.0035400390625, 0.017822265625, 0.02685546875, -0.003814697265625, 0.0019989013671875, -...	[ 111, 2500, 184, 1062, 45602, 1295, 43701, 5659, 11048, 4935, 1238, 99091, 390, 110527, 21635, 19437, 102973, 4153, 7077, 5, 127, 31982, 15110, 11703, 115861, 30022, 15190, 168407, 3062, 254, 1434, 137989, 10, 47, 10644, 84751, 100, 5584, 16...	[ 0.0953369140625, 0.159912109375, 0.10546875, 0.1712646484375, 0.282958984375, 0.06964111328125, 0.2415771484375, 0.1429443359375, 0.1810302734375, 0.1429443359375, 0.1866455078125, 0.197021484375, 0.0200042724609375, 0.2060546875, 0.1728515625, 0.1036376953125, 0.1878662109375, 0.0...	embed
43813303_c0	43813303	haskell	0	Title: Looking for the name of a special map function Problem title: Looking for the name of a special map function Tags: haskell Problem: Looking for the name of a special map function I'm new to Haskell and looking for the name of a function (or generally, the name of the concept) that acts as such: The function take...	Looking for the name of a special map function Looking for the name of a special map function haskell Looking Looking for the name of a special map function I'm new to Haskell and looking for the name of a function (or generally, the name of the concept) that acts as such: The function takes two arguments: 1. A list of...	[ 0.0113525390625, 0.0045166015625, 0.01214599609375, -0.00933837890625, -0.015625, 0.0311279296875, 0.004669189453125, 0.0003795623779296875, 0.0087890625, 0.013427734375, -0.004608154296875, -0.0142822265625, -0.00543212890625, 0.0033416748046875, -0.0034637451171875, 0.00439453125, ...	[ 157268, 100, 9351, 111, 5361, 22288, 32354, 1556, 142508, 3525, 47, 20625, 16487, 137567, 23755, 27992, 237, 6044, 51776, 6626, 10750, 615, 5303, 80854, 618, 787, 10, 384, 30646, 83425, 345, 140992, 28960, 4263, 756, 23, 31384, 1062, 90825,...	[ 0.1180419921875, 0.095703125, 0.1607666015625, 0.010589599609375, 0.213134765625, 0.2454833984375, 0.27001953125, 0.1422119140625, 0.258544921875, 0.0928955078125, 0.06695556640625, 0.1363525390625, 0.10113525390625, 0.0625, 0.1824951171875, 0.099853515625, 0.0154266357421875, 0.06...	embed
4839615_c0	4839615	haskell	0	Title: Pattern matching of nested list in Haskell Problem title: Pattern matching of nested list in Haskell Tags: haskell Problem: Pattern matching of nested list in Haskell I want to use nested lists of nestedness 2 to represent matrix (e.g. [[1,2,3],[4,5,6]] ). How would I define a function that process small submatr...	Pattern matching of nested list in Haskell Pattern matching of nested list in Haskell haskell Pattern Haskell a1:a2:a b1:b2:b Pattern matching of nested list in Haskell I want to use nested lists of nestedness 2 to represent matrix (e.g. [[1,2,3],[4,5,6]] ). How would I define a function that process small submatrices ...	[ -0.02734375, 0.00787353515625, 0.0128173828125, 0.00439453125, 0.0108642578125, 0.025146484375, -0.0184326171875, 0.0098876953125, 0.0216064453125, 0.0145263671875, 0.02197265625, -0.01287841796875, 0.0181884765625, -0.005767822265625, -0.0191650390625, -0.0203857421875, 0.0213623046...	[ 9876, 22766, 14858, 214, 8512, 71, 5303, 20625, 142508, 111, 23, 1556, 10, 82825, 11, 304, 876, 275, 12, 3444, 4527, 7432, 116, 33636, 50944, 425, 133063, 96386, 617, 104629, 61924, 32354, 9433, 19336, 1614, 192, 19077, 1639, 10461, 84751...	[ 0.1864013671875, 0.14306640625, 0.23828125, 0.03753662109375, 0.262939453125, 0.12158203125, 0.196533203125, 0.157958984375, 0.2362060546875, 0.006561279296875, 0.0304718017578125, 0.150634765625, 0.0328369140625, 0.07373046875, 0.01025390625, 0.12158203125, 0.07354736328125, 0.066...	embed
8697394_c0	8697394	haskell	0	Title: Haskell line won't execute: do { n <- readLn ; print (n^2) } Problem title: Haskell line won't execute: do { n <- readLn ; print (n^2) } Tags: linux, haskell Problem: Haskell line won't execute: do { n <- readLn ; print (n^2) } I've been following a Learn Haskell in 10 Minutes tutorial. Everythin...	Haskell line won't execute: do { n <- readLn ; print (n^2) } Haskell line won't execute: do { n <- readLn ; print (n^2) } linux haskell Haskell Haskell line won't execute: do { n <- readLn ; print (n^2) } I've been following a Learn Haskell in 10 Minutes tutorial. Everything was going well until I reach...	[ -0.013916015625, 0.00823974609375, 0.0101318359375, 0.00341796875, 0.00482177734375, 0.021484375, 0.004608154296875, -0.004150390625, 0.005859375, -0.031982421875, -0.005279541015625, -0.031494140625, -0.01007080078125, -0.01385498046875, -0.007080078125, 0.002349853515625, -0.007476...	[ 20625, 142508, 13315, 23742, 3768, 18, 71924, 13, 54, 653, 1277, 12301, 866, 19, 28412, 8353, 10461, 11508, 6077, 1556, 10666, 4426, 9, 25632, 134031, 209, 136043, 57143, 23, 31380, 318, 53273, 23474, 18499, 109524, 20600, 5775, 31, 116890,...	[ 0.1558837890625, 0.274169921875, 0.15625, 0.1171875, 0.0802001953125, 0.1185302734375, 0.2188720703125, 0.0782470703125, 0.0869140625, 0.10430908203125, 0.0161895751953125, 0.2056884765625, 0.1136474609375, 0.129150390625, 0.180419921875, 0.0648193359375, 0.1666259765625, 0.0322265...	embed
9243915_c0	9243915	haskell	0	Title: Function gets four arguments instead of three - why doesn't this break? Problem title: Function gets four arguments instead of three - why doesn't this break? Tags: haskell Problem: Function gets four arguments instead of three - why doesn't this break? Reading "Real World Haskell", on page 95 the auth...	Function gets four arguments instead of three - why doesn't this break? Function gets four arguments instead of three - why doesn't this break? haskell Function gets four arguments instead of three - why doesn't this break? Reading "Real World Haskell", on page 95 the author provides an example: My question i...	[ -0.0081787109375, 0.001068115234375, -0.005340576171875, -0.012451171875, -0.0003948211669921875, 0.0179443359375, -0.00982666015625, 0.005859375, 0.01220703125, -0.035400390625, 0.0027008056640625, -0.003448486328125, -0.006988525390625, 0.0032196044921875, 0.01287841796875, -0.006134...	[ 28670, 10763, 62163, 22759, 10750, 7, 64457, 17262, 15400, 22027, 3768, 18, 903, 36356, 1556, 142508, 104951, 68996, 6661, 20625, 9199, 27781, 44084, 18151, 9969, 1340, 18344, 7569, 51776, 4734, 3688, 115081, 29954, 3447, 1022, 97, 4488, 1055...	[ 0.172119140625, 0.143798828125, 0.072265625, 0.2274169921875, 0.252197265625, 0.108154296875, 0.1151123046875, 0.15185546875, 0.1287841796875, 0.110595703125, 0.043670654296875, 0.119384765625, 0.06878662109375, 0.2000732421875, 0.12451171875, 0.23291015625, 0.000244140625, 0.08624...	embed
7024248_c0	7024248	haskell	0	Title: Monads at the prompt? Problem title: Monads at the prompt? Tags: haskell, ghci Problem: Monads at the prompt? Is it possible to interact with arbitrary Monad instances incrementally at the GHCi prompt? You can enter "do" commands interactively: Prelude> x <- return 5 But as far as I can tell, everything is force...	Monads at the prompt? Monads at the prompt? haskell ghci Monads Prelude Monads at the prompt? Is it possible to interact with arbitrary Monad instances incrementally at the GHCi prompt? You can enter "do" commands interactively: But as far as I can tell, everything is forced into the IO () Monad. What if I want to inte...	[ -0.01226806640625, 0.012451171875, 0.01446533203125, 0.015869140625, -0.0108642578125, 0.0126953125, 0.001556396484375, -0.000009417533874511719, -0.0179443359375, -0.039794921875, -0.007598876953125, -0.0272216796875, -0.0135498046875, -0.0045166015625, 0.0031890869140625, 0.002334594...	[ 60331, 6468, 99, 70, 105876, 1556, 142508, 31380, 318, 1914, 822, 2071, 7722, 78974, 678, 61799, 1294, 71, 110527, 145322, 12097, 527, 73265, 14, 831, 30957, 246, 75101, 212398, 26818, 168861, 3934, 17780, 3444, 64457, 33022, 64194, 944, 46...	[ 0.227294921875, 0.18310546875, 0.0845947265625, 0.008087158203125, 0.24267578125, 0.07928466796875, 0.2247314453125, 0.08489990234375, 0.13427734375, 0.010223388671875, 0.1134033203125, 0.01971435546875, 0.1026611328125, 0.1898193359375, 0.0904541015625, 0.1209716796875, 0.0076599121...	embed
56717648_c0	56717648	haskell	0	Title: Haskell gets confused with horizontal lines Problem title: Haskell gets confused with horizontal lines Tags: function, guard-clause, haskell, syntax, definition Problem: Haskell gets confused with horizontal lines I tried to practice haskell a bit but I didn't get the following code to work: rems :: Int -> [Int]...	Haskell gets confused with horizontal lines Haskell gets confused with horizontal lines function guard-clause haskell syntax definition Haskell x:xs Haskell gets confused with horizontal lines I tried to practice haskell a bit but I didn't get the following code to work: This function removes every k from a list x if y...	[ -0.010498046875, 0.020751953125, 0.01239013671875, -0.021484375, -0.0126953125, 0.005401611328125, -0.004364013671875, 0.013427734375, 0.021728515625, 0.009765625, 0.01434326171875, -0.017822265625, 0.0118408203125, 0.017578125, 0.0037078857421875, 0.00023937225341796875, 0.020019531...	[ 20625, 142508, 62163, 55681, 5281, 678, 124001, 124519, 32354, 56050, 18347, 4032, 1556, 6002, 86531, 80934, 1022, 12, 425, 41361, 4785, 25632, 18151, 4488, 87388, 11907, 472, 1295, 5303, 11782, 14194, 7, 3714, 20697, 152363, 36497, 2424, 217...	[ 0.131591796875, 0.24267578125, 0.05999755859375, 0.1722412109375, 0.1153564453125, 0.081298828125, 0.20751953125, 0.16015625, 0.16943359375, 0.23291015625, 0.10198974609375, 0.106689453125, 0.1324462890625, 0.036041259765625, 0.1055908203125, 0.08551025390625, 0.1373291015625, 0.03...	embed
11874601_c0	11874601	haskell	0	Title: How to use HUnit and Cabal to do Automated Testing? Problem title: How to use HUnit and Cabal to do Automated Testing? Tags: unit-testing, hunit, cabal, haskell Problem: How to use HUnit and Cabal to do Automated Testing? I've been fighting with Cabal for a good portion of a day trying to make its automated test...	How to use HUnit and Cabal to do Automated Testing? How to use HUnit and Cabal to do Automated Testing? unit-testing hunit cabal haskell How HUnit Cabal Automated Testing exitcode-stdio-1.0 How to use HUnit and Cabal to do Automated Testing? I've been fighting with Cabal for a good portion of a day trying to make its a...	[ 0.0108642578125, 0.0167236328125, 0.012451171875, -0.00087738037109375, -0.0133056640625, -0.002471923828125, 0.006317138671875, 0.004852294921875, -0.006805419921875, 0.01141357421875, -0.00775146484375, -0.0224609375, -0.00909423828125, 0.00872802734375, -0.0107421875, -0.00540161132...	[ 11249, 4527, 22438, 6773, 136, 30438, 289, 54, 51719, 297, 8647, 214, 47, 25072, 6954, 1926, 217, 109524, 1556, 142508, 82230, 40899, 271, 5670, 102107, 181952, 678, 11408, 134234, 66139, 4488, 209806, 14168, 40059, 45367, 98169, 4734, 9, 1...	[ 0.081787109375, 0.1380615234375, 0.1717529296875, 0.2568359375, 0.1405029296875, 0.2208251953125, 0.2147216796875, 0.04132080078125, 0.225341796875, 0.1048583984375, 0.228271484375, 0.1212158203125, 0.01141357421875, 0.1556396484375, 0.2049560546875, 0.1617431640625, 0.1827392578125,...	embed
13497796_c0	13497796	haskell	0	Title: Can this code be written without explicit recursion? [Project Euler #31 spoiler] Problem title: Can this code be written without explicit recursion? [Project Euler #31 spoiler] Tags: haskell Problem: Can this code be written without explicit recursion? [Project Euler #31 spoiler] This function is at the heart of...	Can this code be written without explicit recursion? [Project Euler #31 spoiler] Can this code be written without explicit recursion? [Project Euler #31 spoiler] haskell Can Project Euler d:ds Can this code be written without explicit recursion? [Project Euler #31 spoiler] This function is at the heart of a solution to...	[ -0.032958984375, 0.006561279296875, 0.015625, 0.001922607421875, -0.007598876953125, 0.000606536865234375, -0.00567626953125, -0.011474609375, 0.02197265625, -0.041748046875, -0.008544921875, -0.006988525390625, 0.01495361328125, 0.028564453125, 0.00494384765625, -0.002716064453125, ...	[ 4171, 903, 18151, 59121, 15490, 143726, 195625, 1830, 223353, 5177, 603, 5016, 180281, 1556, 142508, 27331, 104, 12, 6468, 3293, 32354, 99, 26498, 29806, 2967, 3444, 18822, 831, 456, 5429, 75639, 15824, 83, 1379, 22288, 40536, 266, 297, 798...	[ 0.0894775390625, 0.042083740234375, 0.171142578125, 0.1107177734375, 0.1123046875, 0.17138671875, 0.2105712890625, 0.0928955078125, 0.0609130859375, 0.1214599609375, 0.166015625, 0.110107421875, 0.1092529296875, 0.1370849609375, 0.246337890625, 0.1314697265625, 0.07525634765625, 0....	embed
34031039_c0	34031039	haskell	0	Title: How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? Problem title: How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? Tags: ghc, haskell, epoll Problem: How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? There is a ...	How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? ghc haskell epoll How GHC Haskell How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? There is a lot of old information ...	[ 0.01324462890625, 0.00823974609375, 0.0164794921875, 0.000720977783203125, -0.0042724609375, 0.00823974609375, -0.0224609375, 0.000579833984375, -0.0205078125, -0.043212890625, -0.0002346038818359375, -0.0281982421875, 0.0263671875, 0.003448486328125, 0.0047607421875, -0.00872802734375...	[ 11249, 47, 4527, 28, 5877, 141, 64, 92, 944, 13388, 225081, 11389, 527, 73265, 6495, 7, 142508, 33120, 94878, 100, 31380, 238, 1556, 20625, 4677, 18151, 60552, 22687, 34356, 9969, 1340, 62822, 27781, 3642, 60213, 5744, 45367, 17854, 10723, ...	[ 0.0751953125, 0.023956298828125, 0.115966796875, 0.04217529296875, 0.1829833984375, 0.1348876953125, 0.05596923828125, 0.0849609375, 0.112548828125, 0.181640625, 0.1434326171875, 0.096435546875, 0.09326171875, 0.2000732421875, 0.113037109375, 0.0819091796875, 0.23974609375, 0.10705...	embed
34032976_c0	34032976	haskell	0	Title: Syntax error in Haskell Problem title: Syntax error in Haskell Tags: haskell, syntax Problem: Syntax error in Haskell I got an error when compiling a Haskell script. Please help: main = do let bmiTell weight height \| weight / height ^ 2 <= 18.5 = "You're underweight, you emo, you!" \| weight / height ^ 2 <= 25.0 ...	Syntax error in Haskell Syntax error in Haskell haskell syntax Syntax Haskell You Pffft Lose Syntax error in Haskell I got an error when compiling a Haskell script. Please help:	[ -0.009521484375, 0.01806640625, -0.0191650390625, 0.01214599609375, 0.01123046875, 0.0247802734375, -0.0125732421875, -0.00157928466796875, 0.005340576171875, 0.010986328125, -0.0028228759765625, -0.0206298828125, -0.0145263671875, -0.00921630859375, 0.03173828125, -0.01165771484375, ...	[ 19010, 86531, 18499, 23, 20625, 142508, 1556, 6002, 2583, 87360, 125927, 3731, 13, 4163, 142, 9969, 49725, 26499, 30607, 4358 ]	[ 0.180908203125, 0.2296142578125, 0.199951171875, 0.05816650390625, 0.1455078125, 0.255126953125, 0.13525390625, 0.11224365234375, 0.095458984375, 0.078857421875, 0.2001953125, 0.1666259765625, 0.06292724609375, 0.044342041015625, 0.0008630752563476562, 0.09002685546875, 0.07556152343...	embed
40302439_c0	40302439	haskell	0	Title: Parsec optionMaybe always consuming input Problem title: Parsec optionMaybe always consuming input Tags: haskell, parsec Problem: Parsec optionMaybe always consuming input I'm trying to debug why despite combining optionMaybe with try , parsec is consuming the input. Basically in the below code, why is the secon...	Parsec optionMaybe always consuming input Parsec optionMaybe always consuming input haskell parsec Parsec Right many1 Left Parsec optionMaybe always consuming input I'm trying to debug why despite combining optionMaybe with try , parsec is consuming the input. Basically in the below code, why is the second run not retu...	[ -0.0036773681640625, 0.01220703125, 0.005035400390625, 0.0186767578125, -0.003570556640625, 0.0247802734375, 0.004608154296875, -0.01324462890625, 0.00151824951171875, -0.0181884765625, 0.00653076171875, 0.0184326171875, 0.01177978515625, -0.0103759765625, -0.00244140625, 0.01086425781...	[ 2392, 39797, 35829, 82419, 372, 11343, 18588, 214, 107730, 1556, 142508, 366, 90911, 5941, 418, 2480, 8, 85779, 15400, 964, 9790, 83, 35064, 18151, 17932, 11675, 959, 30646, 2055, 238, 41206 ]	[ 0.1239013671875, 0.251220703125, 0.2379150390625, 0.0989990234375, 0.1165771484375, 0.1435546875, 0.1942138671875, 0.101318359375, 0.1973876953125, 0.11865234375, 0.2060546875, 0.1346435546875, 0.153076171875, 0.1378173828125, 0.012359619140625, 0.08013916015625, 0.014007568359375, ...	embed
28182292_c0	28182292	haskell	0	Title: Cabal fetch dependencies for current package Problem title: Cabal fetch dependencies for current package Tags: haskell, cabal Problem: Cabal fetch dependencies for current package I wrote a package that I am trying to build. For reasons, I do not want to install it on my laptop. I want to download all of its dep...	Cabal fetch dependencies for current package Cabal fetch dependencies for current package haskell cabal Cabal my-package.cabal Cabal fetch dependencies for current package I wrote a package that I am trying to build. For reasons, I do not want to install it on my laptop. I want to download all of its dependencies and i...	[ 0.01177978515625, 0.0024261474609375, 0.0311279296875, 0.008544921875, -0.0089111328125, 0.011962890625, -0.0072021484375, 0.019775390625, 0.0037384033203125, -0.00457763671875, 0.003448486328125, -0.017822265625, -0.01275634765625, 0.0203857421875, -0.00494384765625, 0.003448486328125...	[ 30438, 289, 7647, 206, 42548, 117538, 100, 43581, 98169, 1556, 142508, 109524, 759, 29102, 4588, 408, 3571, 54397, 31577, 45367, 54, 959, 3444, 20600, 98, 26367, 47, 7026, 756, 15700, 13909, 11249, 831, 11675, 110, 50336, 12301, 11435, 442,...	[ 0.2286376953125, 0.1815185546875, 0.2113037109375, 0.0853271484375, 0.259033203125, 0.173583984375, 0.10418701171875, 0.212890625, 0.2314453125, 0.1287841796875, 0.212890625, 0.279052734375, 0.135009765625, 0.2049560546875, 0.158203125, 0.168212890625, 0.2186279296875, 0.0928955078...	embed
4461684_c0	4461684	haskell	0	Title: Confusion over IORefs to make a counter Problem title: Confusion over IORefs to make a counter Tags: unsafe-perform-io, monads, ioref, haskell Problem: Confusion over IORefs to make a counter I found some sample code, and changed it a little counter = unsafePerform $ newIORef 0 newNode _ = unsafePerformIO $ do i...	Confusion over IORefs to make a counter Confusion over IORefs to make a counter unsafe-perform-io monads ioref haskell Confusion IORefs Confusion over IORefs to make a counter I found some sample code, and changed it a little Which returns 1 then 2 then 3 then 3 etc each time it's run. But when I change it to then I ge...	[ -0.003997802734375, 0.00616455078125, 0.00104522705078125, 0.0174560546875, -0.006011962890625, 0.0031280517578125, 0.004913330078125, 0.0024566650390625, 0.00982666015625, -0.037841796875, 0.00689697265625, -0.0191650390625, 0.032470703125, 0.0166015625, 0.017822265625, -0.01867675781...	[ 1657, 92105, 645, 123435, 4240, 7, 47, 3249, 105416, 10, 51, 115840, 5037, 846, 2667, 712, 22995, 29087, 1556, 142508, 14037, 121413, 18151, 98816, 10176, 30646, 106, 7068, 116, 138, 12638, 1733, 11675, 15549, 442, 2046, 757, 11907, 44084, ...	[ 0.011688232421875, 0.1844482421875, 0.067138671875, 0.1771240234375, 0.2115478515625, 0.1116943359375, 0.04327392578125, 0.0977783203125, 0.259521484375, 0.00372314453125, 0.031341552734375, 0.1934814453125, 0.1781005859375, 0.2080078125, 0.07403564453125, 0.1099853515625, 0.18151855...	embed
47623458_c0	47623458	haskell	0	Title: Haskell Error on program Problem title: Haskell Error on program Tags: haskell Problem: Haskell Error on program just working on a problem and it keeps giving me this error: Exception: Prelude.tail: empty list Here is my code so far: lxP :: Eq a => [[a]] -> [a] lxP [] = [] lxP xss \| any null xss = [] \| otherwise...	Haskell Error on program Haskell Error on program haskell Haskell Error Haskell Error on program just working on a problem and it keeps giving me this error: Exception: Prelude.tail: empty list Here is my code so far: Any idea if my indentation is the problem or is it something with the code? PS. How could I improve th...	[ 0.0157470703125, 0.0155029296875, 0.0038909912109375, 0.01275634765625, -0.01434326171875, 0.0224609375, 0.00787353515625, -0.003875732421875, 0.00933837890625, -0.019287109375, 0.040771484375, -0.00188446044921875, -0.0026702880859375, -0.007080078125, 0.004241943359375, 0.005859375, ...	[ 20625, 142508, 212059, 98, 1528, 1556, 20697, 2967, 13695, 163, 903, 18499, 5443, 63928, 1914, 822, 112, 46741, 201505, 5303, 11853, 18151, 2060, 6528, 18597, 22062, 70, 52295, 227066 ]	[ 0.1585693359375, 0.240234375, 0.1795654296875, 0.1275634765625, 0.1964111328125, 0.14990234375, 0.10308837890625, 0.1014404296875, 0.0655517578125, 0.007110595703125, 0.033294677734375, 0.1644287109375, 0.001678466796875, 0.111572265625, 0.0953369140625, 0.180419921875, 0.14538574218...	embed
30083099_c0	30083099	haskell	0	Title: Filter letters from string replacing symbols for blanks spaces and letters lowercase Problem title: Filter letters from string replacing symbols for blanks spaces and letters lowercase Tags: filter, haskell, words, letter Problem: Filter letters from string replacing symbols for blanks spaces and letters lowerca...	Filter letters from string replacing symbols for blanks spaces and letters lowercase Filter letters from string replacing symbols for blanks spaces and letters lowercase filter haskell words letter string Filter Paul Come There Filter letters from string replacing symbols for blanks spaces and letters lowercase Example...	[ -0.01043701171875, -0.0064697265625, -0.021240234375, 0.004669189453125, 0.00469970703125, 0.01611328125, 0.0233154296875, -0.000728607177734375, 0.0014190673828125, 0.01055908203125, -0.00408935546875, 0.002288818359375, 0.008544921875, 0.013671875, -0.00958251953125, 0.0260009765625,...	[ 128896, 120820, 1295, 79315, 456, 133266, 26582, 100, 44237, 7, 32628, 92319, 58437, 46312, 1556, 142508, 34153, 31330, 10208, 10592, 8622, 136, 89536, 115043, 25, 38, 20779, 79858, 7077, 763, 202, 91, 1380, 2685, 11249, 831, 3934, 441, 699...	[ 0.23779296875, 0.228759765625, 0.114013671875, 0.2425537109375, 0.0283966064453125, 0.11767578125, 0.2177734375, 0.017730712890625, 0.2239990234375, 0.099853515625, 0.185302734375, 0.2379150390625, 0.1546630859375, 0.25439453125, 0.1319580078125, 0.235595703125, 0.1182861328125, 0....	embed
32600304_c0	32600304	haskell	0	Title: Compiler rejects type signature of data constructor Problem title: Compiler rejects type signature of data constructor Tags: haskell Problem: Compiler rejects type signature of data constructor I am learning haskell. When I compile the code: data Bintree a = Nulltree \| Node (Bintree a) a (Bintree a) Nulltree :: ...	Compiler rejects type signature of data constructor Compiler rejects type signature of data constructor haskell Compiler Bintree Nulltree Node Invalid Should Compiler rejects type signature of data constructor I am learning haskell. When I compile the code: I get the following error: So how do I prevent this. I tried w...	[ 0.00958251953125, 0.01080322265625, -0.005767822265625, 0.0174560546875, 0.00750732421875, -0.000579833984375, -0.01275634765625, 0.003631591796875, -0.008544921875, -0.000637054443359375, -0.013916015625, -0.044677734375, 0.007354736328125, -0.003814697265625, -0.0024871826171875, -0....	[ 15612, 34759, 456, 75161, 10644, 138256, 2053, 64549, 748, 1556, 142508, 16666, 62600, 1429, 1181, 438, 112, 7013, 151117, 111, 52080, 9969, 1340, 70, 18151, 2046, 25632, 18499, 3642, 56282, 903, 32562, 5701 ]	[ 0.1343994140625, 0.2012939453125, 0.0955810546875, 0.2269287109375, 0.2080078125, 0.2369384765625, 0.105224609375, 0.156982421875, 0.0946044921875, 0.12060546875, 0.207763671875, 0.1187744140625, 0.2335205078125, 0.1302490234375, 0.062255859375, 0.1280517578125, 0.093505859375, 0.1...	embed
58379070_c0	58379070	haskell	0	Title: Haskell - variable not in scope error - beginner Problem title: Haskell - variable not in scope error - beginner Tags: new-operator, haskell Problem: Haskell - variable not in scope error - beginner I'm new to haskell and cannot work out what is wrong with my code. I keep getting a variable out of scope error. H...	Haskell - variable not in scope error - beginner Haskell - variable not in scope error - beginner new-operator haskell Haskell Bool Main Variable Haskell - variable not in scope error - beginner I'm new to haskell and cannot work out what is wrong with my code. I keep getting a variable out of scope error. Here is my c...	[ 0.0028076171875, 0.01806640625, 0.003997802734375, 0.029296875, 0.0185546875, 0.011962890625, -0.0018310546875, 0.027587890625, 0.0205078125, 0.0022125244140625, -0.00848388671875, -0.033203125, 0.0133056640625, 0.006927490234375, 0.01556396484375, 0.0023345947265625, -0.007415771484...	[ 20625, 142508, 77336, 959, 23, 70820, 18499, 9842, 1679, 3525, 206469, 1556, 2460, 929, 12321, 84572, 2886, 53418, 4488, 1810, 44691, 18151, 13695, 111, 72367, 527, 73265, 14, 63033, 10644, 35604, 5267, 449, 927, 10, 11, 30646, 98320 ]	[ 0.1533203125, 0.254638671875, 0.289794921875, 0.1932373046875, 0.168701171875, 0.23583984375, 0.186767578125, 0.08062744140625, 0.095458984375, 0.0645751953125, 0.11181640625, 0.1279296875, 0.04931640625, 0.158203125, 0.0950927734375, 0.205078125, 0.111328125, 0.021270751953125, ...	embed
36266309_c0	36266309	haskell	0	Title: sublime text 3 & haskell : change compilation directory Problem title: sublime text 3 & haskell : change compilation directory Tags: sublimetext, sublimetext3, haskell Problem: sublime text 3 & haskell : change compilation directory I use sublime text 3 on linux mint 17.3, with the haskell plugin. I open...	sublime text 3 & haskell : change compilation directory sublime text 3 & haskell : change compilation directory sublimetext sublimetext3 haskell sublimetext3 sublime text 3 & haskell : change compilation directory I use sublime text 3 on linux mint 17.3, with the haskell plugin. I opened a directory containing ...	[ 0.000518798828125, -0.00634765625, 0.002471923828125, 0.00005602836608886719, -0.0027008056640625, 0.01483154296875, -0.005767822265625, 0.0230712890625, 0.00238037109375, 0.0125732421875, -0.0400390625, 0.0076904296875, 0.005889892578125, 0.01263427734375, 0.01251220703125, 0.00872802...	[ 117584, 13, 7986, 138, 25133, 1556, 142508, 15549, 98352, 1363, 14364, 22829, 363, 619, 4527, 11508, 6077, 4090, 7076, 69993, 142096, 70541, 11435, 127, 27211, 5962, 71885, 30121, 1328, 571, 83184, 11675, 26785, 2301, 18, 1957, 23035, 10484, ...	[ 0.199951171875, 0.1571044921875, 0.20458984375, 0.18310546875, 0.0278472900390625, 0.134033203125, 0.2330322265625, 0.142822265625, 0.1575927734375, 0.027252197265625, 0.1199951171875, 0.159912109375, 0.1278076171875, 0.00390625, 0.038299560546875, 0.07843017578125, 0.045074462890625...	embed
40393093_c0	40393093	haskell	0	Title: what does forward slash mean in haskell? Problem title: what does forward slash mean in haskell? Tags: syntax, infix-operator, haskell Problem: what does forward slash mean in haskell? I am learning Haskell, studying for a midterm. there is a test quiz I'm looking at at the moment with questions on type inferenc...	what does forward slash mean in haskell? what does forward slash mean in haskell? syntax infix-operator haskell what does forward slash mean in haskell? I am learning Haskell, studying for a midterm. there is a test quiz I'm looking at at the moment with questions on type inference. some of the questions contain forwar...	[ 0.027099609375, 0.01708984375, -0.0059814453125, -0.00347900390625, -0.01171875, 0.0037841796875, 0.00555419921875, 0.012451171875, -0.01019287109375, -0.01220703125, 0.0086669921875, -0.0185546875, 0.01470947265625, -0.0123291015625, -0.01806640625, 0.007415771484375, -0.00720214843...	[ 2367, 40225, 91, 5544, 29459, 23, 1556, 142508, 6002, 86531, 55923, 206469, 52080, 20625, 32166, 3034, 81758, 3095, 17582, 10644, 53498, 14865, 114942, 6528, 33636, 69236, 83324, 32354, 77336, 27781, 7413, 26484, 110, 84434 ]	[ 0.0221099853515625, 0.263671875, 0.06158447265625, 0.2252197265625, 0.1116943359375, 0.05328369140625, 0.1280517578125, 0.199951171875, 0.00408935546875, 0.06011962890625, 0.1768798828125, 0.134033203125, 0.001373291015625, 0.06781005859375, 0.0240020751953125, 0.03717041015625, 0.08...	embed
29295823_c0	29295823	haskell	0	Title: Implementation of Foldable in Haskell Problem title: Implementation of Foldable in Haskell Tags: tree-traversal, haskell Problem: Implementation of Foldable in Haskell For example, I have some data type. Let it be a binary tree: data Tree a = Leaf a \| Branch (Tree a) (Tree a) For example, I implemented traversal...	Implementation of Foldable in Haskell Implementation of Foldable in Haskell tree-traversal haskell Implementation Foldable Haskell Tree Leaf Branch foldt1 Implementation of Foldable in Haskell For example, I have some data type. Let it be a binary tree: For example, I implemented traversal of the tree: It works pretty ...	[ 0.0272216796875, 0.0036163330078125, -0.003570556640625, -0.006744384765625, 0.0181884765625, 0.0037994384765625, -0.033447265625, -0.00994873046875, -0.0106201171875, -0.0595703125, -0.0169677734375, -0.0281982421875, -0.00982666015625, 0.015625, 0.013427734375, 0.0048828125, -0.006...	[ 153941, 30077, 71, 2886, 23, 20625, 142508, 111, 53201, 1517, 814, 2317, 1556, 101344, 636, 2407, 21110, 42822, 18, 418, 2053, 10644, 2394, 6635, 29479, 37317, 289, 43240, 28875, 4127, 3444, 101758, 5351, 33022, 1884, 450, 4966, 14602, 959,...	[ 0.1834716796875, 0.2047119140625, 0.14013671875, 0.24658203125, 0.0223388671875, 0.1436767578125, 0.246337890625, 0.051788330078125, 0.1766357421875, 0.052581787109375, 0.1365966796875, 0.103515625, 0.1204833984375, 0.1343994140625, 0.006622314453125, 0.091796875, 0.061065673828125, ...	embed
20447427_c0	20447427	haskell	0	Title: how to write more concise lambda function of sortBy, unionBy, etc Problem title: how to write more concise lambda function of sortBy, unionBy, etc Tags: lambda, haskell, sorting, list Problem: how to write more concise lambda function of sortBy, unionBy, etc Functions like sortBy and unionBy take a lambda functi...	how to write more concise lambda function of sortBy, unionBy, etc how to write more concise lambda function of sortBy, unionBy, etc lambda haskell sorting list how to write more concise lambda function of sortBy, unionBy, etc Functions like sortBy and unionBy take a lambda function as argument. The lambda function ofte...	[ -0.0025177001953125, 0.0155029296875, 0.007476806640625, -0.0196533203125, -0.003387451171875, -0.0223388671875, 0.01123046875, -0.006072998046875, 0.005126953125, -0.0166015625, 0.0042724609375, 0.0186767578125, 0.03466796875, -0.006256103515625, -0.012939453125, -0.0142822265625, -...	[ 3642, 33022, 1286, 158, 318, 184, 21, 6492, 85, 32354, 12096, 75358, 69941, 1556, 142508, 214, 5303, 111, 28670, 1884, 136, 5646, 237, 10750, 27983, 14602, 69101, 864, 7103, 35971, 12830, 149016, 6, 41872, 113, 271, 1022, 831, 59121, 1079...	[ 0.04345703125, 0.1578369140625, 0.1373291015625, 0.079345703125, 0.1845703125, 0.1217041015625, 0.0474853515625, 0.1922607421875, 0.154052734375, 0.1739501953125, 0.1834716796875, 0.210693359375, 0.149658203125, 0.09228515625, 0.1787109375, 0.0172271728515625, 0.1231689453125, 0.00...	embed
23095224_c0	23095224	haskell	0	Title: S combinator in Haskell Problem title: S combinator in Haskell Tags: haskell, combinators, s-combinator Problem: S combinator in Haskell Can an analog of the S combinator be expressed in Haskell using only standard functions (without defining it by equation) and without using lambda (anonymous function)? I expec...	S combinator in Haskell S combinator in Haskell haskell combinators s-combinator Haskell S combinator in Haskell Can an analog of the S combinator be expressed in Haskell using only standard functions (without defining it by equation) and without using lambda (anonymous function)? I expect it to by of type (a -> b -> c...	[ -0.0062255859375, 0.00897216796875, 0.0242919921875, -0.016357421875, 0.0172119140625, 0.0017242431640625, -0.01055908203125, -0.01068115234375, -0.003570556640625, -0.02294921875, -0.00048828125, 0.0166015625, -0.00201416015625, 0.000522613525390625, 0.004119873046875, 0.0032653808593...	[ 159, 22321, 1290, 20625, 142508, 23, 1556, 22230, 91, 277, 19155, 4171, 60223, 36510, 297, 17368, 4734, 5570, 32354, 6056, 13204, 390, 5490, 15490, 6492, 85, 45757, 41206, 10644, 876, 501, 33079, 341, 1660, 158, 271, 31577, 420, 1022, 123...	[ 0.1942138671875, 0.2449951171875, 0.1502685546875, 0.1385498046875, 0.2474365234375, 0.0487060546875, 0.1201171875, 0.046417236328125, 0.1729736328125, 0.07415771484375, 0.2086181640625, 0.0562744140625, 0.23779296875, 0.1390380859375, 0.008575439453125, 0.047454833984375, 0.01629638...	embed
40810422_c0	40810422	haskell	0	Title: simpleHttp causing 'unsupported browser response?' Problem title: simpleHttp causing 'unsupported browser response?' Tags: http, haskell Problem: simpleHttp causing 'unsupported browser response?' I'm executing a simpleHttp request to a https domain, yet the response html is showing 'unsuppor...	simpleHttp causing 'unsupported browser response?' simpleHttp causing 'unsupported browser response?' http haskell Network.HTTP.Simple LAZ.ByteString www.example.com simpleHttp causing 'unsupported browser response?' I'm executing a simpleHttp request to a https domain, yet the response html is show...	[ -0.004669189453125, 0.01220703125, 0.00421142578125, 0.004730224609375, 0.00360107421875, 0.01116943359375, -0.00970458984375, -0.0164794921875, -0.0057373046875, 0.004730224609375, 0.019775390625, -0.041748046875, 0.01458740234375, -0.0022735595703125, -0.019287109375, 0.0117797851562...	[ 8781, 841, 3062, 254, 216806, 3768, 309, 105363, 31842, 57553, 1621, 1556, 142508, 28997, 18544, 23658, 8859, 33209, 17200, 75358, 67, 71713, 11, 71924, 50336, 3975, 77758, 14373, 7693, 141377, 89914, 18822, 959, 8060, 135913, 294, 32354, 357...	[ 0.1990966796875, 0.0791015625, 0.134521484375, 0.1439208984375, 0.1361083984375, 0.03375244140625, 0.0672607421875, 0.1932373046875, 0.17578125, 0.1651611328125, 0.14794921875, 0.08251953125, 0.1776123046875, 0.0177154541015625, 0.0303497314453125, 0.127685546875, 0.04388427734375, ...	embed
27120074_c2	27120074	haskell	2	, Spent, Left, Compiling, Distribution.PackageDescription.Utils, Distribution, PackageDescription, Utils.hs, Utils.o, Distribution.Simple.CCompiler, Simple, CCompiler.hs, CCompiler.o, Distribution.Compat.CreatePipe, Compat, CreatePipe.hs, CreatePipe.o, Distribution.Compat.Environment, Environment.hs, Environment.o, Exc...	, Spent, Left, Compiling, Distribution.PackageDescription.Utils, Distribution, PackageDescription, Utils.hs, Utils.o, Distribution.Simple.CCompiler, Simple, CCompiler.hs, CCompiler.o, Distribution.Compat.CreatePipe, Compat, CreatePipe.hs, CreatePipe.o, Distribution.Compat.Environment, Environment.hs, Environment.o, Exc...	[ -0.00075531005859375, 0.0034332275390625, -0.00011491775512695312, -0.006744384765625, 0.004119873046875, -0.00095367431640625, -0.0211181640625, -0.003143310546875, 0.0027008056640625, 0.0142822265625, 0.006744384765625, -0.0196533203125, 0.0040283203125, 0.005615234375, 0.0032196044921...	[ 4, 159, 91319, 636, 2480, 15612, 49725, 75571, 1363, 5, 205956, 4588, 4657, 59478, 106742, 7870, 56607, 3994, 127, 31, 8859, 33209, 441, 108161, 34759, 60552, 313, 257, 63784, 683, 48672, 151313, 686, 1900, 5443, 63928, 159065, 174350, 3744...	[ 0.10699462890625, 0.1407470703125, 0.271240234375, 0.1168212890625, 0.21533203125, 0.1923828125, 0.2122802734375, 0.274169921875, 0.120361328125, 0.0225677490234375, 0.2003173828125, 0.0777587890625, 0.1395263671875, 0.2100830078125, 0.1810302734375, 0.177734375, 0.2088623046875, 0...	embed
19415621_c0	19415621	haskell	0	Title: parsing for PHOAS expressions Problem title: parsing for PHOAS expressions Tags: haskell Problem: parsing for PHOAS expressions I think I understand PHOAS (parametric higher-order abstract syntax), and I see how we can pretty-print an expression (cf. http://www.reddit.com/r/haskell/comments/1mo59h/phoas_for_free...	parsing for PHOAS expressions parsing for PHOAS expressions haskell PHOAS parsing for PHOAS expressions I think I understand PHOAS (parametric higher-order abstract syntax), and I see how we can pretty-print an expression (cf. http://www.reddit.com/r/haskell/comments/1mo59h/phoas_for_free_by_edward_kmett/ccbxzoo ). But...	[ -0.00093841552734375, 0.00150299072265625, -0.00958251953125, 0.006378173828125, 0.006072998046875, 0.01708984375, 0.002197265625, -0.0113525390625, 0.0111083984375, -0.0230712890625, -0.00860595703125, -0.0225830078125, 0.0018463134765625, -0.008544921875, 0.00225830078125, 0.01074218...	[ 366, 6953, 100, 436, 17933, 9713, 125195, 1556, 142508, 5351, 28219, 6276, 186518, 77546, 80596, 164789, 6002, 86531, 1957, 831, 28875, 35662, 10557, 22014, 162, 2472, 32087, 19364, 4204, 1158, 45367, 2189, 6044, 51776, 143, 6492, 85, 11, 1...	[ 0.169677734375, 0.0791015625, 0.0914306640625, 0.07635498046875, 0.1888427734375, 0.1966552734375, 0.2286376953125, 0.0909423828125, 0.2197265625, 0.012420654296875, 0.0577392578125, 0.05621337890625, 0.1248779296875, 0.0716552734375, 0.1351318359375, 0.152587890625, 0.05459594726562...	embed
70802489_c0	70802489	haskell	0	Title: Why >> duplicates right-hand side operand in haskell Problem title: Why >> duplicates right-hand side operand in haskell Tags: haskell, monads, do-notation Problem: Why >> duplicates right-hand side operand in haskell I'm searched for a solution for duplication of a string n times. I found duplicate ...	Why >> duplicates right-hand side operand in haskell Why >> duplicates right-hand side operand in haskell haskell monads do-notation Why Why >> duplicates right-hand side operand in haskell I'm searched for a solution for duplication of a string n times. I found duplicate n str = [1..n] >> str from this sol...	[ 0.00543212890625, -0.007080078125, 0.01904296875, 0.00119781494140625, -0.002227783203125, 0.00372314453125, 0.007781982421875, -0.00811767578125, 0.0145263671875, -0.02099609375, -0.0030364990234375, -0.038818359375, 0.00860595703125, 0.0074462890625, 0.000576019287109375, -0.00029945...	[ 44084, 5386, 171763, 1636, 7108, 12336, 5609, 6264, 2208, 23, 1556, 142508, 2667, 712, 7, 54, 157, 22062, 6396, 33938, 29806, 115, 182867, 79315, 653, 20028, 14037, 67, 7704, 2203, 68252, 5, 19, 1295, 32195, 15400, 55300, 26847, 9790, 204...	[ 0.1253662109375, 0.0635986328125, 0.24072265625, 0.0906982421875, 0.121826171875, 0.1492919921875, 0.144287109375, 0.150390625, 0.1009521484375, 0.046356201171875, 0.1455078125, 0.2119140625, 0.07366943359375, 0.1092529296875, 0.0289154052734375, 0.08587646484375, 0.114013671875, 0...	embed
75925737_c1	75925737	haskell	1	given newMutVar# :: v -> State# s -> (# State# s, MutVar# s v #) //then (this is pseudo code) let (# s#, var# #) = newMutVar# "hello world" (State# 0) in s# == State# 0 and see if the result is True , which implies that newMutVar# acts like id for State# . But I can't do this because I don't know how to generate State#...	given newMutVar# :: v -> State# s -> (# State# s, MutVar# s v #) //then (this is pseudo code) let (# s#, var# #) = newMutVar# "hello world" (State# 0) in s# == State# 0 and see if the result is True , which implies that newMutVar# acts like id for State# . But I can't do this because I don't know how to generate State#...	[ -0.005645751953125, 0.00054168701171875, -0.00665283203125, 0.005767822265625, 0.0096435546875, 0.01531982421875, -0.0286865234375, -0.0072021484375, 0.0150146484375, 0.0084228515625, 0.007598876953125, -0.01190185546875, 0.0147705078125, 0.0185546875, -0.0005950927734375, -0.006256103...	[ 34475, 3525, 10685, 18, 81827, 4904, 81, 22836, 91, 42015, 468, 74189, 18151, 2633, 285, 2203, 127, 13817, 8999, 135206, 757, 23, 69112, 1957, 2174, 16750, 87599, 27992, 1884, 3447, 831, 54, 3714, 139392, 34292, 5120, 70646, 91084, 9393, ...	[ 0.008758544921875, 0.124755859375, 0.1453857421875, 0.1143798828125, 0.265625, 0.210693359375, 0.1734619140625, 0.1915283203125, 0.09893798828125, 0.1610107421875, 0.04583740234375, 0.1895751953125, 0.18505859375, 0.06268310546875, 0.164306640625, 0.0191802978515625, 0.0526123046875,...	embed
35831639_c0	35831639	haskell	0	Title: K-th elemnt of list in haskell Problem title: K-th elemnt of list in haskell Tags: haskell Problem: K-th elemnt of list in haskell I'M a beginner in haskell, and trying to implement a function which returns the k-th element of a list without using the prelude !! built-in. kth_i [] _ _ = -1 kth_i (x:xs) i k = if ...	K-th elemnt of list in haskell K-th elemnt of list in haskell haskell K-th kth_i x:xs K-th elemnt of list in haskell I'M a beginner in haskell, and trying to implement a function which returns the k-th element of a list without using the prelude !! built-in. This code works, but is too verbose. I'd like to use just one...	[ -0.01318359375, 0.01300048828125, 0.01300048828125, -0.03271484375, 0.0196533203125, -0.00015163421630859375, 0.00445556640625, -0.0126953125, 0.0029449462890625, -0.015380859375, 0.0322265625, -0.027587890625, -0.0206298828125, 0.00616455078125, -0.019287109375, -0.0042724609375, 0....	[ 341, 9, 927, 88, 195, 660, 111, 5303, 23, 1556, 142508, 472, 454, 14, 1022, 12, 425, 7, 9842, 1679, 31577, 29479, 32354, 30646, 70, 12830, 15490, 17368, 479, 822, 112, 6506, 88303, 73, 18151, 43240, 5792, 57823, 1884, 4527, 1660, 1632...	[ 0.2205810546875, 0.1317138671875, 0.261474609375, 0.0938720703125, 0.127197265625, 0.1190185546875, 0.07977294921875, 0.180908203125, 0.064208984375, 0.15673828125, 0.2396240234375, 0.19775390625, 0.0276031494140625, 0.135986328125, 0.10400390625, 0.045989990234375, 0.134521484375, ...	embed
41194672_c0	41194672	haskell	0	Title: Get list of values in type Problem title: Get list of values in type Tags: haskell Problem: Get list of values in type In Haskell, is it possible to dynamically get a list of values in a type? A specific example is generating a complete deck of playing cards by combining one of each rank and suit to create a lis...	Get list of values in type Get list of values in type haskell Get Rank Suit Spades Hearts Diamonds Clubs Card Get list of values in type In Haskell, is it possible to dynamically get a list of values in a type? A specific example is generating a complete deck of playing cards by combining one of each rank and suit to c...	[ -0.0006561279296875, -0.01300048828125, -0.0035247802734375, 0.00555419921875, -0.00921630859375, -0.0003337860107421875, -0.01397705078125, -0.01495361328125, 0.01080322265625, -0.0072021484375, -0.000225067138671875, -0.00141143798828125, -0.0093994140625, 0.002716064453125, -0.0285644...	[ 20779, 5303, 111, 142424, 23, 10644, 1556, 142508, 134405, 1832, 217, 10959, 988, 60861, 69124, 7687, 23660, 20625, 7722, 84079, 25958, 2046, 27781, 12663, 28484, 8, 2594, 75169, 126381, 964, 30648, 60813, 28282, 163846, 15490, 7941, 587 ]	[ 0.059814453125, 0.154052734375, 0.07958984375, 0.1961669921875, 0.05194091796875, 0.23876953125, 0.131591796875, 0.236083984375, 0.114501953125, 0.10400390625, 0.0501708984375, 0.1060791015625, 0.1033935546875, 0.1209716796875, 0.128173828125, 0.1287841796875, 0.1431884765625, 0.11...	embed
30029029_c0	30029029	haskell	0	Title: Haskell: check if string is valid number Problem title: Haskell: check if string is valid number Tags: haskell, validation Problem: Haskell: check if string is valid number How do I check for a decimal point when checking a string is a valid number? What I am thinking is that I use something like the following, ...	Haskell: check if string is valid number Haskell: check if string is valid number haskell validation Haskell Bool Haskell: check if string is valid number How do I check for a decimal point when checking a string is a valid number? What I am thinking is that I use something like the following, but add code to check for...	[ -0.01068115234375, -0.005828857421875, -0.0028076171875, 0.0234375, -0.0128173828125, 0.025634765625, -0.00836181640625, -0.0218505859375, 0.00872802734375, 0.01287841796875, -0.0033721923828125, -0.0228271484375, -0.00933837890625, 0.0125732421875, -0.013427734375, -0.006683349609375,...	[ 20625, 142508, 12, 12765, 2174, 79315, 83, 35604, 14012, 1556, 44622, 2460, 929, 11249, 54, 87, 100, 10, 32380, 2749, 6275, 3229, 175199, 47644, 4527, 1884, 25632, 15190, 18151, 38, 78662, 61924, 24162, 73493, 237, 5, 758, 22410, 106, 615...	[ 0.1571044921875, 0.251220703125, 0.025238037109375, 0.2213134765625, 0.124267578125, 0.2467041015625, 0.1270751953125, 0.2427978515625, 0.2164306640625, 0.1429443359375, 0.16357421875, 0.08447265625, 0.1500244140625, 0.023834228515625, 0.0267791748046875, 0.0269775390625, 0.104980468...	embed
13439902_c0	13439902	haskell	0	Title: Function which Takes a binary tree and prints out its values in order Problem title: Function which Takes a binary tree and prints out its values in order Tags: haskell Problem: Function which Takes a binary tree and prints out its values in order I am currently writing a a function to take a binary tree and pri...	Function which Takes a binary tree and prints out its values in order Function which Takes a binary tree and prints out its values in order haskell Takes Node Nil Function which Takes a binary tree and prints out its values in order I am currently writing a a function to take a binary tree and print out its values in t...	[ 0.0234375, -0.0074462890625, -0.00787353515625, -0.01263427734375, 0.01806640625, 0.01611328125, -0.0257568359375, -0.0267333984375, -0.00909423828125, -0.016357421875, 0.004730224609375, -0.033935546875, -0.0023193359375, -0.01239013671875, 0.00762939453125, 0.013916015625, 0.021606...	[ 28670, 10763, 3129, 2561, 90, 2394, 6635, 53201, 136, 28412, 7, 1810, 142424, 23, 12989, 6863, 1556, 142508, 438, 112, 77175, 82424, 32562, 32354, 5646, 7108, 211385, 2967, 13695, 351, 146353, 103510, 18499, 17669, 11782 ]	[ 0.173095703125, 0.08795166015625, 0.06298828125, 0.1572265625, 0.091064453125, 0.1776123046875, 0.1661376953125, 0.2408447265625, 0.043182373046875, 0.184326171875, 0.01104736328125, 0.129150390625, 0.1805419921875, 0.041748046875, 0.2108154296875, 0.0108642578125, 0.121826171875, ...	embed
23985734_c0	23985734	haskell	0	Title: cannot convert bool to IO Bool Problem title: cannot convert bool to IO Bool Tags: haskell Problem: cannot convert bool to IO Bool I'm trying to do a function which returns true or false. owlFile = ".+\\.owl" testOwlFile src = src =~ owlFile :: Bool And i need to use on my do block : main = do [src] <- getArgs r...	cannot convert bool to IO Bool cannot convert bool to IO Bool haskell Bool Couldn cannot convert bool to IO Bool I'm trying to do a function which returns true or false. owlFile = ".+\\.owl" testOwlFile src = src =~ owlFile :: Bool And i need to use on my do block : But i'm having an error which is Couldn't match excep...	[ -0.0224609375, -0.001556396484375, 0.006866455078125, -0.003082275390625, 0.0025787353515625, 0.0162353515625, 0.0145263671875, 0.00005507469177246094, -0.0057373046875, -0.002227783203125, 0.0169677734375, -0.0289306640625, -0.00811767578125, -0.006744384765625, 0.0166015625, 0.010070...	[ 53418, 96760, 142484, 47, 17780, 2460, 929, 1556, 142508, 191147, 31577, 32354, 30646, 29568, 707, 98320, 36, 27751, 174350, 1328, 31, 3034, 670, 19437, 4527, 54, 46389, 18499, 18, 14858, 40494, 10644, 335, 137142, 678, 8561, 11782, 6954 ]	[ 0.181640625, 0.1666259765625, 0.22216796875, 0.1302490234375, 0.24267578125, 0.1336669921875, 0.2142333984375, 0.11279296875, 0.2049560546875, 0.09686279296875, 0.0191650390625, 0.08538818359375, 0.11181640625, 0.142822265625, 0.02227783203125, 0.17138671875, 0.06353759765625, 0.17...	embed
26092063_c1	26092063	haskell	1	libraries I've seen use a stack of layers so you just have to define the number of layer and the number of neuron in each layer, but its shape is a linear graph; this is fine for simple applications, but really hard core stuff needs networks with more complex architectures Id like some advice in how to attack these pr...	libraries I've seen use a stack of layers so you just have to define the number of layer and the number of neuron in each layer, but its shape is a linear graph; this is fine for simple applications, but really hard core stuff needs networks with more complex architectures Id like some advice in how to attack these pr...	[ -0.0220947265625, 0.018798828125, -0.01446533203125, 0.033935546875, -0.01544189453125, 0.0211181640625, -0.011962890625, -0.0186767578125, 0.005584716796875, -0.0361328125, -0.00018024444580078125, -0.03564453125, 0.003143310546875, 0.016845703125, -0.015625, -0.0035552978515625, -0...	[ 35773, 10484, 87, 272, 51592, 4527, 10, 177261, 111, 135355, 7, 221, 1660, 765, 61924, 14012, 136, 184940, 12638, 1284, 115700, 83, 192617, 41382, 903, 5885, 8781, 86685, 6183, 7941, 56458, 41884, 27117, 33120, 678, 1286, 27140, 159958, 247...	[ 0.2362060546875, 0.1683349609375, 0.016571044921875, 0.06298828125, 0.10052490234375, 0.1129150390625, 0.0447998046875, 0.18701171875, 0.105712890625, 0.2470703125, 0.052520751953125, 0.00408935546875, 0.031707763671875, 0.0140380859375, 0.185791015625, 0.051422119140625, 0.029968261...	embed
27510452_c1	27510452	haskell	1	Element -> Maybe Data.Text.Internal.Text Prelude Text.XML.Lens Data.Maybe Data.String Text.XML> textFrom "groupId" pom f <interactive>:68:24: No instance for (Control.Applicative.Applicative (Control.Lens.Internal.Context.Pretext (->) Element Element)) arising from a use of ‘f’ In the third argument of ‘textFrom’, nam...	Element -> Maybe Data.Text.Internal.Text Prelude Text.XML.Lens Data.Maybe Data.String Text.XML> textFrom "groupId" pom f <interactive>:68:24: No instance for (Control.Applicative.Applicative (Control.Lens.Internal.Context.Pretext (->) Element Element)) arising from a use of ‘f’ In the third argument of ‘textFrom’, nam...	[ 0.011474609375, -0.01226806640625, -0.0157470703125, -0.0029144287109375, 0.0205078125, 0.015869140625, 0.0072021484375, 0.001556396484375, -0.0024871826171875, -0.026123046875, -0.000614166259765625, 0.029052734375, -0.019287109375, -0.01220703125, 0.0084228515625, -0.005645751953125,...	[ 48325, 33079, 83425, 11809, 174379, 44851, 6236, 1914, 822, 112, 24129, 1542, 39456, 866, 1755, 82419, 372, 71713, 7986, 168407, 51588, 568, 71, 26378, 1238, 10433, 71232, 16028, 25732, 438, 110527, 100, 175904, 39179, 11048, 4935, 22829, 192...	[ 0.2342529296875, 0.1080322265625, 0.2646484375, 0.1248779296875, 0.17578125, 0.08984375, 0.0909423828125, 0.09405517578125, 0.1513671875, 0.03192138671875, 0.205810546875, 0.069580078125, 0.1805419921875, 0.104248046875, 0.15673828125, 0.10479736328125, 0.1605224609375, 0.085693359...	embed
74323809_c0	74323809	haskell	0	Title: How can I parse a JSON-formatted string into Tree Int Problem title: How can I parse a JSON-formatted string into Tree Int Tags: tree, haskell Problem: How can I parse a JSON-formatted string into Tree Int I have the following code: {-# LANGUAGE OverloadedStrings #-} import Data.Aeson import Data.Tree main :: IO...	How can I parse a JSON-formatted string into Tree Int How can I parse a JSON-formatted string into Tree Int tree haskell Data.Aeson Data.Tree How JSON-formatted Tree LANGUAGE OverloadedStrings Maybe How can I parse a JSON-formatted string into Tree Int I have the following code: But the output is "Nothing" in the conso...	[ 0.004425048828125, 0.0130615234375, -0.00982666015625, 0.031982421875, -0.00750732421875, 0.0245361328125, 0.006134033203125, -0.008544921875, -0.0264892578125, -0.0216064453125, -0.01239013671875, -0.0166015625, -0.0001583099365234375, 0.00830078125, 0.006256103515625, 0.0034027099609...	[ 366, 184, 821, 58627, 51727, 79315, 3934, 101344, 360, 18, 831, 53201, 1556, 142508, 11809, 191, 62731, 98064, 9578, 63033, 71713, 5180, 83425, 3674, 18151, 140992, 5021, 64113, 23, 130250, 2053, 23351, 214, 52895, 81, 1295, 1375, 110527 ]	[ 0.1434326171875, 0.0943603515625, 0.10577392578125, 0.1966552734375, 0.1185302734375, 0.1820068359375, 0.10498046875, 0.257080078125, 0.11181640625, 0.145751953125, 0.0151214599609375, 0.17578125, 0.04534912109375, 0.1566162109375, 0.05987548828125, 0.09832763671875, 0.154296875, 0...	embed
66805476_c0	66805476	haskell	0	Title: Combinig either type variables Problem title: Combinig either type variables Tags: haskell Problem: Combinig either type variables I have a function in Haskell which return type is Either error b , and there is " function x = Right b1 " and for the " function (x:xs) b = I want to get something like Right [list o...	Combinig either type variables Combinig either type variables haskell Combinig Either Right x:xs Combinig either type variables I have a function in Haskell which return type is Either error b , and there is " function x = Right b1 " and for the " function (x:xs) b = I want to get something like Right [list of b's] . I...	[ -0.005340576171875, 0.000583648681640625, 0.00238037109375, -0.011962890625, 0.005279541015625, 0.033935546875, -0.0155029296875, -0.0054931640625, 0.0191650390625, -0.02587890625, 0.0150146484375, -0.01953125, 0.0225830078125, -0.006072998046875, -0.0079345703125, -0.007049560546875, ...	[ 106935, 21882, 40101, 10644, 77336, 1556, 142508, 9319, 90911, 1022, 12, 425, 32354, 20625, 30646, 4565, 18499, 876, 2203, 418, 136, 100, 3444, 2046, 1884, 6562, 111, 25, 7, 73342, 3525, 37842, 1239, 98753, 581, 4734, 13580, 959, 1052, 22...	[ 0.2113037109375, 0.1536865234375, 0.1873779296875, 0.1942138671875, 0.23486328125, 0.137939453125, 0.220458984375, 0.1273193359375, 0.1864013671875, 0.0765380859375, 0.0623779296875, 0.1151123046875, 0.1370849609375, 0.129150390625, 0.0740966796875, 0.023406982421875, 0.189208984375,...	embed
32031968_c0	32031968	haskell	0	Title: Arrow notation in slice category Problem title: Arrow notation in slice category Tags: haskell, category-theory Problem: Arrow notation in slice category If CatC is a category and A any object of CatC , the slice category CatC /A is described this way: SC-1 An object of CatC /A is an arrow f: C -> A of CatC for ...	Arrow notation in slice category Arrow notation in slice category haskell category-theory Arrow CatC Arrow notation in slice category What is the type of arrow in CatC /A? C -> C (object in CatC to object in CatC ) or f -> f' (object in CatC /A to object in CatC /A).	[ 0.0167236328125, -0.004486083984375, 0.021484375, 0.02685546875, -0.00640869140625, -0.01422119140625, -0.016845703125, 0.01251220703125, 0.010986328125, 0.00787353515625, -0.0011138916015625, -0.02001953125, -0.02294921875, 0.00958251953125, 0.0019989013671875, -0.015625, -0.0286865...	[ 1172, 15555, 110, 22062, 23, 91, 13348, 95487, 1556, 142508, 2347, 18826, 441, 83, 70, 10644, 111, 118201, 248, 284, 313, 33079, 187694, 47, 36746, 707, 1238, 25, 194 ]	[ 0.1287841796875, 0.2213134765625, 0.1903076171875, 0.080078125, 0.0784912109375, 0.0443115234375, 0.209716796875, 0.21142578125, 0.07305908203125, 0.177978515625, 0.02301025390625, 0.1484375, 0.1800537109375, 0.017181396484375, 0.0244293212890625, 0.1947021484375, 0.0692138671875, ...	embed
34405952_c0	34405952	haskell	0	Title: Retrieve hidden type of a phantom type Problem title: Retrieve hidden type of a phantom type Tags: haskell, phantom-types Problem: Retrieve hidden type of a phantom type I declared a a phantom type like this with Haskell. newtype Length (a::UnitLength) b = Length b deriving (Eq,Show) data UnitLength = Meter \| Ki...	Retrieve hidden type of a phantom type Retrieve hidden type of a phantom type haskell phantom-types Retrieve Length a::UnitLength Show UnitLength Meter KiloMeter Miles Retrieve hidden type of a phantom type I declared a a phantom type like this with Haskell. Now, I would like to write some functions to use this type. B...	[ -0.01190185546875, 0.01434326171875, 0.005706787109375, 0.0089111328125, -0.006622314453125, 0.0003681182861328125, 0.01507568359375, 0.02197265625, 0.0089111328125, -0.006072998046875, -0.016845703125, -0.002655029296875, -0.01287841796875, -0.00799560546875, -0.0020599365234375, -0.0...	[ 200451, 204105, 10644, 111, 68743, 5928, 1556, 142508, 50986, 77554, 10, 85600, 449, 17367, 46640, 72812, 105519, 78572, 52999, 159978, 1884, 903, 678, 20625, 33022, 32354, 4527, 15935, 18, 73659, 1957, 7722, 456, 3996, 3134, 927, 51339, 3034...	[ 0.2135009765625, 0.24755859375, 0.19873046875, 0.035858154296875, 0.1563720703125, 0.1436767578125, 0.0911865234375, 0.228759765625, 0.198486328125, 0.1146240234375, 0.0164642333984375, 0.0767822265625, 0.047637939453125, 0.072265625, 0.10302734375, 0.07000732421875, 0.07220458984375...	embed
35864507_c0	35864507	haskell	0	Title: pointfree add to list in haskell Problem title: pointfree add to list in haskell Tags: haskell, pointfree Problem: pointfree add to list in haskell I'm trying to derive function of three args, using simple function chaining. The function should be of type addToList :: a -> a -> a -> [a] and be pointfree analogue...	pointfree add to list in haskell pointfree add to list in haskell haskell pointfree Prelude pointfree add to list in haskell I'm trying to derive function of three args, using simple function chaining. The function should be of type and be pointfree analogue of So far, I've figured out But it works in reverse: and look...	[ 0.022216796875, 0.0191650390625, -0.01007080078125, 0.00433349609375, -0.005645751953125, 0.0079345703125, -0.00103759765625, -0.00872802734375, -0.004791259765625, -0.052734375, 0.0137939453125, -0.035400390625, 0.01373291015625, 0.0089111328125, -0.00457763671875, -0.0189208984375, ...	[ 6275, 32087, 15190, 47, 5303, 1556, 142508, 23, 1914, 822, 112, 31577, 122, 5844, 32354, 17262, 79459, 8781, 1608, 14653, 5608, 111, 10644, 60223, 13388, 2060, 26366, 43240, 39531, 184, 33342, 11876, 1002, 2046, 26267, 28960 ]	[ 0.16259765625, 0.2469482421875, 0.1231689453125, 0.06915283203125, 0.154052734375, 0.130126953125, 0.189697265625, 0.0189056396484375, 0.00079345703125, 0.1151123046875, 0.0259246826171875, 0.0232696533203125, 0.056396484375, 0.022430419921875, 0.1474609375, 0.1431884765625, 0.139526...	embed
38040812_c0	38040812	haskell	0	Title: What does immutable variable in Haskell mean? Problem title: What does immutable variable in Haskell mean? Tags: functional-programming, immutability, haskell, ghci Problem: What does immutable variable in Haskell mean? I am quite confused with the concept of immutable variables in Haskell. It seems like that we...	What does immutable variable in Haskell mean? What does immutable variable in Haskell mean? functional-programming immutability haskell ghci What Haskell Prelude What does immutable variable in Haskell mean? I am quite confused with the concept of immutable variables in Haskell. It seems like that we can't change the v...	[ 0.014892578125, 0.0005950927734375, 0.000060558319091796875, 0.01507568359375, 0.0169677734375, 0.0189208984375, -0.01123046875, 0.0091552734375, -0.0035858154296875, 0.01361083984375, -0.002471923828125, -0.00714111328125, -0.009521484375, 0.0208740234375, 0.01116943359375, -0.0066223...	[ 4865, 14602, 566, 561, 22819, 77336, 23, 20625, 142508, 29459, 123309, 28966, 14311, 41159, 1556, 31380, 318, 1914, 822, 112, 55681, 23755, 7, 831, 15549, 34292, 25632, 18151, 41877, 17304, 79612, 6528 ]	[ 0.060882568359375, 0.036865234375, 0.102294921875, 0.1441650390625, 0.18359375, 0.268310546875, 0.08441162109375, 0.1451416015625, 0.253173828125, 0.1287841796875, 0.10498046875, 0.0704345703125, 0.17626953125, 0.05926513671875, 0.1343994140625, 0.045867919921875, 0.0740966796875, ...	embed
40209169_c0	40209169	haskell	0	Title: Maximizing according to a function Problem title: Maximizing according to a function Tags: haskell Problem: Maximizing according to a function I am trying to write a function that accepts a function and two inputs, and returns the argument that maximizes the function. This is the setup I want to use: max :: Eq a...	Maximizing according to a function Maximizing according to a function haskell Maximizing Maximizing according to a function I am trying to write a function that accepts a function and two inputs, and returns the argument that maximizes the function. This is the setup I want to use: For example, the function should work...	[ 0.010986328125, 0.0040283203125, 0.008056640625, 0.00714111328125, 0.0146484375, 0.0189208984375, -0.01806640625, 0.011474609375, 0.0038604736328125, -0.0181884765625, -0.007080078125, -0.017578125, -0.0128173828125, -0.00341796875, 0.01373291015625, -0.0294189453125, -0.007232666015...	[ 46540, 84382, 59499, 47, 32354, 1556, 142508, 31577, 33022, 26946, 136, 6626, 107730, 30646, 10750, 39771, 20650, 169581, 3444, 4527, 27781, 5608, 4488, 28960, 88949, 6896, 131815, 4426, 1328, 50258, 47644, 3871, 1884, 903, 51515, 22027, 18, ...	[ 0.20068359375, 0.16796875, 0.1781005859375, 0.0767822265625, 0.1966552734375, 0.1595458984375, 0.214599609375, 0.08099365234375, 0.0877685546875, 0.134765625, 0.06109619140625, 0.1375732421875, 0.1785888671875, 0.09130859375, 0.1734619140625, 0.1885986328125, 0.1778564453125, 0.148...	embed
26921107_c1	26921107	haskell	1	taps signal = map (correlate taps) (tails signal) downsample _ [] = [] downsample n (x:xs) = x : downsample n (drop (n-1) xs) upfirdn up down taps = (downsample down).(fir_filter taps).(upsample up) The upfirdn function indeed is just the straightforward approach, and laziness in the downsampling avoids computation, b...	taps signal = map (correlate taps) (tails signal) downsample _ [] = [] downsample n (x:xs) = x : downsample n (drop (n-1) xs) upfirdn up down taps = (downsample down).(fir_filter taps).(upsample up) The upfirdn function indeed is just the straightforward approach, and laziness in the downsampling avoids computation, b...	[ 0.0228271484375, 0.0208740234375, -0.004241943359375, -0.0111083984375, -0.004150390625, -0.00139617919921875, -0.0009002685546875, 0.018798828125, 0.0184326171875, -0.046630859375, 0.0069580078125, -0.0311279296875, 0.0155029296875, 0.0242919921875, -0.00167083740234375, -0.0115966796...	[ 10704, 7, 26073, 2203, 22288, 32399, 19309, 46741, 7565, 433, 33209, 653, 425, 1022, 138810, 110218, 1257, 13448, 71, 19, 34695, 120337, 74854, 11, 32354, 160463, 1660, 80560, 2472, 51515, 21, 708, 7432, 25133, 2069, 71864, 181135, 14543, 4...	[ 0.232666015625, 0.096923828125, 0.2203369140625, 0.0212860107421875, 0.10711669921875, 0.1171875, 0.151123046875, 0.185546875, 0.1756591796875, 0.1279296875, 0.1756591796875, 0.009857177734375, 0.05316162109375, 0.04705810546875, 0.1080322265625, 0.066162109375, 0.113037109375, 0.1...	embed
64809352_c1	64809352	haskell	1	ize_generation bar_) threadDelay 1000000 life (evolution bar_) cls = putStr "\ESC[2J" I initially expected that each new generation for some reason calculated all the previous generations as well, but it doesn't seem to be the case. I would expect the computation time of the evolution function to increase if that was t...	ize_generation bar_) threadDelay 1000000 life (evolution bar_) cls = putStr "\ESC[2J" I initially expected that each new generation for some reason calculated all the previous generations as well, but it doesn't seem to be the case. I would expect the computation time of the evolution function to increase if that was t...	[ -0.01348876953125, 0.0120849609375, -0.00933837890625, -0.005889892578125, 0.0021820068359375, 0.0038299560546875, 0.0004024505615234375, -0.017578125, -0.0162353515625, -0.0093994140625, -0.00811767578125, 0.01318359375, -0.0194091796875, -0.015625, -0.0291748046875, -0.00927734375, ...	[ 445, 13, 48281, 1363, 1909, 86997, 4657, 5259, 805, 28568, 6897, 137089, 33139, 7, 3884, 71713, 6706, 441, 304, 1375, 84751, 12638, 3525, 58093, 74481, 756, 96362, 442, 18, 48903, 7225, 41206, 181135, 1733, 28, 32354, 51312, 866, 19, 2841...	[ 0.11376953125, 0.151123046875, 0.14453125, 0.02349853515625, 0.1600341796875, 0.1737060546875, 0.127197265625, 0.232666015625, 0.067138671875, 0.1524658203125, 0.1361083984375, 0.2227783203125, 0.08349609375, 0.038970947265625, 0.1361083984375, 0.169677734375, 0.01953125, 0.0683593...	embed
65050490_c0	65050490	haskell	0	Title: Finding the type of a composition function in Haskell Problem title: Finding the type of a composition function in Haskell Tags: function-definition, haskell, types Problem: Finding the type of a composition function in Haskell Let's say I have the following function in Haskell: compose2 = (.) . (.) How would I ...	Finding the type of a composition function in Haskell Finding the type of a composition function in Haskell function-definition haskell types Finding Haskell compose2 Finding the type of a composition function in Haskell Let's say I have the following function in Haskell: compose2 = (.) . (.) How would I go about findi...	[ -0.0030975341796875, 0.00738525390625, 0.000392913818359375, 0.050537109375, -0.00750732421875, 0.0186767578125, -0.023193359375, 0.00811767578125, -0.0067138671875, -0.0206298828125, -0.0108642578125, -0.0230712890625, 0.0255126953125, 0.00537109375, -0.0123291015625, -0.0012054443359...	[ 26040, 214, 70, 10644, 111, 166577, 32354, 23, 20625, 142508, 49919, 1556, 52895, 150350, 304, 25632, 2203, 5, 2806, 1672, 90791, 903, 48716, 179933, 83324, 186, 831, 4527, 18, 2046, 3714, 3642, 15490, 36442, 13909, 98441, 7413 ]	[ 0.1046142578125, 0.004913330078125, 0.025909423828125, 0.21923828125, 0.07672119140625, 0.251708984375, 0.1864013671875, 0.036376953125, 0.1243896484375, 0.2322998046875, 0.06768798828125, 0.112060546875, 0.194580078125, 0.2415771484375, 0.1600341796875, 0.06842041015625, 0.055053710...	embed
65435497_c0	65435497	haskell	0	Title: Is there a way to get the usage block of optparse-aplicative parser outside the IO monad Problem title: Is there a way to get the usage block of optparse-aplicative parser outside the IO monad Tags: optparse-applicative, haskell Problem: Is there a way to get the usage block of optparse-aplicative parser outside...	Is there a way to get the usage block of optparse-aplicative parser outside the IO monad Is there a way to get the usage block of optparse-aplicative parser outside the IO monad optparse-applicative haskell Is there a way to get the usage block of optparse-aplicative parser outside the IO monad optparse-applicative pac...	[ 0.005828857421875, 0.02587890625, -0.0013275146484375, 0.0086669921875, -0.002532958984375, 0.016845703125, 0.009033203125, -0.0203857421875, 0.002777099609375, -0.028076171875, -0.01513671875, -0.0026092529296875, -0.003936767578125, -0.01611328125, 0.013916015625, 0.022216796875, -...	[ 2071, 2685, 3917, 2046, 70, 127689, 46389, 43922, 2500, 184, 52721, 4935, 366, 2189, 50782, 17780, 2667, 712, 9007, 11048, 1556, 142508, 98169, 113138, 72977, 75101, 2256, 10750, 6953, 101038, 7986, 58093, 28412, 7225, 18499, 4210, 73866, 358...	[ 0.000823974609375, 0.0042724609375, 0.07855224609375, 0.1160888671875, 0.04425048828125, 0.259033203125, 0.22314453125, 0.1875, 0.1722412109375, 0.1292724609375, 0.1395263671875, 0.0809326171875, 0.1334228515625, 0.1451416015625, 0.1712646484375, 0.155517578125, 0.0889892578125, 0....	embed
58259119_c0	58259119	haskell	0	Title: How to use map with a regular expression in Haskell Problem title: How to use map with a regular expression in Haskell Tags: haskell Problem: How to use map with a regular expression in Haskell While trying to apply the regular expression below to each element in a list (test), I get an error. This is what I am ...	How to use map with a regular expression in Haskell How to use map with a regular expression in Haskell haskell Text.Regex.TDFA How Haskell lobbying_firm CrisCom Company registration_year How to use map with a regular expression in Haskell While trying to apply the regular expression below to each element in a list (te...	[ -0.023193359375, 0.01483154296875, 0.0093994140625, 0.01202392578125, 0.00555419921875, 0.022705078125, -0.00592041015625, 0.0341796875, 0.012939453125, -0.018798828125, 0.005706787109375, -0.0118408203125, 0.0079345703125, -0.00183868408203125, 0.00099945068359375, -0.0167236328125, ...	[ 11249, 4527, 22288, 678, 10, 20324, 125195, 23, 20625, 142508, 1556, 24129, 54601, 3355, 100045, 14676, 120806, 214, 38949, 26315, 10770, 33734, 164498, 46799, 31577, 59911, 35064, 12638, 12830, 5303, 6954, 18499, 31380, 318, 831, 25647 ]	[ 0.067626953125, 0.1488037109375, 0.263671875, 0.150390625, 0.040679931640625, 0.19677734375, 0.2308349609375, 0.01953125, 0.12744140625, 0.2308349609375, 0.114013671875, 0.10260009765625, 0.07275390625, 0.1285400390625, 0.06982421875, 0.1968994140625, 0.199462890625, 0.044128417968...	embed
18105937_c0	18105937	haskell	0	Title: Sample arbitrary amount of numbers from Haskell list Problem title: Sample arbitrary amount of numbers from Haskell list Tags: haskell Problem: Sample arbitrary amount of numbers from Haskell list I'm starting to learn Haskell from a Ruby background. I'm looking to be able to get an arbitrary number of items fro...	Sample arbitrary amount of numbers from Haskell list Sample arbitrary amount of numbers from Haskell list haskell Haskell Sample Sample arbitrary amount of numbers from Haskell list I'm starting to learn Haskell from a Ruby background. I'm looking to be able to get an arbitrary number of items from a list: This is avai...	[ 0, 0.017333984375, 0.000492095947265625, 0.008544921875, -0.01422119140625, 0.01361083984375, -0.018798828125, 0.009033203125, 0.0223388671875, -0.01458740234375, 0.003692626953125, -0.0289306640625, 0.007537841796875, 0.01165771484375, -0.002960205078125, -0.00982666015625, 0.002304...	[ 947, 33209, 61799, 1294, 41170, 101935, 1295, 20625, 142508, 5303, 1556, 72134, 30698, 158189, 76615, 16487, 19048, 2046, 142, 14012, 55769, 10, 3293, 19882, 23, 156377, 5701, 123309, 7413, 1663, 26458, 903, 32354, 29479, 35978, 22362 ]	[ 0.165283203125, 0.205322265625, 0.1954345703125, 0.077392578125, 0.147216796875, 0.188720703125, 0.121337890625, 0.1270751953125, 0.2022705078125, 0.205078125, 0.115234375, 0.01336669921875, 0.05859375, 0.2398681640625, 0.07696533203125, 0.06451416015625, 0.0604248046875, 0.1134033...	embed
3890002_c0	3890002	haskell	0	Title: Can a TextEncoding be converted to a String? Problem title: Can a TextEncoding be converted to a String? Tags: locale, text, unicode, haskell Problem: Can a TextEncoding be converted to a String? It is possible to convert a string to a TextEncoding using mkTextEncoding :: String -> IO TextEncoding Is there any w...	Can a TextEncoding be converted to a String? Can a TextEncoding be converted to a String? locale text unicode haskell Can TextEncoding Can a TextEncoding be converted to a String? It is possible to convert a string to a TextEncoding using Is there any way to do do the reverse? Or, given a TextEncoding, any way to find ...	[ 0.017822265625, -0.016845703125, 0.0037841796875, 0.040771484375, -0.005615234375, -0.005523681640625, 0.004730224609375, 0.0098876953125, -0.006195068359375, 0.017578125, 0.002197265625, -0.02734375, 0.0185546875, 0.00909423828125, -0.00701904296875, 0.0159912109375, 0.002197265625,...	[ 4171, 10, 24129, 7768, 587, 6238, 117176, 71, 47, 23351, 214, 29096, 7986, 60347, 112, 1556, 142508, 186, 7722, 96760, 79315, 17368, 3917, 39531, 184, 7413, 1810, 4677, 22, 864, 110527, 37397, 26548, 61924, 12353, 17780, 132283, 121392 ]	[ 0.082275390625, 0.0933837890625, 0.205078125, 0.129638671875, 0.194580078125, 0.1680908203125, 0.15283203125, 0.06536865234375, 0.1282958984375, 0.1754150390625, 0.148681640625, 0.107177734375, 0.1806640625, 0.10546875, 0.0634765625, 0.0771484375, 0.1739501953125, 0.018798828125, ...	embed
27040150_c1	27040150	haskell	1	od.hs:502:5) Status: 500 Internal Server Error 54.70131s If I don't try to save the data, then the file information is received, and I am able to see the file name on the server. I've successfully managed to upload files using Yesod forms, but when it comes to custom forms all my attempts so far have failed. Any help i...	od.hs:502:5) Status: 500 Internal Server Error 54.70131s If I don't try to save the data, then the file information is received, and I am able to see the file name on the server. I've successfully managed to upload files using Yesod forms, but when it comes to custom forms all my attempts so far have failed. Any help i...	[ -0.0030670166015625, 0.0322265625, 0.00933837890625, -0.01239013671875, -0.0205078125, 0.01361083984375, 0.005615234375, -0.012451171875, 0.000059604644775390625, -0.027587890625, -0.00640869140625, -0.0211181640625, 0.0004100799560546875, 0.01953125, 0.011962890625, -0.000766754150390...	[ 229, 127, 7, 23837, 304, 43317, 56504, 2101, 106745, 141, 22687, 212059, 8983, 5757, 115468, 2301, 18, 9790, 30098, 2053, 11435, 4677, 75204, 19048, 47, 1957, 9351, 98, 10723, 272, 65771, 145755, 70622, 102158, 17368, 32635, 2199, 3173, 128...	[ 0.10400390625, 0.07177734375, 0.050140380859375, 0.1153564453125, 0.09326171875, 0.1300048828125, 0.157470703125, 0.155517578125, 0.1529541015625, 0.078125, 0.16650390625, 0.176513671875, 0.127685546875, 0.1146240234375, 0.18359375, 0.0144195556640625, 0.07470703125, 0.092407226562...	embed
22255265_c0	22255265	haskell	0	Title: Returning a list element using positions Problem title: Returning a list element using positions Tags: haskell, list, position Problem: Returning a list element using positions I have recently taken upon myself to learn Haskell and, in one of the first lessons, I have been told to learn how to manipulate lists f...	Returning a list element using positions Returning a list element using positions haskell list position positions Returning Returning a list element using positions I have recently taken upon myself to learn Haskell and, in one of the first lessons, I have been told to learn how to manipulate lists first. I understand ...	[ -0.0115966796875, 0.00927734375, -0.00182342529296875, -0.00173187255859375, 0.0033416748046875, 0.00439453125, 0.005828857421875, 0.00860595703125, 0.01953125, -0.0223388671875, 0.0216064453125, -0.0186767578125, 0.0059814453125, 0.01116943359375, -0.0299072265625, -0.0186767578125, ...	[ 173340, 5303, 12830, 17368, 19069, 7, 1556, 142508, 30698, 20625, 182417, 45258, 5117, 28219, 39580, 1295, 1884, 903, 7722, 72134, 4568, 145581 ]	[ 0.1778564453125, 0.1812744140625, 0.1490478515625, 0.0797119140625, 0.2276611328125, 0.05096435546875, 0.119140625, 0.192626953125, 0.01593017578125, 0.08935546875, 0.0308837890625, 0.1483154296875, 0.0196685791015625, 0.032745361328125, 0.1395263671875, 0.07073974609375, 0.009887695...	embed
5683009_c0	5683009	haskell	0	Title: Haskell "newtype" for type synonyms Problem title: Haskell "newtype" for type synonyms Tags: types, haskell Problem: Haskell "newtype" for type synonyms I'm doing some stuff with SAT, and I want to have both "and" and "or" clauses. type AndClause = [Literal] type OrClause = [Literal] But I'm ...	Haskell "newtype" for type synonyms Haskell "newtype" for type synonyms types haskell Haskell AndClause Literal OrClause Satisfiable Haskell "newtype" for type synonyms I'm doing some stuff with SAT, and I want to have both "and" and "or" clauses. But I'm running into problems when I use them: Gives...	[ 0.0020294189453125, 0.011962890625, -0.0029144287109375, 0.01361083984375, -0.0159912109375, 0.01153564453125, -0.00110626220703125, 0.000293731689453125, 0.0040283203125, 0.004638671875, -0.0206298828125, -0.0169677734375, -0.000885009765625, -0.0076904296875, -0.01434326171875, 0.000...	[ 20625, 142508, 54936, 50986, 100, 10644, 164661, 52895, 1556, 3493, 26253, 135940, 3347, 1814, 1029, 678, 75210, 3444, 15044, 2940, 748, 70731, 51042, 3934, 44402, 4527, 77878, 163, 52721, 67, 110527, 21635, 5256, 959, 2053, 64549, 3525, 2980...	[ 0.1337890625, 0.233642578125, 0.156005859375, 0.309814453125, 0.035247802734375, 0.1998291015625, 0.1905517578125, 0.1690673828125, 0.1287841796875, 0.09814453125, 0.1170654296875, 0.0882568359375, 0.120849609375, 0.076416015625, 0.07061767578125, 0.012603759765625, 0.1510009765625, ...	embed
14610081_c1	14610081	haskell	1	opEvery' :: (a -> a -> a) -> [a] -> [a] -> [a] opEvery' = foldr . (map .) main :: IO () main = print $ sum $ opEvery (+) [1..n] [1..n] where n :: Integer n = 5000 The profiling results using opEvery (explicit arguments version): total time = 2.91 secs (2906 ticks @ 1000 us, 1 processor) total alloc = 1,300,813,124 byt...	opEvery' :: (a -> a -> a) -> [a] -> [a] -> [a] opEvery' = foldr . (map .) main :: IO () main = print $ sum $ opEvery (+) [1..n] [1..n] where n :: Integer n = 5000 The profiling results using opEvery (explicit arguments version): total time = 2.91 secs (2906 ticks @ 1000 us, 1 processor) total alloc = 1,300,813,124 byt...	[ -0.01324462890625, -0.007171630859375, -0.0002880096435546875, -0.01220703125, -0.0003681182861328125, 0.01385498046875, 0.01336669921875, -0.003997802734375, 0.01397705078125, -0.039794921875, -0.003997802734375, -0.0296630859375, 0.0181884765625, -0.006591796875, -0.005706787109375, ...	[ 233, 200647, 25, 1984, 11, 33079, 10, 2203, 18344, 7569, 62346, 5201, 17780, 16, 28412, 3650, 10554, 22183, 5, 44401, 653, 19692, 9468, 214, 50339, 17368, 83613, 60923, 10750, 11389, 3622, 1733, 787, 12183, 19216, 9016, 1053, 22824, 4382, ...	[ 0.2193603515625, 0.32470703125, 0.14013671875, 0.0258026123046875, 0.019561767578125, 0.06317138671875, 0.046295166015625, 0.01580810546875, 0.09881591796875, 0.1455078125, 0.158203125, 0.146728515625, 0.1756591796875, 0.017120361328125, 0.1966552734375, 0.0499267578125, 0.1967773437...	embed
25414521_c0	25414521	haskell	0	Title: Types for parser combinators Problem title: Types for parser combinators Tags: parsing, types, haskell Problem: Types for parser combinators If I have a parser a : Parser A and a parser b : Parser B then I can combine it into a parser a \| b : Parser (Either A B) . This works but gets a little tricky when you sta...	Types for parser combinators Types for parser combinators parsing types haskell Types Parser Either Alternative Types for parser combinators If I have a parser a : Parser A and a parser b : Parser B then I can combine it into a parser a \| b : Parser (Either A B) . This works but gets a little tricky when you start addi...	[ 0.01275634765625, 0.015625, 0.00372314453125, 0.021728515625, -0.010986328125, 0.01361083984375, -0.0269775390625, -0.01080322265625, -0.0025787353515625, 0.004119873046875, -0.0130615234375, -0.00677490234375, 0.0166015625, 0.00006532669067382812, -0.0096435546875, 0.003448486328125, ...	[ 60457, 100, 366, 2189, 22321, 22230, 6953, 52895, 1556, 142508, 2392, 4565, 9319, 103905, 765, 10, 62, 136, 876, 335, 831, 70163, 3934, 43240, 1284, 10176, 88308, 154107, 1286, 30700, 313, 28987, 49878, 67, 96362, 10644, 5570, 167201, 51339...	[ 0.235107421875, 0.06231689453125, 0.1824951171875, 0.194091796875, 0.2264404296875, 0.1162109375, 0.052581787109375, 0.2144775390625, 0.1265869140625, 0.20263671875, 0.1707763671875, 0.01922607421875, 0.10888671875, 0.160888671875, 0.024444580078125, 0.0765380859375, 0.10223388671875...	embed
25949759_c0	25949759	haskell	0	Title: Pattern Match on String in Scala Problem title: Pattern Match on String in Scala Tags: haskell, scala Problem: Pattern Match on String in Scala How can I pattern match on a String in Scala: scala> "55" match { \| case x :: _ => x \| } <console>:9: error: constructor cannot be instantiated to expected type; found :...	Pattern Match on String in Scala Pattern Match on String in Scala haskell scala Pattern Match Scala scala.collection.immutable Char Prelude Defined GHC.Base Pattern Match on String in Scala How can I pattern match on a String in Scala: In Haskell a String is a List of Char [Char] : So it supports pattern matching on a ...	[ -0.00445556640625, 0.006683349609375, 0.00185394287109375, -0.005828857421875, -0.0019989013671875, 0.0084228515625, 0.000021457672119140625, -0.005950927734375, 0.011962890625, -0.0079345703125, 0.02734375, -0.04150390625, 0.00982666015625, 0.00121307373046875, -0.004974365234375, -0....	[ 9876, 22766, 67407, 98, 23351, 214, 23, 152653, 11, 1556, 142508, 146232, 196352, 561, 22819, 21656, 822, 5983, 73265, 63473, 11249, 831, 87, 103510, 14858, 360, 20625, 83, 32036, 84068, 8060, 54, 903 ]	[ 0.1727294921875, 0.1571044921875, 0.248779296875, 0.08306884765625, 0.204345703125, 0.112060546875, 0.051605224609375, 0.2120361328125, 0.1180419921875, 0.0853271484375, 0.2266845703125, 0.1878662109375, 0.0653076171875, 0.0135498046875, 0.05926513671875, 0.109619140625, 0.0784912109...	embed
40717014_c0	40717014	haskell	0	Title: How to readline in Haskell without transfer to the next line? Problem title: How to readline in Haskell without transfer to the next line? Tags: readline, io, haskell, console Problem: How to readline in Haskell without transfer to the next line? I am trying to use readline in Haskell without transfer cursor to ...	How to readline in Haskell without transfer to the next line? How to readline in Haskell without transfer to the next line? readline io haskell console How Haskell How to readline in Haskell without transfer to the next line? I am trying to use readline in Haskell without transfer cursor to the next line. For example, ...	[ -0.0220947265625, -0.004730224609375, 0.01287841796875, 0.02587890625, -0.00104522705078125, -0.00077056884765625, 0.016845703125, -0.00028228759765625, -0.006988525390625, -0.035888671875, 0.0021514892578125, -0.0152587890625, -0.017333984375, -0.0164794921875, -0.01068115234375, 0.00...	[ 11249, 47, 12301, 2256, 23, 20625, 142508, 15490, 12302, 11737, 13315, 22995, 1556, 130250, 31577, 4527, 13810, 42, 54397, 18151, 72134, 1528, 1544, 2046, 28960 ]	[ 0.037506103515625, 0.05108642578125, 0.173583984375, 0.2205810546875, 0.0546875, 0.128173828125, 0.2169189453125, 0.1241455078125, 0.1490478515625, 0.052520751953125, 0.1060791015625, 0.1163330078125, 0.1087646484375, 0.127197265625, 0.002227783203125, 0.03082275390625, 0.06286621093...	embed
20743670_c0	20743670	haskell	0	Title: haskell flip simulation problems Problem title: haskell flip simulation problems Tags: flip, function, haskell Problem: haskell flip simulation problems flip' :: (a -> b -> c) -> (b -> a -> c) flip' f = g where g x y = f y x I want to ask that in the above flip' function , it seems that flip' will return a funct...	haskell flip simulation problems haskell flip simulation problems flip function haskell haskell flip simulation problems I want to ask that in the above flip' function , it seems that flip' will return a function named g and g x y share the same value with f y x however, in " where g x y = f y x " , f y x is a function...	[ 0.00634765625, 0.0108642578125, 0.008544921875, -0.007110595703125, 0.01007080078125, 0.01275634765625, -0.010498046875, -0.00909423828125, -0.0037078857421875, 0.0093994140625, 0.00927734375, 0.019287109375, 0.005035400390625, -0.028564453125, 0.0103759765625, -0.00154876708984375, ...	[ 1556, 142508, 147505, 40226, 44402, 32354, 1363, 3444, 26458, 36917, 25, 37202, 1221, 30646, 706, 136, 1022, 113, 12008, 5701, 34292, 678, 1238, 49903, 7440, 2203, 83, 11782, 365, 14602, 3249, 10422, 81, 304, 418, 18151, 4488, 3714, 1286, ...	[ 0.1304931640625, 0.2056884765625, 0.258056640625, 0.2471923828125, 0.18701171875, 0.18310546875, 0.018829345703125, 0.052886962890625, 0.063232421875, 0.07159423828125, 0.118896484375, 0.0745849609375, 0.04754638671875, 0.1572265625, 0.1192626953125, 0.0552978515625, 0.080322265625, ...	embed
43913107_c0	43913107	haskell	0	Title: How to clean a directory made using stack (haskell) and reuse it? Problem title: How to clean a directory made using stack (haskell) and reuse it? Tags: haskell, haskell-stack Problem: How to clean a directory made using stack (haskell) and reuse it? I am working with haskell using stack and each time I need to ...	How to clean a directory made using stack (haskell) and reuse it? How to clean a directory made using stack (haskell) and reuse it? haskell haskell-stack stack How How to clean a directory made using stack (haskell) and reuse it? I am working with haskell using stack and each time I need to painfully download all depen...	[ -0.01373291015625, 0.01251220703125, 0.01318359375, 0.024658203125, 0.004241943359375, -0.009521484375, -0.0098876953125, -0.00958251953125, -0.007049560546875, 0.00537109375, -0.029296875, 0.002960205078125, 0.007598876953125, 0.009765625, 0.00421142578125, -0.000640869140625, -0.01...	[ 11249, 47, 46622, 14364, 53, 7228, 17368, 177261, 10557, 142508, 136, 156883, 442, 1556, 590, 2594, 10, 20697, 678, 24503, 7026, 42548, 117538, 13452, 160193, 6165, 645, 434, 18781, 18151, 72134, 105027, 24674, 96362, 102158, 13648, 193943, 4...	[ 0.082763671875, 0.06146240234375, 0.27099609375, 0.17626953125, 0.1475830078125, 0.1248779296875, 0.125244140625, 0.2646484375, 0.119384765625, 0.240966796875, 0.08660888671875, 0.240478515625, 0.0914306640625, 0.11962890625, 0.1427001953125, 0.134033203125, 0.0176239013671875, 0.0...	embed
9433633_c0	9433633	haskell	0	Title: Is it possible to use functions in Haskell parameters? Problem title: Is it possible to use functions in Haskell parameters? Tags: parameters, haskell, function Problem: Is it possible to use functions in Haskell parameters? I have seen a few examples of Haskell code that use functions in parameters, but I can n...	Is it possible to use functions in Haskell parameters? Is it possible to use functions in Haskell parameters? parameters haskell function Haskell Compute Fibonacci Sequence Parse Is it possible to use functions in Haskell parameters? I have seen a few examples of Haskell code that use functions in parameters, but I can...	[ -0.00946044921875, 0.026123046875, -0.004791259765625, 0.024658203125, 0.00015926361083984375, 0.0224609375, 0.005157470703125, -0.00262451171875, 0.00022983551025390625, -0.031005859375, -0.00121307373046875, -0.041015625, 0.002349853515625, 0.021728515625, 0.0164794921875, -0.0077514...	[ 2071, 442, 7722, 4527, 32354, 7, 23, 20625, 142508, 171859, 47, 1556, 159415, 3698, 20990, 52544, 944, 2392, 184, 51592, 27781, 18151, 831, 8306, 2046, 4488, 163, 9790, 903, 18499, 6494 ]	[ 0.058349609375, 0.050506591796875, 0.16455078125, 0.1492919921875, 0.22705078125, 0.11669921875, 0.08642578125, 0.127197265625, 0.243408203125, 0.217529296875, 0.04827880859375, 0.099853515625, 0.05548095703125, 0.03173828125, 0.09576416015625, 0.115234375, 0.047088623046875, 0.045...	embed
9830006_c0	9830006	haskell	0	Title: type signature between function and class Problem title: type signature between function and class Tags: haskell Problem: type signature between function and class data Maybe' a = Nothing' \| Just' a deriving (Show) class From' t where from' :: t a -> a instance From' Maybe' where from' (Just' x) = x This works. ...	type signature between function and class type signature between function and class haskell Maybe Nothing Just Show from2 Couldn test.hs:11:1 type signature between function and class This works. But... I don't know why it doesn't work.	[ -0.00433349609375, 0.01055908203125, -0.00946044921875, -0.013916015625, 0.00121307373046875, 0.015380859375, -0.00738525390625, 0.0191650390625, 0.01263427734375, -0.03564453125, -0.016357421875, -0.011962890625, 0.00396728515625, -0.0074462890625, -0.011962890625, -0.0108642578125, ...	[ 10644, 138256, 17721, 32354, 136, 18507, 1556, 142508, 83425, 182747, 9563, 17367, 1295, 304, 191147, 3034, 127, 7, 19993, 19721, 3293, 43240, 3714, 15400, 442, 22027, 18, 4488 ]	[ 0.250244140625, 0.269775390625, 0.1739501953125, 0.204345703125, 0.1260986328125, 0.2186279296875, 0.1378173828125, 0.220703125, 0.084228515625, 0.127197265625, 0.06976318359375, 0.1771240234375, 0.1107177734375, 0.07257080078125, 0.064453125, 0.1514892578125, 0.09490966796875, 0.0...	embed
6112631_c0	6112631	haskell	0	Title: couldn't match expected type Problem title: couldn't match expected type Tags: haskell Problem: couldn't match expected type I would like to do something different but it would be too long so below is only example: test x y = if x == "5" then x else do putStrLn "bad value"; y so if x == 5 it should ret...	couldn't match expected type couldn't match expected type haskell Bool couldn't match expected type I would like to do something different but it would be too long so below is only example: so if x == 5 it should return x, else it should print 'bad value' and return y - how can I do that in haskell ? edit: Wh...	[ -0.0155029296875, -0.00823974609375, 0.00726318359375, 0.004150390625, 0.017822265625, 0.003753662109375, -0.0032501220703125, 0.0042724609375, 0.00109100341796875, 0.028564453125, 0.0169677734375, -0.0213623046875, -0.0078125, -0.01190185546875, 0.0185546875, 0.0111083984375, 0.0075...	[ 69427, 3768, 18, 14858, 84751, 10644, 1556, 142508, 2460, 929, 2806, 1884, 54, 9844, 12921, 4989, 35064, 27781, 2174, 1022, 69112, 190, 5608, 30646, 37076, 28412, 12283, 34292, 113, 3642, 831, 23, 18151, 18499, 52366, 19, 142484, 678, 8561,...	[ 0.114990234375, 0.0635986328125, 0.09716796875, 0.2069091796875, 0.163818359375, 0.1832275390625, 0.1416015625, 0.214599609375, 0.075927734375, 0.1568603515625, 0.006988525390625, 0.0694580078125, 0.0263214111328125, 0.0179443359375, 0.1263427734375, 0.0195465087890625, 0.03024291992...	embed
23655950_c0	23655950	haskell	0	Title: Spawn process then exit in haskell Problem title: Spawn process then exit in haskell Tags: haskell Problem: Spawn process then exit in haskell I'm attempting to make a pop-up menu program for xmonad, and I'm trying to figure out how to spawn a command from a string, then exit without stopping or waiting for the ...	Spawn process then exit in haskell Spawn process then exit in haskell haskell Spawn Nothing Spawn process then exit in haskell I'm attempting to make a pop-up menu program for xmonad, and I'm trying to figure out how to spawn a command from a string, then exit without stopping or waiting for the child process. I've got...	[ 0.00927734375, 0.0162353515625, -0.0244140625, 0.005950927734375, -0.0024871826171875, 0.01092529296875, 0.01409912109375, -0.036376953125, 0.001068115234375, -0.0224609375, 0.0205078125, -0.000400543212890625, -0.0235595703125, 0.0126953125, -0.00726318359375, -0.00897216796875, -0....	[ 10959, 7710, 9433, 7068, 82230, 23, 1556, 142508, 182747, 81887, 7426, 2037, 8026, 1528, 1022, 3796, 712, 26366, 5623, 75101, 1295, 79315, 15490, 7279, 89289, 29041, 18151, 110934, 6392, 45388, 2182, 903, 49129, 55300, 4034, 5773 ]	[ 0.1817626953125, 0.162353515625, 0.187255859375, 0.0220947265625, 0.21630859375, 0.0390625, 0.1177978515625, 0.213623046875, 0.153564453125, 0.0159149169921875, 0.0772705078125, 0.05877685546875, 0.132080078125, 0.086181640625, 0.052947998046875, 0.09130859375, 0.1192626953125, 0.0...	embed
51696323_c0	51696323	haskell	0	Title: Tail recursion in Haskell for a function Problem title: Tail recursion in Haskell for a function Tags: haskell, recursion Problem: Tail recursion in Haskell for a function I am trying to learn Haskell and I read about tail recursions. For example I can write the sum function this way : sum :: Num a => [a] -> a s...	Tail recursion in Haskell for a function Tail recursion in Haskell for a function haskell recursion Tail Haskell Num x:xs Integer n-1 Tail recursion in Haskell for a function I am trying to learn Haskell and I read about tail recursions. For example I can write the sum function this way : But also this way Could someon...	[ -0.006622314453125, -0.00360107421875, 0.0242919921875, 0.00823974609375, 0.00469970703125, 0.00579833984375, -0.003143310546875, -0.0191650390625, 0.005279541015625, -0.01422119140625, 0.00775146484375, -0.018798828125, 0.00140380859375, -0.008056640625, 0.0174560546875, 0.00582885742...	[ 1218, 379, 195625, 1830, 23, 20625, 142508, 100, 32354, 1556, 52782, 1022, 12, 425, 44401, 653, 5759, 31577, 30698, 46741, 17514, 27781, 831, 33022, 10554, 903, 3917, 14192, 3642, 47, 54, 442, 678, 72856 ]	[ 0.185302734375, 0.1724853515625, 0.209228515625, 0.0938720703125, 0.04571533203125, 0.15234375, 0.232177734375, 0.0609130859375, 0.18505859375, 0.1253662109375, 0.1446533203125, 0.06170654296875, 0.03173828125, 0.08935546875, 0.1505126953125, 0.009246826171875, 0.1353759765625, 0.0...	embed
5344375_c0	5344375	haskell	0	Title: Haskell. Non IO Exception handling Problem title: Haskell. Non IO Exception handling Tags: exception, haskell Problem: Haskell. Non IO Exception handling I am trying to catch exception due to with the action ([1,2] !! 3). I can not. I was trying let a = [1,2] handle (\(e :: SomeException) -> print "err" >> retur...	Haskell. Non IO Exception handling Haskell. Non IO Exception handling exception haskell SomeException Control.Exception Haskell Non Exception Control.Exception.catch e::SomeException Haskell. Non IO Exception handling I am trying to catch exception due to with the action ([1,2] !! 3). I can not. I was trying handle (\(...	[ -0.011962890625, 0.027587890625, -0.005767822265625, -0.027099609375, 0.0159912109375, 0.003875732421875, 0.0033111572265625, -0.0029449462890625, 0.0106201171875, -0.024169921875, 0.000873565673828125, -0.006439208984375, 0.00469970703125, -0.01507568359375, 0.027587890625, -0.0213623...	[ 20625, 142508, 3775, 17780, 5443, 63928, 45064, 131527, 1556, 31384, 19279, 27131, 4460, 206, 28, 8912, 282, 31577, 105556, 4743, 678, 22631, 133063, 6506, 8439, 831, 959, 34831, 41872, 13, 1984, 28412, 56, 42, 30646, 4879, 65395, 3650, 10,...	[ 0.161865234375, 0.242919921875, 0.2021484375, 0.1787109375, 0.1143798828125, 0.2220458984375, 0.175537109375, 0.252685546875, 0.1656494140625, 0.1373291015625, 0.1019287109375, 0.2069091796875, 0.108642578125, 0.04302978515625, 0.09588623046875, 0.04876708984375, 0.08184814453125, ...	embed

30701305_c0

30701305

haskell

0

Title: Specifying Postgres table schemas in Esqueleto/Persistent Problem title: Specifying Postgres table schemas in Esqueleto/Persistent Tags: esqueleto, postgresql, haskell, persistent Problem: Specifying Postgres table schemas in Esqueleto/Persistent I'm using Esqueleto with Postgres and I don't see a way to specify...

Specifying Postgres table schemas in Esqueleto/Persistent Specifying Postgres table schemas in Esqueleto/Persistent esqueleto postgresql haskell persistent Specifying Postgres Esqueleto Persistent search_path Specifying Postgres table schemas in Esqueleto/Persistent I'm using Esqueleto with Postgres and I don't see a w...

[ 0.019775390625, 0.02294921875, -0.004241943359375, 0.01904296875, -0.01397705078125, -0.00063323974609375, 0.0177001953125, -0.01202392578125, -0.015625, -0.0037384033203125, 0.021728515625, 0.01129150390625, -0.01806640625, 0.00213623046875, -0.0250244140625, 0.0198974609375, -0.002...

[ 24990, 151138, 2795, 17562, 23180, 61903, 7, 23, 1184, 37631, 31580, 64, 15277, 6892, 66660, 133, 188, 1305, 99247, 1556, 142508, 70560, 57309, 2581, 33938, 128405, 17368, 678, 3917, 40140, 18929, 450, 157176, 25632, 5423, 114864, 4527, 87, ...

[ 0.1712646484375, 0.0999755859375, 0.0982666015625, 0.210205078125, 0.2257080078125, 0.262939453125, 0.0875244140625, 0.0765380859375, 0.0692138671875, 0.14501953125, 0.181884765625, 0.0182952880859375, 0.0316162109375, 0.1455078125, 0.09124755859375, 0.1103515625, 0.0653076171875, ...

embed

57758951_c0

57758951

haskell

0

Title: What are freer monads? Problem title: What are freer monads? Tags: functional-programming, haskell, monads Problem: What are freer monads? I heard this term a few times, but I still don't know what exactly is a so-called "Freer Monad". The name makes me think about Free Monads, but I don't see how they are actua...

What are freer monads? What are freer monads? functional-programming haskell monads What What are freer monads? I heard this term a few times, but I still don't know what exactly is a so-called "Freer Monad". The name makes me think about Free Monads, but I don't see how they are actually related. There is some library...

[ 0.005340576171875, -0.0086669921875, 0.022216796875, 0.0047607421875, 0.0021514892578125, 0.007781982421875, -0.010986328125, -0.0003147125244140625, -0.0015411376953125, -0.009033203125, 0.001129150390625, -0.0157470703125, -0.0012054443359375, 0.012939453125, -0.0130615234375, -0.013...

[ 4865, 4092, 42, 2667, 712, 7, 123309, 28966, 1556, 142508, 621, 49782, 13579, 10846, 20028, 3714, 81437, 60331, 71, 5351, 5153, 6468, 62548, 35773, 85526, 4588, 139509, 10557, 29102, 12176, 56, 27781, 28219, 6528, 4527, 58437, 32195, 92940, ...

[ 0.048736572265625, 0.1748046875, 0.224365234375, 0.127685546875, 0.2076416015625, 0.1136474609375, 0.113525390625, 0.097412109375, 0.07879638671875, 0.1824951171875, 0.04046630859375, 0.0296783447265625, 0.064208984375, 0.006927490234375, 0.010162353515625, 0.030517578125, 0.16528320...

embed

58625324_c1

58625324

haskell

1

digging into the problem I pinpointed the root cause to be my implementation of the <|> method. If I use the following implementation then everything goes as expected: instance Alternative Parser where empty = Parser $ \_s -> [] p1 <|> p2 = Parser $ \s -> case runParser p1 s of [] -> runParser p2 s xs -> xs These two ...

[ 0.005035400390625, 0.0162353515625, 0.03759765625, 0.0038909912109375, -0.0135498046875, 0.0181884765625, -0.014892578125, -0.025634765625, 0.010986328125, 0.019775390625, 0.0128173828125, 0.0267333984375, 0.004608154296875, 0.01611328125, 0.007049560546875, -0.018798828125, 0.015319...

[ 2967, 38496, 74855, 22304, 759, 208124, 58745, 2740, 55300, 4527, 25632, 26818, 60899, 237, 84751, 110527, 103905, 2392, 2189, 201505, 454, 915, 418, 4426, 304, 7225, 11675, 28636, 91, 111, 1022, 7, 33079, 6626, 100094, 32233, 183234, 20625, ...

[ 0.0941162109375, 0.03167724609375, 0.1151123046875, 0.099853515625, 0.0162200927734375, 0.1739501953125, 0.158935546875, 0.09014892578125, 0.1512451171875, 0.0548095703125, 0.05682373046875, 0.091796875, 0.043670654296875, 0.06951904296875, 0.109619140625, 0.1905517578125, 0.18872070...

embed

39501998_c0

39501998

haskell

0

Title: Implementing String join function in Haskell Problem title: Implementing String join function in Haskell Tags: haskell Problem: Implementing String join function in Haskell I'm new to Haskell and trying to implement a function that takes a separator and a list to return a concatenated string (Similar to join fun...

Implementing String join function in Haskell Implementing String join function in Haskell haskell Implementing Haskell Implementing String join function in Haskell I'm new to Haskell and trying to implement a function that takes a separator and a list to return a concatenated string (Similar to join function in Python)...

[ -0.005767822265625, 0.004669189453125, 0.004058837890625, 0.000545501708984375, -0.0027313232421875, 0.01495361328125, -0.0166015625, -0.0019683837890625, 0.0223388671875, 0.028564453125, 0.009521484375, -0.0150146484375, 0.01287841796875, -0.0029449462890625, -0.00091552734375, -0.015...

[ 153941, 23351, 214, 33284, 32354, 23, 20625, 142508, 1556, 3525, 31577, 29479, 51776, 38310, 748, 136, 5303, 30646, 158, 4460, 33, 79315, 2605, 320, 145581, 11782, 7704, 16604, 73, 58745, 3584, 31, 1299, 28412, 1884, 16750, 12301, 126596, 1...

[ 0.2061767578125, 0.2110595703125, 0.10064697265625, 0.25390625, 0.18115234375, 0.040679931640625, 0.1500244140625, 0.253173828125, 0.1334228515625, 0.0615234375, 0.019439697265625, 0.16064453125, 0.06085205078125, 0.1590576171875, 0.1036376953125, 0.0159454345703125, 0.0970458984375,...

embed

28270414_c0

28270414

haskell

0

Title: Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Problem title: Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Tags: netwire, haskell, distributed-computing Problem: Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Basically, I want t...

Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? netwire haskell distributed-computing Cloud Haskell Netwire Can Cloud Haskell & Netwire. Do they overlap? Can both be used effectively? Basically, I want to experiment ...

[ 0.0002841949462890625, 0.0174560546875, 0.00628662109375, 0.006256103515625, -0.02001953125, -0.00170135498046875, 0.005462646484375, -0.016357421875, -0.01544189453125, -0.01324462890625, -0.0078125, -0.00927734375, 0.0093994140625, -0.002899169921875, -0.00872802734375, 0.01055908203...

[ 48316, 20625, 142508, 619, 25133, 10086, 17084, 13, 1836, 645, 6324, 4171, 15044, 11814, 191984, 74, 984, 2043, 1556, 15917, 3674, 7077, 3444, 28007, 563, 38796, 136, 32195, 5809, 4527, 47, 63769, 12921, 157, 51139, 21771, 87344, 1439, 90, ...

[ 0.2236328125, 0.1728515625, 0.289794921875, 0.1444091796875, 0.1417236328125, 0.134765625, 0.250244140625, 0.17041015625, 0.040618896484375, 0.1124267578125, 0.238525390625, 0.1181640625, 0.094482421875, 0.1534423828125, 0.1495361328125, 0.010498046875, 0.00146484375, 0.07983398437...

embed

49620356_c0

49620356

haskell

0

Title: Avoiding usage of fail in parsers from Parsers library Problem title: Avoiding usage of fail in parsers from Parsers library Tags: parser-combinators, parsing, haskell Problem: Avoiding usage of fail in parsers from Parsers library From what I was told using fail is not recommended and it will later be removed. ...

Avoiding usage of fail in parsers from Parsers library Avoiding usage of fail in parsers from Parsers library parser-combinators parsing haskell Parsers Avoiding Parser Integer Leading Zeros Avoiding usage of fail in parsers from Parsers library From what I was told using fail is not recommended and it will later be re...

[ -0.01239013671875, 0.012939453125, 0.0164794921875, 0.0081787109375, -0.007659912109375, 0.01495361328125, 0.000614166259765625, 0.000518798828125, 0.0027618408203125, -0.00823974609375, -0.0011444091796875, 0.0078125, 0.00024318695068359375, 0.00171661376953125, 0.01953125, -0.0078735...

[ 84361, 86675, 127689, 111, 35782, 23, 366, 7, 1314, 1295, 2392, 35773, 2189, 277, 19155, 22230, 1556, 142508, 44401, 165507, 83947, 1294, 30745, 17368, 83, 959, 170198, 184750, 4865, 5608, 155965, 11814, 64457, 74257, 17928, 102, 27781 ]

[ 0.1658935546875, 0.0221710205078125, 0.17236328125, 0.040618896484375, 0.2578125, 0.066162109375, 0.1849365234375, 0.123291015625, 0.1597900390625, 0.0751953125, 0.1805419921875, 0.137451171875, 0.1815185546875, 0.0249481201171875, 0.1634521484375, 0.05596923828125, 0.079345703125, ...

embed

66579458_c1

66579458

haskell

1

.hs, interpreted ) Ok, three modules loaded. There seems to be a confusion with autogen and with Paths_primo ( primo is the name of the package). What am I doing wrong? General question: what is the correct way to clean a stack project to "start over" after some experimentation? Is is correct to delete the cabal file a...

[ -0.004150390625, 0.0211181640625, -0.002288818359375, 0.01904296875, 0.00185394287109375, 0.01446533203125, -0.005401611328125, -0.015869140625, 0.00921630859375, -0.00145721435546875, -0.011474609375, -0.00628662109375, -0.007110595703125, 0.0028228759765625, 0.0005950927734375, 0.001...

[ 5, 127, 7, 29481, 297, 9972, 17262, 88996, 72367, 37202, 169463, 1809, 1409, 108421, 35188, 31, 10014, 98169, 444, 20594, 44691, 9082, 9655, 26785, 3917, 47, 46622, 177261, 13452, 17137, 645, 7103, 28007, 154109, 109524, 11435, 136, 18244, ...

[ 0.047210693359375, 0.142822265625, 0.0926513671875, 0.162841796875, 0.1270751953125, 0.014923095703125, 0.128662109375, 0.2333984375, 0.1495361328125, 0.0177154541015625, 0.17919921875, 0.2091064453125, 0.2230224609375, 0.2120361328125, 0.1942138671875, 0.20556640625, 0.25439453125, ...

embed

32331537_c1

32331537

haskell

1

of ‘bar’ from the context (KnownNat n) bound by a pattern with constructor SomeNat :: forall (n :: Nat). KnownNat n => Proxy n -> SomeNat, in a case alternative at Blag.hs:19:9-30 In the second argument of ‘($)’, namely ‘bar a’ In a stmt of a 'do' block: print $ bar a In the expression: do { let a :: Bar (n + 5) a = B...

[ 0.005615234375, 0.006683349609375, -0.015380859375, 0.0035247802734375, -0.00115966796875, 0.00081634521484375, -0.00104522705078125, 0.01519775390625, 0.01068115234375, -0.0213623046875, 0.00171661376953125, -0.0030670166015625, 0.01104736328125, 0.00439453125, -0.0009307861328125, -0...

[ 111, 1299, 1295, 43701, 35613, 19, 4645, 18, 653, 99091, 103510, 64549, 748, 31384, 1984, 5584, 68875, 70829, 1250, 50878, 30700, 3668, 23988, 1126, 27000, 17932, 10750, 4369, 10, 6138, 246, 46389, 28412, 3650, 1909, 125195, 54, 2633, 3253,...

[ 0.0728759765625, 0.2119140625, 0.040802001953125, 0.1849365234375, 0.150146484375, 0.056976318359375, 0.20849609375, 0.13623046875, 0.0823974609375, 0.134521484375, 0.1734619140625, 0.1142578125, 0.023406982421875, 0.06964111328125, 0.002288818359375, 0.124755859375, 0.1845703125, ...

embed

10474433_c0

10474433

haskell

0

Title: replace tuple in list of tuples - Haskell Problem title: replace tuple in list of tuples - Haskell Tags: tuples, haskell, list Problem: replace tuple in list of tuples - Haskell Hey guys I want to be able to replace a tuple in a list of tuples. Here is what I am thinking: let lst = [("john",3), ("greg",3), ("tom...

replace tuple in list of tuples - Haskell replace tuple in list of tuples - Haskell tuples haskell list Haskell replace tuple in list of tuples - Haskell Hey guys I want to be able to replace a tuple in a list of tuples. Here is what I am thinking: I want to be able to drop any tuple, say ("rob",7) from the list and th...

[ -0.00103759765625, 0.0223388671875, 0.000614166259765625, 0.006134033203125, -0.002044677734375, -0.004241943359375, -0.0240478515625, -0.0115966796875, 0.0111083984375, 0.007659912109375, 0.004669189453125, -0.0264892578125, 0.0020294189453125, -0.0047607421875, -0.00360107421875, 0.0...

[ 91995, 370, 8705, 23, 5303, 111, 99726, 20625, 142508, 1556, 28240, 51484, 87, 3444, 19048, 47, 10, 47644, 36069, 2499, 5154, 21359, 36076, 678, 3525, 21845, 21320, 3564, 2704, 6713, 1884, 4358, 129745 ]

[ 0.1776123046875, 0.170166015625, 0.225830078125, 0.05908203125, 0.1728515625, 0.06463623046875, 0.233154296875, 0.13134765625, 0.2047119140625, 0.1116943359375, 0.0285491943359375, 0.052154541015625, 0.006195068359375, 0.08837890625, 0.07513427734375, 0.041900634765625, 0.01893615722...

embed

48709079_c0

48709079

haskell

0

Title: How to convert any type to Symbol using type families? Problem title: How to convert any type to Symbol using type families? Tags: haskell, type-families Problem: How to convert any type to Symbol using type families? I want to convert any type to type-level string using some type families. Of course, I can writ...

How to convert any type to Symbol using type families? How to convert any type to Symbol using type families? haskell type-families type How Symbol ShowType Typeable How to convert any type to Symbol using type families? I want to convert any type to type-level string using some type families. Of course, I can write so...

[ 0.002410888671875, -0.0286865234375, -0.006500244140625, 0.01214599609375, -0.02294921875, -0.0002117156982421875, -0.01483154296875, 0.00933837890625, 0.00543212890625, -0.019287109375, -0.0205078125, -0.033203125, 0.0247802734375, 0.03369140625, -0.0135498046875, 0.005523681640625, ...

[ 11249, 47, 96760, 2499, 10644, 131899, 17368, 87143, 1556, 142508, 69128, 17367, 196707, 60457, 2886, 3444, 67919, 79315, 831, 33022, 903, 32195, 144573, 191619, 11675, 6032, 53088, 3642, 191082 ]

[ 0.06036376953125, 0.1024169921875, 0.1480712890625, 0.109375, 0.2474365234375, 0.275146484375, 0.049407958984375, 0.177978515625, 0.08306884765625, 0.1865234375, 0.08489990234375, 0.09814453125, 0.2236328125, 0.1766357421875, 0.143310546875, 0.049652099609375, 0.148193359375, 0.142...

embed

60307082_c0

60307082

haskell

0

Title: Automatically running unit tests in Haskell Problem title: Automatically running unit tests in Haskell Tags: cabal, haskell Problem: Automatically running unit tests in Haskell Is there a way to run my test suites with my build command? All I can find is that I can run e.g. cabal test after cabal build . What I ...

Automatically running unit tests in Haskell Automatically running unit tests in Haskell cabal haskell Automatically Haskell Automatically running unit tests in Haskell Is there a way to run my test suites with my build command? All I can find is that I can run e.g. cabal test after cabal build . What I want is a way to...

[ 0.0126953125, 0.017822265625, 0.01544189453125, -0.01220703125, -0.00323486328125, 0.00311279296875, -0.0036468505859375, 0.007476806640625, -0.00634765625, -0.0034027099609375, -0.00445556640625, -0.00860595703125, -0.007110595703125, 0.02685546875, -0.0093994140625, 0.01055908203125,...

[ 51719, 71407, 51042, 25072, 109921, 20625, 142508, 23, 109524, 1556, 2685, 10, 3917, 11675, 3034, 14947, 7, 678, 759, 45367, 75101, 831, 7103, 3444, 191082, 3229, 29806, 11408, 35672, 33976, 98169, 12921, 26499, 60223, 79, 330, 114977, 30388,...

[ 0.180908203125, 0.045867919921875, 0.148193359375, 0.1824951171875, 0.251953125, 0.136474609375, 0.229736328125, 0.0538330078125, 0.202880859375, 0.1234130859375, 0.0180816650390625, 0.00177001953125, 0.052703857421875, 0.172607421875, 0.2335205078125, 0.17138671875, 0.00262451171875...

embed

64452881_c0

64452881

haskell

0

Title: Non-exhaustive patterns in function lookUp Problem title: Non-exhaustive patterns in function lookUp Tags: pattern-matching, haskell Problem: Non-exhaustive patterns in function lookUp I'm trying to define a function in haskell, that given a search string and a list of string/item pairs, returns the list of item...

Non-exhaustive patterns in function lookUp Non-exhaustive patterns in function lookUp pattern-matching haskell Non-exhaustive Non-exhaustive patterns in function lookUp I'm trying to define a function in haskell, that given a search string and a list of string/item pairs, returns the list of items whose associated stri...

[ -0.0126953125, 0.01458740234375, 0.00677490234375, 0.0155029296875, 0.004669189453125, 0.005157470703125, -0.005706787109375, -0.00927734375, 0.0294189453125, -0.00537109375, 0.017822265625, -0.0296630859375, 0.0152587890625, -0.002685546875, 0.01556396484375, 0.012939453125, 0.02563...

[ 3775, 3355, 18391, 4935, 103510, 32354, 6713, 53234, 23, 98753, 1556, 142508, 7, 31577, 61924, 34475, 33938, 79315, 136, 5303, 217, 195, 80836, 30646, 55769, 124901, 137272, 14858, 83279, 284, 50490, 1126, 43317, 36076, 151117, 186922, 217684, ...

[ 0.1673583984375, 0.0207366943359375, 0.1322021484375, 0.07958984375, 0.240478515625, 0.1585693359375, 0.1273193359375, 0.2032470703125, 0.0226593017578125, 0.1727294921875, 0.1168212890625, 0.2056884765625, 0.007843017578125, 0.0254058837890625, 0.124267578125, 0.023162841796875, 0.1...

embed

19984808_c0

19984808

haskell

0

Title: Meaning of (something -> do) Problem title: Meaning of (something -> do) Tags: haskell Problem: Meaning of (something -> do) I encountered following function on the Real World Haskell book: namesMatching pat | not (isPattern pat) = do exists <- doesNameExist pat return (if exists then [pat] else []) | othe...

Meaning of (something -> do) Meaning of (something -> do) haskell Meaning Meaning of (something -> do) I encountered following function on the Real World Haskell book: What does the following line mean: ("", baseName) -> do ? I have seen -> in function type signature but what does this do in this code.

[ 0.0103759765625, -0.007415771484375, 0.0021514892578125, -0.007781982421875, -0.0142822265625, 0.0267333984375, 0.007232666015625, 0.0184326171875, 0.03466796875, -0.015380859375, 0.00836181640625, -0.0174560546875, -0.0164794921875, -0.0036773681640625, -0.01300048828125, -0.008789062...

[ 1215, 11, 592, 111, 43452, 64113, 20, 1230, 5386, 54, 1556, 142508, 33079, 190647, 25632, 32354, 5120, 6661, 20625, 12877, 14602, 13315, 29459, 3647, 163612, 51592, 10644, 138256, 2367, 903, 18151 ]

[ 0.14404296875, 0.151123046875, 0.06024169921875, 0.157958984375, 0.076904296875, 0.149169921875, 0.0867919921875, 0.05023193359375, 0.169921875, 0.20654296875, 0.1097412109375, 0.192626953125, 0.197998046875, 0.0254974365234375, 0.077392578125, 0.1510009765625, 0.09503173828125, 0....

embed

42054650_c0

42054650

haskell

0

Title: Save variable and use it on recursion Problem title: Save variable and use it on recursion Tags: haskell, recursion, functional-programming Problem: Save variable and use it on recursion Suppose I have the following function printVariance :: [Float] -> IO () printVariance [] = return () printVariance (x:xs) | x ...

Save variable and use it on recursion Save variable and use it on recursion haskell recursion functional-programming Save Float x:xs Save variable and use it on recursion Suppose I have the following function Which gets a list, checks which elements are bigger than the average and prints their value - avg . My problem ...

[ -0.00457763671875, 0.000476837158203125, 0.00653076171875, 0.00469970703125, 0.00848388671875, 0.021240234375, -0.00567626953125, 0.0079345703125, 0.0260009765625, -0.023681640625, 0.0111083984375, -0.0128173828125, 0.019287109375, 0.01287841796875, 0.01202392578125, 0.012939453125, ...

[ 64944, 77336, 136, 4527, 442, 98, 195625, 1830, 1556, 142508, 123309, 28966, 38699, 257, 1022, 425, 25632, 32354, 62163, 5303, 12765, 80854, 167785, 3501, 83080, 28412, 34292, 185, 177, 2967, 65572, 11907, 29954, 831, 61924, 1660, 24145 ]

[ 0.188720703125, 0.28369140625, 0.030792236328125, 0.16650390625, 0.051727294921875, 0.08758544921875, 0.2247314453125, 0.1014404296875, 0.104248046875, 0.19384765625, 0.1468505859375, 0.096923828125, 0.158935546875, 0.048583984375, 0.03839111328125, 0.06695556640625, 0.03472900390625...

embed

55690357_c0

55690357

haskell

0

Title: Higher kinded empty constraint Problem title: Higher kinded empty constraint Tags: constraint-kinds, haskell Problem: Higher kinded empty constraint I want to have an empty constraint at a higher kind. Suppose I have the following class: class Category k where type Obj k :: * -> Constraint id :: Obj k a => a `k`...

Higher kinded empty constraint Higher kinded empty constraint constraint-kinds haskell Higher Category Obj Constraint Higher kinded empty constraint I want to have an empty constraint at a higher kind. Suppose I have the following class: Now I want to make an instance for functions such that it doesn't constrain the el...

[ 0.0096435546875, -0.01251220703125, 0.0031280517578125, -0.0069580078125, -0.00014495849609375, 0.004730224609375, -0.013916015625, -0.02099609375, 0.011474609375, -0.00994873046875, -0.0283203125, -0.03369140625, -0.01507568359375, -0.00170135498046875, -0.01116943359375, -0.013671875...

[ 19694, 56, 8562, 297, 201505, 158, 2816, 4288, 68347, 1556, 142508, 49057, 3545, 170, 1657, 3444, 765, 99, 77546, 25632, 18507, 3249, 110527, 100, 32354, 22027, 18, 73, 80854, 8337, 237 ]

[ 0.1326904296875, 0.0645751953125, 0.1572265625, 0.08355712890625, 0.2108154296875, 0.0792236328125, 0.1734619140625, 0.130615234375, 0.1427001953125, 0.102294921875, 0.2093505859375, 0.1148681640625, 0.13232421875, 0.158203125, 0.040069580078125, 0.076416015625, 0.0265655517578125, ...

embed

57258608_c0

57258608

haskell

0

Title: Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? Problem title: Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? Tags: fold, haskell Problem: Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? In Foldable t , foldMap is defined based on fol...

Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? fold haskell Can Foldable Monoid Can `foldMap f` be defined equivalently in terms of `fold/foldl` and `f`? In Foldable t , foldMap is defined based on foldr Can foldMap f b...

[ -0.01129150390625, -0.00537109375, 0.019775390625, 0.021484375, -0.0166015625, -0.007415771484375, -0.01153564453125, 0.01055908203125, 0.0023956298828125, -0.005218505859375, -0.0159912109375, -0.00714111328125, -0.00023555755615234375, 0.030029296875, -0.0027923583984375, -0.00799560...

[ 4171, 42822, 166179, 1238, 61924, 183234, 141, 420, 69407, 1556, 142508, 30077, 71, 2886, 77879, 532, 64, 808, 35509, 18344, 7569, 136, 166577, 10422, 20469 ]

[ 0.0272674560546875, 0.2135009765625, 0.2449951171875, 0.1939697265625, 0.1572265625, 0.141357421875, 0.1270751953125, 0.1602783203125, 0.0350341796875, 0.076416015625, 0.1722412109375, 0.1534423828125, 0.0921630859375, 0.1351318359375, 0.1181640625, 0.1058349609375, 0.019683837890625...

embed

57345332_c0

57345332

haskell

0

Title: pattern matching on constants Problem title: pattern matching on constants Tags: functional-programming, haskell, pattern-matching, syntax Problem: pattern matching on constants So I have these constant FilePath variables (strings) s1 , s2 , s3 , s4 ... :: Filepath s1 = "help.txt" s2 = "sljdfn" -- ... And I have...

pattern matching on constants pattern matching on constants functional-programming haskell pattern-matching syntax Filepath help.txt pattern matching on constants So I have these constant FilePath variables (strings) And I have a function that takes one of these filepaths and returns a int. However when compiling I get...

[ 0.01043701171875, 0.00457763671875, -0.00052642822265625, 0.0011749267578125, -0.00567626953125, -0.010009765625, -0.0194091796875, 0.0194091796875, 0.006103515625, -0.0164794921875, 0.0025634765625, -0.01324462890625, -0.003997802734375, 0.0019378662109375, 0.0133056640625, 0.01538085...

[ 103510, 14858, 214, 98, 53697, 7, 123309, 28966, 1556, 142508, 98753, 6002, 86531, 42724, 128405, 4358, 124326, 765, 6097, 683, 10519, 77336, 91693, 32354, 51776, 11435, 30646, 23, 18, 9969, 49725, 4842, 35405, 1631, 592, 1528, 68991, 1225, ...

[ 0.25048828125, 0.2359619140625, 0.10009765625, 0.1214599609375, 0.19677734375, 0.06390380859375, 0.1114501953125, 0.0780029296875, 0.10467529296875, 0.2052001953125, 0.226318359375, 0.0271453857421875, 0.06231689453125, 0.15234375, 0.1949462890625, 0.14111328125, 0.152587890625, 0....

embed

60030467_c0

60030467

haskell

0

Title: Example of violating the Functor rules in Haskell Problem title: Example of violating the Functor rules in Haskell Tags: haskell, functor Problem: Example of violating the Functor rules in Haskell I have a data structure for binary tree and a Functor over it data BST a = Empty | Node (BST a) a (BST a) instance F...

Example of violating the Functor rules in Haskell Example of violating the Functor rules in Haskell haskell functor Example Functor Haskell BST Empty Node Example of violating the Functor rules in Haskell I have a data structure for binary tree and a Functor over it I need to find an example of some BST instance and a ...

[ 0.01470947265625, -0.0007476806640625, 0.0000762939453125, -0.00421142578125, 0.033935546875, 0.021484375, -0.01068115234375, -0.01519775390625, 0.005096435546875, 0.000545501708984375, 0.0036468505859375, -0.030517578125, 0.0133056640625, 0.0206298828125, -0.00116729736328125, -0.0153...

[ 89536, 8705, 111, 54567, 1916, 28670, 18770, 91736, 20625, 142508, 23, 1556, 7477, 335, 8545, 31678, 939, 438, 112, 70, 2053, 45646, 2394, 6635, 53201, 645, 27781, 110527, 32354, 1238, 37379, 2481, 277, 40322, 3674 ]

[ 0.1650390625, 0.056182861328125, 0.031494140625, 0.182861328125, 0.048126220703125, 0.1572265625, 0.1951904296875, 0.1773681640625, 0.1583251953125, 0.263427734375, 0.02508544921875, 0.1285400390625, 0.1082763671875, 0.06182861328125, 0.177490234375, 0.173095703125, 0.08544921875, ...

embed

35805301_c0

35805301

haskell

0

Title: How to prevent all windows from floating (xmonad) Problem title: How to prevent all windows from floating (xmonad) Tags: haskell, xmonad Problem: How to prevent all windows from floating (xmonad) In my system, xmonad floating windows are extremely buggy. Sometimes they appear out of the screen, under main window...

How to prevent all windows from floating (xmonad) How to prevent all windows from floating (xmonad) haskell xmonad floating How How to prevent all windows from floating (xmonad) In my system, xmonad floating windows are extremely buggy. Sometimes they appear out of the screen, under main windows. They may rapidly activ...

[ 0.0035552978515625, 0.0260009765625, -0.0020294189453125, -0.021728515625, 0.02978515625, 0.0191650390625, 0.00799560546875, -0.0302734375, -0.0098876953125, -0.046875, 0.0028228759765625, -0.00860595703125, 0.01190185546875, 0.00958251953125, -0.00830078125, -0.0028533935546875, 0.0...

[ 11249, 47, 56282, 756, 54825, 1295, 21917, 26518, 425, 3796, 712, 1556, 142508, 1022, 5426, 111531, 373, 67192, 160193, 108975, 1810, 49119, 1379, 5201, 25545, 34704, 111438, 4092, 731, 69201, 18158, 98, 37772, 11907, 76896, 237, 3638, 2837, ...

[ 0.0440673828125, 0.035919189453125, 0.199462890625, 0.14013671875, 0.1968994140625, 0.10498046875, 0.191162109375, 0.16748046875, 0.038055419921875, 0.107177734375, 0.174560546875, 0.07037353515625, 0.1910400390625, 0.055419921875, 0.03436279296875, 0.060333251953125, 0.0395202636718...

embed

29432947_c0

29432947

haskell

0

Title: Is there instance Alternative ((->) r)? Problem title: Is there instance Alternative ((->) r)? Tags: haskell, alternative-functor Problem: Is there instance Alternative ((->) r)? I got accustomed to using a <> b where a and b take arguments. > const ["a"] <> const ["b"] $ True ["a","b"] Why there is no a <...

Is there instance Alternative ((->) r)? Is there instance Alternative ((->) r)? haskell alternative-functor a Alternative Bool Is there instance Alternative ((->) r)? I got accustomed to using a <> b where a and b take arguments. Why there is no a <|> b as well?

[ 0.0146484375, -0.0012664794921875, 0.024658203125, 0.01019287109375, 0.00022792816162109375, 0.01019287109375, -0.021728515625, -0.0067138671875, -0.0047607421875, 0.00025177001953125, -0.01904296875, 0.024658203125, 0.00958251953125, 0.0250244140625, 0.01239013671875, -0.01953125, 0...

[ 2071, 2685, 110527, 103905, 60494, 9, 1230, 5386, 1690, 1556, 142508, 30700, 16498, 18770, 10, 2460, 929, 103607, 16, 4163, 61689, 2785, 4806, 17368, 4426, 2740, 876, 7440, 136, 5646, 10750, 44084, 83, 110, 58745, 5299 ]

[ 0.055450439453125, 0.09326171875, 0.265869140625, 0.2337646484375, 0.0872802734375, 0.0877685546875, 0.07275390625, 0.114990234375, 0.1533203125, 0.1383056640625, 0.243408203125, 0.2227783203125, 0.1131591796875, 0.14208984375, 0.0811767578125, 0.1083984375, 0.1881103515625, 0.1555...

embed

4232511_c0

4232511

haskell

0

Title: 'm a' vs 'm ()' in guard Problem title: 'm a' vs 'm ()' in guard Tags: haskell, monads Problem: 'm a' vs 'm ()' in guard guard :: (MonadPlus m) => Bool -> m () guard True = return () guard False = mzero Prelude Control.Monad> :t mzero mzero :: (MonadPlus m) => m a In the F...

'm a' vs 'm ()' in guard 'm a' vs 'm ()' in guard haskell monads MonadPlus Bool Prelude Control.Monad Maybe 'm a' vs 'm ()' in guard In the False branch of guard , the type of mzero is m a , but the return type of guard has been specified as m () . Hence I don't quite get it why ...

[ 0.005157470703125, 0.01312255859375, 0.0184326171875, 0.00323486328125, 0.01507568359375, -0.0086669921875, -0.007110595703125, -0.00823974609375, 0.0029754638671875, 0.0019989013671875, 0.00421142578125, -0.0274658203125, -0.0159912109375, -0.0091552734375, 0.00909423828125, -0.002853...

[ 3768, 39, 10, 74, 20209, 15, 23, 56050, 1556, 142508, 2667, 712, 60331, 71, 88225, 2460, 929, 1914, 822, 112, 27131, 46674, 83425, 22225, 184, 32845, 206, 10644, 347, 80510, 83, 30646, 111, 58735, 237, 15400, 9969, 34759, 23742, 18, 186...

[ 0.114501953125, 0.1859130859375, 0.1898193359375, 0.0228271484375, 0.2327880859375, 0.05938720703125, 0.092529296875, 0.291015625, 0.079345703125, 0.1923828125, 0.06927490234375, 0.09149169921875, 0.114501953125, 0.050567626953125, 0.1744384765625, 0.0224151611328125, 0.1163330078125...

embed

47157748_c0

47157748

haskell

0

Title: List of functions applying to argument Problem title: List of functions applying to argument Tags: haskell Problem: List of functions applying to argument Task is to make function, taking list of unary functions (+1,*2 etc.) (3 at least) and consistently applying them to argument. For example: func 1 [(+1),(+1),...

List of functions applying to argument List of functions applying to argument haskell List List of functions applying to argument Task is to make function, taking list of unary functions (+1,*2 etc.) (3 at least) and consistently applying them to argument. For example: func 1 [(+1),(+1),(/2)] == 1.5. Here's what i made...

[ -0.0162353515625, 0.011474609375, 0.0098876953125, 0.004791259765625, -0.01495361328125, 0.00372314453125, -0.00860595703125, 0.0191650390625, 0.0115966796875, -0.024169921875, -0.002410888671875, -0.025634765625, 0.0201416015625, 0.033447265625, 0.00885009765625, -0.003997802734375, ...

[ 32036, 32354, 7, 59911, 214, 47, 10750, 1556, 142508, 9598, 92, 83, 3249, 35971, 5303, 220, 1294, 21748, 1639, 304, 6896, 19713, 74729, 27781, 7477, 238, 106, 12477, 69112, 22410, 7228, 3642, 831, 243131, 111, 38937, 86171, 1286, 138, 296...

[ 0.17822265625, 0.26220703125, 0.10455322265625, 0.1331787109375, 0.04058837890625, 0.08624267578125, 0.28466796875, 0.143310546875, 0.237060546875, 0.1663818359375, 0.0712890625, 0.013580322265625, 0.09613037109375, 0.0667724609375, 0.1773681640625, 0.117919921875, 0.0948486328125, ...

embed

33361100_c1

33361100

haskell

1

: let val = convert testfunc1 [VInteger 3, VInteger 5] :: Maybe Value And this, which is my usecase, doesn't either: funclist :: Monad m => [ [Value] -> m Value ] funclist = [ convert testfunc1 ] The error is: No instance for (GHC.Base.Monad m1) arising from a use of ‘Main.testfunc1’ The type variable ‘m1’ is ambiguous...

[ -0.0194091796875, -0.0242919921875, 0.00029754638671875, 0.01409912109375, 0.00933837890625, 0.00640869140625, -0.0012359619140625, -0.007537841796875, 0.01202392578125, -0.023681640625, 0.0012969970703125, -0.01019287109375, -0.005859375, -0.016357421875, 0.00098419189453125, -0.02038...

[ 2633, 3502, 96760, 3034, 16498, 238, 418, 11839, 1479, 1505, 138, 5947, 190, 83425, 190060, 4527, 58437, 22027, 18, 40101, 7477, 6562, 60331, 71, 347, 856, 50770, 18499, 438, 110527, 100, 41877, 441, 63473, 46674, 712, 17727, 187, 72219, ...

[ 0.113037109375, 0.212890625, 0.1761474609375, 0.182861328125, 0.164306640625, 0.06982421875, 0.122802734375, 0.043243408203125, 0.1190185546875, 0.1614990234375, 0.1014404296875, 0.06982421875, 0.1082763671875, 0.19091796875, 0.212890625, 0.080322265625, 0.047943115234375, 0.006439...

embed

60572738_c0

60572738

haskell

0

Title: How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? Problem title: How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? Tags: haskell, option-type, monads Pro...

How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? How do I subtract Maybe values in Haskell? For example, if I want to subtract Just 8 - Just 5 to get Just 3, how would I do that? haskell option-type monads How Maybe Haskell Just How do I s...

[ -0.013427734375, 0.004425048828125, 0.0244140625, 0.00787353515625, -0.01007080078125, 0.01116943359375, 0.006744384765625, 0.0093994140625, 0.000957489013671875, 0.0220947265625, -0.015869140625, -0.000179290771484375, -0.009521484375, 0.0191650390625, 0.00086212158203125, -0.00793457...

[ 11249, 1614, 39989, 18, 83425, 142424, 20625, 142508, 3444, 9563, 382, 190, 138, 3642, 23, 1556, 35829, 50986, 2667, 712, 54, 87, 27781, 20, 2046, 2806, 25632 ]

[ 0.06549072265625, 0.14501953125, 0.16796875, 0.07177734375, 0.30908203125, 0.2186279296875, 0.137939453125, 0.259521484375, 0.0743408203125, 0.1214599609375, 0.181396484375, 0.1624755859375, 0.1634521484375, 0.032135009765625, 0.04229736328125, 0.0997314453125, 0.1358642578125, 0.0...

embed

17674991_c0

17674991

haskell

0

Title: Is there a patten match with Writer Monad in Haskell? Problem title: Is there a patten match with Writer Monad in Haskell? Tags: haskell, monads Problem: Is there a patten match with Writer Monad in Haskell? What is correct way to do pattern match with Writer Monad in Haskell? I want to do like following... impo...

Is there a patten match with Writer Monad in Haskell? Is there a patten match with Writer Monad in Haskell? haskell monads Control.Monad.Writer Writer Monad Haskell WriterT Writer.Identity Is there a patten match with Writer Monad in Haskell? What is correct way to do pattern match with Writer Monad in Haskell? I want ...

[ -0.03466796875, 0.0181884765625, 0.0003108978271484375, 0.003692626953125, -0.0125732421875, -0.01251220703125, -0.01385498046875, -0.002197265625, -0.00335693359375, 0.0159912109375, 0.01104736328125, 0.0054931640625, 0.0108642578125, -0.006805419921875, 0.007232666015625, -0.00704956...

[ 2071, 2685, 10, 2340, 510, 14858, 678, 601, 2783, 56, 60331, 71, 23, 20625, 142508, 1556, 2667, 712, 27131, 46674, 1456, 618, 568, 37379, 2481, 26785, 3917, 47, 54, 103510, 25632, 60212, 17721, 136, 5, 196219, 16454 ]

[ 0.038726806640625, 0.07440185546875, 0.05645751953125, 0.142822265625, 0.1878662109375, 0.2294921875, 0.1236572265625, 0.06427001953125, 0.20361328125, 0.164306640625, 0.199462890625, 0.151123046875, 0.0628662109375, 0.138671875, 0.25048828125, 0.110107421875, 0.0865478515625, 0.13...

embed

26252289_c1

26252289

haskell

1

isson functions for each nested container. Since containers are f1 (f2 (f3 ... (fN a)...) then, criteria could/should be provided as By comparer1 (By comparer2 (By ... . But may be better other approach, of course. moreover, probably exists a better "Haskell approach" BUT I wish (if possible) Exists some direct solutio...

[ 0.00445556640625, -0.007232666015625, -0.0086669921875, -0.0196533203125, 0.01153564453125, -0.0091552734375, 0.0196533203125, -0.00946044921875, 0.020751953125, -0.0228271484375, -0.010009765625, 0.00933837890625, 0.00701904296875, 0.013916015625, 0.01019287109375, -0.02685546875, -...

[ 17, 4503, 32354, 7, 100, 12638, 8512, 71, 116419, 621, 1238, 418, 420, 304, 363, 839, 10, 55738, 11, 5809, 11412, 62952, 237, 3311, 37397, 56, 75358, 11522, 51515, 31895, 32316, 6495, 142508, 151654, 32599, 7722, 5443, 8951, 29806, 759, ...

[ 0.1832275390625, 0.26220703125, 0.1905517578125, 0.058837890625, 0.058441162109375, 0.1297607421875, 0.2264404296875, 0.1221923828125, 0.270751953125, 0.0198822021484375, 0.078857421875, 0.06298828125, 0.05877685546875, 0.08575439453125, 0.07916259765625, 0.053985595703125, 0.0734252...

embed

39721081_c0

39721081

haskell

0

Title: Performing operations on custom data types? Problem title: Performing operations on custom data types? Tags: types, haskell Problem: Performing operations on custom data types? I have the following data type: data Users = Height Int | Age Int I then have a list of ages: myList = [Age 44, Age 54, Age 21, Age 34, ...

Performing operations on custom data types? Performing operations on custom data types? types haskell a Performing Users Height Age Num Performing operations on custom data types? I have the following data type: I then have a list of ages: Which I want to apply to this function: However this causes the following error:...

[ -0.002838134765625, -0.0106201171875, 0.007354736328125, 0.007598876953125, -0.01385498046875, 0.0169677734375, -0.005157470703125, -0.0023345947265625, 0.0203857421875, -0.0267333984375, 0.0048828125, -0.034912109375, 0.0115966796875, -0.0084228515625, -0.00286865234375, -0.0196533203...

[ 169033, 214, 41018, 7, 98, 114122, 2053, 52895, 32, 1556, 142508, 10, 53400, 1529, 22553, 72944, 52782, 70, 25632, 10644, 7068, 765, 5303, 4188, 3444, 47, 59911, 903, 32354, 33306, 113660, 18499, 11249, 831, 3249, 4488, 3871, 84797, 284, ...

[ 0.1658935546875, 0.076904296875, 0.183837890625, 0.0621337890625, 0.1387939453125, 0.240478515625, 0.1346435546875, 0.2264404296875, 0.014007568359375, 0.170166015625, 0.2476806640625, 0.1104736328125, 0.1768798828125, 0.1787109375, 0.1451416015625, 0.17724609375, 0.15625, 0.010101...

embed

52891362_c0

52891362

haskell

0

Title: Empty List of specific type in Haskell Problem title: Empty List of specific type in Haskell Tags: haskell Problem: Empty List of specific type in Haskell I need to create an empty list of specific type. I am creating a stack which in internally a list. To create empty stack I need to pass empty list. But how ca...

Empty List of specific type in Haskell Empty List of specific type in Haskell haskell Empty List Haskell Stack Show MyName Empty List of specific type in Haskell I need to create an empty list of specific type. I am creating a stack which in internally a list. To create empty stack I need to pass empty list. But how ca...

[ 0.0034942626953125, 0.000007212162017822266, 0.0011749267578125, 0.0115966796875, -0.00933837890625, 0.00665283203125, -0.0076904296875, -0.013427734375, -0.000179290771484375, 0.0064697265625, -0.0028228759765625, -0.03515625, 0.000736236572265625, 0.004119873046875, -0.0159912109375, ...

[ 31678, 939, 32036, 29458, 10644, 20625, 142508, 111, 23, 1556, 6512, 2594, 17367, 2646, 163612, 3871, 28282, 201505, 5303, 105233, 177261, 70796, 27875, 3642, 175399, 360, 18, 37842, 12, 4153, 3789, 162515, 1620, 27853, 110, 36272, 9615 ]

[ 0.1942138671875, 0.1429443359375, 0.2086181640625, 0.2213134765625, 0.17333984375, 0.1436767578125, 0.2239990234375, 0.06201171875, 0.04266357421875, 0.1326904296875, 0.0960693359375, 0.08050537109375, 0.117919921875, 0.10321044921875, 0.149658203125, 0.04327392578125, 0.114501953125...

embed

7768066_c0

7768066

haskell

0

Title: How do you define state in Haskell? Problem title: How do you define state in Haskell? Tags: haskell, state Problem: How do you define state in Haskell? How do you define state in Haskell? My first idea was to use algebraic data types. I've also heard about the state monad, but I don't really know what it is. As...

How do you define state in Haskell? How do you define state in Haskell? haskell state How Haskell How do you define state in Haskell? How do you define state in Haskell? My first idea was to use algebraic data types. I've also heard about the state monad, but I don't really know what it is. As an example, lets use Texa...

[ -0.011962890625, 0.003936767578125, 0.007598876953125, 0.007110595703125, 0.000782012939453125, 0.006378173828125, -0.0208740234375, -0.0024566650390625, 0.000713348388671875, -0.01300048828125, -0.0047607421875, 0.002532958984375, -0.01190185546875, 0.027099609375, -0.01904296875, -0....

[ 11249, 61924, 11341, 23, 20625, 142508, 1556, 6528, 4527, 429, 2844, 2053, 52895, 49782, 2667, 712, 83, 27781, 31464, 16401, 195, 25600, 33636, 117249, 6626, 126381, 44540, 45443, 61972, 92865, 8108, 831, 42822, 12765, 1600, 1022, 138804, 154...

[ 0.052276611328125, 0.197509765625, 0.24267578125, 0.076171875, 0.1424560546875, 0.248779296875, 0.1295166015625, 0.0428466796875, 0.0171051025390625, 0.0220794677734375, 0.03582763671875, 0.0987548828125, 0.1256103515625, 0.0086669921875, 0.092041015625, 0.1456298828125, 0.0034790039...

embed

56993991_c1

56993991

haskell

1

tnf <- program output Output when executed after compilation: 1 <- user has to input before the console is printed out Hello world <--┘ 2 <--┘ Would you like to encrypt (1) or decrypt (2)? Enter code for encryption: Enter key for the code: Encrypted message: Jgnnq"yqtnf Is there something about putStrLn and putStr that...

[ 0.016845703125, -0.0010223388671875, -0.0205078125, 0.00052642822265625, -0.004302978515625, 0.01214599609375, 0.0150146484375, -0.004852294921875, 0.0025482177734375, -0.01361083984375, 0.0005035400390625, -0.0172119140625, -0.00167083740234375, 0.01361083984375, -0.020263671875, 0.00...

[ 808, 19, 420, 1528, 140992, 13538, 7077, 3229, 71924, 7103, 98352, 106, 38937, 1556, 107730, 8108, 130250, 28412, 1810, 35378, 8999, 246429, 116, 154559, 1884, 22, 136791, 707, 8, 1737, 60816, 18151, 22799, 357, 26008, 821, 10713, 864, 3884...

[ 0.011016845703125, 0.1087646484375, 0.15380859375, 0.156005859375, 0.2099609375, 0.126953125, 0.061614990234375, 0.0174407958984375, 0.16357421875, 0.07489013671875, 0.1722412109375, 0.026763916015625, 0.09381103515625, 0.02197265625, 0.1387939453125, 0.06390380859375, 0.177001953125...

embed

23205289_c0

23205289

haskell

0

Title: Why can't ++ be used in pattern matching? Problem title: Why can't ++ be used in pattern matching? Tags: pattern-matching, haskell, list Problem: Why can't ++ be used in pattern matching? From LearnYouAHaskell: One more thing — you can't use ++ in pattern matches. If you tried to pattern match against ...

Why can't ++ be used in pattern matching? Why can't ++ be used in pattern matching? pattern-matching haskell list Why Why can't ++ be used in pattern matching? From LearnYouAHaskell: I'm struggling to reason about what he means by the nature of lists why this can't be.

[ -0.0152587890625, 0.01263427734375, 0.029052734375, -0.00286865234375, -0.008544921875, 0.01953125, -0.00506591796875, -0.0035552978515625, 0.0224609375, -0.0184326171875, 0.0115966796875, -0.023681640625, 0.0189208984375, -0.002471923828125, -0.00173187255859375, -0.00099945068359375,...

[ 44084, 831, 3768, 18, 37223, 11814, 23, 103510, 14858, 214, 98753, 1556, 142508, 5303, 186, 134031, 23562, 162, 237875, 31635, 764, 26950, 15400, 903 ]

[ 0.09942626953125, 0.12109375, 0.02557373046875, 0.10028076171875, 0.2666015625, 0.1185302734375, 0.0457763671875, 0.211181640625, 0.2027587890625, 0.083984375, 0.1993408203125, 0.1036376953125, 0.1634521484375, 0.1309814453125, 0.046875, 0.003326416015625, 0.010009765625, 0.0153045...

embed

8510570_c0

8510570

haskell

0

Title: Restricting values in type constructors Problem title: Restricting values in type constructors Tags: haskell Problem: Restricting values in type constructors Possible Duplicate: How to create a type bounded within a certain range I have the data type: data Expr = Num Int | Expression Expr Operator Expr In the co...

Restricting values in type constructors Restricting values in type constructors haskell Restricting Expr Num Expression Operator Restricting values in type constructors I have the data type: In the context of the problem, the numbers that (Num Int) will represent are single digit only. Is there a way to ensure that res...

[ -0.0224609375, -0.015625, 0.0089111328125, -0.00506591796875, 0.00714111328125, 0.01361083984375, -0.0130615234375, 0.008544921875, 0.00165557861328125, 0.006988525390625, -0.00732421875, -0.03271484375, 0.0101318359375, -0.005035400390625, -0.005401611328125, 0.01080322265625, -0.00...

[ 853, 144225, 214, 142424, 10644, 64549, 25251, 1556, 142508, 60075, 42, 52782, 25129, 150922, 23, 2053, 43701, 2967, 101935, 839, 316, 360, 18, 1221, 33636, 621, 11001, 153939, 4734, 3917, 63284, 185190, 28032, 21635, 6619, 5809, 61924, 32354...

[ 0.112060546875, 0.228759765625, 0.03460693359375, 0.18798828125, 0.2218017578125, 0.1915283203125, 0.138916015625, 0.11083984375, 0.1923828125, 0.1148681640625, 0.1328125, 0.1473388671875, 0.1571044921875, 0.1781005859375, 0.00799560546875, 0.0816650390625, 0.034637451171875, 0.058...

embed

30022129_c1

30022129

haskell

1

statement in Haskell? The following code is supposed to take in the y variable, to set some variable x to a constant, and then to check if y is greater or lesser than 0 before doing a specific task if it is or isn't. This compiles. plus_or_double :: Double -> Double plus_or_double y = let { x = 2; } in case ( y>= 0 ) ...

[ -0.012451171875, -0.000431060791015625, -0.016845703125, -0.010009765625, 0.0294189453125, 0.01007080078125, 0.004119873046875, 0.002960205078125, 0.015869140625, 0.015380859375, 0.004364013671875, 0.00113677978515625, -0.0091552734375, -0.02294921875, 0.017822265625, 0.01141357421875,...

[ 63805, 23, 20625, 142508, 32, 25632, 18151, 134598, 5646, 113, 77336, 5423, 1022, 47, 53697, 12765, 2174, 83, 117396, 707, 199, 2189, 757, 8108, 29458, 66211, 56112, 18, 9969, 1340, 1001, 748, 21555, 2661, 107172, 2203, 2633, 116, 7225, 2...

[ 0.250244140625, 0.072265625, 0.17236328125, 0.281982421875, 0.0176849365234375, 0.08416748046875, 0.16650390625, 0.111572265625, 0.05712890625, 0.1461181640625, 0.1998291015625, 0.10003662109375, 0.07391357421875, 0.04730224609375, 0.144775390625, 0.1695556640625, 0.1611328125, 0.0...

embed

16346293_c1

16346293

haskell

1

result: undefined :: Container LotsOfStrings But if I ask for the Replicate d version, ghci> :t undefined :: Container (Replicate (Succ (Succ (Succ (Succ (Succ Zero))))) String) ghci substitutes in for the type family when it didn't do that for the type synonym: :: Container ((':) * [Char] ((':) * [Char] ((':) * [Char...

[ -0.0125732421875, 0.001007080078125, -0.00927734375, 0.0306396484375, -0.025146484375, -0.00174713134765625, 0.01470947265625, 0.0020904541015625, 0.00335693359375, 0.024658203125, -0.0174560546875, -0.039794921875, 0.0045166015625, 0.0162353515625, -0.016845703125, -0.0093994140625, ...

[ 16750, 9232, 5983, 297, 1984, 34749, 20037, 50462, 132887, 71713, 5180, 26458, 853, 52721, 67, 104, 11389, 31380, 318, 18, 4332, 14168, 10060, 83947, 23351, 214, 161740, 23, 10644, 14449, 164661, 84068, 167089, 44084, 6226, 1830, 28864, 26073...

[ 0.078369140625, 0.0980224609375, 0.181884765625, 0.0494384765625, 0.063720703125, 0.196533203125, 0.2025146484375, 0.104736328125, 0.116943359375, 0.1329345703125, 0.0784912109375, 0.0078125, 0.02215576171875, 0.180419921875, 0.093994140625, 0.10546875, 0.11669921875, 0.12048339843...

embed

52795764_c0

52795764

haskell

0

Title: Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml Problem title: Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml Tags: haskell, haskell-stack Problem: Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml I am using...

Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml haskell haskell-stack Can stack.yaml Can I omit or specify a "dummy" value for 'resolver' in my stack.yaml I am using stack.yaml files in co...

[ -0.0089111328125, -0.000850677490234375, 0.0120849609375, -0.01611328125, -0.002349853515625, -0.021484375, 0.00970458984375, -0.0118408203125, -0.000308990478515625, 0.0216064453125, -0.0086669921875, 0.01470947265625, -0.01318359375, -0.00421142578125, -0.0079345703125, 0.02026367187...

[ 4171, 171, 217, 707, 40140, 18929, 10863, 1176, 34292, 3768, 107, 86918, 42, 177261, 14520, 141, 1556, 142508, 590, 2594, 5, 102158, 58735, 4210, 58061, 22799, 11343, 124962, 15824, 68034, 13373, 306, 36510, 11435, 959, 107003 ]

[ 0.06707763671875, 0.1444091796875, 0.123291015625, 0.0295257568359375, 0.1773681640625, 0.03631591796875, 0.1632080078125, 0.2059326171875, 0.1502685546875, 0.0704345703125, 0.0748291015625, 0.1890869140625, 0.140380859375, 0.19970703125, 0.1707763671875, 0.1451416015625, 0.063781738...

embed

19761498_c0

19761498

haskell

0

Title: How do I constrain QuickCheck when using type synonyms? Problem title: How do I constrain QuickCheck when using type synonyms? Tags: haskell, quickcheck, types Problem: How do I constrain QuickCheck when using type synonyms? I am using QuickCheck to run arbitrary test cases on my code. However, in one portion of...

How do I constrain QuickCheck when using type synonyms? How do I constrain QuickCheck when using type synonyms? haskell quickcheck types type How QuickCheck Vector Double How do I constrain QuickCheck when using type synonyms? I am using QuickCheck to run arbitrary test cases on my code. However, in one portion of my c...

[ -0.0223388671875, 0.019287109375, -0.0159912109375, 0.00830078125, -0.001495361328125, -0.000194549560546875, -0.007080078125, -0.015380859375, -0.00433349609375, -0.0189208984375, -0.0189208984375, -0.01239013671875, 0.00244140625, 0.0003757476806640625, -0.01434326171875, -0.00341796...

[ 11249, 158, 2816, 73, 89038, 202567, 17368, 10644, 164661, 7, 1556, 142508, 63773, 78292, 52895, 2609, 18770, 107172, 61799, 3034, 50218, 18151, 126826, 10846, 32354, 26946, 14012, 107730, 64209, 91, 5701, 140909, 4734, 139392, 5303, 653 ]

[ 0.012298583984375, 0.06341552734375, 0.1407470703125, 0.08154296875, 0.119140625, 0.2578125, 0.013519287109375, 0.18994140625, 0.1796875, 0.0111083984375, 0.070556640625, 0.1583251953125, 0.0838623046875, 0.2117919921875, 0.162353515625, 0.1220703125, 0.1319580078125, 0.13232421875...

embed

76200909_c1

76200909

haskell

1

of ‘parseUnique’ from the context: Applicative f bound by the instance declaration at src/FormInput.hs:41:10-51 Possible fix: add (FromHttpApiData a) to the context of a type expected by the context: forall a. Const Text a -> Either Text (f a) Is it possible to fix that? I kinda feel it's not, mainly because the foral...

[ -0.01068115234375, 0.024658203125, 0.004425048828125, -0.01470947265625, 0.01416015625, 0.00469970703125, -0.00250244140625, -0.016845703125, 0.021240234375, -0.031494140625, -0.01263427734375, -0.0035400390625, 0.017822265625, 0.02685546875, -0.003814697265625, 0.0019989013671875, -...

[ 111, 2500, 184, 1062, 45602, 1295, 43701, 5659, 11048, 4935, 1238, 99091, 390, 110527, 21635, 19437, 102973, 4153, 7077, 5, 127, 31982, 15110, 11703, 115861, 30022, 15190, 168407, 3062, 254, 1434, 137989, 10, 47, 10644, 84751, 100, 5584, 16...

[ 0.0953369140625, 0.159912109375, 0.10546875, 0.1712646484375, 0.282958984375, 0.06964111328125, 0.2415771484375, 0.1429443359375, 0.1810302734375, 0.1429443359375, 0.1866455078125, 0.197021484375, 0.0200042724609375, 0.2060546875, 0.1728515625, 0.1036376953125, 0.1878662109375, 0.0...

embed

43813303_c0

43813303

haskell

0

Title: Looking for the name of a special map function Problem title: Looking for the name of a special map function Tags: haskell Problem: Looking for the name of a special map function I'm new to Haskell and looking for the name of a function (or generally, the name of the concept) that acts as such: The function take...

Looking for the name of a special map function Looking for the name of a special map function haskell Looking Looking for the name of a special map function I'm new to Haskell and looking for the name of a function (or generally, the name of the concept) that acts as such: The function takes two arguments: 1. A list of...

[ 0.0113525390625, 0.0045166015625, 0.01214599609375, -0.00933837890625, -0.015625, 0.0311279296875, 0.004669189453125, 0.0003795623779296875, 0.0087890625, 0.013427734375, -0.004608154296875, -0.0142822265625, -0.00543212890625, 0.0033416748046875, -0.0034637451171875, 0.00439453125, ...

[ 157268, 100, 9351, 111, 5361, 22288, 32354, 1556, 142508, 3525, 47, 20625, 16487, 137567, 23755, 27992, 237, 6044, 51776, 6626, 10750, 615, 5303, 80854, 618, 787, 10, 384, 30646, 83425, 345, 140992, 28960, 4263, 756, 23, 31384, 1062, 90825,...

[ 0.1180419921875, 0.095703125, 0.1607666015625, 0.010589599609375, 0.213134765625, 0.2454833984375, 0.27001953125, 0.1422119140625, 0.258544921875, 0.0928955078125, 0.06695556640625, 0.1363525390625, 0.10113525390625, 0.0625, 0.1824951171875, 0.099853515625, 0.0154266357421875, 0.06...

embed

4839615_c0

4839615

haskell

0

Title: Pattern matching of nested list in Haskell Problem title: Pattern matching of nested list in Haskell Tags: haskell Problem: Pattern matching of nested list in Haskell I want to use nested lists of nestedness 2 to represent matrix (e.g. [[1,2,3],[4,5,6]] ). How would I define a function that process small submatr...

Pattern matching of nested list in Haskell Pattern matching of nested list in Haskell haskell Pattern Haskell a1:a2:a b1:b2:b Pattern matching of nested list in Haskell I want to use nested lists of nestedness 2 to represent matrix (e.g. [[1,2,3],[4,5,6]] ). How would I define a function that process small submatrices ...

[ -0.02734375, 0.00787353515625, 0.0128173828125, 0.00439453125, 0.0108642578125, 0.025146484375, -0.0184326171875, 0.0098876953125, 0.0216064453125, 0.0145263671875, 0.02197265625, -0.01287841796875, 0.0181884765625, -0.005767822265625, -0.0191650390625, -0.0203857421875, 0.0213623046...

[ 9876, 22766, 14858, 214, 8512, 71, 5303, 20625, 142508, 111, 23, 1556, 10, 82825, 11, 304, 876, 275, 12, 3444, 4527, 7432, 116, 33636, 50944, 425, 133063, 96386, 617, 104629, 61924, 32354, 9433, 19336, 1614, 192, 19077, 1639, 10461, 84751...

[ 0.1864013671875, 0.14306640625, 0.23828125, 0.03753662109375, 0.262939453125, 0.12158203125, 0.196533203125, 0.157958984375, 0.2362060546875, 0.006561279296875, 0.0304718017578125, 0.150634765625, 0.0328369140625, 0.07373046875, 0.01025390625, 0.12158203125, 0.07354736328125, 0.066...

embed

8697394_c0

8697394

haskell

0

Title: Haskell line won't execute: do { n <- readLn ; print (n^2) } Problem title: Haskell line won't execute: do { n <- readLn ; print (n^2) } Tags: linux, haskell Problem: Haskell line won't execute: do { n <- readLn ; print (n^2) } I've been following a Learn Haskell in 10 Minutes tutorial. Everythin...

Haskell line won't execute: do { n <- readLn ; print (n^2) } Haskell line won't execute: do { n <- readLn ; print (n^2) } linux haskell Haskell Haskell line won't execute: do { n <- readLn ; print (n^2) } I've been following a Learn Haskell in 10 Minutes tutorial. Everything was going well until I reach...

[ -0.013916015625, 0.00823974609375, 0.0101318359375, 0.00341796875, 0.00482177734375, 0.021484375, 0.004608154296875, -0.004150390625, 0.005859375, -0.031982421875, -0.005279541015625, -0.031494140625, -0.01007080078125, -0.01385498046875, -0.007080078125, 0.002349853515625, -0.007476...

[ 20625, 142508, 13315, 23742, 3768, 18, 71924, 13, 54, 653, 1277, 12301, 866, 19, 28412, 8353, 10461, 11508, 6077, 1556, 10666, 4426, 9, 25632, 134031, 209, 136043, 57143, 23, 31380, 318, 53273, 23474, 18499, 109524, 20600, 5775, 31, 116890,...

[ 0.1558837890625, 0.274169921875, 0.15625, 0.1171875, 0.0802001953125, 0.1185302734375, 0.2188720703125, 0.0782470703125, 0.0869140625, 0.10430908203125, 0.0161895751953125, 0.2056884765625, 0.1136474609375, 0.129150390625, 0.180419921875, 0.0648193359375, 0.1666259765625, 0.0322265...

embed

9243915_c0

9243915

haskell

0

Title: Function gets four arguments instead of three - why doesn't this break? Problem title: Function gets four arguments instead of three - why doesn't this break? Tags: haskell Problem: Function gets four arguments instead of three - why doesn't this break? Reading "Real World Haskell", on page 95 the auth...

Function gets four arguments instead of three - why doesn't this break? Function gets four arguments instead of three - why doesn't this break? haskell Function gets four arguments instead of three - why doesn't this break? Reading "Real World Haskell", on page 95 the author provides an example: My question i...

[ -0.0081787109375, 0.001068115234375, -0.005340576171875, -0.012451171875, -0.0003948211669921875, 0.0179443359375, -0.00982666015625, 0.005859375, 0.01220703125, -0.035400390625, 0.0027008056640625, -0.003448486328125, -0.006988525390625, 0.0032196044921875, 0.01287841796875, -0.006134...

[ 28670, 10763, 62163, 22759, 10750, 7, 64457, 17262, 15400, 22027, 3768, 18, 903, 36356, 1556, 142508, 104951, 68996, 6661, 20625, 9199, 27781, 44084, 18151, 9969, 1340, 18344, 7569, 51776, 4734, 3688, 115081, 29954, 3447, 1022, 97, 4488, 1055...

[ 0.172119140625, 0.143798828125, 0.072265625, 0.2274169921875, 0.252197265625, 0.108154296875, 0.1151123046875, 0.15185546875, 0.1287841796875, 0.110595703125, 0.043670654296875, 0.119384765625, 0.06878662109375, 0.2000732421875, 0.12451171875, 0.23291015625, 0.000244140625, 0.08624...

embed

7024248_c0

7024248

haskell

0

Title: Monads at the prompt? Problem title: Monads at the prompt? Tags: haskell, ghci Problem: Monads at the prompt? Is it possible to interact with arbitrary Monad instances incrementally at the GHCi prompt? You can enter "do" commands interactively: Prelude> x <- return 5 But as far as I can tell, everything is force...

Monads at the prompt? Monads at the prompt? haskell ghci Monads Prelude Monads at the prompt? Is it possible to interact with arbitrary Monad instances incrementally at the GHCi prompt? You can enter "do" commands interactively: But as far as I can tell, everything is forced into the IO () Monad. What if I want to inte...

[ -0.01226806640625, 0.012451171875, 0.01446533203125, 0.015869140625, -0.0108642578125, 0.0126953125, 0.001556396484375, -0.000009417533874511719, -0.0179443359375, -0.039794921875, -0.007598876953125, -0.0272216796875, -0.0135498046875, -0.0045166015625, 0.0031890869140625, 0.002334594...

[ 60331, 6468, 99, 70, 105876, 1556, 142508, 31380, 318, 1914, 822, 2071, 7722, 78974, 678, 61799, 1294, 71, 110527, 145322, 12097, 527, 73265, 14, 831, 30957, 246, 75101, 212398, 26818, 168861, 3934, 17780, 3444, 64457, 33022, 64194, 944, 46...

[ 0.227294921875, 0.18310546875, 0.0845947265625, 0.008087158203125, 0.24267578125, 0.07928466796875, 0.2247314453125, 0.08489990234375, 0.13427734375, 0.010223388671875, 0.1134033203125, 0.01971435546875, 0.1026611328125, 0.1898193359375, 0.0904541015625, 0.1209716796875, 0.0076599121...

embed

56717648_c0

56717648

haskell

0

Title: Haskell gets confused with horizontal lines Problem title: Haskell gets confused with horizontal lines Tags: function, guard-clause, haskell, syntax, definition Problem: Haskell gets confused with horizontal lines I tried to practice haskell a bit but I didn't get the following code to work: rems :: Int -> [Int]...

Haskell gets confused with horizontal lines Haskell gets confused with horizontal lines function guard-clause haskell syntax definition Haskell x:xs Haskell gets confused with horizontal lines I tried to practice haskell a bit but I didn't get the following code to work: This function removes every k from a list x if y...

[ -0.010498046875, 0.020751953125, 0.01239013671875, -0.021484375, -0.0126953125, 0.005401611328125, -0.004364013671875, 0.013427734375, 0.021728515625, 0.009765625, 0.01434326171875, -0.017822265625, 0.0118408203125, 0.017578125, 0.0037078857421875, 0.00023937225341796875, 0.020019531...

[ 20625, 142508, 62163, 55681, 5281, 678, 124001, 124519, 32354, 56050, 18347, 4032, 1556, 6002, 86531, 80934, 1022, 12, 425, 41361, 4785, 25632, 18151, 4488, 87388, 11907, 472, 1295, 5303, 11782, 14194, 7, 3714, 20697, 152363, 36497, 2424, 217...

[ 0.131591796875, 0.24267578125, 0.05999755859375, 0.1722412109375, 0.1153564453125, 0.081298828125, 0.20751953125, 0.16015625, 0.16943359375, 0.23291015625, 0.10198974609375, 0.106689453125, 0.1324462890625, 0.036041259765625, 0.1055908203125, 0.08551025390625, 0.1373291015625, 0.03...

embed

11874601_c0

11874601

haskell

0

Title: How to use HUnit and Cabal to do Automated Testing? Problem title: How to use HUnit and Cabal to do Automated Testing? Tags: unit-testing, hunit, cabal, haskell Problem: How to use HUnit and Cabal to do Automated Testing? I've been fighting with Cabal for a good portion of a day trying to make its automated test...

How to use HUnit and Cabal to do Automated Testing? How to use HUnit and Cabal to do Automated Testing? unit-testing hunit cabal haskell How HUnit Cabal Automated Testing exitcode-stdio-1.0 How to use HUnit and Cabal to do Automated Testing? I've been fighting with Cabal for a good portion of a day trying to make its a...

[ 0.0108642578125, 0.0167236328125, 0.012451171875, -0.00087738037109375, -0.0133056640625, -0.002471923828125, 0.006317138671875, 0.004852294921875, -0.006805419921875, 0.01141357421875, -0.00775146484375, -0.0224609375, -0.00909423828125, 0.00872802734375, -0.0107421875, -0.00540161132...

[ 11249, 4527, 22438, 6773, 136, 30438, 289, 54, 51719, 297, 8647, 214, 47, 25072, 6954, 1926, 217, 109524, 1556, 142508, 82230, 40899, 271, 5670, 102107, 181952, 678, 11408, 134234, 66139, 4488, 209806, 14168, 40059, 45367, 98169, 4734, 9, 1...

[ 0.081787109375, 0.1380615234375, 0.1717529296875, 0.2568359375, 0.1405029296875, 0.2208251953125, 0.2147216796875, 0.04132080078125, 0.225341796875, 0.1048583984375, 0.228271484375, 0.1212158203125, 0.01141357421875, 0.1556396484375, 0.2049560546875, 0.1617431640625, 0.1827392578125,...

embed

13497796_c0

13497796

haskell

0

Title: Can this code be written without explicit recursion? [Project Euler #31 spoiler] Problem title: Can this code be written without explicit recursion? [Project Euler #31 spoiler] Tags: haskell Problem: Can this code be written without explicit recursion? [Project Euler #31 spoiler] This function is at the heart of...

Can this code be written without explicit recursion? [Project Euler #31 spoiler] Can this code be written without explicit recursion? [Project Euler #31 spoiler] haskell Can Project Euler d:ds Can this code be written without explicit recursion? [Project Euler #31 spoiler] This function is at the heart of a solution to...

[ -0.032958984375, 0.006561279296875, 0.015625, 0.001922607421875, -0.007598876953125, 0.000606536865234375, -0.00567626953125, -0.011474609375, 0.02197265625, -0.041748046875, -0.008544921875, -0.006988525390625, 0.01495361328125, 0.028564453125, 0.00494384765625, -0.002716064453125, ...

[ 4171, 903, 18151, 59121, 15490, 143726, 195625, 1830, 223353, 5177, 603, 5016, 180281, 1556, 142508, 27331, 104, 12, 6468, 3293, 32354, 99, 26498, 29806, 2967, 3444, 18822, 831, 456, 5429, 75639, 15824, 83, 1379, 22288, 40536, 266, 297, 798...

[ 0.0894775390625, 0.042083740234375, 0.171142578125, 0.1107177734375, 0.1123046875, 0.17138671875, 0.2105712890625, 0.0928955078125, 0.0609130859375, 0.1214599609375, 0.166015625, 0.110107421875, 0.1092529296875, 0.1370849609375, 0.246337890625, 0.1314697265625, 0.07525634765625, 0....

embed

34031039_c0

34031039

haskell

0

Title: How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? Problem title: How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? Tags: ghc, haskell, epoll Problem: How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? There is a ...

How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? ghc haskell epoll How GHC Haskell How to use the epoll/kqueue enabled version of GHC/Haskell for network connections? There is a lot of old information ...

[ 0.01324462890625, 0.00823974609375, 0.0164794921875, 0.000720977783203125, -0.0042724609375, 0.00823974609375, -0.0224609375, 0.000579833984375, -0.0205078125, -0.043212890625, -0.0002346038818359375, -0.0281982421875, 0.0263671875, 0.003448486328125, 0.0047607421875, -0.00872802734375...

[ 11249, 47, 4527, 28, 5877, 141, 64, 92, 944, 13388, 225081, 11389, 527, 73265, 6495, 7, 142508, 33120, 94878, 100, 31380, 238, 1556, 20625, 4677, 18151, 60552, 22687, 34356, 9969, 1340, 62822, 27781, 3642, 60213, 5744, 45367, 17854, 10723, ...

[ 0.0751953125, 0.023956298828125, 0.115966796875, 0.04217529296875, 0.1829833984375, 0.1348876953125, 0.05596923828125, 0.0849609375, 0.112548828125, 0.181640625, 0.1434326171875, 0.096435546875, 0.09326171875, 0.2000732421875, 0.113037109375, 0.0819091796875, 0.23974609375, 0.10705...

embed

34032976_c0

34032976

haskell

0

Title: Syntax error in Haskell Problem title: Syntax error in Haskell Tags: haskell, syntax Problem: Syntax error in Haskell I got an error when compiling a Haskell script. Please help: main = do let bmiTell weight height | weight / height ^ 2 <= 18.5 = "You're underweight, you emo, you!" | weight / height ^ 2 <= 25.0 ...

Syntax error in Haskell Syntax error in Haskell haskell syntax Syntax Haskell You Pffft Lose Syntax error in Haskell I got an error when compiling a Haskell script. Please help:

[ -0.009521484375, 0.01806640625, -0.0191650390625, 0.01214599609375, 0.01123046875, 0.0247802734375, -0.0125732421875, -0.00157928466796875, 0.005340576171875, 0.010986328125, -0.0028228759765625, -0.0206298828125, -0.0145263671875, -0.00921630859375, 0.03173828125, -0.01165771484375, ...

[ 19010, 86531, 18499, 23, 20625, 142508, 1556, 6002, 2583, 87360, 125927, 3731, 13, 4163, 142, 9969, 49725, 26499, 30607, 4358 ]

[ 0.180908203125, 0.2296142578125, 0.199951171875, 0.05816650390625, 0.1455078125, 0.255126953125, 0.13525390625, 0.11224365234375, 0.095458984375, 0.078857421875, 0.2001953125, 0.1666259765625, 0.06292724609375, 0.044342041015625, 0.0008630752563476562, 0.09002685546875, 0.07556152343...

embed

40302439_c0

40302439

haskell

0

Title: Parsec optionMaybe always consuming input Problem title: Parsec optionMaybe always consuming input Tags: haskell, parsec Problem: Parsec optionMaybe always consuming input I'm trying to debug why despite combining optionMaybe with try , parsec is consuming the input. Basically in the below code, why is the secon...

Parsec optionMaybe always consuming input Parsec optionMaybe always consuming input haskell parsec Parsec Right many1 Left Parsec optionMaybe always consuming input I'm trying to debug why despite combining optionMaybe with try , parsec is consuming the input. Basically in the below code, why is the second run not retu...

[ -0.0036773681640625, 0.01220703125, 0.005035400390625, 0.0186767578125, -0.003570556640625, 0.0247802734375, 0.004608154296875, -0.01324462890625, 0.00151824951171875, -0.0181884765625, 0.00653076171875, 0.0184326171875, 0.01177978515625, -0.0103759765625, -0.00244140625, 0.01086425781...

[ 2392, 39797, 35829, 82419, 372, 11343, 18588, 214, 107730, 1556, 142508, 366, 90911, 5941, 418, 2480, 8, 85779, 15400, 964, 9790, 83, 35064, 18151, 17932, 11675, 959, 30646, 2055, 238, 41206 ]

[ 0.1239013671875, 0.251220703125, 0.2379150390625, 0.0989990234375, 0.1165771484375, 0.1435546875, 0.1942138671875, 0.101318359375, 0.1973876953125, 0.11865234375, 0.2060546875, 0.1346435546875, 0.153076171875, 0.1378173828125, 0.012359619140625, 0.08013916015625, 0.014007568359375, ...

embed

28182292_c0

28182292

haskell

0

Title: Cabal fetch dependencies for current package Problem title: Cabal fetch dependencies for current package Tags: haskell, cabal Problem: Cabal fetch dependencies for current package I wrote a package that I am trying to build. For reasons, I do not want to install it on my laptop. I want to download all of its dep...

Cabal fetch dependencies for current package Cabal fetch dependencies for current package haskell cabal Cabal my-package.cabal Cabal fetch dependencies for current package I wrote a package that I am trying to build. For reasons, I do not want to install it on my laptop. I want to download all of its dependencies and i...

[ 0.01177978515625, 0.0024261474609375, 0.0311279296875, 0.008544921875, -0.0089111328125, 0.011962890625, -0.0072021484375, 0.019775390625, 0.0037384033203125, -0.00457763671875, 0.003448486328125, -0.017822265625, -0.01275634765625, 0.0203857421875, -0.00494384765625, 0.003448486328125...

[ 30438, 289, 7647, 206, 42548, 117538, 100, 43581, 98169, 1556, 142508, 109524, 759, 29102, 4588, 408, 3571, 54397, 31577, 45367, 54, 959, 3444, 20600, 98, 26367, 47, 7026, 756, 15700, 13909, 11249, 831, 11675, 110, 50336, 12301, 11435, 442,...

[ 0.2286376953125, 0.1815185546875, 0.2113037109375, 0.0853271484375, 0.259033203125, 0.173583984375, 0.10418701171875, 0.212890625, 0.2314453125, 0.1287841796875, 0.212890625, 0.279052734375, 0.135009765625, 0.2049560546875, 0.158203125, 0.168212890625, 0.2186279296875, 0.0928955078...

embed

4461684_c0

4461684

haskell

0

Title: Confusion over IORefs to make a counter Problem title: Confusion over IORefs to make a counter Tags: unsafe-perform-io, monads, ioref, haskell Problem: Confusion over IORefs to make a counter I found some sample code, and changed it a little counter = unsafePerform $ newIORef 0 newNode _ = unsafePerformIO $ do i...

Confusion over IORefs to make a counter Confusion over IORefs to make a counter unsafe-perform-io monads ioref haskell Confusion IORefs Confusion over IORefs to make a counter I found some sample code, and changed it a little Which returns 1 then 2 then 3 then 3 etc each time it's run. But when I change it to then I ge...

[ -0.003997802734375, 0.00616455078125, 0.00104522705078125, 0.0174560546875, -0.006011962890625, 0.0031280517578125, 0.004913330078125, 0.0024566650390625, 0.00982666015625, -0.037841796875, 0.00689697265625, -0.0191650390625, 0.032470703125, 0.0166015625, 0.017822265625, -0.01867675781...

[ 1657, 92105, 645, 123435, 4240, 7, 47, 3249, 105416, 10, 51, 115840, 5037, 846, 2667, 712, 22995, 29087, 1556, 142508, 14037, 121413, 18151, 98816, 10176, 30646, 106, 7068, 116, 138, 12638, 1733, 11675, 15549, 442, 2046, 757, 11907, 44084, ...

[ 0.011688232421875, 0.1844482421875, 0.067138671875, 0.1771240234375, 0.2115478515625, 0.1116943359375, 0.04327392578125, 0.0977783203125, 0.259521484375, 0.00372314453125, 0.031341552734375, 0.1934814453125, 0.1781005859375, 0.2080078125, 0.07403564453125, 0.1099853515625, 0.18151855...

embed

47623458_c0

47623458

haskell

0

Title: Haskell Error on program Problem title: Haskell Error on program Tags: haskell Problem: Haskell Error on program just working on a problem and it keeps giving me this error: Exception: Prelude.tail: empty list Here is my code so far: lxP :: Eq a => [[a]] -> [a] lxP [] = [] lxP xss | any null xss = [] | otherwise...

Haskell Error on program Haskell Error on program haskell Haskell Error Haskell Error on program just working on a problem and it keeps giving me this error: Exception: Prelude.tail: empty list Here is my code so far: Any idea if my indentation is the problem or is it something with the code? PS. How could I improve th...

[ 0.0157470703125, 0.0155029296875, 0.0038909912109375, 0.01275634765625, -0.01434326171875, 0.0224609375, 0.00787353515625, -0.003875732421875, 0.00933837890625, -0.019287109375, 0.040771484375, -0.00188446044921875, -0.0026702880859375, -0.007080078125, 0.004241943359375, 0.005859375, ...

[ 20625, 142508, 212059, 98, 1528, 1556, 20697, 2967, 13695, 163, 903, 18499, 5443, 63928, 1914, 822, 112, 46741, 201505, 5303, 11853, 18151, 2060, 6528, 18597, 22062, 70, 52295, 227066 ]

[ 0.1585693359375, 0.240234375, 0.1795654296875, 0.1275634765625, 0.1964111328125, 0.14990234375, 0.10308837890625, 0.1014404296875, 0.0655517578125, 0.007110595703125, 0.033294677734375, 0.1644287109375, 0.001678466796875, 0.111572265625, 0.0953369140625, 0.180419921875, 0.14538574218...

embed

30083099_c0

30083099

haskell

0

Title: Filter letters from string replacing symbols for blanks spaces and letters lowercase Problem title: Filter letters from string replacing symbols for blanks spaces and letters lowercase Tags: filter, haskell, words, letter Problem: Filter letters from string replacing symbols for blanks spaces and letters lowerca...

Filter letters from string replacing symbols for blanks spaces and letters lowercase Filter letters from string replacing symbols for blanks spaces and letters lowercase filter haskell words letter string Filter Paul Come There Filter letters from string replacing symbols for blanks spaces and letters lowercase Example...

[ -0.01043701171875, -0.0064697265625, -0.021240234375, 0.004669189453125, 0.00469970703125, 0.01611328125, 0.0233154296875, -0.000728607177734375, 0.0014190673828125, 0.01055908203125, -0.00408935546875, 0.002288818359375, 0.008544921875, 0.013671875, -0.00958251953125, 0.0260009765625,...

[ 128896, 120820, 1295, 79315, 456, 133266, 26582, 100, 44237, 7, 32628, 92319, 58437, 46312, 1556, 142508, 34153, 31330, 10208, 10592, 8622, 136, 89536, 115043, 25, 38, 20779, 79858, 7077, 763, 202, 91, 1380, 2685, 11249, 831, 3934, 441, 699...

[ 0.23779296875, 0.228759765625, 0.114013671875, 0.2425537109375, 0.0283966064453125, 0.11767578125, 0.2177734375, 0.017730712890625, 0.2239990234375, 0.099853515625, 0.185302734375, 0.2379150390625, 0.1546630859375, 0.25439453125, 0.1319580078125, 0.235595703125, 0.1182861328125, 0....

embed

32600304_c0

32600304

haskell

0

Title: Compiler rejects type signature of data constructor Problem title: Compiler rejects type signature of data constructor Tags: haskell Problem: Compiler rejects type signature of data constructor I am learning haskell. When I compile the code: data Bintree a = Nulltree | Node (Bintree a) a (Bintree a) Nulltree :: ...

Compiler rejects type signature of data constructor Compiler rejects type signature of data constructor haskell Compiler Bintree Nulltree Node Invalid Should Compiler rejects type signature of data constructor I am learning haskell. When I compile the code: I get the following error: So how do I prevent this. I tried w...

[ 0.00958251953125, 0.01080322265625, -0.005767822265625, 0.0174560546875, 0.00750732421875, -0.000579833984375, -0.01275634765625, 0.003631591796875, -0.008544921875, -0.000637054443359375, -0.013916015625, -0.044677734375, 0.007354736328125, -0.003814697265625, -0.0024871826171875, -0....

[ 15612, 34759, 456, 75161, 10644, 138256, 2053, 64549, 748, 1556, 142508, 16666, 62600, 1429, 1181, 438, 112, 7013, 151117, 111, 52080, 9969, 1340, 70, 18151, 2046, 25632, 18499, 3642, 56282, 903, 32562, 5701 ]

[ 0.1343994140625, 0.2012939453125, 0.0955810546875, 0.2269287109375, 0.2080078125, 0.2369384765625, 0.105224609375, 0.156982421875, 0.0946044921875, 0.12060546875, 0.207763671875, 0.1187744140625, 0.2335205078125, 0.1302490234375, 0.062255859375, 0.1280517578125, 0.093505859375, 0.1...

embed

58379070_c0

58379070

haskell

0

Title: Haskell - variable not in scope error - beginner Problem title: Haskell - variable not in scope error - beginner Tags: new-operator, haskell Problem: Haskell - variable not in scope error - beginner I'm new to haskell and cannot work out what is wrong with my code. I keep getting a variable out of scope error. H...

Haskell - variable not in scope error - beginner Haskell - variable not in scope error - beginner new-operator haskell Haskell Bool Main Variable Haskell - variable not in scope error - beginner I'm new to haskell and cannot work out what is wrong with my code. I keep getting a variable out of scope error. Here is my c...

[ 0.0028076171875, 0.01806640625, 0.003997802734375, 0.029296875, 0.0185546875, 0.011962890625, -0.0018310546875, 0.027587890625, 0.0205078125, 0.0022125244140625, -0.00848388671875, -0.033203125, 0.0133056640625, 0.006927490234375, 0.01556396484375, 0.0023345947265625, -0.007415771484...

[ 20625, 142508, 77336, 959, 23, 70820, 18499, 9842, 1679, 3525, 206469, 1556, 2460, 929, 12321, 84572, 2886, 53418, 4488, 1810, 44691, 18151, 13695, 111, 72367, 527, 73265, 14, 63033, 10644, 35604, 5267, 449, 927, 10, 11, 30646, 98320 ]

[ 0.1533203125, 0.254638671875, 0.289794921875, 0.1932373046875, 0.168701171875, 0.23583984375, 0.186767578125, 0.08062744140625, 0.095458984375, 0.0645751953125, 0.11181640625, 0.1279296875, 0.04931640625, 0.158203125, 0.0950927734375, 0.205078125, 0.111328125, 0.021270751953125, ...

embed

36266309_c0

36266309

haskell

0

Title: sublime text 3 & haskell : change compilation directory Problem title: sublime text 3 & haskell : change compilation directory Tags: sublimetext, sublimetext3, haskell Problem: sublime text 3 & haskell : change compilation directory I use sublime text 3 on linux mint 17.3, with the haskell plugin. I open...

sublime text 3 & haskell : change compilation directory sublime text 3 & haskell : change compilation directory sublimetext sublimetext3 haskell sublimetext3 sublime text 3 & haskell : change compilation directory I use sublime text 3 on linux mint 17.3, with the haskell plugin. I opened a directory containing ...

[ 0.000518798828125, -0.00634765625, 0.002471923828125, 0.00005602836608886719, -0.0027008056640625, 0.01483154296875, -0.005767822265625, 0.0230712890625, 0.00238037109375, 0.0125732421875, -0.0400390625, 0.0076904296875, 0.005889892578125, 0.01263427734375, 0.01251220703125, 0.00872802...

[ 117584, 13, 7986, 138, 25133, 1556, 142508, 15549, 98352, 1363, 14364, 22829, 363, 619, 4527, 11508, 6077, 4090, 7076, 69993, 142096, 70541, 11435, 127, 27211, 5962, 71885, 30121, 1328, 571, 83184, 11675, 26785, 2301, 18, 1957, 23035, 10484, ...

[ 0.199951171875, 0.1571044921875, 0.20458984375, 0.18310546875, 0.0278472900390625, 0.134033203125, 0.2330322265625, 0.142822265625, 0.1575927734375, 0.027252197265625, 0.1199951171875, 0.159912109375, 0.1278076171875, 0.00390625, 0.038299560546875, 0.07843017578125, 0.045074462890625...

embed

40393093_c0

40393093

haskell

0

Title: what does forward slash mean in haskell? Problem title: what does forward slash mean in haskell? Tags: syntax, infix-operator, haskell Problem: what does forward slash mean in haskell? I am learning Haskell, studying for a midterm. there is a test quiz I'm looking at at the moment with questions on type inferenc...

what does forward slash mean in haskell? what does forward slash mean in haskell? syntax infix-operator haskell what does forward slash mean in haskell? I am learning Haskell, studying for a midterm. there is a test quiz I'm looking at at the moment with questions on type inference. some of the questions contain forwar...

[ 0.027099609375, 0.01708984375, -0.0059814453125, -0.00347900390625, -0.01171875, 0.0037841796875, 0.00555419921875, 0.012451171875, -0.01019287109375, -0.01220703125, 0.0086669921875, -0.0185546875, 0.01470947265625, -0.0123291015625, -0.01806640625, 0.007415771484375, -0.00720214843...

[ 2367, 40225, 91, 5544, 29459, 23, 1556, 142508, 6002, 86531, 55923, 206469, 52080, 20625, 32166, 3034, 81758, 3095, 17582, 10644, 53498, 14865, 114942, 6528, 33636, 69236, 83324, 32354, 77336, 27781, 7413, 26484, 110, 84434 ]

[ 0.0221099853515625, 0.263671875, 0.06158447265625, 0.2252197265625, 0.1116943359375, 0.05328369140625, 0.1280517578125, 0.199951171875, 0.00408935546875, 0.06011962890625, 0.1768798828125, 0.134033203125, 0.001373291015625, 0.06781005859375, 0.0240020751953125, 0.03717041015625, 0.08...

embed

29295823_c0

29295823

haskell

0

Title: Implementation of Foldable in Haskell Problem title: Implementation of Foldable in Haskell Tags: tree-traversal, haskell Problem: Implementation of Foldable in Haskell For example, I have some data type. Let it be a binary tree: data Tree a = Leaf a | Branch (Tree a) (Tree a) For example, I implemented traversal...

Implementation of Foldable in Haskell Implementation of Foldable in Haskell tree-traversal haskell Implementation Foldable Haskell Tree Leaf Branch foldt1 Implementation of Foldable in Haskell For example, I have some data type. Let it be a binary tree: For example, I implemented traversal of the tree: It works pretty ...

[ 0.0272216796875, 0.0036163330078125, -0.003570556640625, -0.006744384765625, 0.0181884765625, 0.0037994384765625, -0.033447265625, -0.00994873046875, -0.0106201171875, -0.0595703125, -0.0169677734375, -0.0281982421875, -0.00982666015625, 0.015625, 0.013427734375, 0.0048828125, -0.006...

[ 153941, 30077, 71, 2886, 23, 20625, 142508, 111, 53201, 1517, 814, 2317, 1556, 101344, 636, 2407, 21110, 42822, 18, 418, 2053, 10644, 2394, 6635, 29479, 37317, 289, 43240, 28875, 4127, 3444, 101758, 5351, 33022, 1884, 450, 4966, 14602, 959,...

[ 0.1834716796875, 0.2047119140625, 0.14013671875, 0.24658203125, 0.0223388671875, 0.1436767578125, 0.246337890625, 0.051788330078125, 0.1766357421875, 0.052581787109375, 0.1365966796875, 0.103515625, 0.1204833984375, 0.1343994140625, 0.006622314453125, 0.091796875, 0.061065673828125, ...

embed

20447427_c0

20447427

haskell

0

Title: how to write more concise lambda function of sortBy, unionBy, etc Problem title: how to write more concise lambda function of sortBy, unionBy, etc Tags: lambda, haskell, sorting, list Problem: how to write more concise lambda function of sortBy, unionBy, etc Functions like sortBy and unionBy take a lambda functi...

how to write more concise lambda function of sortBy, unionBy, etc how to write more concise lambda function of sortBy, unionBy, etc lambda haskell sorting list how to write more concise lambda function of sortBy, unionBy, etc Functions like sortBy and unionBy take a lambda function as argument. The lambda function ofte...

[ -0.0025177001953125, 0.0155029296875, 0.007476806640625, -0.0196533203125, -0.003387451171875, -0.0223388671875, 0.01123046875, -0.006072998046875, 0.005126953125, -0.0166015625, 0.0042724609375, 0.0186767578125, 0.03466796875, -0.006256103515625, -0.012939453125, -0.0142822265625, -...

[ 3642, 33022, 1286, 158, 318, 184, 21, 6492, 85, 32354, 12096, 75358, 69941, 1556, 142508, 214, 5303, 111, 28670, 1884, 136, 5646, 237, 10750, 27983, 14602, 69101, 864, 7103, 35971, 12830, 149016, 6, 41872, 113, 271, 1022, 831, 59121, 1079...

[ 0.04345703125, 0.1578369140625, 0.1373291015625, 0.079345703125, 0.1845703125, 0.1217041015625, 0.0474853515625, 0.1922607421875, 0.154052734375, 0.1739501953125, 0.1834716796875, 0.210693359375, 0.149658203125, 0.09228515625, 0.1787109375, 0.0172271728515625, 0.1231689453125, 0.00...

embed

23095224_c0

23095224

haskell

0

Title: S combinator in Haskell Problem title: S combinator in Haskell Tags: haskell, combinators, s-combinator Problem: S combinator in Haskell Can an analog of the S combinator be expressed in Haskell using only standard functions (without defining it by equation) and without using lambda (anonymous function)? I expec...

S combinator in Haskell S combinator in Haskell haskell combinators s-combinator Haskell S combinator in Haskell Can an analog of the S combinator be expressed in Haskell using only standard functions (without defining it by equation) and without using lambda (anonymous function)? I expect it to by of type (a -> b -> c...

[ -0.0062255859375, 0.00897216796875, 0.0242919921875, -0.016357421875, 0.0172119140625, 0.0017242431640625, -0.01055908203125, -0.01068115234375, -0.003570556640625, -0.02294921875, -0.00048828125, 0.0166015625, -0.00201416015625, 0.000522613525390625, 0.004119873046875, 0.0032653808593...

[ 159, 22321, 1290, 20625, 142508, 23, 1556, 22230, 91, 277, 19155, 4171, 60223, 36510, 297, 17368, 4734, 5570, 32354, 6056, 13204, 390, 5490, 15490, 6492, 85, 45757, 41206, 10644, 876, 501, 33079, 341, 1660, 158, 271, 31577, 420, 1022, 123...

[ 0.1942138671875, 0.2449951171875, 0.1502685546875, 0.1385498046875, 0.2474365234375, 0.0487060546875, 0.1201171875, 0.046417236328125, 0.1729736328125, 0.07415771484375, 0.2086181640625, 0.0562744140625, 0.23779296875, 0.1390380859375, 0.008575439453125, 0.047454833984375, 0.01629638...

embed

40810422_c0

40810422

haskell

0

Title: simpleHttp causing 'unsupported browser response?' Problem title: simpleHttp causing 'unsupported browser response?' Tags: http, haskell Problem: simpleHttp causing 'unsupported browser response?' I'm executing a simpleHttp request to a https domain, yet the response html is showing 'unsuppor...

simpleHttp causing 'unsupported browser response?' simpleHttp causing 'unsupported browser response?' http haskell Network.HTTP.Simple LAZ.ByteString www.example.com simpleHttp causing 'unsupported browser response?' I'm executing a simpleHttp request to a https domain, yet the response html is show...

[ -0.004669189453125, 0.01220703125, 0.00421142578125, 0.004730224609375, 0.00360107421875, 0.01116943359375, -0.00970458984375, -0.0164794921875, -0.0057373046875, 0.004730224609375, 0.019775390625, -0.041748046875, 0.01458740234375, -0.0022735595703125, -0.019287109375, 0.0117797851562...

[ 8781, 841, 3062, 254, 216806, 3768, 309, 105363, 31842, 57553, 1621, 1556, 142508, 28997, 18544, 23658, 8859, 33209, 17200, 75358, 67, 71713, 11, 71924, 50336, 3975, 77758, 14373, 7693, 141377, 89914, 18822, 959, 8060, 135913, 294, 32354, 357...

[ 0.1990966796875, 0.0791015625, 0.134521484375, 0.1439208984375, 0.1361083984375, 0.03375244140625, 0.0672607421875, 0.1932373046875, 0.17578125, 0.1651611328125, 0.14794921875, 0.08251953125, 0.1776123046875, 0.0177154541015625, 0.0303497314453125, 0.127685546875, 0.04388427734375, ...

embed

27120074_c2

27120074

haskell

2

, Spent, Left, Compiling, Distribution.PackageDescription.Utils, Distribution, PackageDescription, Utils.hs, Utils.o, Distribution.Simple.CCompiler, Simple, CCompiler.hs, CCompiler.o, Distribution.Compat.CreatePipe, Compat, CreatePipe.hs, CreatePipe.o, Distribution.Compat.Environment, Environment.hs, Environment.o, Exc...

[ -0.00075531005859375, 0.0034332275390625, -0.00011491775512695312, -0.006744384765625, 0.004119873046875, -0.00095367431640625, -0.0211181640625, -0.003143310546875, 0.0027008056640625, 0.0142822265625, 0.006744384765625, -0.0196533203125, 0.0040283203125, 0.005615234375, 0.0032196044921...

[ 4, 159, 91319, 636, 2480, 15612, 49725, 75571, 1363, 5, 205956, 4588, 4657, 59478, 106742, 7870, 56607, 3994, 127, 31, 8859, 33209, 441, 108161, 34759, 60552, 313, 257, 63784, 683, 48672, 151313, 686, 1900, 5443, 63928, 159065, 174350, 3744...

[ 0.10699462890625, 0.1407470703125, 0.271240234375, 0.1168212890625, 0.21533203125, 0.1923828125, 0.2122802734375, 0.274169921875, 0.120361328125, 0.0225677490234375, 0.2003173828125, 0.0777587890625, 0.1395263671875, 0.2100830078125, 0.1810302734375, 0.177734375, 0.2088623046875, 0...

embed

19415621_c0

19415621

haskell

0

Title: parsing for PHOAS expressions Problem title: parsing for PHOAS expressions Tags: haskell Problem: parsing for PHOAS expressions I think I understand PHOAS (parametric higher-order abstract syntax), and I see how we can pretty-print an expression (cf. http://www.reddit.com/r/haskell/comments/1mo59h/phoas_for_free...

parsing for PHOAS expressions parsing for PHOAS expressions haskell PHOAS parsing for PHOAS expressions I think I understand PHOAS (parametric higher-order abstract syntax), and I see how we can pretty-print an expression (cf. http://www.reddit.com/r/haskell/comments/1mo59h/phoas_for_free_by_edward_kmett/ccbxzoo ). But...

[ -0.00093841552734375, 0.00150299072265625, -0.00958251953125, 0.006378173828125, 0.006072998046875, 0.01708984375, 0.002197265625, -0.0113525390625, 0.0111083984375, -0.0230712890625, -0.00860595703125, -0.0225830078125, 0.0018463134765625, -0.008544921875, 0.00225830078125, 0.01074218...

[ 366, 6953, 100, 436, 17933, 9713, 125195, 1556, 142508, 5351, 28219, 6276, 186518, 77546, 80596, 164789, 6002, 86531, 1957, 831, 28875, 35662, 10557, 22014, 162, 2472, 32087, 19364, 4204, 1158, 45367, 2189, 6044, 51776, 143, 6492, 85, 11, 1...

[ 0.169677734375, 0.0791015625, 0.0914306640625, 0.07635498046875, 0.1888427734375, 0.1966552734375, 0.2286376953125, 0.0909423828125, 0.2197265625, 0.012420654296875, 0.0577392578125, 0.05621337890625, 0.1248779296875, 0.0716552734375, 0.1351318359375, 0.152587890625, 0.05459594726562...

embed

70802489_c0

70802489

haskell

0

Title: Why >> duplicates right-hand side operand in haskell Problem title: Why >> duplicates right-hand side operand in haskell Tags: haskell, monads, do-notation Problem: Why >> duplicates right-hand side operand in haskell I'm searched for a solution for duplication of a string n times. I found duplicate ...

Why >> duplicates right-hand side operand in haskell Why >> duplicates right-hand side operand in haskell haskell monads do-notation Why Why >> duplicates right-hand side operand in haskell I'm searched for a solution for duplication of a string n times. I found duplicate n str = [1..n] >> str from this sol...

[ 0.00543212890625, -0.007080078125, 0.01904296875, 0.00119781494140625, -0.002227783203125, 0.00372314453125, 0.007781982421875, -0.00811767578125, 0.0145263671875, -0.02099609375, -0.0030364990234375, -0.038818359375, 0.00860595703125, 0.0074462890625, 0.000576019287109375, -0.00029945...

[ 44084, 5386, 171763, 1636, 7108, 12336, 5609, 6264, 2208, 23, 1556, 142508, 2667, 712, 7, 54, 157, 22062, 6396, 33938, 29806, 115, 182867, 79315, 653, 20028, 14037, 67, 7704, 2203, 68252, 5, 19, 1295, 32195, 15400, 55300, 26847, 9790, 204...

[ 0.1253662109375, 0.0635986328125, 0.24072265625, 0.0906982421875, 0.121826171875, 0.1492919921875, 0.144287109375, 0.150390625, 0.1009521484375, 0.046356201171875, 0.1455078125, 0.2119140625, 0.07366943359375, 0.1092529296875, 0.0289154052734375, 0.08587646484375, 0.114013671875, 0...

embed

75925737_c1

75925737

haskell

1

given newMutVar# :: v -> State# s -> (# State# s, MutVar# s v #) //then (this is pseudo code) let (# s#, var# #) = newMutVar# "hello world" (State# 0) in s# == State# 0 and see if the result is True , which implies that newMutVar# acts like id for State# . But I can't do this because I don't know how to generate State#...

[ -0.005645751953125, 0.00054168701171875, -0.00665283203125, 0.005767822265625, 0.0096435546875, 0.01531982421875, -0.0286865234375, -0.0072021484375, 0.0150146484375, 0.0084228515625, 0.007598876953125, -0.01190185546875, 0.0147705078125, 0.0185546875, -0.0005950927734375, -0.006256103...

[ 34475, 3525, 10685, 18, 81827, 4904, 81, 22836, 91, 42015, 468, 74189, 18151, 2633, 285, 2203, 127, 13817, 8999, 135206, 757, 23, 69112, 1957, 2174, 16750, 87599, 27992, 1884, 3447, 831, 54, 3714, 139392, 34292, 5120, 70646, 91084, 9393, ...

[ 0.008758544921875, 0.124755859375, 0.1453857421875, 0.1143798828125, 0.265625, 0.210693359375, 0.1734619140625, 0.1915283203125, 0.09893798828125, 0.1610107421875, 0.04583740234375, 0.1895751953125, 0.18505859375, 0.06268310546875, 0.164306640625, 0.0191802978515625, 0.0526123046875,...

embed

35831639_c0

35831639

haskell

0

Title: K-th elemnt of list in haskell Problem title: K-th elemnt of list in haskell Tags: haskell Problem: K-th elemnt of list in haskell I'M a beginner in haskell, and trying to implement a function which returns the k-th element of a list without using the prelude !! built-in. kth_i [] _ _ = -1 kth_i (x:xs) i k = if ...

K-th elemnt of list in haskell K-th elemnt of list in haskell haskell K-th kth_i x:xs K-th elemnt of list in haskell I'M a beginner in haskell, and trying to implement a function which returns the k-th element of a list without using the prelude !! built-in. This code works, but is too verbose. I'd like to use just one...

[ -0.01318359375, 0.01300048828125, 0.01300048828125, -0.03271484375, 0.0196533203125, -0.00015163421630859375, 0.00445556640625, -0.0126953125, 0.0029449462890625, -0.015380859375, 0.0322265625, -0.027587890625, -0.0206298828125, 0.00616455078125, -0.019287109375, -0.0042724609375, 0....

[ 341, 9, 927, 88, 195, 660, 111, 5303, 23, 1556, 142508, 472, 454, 14, 1022, 12, 425, 7, 9842, 1679, 31577, 29479, 32354, 30646, 70, 12830, 15490, 17368, 479, 822, 112, 6506, 88303, 73, 18151, 43240, 5792, 57823, 1884, 4527, 1660, 1632...

[ 0.2205810546875, 0.1317138671875, 0.261474609375, 0.0938720703125, 0.127197265625, 0.1190185546875, 0.07977294921875, 0.180908203125, 0.064208984375, 0.15673828125, 0.2396240234375, 0.19775390625, 0.0276031494140625, 0.135986328125, 0.10400390625, 0.045989990234375, 0.134521484375, ...

embed

41194672_c0

41194672

haskell

0

Title: Get list of values in type Problem title: Get list of values in type Tags: haskell Problem: Get list of values in type In Haskell, is it possible to dynamically get a list of values in a type? A specific example is generating a complete deck of playing cards by combining one of each rank and suit to create a lis...

Get list of values in type Get list of values in type haskell Get Rank Suit Spades Hearts Diamonds Clubs Card Get list of values in type In Haskell, is it possible to dynamically get a list of values in a type? A specific example is generating a complete deck of playing cards by combining one of each rank and suit to c...

[ -0.0006561279296875, -0.01300048828125, -0.0035247802734375, 0.00555419921875, -0.00921630859375, -0.0003337860107421875, -0.01397705078125, -0.01495361328125, 0.01080322265625, -0.0072021484375, -0.000225067138671875, -0.00141143798828125, -0.0093994140625, 0.002716064453125, -0.0285644...

[ 20779, 5303, 111, 142424, 23, 10644, 1556, 142508, 134405, 1832, 217, 10959, 988, 60861, 69124, 7687, 23660, 20625, 7722, 84079, 25958, 2046, 27781, 12663, 28484, 8, 2594, 75169, 126381, 964, 30648, 60813, 28282, 163846, 15490, 7941, 587 ]

[ 0.059814453125, 0.154052734375, 0.07958984375, 0.1961669921875, 0.05194091796875, 0.23876953125, 0.131591796875, 0.236083984375, 0.114501953125, 0.10400390625, 0.0501708984375, 0.1060791015625, 0.1033935546875, 0.1209716796875, 0.128173828125, 0.1287841796875, 0.1431884765625, 0.11...

embed

30029029_c0

30029029

haskell

0

Title: Haskell: check if string is valid number Problem title: Haskell: check if string is valid number Tags: haskell, validation Problem: Haskell: check if string is valid number How do I check for a decimal point when checking a string is a valid number? What I am thinking is that I use something like the following, ...

Haskell: check if string is valid number Haskell: check if string is valid number haskell validation Haskell Bool Haskell: check if string is valid number How do I check for a decimal point when checking a string is a valid number? What I am thinking is that I use something like the following, but add code to check for...

[ -0.01068115234375, -0.005828857421875, -0.0028076171875, 0.0234375, -0.0128173828125, 0.025634765625, -0.00836181640625, -0.0218505859375, 0.00872802734375, 0.01287841796875, -0.0033721923828125, -0.0228271484375, -0.00933837890625, 0.0125732421875, -0.013427734375, -0.006683349609375,...

[ 20625, 142508, 12, 12765, 2174, 79315, 83, 35604, 14012, 1556, 44622, 2460, 929, 11249, 54, 87, 100, 10, 32380, 2749, 6275, 3229, 175199, 47644, 4527, 1884, 25632, 15190, 18151, 38, 78662, 61924, 24162, 73493, 237, 5, 758, 22410, 106, 615...

[ 0.1571044921875, 0.251220703125, 0.025238037109375, 0.2213134765625, 0.124267578125, 0.2467041015625, 0.1270751953125, 0.2427978515625, 0.2164306640625, 0.1429443359375, 0.16357421875, 0.08447265625, 0.1500244140625, 0.023834228515625, 0.0267791748046875, 0.0269775390625, 0.104980468...

embed

13439902_c0

13439902

haskell

0

Title: Function which Takes a binary tree and prints out its values in order Problem title: Function which Takes a binary tree and prints out its values in order Tags: haskell Problem: Function which Takes a binary tree and prints out its values in order I am currently writing a a function to take a binary tree and pri...

Function which Takes a binary tree and prints out its values in order Function which Takes a binary tree and prints out its values in order haskell Takes Node Nil Function which Takes a binary tree and prints out its values in order I am currently writing a a function to take a binary tree and print out its values in t...

[ 0.0234375, -0.0074462890625, -0.00787353515625, -0.01263427734375, 0.01806640625, 0.01611328125, -0.0257568359375, -0.0267333984375, -0.00909423828125, -0.016357421875, 0.004730224609375, -0.033935546875, -0.0023193359375, -0.01239013671875, 0.00762939453125, 0.013916015625, 0.021606...

[ 28670, 10763, 3129, 2561, 90, 2394, 6635, 53201, 136, 28412, 7, 1810, 142424, 23, 12989, 6863, 1556, 142508, 438, 112, 77175, 82424, 32562, 32354, 5646, 7108, 211385, 2967, 13695, 351, 146353, 103510, 18499, 17669, 11782 ]

[ 0.173095703125, 0.08795166015625, 0.06298828125, 0.1572265625, 0.091064453125, 0.1776123046875, 0.1661376953125, 0.2408447265625, 0.043182373046875, 0.184326171875, 0.01104736328125, 0.129150390625, 0.1805419921875, 0.041748046875, 0.2108154296875, 0.0108642578125, 0.121826171875, ...

embed

23985734_c0

23985734

haskell

0

Title: cannot convert bool to IO Bool Problem title: cannot convert bool to IO Bool Tags: haskell Problem: cannot convert bool to IO Bool I'm trying to do a function which returns true or false. owlFile = ".+\\.owl" testOwlFile src = src =~ owlFile :: Bool And i need to use on my do block : main = do [src] <- getArgs r...

cannot convert bool to IO Bool cannot convert bool to IO Bool haskell Bool Couldn cannot convert bool to IO Bool I'm trying to do a function which returns true or false. owlFile = ".+\\.owl" testOwlFile src = src =~ owlFile :: Bool And i need to use on my do block : But i'm having an error which is Couldn't match excep...

[ -0.0224609375, -0.001556396484375, 0.006866455078125, -0.003082275390625, 0.0025787353515625, 0.0162353515625, 0.0145263671875, 0.00005507469177246094, -0.0057373046875, -0.002227783203125, 0.0169677734375, -0.0289306640625, -0.00811767578125, -0.006744384765625, 0.0166015625, 0.010070...

[ 53418, 96760, 142484, 47, 17780, 2460, 929, 1556, 142508, 191147, 31577, 32354, 30646, 29568, 707, 98320, 36, 27751, 174350, 1328, 31, 3034, 670, 19437, 4527, 54, 46389, 18499, 18, 14858, 40494, 10644, 335, 137142, 678, 8561, 11782, 6954 ]

[ 0.181640625, 0.1666259765625, 0.22216796875, 0.1302490234375, 0.24267578125, 0.1336669921875, 0.2142333984375, 0.11279296875, 0.2049560546875, 0.09686279296875, 0.0191650390625, 0.08538818359375, 0.11181640625, 0.142822265625, 0.02227783203125, 0.17138671875, 0.06353759765625, 0.17...

embed

26092063_c1

26092063

haskell

1

libraries I've seen use a stack of layers so you just have to define the number of layer and the number of neuron in each layer, but its shape is a linear graph; this is fine for simple applications, but really hard core stuff needs networks with more complex architectures Id like some advice in how to attack these pr...

[ -0.0220947265625, 0.018798828125, -0.01446533203125, 0.033935546875, -0.01544189453125, 0.0211181640625, -0.011962890625, -0.0186767578125, 0.005584716796875, -0.0361328125, -0.00018024444580078125, -0.03564453125, 0.003143310546875, 0.016845703125, -0.015625, -0.0035552978515625, -0...

[ 35773, 10484, 87, 272, 51592, 4527, 10, 177261, 111, 135355, 7, 221, 1660, 765, 61924, 14012, 136, 184940, 12638, 1284, 115700, 83, 192617, 41382, 903, 5885, 8781, 86685, 6183, 7941, 56458, 41884, 27117, 33120, 678, 1286, 27140, 159958, 247...

[ 0.2362060546875, 0.1683349609375, 0.016571044921875, 0.06298828125, 0.10052490234375, 0.1129150390625, 0.0447998046875, 0.18701171875, 0.105712890625, 0.2470703125, 0.052520751953125, 0.00408935546875, 0.031707763671875, 0.0140380859375, 0.185791015625, 0.051422119140625, 0.029968261...

embed

27510452_c1

27510452

haskell

1

Element -> Maybe Data.Text.Internal.Text Prelude Text.XML.Lens Data.Maybe Data.String Text.XML> textFrom "groupId" pom f <interactive>:68:24: No instance for (Control.Applicative.Applicative (Control.Lens.Internal.Context.Pretext (->) Element Element)) arising from a use of ‘f’ In the third argument of ‘textFrom’, nam...

[ 0.011474609375, -0.01226806640625, -0.0157470703125, -0.0029144287109375, 0.0205078125, 0.015869140625, 0.0072021484375, 0.001556396484375, -0.0024871826171875, -0.026123046875, -0.000614166259765625, 0.029052734375, -0.019287109375, -0.01220703125, 0.0084228515625, -0.005645751953125,...

[ 48325, 33079, 83425, 11809, 174379, 44851, 6236, 1914, 822, 112, 24129, 1542, 39456, 866, 1755, 82419, 372, 71713, 7986, 168407, 51588, 568, 71, 26378, 1238, 10433, 71232, 16028, 25732, 438, 110527, 100, 175904, 39179, 11048, 4935, 22829, 192...

[ 0.2342529296875, 0.1080322265625, 0.2646484375, 0.1248779296875, 0.17578125, 0.08984375, 0.0909423828125, 0.09405517578125, 0.1513671875, 0.03192138671875, 0.205810546875, 0.069580078125, 0.1805419921875, 0.104248046875, 0.15673828125, 0.10479736328125, 0.1605224609375, 0.085693359...

embed

74323809_c0

74323809

haskell

0

Title: How can I parse a JSON-formatted string into Tree Int Problem title: How can I parse a JSON-formatted string into Tree Int Tags: tree, haskell Problem: How can I parse a JSON-formatted string into Tree Int I have the following code: {-# LANGUAGE OverloadedStrings #-} import Data.Aeson import Data.Tree main :: IO...

How can I parse a JSON-formatted string into Tree Int How can I parse a JSON-formatted string into Tree Int tree haskell Data.Aeson Data.Tree How JSON-formatted Tree LANGUAGE OverloadedStrings Maybe How can I parse a JSON-formatted string into Tree Int I have the following code: But the output is "Nothing" in the conso...

[ 0.004425048828125, 0.0130615234375, -0.00982666015625, 0.031982421875, -0.00750732421875, 0.0245361328125, 0.006134033203125, -0.008544921875, -0.0264892578125, -0.0216064453125, -0.01239013671875, -0.0166015625, -0.0001583099365234375, 0.00830078125, 0.006256103515625, 0.0034027099609...

[ 366, 184, 821, 58627, 51727, 79315, 3934, 101344, 360, 18, 831, 53201, 1556, 142508, 11809, 191, 62731, 98064, 9578, 63033, 71713, 5180, 83425, 3674, 18151, 140992, 5021, 64113, 23, 130250, 2053, 23351, 214, 52895, 81, 1295, 1375, 110527 ]

[ 0.1434326171875, 0.0943603515625, 0.10577392578125, 0.1966552734375, 0.1185302734375, 0.1820068359375, 0.10498046875, 0.257080078125, 0.11181640625, 0.145751953125, 0.0151214599609375, 0.17578125, 0.04534912109375, 0.1566162109375, 0.05987548828125, 0.09832763671875, 0.154296875, 0...

embed

66805476_c0

66805476

haskell

0

Title: Combinig either type variables Problem title: Combinig either type variables Tags: haskell Problem: Combinig either type variables I have a function in Haskell which return type is Either error b , and there is " function x = Right b1 " and for the " function (x:xs) b = I want to get something like Right [list o...

Combinig either type variables Combinig either type variables haskell Combinig Either Right x:xs Combinig either type variables I have a function in Haskell which return type is Either error b , and there is " function x = Right b1 " and for the " function (x:xs) b = I want to get something like Right [list of b's] . I...

[ -0.005340576171875, 0.000583648681640625, 0.00238037109375, -0.011962890625, 0.005279541015625, 0.033935546875, -0.0155029296875, -0.0054931640625, 0.0191650390625, -0.02587890625, 0.0150146484375, -0.01953125, 0.0225830078125, -0.006072998046875, -0.0079345703125, -0.007049560546875, ...

[ 106935, 21882, 40101, 10644, 77336, 1556, 142508, 9319, 90911, 1022, 12, 425, 32354, 20625, 30646, 4565, 18499, 876, 2203, 418, 136, 100, 3444, 2046, 1884, 6562, 111, 25, 7, 73342, 3525, 37842, 1239, 98753, 581, 4734, 13580, 959, 1052, 22...

[ 0.2113037109375, 0.1536865234375, 0.1873779296875, 0.1942138671875, 0.23486328125, 0.137939453125, 0.220458984375, 0.1273193359375, 0.1864013671875, 0.0765380859375, 0.0623779296875, 0.1151123046875, 0.1370849609375, 0.129150390625, 0.0740966796875, 0.023406982421875, 0.189208984375,...

embed

32031968_c0

32031968

haskell

0

Title: Arrow notation in slice category Problem title: Arrow notation in slice category Tags: haskell, category-theory Problem: Arrow notation in slice category If CatC is a category and A any object of CatC , the slice category CatC /A is described this way: SC-1 An object of CatC /A is an arrow f: C -> A of CatC for ...

Arrow notation in slice category Arrow notation in slice category haskell category-theory Arrow CatC Arrow notation in slice category What is the type of arrow in CatC /A? C -> C (object in CatC to object in CatC ) or f -> f' (object in CatC /A to object in CatC /A).

[ 0.0167236328125, -0.004486083984375, 0.021484375, 0.02685546875, -0.00640869140625, -0.01422119140625, -0.016845703125, 0.01251220703125, 0.010986328125, 0.00787353515625, -0.0011138916015625, -0.02001953125, -0.02294921875, 0.00958251953125, 0.0019989013671875, -0.015625, -0.0286865...

[ 1172, 15555, 110, 22062, 23, 91, 13348, 95487, 1556, 142508, 2347, 18826, 441, 83, 70, 10644, 111, 118201, 248, 284, 313, 33079, 187694, 47, 36746, 707, 1238, 25, 194 ]

[ 0.1287841796875, 0.2213134765625, 0.1903076171875, 0.080078125, 0.0784912109375, 0.0443115234375, 0.209716796875, 0.21142578125, 0.07305908203125, 0.177978515625, 0.02301025390625, 0.1484375, 0.1800537109375, 0.017181396484375, 0.0244293212890625, 0.1947021484375, 0.0692138671875, ...

embed

34405952_c0

34405952

haskell

0

Title: Retrieve hidden type of a phantom type Problem title: Retrieve hidden type of a phantom type Tags: haskell, phantom-types Problem: Retrieve hidden type of a phantom type I declared a a phantom type like this with Haskell. newtype Length (a::UnitLength) b = Length b deriving (Eq,Show) data UnitLength = Meter | Ki...

Retrieve hidden type of a phantom type Retrieve hidden type of a phantom type haskell phantom-types Retrieve Length a::UnitLength Show UnitLength Meter KiloMeter Miles Retrieve hidden type of a phantom type I declared a a phantom type like this with Haskell. Now, I would like to write some functions to use this type. B...

[ -0.01190185546875, 0.01434326171875, 0.005706787109375, 0.0089111328125, -0.006622314453125, 0.0003681182861328125, 0.01507568359375, 0.02197265625, 0.0089111328125, -0.006072998046875, -0.016845703125, -0.002655029296875, -0.01287841796875, -0.00799560546875, -0.0020599365234375, -0.0...

[ 200451, 204105, 10644, 111, 68743, 5928, 1556, 142508, 50986, 77554, 10, 85600, 449, 17367, 46640, 72812, 105519, 78572, 52999, 159978, 1884, 903, 678, 20625, 33022, 32354, 4527, 15935, 18, 73659, 1957, 7722, 456, 3996, 3134, 927, 51339, 3034...

[ 0.2135009765625, 0.24755859375, 0.19873046875, 0.035858154296875, 0.1563720703125, 0.1436767578125, 0.0911865234375, 0.228759765625, 0.198486328125, 0.1146240234375, 0.0164642333984375, 0.0767822265625, 0.047637939453125, 0.072265625, 0.10302734375, 0.07000732421875, 0.07220458984375...

embed

35864507_c0

35864507

haskell

0

Title: pointfree add to list in haskell Problem title: pointfree add to list in haskell Tags: haskell, pointfree Problem: pointfree add to list in haskell I'm trying to derive function of three args, using simple function chaining. The function should be of type addToList :: a -> a -> a -> [a] and be pointfree analogue...

pointfree add to list in haskell pointfree add to list in haskell haskell pointfree Prelude pointfree add to list in haskell I'm trying to derive function of three args, using simple function chaining. The function should be of type and be pointfree analogue of So far, I've figured out But it works in reverse: and look...

[ 0.022216796875, 0.0191650390625, -0.01007080078125, 0.00433349609375, -0.005645751953125, 0.0079345703125, -0.00103759765625, -0.00872802734375, -0.004791259765625, -0.052734375, 0.0137939453125, -0.035400390625, 0.01373291015625, 0.0089111328125, -0.00457763671875, -0.0189208984375, ...

[ 6275, 32087, 15190, 47, 5303, 1556, 142508, 23, 1914, 822, 112, 31577, 122, 5844, 32354, 17262, 79459, 8781, 1608, 14653, 5608, 111, 10644, 60223, 13388, 2060, 26366, 43240, 39531, 184, 33342, 11876, 1002, 2046, 26267, 28960 ]

[ 0.16259765625, 0.2469482421875, 0.1231689453125, 0.06915283203125, 0.154052734375, 0.130126953125, 0.189697265625, 0.0189056396484375, 0.00079345703125, 0.1151123046875, 0.0259246826171875, 0.0232696533203125, 0.056396484375, 0.022430419921875, 0.1474609375, 0.1431884765625, 0.139526...

embed

38040812_c0

38040812

haskell

0

Title: What does immutable variable in Haskell mean? Problem title: What does immutable variable in Haskell mean? Tags: functional-programming, immutability, haskell, ghci Problem: What does immutable variable in Haskell mean? I am quite confused with the concept of immutable variables in Haskell. It seems like that we...

What does immutable variable in Haskell mean? What does immutable variable in Haskell mean? functional-programming immutability haskell ghci What Haskell Prelude What does immutable variable in Haskell mean? I am quite confused with the concept of immutable variables in Haskell. It seems like that we can't change the v...

[ 0.014892578125, 0.0005950927734375, 0.000060558319091796875, 0.01507568359375, 0.0169677734375, 0.0189208984375, -0.01123046875, 0.0091552734375, -0.0035858154296875, 0.01361083984375, -0.002471923828125, -0.00714111328125, -0.009521484375, 0.0208740234375, 0.01116943359375, -0.0066223...

[ 4865, 14602, 566, 561, 22819, 77336, 23, 20625, 142508, 29459, 123309, 28966, 14311, 41159, 1556, 31380, 318, 1914, 822, 112, 55681, 23755, 7, 831, 15549, 34292, 25632, 18151, 41877, 17304, 79612, 6528 ]

[ 0.060882568359375, 0.036865234375, 0.102294921875, 0.1441650390625, 0.18359375, 0.268310546875, 0.08441162109375, 0.1451416015625, 0.253173828125, 0.1287841796875, 0.10498046875, 0.0704345703125, 0.17626953125, 0.05926513671875, 0.1343994140625, 0.045867919921875, 0.0740966796875, ...

embed

40209169_c0

40209169

haskell

0

Title: Maximizing according to a function Problem title: Maximizing according to a function Tags: haskell Problem: Maximizing according to a function I am trying to write a function that accepts a function and two inputs, and returns the argument that maximizes the function. This is the setup I want to use: max :: Eq a...

Maximizing according to a function Maximizing according to a function haskell Maximizing Maximizing according to a function I am trying to write a function that accepts a function and two inputs, and returns the argument that maximizes the function. This is the setup I want to use: For example, the function should work...

[ 0.010986328125, 0.0040283203125, 0.008056640625, 0.00714111328125, 0.0146484375, 0.0189208984375, -0.01806640625, 0.011474609375, 0.0038604736328125, -0.0181884765625, -0.007080078125, -0.017578125, -0.0128173828125, -0.00341796875, 0.01373291015625, -0.0294189453125, -0.007232666015...

[ 46540, 84382, 59499, 47, 32354, 1556, 142508, 31577, 33022, 26946, 136, 6626, 107730, 30646, 10750, 39771, 20650, 169581, 3444, 4527, 27781, 5608, 4488, 28960, 88949, 6896, 131815, 4426, 1328, 50258, 47644, 3871, 1884, 903, 51515, 22027, 18, ...

[ 0.20068359375, 0.16796875, 0.1781005859375, 0.0767822265625, 0.1966552734375, 0.1595458984375, 0.214599609375, 0.08099365234375, 0.0877685546875, 0.134765625, 0.06109619140625, 0.1375732421875, 0.1785888671875, 0.09130859375, 0.1734619140625, 0.1885986328125, 0.1778564453125, 0.148...

embed

26921107_c1

26921107

haskell

1

taps signal = map (correlate taps) (tails signal) downsample _ [] = [] downsample n (x:xs) = x : downsample n (drop (n-1) xs) upfirdn up down taps = (downsample down).(fir_filter taps).(upsample up) The upfirdn function indeed is just the straightforward approach, and laziness in the downsampling avoids computation, b...

[ 0.0228271484375, 0.0208740234375, -0.004241943359375, -0.0111083984375, -0.004150390625, -0.00139617919921875, -0.0009002685546875, 0.018798828125, 0.0184326171875, -0.046630859375, 0.0069580078125, -0.0311279296875, 0.0155029296875, 0.0242919921875, -0.00167083740234375, -0.0115966796...

[ 10704, 7, 26073, 2203, 22288, 32399, 19309, 46741, 7565, 433, 33209, 653, 425, 1022, 138810, 110218, 1257, 13448, 71, 19, 34695, 120337, 74854, 11, 32354, 160463, 1660, 80560, 2472, 51515, 21, 708, 7432, 25133, 2069, 71864, 181135, 14543, 4...

[ 0.232666015625, 0.096923828125, 0.2203369140625, 0.0212860107421875, 0.10711669921875, 0.1171875, 0.151123046875, 0.185546875, 0.1756591796875, 0.1279296875, 0.1756591796875, 0.009857177734375, 0.05316162109375, 0.04705810546875, 0.1080322265625, 0.066162109375, 0.113037109375, 0.1...

embed

64809352_c1

64809352

haskell

1

ize_generation bar_) threadDelay 1000000 life (evolution bar_) cls = putStr "\ESC[2J" I initially expected that each new generation for some reason calculated all the previous generations as well, but it doesn't seem to be the case. I would expect the computation time of the evolution function to increase if that was t...

[ -0.01348876953125, 0.0120849609375, -0.00933837890625, -0.005889892578125, 0.0021820068359375, 0.0038299560546875, 0.0004024505615234375, -0.017578125, -0.0162353515625, -0.0093994140625, -0.00811767578125, 0.01318359375, -0.0194091796875, -0.015625, -0.0291748046875, -0.00927734375, ...

[ 445, 13, 48281, 1363, 1909, 86997, 4657, 5259, 805, 28568, 6897, 137089, 33139, 7, 3884, 71713, 6706, 441, 304, 1375, 84751, 12638, 3525, 58093, 74481, 756, 96362, 442, 18, 48903, 7225, 41206, 181135, 1733, 28, 32354, 51312, 866, 19, 2841...

[ 0.11376953125, 0.151123046875, 0.14453125, 0.02349853515625, 0.1600341796875, 0.1737060546875, 0.127197265625, 0.232666015625, 0.067138671875, 0.1524658203125, 0.1361083984375, 0.2227783203125, 0.08349609375, 0.038970947265625, 0.1361083984375, 0.169677734375, 0.01953125, 0.0683593...

embed

65050490_c0

65050490

haskell

0

Title: Finding the type of a composition function in Haskell Problem title: Finding the type of a composition function in Haskell Tags: function-definition, haskell, types Problem: Finding the type of a composition function in Haskell Let's say I have the following function in Haskell: compose2 = (.) . (.) How would I ...

Finding the type of a composition function in Haskell Finding the type of a composition function in Haskell function-definition haskell types Finding Haskell compose2 Finding the type of a composition function in Haskell Let's say I have the following function in Haskell: compose2 = (.) . (.) How would I go about findi...

[ -0.0030975341796875, 0.00738525390625, 0.000392913818359375, 0.050537109375, -0.00750732421875, 0.0186767578125, -0.023193359375, 0.00811767578125, -0.0067138671875, -0.0206298828125, -0.0108642578125, -0.0230712890625, 0.0255126953125, 0.00537109375, -0.0123291015625, -0.0012054443359...

[ 26040, 214, 70, 10644, 111, 166577, 32354, 23, 20625, 142508, 49919, 1556, 52895, 150350, 304, 25632, 2203, 5, 2806, 1672, 90791, 903, 48716, 179933, 83324, 186, 831, 4527, 18, 2046, 3714, 3642, 15490, 36442, 13909, 98441, 7413 ]

[ 0.1046142578125, 0.004913330078125, 0.025909423828125, 0.21923828125, 0.07672119140625, 0.251708984375, 0.1864013671875, 0.036376953125, 0.1243896484375, 0.2322998046875, 0.06768798828125, 0.112060546875, 0.194580078125, 0.2415771484375, 0.1600341796875, 0.06842041015625, 0.055053710...

embed

65435497_c0

65435497

haskell

0

Title: Is there a way to get the usage block of optparse-aplicative parser outside the IO monad Problem title: Is there a way to get the usage block of optparse-aplicative parser outside the IO monad Tags: optparse-applicative, haskell Problem: Is there a way to get the usage block of optparse-aplicative parser outside...

Is there a way to get the usage block of optparse-aplicative parser outside the IO monad Is there a way to get the usage block of optparse-aplicative parser outside the IO monad optparse-applicative haskell Is there a way to get the usage block of optparse-aplicative parser outside the IO monad optparse-applicative pac...

[ 0.005828857421875, 0.02587890625, -0.0013275146484375, 0.0086669921875, -0.002532958984375, 0.016845703125, 0.009033203125, -0.0203857421875, 0.002777099609375, -0.028076171875, -0.01513671875, -0.0026092529296875, -0.003936767578125, -0.01611328125, 0.013916015625, 0.022216796875, -...

[ 2071, 2685, 3917, 2046, 70, 127689, 46389, 43922, 2500, 184, 52721, 4935, 366, 2189, 50782, 17780, 2667, 712, 9007, 11048, 1556, 142508, 98169, 113138, 72977, 75101, 2256, 10750, 6953, 101038, 7986, 58093, 28412, 7225, 18499, 4210, 73866, 358...

[ 0.000823974609375, 0.0042724609375, 0.07855224609375, 0.1160888671875, 0.04425048828125, 0.259033203125, 0.22314453125, 0.1875, 0.1722412109375, 0.1292724609375, 0.1395263671875, 0.0809326171875, 0.1334228515625, 0.1451416015625, 0.1712646484375, 0.155517578125, 0.0889892578125, 0....

embed

58259119_c0

58259119

haskell

0

Title: How to use map with a regular expression in Haskell Problem title: How to use map with a regular expression in Haskell Tags: haskell Problem: How to use map with a regular expression in Haskell While trying to apply the regular expression below to each element in a list (test), I get an error. This is what I am ...

How to use map with a regular expression in Haskell How to use map with a regular expression in Haskell haskell Text.Regex.TDFA How Haskell lobbying_firm CrisCom Company registration_year How to use map with a regular expression in Haskell While trying to apply the regular expression below to each element in a list (te...

[ -0.023193359375, 0.01483154296875, 0.0093994140625, 0.01202392578125, 0.00555419921875, 0.022705078125, -0.00592041015625, 0.0341796875, 0.012939453125, -0.018798828125, 0.005706787109375, -0.0118408203125, 0.0079345703125, -0.00183868408203125, 0.00099945068359375, -0.0167236328125, ...

[ 11249, 4527, 22288, 678, 10, 20324, 125195, 23, 20625, 142508, 1556, 24129, 54601, 3355, 100045, 14676, 120806, 214, 38949, 26315, 10770, 33734, 164498, 46799, 31577, 59911, 35064, 12638, 12830, 5303, 6954, 18499, 31380, 318, 831, 25647 ]

[ 0.067626953125, 0.1488037109375, 0.263671875, 0.150390625, 0.040679931640625, 0.19677734375, 0.2308349609375, 0.01953125, 0.12744140625, 0.2308349609375, 0.114013671875, 0.10260009765625, 0.07275390625, 0.1285400390625, 0.06982421875, 0.1968994140625, 0.199462890625, 0.044128417968...

embed

18105937_c0

18105937

haskell

0

Title: Sample arbitrary amount of numbers from Haskell list Problem title: Sample arbitrary amount of numbers from Haskell list Tags: haskell Problem: Sample arbitrary amount of numbers from Haskell list I'm starting to learn Haskell from a Ruby background. I'm looking to be able to get an arbitrary number of items fro...

Sample arbitrary amount of numbers from Haskell list Sample arbitrary amount of numbers from Haskell list haskell Haskell Sample Sample arbitrary amount of numbers from Haskell list I'm starting to learn Haskell from a Ruby background. I'm looking to be able to get an arbitrary number of items from a list: This is avai...

[ 0, 0.017333984375, 0.000492095947265625, 0.008544921875, -0.01422119140625, 0.01361083984375, -0.018798828125, 0.009033203125, 0.0223388671875, -0.01458740234375, 0.003692626953125, -0.0289306640625, 0.007537841796875, 0.01165771484375, -0.002960205078125, -0.00982666015625, 0.002304...

[ 947, 33209, 61799, 1294, 41170, 101935, 1295, 20625, 142508, 5303, 1556, 72134, 30698, 158189, 76615, 16487, 19048, 2046, 142, 14012, 55769, 10, 3293, 19882, 23, 156377, 5701, 123309, 7413, 1663, 26458, 903, 32354, 29479, 35978, 22362 ]

[ 0.165283203125, 0.205322265625, 0.1954345703125, 0.077392578125, 0.147216796875, 0.188720703125, 0.121337890625, 0.1270751953125, 0.2022705078125, 0.205078125, 0.115234375, 0.01336669921875, 0.05859375, 0.2398681640625, 0.07696533203125, 0.06451416015625, 0.0604248046875, 0.1134033...

embed

3890002_c0

3890002

haskell

0

Title: Can a TextEncoding be converted to a String? Problem title: Can a TextEncoding be converted to a String? Tags: locale, text, unicode, haskell Problem: Can a TextEncoding be converted to a String? It is possible to convert a string to a TextEncoding using mkTextEncoding :: String -> IO TextEncoding Is there any w...

Can a TextEncoding be converted to a String? Can a TextEncoding be converted to a String? locale text unicode haskell Can TextEncoding Can a TextEncoding be converted to a String? It is possible to convert a string to a TextEncoding using Is there any way to do do the reverse? Or, given a TextEncoding, any way to find ...

[ 0.017822265625, -0.016845703125, 0.0037841796875, 0.040771484375, -0.005615234375, -0.005523681640625, 0.004730224609375, 0.0098876953125, -0.006195068359375, 0.017578125, 0.002197265625, -0.02734375, 0.0185546875, 0.00909423828125, -0.00701904296875, 0.0159912109375, 0.002197265625,...

[ 4171, 10, 24129, 7768, 587, 6238, 117176, 71, 47, 23351, 214, 29096, 7986, 60347, 112, 1556, 142508, 186, 7722, 96760, 79315, 17368, 3917, 39531, 184, 7413, 1810, 4677, 22, 864, 110527, 37397, 26548, 61924, 12353, 17780, 132283, 121392 ]

[ 0.082275390625, 0.0933837890625, 0.205078125, 0.129638671875, 0.194580078125, 0.1680908203125, 0.15283203125, 0.06536865234375, 0.1282958984375, 0.1754150390625, 0.148681640625, 0.107177734375, 0.1806640625, 0.10546875, 0.0634765625, 0.0771484375, 0.1739501953125, 0.018798828125, ...

embed

27040150_c1

27040150

haskell

1

od.hs:502:5) Status: 500 Internal Server Error 54.70131s If I don't try to save the data, then the file information is received, and I am able to see the file name on the server. I've successfully managed to upload files using Yesod forms, but when it comes to custom forms all my attempts so far have failed. Any help i...

[ -0.0030670166015625, 0.0322265625, 0.00933837890625, -0.01239013671875, -0.0205078125, 0.01361083984375, 0.005615234375, -0.012451171875, 0.000059604644775390625, -0.027587890625, -0.00640869140625, -0.0211181640625, 0.0004100799560546875, 0.01953125, 0.011962890625, -0.000766754150390...

[ 229, 127, 7, 23837, 304, 43317, 56504, 2101, 106745, 141, 22687, 212059, 8983, 5757, 115468, 2301, 18, 9790, 30098, 2053, 11435, 4677, 75204, 19048, 47, 1957, 9351, 98, 10723, 272, 65771, 145755, 70622, 102158, 17368, 32635, 2199, 3173, 128...

[ 0.10400390625, 0.07177734375, 0.050140380859375, 0.1153564453125, 0.09326171875, 0.1300048828125, 0.157470703125, 0.155517578125, 0.1529541015625, 0.078125, 0.16650390625, 0.176513671875, 0.127685546875, 0.1146240234375, 0.18359375, 0.0144195556640625, 0.07470703125, 0.092407226562...

embed

22255265_c0

22255265

haskell

0

Title: Returning a list element using positions Problem title: Returning a list element using positions Tags: haskell, list, position Problem: Returning a list element using positions I have recently taken upon myself to learn Haskell and, in one of the first lessons, I have been told to learn how to manipulate lists f...

Returning a list element using positions Returning a list element using positions haskell list position positions Returning Returning a list element using positions I have recently taken upon myself to learn Haskell and, in one of the first lessons, I have been told to learn how to manipulate lists first. I understand ...

[ -0.0115966796875, 0.00927734375, -0.00182342529296875, -0.00173187255859375, 0.0033416748046875, 0.00439453125, 0.005828857421875, 0.00860595703125, 0.01953125, -0.0223388671875, 0.0216064453125, -0.0186767578125, 0.0059814453125, 0.01116943359375, -0.0299072265625, -0.0186767578125, ...

[ 173340, 5303, 12830, 17368, 19069, 7, 1556, 142508, 30698, 20625, 182417, 45258, 5117, 28219, 39580, 1295, 1884, 903, 7722, 72134, 4568, 145581 ]

[ 0.1778564453125, 0.1812744140625, 0.1490478515625, 0.0797119140625, 0.2276611328125, 0.05096435546875, 0.119140625, 0.192626953125, 0.01593017578125, 0.08935546875, 0.0308837890625, 0.1483154296875, 0.0196685791015625, 0.032745361328125, 0.1395263671875, 0.07073974609375, 0.009887695...

embed

5683009_c0

5683009

haskell

0

Title: Haskell "newtype" for type synonyms Problem title: Haskell "newtype" for type synonyms Tags: types, haskell Problem: Haskell "newtype" for type synonyms I'm doing some stuff with SAT, and I want to have both "and" and "or" clauses. type AndClause = [Literal] type OrClause = [Literal] But I'm ...

Haskell "newtype" for type synonyms Haskell "newtype" for type synonyms types haskell Haskell AndClause Literal OrClause Satisfiable Haskell "newtype" for type synonyms I'm doing some stuff with SAT, and I want to have both "and" and "or" clauses. But I'm running into problems when I use them: Gives...

[ 0.0020294189453125, 0.011962890625, -0.0029144287109375, 0.01361083984375, -0.0159912109375, 0.01153564453125, -0.00110626220703125, 0.000293731689453125, 0.0040283203125, 0.004638671875, -0.0206298828125, -0.0169677734375, -0.000885009765625, -0.0076904296875, -0.01434326171875, 0.000...

[ 20625, 142508, 54936, 50986, 100, 10644, 164661, 52895, 1556, 3493, 26253, 135940, 3347, 1814, 1029, 678, 75210, 3444, 15044, 2940, 748, 70731, 51042, 3934, 44402, 4527, 77878, 163, 52721, 67, 110527, 21635, 5256, 959, 2053, 64549, 3525, 2980...

[ 0.1337890625, 0.233642578125, 0.156005859375, 0.309814453125, 0.035247802734375, 0.1998291015625, 0.1905517578125, 0.1690673828125, 0.1287841796875, 0.09814453125, 0.1170654296875, 0.0882568359375, 0.120849609375, 0.076416015625, 0.07061767578125, 0.012603759765625, 0.1510009765625, ...

embed

14610081_c1

14610081

haskell

1

opEvery' :: (a -> a -> a) -> [a] -> [a] -> [a] opEvery' = foldr . (map .) main :: IO () main = print $ sum $ opEvery (+) [1..n] [1..n] where n :: Integer n = 5000 The profiling results using opEvery (explicit arguments version): total time = 2.91 secs (2906 ticks @ 1000 us, 1 processor) total alloc = 1,300,813,124 byt...

[ -0.01324462890625, -0.007171630859375, -0.0002880096435546875, -0.01220703125, -0.0003681182861328125, 0.01385498046875, 0.01336669921875, -0.003997802734375, 0.01397705078125, -0.039794921875, -0.003997802734375, -0.0296630859375, 0.0181884765625, -0.006591796875, -0.005706787109375, ...

[ 233, 200647, 25, 1984, 11, 33079, 10, 2203, 18344, 7569, 62346, 5201, 17780, 16, 28412, 3650, 10554, 22183, 5, 44401, 653, 19692, 9468, 214, 50339, 17368, 83613, 60923, 10750, 11389, 3622, 1733, 787, 12183, 19216, 9016, 1053, 22824, 4382, ...

[ 0.2193603515625, 0.32470703125, 0.14013671875, 0.0258026123046875, 0.019561767578125, 0.06317138671875, 0.046295166015625, 0.01580810546875, 0.09881591796875, 0.1455078125, 0.158203125, 0.146728515625, 0.1756591796875, 0.017120361328125, 0.1966552734375, 0.0499267578125, 0.1967773437...

embed

25414521_c0

25414521

haskell

0

Title: Types for parser combinators Problem title: Types for parser combinators Tags: parsing, types, haskell Problem: Types for parser combinators If I have a parser a : Parser A and a parser b : Parser B then I can combine it into a parser a | b : Parser (Either A B) . This works but gets a little tricky when you sta...

Types for parser combinators Types for parser combinators parsing types haskell Types Parser Either Alternative Types for parser combinators If I have a parser a : Parser A and a parser b : Parser B then I can combine it into a parser a | b : Parser (Either A B) . This works but gets a little tricky when you start addi...

[ 0.01275634765625, 0.015625, 0.00372314453125, 0.021728515625, -0.010986328125, 0.01361083984375, -0.0269775390625, -0.01080322265625, -0.0025787353515625, 0.004119873046875, -0.0130615234375, -0.00677490234375, 0.0166015625, 0.00006532669067382812, -0.0096435546875, 0.003448486328125, ...

[ 60457, 100, 366, 2189, 22321, 22230, 6953, 52895, 1556, 142508, 2392, 4565, 9319, 103905, 765, 10, 62, 136, 876, 335, 831, 70163, 3934, 43240, 1284, 10176, 88308, 154107, 1286, 30700, 313, 28987, 49878, 67, 96362, 10644, 5570, 167201, 51339...

[ 0.235107421875, 0.06231689453125, 0.1824951171875, 0.194091796875, 0.2264404296875, 0.1162109375, 0.052581787109375, 0.2144775390625, 0.1265869140625, 0.20263671875, 0.1707763671875, 0.01922607421875, 0.10888671875, 0.160888671875, 0.024444580078125, 0.0765380859375, 0.10223388671875...

embed

25949759_c0

25949759

haskell

0

Title: Pattern Match on String in Scala Problem title: Pattern Match on String in Scala Tags: haskell, scala Problem: Pattern Match on String in Scala How can I pattern match on a String in Scala: scala> "55" match { | case x :: _ => x | } <console>:9: error: constructor cannot be instantiated to expected type; found :...

Pattern Match on String in Scala Pattern Match on String in Scala haskell scala Pattern Match Scala scala.collection.immutable Char Prelude Defined GHC.Base Pattern Match on String in Scala How can I pattern match on a String in Scala: In Haskell a String is a List of Char [Char] : So it supports pattern matching on a ...

[ -0.00445556640625, 0.006683349609375, 0.00185394287109375, -0.005828857421875, -0.0019989013671875, 0.0084228515625, 0.000021457672119140625, -0.005950927734375, 0.011962890625, -0.0079345703125, 0.02734375, -0.04150390625, 0.00982666015625, 0.00121307373046875, -0.004974365234375, -0....

[ 9876, 22766, 67407, 98, 23351, 214, 23, 152653, 11, 1556, 142508, 146232, 196352, 561, 22819, 21656, 822, 5983, 73265, 63473, 11249, 831, 87, 103510, 14858, 360, 20625, 83, 32036, 84068, 8060, 54, 903 ]

[ 0.1727294921875, 0.1571044921875, 0.248779296875, 0.08306884765625, 0.204345703125, 0.112060546875, 0.051605224609375, 0.2120361328125, 0.1180419921875, 0.0853271484375, 0.2266845703125, 0.1878662109375, 0.0653076171875, 0.0135498046875, 0.05926513671875, 0.109619140625, 0.0784912109...

embed

40717014_c0

40717014

haskell

0

Title: How to readline in Haskell without transfer to the next line? Problem title: How to readline in Haskell without transfer to the next line? Tags: readline, io, haskell, console Problem: How to readline in Haskell without transfer to the next line? I am trying to use readline in Haskell without transfer cursor to ...

How to readline in Haskell without transfer to the next line? How to readline in Haskell without transfer to the next line? readline io haskell console How Haskell How to readline in Haskell without transfer to the next line? I am trying to use readline in Haskell without transfer cursor to the next line. For example, ...

[ -0.0220947265625, -0.004730224609375, 0.01287841796875, 0.02587890625, -0.00104522705078125, -0.00077056884765625, 0.016845703125, -0.00028228759765625, -0.006988525390625, -0.035888671875, 0.0021514892578125, -0.0152587890625, -0.017333984375, -0.0164794921875, -0.01068115234375, 0.00...

[ 11249, 47, 12301, 2256, 23, 20625, 142508, 15490, 12302, 11737, 13315, 22995, 1556, 130250, 31577, 4527, 13810, 42, 54397, 18151, 72134, 1528, 1544, 2046, 28960 ]

[ 0.037506103515625, 0.05108642578125, 0.173583984375, 0.2205810546875, 0.0546875, 0.128173828125, 0.2169189453125, 0.1241455078125, 0.1490478515625, 0.052520751953125, 0.1060791015625, 0.1163330078125, 0.1087646484375, 0.127197265625, 0.002227783203125, 0.03082275390625, 0.06286621093...

embed

20743670_c0

20743670

haskell

0

Title: haskell flip simulation problems Problem title: haskell flip simulation problems Tags: flip, function, haskell Problem: haskell flip simulation problems flip' :: (a -> b -> c) -> (b -> a -> c) flip' f = g where g x y = f y x I want to ask that in the above flip' function , it seems that flip' will return a funct...

haskell flip simulation problems haskell flip simulation problems flip function haskell haskell flip simulation problems I want to ask that in the above flip' function , it seems that flip' will return a function named g and g x y share the same value with f y x however, in " where g x y = f y x " , f y x is a function...

[ 0.00634765625, 0.0108642578125, 0.008544921875, -0.007110595703125, 0.01007080078125, 0.01275634765625, -0.010498046875, -0.00909423828125, -0.0037078857421875, 0.0093994140625, 0.00927734375, 0.019287109375, 0.005035400390625, -0.028564453125, 0.0103759765625, -0.00154876708984375, ...

[ 1556, 142508, 147505, 40226, 44402, 32354, 1363, 3444, 26458, 36917, 25, 37202, 1221, 30646, 706, 136, 1022, 113, 12008, 5701, 34292, 678, 1238, 49903, 7440, 2203, 83, 11782, 365, 14602, 3249, 10422, 81, 304, 418, 18151, 4488, 3714, 1286, ...

[ 0.1304931640625, 0.2056884765625, 0.258056640625, 0.2471923828125, 0.18701171875, 0.18310546875, 0.018829345703125, 0.052886962890625, 0.063232421875, 0.07159423828125, 0.118896484375, 0.0745849609375, 0.04754638671875, 0.1572265625, 0.1192626953125, 0.0552978515625, 0.080322265625, ...

embed

43913107_c0

43913107

haskell

0

Title: How to clean a directory made using stack (haskell) and reuse it? Problem title: How to clean a directory made using stack (haskell) and reuse it? Tags: haskell, haskell-stack Problem: How to clean a directory made using stack (haskell) and reuse it? I am working with haskell using stack and each time I need to ...

How to clean a directory made using stack (haskell) and reuse it? How to clean a directory made using stack (haskell) and reuse it? haskell haskell-stack stack How How to clean a directory made using stack (haskell) and reuse it? I am working with haskell using stack and each time I need to painfully download all depen...

[ -0.01373291015625, 0.01251220703125, 0.01318359375, 0.024658203125, 0.004241943359375, -0.009521484375, -0.0098876953125, -0.00958251953125, -0.007049560546875, 0.00537109375, -0.029296875, 0.002960205078125, 0.007598876953125, 0.009765625, 0.00421142578125, -0.000640869140625, -0.01...

[ 11249, 47, 46622, 14364, 53, 7228, 17368, 177261, 10557, 142508, 136, 156883, 442, 1556, 590, 2594, 10, 20697, 678, 24503, 7026, 42548, 117538, 13452, 160193, 6165, 645, 434, 18781, 18151, 72134, 105027, 24674, 96362, 102158, 13648, 193943, 4...

[ 0.082763671875, 0.06146240234375, 0.27099609375, 0.17626953125, 0.1475830078125, 0.1248779296875, 0.125244140625, 0.2646484375, 0.119384765625, 0.240966796875, 0.08660888671875, 0.240478515625, 0.0914306640625, 0.11962890625, 0.1427001953125, 0.134033203125, 0.0176239013671875, 0.0...

embed

9433633_c0

9433633

haskell

0

Title: Is it possible to use functions in Haskell parameters? Problem title: Is it possible to use functions in Haskell parameters? Tags: parameters, haskell, function Problem: Is it possible to use functions in Haskell parameters? I have seen a few examples of Haskell code that use functions in parameters, but I can n...

Is it possible to use functions in Haskell parameters? Is it possible to use functions in Haskell parameters? parameters haskell function Haskell Compute Fibonacci Sequence Parse Is it possible to use functions in Haskell parameters? I have seen a few examples of Haskell code that use functions in parameters, but I can...

[ -0.00946044921875, 0.026123046875, -0.004791259765625, 0.024658203125, 0.00015926361083984375, 0.0224609375, 0.005157470703125, -0.00262451171875, 0.00022983551025390625, -0.031005859375, -0.00121307373046875, -0.041015625, 0.002349853515625, 0.021728515625, 0.0164794921875, -0.0077514...

[ 2071, 442, 7722, 4527, 32354, 7, 23, 20625, 142508, 171859, 47, 1556, 159415, 3698, 20990, 52544, 944, 2392, 184, 51592, 27781, 18151, 831, 8306, 2046, 4488, 163, 9790, 903, 18499, 6494 ]

[ 0.058349609375, 0.050506591796875, 0.16455078125, 0.1492919921875, 0.22705078125, 0.11669921875, 0.08642578125, 0.127197265625, 0.243408203125, 0.217529296875, 0.04827880859375, 0.099853515625, 0.05548095703125, 0.03173828125, 0.09576416015625, 0.115234375, 0.047088623046875, 0.045...

embed

9830006_c0

9830006

haskell

0

Title: type signature between function and class Problem title: type signature between function and class Tags: haskell Problem: type signature between function and class data Maybe' a = Nothing' | Just' a deriving (Show) class From' t where from' :: t a -> a instance From' Maybe' where from' (Just' x) = x This works. ...

type signature between function and class type signature between function and class haskell Maybe Nothing Just Show from2 Couldn test.hs:11:1 type signature between function and class This works. But... I don't know why it doesn't work.

[ -0.00433349609375, 0.01055908203125, -0.00946044921875, -0.013916015625, 0.00121307373046875, 0.015380859375, -0.00738525390625, 0.0191650390625, 0.01263427734375, -0.03564453125, -0.016357421875, -0.011962890625, 0.00396728515625, -0.0074462890625, -0.011962890625, -0.0108642578125, ...

[ 10644, 138256, 17721, 32354, 136, 18507, 1556, 142508, 83425, 182747, 9563, 17367, 1295, 304, 191147, 3034, 127, 7, 19993, 19721, 3293, 43240, 3714, 15400, 442, 22027, 18, 4488 ]

[ 0.250244140625, 0.269775390625, 0.1739501953125, 0.204345703125, 0.1260986328125, 0.2186279296875, 0.1378173828125, 0.220703125, 0.084228515625, 0.127197265625, 0.06976318359375, 0.1771240234375, 0.1107177734375, 0.07257080078125, 0.064453125, 0.1514892578125, 0.09490966796875, 0.0...

embed

6112631_c0

6112631

haskell

0

Title: couldn't match expected type Problem title: couldn't match expected type Tags: haskell Problem: couldn't match expected type I would like to do something different but it would be too long so below is only example: test x y = if x == "5" then x else do putStrLn "bad value"; y so if x == 5 it should ret...

couldn't match expected type couldn't match expected type haskell Bool couldn't match expected type I would like to do something different but it would be too long so below is only example: so if x == 5 it should return x, else it should print 'bad value' and return y - how can I do that in haskell ? edit: Wh...

[ -0.0155029296875, -0.00823974609375, 0.00726318359375, 0.004150390625, 0.017822265625, 0.003753662109375, -0.0032501220703125, 0.0042724609375, 0.00109100341796875, 0.028564453125, 0.0169677734375, -0.0213623046875, -0.0078125, -0.01190185546875, 0.0185546875, 0.0111083984375, 0.0075...

[ 69427, 3768, 18, 14858, 84751, 10644, 1556, 142508, 2460, 929, 2806, 1884, 54, 9844, 12921, 4989, 35064, 27781, 2174, 1022, 69112, 190, 5608, 30646, 37076, 28412, 12283, 34292, 113, 3642, 831, 23, 18151, 18499, 52366, 19, 142484, 678, 8561,...

[ 0.114990234375, 0.0635986328125, 0.09716796875, 0.2069091796875, 0.163818359375, 0.1832275390625, 0.1416015625, 0.214599609375, 0.075927734375, 0.1568603515625, 0.006988525390625, 0.0694580078125, 0.0263214111328125, 0.0179443359375, 0.1263427734375, 0.0195465087890625, 0.03024291992...

embed

23655950_c0

23655950

haskell

0

Title: Spawn process then exit in haskell Problem title: Spawn process then exit in haskell Tags: haskell Problem: Spawn process then exit in haskell I'm attempting to make a pop-up menu program for xmonad, and I'm trying to figure out how to spawn a command from a string, then exit without stopping or waiting for the ...

Spawn process then exit in haskell Spawn process then exit in haskell haskell Spawn Nothing Spawn process then exit in haskell I'm attempting to make a pop-up menu program for xmonad, and I'm trying to figure out how to spawn a command from a string, then exit without stopping or waiting for the child process. I've got...

[ 0.00927734375, 0.0162353515625, -0.0244140625, 0.005950927734375, -0.0024871826171875, 0.01092529296875, 0.01409912109375, -0.036376953125, 0.001068115234375, -0.0224609375, 0.0205078125, -0.000400543212890625, -0.0235595703125, 0.0126953125, -0.00726318359375, -0.00897216796875, -0....

[ 10959, 7710, 9433, 7068, 82230, 23, 1556, 142508, 182747, 81887, 7426, 2037, 8026, 1528, 1022, 3796, 712, 26366, 5623, 75101, 1295, 79315, 15490, 7279, 89289, 29041, 18151, 110934, 6392, 45388, 2182, 903, 49129, 55300, 4034, 5773 ]

[ 0.1817626953125, 0.162353515625, 0.187255859375, 0.0220947265625, 0.21630859375, 0.0390625, 0.1177978515625, 0.213623046875, 0.153564453125, 0.0159149169921875, 0.0772705078125, 0.05877685546875, 0.132080078125, 0.086181640625, 0.052947998046875, 0.09130859375, 0.1192626953125, 0.0...

embed

51696323_c0

51696323

haskell

0

Title: Tail recursion in Haskell for a function Problem title: Tail recursion in Haskell for a function Tags: haskell, recursion Problem: Tail recursion in Haskell for a function I am trying to learn Haskell and I read about tail recursions. For example I can write the sum function this way : sum :: Num a => [a] -> a s...

Tail recursion in Haskell for a function Tail recursion in Haskell for a function haskell recursion Tail Haskell Num x:xs Integer n-1 Tail recursion in Haskell for a function I am trying to learn Haskell and I read about tail recursions. For example I can write the sum function this way : But also this way Could someon...

[ -0.006622314453125, -0.00360107421875, 0.0242919921875, 0.00823974609375, 0.00469970703125, 0.00579833984375, -0.003143310546875, -0.0191650390625, 0.005279541015625, -0.01422119140625, 0.00775146484375, -0.018798828125, 0.00140380859375, -0.008056640625, 0.0174560546875, 0.00582885742...

[ 1218, 379, 195625, 1830, 23, 20625, 142508, 100, 32354, 1556, 52782, 1022, 12, 425, 44401, 653, 5759, 31577, 30698, 46741, 17514, 27781, 831, 33022, 10554, 903, 3917, 14192, 3642, 47, 54, 442, 678, 72856 ]

[ 0.185302734375, 0.1724853515625, 0.209228515625, 0.0938720703125, 0.04571533203125, 0.15234375, 0.232177734375, 0.0609130859375, 0.18505859375, 0.1253662109375, 0.1446533203125, 0.06170654296875, 0.03173828125, 0.08935546875, 0.1505126953125, 0.009246826171875, 0.1353759765625, 0.0...

embed

5344375_c0

5344375

haskell

0

Title: Haskell. Non IO Exception handling Problem title: Haskell. Non IO Exception handling Tags: exception, haskell Problem: Haskell. Non IO Exception handling I am trying to catch exception due to with the action ([1,2] !! 3). I can not. I was trying let a = [1,2] handle (\(e :: SomeException) -> print "err" >> retur...

Haskell. Non IO Exception handling Haskell. Non IO Exception handling exception haskell SomeException Control.Exception Haskell Non Exception Control.Exception.catch e::SomeException Haskell. Non IO Exception handling I am trying to catch exception due to with the action ([1,2] !! 3). I can not. I was trying handle (\(...

[ -0.011962890625, 0.027587890625, -0.005767822265625, -0.027099609375, 0.0159912109375, 0.003875732421875, 0.0033111572265625, -0.0029449462890625, 0.0106201171875, -0.024169921875, 0.000873565673828125, -0.006439208984375, 0.00469970703125, -0.01507568359375, 0.027587890625, -0.0213623...

[ 20625, 142508, 3775, 17780, 5443, 63928, 45064, 131527, 1556, 31384, 19279, 27131, 4460, 206, 28, 8912, 282, 31577, 105556, 4743, 678, 22631, 133063, 6506, 8439, 831, 959, 34831, 41872, 13, 1984, 28412, 56, 42, 30646, 4879, 65395, 3650, 10,...

[ 0.161865234375, 0.242919921875, 0.2021484375, 0.1787109375, 0.1143798828125, 0.2220458984375, 0.175537109375, 0.252685546875, 0.1656494140625, 0.1373291015625, 0.1019287109375, 0.2069091796875, 0.108642578125, 0.04302978515625, 0.09588623046875, 0.04876708984375, 0.08184814453125, ...

embed