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
66555516_c0	66555516	haskell	0	Title: Uniqueness of pure Problem title: Uniqueness of pure Tags: applicative, haskell Problem: Uniqueness of pure For any Applicative instance, once <> is written, pure is uniquely determined. Suppose you have pure1 and pure2 , both of which obey the laws. Then pure2 f <> pure1 y = pure1 ($ y) <*> pure2 f -- interch...	Uniqueness of pure Uniqueness of pure applicative haskell Uniqueness Applicative pure1 pure2 Uniqueness of pure For any Applicative instance, once <*> is written, pure is uniquely determined. Suppose you have pure1 and pure2 , both of which obey the laws. Then But using the fmap law this way feels like a cheat. Is ther...	[ 0.002349853515625, 0.0262451171875, 0.0024261474609375, 0.009765625, 0.0003147125244140625, 0.01275634765625, -0.0009918212890625, -0.010986328125, 0.024658203125, -0.015869140625, -0.00592041015625, 0.0019989013671875, -0.00115966796875, 0.01904296875, 0.0027618408203125, 0.0061035156...	[ 11789, 944, 7432, 111, 34166, 41816, 4935, 1556, 142508, 5659, 11048, 418, 304, 2499, 110527, 24145, 1639, 83, 59121, 36998, 83324, 121691, 765, 136, 15044, 36, 31804, 131703, 17368, 70, 1238, 62346, 27165, 12319, 1884, 290, 257, 71864, 149...	[ 0.2371826171875, 0.16748046875, 0.05950927734375, 0.10888671875, 0.284423828125, 0.1822509765625, 0.09954833984375, 0.1650390625, 0.2349853515625, 0.1475830078125, 0.1630859375, 0.07879638671875, 0.1292724609375, 0.03680419921875, 0.1678466796875, 0.1060791015625, 0.1246337890625, ...	embed
59393306_c0	59393306	haskell	0	Title: Yesod Haskell - How to create PDF reports, with a header and footer on each page? Problem title: Yesod Haskell - How to create PDF reports, with a header and footer on each page? Tags: haskell, pdf, web-deployment, report, yesod Problem: Yesod Haskell - How to create PDF reports, with a header and footer on each...	Yesod Haskell - How to create PDF reports, with a header and footer on each page? Yesod Haskell - How to create PDF reports, with a header and footer on each page? haskell pdf web-deployment report yesod Yesod Haskell How PDF Yesod.Content.PDF Yesod Haskell - How to create PDF reports, with a header and footer on each ...	[ 0.0098876953125, 0.0125732421875, 0.0037384033203125, 0.0040283203125, -0.014892578125, 0.00067138671875, -0.0230712890625, -0.00836181640625, -0.01483154296875, -0.0101318359375, 0.00077056884765625, -0.044677734375, -0.00787353515625, 0.0036468505859375, 0.0078125, -0.01434326171875,...	[ 32635, 2199, 20625, 142508, 11249, 28282, 6859, 117729, 678, 10336, 57616, 12638, 9191, 47, 1556, 26198, 1467, 112, 13158, 13416, 2422, 23722, 11935, 25352, 28242, 31577, 32354, 7693, 304, 3871, 3917, 3249, 136, 11522, 55516, 49347, 16751, 47...	[ 0.160888671875, 0.229736328125, 0.1390380859375, 0.2412109375, 0.0889892578125, 0.157958984375, 0.2259521484375, 0.2122802734375, 0.10284423828125, 0.1636962890625, 0.17138671875, 0.09716796875, 0.167724609375, 0.0287933349609375, 0.10296630859375, 0.1583251953125, 0.048065185546875,...	embed
64730978_c0	64730978	haskell	0	Title: Putting two Integers into a list from a single list comprehension Problem title: Putting two Integers into a list from a single list comprehension Tags: list-comprehension, haskell Problem: Putting two Integers into a list from a single list comprehension I need to find all primes ± 2 in list comprehension howev...	Putting two Integers into a list from a single list comprehension Putting two Integers into a list from a single list comprehension list-comprehension haskell a Putting Integers Integer Putting two Integers into a list from a single list comprehension I need to find all primes ± 2 in list comprehension however after lo...	[ -0.009765625, -0.003082275390625, 0.0125732421875, 0.0218505859375, 0.00689697265625, 0.03564453125, 0.0062255859375, -0.0004119873046875, 0.0201416015625, -0.018798828125, 0.000020503997802734375, -0.0208740234375, 0.0247802734375, 0.00921630859375, -0.015625, -0.00408935546875, -0....	[ 19577, 1916, 6626, 44401, 7, 3934, 5303, 1295, 11001, 46683, 3220, 10, 277, 4692, 1556, 142508, 3871, 7413, 756, 20809, 38405, 116, 23, 6889, 49903, 45767, 3642, 54, 171259, 4734, 27489, 54651, 3229, 5428, 114654, 1022, 2174, 14012, 660, ...	[ 0.14404296875, 0.0540771484375, 0.19482421875, 0.25048828125, 0.0865478515625, 0.146240234375, 0.2132568359375, 0.0904541015625, 0.1192626953125, 0.1806640625, 0.171142578125, 0.0159912109375, 0.03997802734375, 0.1424560546875, 0.1168212890625, 0.2103271484375, 0.07183837890625, 0....	embed
10457083_c0	10457083	haskell	0	Title: Haskell algebraic data type pattern matching Problem title: Haskell algebraic data type pattern matching Tags: algebraic-data-types, pattern-matching, haskell Problem: Haskell algebraic data type pattern matching I have the following: data Alpha a = Beta a [Alpha a] val = Beta 1 [Beta 2 [], Beta 5 [Beta 7 []]] I...	Haskell algebraic data type pattern matching Haskell algebraic data type pattern matching algebraic-data-types pattern-matching haskell Haskell Alpha Beta Haskell algebraic data type pattern matching I have the following: I'm trying to define a function that will move over a val of type Alpha Int and sum it. My desired...	[ -0.009765625, 0.004302978515625, 0.011474609375, 0.034423828125, -0.0028839111328125, 0.016357421875, -0.0252685546875, 0.0179443359375, 0.01470947265625, -0.006500244140625, -0.00421142578125, -0.01129150390625, 0.01806640625, -0.00092315673828125, 0.00113677978515625, -0.03271484375,...	[ 20625, 142508, 429, 2844, 2053, 10644, 103510, 14858, 214, 1771, 144, 10135, 50986, 98753, 1556, 76569, 48941, 25632, 31577, 61924, 32354, 1221, 25813, 645, 3502, 360, 18, 10554, 104851, 51515, 125663, 756, 933, 16750, 5303, 237875, 3714, 195...	[ 0.12109375, 0.2281494140625, 0.0589599609375, 0.102294921875, 0.0955810546875, 0.1729736328125, 0.21484375, 0.1826171875, 0.032989501953125, 0.0009765625, 0.010711669921875, 0.070556640625, 0.169677734375, 0.1597900390625, 0.10888671875, 0.1763916015625, 0.197021484375, 0.042236328...	embed
27969211_c0	27969211	haskell	0	Title: Class ForEachInt a in Haskell Problem title: Class ForEachInt a in Haskell Tags: haskell Problem: Class ForEachInt a in Haskell I am having difficulties in doing an exercise. I know I have to define the signatures of the functions except the function feget, but I do not know how to do it. I have to set the ForEa...	Class ForEachInt a in Haskell Class ForEachInt a in Haskell haskell ForEachInt Haskell fe2list Empty Class ForEachInt a in Haskell I am having difficulties in doing an exercise. I know I have to define the signatures of the functions except the function feget, but I do not know how to do it. I have to set the ForEachIn...	[ -0.004302978515625, -0.0059814453125, -0.001312255859375, 0.021728515625, -0.011962890625, 0.01202392578125, 0.0203857421875, -0.0203857421875, 0.0021514892578125, 0.0028839111328125, 0.006072998046875, -0.011474609375, 0.0032806396484375, 0.031005859375, -0.01226806640625, -0.01879882...	[ 35014, 1326, 647, 934, 4153, 18, 10, 23, 20625, 142508, 1556, 3820, 304, 6562, 31678, 939, 34844, 81979, 61924, 138256, 32354, 40494, 3794, 3714, 5423, 18507, 98363, 41421, 214, 47, 45646, 2053, 4343, 892, 26255, 96853, 1246, 13305, 927, ...	[ 0.1866455078125, 0.1812744140625, 0.139404296875, 0.1845703125, 0.1546630859375, 0.1446533203125, 0.1832275390625, 0.062744140625, 0.1474609375, 0.2366943359375, 0.13623046875, 0.15283203125, 0.0980224609375, 0.1749267578125, 0.138427734375, 0.0926513671875, 0.04931640625, 0.079284...	embed
19742337_c1	19742337	haskell	1	-> StatePut writeBS b = writeSized (BS.length b) putByteString b data SomeData = SomeData { sdName :: BS.ByteString , sdAge :: Int , sdN :: Int } deriving (Show, Eq) instance StateBinary SomeData where sput (SomeData nm a n) = do writeBS nm writeInt32 a writeInt32 n testData = SomeData "TestName" 30 100 runSPut :: Sta...	-> StatePut writeBS b = writeSized (BS.length b) putByteString b data SomeData = SomeData { sdName :: BS.ByteString , sdAge :: Int , sdN :: Int } deriving (Show, Eq) instance StateBinary SomeData where sput (SomeData nm a n) = do writeBS nm writeInt32 a writeInt32 n testData = SomeData "TestName" 30 100 runSPut :: Sta...	[ -0.0012054443359375, 0.01953125, -0.01544189453125, -0.015869140625, -0.004119873046875, 0.0224609375, -0.003204345703125, -0.00787353515625, 0.015869140625, 0.0106201171875, 0.00836181640625, 0.03564453125, 0.01025390625, 0.022216796875, -0.005218505859375, 0.00848388671875, -0.0003...	[ 33079, 22836, 27559, 18, 33022, 20429, 876, 2203, 29367, 23986, 3884, 75358, 67, 71713, 2053, 31384, 137989, 91, 71, 163612, 84145, 429, 839, 16406, 168660, 864, 110527, 571, 73, 6635, 7077, 8912, 39, 653, 6460, 10, 3034, 111337, 496, 805...	[ 0.134521484375, 0.2080078125, 0.22900390625, 0.174560546875, 0.185546875, 0.16845703125, 0.1749267578125, 0.04339599609375, 0.09765625, 0.07513427734375, 0.168212890625, 0.09112548828125, 0.0714111328125, 0.1500244140625, 0.1263427734375, 0.07861328125, 0.1273193359375, 0.006011962...	embed
21083006_c1	21083006	haskell	1	a monad variable not work as first argument of pReal :: (forall a. Num a => a -> a) -> ... , while its redefined version of the same type ( sign' ) works? How can I achieve passing polymorphic variable sign created in my monad to pReal function without re-defining ( sign' ) it inside my monad? Notes I already tried ap...	a monad variable not work as first argument of pReal :: (forall a. Num a => a -> a) -> ... , while its redefined version of the same type ( sign' ) works? How can I achieve passing polymorphic variable sign created in my monad to pReal function without re-defining ( sign' ) it inside my monad? Notes I already tried ap...	[ -0.01300048828125, 0.005645751953125, -0.0020751953125, 0.004608154296875, 0.006622314453125, 0.010009765625, 0.013427734375, -0.0189208984375, 0.0042724609375, -0.037353515625, 0.00732421875, -0.0128173828125, 0.00872802734375, -0.0269775390625, 0.006988525390625, 0.0079345703125, -...	[ 2667, 712, 77336, 959, 4488, 237, 5117, 10750, 915, 68996, 1984, 5584, 10, 52782, 44357, 33079, 15265, 5983, 11389, 5701, 10644, 24092, 25, 43240, 11249, 831, 69307, 452, 6953, 35874, 178851, 75935, 47, 32354, 15490, 456, 49919, 46132, 3784...	[ 0.165283203125, 0.2171630859375, 0.26416015625, 0.017791748046875, 0.0992431640625, 0.0236358642578125, 0.1036376953125, 0.209228515625, 0.0787353515625, 0.29443359375, 0.105224609375, 0.0687255859375, 0.0982666015625, 0.1142578125, 0.0457763671875, 0.090576171875, 0.0631103515625, ...	embed
22404939_c0	22404939	haskell	0	Title: Writing Category Instance for custom Lens Problem title: Writing Category Instance for custom Lens Tags: haskell-lens, haskell Problem: Writing Category Instance for custom Lens I have been reading this article for understanding Lenses. I know this is different from Edward Knett's lens package, but nonetheless i...	Writing Category Instance for custom Lens Writing Category Instance for custom Lens haskell-lens haskell Writing Category Instance Lens Writing Category Instance for custom Lens I have been reading this article for understanding Lenses. I know this is different from Edward Knett's lens package, but nonetheless it's use...	[ -0.00147247314453125, -0.002685546875, -0.003875732421875, 0.004150390625, -0.003753662109375, 0.003753662109375, -0.01220703125, -0.0299072265625, 0.00439453125, -0.00537109375, -0.0189208984375, 0.02978515625, -0.004913330078125, -0.0087890625, -0.001434326171875, 0.00031471252441406...	[ 213185, 49057, 360, 116071, 114122, 18226, 100, 1556, 142508, 1977, 7, 16454, 100094, 339, 47754, 12921, 38157, 45481, 3098, 98169, 80234, 20531, 62, 83, 61924, 71, 1884, 903, 119056, 3173, 95487, 31577, 28282, 110527, 10644, 67413, 54397, 80...	[ 0.184814453125, 0.256103515625, 0.0697021484375, 0.2042236328125, 0.19091796875, 0.25341796875, 0.039031982421875, 0.10498046875, 0.20166015625, 0.1727294921875, 0.1502685546875, 0.0438232421875, 0.044952392578125, 0.179931640625, 0.1856689453125, 0.0821533203125, 0.08599853515625, ...	embed
42765318_c0	42765318	haskell	0	Title: No instance for (RealFrac Int) arising from a use of ' ... ' Problem title: No instance for (RealFrac Int) arising from a use of ' ... ' Tags: functional-programming, types, haskell Problem: No instance for (RealFrac Int) arising from a use of ' ... ' The following program is supposed to chec...	No instance for (RealFrac Int) arising from a use of ' ... ' No instance for (RealFrac Int) arising from a use of ' ... ' functional-programming types haskell a RealFrac Harshad Bool No instance for (RealFrac Int) arising from a use of ' ... ' The following program is supposed to check whether the i...	[ -0.01708984375, 0.00946044921875, -0.0029449462890625, -0.00653076171875, -0.0031280517578125, 0.01904296875, 0.004241943359375, -0.0015106201171875, 0.00104522705078125, -0.006072998046875, 0.000553131103515625, -0.0216064453125, 0.0177001953125, -0.0211181640625, 0.00836181640625, -0...	[ 438, 110527, 100, 68996, 919, 20251, 360, 18, 187, 72219, 1295, 4527, 111, 3768, 153, 123309, 28966, 52895, 1556, 142508, 5120, 1950, 99225, 2460, 929, 242, 25632, 1528, 134598, 12765, 36766, 107730, 653, 99017, 390, 10554, 153939, 23, 9969...	[ 0.1282958984375, 0.265869140625, 0.051239013671875, 0.1875, 0.10107421875, 0.250732421875, 0.14404296875, 0.18994140625, 0.064453125, 0.09283447265625, 0.0765380859375, 0.1300048828125, 0.041107177734375, 0.120849609375, 0.1065673828125, 0.1490478515625, 0.103515625, 0.156616210937...	embed
63292732_c0	63292732	haskell	0	Title: How to call a function in haskell? Problem title: How to call a function in haskell? Tags: haskell, shuffle, program-entry-point, io, random Problem: How to call a function in haskell? I have a code that creates a list and then shuffle it. But i cannot execute because a problem with the = in the main = do sectio...	How to call a function in haskell? How to call a function in haskell? haskell shuffle program-entry-point io random System.IO System.Random How list-1 Enter How to call a function in haskell? I have a code that creates a list and then shuffle it. But i cannot execute because a problem with the = in the main = do sectio...	[ -0.0186767578125, 0.02294921875, 0.012451171875, 0.01043701171875, -0.004791259765625, 0.0098876953125, 0.0107421875, -0.0157470703125, -0.019287109375, -0.0242919921875, 0.003814697265625, -0.005462646484375, -0.0157470703125, 0.0152587890625, 0.01092529296875, -0.00482177734375, 0....	[ 11249, 47, 11782, 10, 32354, 23, 1556, 142508, 170052, 1528, 33, 15123, 38496, 22995, 96759, 12353, 17780, 126525, 3815, 5303, 5759, 60816, 18151, 28282, 442, 4966, 53418, 71924, 2967, 70, 2203, 5201, 54, 40059, 18499, 2500, 184, 98, 107730...	[ 0.06842041015625, 0.0838623046875, 0.2286376953125, 0.07855224609375, 0.258056640625, 0.0902099609375, 0.16650390625, 0.2440185546875, 0.2353515625, 0.1258544921875, 0.06488037109375, 0.1026611328125, 0.1309814453125, 0.1796875, 0.148681640625, 0.09197998046875, 0.1490478515625, 0....	embed
13110730_c0	13110730	haskell	0	Title: List operations Problem title: List operations Tags: haskell Problem: List operations I have a function cc declared as following (1st parameter is a (list) and 2nd parameter is b (list as well), it should return 3rd list: cc :: [(String, String)] -> [(String, String)] -> [(String, String)] cc a b = do Example: a...	List operations List operations haskell List List operations I have a function cc declared as following (1st parameter is a (list) and 2nd parameter is b (list as well), it should return 3rd list: Example: c is composition of a and b where each a pairs second "index" is b pairs first "index". So a ("aaa", "xxx") pair's...	[ -0.006011962890625, 0.01483154296875, 0.01318359375, 0.0137939453125, 0.0030059814453125, 0.0009918212890625, -0.00665283203125, 0.00616455078125, 0.0186767578125, 0.004180908203125, 0.0026092529296875, -0.0201416015625, 0.01043701171875, 0.01202392578125, -0.011474609375, -0.020385742...	[ 32036, 41018, 1556, 142508, 32354, 10060, 159978, 25632, 271, 171859, 10, 6562, 116, 2208, 876, 5608, 30646, 138, 4216, 5303, 89536, 501, 83, 166577, 111, 136, 80836, 17932, 4711, 5117, 84022, 43883, 61924, 238, 28282, 11, 4028, 3525, 47, ...	[ 0.17822265625, 0.1788330078125, 0.1361083984375, 0.270751953125, 0.1630859375, 0.19140625, 0.142578125, 0.055999755859375, 0.053497314453125, 0.1805419921875, 0.052032470703125, 0.1787109375, 0.034454345703125, 0.040374755859375, 0.095458984375, 0.03790283203125, 0.172607421875, 0....	embed
2104446_c0	2104446	haskell	0	Title: How do you use Control.Applicative to write cleaner Haskell? Problem title: How do you use Control.Applicative to write cleaner Haskell? Tags: haskell, coding-style Problem: How do you use Control.Applicative to write cleaner Haskell? In a recent answer to a style question , I wrote main = untilM (isCorrect 42) ...	How do you use Control.Applicative to write cleaner Haskell? How do you use Control.Applicative to write cleaner Haskell? haskell coding-style How Control.Applicative Haskell You Win How do you use Control.Applicative to write cleaner Haskell? In a recent answer to a style question , I wrote and Martijn helpfully sugge...	[ -0.0240478515625, 0.00830078125, 0.006011962890625, 0.01129150390625, 0.018798828125, 0.007293701171875, 0.0211181640625, -0.005950927734375, 0.01177978515625, -0.0184326171875, 0.01409912109375, -0.01043701171875, 0.0087890625, 0.02001953125, 0.0006103515625, -0.0162353515625, 0.018...	[ 11249, 4527, 27131, 5, 39179, 11048, 4935, 33022, 46622, 56, 20625, 142508, 1556, 552, 40946, 2583, 17686, 20623, 25536, 98893, 42459, 30700, 39210, 103510, 18151, 7228, 34735, 164789, 91736, 17368, 191984 ]	[ 0.05419921875, 0.1112060546875, 0.253173828125, 0.046295166015625, 0.148193359375, 0.1878662109375, 0.1934814453125, 0.1414794921875, 0.2322998046875, 0.142578125, 0.1483154296875, 0.23046875, 0.09283447265625, 0.07305908203125, 0.1085205078125, 0.0226287841796875, 0.1217041015625, ...	embed
42601831_c0	42601831	haskell	0	Title: Looping over a map in haskell Problem title: Looping over a map in haskell Tags: loops, dictionary, haskell Problem: Looping over a map in haskell import Data.Foldable (for_) import Data.Map (Map,toList) m :: Map String String m = [("a","1"),("b","2")] main = for_ (toList m) $ \(q,a) -> do putStrLn q x <- getLin...	Looping over a map in haskell Looping over a map in haskell loops dictionary haskell Data.Foldable Data.Map Looping for_ Map Yes foo.hs:5:5 Couldn Char Failed Looping over a map in haskell I get the error:- Thanks for your help. I was interested in the for_i solution , but I cannot load Control.Lens	[ 0.0030975341796875, -0.00634765625, -0.004302978515625, -0.003631591796875, -0.0113525390625, -0.0113525390625, 0.0206298828125, 0.0089111328125, 0.00799560546875, -0.02734375, 0.01373291015625, -0.005218505859375, 0.009521484375, 0.00927734375, 0.00201416015625, -0.0035858154296875, ...	[ 199694, 214, 645, 22288, 23, 1556, 142508, 40956, 45, 10763, 11809, 18345, 2886, 166179, 100, 42719, 32635, 5775, 31, 127, 7, 758, 191147, 19, 21656, 190355, 297, 18499, 4358, 60892, 14, 29806, 4, 53418, 72367, 27131, 866, 1755 ]	[ 0.203857421875, 0.07965087890625, 0.170654296875, 0.2027587890625, 0.047576904296875, 0.1614990234375, 0.2222900390625, 0.1922607421875, 0.009796142578125, 0.05712890625, 0.097412109375, 0.0853271484375, 0.1038818359375, 0.171142578125, 0.1103515625, 0.17626953125, 0.06292724609375, ...	embed
42691533_c0	42691533	haskell	0	Title: How to use different ghc builds with stack? Problem title: How to use different ghc builds with stack? Tags: haskell-stack, ghc, haskell Problem: How to use different ghc builds with stack? I would like to have different, non-ABI-compatible, builds of the same version of GHC, and use them in different projects. ...	How to use different ghc builds with stack? How to use different ghc builds with stack? haskell-stack ghc haskell How stack-setup-2.yaml stack.yaml How to use different ghc builds with stack? I would like to have different, non-ABI-compatible, builds of the same version of GHC, and use them in different projects. (In m...	[ -0.018798828125, 0.001983642578125, -0.0031585693359375, 0.0037689208984375, -0.01324462890625, -0.0004863739013671875, -0.02880859375, 0.006439208984375, 0.0172119140625, 0.037109375, 0.01275634765625, -0.0133056640625, 0.007659912109375, -0.0003490447998046875, -0.00148773193359375, ...	[ 11249, 47, 4527, 12921, 31380, 238, 45367, 7, 678, 177261, 1556, 142508, 590, 2594, 3509, 2037, 5428, 14520, 141, 1884, 351, 107837, 277, 10974, 5701, 11389, 527, 73265, 77635, 60212, 17721, 892, 1505, 191560, 20209, 706, 2676, 581, 3642, ...	[ 0.098876953125, 0.04852294921875, 0.170654296875, 0.2177734375, 0.1514892578125, 0.151611328125, 0.224365234375, 0.0716552734375, 0.1260986328125, 0.230224609375, 0.0994873046875, 0.18798828125, 0.1064453125, 0.0828857421875, 0.114013671875, 0.088134765625, 0.0987548828125, 0.14331...	embed
44544214_c0	44544214	haskell	0	Title: finite recursive "List" type Problem title: finite recursive "List" type Tags: list, infinite, haskell Problem: finite recursive "List" type It is easy to reconstruct the list type in Haskell: data MyList a = Cons a (MyList a) \| Empty deriving (Show) someList = Cons 1 (Cons 2 (Cons 3 Empty)) ...	finite recursive "List" type finite recursive "List" type list infinite haskell List MyList Cons Empty Show finite recursive "List" type It is easy to reconstruct the list type in Haskell: This allows for constructing infinites lists. Is it possible to somehow define a list type, that only allows fo...	[ -0.004638671875, 0.0118408203125, -0.0050048828125, 0.00885009765625, -0.0021209716796875, 0.005615234375, 0.000499725341796875, 0.01397705078125, -0.000545501708984375, -0.01165771484375, 0.00494384765625, -0.03271484375, 0.004638671875, 0.016845703125, 0.015380859375, 0.017333984375,...	[ 94418, 13, 195625, 5844, 154663, 10644, 5303, 54241, 1556, 142508, 32036, 2646, 39215, 31678, 939, 17367, 23468, 44188, 36716, 23, 20625, 114864, 64549, 90, 7722, 209303, 61924, 4734, 8789, 7464, 61799, 140909, 7, 27781, 3688, 831, 91995, 71,...	[ 0.1866455078125, 0.06884765625, 0.1888427734375, 0.0926513671875, 0.202392578125, 0.2060546875, 0.208251953125, 0.153076171875, 0.1129150390625, 0.2418212890625, 0.1422119140625, 0.083251953125, 0.146728515625, 0.118408203125, 0.000946044921875, 0.0377197265625, 0.0718994140625, 0....	embed
47048646_c0	47048646	haskell	0	Title: Haskell: looping over user input gracefully Problem title: Haskell: looping over user input gracefully Tags: haskell, monads, loops Problem: Haskell: looping over user input gracefully This is an example from Learn You a Haskell : main = do putStrLn "hello, what's your name?" name <- getLine putStrLn ("Hey, " ++...	Haskell: looping over user input gracefully Haskell: looping over user input gracefully haskell monads loops Haskell Learn You Hey mapM_ Haskell: looping over user input gracefully This is an example from Learn You a Haskell : The same redone without do for clarity: How am I supposed to loop it cleanly (until "q"), the...	[ -0.0147705078125, 0.0022125244140625, 0.01123046875, 0.01422119140625, -0.0004558563232421875, 0.0107421875, 0.03076171875, 0.0000209808349609375, 0.012939453125, -0.057861328125, 0.005096435546875, -0.00762939453125, -0.010498046875, 0.00872802734375, -0.006439208984375, 0.00546264648...	[ 20625, 142508, 40956, 214, 645, 38937, 107730, 4224, 329, 126351, 1556, 2667, 712, 134031, 2583, 28240, 22288, 594, 27781, 5701, 41313, 86, 15490, 54, 17306, 2481, 11249, 134598, 442, 46622, 3675, 864, 3917, 4032, 111, 20947, 3168, 3017, 15...	[ 0.1380615234375, 0.2310791015625, 0.1951904296875, 0.026885986328125, 0.2008056640625, 0.15478515625, 0.212646484375, 0.07342529296875, 0.0533447265625, 0.0748291015625, 0.0975341796875, 0.038360595703125, 0.07244873046875, 0.103271484375, 0.059356689453125, 0.0797119140625, 0.092407...	embed
66158250_c0	66158250	haskell	0	Title: Is there a function that makes a unique combinations from a list of lists? Haskell Problem title: Is there a function that makes a unique combinations from a list of lists? Haskell Tags: haskell Problem: Is there a function that makes a unique combinations from a list of lists? Haskell I was wondering if there i...	Is there a function that makes a unique combinations from a list of lists? Haskell Is there a function that makes a unique combinations from a list of lists? Haskell haskell a Haskell Input Output x:xs Is there a function that makes a unique combinations from a list of lists? Haskell I was wondering if there is a funct...	[ -0.0034942626953125, 0.041015625, -0.0021514892578125, -0.00341796875, -0.0198974609375, 0.0181884765625, -0.01495361328125, -0.0181884765625, 0.0189208984375, -0.002899169921875, -0.0125732421875, 0.00341796875, 0.039794921875, 0.03759765625, -0.016357421875, 0.001800537109375, 0.01...	[ 2071, 2685, 10, 32354, 450, 30482, 36998, 162515, 7, 1295, 5303, 111, 20625, 142508, 1556, 360, 7077, 13538, 1022, 12, 425, 149016, 14602, 903, 110, 29479, 3525, 47, 37842, 959, 41206 ]	[ 0.023162841796875, 0.0634765625, 0.0587158203125, 0.2369384765625, 0.046417236328125, 0.159912109375, 0.265625, 0.2890625, 0.1805419921875, 0.1519775390625, 0.2425537109375, 0.071533203125, 0.139892578125, 0.228515625, 0.1195068359375, 0.06890869140625, 0.04583740234375, 0.11230468...	embed
69698522_c0	69698522	haskell	0	Title: Couldn't match type ‘Integer’ with ‘Int’ Problem title: Couldn't match type ‘Integer’ with ‘Int’ Tags: haskell Problem: Couldn't match type ‘Integer’ with ‘Int’ I'm starting my journey into Haskell and running into my first issue: In my Haskell script: myList = [1, 2, 3, 4, 5, 6, 7] average ns = sum ns...	Couldn't match type ‘Integer’ with ‘Int’ Couldn't match type ‘Integer’ with ‘Int’ haskell Couldn Integer Couldn't match type ‘Integer’ with ‘Int’ I'm starting my journey into Haskell and running into my first issue: In my Haskell script: when i'm in the ghci repl , i get two different results: if i type > ave...	[ -0.0218505859375, -0.005889892578125, 0.0203857421875, 0.001556396484375, -0.0096435546875, 0.00738525390625, -0.00122833251953125, 0.0067138671875, 0.002838134765625, -0.0174560546875, 0.0269775390625, -0.03173828125, 0.0164794921875, -0.00396728515625, 0.00384521484375, -0.0101928710...	[ 191147, 19, 3768, 18, 14858, 10644, 4153, 67, 1505, 678, 1556, 142508, 44401, 120696, 20625, 51042, 5117, 31089, 26499, 23, 31380, 318, 2424, 6626, 12921, 50339, 83080, 116, 138, 201, 84751, 34292, 9790, 759, 154663, 18499, 10625, 52366, 28...	[ 0.1016845703125, 0.006439208984375, 0.0501708984375, 0.1480712890625, 0.2020263671875, 0.2122802734375, 0.1068115234375, 0.1826171875, 0.1778564453125, 0.08856201171875, 0.137451171875, 0.216552734375, 0.215576171875, 0.0184326171875, 0.1302490234375, 0.01055908203125, 0.021377563476...	embed
55133331_c0	55133331	haskell	0	Title: How to store value of function call to a variable Problem title: How to store value of function call to a variable Tags: haskell Problem: How to store value of function call to a variable I have this function where I need to check if the gdc of the numbers [1..n] and n is == 1 and do some calculations then. So I...	How to store value of function call to a variable How to store value of function call to a variable haskell first How Integer n-1 How to store value of function call to a variable I have this function where I need to check if the gdc of the numbers [1..n] and n is == 1 and do some calculations then. So I am stuck becau...	[ -0.0189208984375, -0.002288818359375, -0.0004444122314453125, 0.01190185546875, 0.007598876953125, 0.00482177734375, 0.0010833740234375, 0.0003147125244140625, 0.004608154296875, -0.0279541015625, 0.01708984375, -0.0037841796875, 0.00860595703125, -0.0026092529296875, 0.0191650390625, ...	[ 11249, 47, 4343, 34292, 111, 32354, 11782, 77336, 10, 1556, 142508, 5117, 44401, 653, 5759, 3871, 12765, 2174, 706, 71, 238, 70, 101935, 19, 69112, 106, 74481, 179933, 831, 7413, 3917, 61475, 678, 14012, 361, 6863, 195625, 1830, 24209, 30...	[ 0.0989990234375, 0.185302734375, 0.2208251953125, 0.2332763671875, 0.111572265625, 0.2379150390625, 0.2318115234375, 0.296875, 0.0275421142578125, 0.1414794921875, 0.2371826171875, 0.10205078125, 0.1676025390625, 0.1217041015625, 0.1654052734375, 0.001800537109375, 0.137451171875, ...	embed
55880423_c0	55880423	haskell	0	Title: Free Monad for AST > 1-arity? Problem title: Free Monad for AST > 1-arity? Tags: category-theory, haskell, compiler-construction Problem: Free Monad for AST > 1-arity? When I'm saying 1-arity \| 2-arity \| n-arity , I'm referring to tree in grap theory k-ary tree : a k-ary tree is a rooted tree in which each...	Free Monad for AST > 1-arity? Free Monad for AST > 1-arity? category-theory haskell compiler-construction Free Monad AST Toy Output Bell Done Free Monad for AST > 1-arity? When I'm saying 1-arity \| 2-arity \| n-arity , I'm referring to tree in grap theory k-ary tree : I have been using Free Monad in my project to ...	[ 0.00323486328125, 0.00201416015625, -0.00579833984375, 0.00799560546875, -0.002288818359375, 0.0008697509765625, -0.0201416015625, -0.00445556640625, -0.01153564453125, -0.0250244140625, 0.0186767578125, -0.0299072265625, 0.0030364990234375, 0.02197265625, -0.0145263671875, -0.01086425...	[ 5153, 60331, 71, 100, 48963, 5386, 4317, 147, 2481, 95487, 2347, 30675, 1556, 142508, 9969, 34759, 238478, 109451, 13538, 33500, 984, 977, 54433, 4720, 653, 53201, 4224, 254, 154453, 472, 6635, 13452, 28282, 19336, 28, 114479, 27781, 93232, ...	[ 0.2049560546875, 0.2269287109375, 0.2108154296875, 0.064208984375, 0.188720703125, 0.1258544921875, 0.1243896484375, 0.162841796875, 0.1788330078125, 0.108154296875, 0.0472412109375, 0.010345458984375, 0.09814453125, 0.212890625, 0.06878662109375, 0.043487548828125, 0.02783203125, ...	embed
61021188_c0	61021188	haskell	0	Title: Converting rational number to string Problem title: Converting rational number to string Tags: rational-number, haskell Problem: Converting rational number to string I have the following requirements: given a rational number (x % y): If y != 1 => return "x y" Otherwise: return "x" The following function works: i...	Converting rational number to string Converting rational number to string rational-number haskell Data.Ratio Converting my_show Integral Show Ratio Converting rational number to string I have the following requirements: given a rational number (x % y): If y != 1 => return "x y" Otherwise: return "x" The following funct...	[ -0.0238037109375, -0.0126953125, -0.0004329681396484375, -0.004791259765625, 0.00518798828125, 0.003814697265625, 0.0208740234375, 0.0023040771484375, 0.0009918212890625, 0.0103759765625, 0.01214599609375, 0.003692626953125, 0.0030364990234375, -0.00171661376953125, -0.0069580078125, 0...	[ 1657, 814, 1916, 168487, 14012, 47, 79315, 2606, 1297, 1556, 142508, 11809, 1052, 28645, 759, 31374, 204681, 17367, 2552, 5565, 25632, 96679, 34475, 1745, 113, 4263, 711, 106, 44357, 30646, 425, 90825, 32354, 43240, 442, 7722, 1286, 27650, ...	[ 0.044189453125, 0.1302490234375, 0.0278778076171875, 0.2474365234375, 0.1746826171875, 0.1041259765625, 0.263427734375, 0.1197509765625, 0.0341796875, 0.0885009765625, 0.1781005859375, 0.0694580078125, 0.0880126953125, 0.16015625, 0.0841064453125, 0.14794921875, 0.134521484375, 0.1...	embed
24233238_c0	24233238	haskell	0	Title: Comparing Elements at the same Index in two lists Problem title: Comparing Elements at the same Index in two lists Tags: haskell Problem: Comparing Elements at the same Index in two lists My problem is the following: I have one function that returns a specific list, lets say we have: Func = [1,14,12,19,17] Now I...	Comparing Elements at the same Index in two lists Comparing Elements at the same Index in two lists haskell Comparing Elements Index Func List Comparing Elements at the same Index in two lists My problem is the following: I have one function that returns a specific list, lets say we have: Func = [1,14,12,19,17] Now I h...	[ 0.0000762939453125, 0.00176239013671875, -0.0032958984375, -0.004119873046875, -0.00933837890625, 0.0147705078125, 0.0196533203125, -0.002777099609375, 0.0125732421875, -0.0076904296875, 0.005035400390625, -0.004638671875, 0.004119873046875, 0.0220947265625, -0.01336669921875, -0.00466...	[ 113307, 214, 48325, 99, 5701, 31471, 23, 6626, 5303, 1556, 142508, 28670, 32036, 2967, 70, 1632, 32354, 30646, 29458, 238, 2592, 1530, 2947, 2489, 15700, 1662, 2681, 3444, 7413, 1810, 2174, 5117, 12830, 105950, 47, 17932, 65395, 19, 27781, ...	[ 0.2001953125, 0.055816650390625, 0.2098388671875, 0.03082275390625, 0.1236572265625, 0.24365234375, 0.041656494140625, 0.1671142578125, 0.20458984375, 0.135498046875, 0.2149658203125, 0.1431884765625, 0.1595458984375, 0.1055908203125, 0.012359619140625, 0.0181121826171875, 0.16479492...	embed
64981503_c0	64981503	haskell	0	Title: Getting a type mismatch error with the Haskell zipWith function Problem title: Getting a type mismatch error with the Haskell zipWith function Tags: types, algebraic-data-types, custom-data-type, type-mismatch, haskell Problem: Getting a type mismatch error with the Haskell zipWith function I am new to Haskell. ...	Getting a type mismatch error with the Haskell zipWith function Getting a type mismatch error with the Haskell zipWith function types algebraic-data-types custom-data-type type-mismatch haskell Getting Haskell Neuron Double Read Show Getting a type mismatch error with the Haskell zipWith function I am new to Haskell. I...	[ -0.0019378662109375, 0.0147705078125, -0.00738525390625, 0.0244140625, -0.0167236328125, 0.0189208984375, -0.00958251953125, 0.00106048583984375, 0.00421142578125, -0.03515625, -0.00101470947265625, -0.010986328125, -0.006103515625, -0.0142822265625, -0.01055908203125, -0.00537109375, ...	[ 210732, 10644, 1239, 98753, 18499, 20625, 142508, 68330, 194583, 32354, 678, 52895, 2844, 10135, 50986, 114122, 2179, 1556, 107481, 19, 107172, 4764, 17367, 3525, 2053, 10002, 5303, 142424, 31577, 10554, 12638, 12830, 157272, 3789, 9969, 1340, ...	[ 0.00274658203125, 0.2041015625, 0.1163330078125, 0.2481689453125, 0.1771240234375, 0.1138916015625, 0.18994140625, 0.191650390625, 0.257080078125, 0.107666015625, 0.0284576416015625, 0.134765625, 0.001251220703125, 0.01348876953125, 0.1221923828125, 0.0648193359375, 0.0657958984375, ...	embed
30961498_c0	30961498	haskell	0	Title: LLVM compilation not working with Haskell on Yosemite Problem title: LLVM compilation not working with Haskell on Yosemite Tags: llvm, haskell, ghc Problem: LLVM compilation not working with Haskell on Yosemite I'm trying to use llvm with haskell and I'm getting the error "illegal hardware instruction" Details: ...	LLVM compilation not working with Haskell on Yosemite LLVM compilation not working with Haskell on Yosemite llvm haskell ghc LLVM Haskell Yosemite Main Hello World firstProgram.hs LLVM compilation not working with Haskell on Yosemite I'm trying to use llvm with haskell and I'm getting the error "illegal hardware instru...	[ -0.01470947265625, -0.01007080078125, -0.004119873046875, 0.0091552734375, 0.00020313262939453125, 0.00872802734375, -0.0042724609375, -0.019287109375, -0.029052734375, -0.0390625, -0.0020599365234375, -0.025390625, 0.01708984375, -0.00372314453125, 0.01470947265625, -0.003768920898437...	[ 99954, 47599, 98352, 959, 20697, 678, 20625, 142508, 98, 6949, 184, 35093, 96, 3723, 39, 1556, 31380, 238, 12321, 35378, 6661, 5117, 148968, 127, 31577, 4527, 18499, 2186, 2870, 76407, 188336, 9969, 49725, 8781, 33600, 31, 8999, 1528, 3034,...	[ 0.1658935546875, 0.2900390625, 0.20654296875, 0.055328369140625, 0.1336669921875, 0.1456298828125, 0.1541748046875, 0.25537109375, 0.06097412109375, 0.159912109375, 0.1142578125, 0.2047119140625, 0.055908203125, 0.1844482421875, 0.1822509765625, 0.1304931640625, 0.1058349609375, 0....	embed
58281577_c0	58281577	haskell	0	Title: State with IO in Haskell for CLI application Problem title: State with IO in Haskell for CLI application Tags: haskell, immutability, state Problem: State with IO in Haskell for CLI application I am trying to write a simple implementation of the game Hangman in Haskell and one problem I have is keeping the state...	State with IO in Haskell for CLI application State with IO in Haskell for CLI application haskell immutability state State Haskell CLI Char StateT State with IO in Haskell for CLI application I am trying to write a simple implementation of the game Hangman in Haskell and one problem I have is keeping the state of the g...	[ -0.01123046875, -0.00958251953125, -0.00848388671875, 0.0191650390625, -0.0021209716796875, 0.0177001953125, 0.01043701171875, -0.01300048828125, 0.006134033203125, -0.0103759765625, 0.01953125, -0.006011962890625, -0.0015106201171875, 0.0250244140625, -0.0216064453125, 0.0036163330078...	[ 22836, 678, 17780, 23, 20625, 142508, 100, 313, 10927, 38415, 1556, 566, 14311, 41159, 11341, 21656, 618, 31577, 33022, 10, 8781, 208124, 6712, 43454, 669, 2967, 120260, 111, 112892, 164789, 11389, 33342, 9655, 37202, 831, 26366, 35166, 11249...	[ 0.2076416015625, 0.14306640625, 0.2147216796875, 0.07476806640625, 0.157470703125, 0.243896484375, 0.0626220703125, 0.0273590087890625, 0.1552734375, 0.1114501953125, 0.13671875, 0.0291595458984375, 0.1566162109375, 0.05401611328125, 0.2318115234375, 0.1605224609375, 0.126220703125, ...	embed
10576868_c0	10576868	haskell	0	Title: How can I uninstall a version of a Cabal package? Problem title: How can I uninstall a version of a Cabal package? Tags: ghc, haskell, cabal Problem: How can I uninstall a version of a Cabal package? Happstack Lite is breaking on me because it's getting blaze-html version 0.5 and it wants version 0.4. Cabal says...	How can I uninstall a version of a Cabal package? How can I uninstall a version of a Cabal package? ghc haskell cabal How Cabal How can I uninstall a version of a Cabal package? Happstack Lite is breaking on me because it's getting blaze-html version 0.5 and it wants version 0.4. Cabal says that both versions 0.4.3.4 a...	[ 0.01043701171875, 0.0113525390625, 0.029541015625, 0.0198974609375, -0.016845703125, -0.0128173828125, -0.0140380859375, 0.01104736328125, -0.0031890869140625, 0.030029296875, -0.0167236328125, -0.0299072265625, -0.007659912109375, -0.000873565673828125, -0.01409912109375, -0.005615234...	[ 11249, 831, 51, 80383, 11389, 30438, 289, 98169, 31380, 238, 1556, 142508, 109524, 111, 208612, 590, 2594, 52687, 116987, 98, 163, 20949, 9932, 731, 7693, 81730, 86171, 121254, 15044, 172508, 99929, 20600, 3444, 87388, 4527, 114210, 959, 7510...	[ 0.055511474609375, 0.06500244140625, 0.153076171875, 0.2452392578125, 0.220703125, 0.2021484375, 0.19287109375, 0.197509765625, 0.1290283203125, 0.13525390625, 0.0989990234375, 0.2025146484375, 0.2452392578125, 0.00390625, 0.1668701171875, 0.1221923828125, 0.139404296875, 0.1910400...	embed
41030290_c1	41030290	haskell	1	second <- peekC case (first, msecond) of (0x1b, Just 0x5b) -> do dropWhileC (not . Word8.isLetter) dropC 1 _ -> yield first toWord8 = concatC toByteString :: Monad m => ConduitM Word8 ByteString m () toByteString = (mapC BS.singleton .\| foldC) >>= yield This program is supposed to echo back the filtered contents of std...	second <- peekC case (first, msecond) of (0x1b, Just 0x5b) -> do dropWhileC (not . Word8.isLetter) dropC 1 _ -> yield first toWord8 = concatC toByteString :: Monad m => ConduitM Word8 ByteString m () toByteString = (mapC BS.singleton .\| foldC) >>= yield This program is supposed to echo back the filtered contents of std...	[ 0.00604248046875, 0.000835418701171875, -0.0216064453125, 0.01373291015625, -0.01080322265625, 0.025146484375, 0.00604248046875, 0.005523681640625, 0.01708984375, 0.007171630859375, -0.01239013671875, 0.006927490234375, 0.00848388671875, 0.006378173828125, -0.01483154296875, -0.0016250...	[ 17932, 280, 343, 441, 7225, 347, 191633, 22085, 425, 275, 9563, 757, 758, 36069, 979, 133, 22543, 1019, 164, 5267, 3055, 106, 11180, 19388, 5117, 47, 164805, 158, 4460, 75358, 67, 71713, 60331, 71, 1657, 112061, 594, 3311, 62346, 1507, ...	[ 0.15576171875, 0.10302734375, 0.1224365234375, 0.09490966796875, 0.058074951171875, 0.0816650390625, 0.1795654296875, 0.000213623046875, 0.034423828125, 0.059478759765625, 0.073974609375, 0.03155517578125, 0.053466796875, 0.146728515625, 0.0806884765625, 0.045562744140625, 0.07165527...	embed
9786675_c0	9786675	haskell	0	Title: List of tuples to just list using map haskell Problem title: List of tuples to just list using map haskell Tags: haskell Problem: List of tuples to just list using map haskell I want to convert list of tuples: [(2,2,2), (3,3,3), (4,4,4), (5,5,5)] to just list: [2,2,2,3,3,3,4,4,4,5,5,5] I try this map (\(a,b,c,d)...	List of tuples to just list using map haskell List of tuples to just list using map haskell haskell map the List a:b:c:d Prelude a:b:c Num Possible List of tuples to just list using map haskell I want to convert list of tuples: [(2,2,2), (3,3,3), (4,4,4), (5,5,5)] to just list: [2,2,2,3,3,3,4,4,4,5,5,5] I try this but ...	[ -0.0020751953125, 0.0107421875, 0.01300048828125, 0.00946044921875, -0.0093994140625, 0.0125732421875, -0.006591796875, 0.013916015625, 0.00787353515625, -0.03271484375, -0.0033416748046875, -0.03369140625, 0.00390625, 0.0201416015625, -0.008544921875, -0.005035400390625, -0.00150299...	[ 32036, 111, 370, 99726, 47, 1660, 5303, 17368, 22288, 1556, 142508, 10, 12, 275, 238, 71, 1914, 822, 112, 52782, 115861, 2661, 3444, 96760, 378, 54753, 304, 10461, 6896, 363, 21320, 9451, 124093, 11516, 125592, 268, 155761, 80389, 9790, 1...	[ 0.19091796875, 0.06463623046875, 0.192138671875, 0.297607421875, 0.1011962890625, 0.1832275390625, 0.261474609375, 0.0919189453125, 0.245361328125, 0.1834716796875, 0.2467041015625, 0.04351806640625, 0.04962158203125, 0.047271728515625, 0.037994384765625, 0.10137939453125, 0.06268310...	embed
32531508_c0	32531508	haskell	0	Title: Haskell parse error from incorrect indent Problem title: Haskell parse error from incorrect indent Tags: haskell Problem: Haskell parse error from incorrect indent Can anyone explain why this is a syntax error? f = f' where f' = do if True then return () else return () main = f If I give more indentation to the ...	Haskell parse error from incorrect indent Haskell parse error from incorrect indent haskell incorrect Haskell Haskell parse error from incorrect indent Can anyone explain why this is a syntax error? If I give more indentation to the if block, then it somehow compiles well. Or I can just separate the where , which I'd n...	[ 0.004547119140625, 0.006988525390625, -0.0186767578125, 0.00537109375, -0.0101318359375, 0.01483154296875, -0.0235595703125, -0.003570556640625, 0.007415771484375, -0.0159912109375, 0.003631591796875, -0.009033203125, -0.00014209747314453125, 0.00250244140625, 0.016845703125, 0.0087890...	[ 20625, 142508, 366, 184, 18499, 1295, 214552, 18597, 18, 1556, 73342, 15400, 903, 6002, 86531, 8337, 1286, 22062, 2174, 46389, 209303, 9969, 1340, 5299, 84797, 7440, 3638, 187136, 13416, 68346, 100094, 4068, 363, 211032, 44084, 27781, 17932 ]	[ 0.1297607421875, 0.208984375, 0.166015625, 0.08837890625, 0.1708984375, 0.0867919921875, 0.2088623046875, 0.2017822265625, 0.138427734375, 0.15673828125, 0.08099365234375, 0.074462890625, 0.011260986328125, 0.046600341796875, 0.172607421875, 0.012786865234375, 0.07037353515625, 0.1...	embed
64408116_c0	64408116	haskell	0	Title: Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Problem title: Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Tags: macos, haskell, gtk3, user-interface Problem: Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Haskell-gi seems to be the most up-to-date...	Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Installing Haskell-gi on macOS Catalina and creating GUI in Haskell macos haskell gtk3 user-interface Installing Haskell-gi Catalina GUI Haskell gtk3 Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Haskell-gi seems to be the most up...	[ -0.012451171875, 0.003448486328125, 0.01123046875, -0.008544921875, 0.002349853515625, 0.0079345703125, 0.009765625, -0.01953125, -0.00225830078125, -0.007720947265625, -0.0096435546875, -0.078125, -0.011474609375, -0.0166015625, -0.01373291015625, 0.000957489013671875, -0.0114135742...	[ 107951, 20625, 142508, 735, 19138, 7285, 128342, 885, 105233, 195490, 7840, 1556, 31472, 363, 38937, 10433, 2684, 17489, 527, 29735, 47, 128239, 35773, 143006, 6982, 19048, 20600, 442, 155965, 62270, 32102, 30700, 4727, 20697, 3773, 5809, 959, ...	[ 0.1405029296875, 0.1439208984375, 0.265380859375, 0.198486328125, 0.1192626953125, 0.1015625, 0.178955078125, 0.2056884765625, 0.088623046875, 0.2161865234375, 0.04248046875, 0.059967041015625, 0.1309814453125, 0.10614013671875, 0.010009765625, 0.010467529296875, 0.0193634033203125, ...	embed
73056166_c0	73056166	haskell	0	Title: Expand a NominalDiffTime by a factor Problem title: Expand a NominalDiffTime by a factor Tags: haskell Problem: Expand a NominalDiffTime by a factor Using the time library in Haskell, I have computed delta :: NominalDiffTime previously in my program, and I have a successFactor :: Double , successFactor = 2.8 . I...	Expand a NominalDiffTime by a factor Expand a NominalDiffTime by a factor haskell Expand NominalDiffTime Double Couldn time1.9.3:Data.Time.Clock.Internal.NominalDiffTime.NominalDiffTime Expand a NominalDiffTime by a factor Using the time library in Haskell, I have computed delta :: NominalDiffTime previously in my prog...	[ 0.0145263671875, 0.006622314453125, 0.0115966796875, 0.03759765625, 0.005950927734375, -0.0279541015625, -0.007415771484375, 0.020263671875, -0.01007080078125, -0.022705078125, 0.01019287109375, -0.016845703125, -0.01531982421875, -0.0220947265625, -0.0299072265625, -0.015869140625, ...	[ 60075, 2940, 438, 1249, 289, 397, 32920, 70059, 390, 31461, 10, 1556, 142508, 107172, 191147, 1733, 158304, 363, 12, 137989, 21135, 44851, 5021, 35773, 20625, 7077, 40703, 198395, 1528, 36272, 135518, 1290, 1984, 82295, 3444, 76, 9969, 6743, ...	[ 0.150634765625, 0.0859375, 0.108154296875, 0.185791015625, 0.06787109375, 0.08966064453125, 0.2220458984375, 0.2454833984375, 0.1126708984375, 0.242431640625, 0.013641357421875, 0.1334228515625, 0.243896484375, 0.176025390625, 0.1439208984375, 0.19189453125, 0.1348876953125, 0.0860...	embed
46373083_c0	46373083	haskell	0	Title: How to create a function that expects a Integral List Problem title: How to create a function that expects a Integral List Tags: haskell Problem: How to create a function that expects a Integral List So I'm learning Haskell for school and was learning about functions, syntax and typeclasses over at learnyouahask...	How to create a function that expects a Integral List How to create a function that expects a Integral List haskell How Integral List Num How to create a function that expects a Integral List So I'm learning Haskell for school and was learning about functions, syntax and typeclasses over at learnyouahaskell and was won...	[ -0.005218505859375, -0.0172119140625, -0.00173187255859375, 0.026611328125, -0.01287841796875, 0.0233154296875, -0.000560760498046875, -0.023681640625, -0.0026702880859375, -0.00872802734375, 0.0130615234375, -0.038330078125, 0.0024871826171875, 0.0048828125, -0.01043701171875, -0.0104...	[ 11249, 28282, 32354, 450, 41206, 7, 204681, 32036, 47, 10, 1556, 142508, 52782, 52080, 20625, 100, 10696, 10644, 67413, 30698, 53927, 149016, 51776, 23, 5303, 237, 171859, 100094, 15190, 26455, 18770, 6626, 5423, 756, 765, 111, 103332, 18507,...	[ 0.07415771484375, 0.194580078125, 0.209716796875, 0.0618896484375, 0.2470703125, 0.06732177734375, 0.25244140625, 0.25244140625, 0.0184783935546875, 0.022552490234375, 0.127197265625, 0.198974609375, 0.168701171875, 0.0267791748046875, 0.093994140625, 0.010406494140625, 0.07464599609...	embed
48239570_c0	48239570	haskell	0	Title: A type constructor IS a monad or HAS a monad? Problem title: A type constructor IS a monad or HAS a monad? Tags: category-theory, scala, language-agnostic, haskell, functional-programming Problem: A type constructor IS a monad or HAS a monad? People usually say a type IS a monad. In some functional languages and...	A type constructor IS a monad or HAS a monad? A type constructor IS a monad or HAS a monad? category-theory scala language-agnostic haskell functional-programming HAS A type constructor IS a monad or HAS a monad? People usually say a type IS a monad. In some functional languages and libraries (like Scala/Scalaz), you h...	[ -0.0006561279296875, -0.00836181640625, -0.007476806640625, 0.0201416015625, -0.00189208984375, -0.008544921875, -0.004241943359375, 0.002197265625, -0.0036163330078125, -0.032958984375, 0.0225830078125, -0.0341796875, 0.004730224609375, 0.007293701171875, -0.00653076171875, -0.0016021...	[ 10644, 64549, 748, 15744, 10, 2667, 712, 707, 101413, 62, 95487, 146232, 46876, 2895, 1556, 142508, 123309, 28966, 41021, 56104, 5154, 35773, 152653, 62309, 169, 765, 32036, 86769, 61924, 60331, 71, 208124, 84797, 7311, 69871, 5426, 105233, 1...	[ 0.284912109375, 0.1993408203125, 0.176513671875, 0.135009765625, 0.0655517578125, 0.1632080078125, 0.2078857421875, 0.022674560546875, 0.1566162109375, 0.046051025390625, 0.0892333984375, 0.1121826171875, 0.1195068359375, 0.057403564453125, 0.0513916015625, 0.1563720703125, 0.1446533...	embed
13106036_c0	13106036	haskell	0	Title: Link to static file in Yesod that doesn't have Haskell identifier Problem title: Link to static file in Yesod that doesn't have Haskell identifier Tags: haskell, yesod Problem: Link to static file in Yesod that doesn't have Haskell identifier Given a default Yesod scaffold, with file upload implemented...	Link to static file in Yesod that doesn't have Haskell identifier Link to static file in Yesod that doesn't have Haskell identifier haskell yesod Link Yesod Haskell Link to static file in Yesod that doesn't have Haskell identifier Given a default Yesod scaffold, with file upload implemented by moving the uplo...	[ -0.000698089599609375, 0.0196533203125, 0.016845703125, -0.0064697265625, -0.0211181640625, 0.0172119140625, -0.00982666015625, -0.00439453125, -0.007720947265625, -0.03857421875, -0.031982421875, -0.0213623046875, -0.011474609375, 0.0079345703125, 0.005157470703125, -0.01055908203125,...	[ 12779, 47, 201939, 11435, 32635, 2199, 22027, 3768, 18, 765, 20625, 142508, 42485, 56, 23, 1556, 2422, 23722, 114977, 9023, 2407, 42822, 70622, 29479, 98567, 3934, 14364, 3642, 54, 3126, 53, 3638, 102158, 174350, 5213, 13348, 139392, 87, 83...	[ 0.196044921875, 0.1815185546875, 0.26025390625, 0.1842041015625, 0.1788330078125, 0.2449951171875, 0.0780029296875, 0.03277587890625, 0.10028076171875, 0.049285888671875, 0.1397705078125, 0.2388916015625, 0.1842041015625, 0.07403564453125, 0.050567626953125, 0.1107177734375, 0.130859...	embed
25780555_c0	25780555	haskell	0	Title: Best way to generate a list with state (Haskell) Problem title: Best way to generate a list with state (Haskell) Tags: haskell, monad-transformers, state-monad, monads Problem: Best way to generate a list with state (Haskell) Let's say I want to generate a list of items, while keeping track of some state. For ex...	Best way to generate a list with state (Haskell) Best way to generate a list with state (Haskell) haskell monad-transformers state-monad monads Best Haskell State Best way to generate a list with state (Haskell) Let's say I want to generate a list of items, while keeping track of some state. For example, generate [1..]...	[ -0.01318359375, -0.000370025634765625, -0.00341796875, -0.018310546875, 0.00787353515625, -0.009033203125, -0.01904296875, -0.0166015625, 0.0074462890625, -0.036865234375, 0.010498046875, 0.01300048828125, -0.00848388671875, 0.01336669921875, -0.01165771484375, -0.01385498046875, -0....	[ 11345, 3917, 139392, 5303, 678, 11341, 6495, 7, 142508, 1556, 2667, 712, 215175, 1314, 3796, 20625, 22836, 10, 3444, 55769, 120260, 28560, 68252, 5, 2060, 96759, 101935, 627, 8066, 37202, 6626, 48322, 20594, 903, 4879, 155370, 60331, 6468, ...	[ 0.1055908203125, 0.06982421875, 0.2210693359375, 0.2435302734375, 0.12060546875, 0.23388671875, 0.08642578125, 0.049468994140625, 0.2440185546875, 0.0904541015625, 0.115478515625, 0.1292724609375, 0.179931640625, 0.0933837890625, 0.05975341796875, 0.10076904296875, 0.1907958984375, ...	embed
52488255_c0	52488255	haskell	0	Title: join for different monads in Haskell Problem title: join for different monads in Haskell Tags: monads, haskell Problem: join for different monads in Haskell I know I can use join to remove the first level of list join [["dog"]] " output ["dog"] But why the following is not working join $ (Just ["dog"]) got error...	join for different monads in Haskell join for different monads in Haskell monads haskell Haskell Just Couldn Maybe Monad join for different monads in Haskell I know I can use join to remove the first level of list join [["dog"]] " output ["dog"] But why the following is not working We know Maybe and [] are both Monad i...	[ -0.01397705078125, 0.005340576171875, 0.006805419921875, 0.01324462890625, 0.0087890625, 0.018310546875, -0.00531005859375, 0.01544189453125, 0.018798828125, -0.001678466796875, 0.0184326171875, -0.040283203125, 0.00665283203125, -0.0284423828125, -0.01470947265625, -0.005859375, -0....	[ 33284, 100, 12921, 2667, 712, 7, 23, 20625, 142508, 1556, 9563, 191147, 83425, 60331, 71, 3714, 831, 4527, 87388, 5117, 17366, 111, 5303, 38507, 140992, 15400, 25632, 959, 20697, 136, 15044, 83, 44691, 4734, 5701, 10644, 32354, 21373, 2499,...	[ 0.253662109375, 0.1318359375, 0.199951171875, 0.1302490234375, 0.1531982421875, 0.05072021484375, 0.051361083984375, 0.130615234375, 0.2578125, 0.09814453125, 0.0221710205078125, 0.1025390625, 0.26416015625, 0.1800537109375, 0.1390380859375, 0.0521240234375, 0.033843994140625, 0.02...	embed
21584744_c0	21584744	haskell	0	Title: How do I use a function depending on the type of an argument? Problem title: How do I use a function depending on the type of an argument? Tags: haskell, opengl Problem: How do I use a function depending on the type of an argument? I am using Haskell and OpenGL. OpenGL has a way to load variables using a set of ...	How do I use a function depending on the type of an argument? How do I use a function depending on the type of an argument? haskell opengl How glUniform1i glUniform1f glUniform2i intValue1 intValue2 How do I use a function depending on the type of an argument? I am using Haskell and OpenGL. OpenGL has a way to load var...	[ -0.00677490234375, 0.002960205078125, -0.005645751953125, -0.020751953125, 0.0013427734375, 0.0062255859375, -0.0189208984375, -0.000797271728515625, -0.00075531005859375, -0.0047607421875, -0.00732421875, -0.038818359375, 0.008056640625, -0.0286865234375, 0, -0.005401611328125, -0.0...	[ 11249, 54, 87, 4527, 32354, 8, 96819, 98, 10644, 111, 10750, 10, 142, 1556, 142508, 9803, 11016, 39575, 85600, 5037, 14, 420, 23, 18, 856, 50770, 418, 304, 17368, 20625, 136, 13527, 78703, 3917, 72367, 77336, 5423, 61514, 3900, 19309, 4...	[ 0.1102294921875, 0.044158935546875, 0.043731689453125, 0.16650390625, 0.25048828125, 0.1126708984375, 0.1981201171875, 0.090576171875, 0.1962890625, 0.0694580078125, 0.24609375, 0.07452392578125, 0.03424072265625, 0.07958984375, 0.202880859375, 0.08917236328125, 0.149658203125, 0.0...	embed
4340091_c0	4340091	haskell	0	Title: Iterating along 2 lists at the same time in haskell (without resorting to zip) Problem title: Iterating along 2 lists at the same time in haskell (without resorting to zip) Tags: functional-programming, haskell Problem: Iterating along 2 lists at the same time in haskell (without resorting to zip) I have 2 lists...	Iterating along 2 lists at the same time in haskell (without resorting to zip) Iterating along 2 lists at the same time in haskell (without resorting to zip) functional-programming haskell Iterating Iterating along 2 lists at the same time in haskell (without resorting to zip) I have 2 lists: and and I'd like to turn i...	[ -0.003082275390625, 0.0062255859375, -0.0128173828125, 0.0038299560546875, -0.004486083984375, 0.025146484375, -0.011474609375, -0.008544921875, 0.0185546875, -0.0478515625, 0.01019287109375, 0.001922607421875, 0.01904296875, 0.0107421875, -0.0101318359375, 0.011474609375, -0.0123291...	[ 87, 67, 98767, 33233, 116, 5303, 7, 5701, 1733, 1556, 142508, 6056, 70634, 68330, 23, 123309, 28966, 76228, 765, 1884, 15504, 3934, 75935, 32354, 14602, 1660, 450, 43240, 32316, 11522, 3917, 163846, 15490, 17368, 3444, 17, 8560, 831, 18, ...	[ 0.09228515625, 0.19677734375, 0.13134765625, 0.1993408203125, 0.174072265625, 0.2252197265625, 0.007354736328125, 0.117919921875, 0.08251953125, 0.134033203125, 0.21630859375, 0.065673828125, 0.08282470703125, 0.197998046875, 0.01812744140625, 0.1063232421875, 0.047821044921875, 0....	embed
69215371_c0	69215371	haskell	0	Title: How to "translate" in Haskell? Problem title: How to "translate" in Haskell? Tags: recursion, haskell Problem: How to "translate" in Haskell? I have been trying to beat this problem for some time. I have been given a "dictionary" with translations. The assignment is that i am going to use thi...	How to "translate" in Haskell? How to "translate" in Haskell? recursion haskell How Haskell x:xs y:ys How to "translate" in Haskell? I have been trying to beat this problem for some time. I have been given a "dictionary" with translations. The assignment is that i am going to use this dictionary for...	[ 0.0047607421875, 0.00799560546875, -0.00823974609375, -0.0017547607421875, 0.0074462890625, 0.00921630859375, -0.000881195068359375, -0.00537109375, 0.0101318359375, -0.007598876953125, 0.01202392578125, -0.0263671875, -0.00970458984375, 0.0037078857421875, -0.00159454345703125, 0.0042...	[ 11249, 47, 41502, 30145, 19309, 23, 20625, 142508, 195625, 1830, 1556, 1022, 12, 425, 7, 113, 4778, 31577, 42659, 2967, 34475, 428, 10763, 6635, 678, 153648, 95486, 4527, 45, 60042, 3900, 143, 1916, 34153, 27781, 21732, 1224, 2203, 549, 3...	[ 0.0904541015625, 0.07525634765625, 0.0494384765625, 0.199951171875, 0.2366943359375, 0.0748291015625, 0.1556396484375, 0.23876953125, 0.1737060546875, 0.064453125, 0.1474609375, 0.0557861328125, 0.06005859375, 0.065185546875, 0.04034423828125, 0.0628662109375, 0.1165771484375, 0.00...	embed
37927780_c0	37927780	haskell	0	Title: errors when I try to return a list Problem title: errors when I try to return a list Tags: compiler-errors, roguelike, haskell Problem: errors when I try to return a list Now I improved the code a bit, cut something off it, etc. Here is the source code: import Prelude {-- DEFINE THE TYPES --} data Tile = Tile --...	errors when I try to return a list errors when I try to return a list compiler-errors roguelike haskell Prelude DEFINE TYPES Tile Char Bool Dungeon MAIN test.log SIZE MAP FUNCTIONS main.hs:42:26 Couldn Expected Actual errors when I try to return a list Now I improved the code a bit, cut something off it, etc. Here is t...	[ 0.0036468505859375, 0.0101318359375, -0.00750732421875, 0.02197265625, -0.005767822265625, 0.00469970703125, -0.0167236328125, -0.0252685546875, -0.01092529296875, 0.0091552734375, 0.00167083740234375, -0.0159912109375, 0.010498046875, 0.01312255859375, -0.00150299072265625, 0.01733398...	[ 18499, 9790, 30646, 5303, 9969, 34759, 188800, 2062, 6261, 5062, 1556, 142508, 1914, 822, 112, 202001, 94588, 5064, 21656, 2460, 929, 125669, 13, 191, 3034, 4867, 19157, 105748, 136258, 5201, 127, 28194, 191147, 60075, 100582, 10, 52295, 1815...	[ 0.196044921875, 0.14599609375, 0.2252197265625, 0.2130126953125, 0.137939453125, 0.08648681640625, 0.13330078125, 0.052642822265625, 0.135498046875, 0.1561279296875, 0.0732421875, 0.183349609375, 0.029266357421875, 0.115478515625, 0.0521240234375, 0.0307159423828125, 0.064453125, 0...	embed
29277874_c0	29277874	haskell	0	Title: How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] Problem title: How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] Tags: haskell Problem: How to define a list ...	How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] haskell How How to define a list which evaluates to the sequence [...	[ 0.0174560546875, 0.0257568359375, -0.025390625, 0.0106201171875, 0, -0.0002231597900390625, -0.0107421875, 0.008056640625, 0.01239013671875, -0.0128173828125, -0.00518798828125, -0.0103759765625, 0.00665283203125, 0.0238037109375, -0.02197265625, 0.01239013671875, 0.0069580078125, ...	[ 11249, 47, 61924, 5303, 3129, 151575, 90, 40, 944, 3956, 63527, 206808, 216969, 128188, 22085, 17727, 10461, 21320, 10, 136, 1556, 142508, 9842, 1679, 20625, 149016, 3642, 831, 6626, 1632, 3789, 48716, 1927, 11907, 28412, 1810, 5117, 22027, ...	[ 0.1051025390625, 0.20263671875, 0.281982421875, 0.291748046875, 0.07501220703125, 0.2274169921875, 0.1021728515625, 0.09765625, 0.1640625, 0.09478759765625, 0.23681640625, 0.1878662109375, 0.2061767578125, 0.2069091796875, 0.0660400390625, 0.053680419921875, 0.064208984375, 0.12927...	embed
59129935_c0	59129935	haskell	0	Title: List instance of semigroup mappeding respective pairs of elements Problem title: List instance of semigroup mappeding respective pairs of elements Tags: haskell, list, semigroup Problem: List instance of semigroup mappeding respective pairs of elements I am looking for most common Haskell library that introduces...	List instance of semigroup mappeding respective pairs of elements List instance of semigroup mappeding respective pairs of elements haskell list semigroup List Semigroup SList foldl1 List instance of semigroup mappeding respective pairs of elements I am looking for most common Haskell library that introduces [a] wrappe...	[ -0.01165771484375, 0.01409912109375, -0.0037078857421875, 0.005157470703125, -0.0286865234375, 0.0225830078125, -0.0177001953125, -0.0023956298828125, 0.021240234375, -0.00115203857421875, 0.004638671875, 0.0286865234375, 0.0028228759765625, 0.010498046875, -0.0164794921875, 0.01031494...	[ 32036, 110527, 36137, 51588, 291, 48398, 214, 107013, 80836, 80854, 1556, 142508, 5303, 84420, 159, 154663, 18344, 20469, 418, 16487, 2684, 39210, 20625, 35773, 1294, 65508, 11, 137565, 1264, 34648, 101426, 102329, 9858, 3305, 47, 21373, 3917, ...	[ 0.1904296875, 0.2320556640625, 0.229248046875, 0.268798828125, 0.1627197265625, 0.138427734375, 0.00823974609375, 0.153564453125, 0.1917724609375, 0.1715087890625, 0.1141357421875, 0.213134765625, 0.1353759765625, 0.231201171875, 0.10638427734375, 0.27099609375, 0.0743408203125, 0....	embed
59556478_c0	59556478	haskell	0	Title: Prefix or infix: which is idiomatic in Haskell? Problem title: Prefix or infix: which is idiomatic in Haskell? Tags: infix-operator, prefix-operator, haskell Problem: Prefix or infix: which is idiomatic in Haskell? I am new to Haskell and do not know which is idiomatic - using operators in prefix form or infix f...	Prefix or infix: which is idiomatic in Haskell? Prefix or infix: which is idiomatic in Haskell? infix-operator prefix-operator haskell Prefix Haskell Prefix or infix: which is idiomatic in Haskell? I am new to Haskell and do not know which is idiomatic - using operators in prefix form or infix form. From what I've noti...	[ 0.01373291015625, -0.0224609375, 0.0244140625, -0.006378173828125, 0.001190185546875, -0.0017852783203125, -0.004974365234375, 0.004241943359375, -0.001922607421875, -0.0262451171875, 0.007781982421875, -0.0216064453125, 0.01123046875, -0.0174560546875, -0.0120849609375, 0.004211425781...	[ 1914, 55923, 707, 23, 3129, 49666, 9523, 20625, 142508, 83, 206469, 183114, 1556, 3525, 47, 959, 3714, 17368, 39933, 3173, 32354, 678, 5361, 124850, 123055, 4369, 1639, 6396, 3021, 11814, 124901, 7228, 1257, 229231, 57767, 191722, 1295, 14036...	[ 0.129638671875, 0.2362060546875, 0.04705810546875, 0.1356201171875, 0.0433349609375, 0.21826171875, 0.1534423828125, 0.14013671875, 0.25, 0.040679931640625, 0.20654296875, 0.262939453125, 0.1246337890625, 0.03057861328125, 0.010498046875, 0.015045166015625, 0.04766845703125, 0.0596...	embed
27127316_c0	27127316	haskell	0	Title: Haskell - Implementing First Order Logic Expressions Problem title: Haskell - Implementing First Order Logic Expressions Tags: first-order-logic, ghci, haskell Problem: Haskell - Implementing First Order Logic Expressions I am trying to implement FOL using Haskell. First order logic can be in the form of proposi...	Haskell - Implementing First Order Logic Expressions Haskell - Implementing First Order Logic Expressions first-order-logic ghci haskell Haskell Implementing First Order Logic Expressions Prop Not Impl Equiv ForAll Exists Ord Multiple Haskell - Implementing First Order Logic Expressions I am trying to implement FOL usi...	[ 0.0220947265625, -0.01141357421875, -0.00179290771484375, 0.017822265625, -0.01220703125, -0.00177764892578125, 0.000782012939453125, -0.017578125, 0.00048065185546875, -0.0155029296875, -0.00909423828125, -0.01708984375, 0.006439208984375, -0.015380859375, 0.0054931640625, 0.024902343...	[ 20625, 142508, 153941, 23972, 81206, 50592, 25129, 5117, 80596, 137043, 31380, 318, 1556, 43796, 11205, 29128, 141, 145666, 334, 1326, 43512, 5443, 64370, 35379, 19335, 8705, 17514, 31577, 29479, 172155, 17368, 12989, 62775, 831, 3173, 89261, 1...	[ 0.1505126953125, 0.2685546875, 0.1473388671875, 0.118896484375, 0.1793212890625, 0.1607666015625, 0.13232421875, 0.09619140625, 0.2093505859375, 0.1676025390625, 0.081787109375, 0.097412109375, 0.1529541015625, 0.19970703125, 0.1368408203125, 0.123291015625, 0.07110595703125, 0.103...	embed
27927115_c1	27927115	haskell	1	that citation and recursively parse through the rest of the list until I've checked everything. Step 3: Make a helper function to convert the string representation of the citation number into an Int (possibly, unwords ) since I have to replace the citation with its corresponding element in the given list. Step 4: Then...	that citation and recursively parse through the rest of the list until I've checked everything. Step 3: Make a helper function to convert the string representation of the citation number into an Int (possibly, unwords ) since I have to replace the citation with its corresponding element in the given list. Step 4: Then...	[ -0.0169677734375, -0.00408935546875, 0.0172119140625, 0.021484375, -0.021728515625, 0.01153564453125, -0.005340576171875, 0.00994873046875, 0.0260009765625, 0.008544921875, -0.00750732421875, -0.00897216796875, -0.00665283203125, -0.00592041015625, 0.0123291015625, -0.0081787109375, ...	[ 450, 15869, 1363, 195625, 366, 184, 5303, 12765, 297, 26818, 4358, 56, 32354, 96760, 79315, 18811, 14012, 360, 18, 51, 47416, 91995, 70, 678, 42518, 12830, 23, 50478, 27959, 456, 7, 15504, 150011, 4420, 3934, 88902, 15005, 71713, 214, 233...	[ 0.052215576171875, 0.2049560546875, 0.0751953125, 0.0273895263671875, 0.097412109375, 0.064208984375, 0.18798828125, 0.0877685546875, 0.001434326171875, 0.0528564453125, 0.092041015625, 0.041778564453125, 0.072509765625, 0.0948486328125, 0.2158203125, 0.148193359375, 0.0623779296875,...	embed
74811030_c0	74811030	haskell	0	Title: Algebraic data type list into an actual list Problem title: Algebraic data type list into an actual list Tags: algebraic-data-types, haskell, list Problem: Algebraic data type list into an actual list I am tying to create a function where I enter an Algebraic data type list, and it should output an actual list. ...	Algebraic data type list into an actual list Algebraic data type list into an actual list algebraic-data-types haskell list Algebraic list1 Cons Empty Elements Show List Algebraic data type list into an actual list I am tying to create a function where I enter an Algebraic data type list, and it should output an actual...	[ 0.002227783203125, 0.008056640625, -0.0004425048828125, 0.0245361328125, -0.005279541015625, 0.03076171875, -0.035888671875, -0.0067138671875, 0.004608154296875, -0.010986328125, 0.002349853515625, -0.0262451171875, 0.01226806640625, 0.0289306640625, -0.0003108978271484375, 0.013549804...	[ 884, 429, 2844, 1771, 2053, 10644, 5303, 3934, 142, 8561, 144, 10135, 50986, 1556, 142508, 418, 39215, 31678, 939, 48325, 17367, 32036, 2281, 214, 28282, 32354, 30957, 140992, 765, 436, 11935, 7, 724, 13538, 7077, 5608, 683, 75935, 25632, ...	[ 0.02874755859375, 0.0787353515625, 0.134033203125, 0.0411376953125, 0.1328125, 0.202880859375, 0.19775390625, 0.1396484375, 0.045257568359375, 0.16748046875, 0.03546142578125, 0.1058349609375, 0.1796875, 0.099365234375, 0.1971435546875, 0.013275146484375, 0.15185546875, 0.123046875...	embed
46426228_c0	46426228	haskell	0	Title: Automatic Dependency Management with stack such as `stack add <module>` Problem title: Automatic Dependency Management with stack such as `stack add <module>` Tags: haskell, npm-install, yarnpkg, haskell-stack, cabal Problem: Automatic Dependency Management with stack such as `stack add ` it there a ...	Automatic Dependency Management with stack such as `stack add <module>` Automatic Dependency Management with stack such as `stack add <module>` haskell npm-install yarnpkg haskell-stack cabal Automatic Dependency Management Automatic Dependency Management with stack such as `stack add ` it there a command t...	[ 0.0004482269287109375, 0.0220947265625, 0.00592041015625, 0.0159912109375, 0.001953125, 0.0174560546875, -0.005523681640625, 0.01300048828125, -0.01007080078125, -0.0093994140625, 0.01422119140625, -0.0086669921875, -0.0076904296875, 0.029296875, -0.0029144287109375, -0.00787353515625,...	[ 51719, 262, 26885, 27771, 25924, 678, 177261, 590, 2594, 15190, 83279, 1556, 142508, 25037, 39, 80383, 38933, 83018, 8517, 109524, 442, 2685, 75101, 14192, 47, 42548, 23, 11435, 5351, 142267, 19, 20600, 108999, 120, 5670, 23009, 3525, 88996, ...	[ 0.15087890625, 0.07958984375, 0.175537109375, 0.1304931640625, 0.15869140625, 0.047149658203125, 0.243408203125, 0.11083984375, 0.1131591796875, 0.152587890625, 0.1549072265625, 0.0673828125, 0.1978759765625, 0.1307373046875, 0.15478515625, 0.10595703125, 0.1260986328125, 0.0258483...	embed
65123956_c0	65123956	haskell	0	Title: How `fix f = let {x = f x} in x` is evaluated? Problem title: How `fix f = let {x = f x} in x` is evaluated? Tags: evaluation, fixpoint-combinators, lazy-evaluation, haskell Problem: How `fix f = let {x = f x} in x` is evaluated? fix f = let {x = f x} in x Talking about let , I thought that let P = Q in R would ...	How `fix f = let {x = f x} in x` is evaluated? How `fix f = let {x = f x} in x` is evaluated? evaluation fixpoint-combinators lazy-evaluation haskell How How `fix f = let {x = f x} in x` is evaluated? fix f = let {x = f x} in x Talking about let , I thought that let P = Q in R would evaluate Q -> Q' then P is replaced ...	[ 0.0023956298828125, 0.00634765625, 0.01312255859375, 0.0033416748046875, 0.0189208984375, -0.01611328125, 0.0035552978515625, -0.01251220703125, -0.0029296875, 0.005035400390625, 0.00139617919921875, 0.0213623046875, -0.005340576171875, 0.002593994140625, 0.0284423828125, -0.0236816406...	[ 11249, 55923, 1238, 2203, 2633, 425, 1022, 23, 151575, 297, 219836, 30022, 38496, 19155, 22230, 21, 3285, 159258, 1556, 142508, 17569, 436, 2396, 627, 13, 33079, 91995, 25, 80934, 56566, 3642, 28987, 24209, 3678, 31635, 10336, 43701, 990, 2...	[ 0.0467529296875, 0.30712890625, 0.200927734375, 0.0921630859375, 0.18798828125, 0.0924072265625, 0.09515380859375, 0.1373291015625, 0.2186279296875, 0.0718994140625, 0.1617431640625, 0.2462158203125, 0.1195068359375, 0.10675048828125, 0.048309326171875, 0.040771484375, 0.101745605468...	embed
5947340_c0	5947340	haskell	0	Title: Overriding (==) in Haskell Problem title: Overriding (==) in Haskell Tags: types, typeclass, haskell, algebraic-data-types Problem: Overriding (==) in Haskell I have the following algebraic data types: data Exp = Con Int \| Var String \| Op Opkind Exp Exp \| Input deriving (Show,Eq) data Opkind = Plus \| Minus \| Mul...	Overriding (==) in Haskell Overriding (==) in Haskell types typeclass haskell algebraic-data-types Overriding Haskell Exp Con Opkind Input Show Plus Minus Mult Div More Equal Overriding (==) in Haskell I have the following algebraic data types: That represent expressions in a simple toy language. However, because I der...	[ 0.00994873046875, 0.01458740234375, 0.00396728515625, 0.0341796875, 0.023681640625, -0.002349853515625, -0.000713348388671875, -0.0079345703125, 0.006866455078125, 0.01214599609375, 0.002197265625, -0.006439208984375, 0.0250244140625, 0.006011962890625, -0.0224609375, 0.001106262207031...	[ 9578, 416, 6238, 69112, 20625, 142508, 23, 52895, 10644, 67413, 1556, 429, 2844, 10135, 50986, 60075, 1657, 2331, 68347, 360, 17367, 8183, 24169, 81212, 53026, 5455, 71723, 25632, 2053, 33636, 125195, 8781, 72713, 46876, 122, 5844, 864, 81827...	[ 0.114990234375, 0.1923828125, 0.05792236328125, 0.278564453125, 0.1531982421875, 0.24951171875, 0.01702880859375, 0.1885986328125, 0.1024169921875, 0.1353759765625, 0.13671875, 0.02569580078125, 0.039947509765625, 0.0447998046875, 0.138427734375, 0.1068115234375, 0.141357421875, 0....	embed
36489313_c0	36489313	haskell	0	Title: How to model the output of the binary lambda calculus? Problem title: How to model the output of the binary lambda calculus? Tags: interpreter, haskell, lambda-calculus, programming-languages Problem: How to model the output of the binary lambda calculus? I am trying to write an interpreter for John Tromp's bina...	How to model the output of the binary lambda calculus? How to model the output of the binary lambda calculus? interpreter haskell lambda-calculus programming-languages How How to model the output of the binary lambda calculus? I am trying to write an interpreter for John Tromp's binary lambda calculus I have written co...	[ 0.01116943359375, 0.0001068115234375, 0.006683349609375, 0.0159912109375, -0.00457763671875, 0.0208740234375, 0.0035552978515625, -0.01019287109375, -0.01153564453125, -0.0115966796875, -0.0196533203125, -0.0130615234375, -0.0030059814453125, -0.00311279296875, 0.006561279296875, 0.010...	[ 11249, 47, 3299, 140992, 2394, 6635, 21, 6492, 85, 44805, 223, 70, 111, 29481, 56, 1556, 142508, 6827, 94739, 196651, 33022, 4939, 8302, 2676, 18151, 2392, 107730, 3934, 2053, 45646, 33636, 20324, 51, 50986, 48941, 107, 106357, 13579, 96276...	[ 0.0826416015625, 0.0806884765625, 0.2279052734375, 0.2481689453125, 0.1573486328125, 0.1414794921875, 0.05316162109375, 0.1737060546875, 0.1295166015625, 0.1859130859375, 0.145751953125, 0.0286865234375, 0.026092529296875, 0.1619873046875, 0.0841064453125, 0.041046142578125, 0.201293...	embed
36736504_c0	36736504	haskell	0	Title: Rendering CDATA with Haskell XHT Library Problem title: Rendering CDATA with Haskell XHT Library Tags: haskell, hxt, xml Problem: Rendering CDATA with Haskell XHT Library How can I make HXT library to output CDATA? For example running test in this snippet will result in <?xml version="1.0" encoding="UTF-8"?> <te...	Rendering CDATA with Haskell XHT Library Rendering CDATA with Haskell XHT Library haskell hxt xml Text.XML.HXT.Core Rendering CDATA Haskell XHT Library UTF-8 ArrowXml XmlTree somefile.xml HXT Rendering CDATA with Haskell XHT Library How can I make HXT library to output CDATA? For example running test in this snippet wi...	[ 0.005126953125, 0.00041961669921875, 0.01251220703125, 0.005279541015625, 0.0262451171875, -0.006988525390625, 0.0028533935546875, -0.01190185546875, -0.01141357421875, 0.000331878662109375, -0.025146484375, -0.0279541015625, -0.0084228515625, -0.00799560546875, 0.006744384765625, 0.00...	[ 63137, 4209, 7915, 17758, 678, 20625, 142508, 1193, 18544, 103835, 1556, 1096, 29062, 131492, 24129, 39456, 841, 70981, 50886, 30992, 17376, 15555, 7237, 62731, 3060, 29822, 572, 3249, 35773, 1294, 140992, 51042, 3034, 93, 58134, 16750, 4966, ...	[ 0.1263427734375, 0.0268402099609375, 0.1326904296875, 0.2030029296875, 0.0587158203125, 0.11376953125, 0.199462890625, 0.0670166015625, 0.210205078125, 0.1849365234375, 0.073974609375, 0.0223236083984375, 0.1846923828125, 0.1611328125, 0.0672607421875, 0.0772705078125, 0.021163940429...	embed
7372120_c0	7372120	haskell	0	Title: Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? Problem title: Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? Tags: haskell Problem: Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? I'm trying to better understand the effect/mean...	Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? haskell Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? I'm trying to better understand the effect/meaning of seq on -> -typed values, or ra...	[ 0.01611328125, -0.00244140625, -0.0019989013671875, 0.01171875, -0.01519775390625, -0.00092315673828125, 0.007171630859375, 0.005615234375, 0.0024261474609375, 0.01953125, -0.0157470703125, 0.00958251953125, -0.0013427734375, -0.00787353515625, -0.0093994140625, -0.01019287109375, -0...	[ 425, 20, 1230, 5386, 247699, 1022, 105950, 24658, 184, 864, 33720, 756, 47, 1556, 142508, 2071, 41872, 33079, 707, 21543, 37440, 40, 50986, 142424, 601, 841, 73493, 26950, 27494, 20625, 34798, 61924, 237, 13416, 80934, 1238, 5608, 6002, 18,...	[ 0.1229248046875, 0.069091796875, 0.0650634765625, 0.1634521484375, 0.254638671875, 0.121337890625, 0.17236328125, 0.10614013671875, 0.109130859375, 0.2193603515625, 0.1385498046875, 0.0986328125, 0.00579833984375, 0.051788330078125, 0.1832275390625, 0.00750732421875, 0.00494384765625...	embed
45287954_c0	45287954	haskell	0	Title: Is having a `(a -> b) -> b` equivalent to having an `a`? Problem title: Is having a `(a -> b) -> b` equivalent to having an `a`? Tags: functional-programming, haskell, purely-functional Problem: Is having a `(a -> b) -> b` equivalent to having an `a`? In a pure functional language, the only thing you...	Is having a `(a -> b) -> b` equivalent to having an `a`? Is having a `(a -> b) -> b` equivalent to having an `a`? functional-programming haskell purely-functional Is having a `(a -> b) -> b` equivalent to having an `a`? In a pure functional language, the only thing you can do with a value is apply a functio...	[ 0.01116943359375, 0.01422119140625, 0.006256103515625, -0.00118255615234375, -0.006683349609375, 0.0174560546875, 0.005218505859375, -0.018798828125, 0.006744384765625, -0.0155029296875, -0.00665283203125, 0.03369140625, -0.014892578125, -0.00872802734375, 0.0067138671875, -0.019287109...	[ 2071, 19441, 10, 11, 20, 1230, 5386, 876, 183234, 47, 142, 123309, 28966, 1556, 142508, 34166, 137175, 289, 9473, 33079, 46876, 4734, 13580, 831, 54, 678, 34292, 59911, 32354, 442, 49041, 10644, 1238, 1984, 44540, 21392, 202319, 91995, 1178...	[ 0.038116455078125, 0.114501953125, 0.0933837890625, 0.162841796875, 0.0697021484375, 0.0726318359375, 0.1600341796875, 0.2003173828125, 0.16650390625, 0.0584716796875, 0.0276947021484375, 0.19970703125, 0.07720947265625, 0.10382080078125, 0.2261962890625, 0.1021728515625, 0.0859375, ...	embed
32615426_c0	32615426	haskell	0	Title: Checking function in Haskell Problem title: Checking function in Haskell Tags: haskell Problem: Checking function in Haskell I'm working on some CS homework and this is my first experience with Haskell, so I have a question. I've declared a data type data Date = Date Int Int Int deriving (Show) and I have this f...	Checking function in Haskell Checking function in Haskell haskell Checking Haskell Date Show Maybe Just Nothing Checking function in Haskell I'm working on some CS homework and this is my first experience with Haskell, so I have a question. I've declared a data type and I have this function testdate: I want to make a n...	[ -0.007293701171875, -0.007415771484375, 0.0089111328125, 0.024658203125, 0.00994873046875, 0.020263671875, -0.0050048828125, -0.000020623207092285156, -0.00830078125, 0.031982421875, -0.0026397705078125, -0.00799560546875, 0.0031280517578125, -0.004547119140625, -0.0133056640625, 0.009...	[ 38679, 214, 32354, 20625, 142508, 23, 1556, 25512, 17367, 83425, 9563, 182747, 25841, 16981, 159978, 2053, 10644, 3034, 17489, 3444, 3249, 3525, 12765, 1957, 2174, 29568, 707, 98320, 30646, 5622, 2806, 54, 903 ]	[ 0.207275390625, 0.0185089111328125, 0.1798095703125, 0.128662109375, 0.2193603515625, 0.014068603515625, 0.117431640625, 0.1787109375, 0.1524658203125, 0.1058349609375, 0.04705810546875, 0.135986328125, 0.00396728515625, 0.021453857421875, 0.0880126953125, 0.056396484375, 0.123535156...	embed
55938210_c1	55938210	haskell	1	, Tree 4), (2, Tree 6)] -- 4 instead of 5 => cycle \| otherwise = [(1, Tree $ 2 * n + 1), (2, Tree $ 2 * n + 2)] isGoal (Tree n) = n == 13 Which generates the children. Well,the problem is that the function above still visits nodes even if they are in the visited set and I don't understand why. So,for example, starting ...	, Tree 4), (2, Tree 6)] -- 4 instead of 5 => cycle \| otherwise = [(1, Tree $ 2 * n + 1), (2, Tree $ 2 * n + 2)] isGoal (Tree n) = n == 13 Which generates the children. Well,the problem is that the function above still visits nodes even if they are in the visited set and I don't understand why. So,for example, starting ...	[ 0.00445556640625, 0.0157470703125, -0.003936767578125, -0.004486083984375, 0.0074462890625, 0.0203857421875, -0.0291748046875, -0.0191650390625, 0.01202392578125, -0.060791015625, -0.00311279296875, -0.0032501220703125, -0.006591796875, 0.017333984375, 0.0040283203125, 0.010009765625, ...	[ 101344, 13956, 4700, 35914, 4210, 201, 64457, 190, 105823, 120262, 3650, 116, 997, 4879, 4958, 83, 17903, 289, 62731, 13, 653, 69112, 702, 139392, 70, 20020, 2967, 32354, 36917, 7464, 19922, 7, 110, 988, 3853, 2174, 36997, 5423, 136, 18, ...	[ 0.28271484375, 0.2154541015625, 0.07177734375, 0.1697998046875, 0.01605224609375, 0.2088623046875, 0.1092529296875, 0.1224365234375, 0.2607421875, 0.0743408203125, 0.006103515625, 0.10260009765625, 0.1180419921875, 0.0096435546875, 0.0207672119140625, 0.120361328125, 0.1885986328125,...	embed
33703195_c0	33703195	haskell	0	Title: Why is prepending to a list instantaneous? Problem title: Why is prepending to a list instantaneous? Tags: haskell Problem: Why is prepending to a list instantaneous? I am going through an Haskell tutorial about lists, and it claims: Watch out when repeatedly using the ++ operator on long strings ... Haskell has...	Why is prepending to a list instantaneous? Why is prepending to a list instantaneous? haskell Why Why is prepending to a list instantaneous? I am going through an Haskell tutorial about lists, and it claims: But, in my mind, things should be the other way around. : has to go through all elements in the list because it ...	[ 0.00531005859375, 0.0033721923828125, 0.01312255859375, 0.00174713134765625, -0.005889892578125, -0.0012054443359375, 0.01141357421875, -0.0024566650390625, 0.022705078125, -0.00909423828125, 0.0147705078125, -0.035400390625, 0.006683349609375, 0.01519775390625, -0.0162353515625, -0.00...	[ 44084, 83, 479, 96819, 47, 5303, 34648, 6130, 10821, 1556, 142508, 20625, 57143, 140526, 7086, 8966, 5608, 3789, 3917, 10932, 738, 8305, 756, 80854, 6637, 27117, 122925, 136044, 37223, 831, 114689, 3525, 12830, 3564, 16940, 100094, 63805 ]	[ 0.1407470703125, 0.07275390625, 0.1912841796875, 0.302001953125, 0.1519775390625, 0.2127685546875, 0.137939453125, 0.156005859375, 0.139404296875, 0.0904541015625, 0.2105712890625, 0.0814208984375, 0.0572509765625, 0.00579833984375, 0.04888916015625, 0.00762939453125, 0.0345458984375...	embed
35069169_c0	35069169	haskell	0	Title: Make Haskell List Recursion function more efficient Problem title: Make Haskell List Recursion function more efficient Tags: list, haskell, boolean, pattern-matching, recursion Problem: Make Haskell List Recursion function more efficient I've written a function that will compare two lists and check to see if the...	Make Haskell List Recursion function more efficient Make Haskell List Recursion function more efficient list haskell boolean pattern-matching recursion Make Haskell List Recursion Bool x:xs y:ys Make Haskell List Recursion function more efficient I've written a function that will compare two lists and check to see if t...	[ -0.016845703125, 0.01214599609375, 0.0242919921875, -0.000675201416015625, 0.0023956298828125, -0.00469970703125, -0.0172119140625, 0.0081787109375, 0.00860595703125, 0.01470947265625, 0.0184326171875, -0.01275634765625, 0.0126953125, -0.002166748046875, -0.000949859619140625, 0.010314...	[ 26176, 20625, 142508, 32036, 165428, 42, 6889, 32354, 1286, 93766, 5303, 1556, 337, 31, 34677, 103510, 98753, 214, 195625, 2460, 929, 1022, 12, 425, 113, 4778, 59121, 69101, 6626, 12765, 1957, 2174, 5117, 83, 183114, 111, 17932, 8110, 16940...	[ 0.09521484375, 0.1240234375, 0.22509765625, 0.196533203125, 0.1422119140625, 0.168701171875, 0.1199951171875, 0.162109375, 0.1314697265625, 0.2352294921875, 0.183349609375, 0.103759765625, 0.001556396484375, 0.04058837890625, 0.1312255859375, 0.1619873046875, 0.1676025390625, 0.024...	embed
53088261_c0	53088261	haskell	0	Title: Tree or not (Haskell type understanding) Problem title: Tree or not (Haskell type understanding) Tags: binary-tree, graph-theory, haskell, types Problem: Tree or not (Haskell type understanding) In "A Gentle Introduction to Haskell" we have such declaration of Tree's type: data Tree a = Leaf a \| Branch (Tree a) ...	Tree or not (Haskell type understanding) Tree or not (Haskell type understanding) binary-tree graph-theory haskell types Tree Haskell Leaf Branch Ord Show Read Main Integer Tree or not (Haskell type understanding) In "A Gentle Introduction to Haskell" we have such declaration of Tree's type: Let's to make some values o...	[ 0.0113525390625, 0.0185546875, -0.00799560546875, 0.016845703125, 0.0223388671875, 0.0130615234375, -0.029541015625, -0.022216796875, -0.006072998046875, -0.0255126953125, -0.01904296875, -0.023193359375, 0.003143310546875, 0.003143310546875, 0.0042724609375, 0.0220947265625, 0.02185...	[ 101344, 707, 959, 6495, 7, 142508, 10644, 100094, 2394, 6635, 62600, 41382, 1556, 52895, 20625, 2407, 21110, 35379, 17367, 4764, 12321, 44401, 44704, 21635, 142424, 31380, 318, 10, 910, 83, 756, 8622, 105823, 903, 44691, 80934, 26785, 121742,...	[ 0.304443359375, 0.088623046875, 0.1207275390625, 0.0748291015625, 0.05926513671875, 0.220703125, 0.2159423828125, 0.1236572265625, 0.08270263671875, 0.04949951171875, 0.212646484375, 0.1500244140625, 0.087646484375, 0.1202392578125, 0.0987548828125, 0.061981201171875, 0.0222930908203...	embed
19025621_c0	19025621	haskell	0	Title: Reorder a list based on example list Problem title: Reorder a list based on example list Tags: list, haskell Problem: Reorder a list based on example list I would like to know how to reorder a list of lists based on an example list. Here is an example to clarify my question: ["Foo", "Bar", "Something"] That is e...	Reorder a list based on example list Reorder a list based on example list list haskell Reorder Foo Bar Something Reorder a list based on example list I would like to know how to reorder a list of lists based on an example list. Here is an example to clarify my question: That is example list, now I want to reorder the l...	[ 0.004119873046875, 0.01190185546875, -0.0137939453125, 0.01446533203125, -0.00640869140625, 0.011962890625, 0.003448486328125, 0.003326416015625, 0.006988525390625, 0.027099609375, 0.002777099609375, -0.0023193359375, -0.003753662109375, 0.0213623046875, -0.01055908203125, -0.011657714...	[ 853, 80596, 5303, 35509, 98, 27781, 1556, 142508, 9572, 31, 3253, 200905, 1884, 3714, 3642, 47, 456, 111, 7, 17306, 3444, 127887, 35064, 16487, 4734, 10336, 12638, 46132, 291, 26783, 202317, 32354, 6626, 80854, 4488, 184017 ]	[ 0.1275634765625, 0.2802734375, 0.229736328125, 0.1407470703125, 0.0635986328125, 0.2548828125, 0.10040283203125, 0.1944580078125, 0.1173095703125, 0.055816650390625, 0.1488037109375, 0.0292816162109375, 0.0253448486328125, 0.03277587890625, 0.03656005859375, 0.045562744140625, 0.1333...	embed
75568232_c0	75568232	haskell	0	Title: Elegant way to apply curried function to indexed traversal Problem title: Elegant way to apply curried function to indexed traversal Tags: haskell, haskell-lens Problem: Elegant way to apply curried function to indexed traversal I want to compose a curried function f :: i -> a -> b With an indexed traversal l ::...	Elegant way to apply curried function to indexed traversal Elegant way to apply curried function to indexed traversal haskell haskell-lens Elegant IndexedTraversal IndexedGetting Endo Elegant way to apply curried function to indexed traversal I want to compose a curried function With an indexed traversal apply it to an...	[ -0.00469970703125, 0.00750732421875, 0.0120849609375, -0.008056640625, -0.00689697265625, -0.0130615234375, 0.00023365020751953125, 0.0008697509765625, 0.0184326171875, -0.0625, 0.0128173828125, 0.00994873046875, -0.016357421875, 0.000640869140625, -0.006317138671875, -0.03076171875, ...	[ 161231, 3917, 59911, 9709, 46572, 32354, 47, 63262, 297, 37317, 289, 1556, 142508, 1977, 31471, 28542, 814, 2317, 10429, 19514, 357, 246, 3444, 150350, 17106, 142, 91, 136, 2046, 4420, 10, 275, 1257, 4966, 2806, 1884, 22321, 1290, 4627, 1...	[ 0.2490234375, 0.08740234375, 0.17041015625, 0.149169921875, 0.249267578125, 0.19287109375, 0.0821533203125, 0.200927734375, 0.10699462890625, 0.2135009765625, 0.136474609375, 0.11572265625, 0.2047119140625, 0.155517578125, 0.2000732421875, 0.089599609375, 0.1842041015625, 0.1110839...	embed
43884930_c0	43884930	haskell	0	Title: error parsing in haskell code Problem title: error parsing in haskell code Tags: recursion, haskell Problem: error parsing in haskell code My haskell code goes as follows : module Lain where let value = 0 divideBy ::(Ord a, Num a)=>a -> a -> a divideBy _ 0 = 0 divideBy num den \| (num - den) >= 0 = do value = val...	error parsing in haskell code error parsing in haskell code recursion haskell Lain Ord Num Lain.hs:18:1 Failed error parsing in haskell code My haskell code goes as follows : The error goes on loading the haskell Lain.hs file is : app/Lain.hs:18:1: error: parse error (possibly incorrect indentation or mismatched bracke...	[ -0.00958251953125, 0.029052734375, -0.023193359375, -0.0030059814453125, 0.01141357421875, 0.005859375, 0.0054931640625, -0.021484375, 0.00244140625, -0.0390625, -0.0021209716796875, -0.0206298828125, 0.00494384765625, -0.015380859375, 0.01092529296875, 0.01092529296875, -0.008483886...	[ 18499, 366, 6953, 23, 1556, 142508, 18151, 195625, 1830, 239, 73, 35379, 52782, 127, 7, 24033, 19721, 190355, 60899, 28960, 98, 72367, 214, 5, 11435, 4027, 2729, 184, 7522, 214552, 18597, 22062, 1239, 98753, 1620, 27853, 88996, 351, 13, 1...	[ 0.226318359375, 0.1734619140625, 0.072998046875, 0.06805419921875, 0.1654052734375, 0.2230224609375, 0.1810302734375, 0.2098388671875, 0.0318603515625, 0.1312255859375, 0.1702880859375, 0.1610107421875, 0.1097412109375, 0.119384765625, 0.06201171875, 0.1617431640625, 0.1346435546875,...	embed
4646963_c0	4646963	haskell	0	Title: Importing haskell library on Mac OSX gives error Problem title: Importing haskell library on Mac OSX gives error Tags: haskell, compiler-errors Problem: Importing haskell library on Mac OSX gives error I've just installed GHC 6.6 on OSX 10.6 and importing fails, for example module Main where import IO gives the ...	Importing haskell library on Mac OSX gives error Importing haskell library on Mac OSX gives error haskell compiler-errors IO Importing Mac OSX Main Bad IO.hi ghc-6.6 GHC i386-apple-darwin interactiveUI:flush Importing haskell library on Mac OSX gives error I've just installed GHC 6.6 on OSX 10.6 and importing fails, fo...	[ 0.000751495361328125, 0.007568359375, -0.004974365234375, 0.007415771484375, 0.00360107421875, 0.014404296875, -0.0115966796875, -0.00677490234375, -0.02490234375, -0.0283203125, -0.0150146484375, -0.04541015625, 0.004150390625, -0.01031494140625, 0.0189208984375, -0.00750732421875, ...	[ 92966, 1556, 142508, 35773, 1294, 98, 4727, 11787, 1542, 76199, 18499, 9969, 34759, 188800, 17780, 12321, 12745, 979, 31380, 238, 156960, 527, 73265, 105742, 9007, 9494, 212398, 33457, 18026, 1495, 20600, 4068, 910, 24927, 35782, 27781, 831, ...	[ 0.2305908203125, 0.19140625, 0.2744140625, 0.1898193359375, 0.060791015625, 0.015594482421875, 0.1439208984375, 0.1434326171875, 0.13525390625, 0.05560302734375, 0.1893310546875, 0.128173828125, 0.1336669921875, 0.19140625, 0.1641845703125, 0.0826416015625, 0.15380859375, 0.1182861...	embed
8918990_c0	8918990	haskell	0	Title: Why is the type of this function (a -> a) -> a? Problem title: Why is the type of this function (a -> a) -> a? Tags: anonymous, haskell, y-combinator, types, recursion Problem: Why is the type of this function (a -> a) -> a? Why is the type of this function (a -> a) -> a? Prelude> let y f = f (y f) P...	Why is the type of this function (a -> a) -> a? Why is the type of this function (a -> a) -> a? anonymous haskell y-combinator types recursion Why Prelude WTFIsGoingOnOnTheRHS Why is the type of this function (a -> a) -> a? Why is the type of this function (a -> a) -> a? Shouldn't it be an infinite/recursiv...	[ 0.0179443359375, -0.0023193359375, 0.014404296875, 0.0123291015625, 0.02685546875, 0.0045166015625, 0.00640869140625, 0.00885009765625, -0.0185546875, -0.0263671875, -0.00335693359375, -0.001922607421875, -0.0189208984375, -0.0059814453125, 0.00836181640625, -0.00848388671875, 0.0109...	[ 44084, 83, 10644, 111, 903, 32354, 11, 20, 1230, 5386, 10, 52184, 10821, 1556, 142508, 113, 277, 19155, 1290, 52895, 195625, 1830, 1914, 822, 112, 601, 30992, 29598, 17903, 214, 20320, 3957, 1052, 38131, 70, 33079, 151117, 54241, 48650, 5...	[ 0.142822265625, 0.053375244140625, 0.1962890625, 0.0753173828125, 0.10467529296875, 0.177001953125, 0.1124267578125, 0.0367431640625, 0.037841796875, 0.1529541015625, 0.1612548828125, 0.10546875, 0.001007080078125, 0.090087890625, 0.2073974609375, 0.1197509765625, 0.0157623291015625,...	embed
5854122_c0	5854122	haskell	0	Title: How to terminate in a recursive function in Haskell? Problem title: How to terminate in a recursive function in Haskell? Tags: haskell, recursion, termination Problem: How to terminate in a recursive function in Haskell? I have a function that needs to terminate on a certain condition. So for example say we have...	How to terminate in a recursive function in Haskell? How to terminate in a recursive function in Haskell? haskell recursion termination How Haskell a:as func2 a:func a:func2 How to terminate in a recursive function in Haskell? I have a function that needs to terminate on a certain condition. So for example say we have ...	[ 0.0052490234375, 0.006744384765625, -0.006744384765625, -0.00164794921875, -0.00616455078125, 0.0179443359375, -0.005462646484375, 0.0167236328125, 0.00060272216796875, -0.0130615234375, 0.00445556640625, -0.01513671875, -0.00616455078125, 0.0123291015625, 0.01239013671875, -0.00064849...	[ 11249, 47, 121011, 13, 23, 195625, 5844, 32354, 20625, 142508, 1556, 1830, 29527, 10, 162, 7477, 304, 16498, 238, 27117, 98, 24233, 35431, 3444, 1632, 35839, 237, 3638, 217684, 2046, 40907, 34292, 4153, 18, 107730, 4734, 35142, 24491, 14242...	[ 0.09088134765625, 0.0689697265625, 0.247802734375, 0.19482421875, 0.092041015625, 0.228759765625, 0.16845703125, 0.2061767578125, 0.1385498046875, 0.24365234375, 0.1280517578125, 0.07147216796875, 0.2205810546875, 0.061187744140625, 0.075439453125, 0.1153564453125, 0.1378173828125, ...	embed
22772349_c1	22772349	haskell	1	1 yesod-1.2.5.2 depends on yesod-core-1.2.10 which failed to install. yesod-auth-1.3.0.2 depends on yesod-core-1.2.10 which failed to install. yesod-core-1.2.10 failed during the building phase. The exception was: ExitFailure 1 yesod-form-1.3.8.1 depends on yesod-core-1.2.10 which failed to install. yesod-persistent-1...	1 yesod-1.2.5.2 depends on yesod-core-1.2.10 which failed to install. yesod-auth-1.3.0.2 depends on yesod-core-1.2.10 which failed to install. yesod-core-1.2.10 failed during the building phase. The exception was: ExitFailure 1 yesod-form-1.3.8.1 depends on yesod-core-1.2.10 which failed to install. yesod-persistent-1...	[ -0.024169921875, 0.01177978515625, 0.0038604736328125, 0.0091552734375, -0.009033203125, -0.00634765625, -0.012939453125, -0.017578125, -0.0091552734375, 0.03369140625, -0.00043487548828125, -0.042724609375, -0.0181884765625, 0.0048828125, 0.0035552978515625, -0.00518798828125, 0.005...	[ 2422, 23722, 48400, 158296, 56566, 30854, 963, 165523, 20600, 916, 927, 81046, 133684, 20271, 33976, 93402, 131527, 5443, 217, 17647, 379, 3408, 106, 5037, 206730, 21777, 6892, 5, 70147, 47, 2071, 148431, 23, 52922, 4588, 759, 36279, 28864, ...	[ 0.18701171875, 0.275146484375, 0.1573486328125, 0.2052001953125, 0.197021484375, 0.179931640625, 0.1802978515625, 0.18994140625, 0.1441650390625, 0.06292724609375, 0.07135009765625, 0.1033935546875, 0.1417236328125, 0.023101806640625, 0.0948486328125, 0.0792236328125, 0.1646728515625...	embed
29134349_c1	29134349	haskell	1	‘field1’: field1 = iso (\ (Foo x_a3NK) -> x_a3NK) Foo So I think it generated: field1 :: Lens' (Foo a) a I've also tried makeFields and makeClassy , to no avail. I know I could work around this with: field1 :: (Class1 a) => Lens' (Foo a) a field1 = lens _field1 (\ foo val -> Foo { _field1 = val }) But is there a way t...	‘field1’: field1 = iso (\ (Foo x_a3NK) -> x_a3NK) Foo So I think it generated: field1 :: Lens' (Foo a) a I've also tried makeFields and makeClassy , to no avail. I know I could work around this with: field1 :: (Class1 a) => Lens' (Foo a) a field1 = lens _field1 (\ foo val -> Foo { _field1 = val }) But is there a way t...	[ 0.00115966796875, -0.00872802734375, -0.00946044921875, 0.00909423828125, 0.004150390625, 0.0086669921875, 0.00701904296875, -0.01007080078125, 0, -0.024169921875, -0.005645751953125, 0.0279541015625, -0.00909423828125, -0.0118408203125, 0.00634765625, -0.022216796875, 0.000379562377...	[ 28394, 418, 44457, 2203, 13882, 27591, 31, 1022, 11, 363, 25035, 9572, 5351, 139392, 1984, 18226, 7, 25, 10, 3249, 6159, 19388, 140803, 53, 110, 5809, 4488, 10932, 903, 44357, 3098, 5775, 3502, 3917, 54, 442, 866, 47754, 196631, 20625, ...	[ 0.2313232421875, 0.1611328125, 0.2420654296875, 0.039154052734375, 0.20166015625, 0.09588623046875, 0.1048583984375, 0.0347900390625, 0.008544921875, 0.0156707763671875, 0.1240234375, 0.130126953125, 0.04638671875, 0.1739501953125, 0.109619140625, 0.20166015625, 0.06036376953125, 0...	embed
70894897_c0	70894897	haskell	0	Title: Why am I getting a parse error for input "\|" in Haskell for guards? Problem title: Why am I getting a parse error for input "\|" in Haskell for guards? Tags: haskell, guard Problem: Why am I getting a parse error for input "\|" in Haskell for guards? I'm writing a code to find the median of 3 n...	Why am I getting a parse error for input "\|" in Haskell for guards? Why am I getting a parse error for input "\|" in Haskell for guards? haskell guard Why Haskell Median max3 min3 Why am I getting a parse error for input "\|" in Haskell for guards? I'm writing a code to find the median of 3 numbers bu...	[ -0.00927734375, 0.01422119140625, 0.0201416015625, -0.005706787109375, 0.00750732421875, 0.0130615234375, -0.038330078125, 0.00469970703125, 0.00096893310546875, -0.01202392578125, -0.01312255859375, -0.03515625, 0.0167236328125, -0.0107421875, 0.009521484375, -0.0036773681640625, -0...	[ 44084, 444, 87, 20949, 366, 184, 18499, 100, 107730, 41502, 58745, 1230, 20625, 142508, 56050, 7, 619, 23, 1556, 4794, 19, 18389, 363, 881, 32562, 18151, 7413, 2450, 138, 101935, 134234, 13315, 7076, 90791, 121742, 645, 13438, 69427, 4358 ]	[ 0.1328125, 0.0491943359375, 0.007080078125, 0.04791259765625, 0.1580810546875, 0.1416015625, 0.215576171875, 0.0672607421875, 0.1727294921875, 0.0841064453125, 0.18212890625, 0.03094482421875, 0.1451416015625, 0.241455078125, 0.2266845703125, 0.050567626953125, 0.00732421875, 0.045...	embed
43071045_c0	43071045	haskell	0	Title: How can I concatenate user input in a list Problem title: How can I concatenate user input in a list Tags: recursion, haskell, list Problem: How can I concatenate user input in a list I would like to get codes from the user and insert it in a list, but the problem is when the user say that don't wanna insert mor...	How can I concatenate user input in a list How can I concatenate user input in a list recursion haskell list How Integer Another code::String How can I concatenate user input in a list I would like to get codes from the user and insert it in a list, but the problem is when the user say that don't wanna insert more code...	[ -0.0147705078125, -0.021240234375, 0.004486083984375, 0.01385498046875, 0.017333984375, 0.0120849609375, -0.0125732421875, 0.000926971435546875, 0.0020294189453125, -0.05810546875, -0.004486083984375, -0.03955078125, -0.01190185546875, 0.0096435546875, -0.006683349609375, -0.0031280517...	[ 11249, 831, 87, 158, 33478, 76, 67, 38937, 107730, 23, 5303, 195625, 1830, 1556, 142508, 44401, 116267, 18151, 71713, 214, 10, 1884, 2046, 1295, 183540, 2967, 5154, 18, 6165, 1286, 57, 4126, 678, 101935, 17368, 11782, 55300, 13438, 30646, ...	[ 0.09112548828125, 0.0804443359375, 0.04107666015625, 0.1280517578125, 0.1837158203125, 0.15673828125, 0.1041259765625, 0.183349609375, 0.224609375, 0.080078125, 0.1995849609375, 0.14794921875, 0.082275390625, 0.10040283203125, 0.177490234375, 0.16064453125, 0.0631103515625, 0.17297...	embed
32419598_c0	32419598	haskell	0	Title: Algorithm to merge two lists Problem title: Algorithm to merge two lists Tags: list, haskell Problem: Algorithm to merge two lists I'm trying to merge two lists of tuples, x and y . Basically is I have these lists: [("hello", "hi"), ("foo", "baz"), ("this", "that")] --and [("foo", "bar"), ("hello", "world"), ("g...	Algorithm to merge two lists Algorithm to merge two lists list haskell Algorithm x:xs y:ys Algorithm to merge two lists I'm trying to merge two lists of tuples, x and y . Basically is I have these lists: I've written this so far: The problem with this solution is that it only merges that are the same index. How can I e...	[ -0.00186920166015625, 0.02734375, 0.004791259765625, 0.01519775390625, 0.00179290771484375, 0.0072021484375, -0.017822265625, -0.001434326171875, 0.01611328125, 0.0089111328125, -0.001220703125, 0.00555419921875, 0.0084228515625, 0.009521484375, -0.003173828125, -0.0089111328125, -0....	[ 109847, 2783, 18337, 47, 42564, 6626, 5303, 7, 1556, 142508, 1022, 12, 425, 113, 4778, 31577, 370, 99726, 136, 6097, 59121, 2060, 2967, 29806, 4734, 621, 5701, 63262, 93766, 8560, 645, 17932, 3934, 70, 5117 ]	[ 0.171875, 0.15576171875, 0.1065673828125, 0.09002685546875, 0.24755859375, 0.2054443359375, 0.243408203125, 0.1058349609375, 0.135009765625, 0.2078857421875, 0.081298828125, 0.05633544921875, 0.0855712890625, 0.1126708984375, 0.1546630859375, 0.06182861328125, 0.09808349609375, 0.1...	embed
63396432_c2	63396432	haskell	2	. Code signals: /home/nick/.stack/snapshots/x86_64-linux-tinfo6/59804b23a4d63c47966b839bf0007deca79c979c9d5aa499d8828f7acbc09797/8.8.3/bin/gtk2hsC2hs, /home/nick/.stack/snapshots/x86_64-linux-tinfo6/59804b23a4d63c47966b839bf0007deca79c979c9d5aa499d8828f7acbc09797/8.8.3/bin/gtk2hsHookGenerator, /home/nick/.stack/snapsho...	1de0b3576c4a5f79 a7d5d8 b9bd790e3091cf3e10cc5b6c0aa6789904463f24 b9bd790e3091cf3e10cc5b6c b9bd790 e3091cf3e10cc5b6c0aa6789904463f24721de0b3576c4a5f79a7d5d8 x86_64 linux-tinfo6 b9bd790e3091cf3e10cc5b6c0aa6789904463f24721de0b3576c4a5f79a7d5d8 b9bd790e3091cf3e10cc5b6c0aa678990 Cabal-3 bytestring-0.10.10.0 Copying gtk2hsC2...	[ 0.004913330078125, 0.01043701171875, -0.00347900390625, 0.0045166015625, 0.0093994140625, 0.00121307373046875, 0.0014801025390625, -0.00189971923828125, -0.014404296875, -0.01080322265625, -0.01129150390625, -0.04150390625, -0.0024261474609375, -0.00439453125, -0.01287841796875, 0.0170...	[ 106, 112, 275, 5843, 11835, 238, 11, 758, 420, 22377, 10, 966, 71, 1019, 876, 1126, 123048, 13, 12183, 67466, 363, 963, 10060, 910, 2389, 180730, 2357, 34145, 1197, 28, 61158, 142430, 3117, 617, 15276, 454, 13307, 11508, 6077, 9, 18, ...	[ 0.001678466796875, 0.0482177734375, 0.009765625, 0.019439697265625, 0.0226287841796875, 0.00970458984375, 0.009765625, 0.00970458984375, 0.009857177734375, 0.0869140625, 0.00921630859375, 0.009613037109375, 0.00982666015625, 0.00970458984375, 0.009246826171875, 0.009674072265625, 0.0...	embed
11347655_c0	11347655	haskell	0	Title: Correct control monad for aliasing Problem title: Correct control monad for aliasing Tags: monad-transformers, haskell, monads Problem: Correct control monad for aliasing I have a monadic function which returns a user id: do id <- getUserId I need to be able to "superimpose", on getUserId, a function which looks...	Correct control monad for aliasing Correct control monad for aliasing monad-transformers haskell monads Correct Correct control monad for aliasing I have a monadic function which returns a user id: I need to be able to "superimpose", on getUserId, a function which looks up, and returns, an alias to the value returned b...	[ -0.023681640625, 0.01104736328125, 0.000682830810546875, 0.01361083984375, 0.00787353515625, 0.0224609375, 0.000946044921875, 0.00836181640625, -0.015380859375, -0.016845703125, 0.01239013671875, -0.0142822265625, -0.01324462890625, -0.003997802734375, 0.00799560546875, 0.0002098083496...	[ 46348, 15390, 6226, 2667, 712, 100, 55109, 214, 215175, 1314, 1556, 142508, 11, 18403, 32354, 30646, 38937, 3447, 3871, 19048, 59104, 178451, 2046, 1062, 2189, 568, 71, 33342, 1257, 47, 34292, 176377, 5809, 33022, 29458, 55725, 162, 456, 43...	[ 0.118408203125, 0.0447998046875, 0.217529296875, 0.1478271484375, 0.202392578125, 0.0421142578125, 0.263427734375, 0.13720703125, 0.183837890625, 0.0253448486328125, 0.059539794921875, 0.19580078125, 0.0631103515625, 0.0679931640625, 0.1514892578125, 0.1256103515625, 0.130859375, 0...	embed
15848856_c1	15848856	haskell	1	or bad practices. From the linked wikipedia article on Anti-Patterns : ... there must be at least two key elements present to formally distinguish an actual anti-pattern from a simple bad habit, bad practice, or bad idea : some repeated pattern of action, process or structure that initially appears to be beneficial, b...	or bad practices. From the linked wikipedia article on Anti-Patterns : ... there must be at least two key elements present to formally distinguish an actual anti-pattern from a simple bad habit, bad practice, or bad idea : some repeated pattern of action, process or structure that initially appears to be beneficial, b...	[ -0.0009307861328125, 0.01373291015625, 0.01190185546875, -0.02490234375, 0.0021209716796875, 0.004913330078125, 0.004852294921875, 0.0169677734375, -0.0027923583984375, -0.0113525390625, 0.01080322265625, -0.032470703125, -0.0064697265625, 0.014404296875, -0.00390625, -0.00885009765625...	[ 707, 6494, 41361, 7, 7168, 8332, 9, 8335, 3055, 1779, 8110, 19713, 6626, 22799, 80854, 13379, 23113, 157167, 1495, 8561, 2874, 4453, 22766, 1295, 8781, 62122, 6528, 119140, 103510, 22631, 9433, 45646, 61475, 135179, 48588, 141, 1284, 20654, ...	[ 0.07366943359375, 0.176025390625, 0.250732421875, 0.0178680419921875, 0.0330810546875, 0.253173828125, 0.090576171875, 0.210205078125, 0.21484375, 0.0936279296875, 0.05120849609375, 0.041015625, 0.109619140625, 0.1177978515625, 0.1156005859375, 0.06787109375, 0.08282470703125, 0.15...	embed
53450533_c0	53450533	haskell	0	Title: Haskell - Iterate Tuple with Different Functions Problem title: Haskell - Iterate Tuple with Different Functions Tags: haskell Problem: Haskell - Iterate Tuple with Different Functions I have been trying to to iterate the cand data in order to apply a function "pt_string". Pt :: (Float, Float) Person :: (Pt, Pt,...	Haskell - Iterate Tuple with Different Functions Haskell - Iterate Tuple with Different Functions haskell Haskell Iterate Tuple Different Functions Float Person Point pt_string Haskell - Iterate Tuple with Different Functions I have been trying to to iterate the cand data in order to apply a function "pt_string". My id...	[ 0.01361083984375, -0.019287109375, -0.01287841796875, 0.0291748046875, -0.00093841552734375, -0.004486083984375, 0.00762939453125, 0.0036773681640625, 0.01025390625, -0.01446533203125, -0.0164794921875, -0.0103759765625, 0.01373291015625, 0.01312255859375, -0.0174560546875, 0.004852294...	[ 20625, 142508, 8560, 67, 1371, 8705, 678, 242520, 28670, 10763, 1556, 87, 38699, 257, 15270, 41097, 27037, 454, 91693, 31577, 17, 7841, 2053, 59911, 32354, 6328, 6528, 11782, 12921, 3917, 12638, 12830, 370, 6366, 133, 13448, 22288, 147534, ...	[ 0.111328125, 0.2303466796875, 0.2021484375, 0.0933837890625, 0.0982666015625, 0.1966552734375, 0.0679931640625, 0.1392822265625, 0.1444091796875, 0.0802001953125, 0.101806640625, 0.020782470703125, 0.157470703125, 0.0257415771484375, 0.1402587890625, 0.1650390625, 0.1959228515625, ...	embed
13443237_c0	13443237	haskell	0	Title: All possible sublists of a list Problem title: All possible sublists of a list Tags: haskell, list Problem: All possible sublists of a list I need to write a function that generates a list containing lists of all the possible sublists of a list. So the type must be: partitions :: [a] -> [[[a]]] and it should giv...	All possible sublists of a list All possible sublists of a list haskell list All x:xs ys:x:zs All possible sublists of a list I need to write a function that generates a list containing lists of all the possible sublists of a list. So the type must be: and it should give: I'm thinking a list comprehension is the best w...	[ -0.008056640625, 0.0003757476806640625, 0.01385498046875, 0.006683349609375, -0.0177001953125, 0.01171875, -0.0189208984375, -0.017578125, 0.0086669921875, -0.004119873046875, -0.002777099609375, -0.006195068359375, 0.0311279296875, 0.0027313232421875, -0.0206298828125, 0.01806640625, ...	[ 3164, 7722, 1614, 6562, 7, 111, 5303, 10, 1556, 142508, 1022, 12, 425, 113, 169, 3871, 33022, 32354, 139392, 70541, 214, 756, 70, 10644, 8110, 5608, 8337, 47644, 46683, 3220, 6889, 2965, 3917, 2060, 104250, 18499, 41206, 3714, 30022, 1231...	[ 0.14794921875, 0.215576171875, 0.218505859375, 0.26025390625, 0.1376953125, 0.06707763671875, 0.193115234375, 0.014404296875, 0.1318359375, 0.1942138671875, 0.09027099609375, 0.036865234375, 0.08624267578125, 0.07080078125, 0.0712890625, 0.042724609375, 0.0682373046875, 0.130615234...	embed
34748759_c0	34748759	haskell	0	Title: Sampling a behaviour from outside network Problem title: Sampling a behaviour from outside network Tags: sodiumfrp, reactive-banana, haskell, io, frp Problem: Sampling a behaviour from outside network Since sodium has been deprecated by the author I'm trying to port my code to reactive-banana. However, there see...	Sampling a behaviour from outside network Sampling a behaviour from outside network sodiumfrp reactive-banana haskell io frp outside Sampling Behaviour Sampling a behaviour from outside network Since sodium has been deprecated by the author I'm trying to port my code to reactive-banana. However, there seem to be some i...	[ 0.01953125, 0.03125, -0.003143310546875, 0.01239013671875, -0.00732421875, 0.0220947265625, 0.01708984375, 0.015625, 0.0164794921875, -0.0732421875, 0.00543212890625, -0.013916015625, -0.002044677734375, 0.0177001953125, 0.0181884765625, -0.00897216796875, 0.004608154296875, 0.0180...	[ 3362, 254, 2069, 224833, 1295, 50782, 33120, 221, 28483, 7079, 456, 71232, 105281, 11, 1556, 142508, 22995, 14119, 873, 98409, 10, 8, 4692, 4460, 42179, 31577, 11469, 18151, 47, 23, 2271, 38242, 117538, 17721, 6626, 7941, 1733, 645, 277, ...	[ 0.1885986328125, 0.1949462890625, 0.1236572265625, 0.27001953125, 0.142578125, 0.1983642578125, 0.1585693359375, 0.16748046875, 0.2481689453125, 0.08721923828125, 0.10052490234375, 0.2257080078125, 0.19580078125, 0.1751708984375, 0.1103515625, 0.221435546875, 0.1685791015625, 0.062...	embed
53136545_c0	53136545	haskell	0	Title: Haskell function which sorts a list of integer lists according to the length of the sublists Problem title: Haskell function which sorts a list of integer lists according to the length of the sublists Tags: haskell Problem: Haskell function which sorts a list of integer lists according to the length of the subli...	Haskell function which sorts a list of integer lists according to the length of the sublists Haskell function which sorts a list of integer lists according to the length of the sublists haskell Data.List Haskell Ord Num Haskell function which sorts a list of integer lists according to the length of the sublists I have ...	[ -0.00836181640625, 0.020263671875, 0.0206298828125, 0.001190185546875, -0.0125732421875, 0.01287841796875, -0.006500244140625, -0.007476806640625, -0.000858306884765625, -0.006256103515625, -0.01104736328125, -0.0022125244140625, 0.003570556640625, 0.006561279296875, -0.00897216796875, ...	[ 20625, 142508, 32354, 3129, 12096, 7, 5303, 892, 1505, 59499, 140909, 1614, 6562, 111, 1556, 11809, 154663, 35379, 52782, 765, 3444, 47, 23, 82800, 12989, 15072, 1884, 903, 14037, 1632, 29806, 959, 4966, 3917, 13319 ]	[ 0.1395263671875, 0.2470703125, 0.1982421875, 0.0491943359375, 0.2254638671875, 0.05712890625, 0.206298828125, 0.134033203125, 0.133544921875, 0.0965576171875, 0.170654296875, 0.18212890625, 0.1983642578125, 0.0267486572265625, 0.1226806640625, 0.07586669921875, 0.14599609375, 0.148...	embed
48365642_c0	48365642	haskell	0	Title: Koch snowflake in Haskell (CodeWorld) Problem title: Koch snowflake in Haskell (CodeWorld) Tags: codeworld, haskell Problem: Koch snowflake in Haskell (CodeWorld) Through the Haskell package, CodeWorld ( https://hackage.haskell.org/package/codeworld-api ) , I need to draw Koch's snowflake. You can use this packa...	Koch snowflake in Haskell (CodeWorld) Koch snowflake in Haskell (CodeWorld) codeworld haskell CodeWorld Koch Haskell Picture Koch snowflake in Haskell (CodeWorld) Through the Haskell package, CodeWorld ( https://hackage.haskell.org/package/codeworld-api ) , I need to draw Koch's snowflake. You can use this package onli...	[ 0.00058746337890625, 0.004486083984375, 0.0125732421875, 0.01202392578125, 0.00677490234375, 0.01123046875, 0.0252685546875, -0.0201416015625, -0.01434326171875, -0.01806640625, -0.01953125, -0.0203857421875, -0.0198974609375, 0.006378173828125, -0.0025787353515625, -0.00439453125, 0...	[ 103857, 108203, 13034, 350, 23, 20625, 142508, 114211, 70646, 18151, 32554, 1556, 28864, 158656, 98169, 139509, 10557, 1478, 29102, 40899, 40897, 3871, 79442, 25, 7, 4527, 903, 1118, 7026, 442, 3126, 94835, 12333, 7168, 856, 191, 605, 3581, ...	[ 0.280029296875, 0.1573486328125, 0.220703125, 0.1414794921875, 0.060302734375, 0.1142578125, 0.2410888671875, 0.137939453125, 0.167236328125, 0.07904052734375, 0.142822265625, 0.0751953125, 0.1556396484375, 0.173828125, 0.1859130859375, 0.1358642578125, 0.050872802734375, 0.0132751...	embed
9630142_c3	9630142	haskell	3	8e3a71ad38b -package-id time-1.4-3e186a51d3674e5d65b5a7925db3d3a7 -package-id utf8-string-0.3.7-528cea24d4cad2c1cb19a75d1ad8976c -package-id xml-1.3.12-d665e5a084b52511c150438a3c9fb8d1 -package-id zip-archive-0.1.1.7-463904d956f1052cc58a2c9e5deeee2c -package-id zlib-0.5.3.3-9ed15628a121b3b57f97b7acc02bf5d9 -O -O2 -Wall...	8e3a71ad38b -package-id time-1.4-3e186a51d3674e5d65b5a7925db3d3a7 -package-id utf8-string-0.3.7-528cea24d4cad2c1cb19a75d1ad8976c -package-id xml-1.3.12-d665e5a084b52511c150438a3c9fb8d1 -package-id zip-archive-0.1.1.7-463904d956f1052cc58a2c9e5deeee2c -package-id zlib-0.5.3.3-9ed15628a121b3b57f97b7acc02bf5d9 -O -O2 -Wall...	[ 0.00145721435546875, -0.0218505859375, 0.0262451171875, 0.004425048828125, -0.000728607177734375, 0.003082275390625, -0.046630859375, -0.0181884765625, -0.006683349609375, -0.00982666015625, -0.006744384765625, -0.0291748046875, 0.0111083984375, -0.02001953125, -0.003448486328125, 0.00...	[ 382, 11, 15770, 712, 10991, 275, 20, 29102, 4588, 532, 1733, 91977, 71, 48073, 486, 420, 1019, 91693, 23320, 5, 109981, 3882, 45710, 25426, 131492, 81046, 68330, 147488, 102014, 133760, 180234, 97, 5612, 93645, 670, 304, 198076, 157, 4205, ...	[ 0.1220703125, 0.036956787109375, 0.09368896484375, 0.0081787109375, 0.1351318359375, 0.041534423828125, 0.0217437744140625, 0.230712890625, 0.06951904296875, 0.082763671875, 0.181396484375, 0.097900390625, 0.018402099609375, 0.0035400390625, 0.032379150390625, 0.014923095703125, 0.09...	embed
1106431_c0	1106431	haskell	0	Title: What are some good intermediate problems and projects for learning Haskell? Problem title: What are some good intermediate problems and projects for learning Haskell? Tags: haskell Problem: What are some good intermediate problems and projects for learning Haskell? I just recently started diving into Real World ...	What are some good intermediate problems and projects for learning Haskell? What are some good intermediate problems and projects for learning Haskell? haskell What Haskell What are some good intermediate problems and projects for learning Haskell? I just recently started diving into Real World Haskell and the book pro...	[ -0.00125885009765625, 0.004425048828125, 0.009033203125, 0.0140380859375, -0.006072998046875, 0.01123046875, -0.01348876953125, -0.00787353515625, 0.020263671875, -0.00360107421875, -0.00125885009765625, -0.032470703125, -0.0012359619140625, 0.024169921875, -0.01263427734375, -0.008911...	[ 4865, 3060, 4127, 81814, 2182, 44402, 136, 77635, 100, 52080, 20625, 142508, 1556, 621, 26859, 45, 6496, 5120, 6661, 12877, 41361, 81979, 157666, 86869, 140528, 104902, 11522, 28219, 46876, 130732, 8966, 831, 104250, 35978, 99, 6183, 66801, 7...	[ 0.083740234375, 0.0455322265625, 0.1419677734375, 0.1865234375, 0.1099853515625, 0.185791015625, 0.08551025390625, 0.166748046875, 0.058319091796875, 0.1292724609375, 0.192138671875, 0.272216796875, 0.17041015625, 0.01123046875, 0.002471923828125, 0.021636962890625, 0.01226806640625,...	embed
13207261_c0	13207261	haskell	0	Title: How to set the working directory of WinGHCi Problem title: How to set the working directory of WinGHCi Tags: ghc, windows-7, haskell, winghci Problem: How to set the working directory of WinGHCi I just installed WinGHCi. When I try to load an .hs file with Ctrl+L, it opens the file browser in C:\Program Files (x...	How to set the working directory of WinGHCi How to set the working directory of WinGHCi ghc windows-7 haskell winghci How WinGHCi Program Files x86 Haskell Platform MyPath windows-7 How to set the working directory of WinGHCi I just installed WinGHCi. When I try to load an .hs file with Ctrl+L, it opens the file browse...	[ -0.0026397705078125, 0.0057373046875, 0.0027313232421875, 0.0262451171875, -0.01361083984375, 0.0155029296875, 0.00022125244140625, -0.0189208984375, -0.0031585693359375, -0.024658203125, 0.006805419921875, 0.007354736328125, -0.005828857421875, 0.004302978515625, -0.006072998046875, 0...	[ 11249, 5423, 20697, 14364, 53, 111, 17686, 41877, 40658, 47, 31380, 238, 54825, 16709, 1556, 142508, 14775, 127, 318, 7663, 42724, 15276, 20625, 70968, 2646, 683, 10519, 70, 20600, 72367, 5, 11435, 68847, 1328, 866, 9803, 31842, 313, 148968...	[ 0.05450439453125, 0.178466796875, 0.2032470703125, 0.206787109375, 0.1248779296875, 0.07269287109375, 0.1334228515625, 0.1741943359375, 0.253173828125, 0.014739990234375, 0.0894775390625, 0.06939697265625, 0.0657958984375, 0.1011962890625, 0.09906005859375, 0.1878662109375, 0.1235351...	embed
43958571_c0	43958571	haskell	0	Title: Passing two arguments of differing types Problem title: Passing two arguments of differing types Tags: haskell Problem: Passing two arguments of differing types I want to create a function, let's call it altHead, that takes 2 variables and outputs a variable such that: a -> [a] -> a I want to call it like this: ...	Passing two arguments of differing types Passing two arguments of differing types haskell Passing x:xs Passing two arguments of differing types I want to create a function, let's call it altHead, that takes 2 variables and outputs a variable such that: I want to call it like this: What it should do is to look at the fi...	[ 0.0140380859375, 0.0027618408203125, -0.00616455078125, 0.00604248046875, 0.002288818359375, 0.0191650390625, 0.005035400390625, -0.0107421875, 0.0208740234375, -0.01806640625, 0.029052734375, 0.00830078125, 0.01287841796875, 0.0228271484375, -0.005828857421875, -0.0218505859375, 0.0...	[ 28872, 6626, 10750, 111, 129927, 214, 52895, 1556, 142508, 1022, 12, 425, 7, 3444, 28282, 32354, 2641, 13025, 712, 51776, 116, 77336, 140992, 11782, 5608, 6713, 99, 5117, 5303, 4263, 201505, 30646, 285, 34292, 120262, 25632, 18151, 18822, 4...	[ 0.109619140625, 0.1217041015625, 0.22412109375, 0.002410888671875, 0.1683349609375, 0.0748291015625, 0.1641845703125, 0.1357421875, 0.20166015625, 0.0911865234375, 0.0731201171875, 0.13427734375, 0.09686279296875, 0.0418701171875, 0.06988525390625, 0.1490478515625, 0.1334228515625, ...	embed
10669217_c0	10669217	haskell	0	Title: efficient functional data structure for finite bijections Problem title: efficient functional data structure for finite bijections Tags: bijection, data-structures, functional-programming, haskell, ocaml Problem: efficient functional data structure for finite bijections I'm looking for a functional data structur...	efficient functional data structure for finite bijections efficient functional data structure for finite bijections bijection data-structures functional-programming haskell ocaml efficient functional data structure for finite bijections I'm looking for a functional data structure that represents finite bijections betwe...	[ 0.00022983551025390625, 0.0262451171875, -0.00439453125, -0.0244140625, -0.006622314453125, 0.005645751953125, 0.007049560546875, -0.002349853515625, -0.00830078125, -0.0260009765625, 0.0120849609375, 0.00946044921875, 0.0003757476806640625, 0.00335693359375, 0.0074462890625, 0.0080566...	[ 93766, 123309, 2053, 45646, 100, 94418, 13, 1582, 58994, 137656, 28966, 1556, 142508, 36, 9779, 141, 16487, 33636, 17721, 6626, 52895, 83, 32628, 24500, 45964, 1733, 17723, 179635, 1238, 111, 13267, 653, 65042, 678, 3525, 80836, 80854, 27140,...	[ 0.2081298828125, 0.2120361328125, 0.14404296875, 0.2210693359375, 0.040283203125, 0.195068359375, 0.07080078125, 0.1500244140625, 0.1947021484375, 0.1590576171875, 0.0885009765625, 0.114501953125, 0.2139892578125, 0.0836181640625, 0.0947265625, 0.107177734375, 0.06878662109375, 0.1...	embed
19060560_c0	19060560	haskell	0	Title: Haskell module ,parse error on input 'sayhello'"` Problem title: Haskell module ,parse error on input 'sayhello'"` Tags: haskell Problem: Haskell module ,parse error on input 'sayhello'"` module sayhello ( inChinese , inSpanish ) where inChinese = "Ni Hao" inSpanish= "Hola" import s...	Haskell module ,parse error on input 'sayhello'"` Haskell module ,parse error on input 'sayhello'"` haskell sayhello Haskell Hao Hola sayhello.inChinese sayhello.inSpanish module.hs:1:8 Haskell module ,parse error on input 'sayhello'"` I got error from this code. "module.hs:1:8: parse erro...	[ -0.0037384033203125, 0.0031890869140625, -0.01123046875, 0.0260009765625, -0.005584716796875, 0.0177001953125, 0.0152587890625, -0.0096435546875, -0.018798828125, -0.008056640625, -0.016845703125, -0.042724609375, 0.03271484375, -0.0164794921875, -0.0026397705078125, -0.0042724609375, ...	[ 20625, 142508, 88996, 2500, 184, 18499, 98, 107730, 3768, 20347, 127, 13817, 1556, 5154, 1391, 47958, 73, 51379, 24366, 141667, 78183, 1019, 1295, 903, 18151, 83279, 13, 7, 19721, 12, 366, 28219, 4358, 2967, 4527, 1407, 56, 7225, 9351, 13...	[ 0.159423828125, 0.251953125, 0.2396240234375, 0.138671875, 0.13671875, 0.2210693359375, 0.0628662109375, 0.2198486328125, 0.0914306640625, 0.1431884765625, 0.122314453125, 0.244140625, 0.1151123046875, 0.1248779296875, 0.10498046875, 0.197265625, 0.01165771484375, 0.08941650390625,...	embed
30220219_c0	30220219	haskell	0	Title: Why length return Int and not Num Problem title: Why length return Int and not Num Tags: haskell Problem: Why length return Int and not Num Is there any reason for restricting length function to Int and not to Num ? A lot of functions from prelude have the restriction to Int type and not to a more generic type /...	Why length return Int and not Num Why length return Int and not Num haskell Why Num Integral Why length return Int and not Num Is there any reason for restricting length function to Int and not to Num ? A lot of functions from prelude have the restriction to Int type and not to a more generic type / typeclass: But ther...	[ -0.01318359375, 0.00775146484375, 0.01324462890625, 0.01318359375, -0.002288818359375, 0.006500244140625, 0.000759124755859375, 0.007568359375, 0.01483154296875, -0.00049591064453125, -0.0208740234375, -0.051025390625, 0.0030364990234375, 0.005279541015625, 0.007568359375, -0.001152038...	[ 44084, 140909, 30646, 360, 18, 136, 959, 52782, 1556, 142508, 204681, 2499, 31635, 173072, 32354, 47, 5915, 7, 479, 822, 112, 185190, 10644, 189534, 67413, 1286, 11809, 5, 154663, 5117, 61924, 17932 ]	[ 0.1304931640625, 0.258544921875, 0.1817626953125, 0.1585693359375, 0.19775390625, 0.072998046875, 0.116455078125, 0.2235107421875, 0.132080078125, 0.2403564453125, 0.22119140625, 0.00885009765625, 0.10400390625, 0.15283203125, 0.16064453125, 0.012786865234375, 0.040924072265625, 0....	embed
23754319_c0	23754319	haskell	0	Title: Haskell Diagrams double lined arrows Problem title: Haskell Diagrams double lined arrows Tags: haskell-diagrams, haskell Problem: Haskell Diagrams double lined arrows I'm working now on my library for Bachelor thesis and I need Your help for making new line type. Bellow there is code for single line, double head...	Haskell Diagrams double lined arrows Haskell Diagrams double lined arrows haskell-diagrams haskell Haskell Diagrams Haskell Diagrams double lined arrows I'm working now on my library for Bachelor thesis and I need Your help for making new line type. Bellow there is code for single line, double head arrow: <-> . I would...	[ -0.007781982421875, 0.00004673004150390625, 0.0023651123046875, 0.0162353515625, -0.006866455078125, 0.00994873046875, -0.024169921875, 0.00543212890625, -0.0091552734375, -0.0093994140625, 0.005157470703125, -0.00262451171875, 0.00811767578125, 0.0019683837890625, -0.006134033203125, ...	[ 20625, 142508, 4512, 25561, 41929, 13315, 71, 118201, 1556, 3390, 20697, 35773, 147697, 159688, 3871, 4358, 20662, 3525, 10644, 873, 41566, 18151, 11001, 10336, 4426, 103607, 26458, 81273, 3249, 1295, 2256, 2203, 141037, 168407, 150369, 3509, 3...	[ 0.1226806640625, 0.217529296875, 0.1260986328125, 0.1519775390625, 0.198974609375, 0.173583984375, 0.03125, 0.2255859375, 0.11572265625, 0.08544921875, 0.055450439453125, 0.072509765625, 0.0943603515625, 0.099609375, 0.0209503173828125, 0.0906982421875, 0.0280609130859375, 0.068481...	embed
52038907_c0	52038907	haskell	0	Title: Haskell - why getSymbolicLinkTarget is not in scope? Problem title: Haskell - why getSymbolicLinkTarget is not in scope? Tags: haskell Problem: Haskell - why getSymbolicLinkTarget is not in scope? I get this error: /home/jacek/hasktemp/src/Main.hs:40:31: error: Variable not in scope: getSymbolicLinkTarget :: [Ch...	Haskell - why getSymbolicLinkTarget is not in scope? Haskell - why getSymbolicLinkTarget is not in scope? haskell System.Directory Haskell Main.hs:40:31 Variable Char Haskell - why getSymbolicLinkTarget is not in scope? I get this error: when I try to find the target of a symlink. The gist of my code is here: https://g...	[ 0.004730224609375, 0.00016021728515625, 0.01080322265625, 0.033203125, 0.01165771484375, 0.0255126953125, -0.0019378662109375, 0.0113525390625, -0.0216064453125, -0.004058837890625, -0.005279541015625, -0.0255126953125, -0.02734375, -0.00958251953125, -0.01458740234375, -0.000109195709...	[ 20625, 142508, 15400, 2046, 65183, 36846, 1771, 64287, 63031, 3794, 83, 959, 23, 70820, 1556, 12353, 184911, 12321, 27321, 84572, 2886, 21656, 18499, 9790, 7413, 30388, 954, 39, 10187, 3016, 271, 18151, 3688, 735, 15769, 32102, 232, 24927, ...	[ 0.131103515625, 0.233642578125, 0.1263427734375, 0.1251220703125, 0.0855712890625, 0.1878662109375, 0.060577392578125, 0.2139892578125, 0.19140625, 0.199462890625, 0.07220458984375, 0.136474609375, 0.1136474609375, 0.2156982421875, 0.09033203125, 0.024627685546875, 0.043731689453125,...	embed
7451548_c0	7451548	haskell	0	Title: Is there a "unit" class? Would it be useful? Problem title: Is there a "unit" class? Would it be useful? Tags: alternative-functor, haskell, monoids Problem: Is there a "unit" class? Would it be useful? Is there a class for types having a single unit value (not sure of the correct terminology...	Is there a "unit" class? Would it be useful? Is there a "unit" class? Would it be useful? alternative-functor haskell monoids Would Unit Maybe Nothing Default Reader Is there a "unit" class? Would it be useful? Is there a class for types having a single unit value (not sure of the correct terminolog...	[ 0.015869140625, 0.0277099609375, 0.021484375, -0.00927734375, -0.00823974609375, -0.027099609375, 0.00162506103515625, -0.0103759765625, 0.0024566650390625, -0.009033203125, -0.03173828125, -0.0001697540283203125, -0.00823974609375, -0.0028839111328125, -0.01043701171875, 0.00515747070...	[ 2685, 10, 309, 217, 18507, 154559, 80234, 30700, 16498, 18770, 1556, 142508, 22460, 30185, 46640, 83425, 182747, 262, 1021, 7136, 122636, 2071, 186, 100, 52895, 19441, 11001, 25072, 34292, 18614, 678, 3060, 479, 112, 5983, 77879, 60331, 71, ...	[ 0.08935546875, 0.09368896484375, 0.2425537109375, 0.238037109375, 0.274169921875, 0.0909423828125, 0.1966552734375, 0.09716796875, 0.03973388671875, 0.0333251953125, 0.0965576171875, 0.2208251953125, 0.1083984375, 0.1414794921875, 0.211181640625, 0.0909423828125, 0.09942626953125, ...	embed
43271059_c0	43271059	haskell	0	Title: How to read the bind operator ">>=" in words? Problem title: How to read the bind operator ">>=" in words? Tags: haskell, monads Problem: How to read the bind operator ">>=" in words? When reading code, I like to be able to form sentences in my head. For example, x <- getChar coul...	How to read the bind operator ">>=" in words? How to read the bind operator ">>=" in words? haskell monads How How to read the bind operator ">>=" in words? When reading code, I like to be able to form sentences in my head. For example, x <- getChar could be something like "x slurps getC...	[ -0.00494384765625, -0.01336669921875, 0.01275634765625, 0.00897216796875, 0.0017547607421875, 0.010498046875, 0.0230712890625, -0.00665283203125, 0.006744384765625, -0.0074462890625, 0.0031280517578125, -0.0225830078125, -0.01226806640625, -0.00640869140625, 0.0005950927734375, 0.00445...	[ 11249, 47, 12301, 68557, 39933, 41502, 5386, 23, 34153, 1556, 142508, 2667, 712, 7, 70, 30813, 22422, 16454, 18151, 1884, 19048, 3173, 149357, 10336, 1022, 4426, 2046, 84068, 5809, 425, 10681, 876, 2806, 275, 190659, 60331, 18403, 16666, 71...	[ 0.07647705078125, 0.0596923828125, 0.2032470703125, 0.25830078125, 0.2391357421875, 0.053192138671875, 0.1197509765625, 0.0941162109375, 0.2005615234375, 0.0843505859375, 0.215576171875, 0.061767578125, 0.0943603515625, 0.0318603515625, 0.003814697265625, 0.2431640625, 0.03369140625,...	embed
46703780_c0	46703780	haskell	0	Title: How to capture string in haskell regex expression? Problem title: How to capture string in haskell regex expression? Tags: regex, haskell Problem: How to capture string in haskell regex expression? With module Text.Regex.Posix,I can check if a string matchs a regex expression,but I don't know how to capture elem...	How to capture string in haskell regex expression? How to capture string in haskell regex expression? regex haskell How Match i:MAIL a-zA-Z0-9 SIZE mailMatch.Groups ToString How to capture string in haskell regex expression? With module Text.Regex.Posix,I can check if a string matchs a regex expression,but I don't know...	[ -0.019775390625, 0.008544921875, 0.008056640625, 0.04541015625, 0.0001544952392578125, 0.01129150390625, 0.00836181640625, 0.02197265625, -0.00592041015625, 0.020263671875, 0.00011491775512695312, -0.00098419189453125, -0.004638671875, -0.0311279296875, 0.00299072265625, -0.00570678710...	[ 11249, 47, 141621, 79315, 23, 1556, 142508, 6835, 3355, 125195, 67407, 17, 108971, 10, 169, 284, 1511, 2389, 15205, 10000, 19157, 6648, 79520, 206, 205072, 717, 71713, 214, 88996, 24129, 54601, 7192, 4084, 12765, 2174, 14858, 3714, 3642, 12...	[ 0.051483154296875, 0.0286712646484375, 0.2120361328125, 0.261962890625, 0.051849365234375, 0.1536865234375, 0.231201171875, 0.15283203125, 0.1959228515625, 0.2049560546875, 0.1395263671875, 0.04925537109375, 0.09613037109375, 0.03106689453125, 0.02099609375, 0.023345947265625, 0.0188...	embed
9440343_c1	9440343	haskell	1	call depends on the type of user (Unregistered or Customer). I believe this can be achieved by adding handleMessage to the class and instances: class ClientData a where cdSocket :: a -> Socket handleMessage :: a -> String -> IO () instance ClientData UnregisteredClientData where cdSocket = ucdSocket handleMessage unre...	call depends on the type of user (Unregistered or Customer). I believe this can be achieved by adding handleMessage to the class and instances: class ClientData a where cdSocket :: a -> Socket handleMessage :: a -> String -> IO () instance ClientData UnregisteredClientData where cdSocket = ucdSocket handleMessage unre...	[ 0.0047607421875, 0.0211181640625, -0.0047607421875, 0.027099609375, 0.00946044921875, 0.01104736328125, -0.00604248046875, 0.01190185546875, 0.0023040771484375, -0.048583984375, -0.010986328125, -0.0260009765625, 0.0155029296875, 0.01611328125, -0.01202392578125, -0.005950927734375, ...	[ 11782, 56566, 7, 10644, 38937, 14256, 105199, 124765, 18822, 831, 69307, 154107, 34831, 594, 6011, 429, 18507, 136, 110527, 91732, 137989, 10, 56329, 8912, 27853, 1061, 23351, 17780, 992, 150, 51, 5343, 147, 197648, 71574, 43373, 68163, 177, ...	[ 0.264892578125, 0.1077880859375, 0.0166473388671875, 0.07611083984375, 0.1846923828125, 0.047576904296875, 0.1849365234375, 0.214111328125, 0.031280517578125, 0.018768310546875, 0.1109619140625, 0.10345458984375, 0.181640625, 0.04833984375, 0.1141357421875, 0.034576416015625, 0.15393...	embed
56631989_c0	56631989	haskell	0	Title: How to match the rest of the list, no matter the length Problem title: How to match the rest of the list, no matter the length Tags: list, haskell, pattern-matching Problem: How to match the rest of the list, no matter the length I want to write a function which takes a list of String s with pattern matching. Fo...	How to match the rest of the list, no matter the length How to match the rest of the list, no matter the length list haskell pattern-matching How Either Command Right Left How to match the rest of the list, no matter the length I want to write a function which takes a list of String s with pattern matching. For example...	[ -0.010009765625, 0.01531982421875, 0.0015411376953125, 0.0113525390625, 0.002899169921875, 0.007049560546875, -0.0107421875, 0.01080322265625, 0.0238037109375, 0.0137939453125, 0.0242919921875, -0.00775146484375, 0.00946044921875, -0.0037078857421875, -0.00860595703125, 0.0009193420410...	[ 11249, 47, 14858, 10588, 111, 5303, 26866, 140909, 110, 1556, 142508, 103510, 98753, 9319, 123573, 90911, 636, 2480, 3444, 33022, 32354, 51776, 23351, 214, 91, 678, 12765, 166117, 5423, 366, 184, 7614, 9405, 3509, 19770, 27494, 43581, 51515, ...	[ 0.0838623046875, 0.04266357421875, 0.258056640625, 0.127197265625, 0.05615234375, 0.1727294921875, 0.06964111328125, 0.1146240234375, 0.008026123046875, 0.1148681640625, 0.19970703125, 0.19775390625, 0.2188720703125, 0.04736328125, 0.187255859375, 0.0986328125, 0.03131103515625, 0....	embed
10197712_c0	10197712	haskell	0	Title: How to upgrade gtk2hsC2hs? Problem title: How to upgrade gtk2hsC2hs? Tags: glib, cabal, haskell, gtk2hs, gtk Problem: How to upgrade gtk2hsC2hs? I am trying cabal install glib-0.12.3 under my Ubuntu 11.10 using cabal-install 0.10.2. However, it shows the following error messages: setup: The program gtk2hsC2hs ve...	How to upgrade gtk2hsC2hs? How to upgrade gtk2hsC2hs? glib cabal haskell gtk2hs gtk How gtk2hsC2hs glib-0.12.3 Error ExitFailure gtk2hs How to upgrade gtk2hsC2hs? I am trying cabal install glib-0.12.3 under my Ubuntu 11.10 using cabal-install 0.10.2. However, it shows the following error messages: After half an hour's ...	[ -0.00836181640625, 0.02734375, -0.00183868408203125, 0.004852294921875, 0.01251220703125, 0.01239013671875, -0.00799560546875, 0.000335693359375, 0.00811767578125, 0.01190185546875, 0.0062255859375, -0.06640625, 0.004730224609375, -0.0157470703125, -0.005767822265625, -0.00759887695312...	[ 11249, 47, 116086, 706, 31472, 304, 127, 7, 441, 1978, 275, 109524, 1556, 142508, 102014, 120883, 212059, 5443, 217, 17647, 379, 3408, 31577, 20600, 1379, 116890, 4541, 963, 17368, 80383, 107754, 133684, 25632, 18499, 89914, 23552, 56816, 339...	[ 0.099609375, 0.06658935546875, 0.24169921875, 0.09246826171875, 0.2037353515625, 0.14599609375, 0.1815185546875, 0.116455078125, 0.051666259765625, 0.2037353515625, 0.210693359375, 0.2529296875, 0.1297607421875, 0.2208251953125, 0.140380859375, 0.191162109375, 0.1546630859375, 0.14...	embed
12120507_c0	12120507	haskell	0	Title: Ambiguous Types, and Defaults for Overloaded Numeric Operations Problem title: Ambiguous Types, and Defaults for Overloaded Numeric Operations Tags: haskell Problem: Ambiguous Types, and Defaults for Overloaded Numeric Operations import Data.Dynamic default(Integer,Double) a :: Num a => a a = 5 -- show :: Show a...	Ambiguous Types, and Defaults for Overloaded Numeric Operations Ambiguous Types, and Defaults for Overloaded Numeric Operations haskell Data.Dynamic Ambiguous Types Defaults Overloaded Numeric Operations Integer Double Num Show Typeable Dynamic LINE WORKS WELL LEADS TYPE ERROR Ambiguous Types, and Defaults for Overload...	[ 0.021240234375, -0.00250244140625, 0.0021209716796875, 0.0291748046875, 0.004913330078125, -0.00013637542724609375, -0.01904296875, -0.002349853515625, -0.007110595703125, 0.00019931793212890625, -0.03759765625, -0.04638671875, 0.004119873046875, 0.001953125, 0.004852294921875, 0.00473...	[ 10250, 12282, 10821, 60457, 136, 262, 1021, 7136, 100, 9578, 63033, 297, 93511, 102203, 1556, 142508, 11809, 29673, 21068, 44401, 107172, 52782, 17367, 2886, 73327, 130028, 231355, 56051, 110376, 95267, 151206, 18, 28219, 15400, 5117, 24931, 11...	[ 0.158203125, 0.2288818359375, 0.1409912109375, 0.22119140625, 0.0615234375, 0.07366943359375, 0.1453857421875, 0.1165771484375, 0.051055908203125, 0.1282958984375, 0.1651611328125, 0.043487548828125, 0.08721923828125, 0.18017578125, 0.10205078125, 0.2139892578125, 0.103759765625, 0...	embed
1465426_c0	1465426	haskell	0	Title: Libraries "rt" and "dl" in Cygwin Problem title: Libraries "rt" and "dl" in Cygwin Tags: cygwin, haskell, static-libraries Problem: Libraries "rt" and "dl" in Cygwin Perhaps this is stupid but I'm unable to find out which package I have to install in Cygwin to fix the foll...	Libraries "rt" and "dl" in Cygwin Libraries "rt" and "dl" in Cygwin cygwin haskell static-libraries Libraries Cygwin config.status unix.buildinfo HsUnixConfig.h cabal.exe Missing HsUnix.h Libraries "rt" and "dl" in Cygwin Perhaps this is stupid but I'm unable to find out which pa...	[ 0.00823974609375, 0.003570556640625, 0.0234375, -0.02099609375, -0.0045166015625, 0.006317138671875, 0.0002727508544921875, 0.01275634765625, -0.003875732421875, -0.00933837890625, -0.0186767578125, -0.022216796875, -0.006439208984375, 0.0225830078125, 0.000301361083984375, -0.01135253...	[ 165867, 10484, 3198, 136, 20469, 23, 27939, 177, 9494, 19932, 1556, 142508, 201939, 150, 2844, 153837, 45215, 51, 4084, 177149, 7319, 572, 7, 85600, 83671, 127, 109524, 46480, 16771, 425, 110833, 2886, 7413, 98169, 765, 20600, 30022, 132283, ...	[ 0.234619140625, 0.194091796875, 0.21142578125, 0.07366943359375, 0.1817626953125, 0.046875, 0.141357421875, 0.11962890625, 0.266357421875, 0.080078125, 0.0966796875, 0.223388671875, 0.1590576171875, 0.11669921875, 0.1920166015625, 0.1361083984375, 0.0849609375, 0.0435791015625, 0...	embed
53470725_c0	53470725	haskell	0	Title: Parse error on input ‘module’ when importing a module Problem title: Parse error on input ‘module’ when importing a module Tags: compiler-errors, haskell Problem: Parse error on input ‘module’ when importing a module This is the source code of the file Solitaire.hs: import MergeSort module Solitaire where a :: I...	Parse error on input ‘module’ when importing a module Parse error on input ‘module’ when importing a module compiler-errors haskell MergeSort Parse Solitaire Solitaire.hs:3:1 Failed Parse error on input ‘module’ when importing a module This is the source code of the file Solitaire.hs: MergeSort.hs and Solitaire.hs are ...	[ -0.00119781494140625, 0.00946044921875, -0.0218505859375, 0.0181884765625, -0.005218505859375, 0.0181884765625, 0.011474609375, -0.0108642578125, -0.0004024505615234375, -0.03662109375, -0.030517578125, 0.00494384765625, 0.01068115234375, -0.01263427734375, -0.000934600830078125, -0.00...	[ 2392, 184, 18499, 107730, 83279, 13, 24927, 214, 88996, 9969, 34759, 188800, 1556, 142508, 6035, 429, 158240, 18, 124725, 44386, 127, 363, 19721, 190355, 31344, 18151, 11435, 5701, 14364, 17686, 318, 31577, 72367, 151134, 75101, 63033, 7, 193...	[ 0.1343994140625, 0.1387939453125, 0.1778564453125, 0.14892578125, 0.1583251953125, 0.05621337890625, 0.2113037109375, 0.08282470703125, 0.20703125, 0.0498046875, 0.050689697265625, 0.1314697265625, 0.0987548828125, 0.1942138671875, 0.1668701171875, 0.150146484375, 0.2109375, 0.0570...	embed
27773779_c0	27773779	haskell	0	Title: Implementing List#flatten in Haskell Problem title: Implementing List#flatten in Haskell Tags: scala, haskell Problem: Implementing List#flatten in Haskell Scala offers a List#flatten method for going from List[Option[A]] to List[A] . scala> val list = List(Some(10), None) list: List[Option[Int]] = List(Some(10)...	Implementing List#flatten in Haskell Implementing List#flatten in Haskell scala haskell Implementing List Haskell Option Some None list.flatten res11 Maybe Just Nothing Implementing List#flatten in Haskell Scala offers a List#flatten method for going from List[Option[A]] to List[A] . I attempted to implement it in Hask...	[ 0.000171661376953125, 0.01904296875, 0.021728515625, -0.008544921875, 0.007476806640625, 0.0023040771484375, 0.00994873046875, -0.01324462890625, -0.005706787109375, 0.02294921875, -0.00372314453125, -0.006103515625, -0.00347900390625, 0.001068115234375, -0.004364013671875, 0.008544921...	[ 153941, 32036, 4904, 150632, 510, 20625, 142508, 23, 146232, 1556, 86769, 31384, 438, 5303, 3332, 1662, 83425, 9563, 182747, 152653, 11, 55300, 7730, 1295, 39029, 284, 47, 81887, 29479, 2301, 18, 1884, 15824, 706, 83, 2878, 289, 351, 188, ...	[ 0.16455078125, 0.2003173828125, 0.10986328125, 0.1883544921875, 0.232421875, 0.128173828125, 0.2264404296875, 0.0141143798828125, 0.146728515625, 0.1097412109375, 0.17431640625, 0.05194091796875, 0.078369140625, 0.160400390625, 0.049072265625, 0.08740234375, 0.0841064453125, 0.0333...	embed
28567722_c0	28567722	haskell	0	Title: No space concatenating with an empty doc in wl-pprint Problem title: No space concatenating with an empty doc in wl-pprint Tags: pretty-print, haskell Problem: No space concatenating with an empty doc in wl-pprint I'm using wl-pprint to output a data type with its fields rendered and separated with spaces. Some ...	No space concatenating with an empty doc in wl-pprint No space concatenating with an empty doc in wl-pprint pretty-print haskell Nothing Doc No space concatenating with an empty doc in wl-pprint I'm using wl-pprint to output a data type with its fields rendered and separated with spaces. Some of the fields can be Nothi...	[ -0.01275634765625, -0.007354736328125, -0.00135040283203125, 0.01470947265625, -0.0255126953125, 0.00531005859375, 0.0034637451171875, -0.029296875, 0.00787353515625, 0.0185546875, 0.0169677734375, -0.01318359375, -0.019287109375, -0.01507568359375, -0.008544921875, -0.0011444091796875...	[ 438, 32628, 158, 4460, 33, 678, 201505, 51584, 148, 141, 254, 35662, 28875, 1556, 142508, 182747, 29048, 23, 140992, 2053, 10644, 44457, 79516, 84797, 831, 89159, 3444, 15190, 4173, 11737, 79315, 72546, 177099, 78934, 35773, 1328, 39933, 237,...	[ 0.081298828125, 0.228515625, 0.03240966796875, 0.1134033203125, 0.045166015625, 0.04388427734375, 0.2078857421875, 0.1671142578125, 0.03143310546875, 0.095458984375, 0.051300048828125, 0.197509765625, 0.111572265625, 0.0794677734375, 0.162109375, 0.1514892578125, 0.1630859375, 0.03...	embed
28658485_c1	28658485	haskell	1	Col $ lsToRGB $ wordsWhen (==',') str where -- could also use splitOn wordsWhen :: (Char -> Bool) -> String -> [String] wordsWhen p s = case dropWhile p s of "" -> [] s' -> w : wordsWhen p s'' where (w, s'') = break p s' -- take a list of strings and make a triple of ints lsToRGB :: [String] -> (Int,Int,Int) lsToRGB (a...	Col $ lsToRGB $ wordsWhen (==',') str where -- could also use splitOn wordsWhen :: (Char -> Bool) -> String -> [String] wordsWhen p s = case dropWhile p s of "" -> [] s' -> w : wordsWhen p s'' where (w, s'') = break p s' -- take a list of strings and make a triple of ints lsToRGB :: [String] -> (Int,Int,Int) lsToRGB (a...	[ -0.0191650390625, -0.017333984375, -0.0028533935546875, 0.0322265625, -0.000698089599609375, 0.0286865234375, 0.010986328125, -0.00811767578125, 0.003662109375, 0.0091552734375, -0.0026702880859375, -0.019775390625, 0.031982421875, -0.00347900390625, -0.026611328125, 0.007232666015625,...	[ 11554, 3650, 96, 7, 7763, 1052, 8359, 34153, 186048, 69112, 25, 7704, 7440, 4210, 5809, 4527, 65450, 20320, 1984, 84068, 33079, 2460, 929, 23351, 214, 71713, 915, 91, 7225, 36069, 979, 111, 148, 4765, 434, 2203, 36356, 5646, 5303, 79315, ...	[ 0.25048828125, 0.1375732421875, 0.084228515625, 0.037445068359375, 0.20751953125, 0.1231689453125, 0.231201171875, 0.1944580078125, 0.2069091796875, 0.1697998046875, 0.119873046875, 0.1806640625, 0.112548828125, 0.04681396484375, 0.045867919921875, 0.09454345703125, 0.1556396484375, ...	embed
70924797_c1	70924797	haskell	1	901s elapsed) by changing the update function to this: update g k = runIdentity $ Map.traverseWithKey (\i jmap -> pure $ shortmap i jmap) g Why does using traverseWithKey in the Identity monad speed up performance? I checked the IntMap source code but couldn't figure out the reason. Is this a bug or the expected behavi...	901s elapsed) by changing the update function to this: update g k = runIdentity $ Map.traverseWithKey (\i jmap -> pure $ shortmap i jmap) g Why does using traverseWithKey in the Identity monad speed up performance? I checked the IntMap source code but couldn't figure out the reason. Is this a bug or the expected behavi...	[ -0.013427734375, 0.0166015625, 0.0086669921875, -0.00714111328125, -0.0025787353515625, 0.004180908203125, -0.004119873046875, 0.00872802734375, -0.01123046875, -0.01422119140625, 0.0194091796875, 0.03271484375, -0.017822265625, 0.014892578125, 0.003204345703125, 0.0126953125, 0.0072...	[ 189202, 7, 127966, 71, 151134, 28350, 32354, 903, 706, 472, 11675, 568, 37379, 2481, 42719, 1517, 37676, 194583, 162429, 1647, 62346, 34166, 16610, 44084, 14602, 17368, 37317, 13, 71257, 2667, 712, 38352, 1257, 23718, 360, 18, 166179, 31344, ...	[ 0.26025390625, 0.0271453857421875, 0.116943359375, 0.0206298828125, 0.1160888671875, 0.175048828125, 0.11328125, 0.040130615234375, 0.0775146484375, 0.087646484375, 0.1015625, 0.033203125, 0.1875, 0.1207275390625, 0.1494140625, 0.072265625, 0.17578125, 0.19970703125, 0.2514648437...	embed
42396730_c0	42396730	haskell	0	Title: Removing the usage of fromJust Problem title: Removing the usage of fromJust Tags: haskell, option-type, refactoring Problem: Removing the usage of fromJust Say, I have some code like this: data Record = Record { validate :: Maybe Bool, mobile :: Text } someFunction :: Monad m => m () someFunction = do (record :...	Removing the usage of fromJust Removing the usage of fromJust haskell option-type refactoring Removing Record Maybe Bool Text Monad Just Nothing Removing the usage of fromJust Say, I have some code like this: Now when hasValidate has some value of Just _ , I can know for sure that record isn't Nothing . Is there a way ...	[ -0.00653076171875, 0.019287109375, 0.01422119140625, 0.00494384765625, 0.004302978515625, 0.00689697265625, 0.005889892578125, 0.0194091796875, -0.00250244140625, -0.03564453125, 0.00811767578125, -0.02197265625, 0.000667572021484375, 0.004058837890625, -0.006439208984375, -0.001365661...	[ 853, 432, 6496, 127689, 111, 1295, 127794, 1556, 142508, 35829, 50986, 456, 144810, 54877, 83425, 2460, 929, 24129, 60331, 71, 9563, 182747, 25916, 18151, 42272, 1683, 67, 34292, 101, 3714, 9077, 17164, 56112, 18, 3917, 87388, 15490, 48716, ...	[ 0.005096435546875, 0.1400146484375, 0.011138916015625, 0.1715087890625, 0.03326416015625, 0.237060546875, 0.212646484375, 0.1790771484375, 0.219482421875, 0.184814453125, 0.06793212890625, 0.02215576171875, 0.1417236328125, 0.1641845703125, 0.061309814453125, 0.050811767578125, 0.131...	embed

66555516_c0

66555516

haskell

0

Title: Uniqueness of pure Problem title: Uniqueness of pure Tags: applicative, haskell Problem: Uniqueness of pure For any Applicative instance, once <*> is written, pure is uniquely determined. Suppose you have pure1 and pure2 , both of which obey the laws. Then pure2 f <*> pure1 y = pure1 ($ y) <*> pure2 f -- interch...

Uniqueness of pure Uniqueness of pure applicative haskell Uniqueness Applicative pure1 pure2 Uniqueness of pure For any Applicative instance, once <*> is written, pure is uniquely determined. Suppose you have pure1 and pure2 , both of which obey the laws. Then But using the fmap law this way feels like a cheat. Is ther...

[ 0.002349853515625, 0.0262451171875, 0.0024261474609375, 0.009765625, 0.0003147125244140625, 0.01275634765625, -0.0009918212890625, -0.010986328125, 0.024658203125, -0.015869140625, -0.00592041015625, 0.0019989013671875, -0.00115966796875, 0.01904296875, 0.0027618408203125, 0.0061035156...

[ 11789, 944, 7432, 111, 34166, 41816, 4935, 1556, 142508, 5659, 11048, 418, 304, 2499, 110527, 24145, 1639, 83, 59121, 36998, 83324, 121691, 765, 136, 15044, 36, 31804, 131703, 17368, 70, 1238, 62346, 27165, 12319, 1884, 290, 257, 71864, 149...

[ 0.2371826171875, 0.16748046875, 0.05950927734375, 0.10888671875, 0.284423828125, 0.1822509765625, 0.09954833984375, 0.1650390625, 0.2349853515625, 0.1475830078125, 0.1630859375, 0.07879638671875, 0.1292724609375, 0.03680419921875, 0.1678466796875, 0.1060791015625, 0.1246337890625, ...

embed

59393306_c0

59393306

haskell

0

Title: Yesod Haskell - How to create PDF reports, with a header and footer on each page? Problem title: Yesod Haskell - How to create PDF reports, with a header and footer on each page? Tags: haskell, pdf, web-deployment, report, yesod Problem: Yesod Haskell - How to create PDF reports, with a header and footer on each...

Yesod Haskell - How to create PDF reports, with a header and footer on each page? Yesod Haskell - How to create PDF reports, with a header and footer on each page? haskell pdf web-deployment report yesod Yesod Haskell How PDF Yesod.Content.PDF Yesod Haskell - How to create PDF reports, with a header and footer on each ...

[ 0.0098876953125, 0.0125732421875, 0.0037384033203125, 0.0040283203125, -0.014892578125, 0.00067138671875, -0.0230712890625, -0.00836181640625, -0.01483154296875, -0.0101318359375, 0.00077056884765625, -0.044677734375, -0.00787353515625, 0.0036468505859375, 0.0078125, -0.01434326171875,...

[ 32635, 2199, 20625, 142508, 11249, 28282, 6859, 117729, 678, 10336, 57616, 12638, 9191, 47, 1556, 26198, 1467, 112, 13158, 13416, 2422, 23722, 11935, 25352, 28242, 31577, 32354, 7693, 304, 3871, 3917, 3249, 136, 11522, 55516, 49347, 16751, 47...

[ 0.160888671875, 0.229736328125, 0.1390380859375, 0.2412109375, 0.0889892578125, 0.157958984375, 0.2259521484375, 0.2122802734375, 0.10284423828125, 0.1636962890625, 0.17138671875, 0.09716796875, 0.167724609375, 0.0287933349609375, 0.10296630859375, 0.1583251953125, 0.048065185546875,...

embed

64730978_c0

64730978

haskell

0

Title: Putting two Integers into a list from a single list comprehension Problem title: Putting two Integers into a list from a single list comprehension Tags: list-comprehension, haskell Problem: Putting two Integers into a list from a single list comprehension I need to find all primes ± 2 in list comprehension howev...

Putting two Integers into a list from a single list comprehension Putting two Integers into a list from a single list comprehension list-comprehension haskell a Putting Integers Integer Putting two Integers into a list from a single list comprehension I need to find all primes ± 2 in list comprehension however after lo...

[ -0.009765625, -0.003082275390625, 0.0125732421875, 0.0218505859375, 0.00689697265625, 0.03564453125, 0.0062255859375, -0.0004119873046875, 0.0201416015625, -0.018798828125, 0.000020503997802734375, -0.0208740234375, 0.0247802734375, 0.00921630859375, -0.015625, -0.00408935546875, -0....

[ 19577, 1916, 6626, 44401, 7, 3934, 5303, 1295, 11001, 46683, 3220, 10, 277, 4692, 1556, 142508, 3871, 7413, 756, 20809, 38405, 116, 23, 6889, 49903, 45767, 3642, 54, 171259, 4734, 27489, 54651, 3229, 5428, 114654, 1022, 2174, 14012, 660, ...

[ 0.14404296875, 0.0540771484375, 0.19482421875, 0.25048828125, 0.0865478515625, 0.146240234375, 0.2132568359375, 0.0904541015625, 0.1192626953125, 0.1806640625, 0.171142578125, 0.0159912109375, 0.03997802734375, 0.1424560546875, 0.1168212890625, 0.2103271484375, 0.07183837890625, 0....

embed

10457083_c0

10457083

haskell

0

Title: Haskell algebraic data type pattern matching Problem title: Haskell algebraic data type pattern matching Tags: algebraic-data-types, pattern-matching, haskell Problem: Haskell algebraic data type pattern matching I have the following: data Alpha a = Beta a [Alpha a] val = Beta 1 [Beta 2 [], Beta 5 [Beta 7 []]] I...

Haskell algebraic data type pattern matching Haskell algebraic data type pattern matching algebraic-data-types pattern-matching haskell Haskell Alpha Beta Haskell algebraic data type pattern matching I have the following: I'm trying to define a function that will move over a val of type Alpha Int and sum it. My desired...

[ -0.009765625, 0.004302978515625, 0.011474609375, 0.034423828125, -0.0028839111328125, 0.016357421875, -0.0252685546875, 0.0179443359375, 0.01470947265625, -0.006500244140625, -0.00421142578125, -0.01129150390625, 0.01806640625, -0.00092315673828125, 0.00113677978515625, -0.03271484375,...

[ 20625, 142508, 429, 2844, 2053, 10644, 103510, 14858, 214, 1771, 144, 10135, 50986, 98753, 1556, 76569, 48941, 25632, 31577, 61924, 32354, 1221, 25813, 645, 3502, 360, 18, 10554, 104851, 51515, 125663, 756, 933, 16750, 5303, 237875, 3714, 195...

[ 0.12109375, 0.2281494140625, 0.0589599609375, 0.102294921875, 0.0955810546875, 0.1729736328125, 0.21484375, 0.1826171875, 0.032989501953125, 0.0009765625, 0.010711669921875, 0.070556640625, 0.169677734375, 0.1597900390625, 0.10888671875, 0.1763916015625, 0.197021484375, 0.042236328...

embed

27969211_c0

27969211

haskell

0

Title: Class ForEachInt a in Haskell Problem title: Class ForEachInt a in Haskell Tags: haskell Problem: Class ForEachInt a in Haskell I am having difficulties in doing an exercise. I know I have to define the signatures of the functions except the function feget, but I do not know how to do it. I have to set the ForEa...

Class ForEachInt a in Haskell Class ForEachInt a in Haskell haskell ForEachInt Haskell fe2list Empty Class ForEachInt a in Haskell I am having difficulties in doing an exercise. I know I have to define the signatures of the functions except the function feget, but I do not know how to do it. I have to set the ForEachIn...

[ -0.004302978515625, -0.0059814453125, -0.001312255859375, 0.021728515625, -0.011962890625, 0.01202392578125, 0.0203857421875, -0.0203857421875, 0.0021514892578125, 0.0028839111328125, 0.006072998046875, -0.011474609375, 0.0032806396484375, 0.031005859375, -0.01226806640625, -0.01879882...

[ 35014, 1326, 647, 934, 4153, 18, 10, 23, 20625, 142508, 1556, 3820, 304, 6562, 31678, 939, 34844, 81979, 61924, 138256, 32354, 40494, 3794, 3714, 5423, 18507, 98363, 41421, 214, 47, 45646, 2053, 4343, 892, 26255, 96853, 1246, 13305, 927, ...

[ 0.1866455078125, 0.1812744140625, 0.139404296875, 0.1845703125, 0.1546630859375, 0.1446533203125, 0.1832275390625, 0.062744140625, 0.1474609375, 0.2366943359375, 0.13623046875, 0.15283203125, 0.0980224609375, 0.1749267578125, 0.138427734375, 0.0926513671875, 0.04931640625, 0.079284...

embed

19742337_c1

19742337

haskell

1

-> StatePut writeBS b = writeSized (BS.length b) putByteString b data SomeData = SomeData { sdName :: BS.ByteString , sdAge :: Int , sdN :: Int } deriving (Show, Eq) instance StateBinary SomeData where sput (SomeData nm a n) = do writeBS nm writeInt32 a writeInt32 n testData = SomeData "TestName" 30 100 runSPut :: Sta...

[ -0.0012054443359375, 0.01953125, -0.01544189453125, -0.015869140625, -0.004119873046875, 0.0224609375, -0.003204345703125, -0.00787353515625, 0.015869140625, 0.0106201171875, 0.00836181640625, 0.03564453125, 0.01025390625, 0.022216796875, -0.005218505859375, 0.00848388671875, -0.0003...

[ 33079, 22836, 27559, 18, 33022, 20429, 876, 2203, 29367, 23986, 3884, 75358, 67, 71713, 2053, 31384, 137989, 91, 71, 163612, 84145, 429, 839, 16406, 168660, 864, 110527, 571, 73, 6635, 7077, 8912, 39, 653, 6460, 10, 3034, 111337, 496, 805...

[ 0.134521484375, 0.2080078125, 0.22900390625, 0.174560546875, 0.185546875, 0.16845703125, 0.1749267578125, 0.04339599609375, 0.09765625, 0.07513427734375, 0.168212890625, 0.09112548828125, 0.0714111328125, 0.1500244140625, 0.1263427734375, 0.07861328125, 0.1273193359375, 0.006011962...

embed

21083006_c1

21083006

haskell

1

a monad variable not work as first argument of pReal :: (forall a. Num a => a -> a) -> ... , while its redefined version of the same type ( sign' ) works? How can I achieve passing polymorphic variable sign created in my monad to pReal function without re-defining ( sign' ) it inside my monad? Notes I already tried ap...

[ -0.01300048828125, 0.005645751953125, -0.0020751953125, 0.004608154296875, 0.006622314453125, 0.010009765625, 0.013427734375, -0.0189208984375, 0.0042724609375, -0.037353515625, 0.00732421875, -0.0128173828125, 0.00872802734375, -0.0269775390625, 0.006988525390625, 0.0079345703125, -...

[ 2667, 712, 77336, 959, 4488, 237, 5117, 10750, 915, 68996, 1984, 5584, 10, 52782, 44357, 33079, 15265, 5983, 11389, 5701, 10644, 24092, 25, 43240, 11249, 831, 69307, 452, 6953, 35874, 178851, 75935, 47, 32354, 15490, 456, 49919, 46132, 3784...

[ 0.165283203125, 0.2171630859375, 0.26416015625, 0.017791748046875, 0.0992431640625, 0.0236358642578125, 0.1036376953125, 0.209228515625, 0.0787353515625, 0.29443359375, 0.105224609375, 0.0687255859375, 0.0982666015625, 0.1142578125, 0.0457763671875, 0.090576171875, 0.0631103515625, ...

embed

22404939_c0

22404939

haskell

0

Title: Writing Category Instance for custom Lens Problem title: Writing Category Instance for custom Lens Tags: haskell-lens, haskell Problem: Writing Category Instance for custom Lens I have been reading this article for understanding Lenses. I know this is different from Edward Knett's lens package, but nonetheless i...

Writing Category Instance for custom Lens Writing Category Instance for custom Lens haskell-lens haskell Writing Category Instance Lens Writing Category Instance for custom Lens I have been reading this article for understanding Lenses. I know this is different from Edward Knett's lens package, but nonetheless it's use...

[ -0.00147247314453125, -0.002685546875, -0.003875732421875, 0.004150390625, -0.003753662109375, 0.003753662109375, -0.01220703125, -0.0299072265625, 0.00439453125, -0.00537109375, -0.0189208984375, 0.02978515625, -0.004913330078125, -0.0087890625, -0.001434326171875, 0.00031471252441406...

[ 213185, 49057, 360, 116071, 114122, 18226, 100, 1556, 142508, 1977, 7, 16454, 100094, 339, 47754, 12921, 38157, 45481, 3098, 98169, 80234, 20531, 62, 83, 61924, 71, 1884, 903, 119056, 3173, 95487, 31577, 28282, 110527, 10644, 67413, 54397, 80...

[ 0.184814453125, 0.256103515625, 0.0697021484375, 0.2042236328125, 0.19091796875, 0.25341796875, 0.039031982421875, 0.10498046875, 0.20166015625, 0.1727294921875, 0.1502685546875, 0.0438232421875, 0.044952392578125, 0.179931640625, 0.1856689453125, 0.0821533203125, 0.08599853515625, ...

embed

42765318_c0

42765318

haskell

0

Title: No instance for (RealFrac Int) arising from a use of ' ... ' Problem title: No instance for (RealFrac Int) arising from a use of ' ... ' Tags: functional-programming, types, haskell Problem: No instance for (RealFrac Int) arising from a use of ' ... ' The following program is supposed to chec...

No instance for (RealFrac Int) arising from a use of ' ... ' No instance for (RealFrac Int) arising from a use of ' ... ' functional-programming types haskell a RealFrac Harshad Bool No instance for (RealFrac Int) arising from a use of ' ... ' The following program is supposed to check whether the i...

[ -0.01708984375, 0.00946044921875, -0.0029449462890625, -0.00653076171875, -0.0031280517578125, 0.01904296875, 0.004241943359375, -0.0015106201171875, 0.00104522705078125, -0.006072998046875, 0.000553131103515625, -0.0216064453125, 0.0177001953125, -0.0211181640625, 0.00836181640625, -0...

[ 438, 110527, 100, 68996, 919, 20251, 360, 18, 187, 72219, 1295, 4527, 111, 3768, 153, 123309, 28966, 52895, 1556, 142508, 5120, 1950, 99225, 2460, 929, 242, 25632, 1528, 134598, 12765, 36766, 107730, 653, 99017, 390, 10554, 153939, 23, 9969...

[ 0.1282958984375, 0.265869140625, 0.051239013671875, 0.1875, 0.10107421875, 0.250732421875, 0.14404296875, 0.18994140625, 0.064453125, 0.09283447265625, 0.0765380859375, 0.1300048828125, 0.041107177734375, 0.120849609375, 0.1065673828125, 0.1490478515625, 0.103515625, 0.156616210937...

embed

63292732_c0

63292732

haskell

0

Title: How to call a function in haskell? Problem title: How to call a function in haskell? Tags: haskell, shuffle, program-entry-point, io, random Problem: How to call a function in haskell? I have a code that creates a list and then shuffle it. But i cannot execute because a problem with the = in the main = do sectio...

How to call a function in haskell? How to call a function in haskell? haskell shuffle program-entry-point io random System.IO System.Random How list-1 Enter How to call a function in haskell? I have a code that creates a list and then shuffle it. But i cannot execute because a problem with the = in the main = do sectio...

[ -0.0186767578125, 0.02294921875, 0.012451171875, 0.01043701171875, -0.004791259765625, 0.0098876953125, 0.0107421875, -0.0157470703125, -0.019287109375, -0.0242919921875, 0.003814697265625, -0.005462646484375, -0.0157470703125, 0.0152587890625, 0.01092529296875, -0.00482177734375, 0....

[ 11249, 47, 11782, 10, 32354, 23, 1556, 142508, 170052, 1528, 33, 15123, 38496, 22995, 96759, 12353, 17780, 126525, 3815, 5303, 5759, 60816, 18151, 28282, 442, 4966, 53418, 71924, 2967, 70, 2203, 5201, 54, 40059, 18499, 2500, 184, 98, 107730...

[ 0.06842041015625, 0.0838623046875, 0.2286376953125, 0.07855224609375, 0.258056640625, 0.0902099609375, 0.16650390625, 0.2440185546875, 0.2353515625, 0.1258544921875, 0.06488037109375, 0.1026611328125, 0.1309814453125, 0.1796875, 0.148681640625, 0.09197998046875, 0.1490478515625, 0....

embed

13110730_c0

13110730

haskell

0

Title: List operations Problem title: List operations Tags: haskell Problem: List operations I have a function cc declared as following (1st parameter is a (list) and 2nd parameter is b (list as well), it should return 3rd list: cc :: [(String, String)] -> [(String, String)] -> [(String, String)] cc a b = do Example: a...

List operations List operations haskell List List operations I have a function cc declared as following (1st parameter is a (list) and 2nd parameter is b (list as well), it should return 3rd list: Example: c is composition of a and b where each a pairs second "index" is b pairs first "index". So a ("aaa", "xxx") pair's...

[ -0.006011962890625, 0.01483154296875, 0.01318359375, 0.0137939453125, 0.0030059814453125, 0.0009918212890625, -0.00665283203125, 0.00616455078125, 0.0186767578125, 0.004180908203125, 0.0026092529296875, -0.0201416015625, 0.01043701171875, 0.01202392578125, -0.011474609375, -0.020385742...

[ 32036, 41018, 1556, 142508, 32354, 10060, 159978, 25632, 271, 171859, 10, 6562, 116, 2208, 876, 5608, 30646, 138, 4216, 5303, 89536, 501, 83, 166577, 111, 136, 80836, 17932, 4711, 5117, 84022, 43883, 61924, 238, 28282, 11, 4028, 3525, 47, ...

[ 0.17822265625, 0.1788330078125, 0.1361083984375, 0.270751953125, 0.1630859375, 0.19140625, 0.142578125, 0.055999755859375, 0.053497314453125, 0.1805419921875, 0.052032470703125, 0.1787109375, 0.034454345703125, 0.040374755859375, 0.095458984375, 0.03790283203125, 0.172607421875, 0....

embed

2104446_c0

2104446

haskell

0

Title: How do you use Control.Applicative to write cleaner Haskell? Problem title: How do you use Control.Applicative to write cleaner Haskell? Tags: haskell, coding-style Problem: How do you use Control.Applicative to write cleaner Haskell? In a recent answer to a style question , I wrote main = untilM (isCorrect 42) ...

How do you use Control.Applicative to write cleaner Haskell? How do you use Control.Applicative to write cleaner Haskell? haskell coding-style How Control.Applicative Haskell You Win How do you use Control.Applicative to write cleaner Haskell? In a recent answer to a style question , I wrote and Martijn helpfully sugge...

[ -0.0240478515625, 0.00830078125, 0.006011962890625, 0.01129150390625, 0.018798828125, 0.007293701171875, 0.0211181640625, -0.005950927734375, 0.01177978515625, -0.0184326171875, 0.01409912109375, -0.01043701171875, 0.0087890625, 0.02001953125, 0.0006103515625, -0.0162353515625, 0.018...

[ 11249, 4527, 27131, 5, 39179, 11048, 4935, 33022, 46622, 56, 20625, 142508, 1556, 552, 40946, 2583, 17686, 20623, 25536, 98893, 42459, 30700, 39210, 103510, 18151, 7228, 34735, 164789, 91736, 17368, 191984 ]

[ 0.05419921875, 0.1112060546875, 0.253173828125, 0.046295166015625, 0.148193359375, 0.1878662109375, 0.1934814453125, 0.1414794921875, 0.2322998046875, 0.142578125, 0.1483154296875, 0.23046875, 0.09283447265625, 0.07305908203125, 0.1085205078125, 0.0226287841796875, 0.1217041015625, ...

embed

42601831_c0

42601831

haskell

0

Title: Looping over a map in haskell Problem title: Looping over a map in haskell Tags: loops, dictionary, haskell Problem: Looping over a map in haskell import Data.Foldable (for_) import Data.Map (Map,toList) m :: Map String String m = [("a","1"),("b","2")] main = for_ (toList m) $ \(q,a) -> do putStrLn q x <- getLin...

Looping over a map in haskell Looping over a map in haskell loops dictionary haskell Data.Foldable Data.Map Looping for_ Map Yes foo.hs:5:5 Couldn Char Failed Looping over a map in haskell I get the error:- Thanks for your help. I was interested in the for_i solution , but I cannot load Control.Lens

[ 0.0030975341796875, -0.00634765625, -0.004302978515625, -0.003631591796875, -0.0113525390625, -0.0113525390625, 0.0206298828125, 0.0089111328125, 0.00799560546875, -0.02734375, 0.01373291015625, -0.005218505859375, 0.009521484375, 0.00927734375, 0.00201416015625, -0.0035858154296875, ...

[ 199694, 214, 645, 22288, 23, 1556, 142508, 40956, 45, 10763, 11809, 18345, 2886, 166179, 100, 42719, 32635, 5775, 31, 127, 7, 758, 191147, 19, 21656, 190355, 297, 18499, 4358, 60892, 14, 29806, 4, 53418, 72367, 27131, 866, 1755 ]

[ 0.203857421875, 0.07965087890625, 0.170654296875, 0.2027587890625, 0.047576904296875, 0.1614990234375, 0.2222900390625, 0.1922607421875, 0.009796142578125, 0.05712890625, 0.097412109375, 0.0853271484375, 0.1038818359375, 0.171142578125, 0.1103515625, 0.17626953125, 0.06292724609375, ...

embed

42691533_c0

42691533

haskell

0

Title: How to use different ghc builds with stack? Problem title: How to use different ghc builds with stack? Tags: haskell-stack, ghc, haskell Problem: How to use different ghc builds with stack? I would like to have different, non-ABI-compatible, builds of the same version of GHC, and use them in different projects. ...

How to use different ghc builds with stack? How to use different ghc builds with stack? haskell-stack ghc haskell How stack-setup-2.yaml stack.yaml How to use different ghc builds with stack? I would like to have different, non-ABI-compatible, builds of the same version of GHC, and use them in different projects. (In m...

[ -0.018798828125, 0.001983642578125, -0.0031585693359375, 0.0037689208984375, -0.01324462890625, -0.0004863739013671875, -0.02880859375, 0.006439208984375, 0.0172119140625, 0.037109375, 0.01275634765625, -0.0133056640625, 0.007659912109375, -0.0003490447998046875, -0.00148773193359375, ...

[ 11249, 47, 4527, 12921, 31380, 238, 45367, 7, 678, 177261, 1556, 142508, 590, 2594, 3509, 2037, 5428, 14520, 141, 1884, 351, 107837, 277, 10974, 5701, 11389, 527, 73265, 77635, 60212, 17721, 892, 1505, 191560, 20209, 706, 2676, 581, 3642, ...

[ 0.098876953125, 0.04852294921875, 0.170654296875, 0.2177734375, 0.1514892578125, 0.151611328125, 0.224365234375, 0.0716552734375, 0.1260986328125, 0.230224609375, 0.0994873046875, 0.18798828125, 0.1064453125, 0.0828857421875, 0.114013671875, 0.088134765625, 0.0987548828125, 0.14331...

embed

44544214_c0

44544214

haskell

0

Title: finite recursive "List" type Problem title: finite recursive "List" type Tags: list, infinite, haskell Problem: finite recursive "List" type It is easy to reconstruct the list type in Haskell: data MyList a = Cons a (MyList a) | Empty deriving (Show) someList = Cons 1 (Cons 2 (Cons 3 Empty)) ...

finite recursive "List" type finite recursive "List" type list infinite haskell List MyList Cons Empty Show finite recursive "List" type It is easy to reconstruct the list type in Haskell: This allows for constructing infinites lists. Is it possible to somehow define a list type, that only allows fo...

[ -0.004638671875, 0.0118408203125, -0.0050048828125, 0.00885009765625, -0.0021209716796875, 0.005615234375, 0.000499725341796875, 0.01397705078125, -0.000545501708984375, -0.01165771484375, 0.00494384765625, -0.03271484375, 0.004638671875, 0.016845703125, 0.015380859375, 0.017333984375,...

[ 94418, 13, 195625, 5844, 154663, 10644, 5303, 54241, 1556, 142508, 32036, 2646, 39215, 31678, 939, 17367, 23468, 44188, 36716, 23, 20625, 114864, 64549, 90, 7722, 209303, 61924, 4734, 8789, 7464, 61799, 140909, 7, 27781, 3688, 831, 91995, 71,...

[ 0.1866455078125, 0.06884765625, 0.1888427734375, 0.0926513671875, 0.202392578125, 0.2060546875, 0.208251953125, 0.153076171875, 0.1129150390625, 0.2418212890625, 0.1422119140625, 0.083251953125, 0.146728515625, 0.118408203125, 0.000946044921875, 0.0377197265625, 0.0718994140625, 0....

embed

47048646_c0

47048646

haskell

0

Title: Haskell: looping over user input gracefully Problem title: Haskell: looping over user input gracefully Tags: haskell, monads, loops Problem: Haskell: looping over user input gracefully This is an example from Learn You a Haskell : main = do putStrLn "hello, what's your name?" name <- getLine putStrLn ("Hey, " ++...

Haskell: looping over user input gracefully Haskell: looping over user input gracefully haskell monads loops Haskell Learn You Hey mapM_ Haskell: looping over user input gracefully This is an example from Learn You a Haskell : The same redone without do for clarity: How am I supposed to loop it cleanly (until "q"), the...

[ -0.0147705078125, 0.0022125244140625, 0.01123046875, 0.01422119140625, -0.0004558563232421875, 0.0107421875, 0.03076171875, 0.0000209808349609375, 0.012939453125, -0.057861328125, 0.005096435546875, -0.00762939453125, -0.010498046875, 0.00872802734375, -0.006439208984375, 0.00546264648...

[ 20625, 142508, 40956, 214, 645, 38937, 107730, 4224, 329, 126351, 1556, 2667, 712, 134031, 2583, 28240, 22288, 594, 27781, 5701, 41313, 86, 15490, 54, 17306, 2481, 11249, 134598, 442, 46622, 3675, 864, 3917, 4032, 111, 20947, 3168, 3017, 15...

[ 0.1380615234375, 0.2310791015625, 0.1951904296875, 0.026885986328125, 0.2008056640625, 0.15478515625, 0.212646484375, 0.07342529296875, 0.0533447265625, 0.0748291015625, 0.0975341796875, 0.038360595703125, 0.07244873046875, 0.103271484375, 0.059356689453125, 0.0797119140625, 0.092407...

embed

66158250_c0

66158250

haskell

0

Title: Is there a function that makes a unique combinations from a list of lists? Haskell Problem title: Is there a function that makes a unique combinations from a list of lists? Haskell Tags: haskell Problem: Is there a function that makes a unique combinations from a list of lists? Haskell I was wondering if there i...

Is there a function that makes a unique combinations from a list of lists? Haskell Is there a function that makes a unique combinations from a list of lists? Haskell haskell a Haskell Input Output x:xs Is there a function that makes a unique combinations from a list of lists? Haskell I was wondering if there is a funct...

[ -0.0034942626953125, 0.041015625, -0.0021514892578125, -0.00341796875, -0.0198974609375, 0.0181884765625, -0.01495361328125, -0.0181884765625, 0.0189208984375, -0.002899169921875, -0.0125732421875, 0.00341796875, 0.039794921875, 0.03759765625, -0.016357421875, 0.001800537109375, 0.01...

[ 2071, 2685, 10, 32354, 450, 30482, 36998, 162515, 7, 1295, 5303, 111, 20625, 142508, 1556, 360, 7077, 13538, 1022, 12, 425, 149016, 14602, 903, 110, 29479, 3525, 47, 37842, 959, 41206 ]

[ 0.023162841796875, 0.0634765625, 0.0587158203125, 0.2369384765625, 0.046417236328125, 0.159912109375, 0.265625, 0.2890625, 0.1805419921875, 0.1519775390625, 0.2425537109375, 0.071533203125, 0.139892578125, 0.228515625, 0.1195068359375, 0.06890869140625, 0.04583740234375, 0.11230468...

embed

69698522_c0

69698522

haskell

0

Title: Couldn't match type ‘Integer’ with ‘Int’ Problem title: Couldn't match type ‘Integer’ with ‘Int’ Tags: haskell Problem: Couldn't match type ‘Integer’ with ‘Int’ I'm starting my journey into Haskell and running into my first issue: In my Haskell script: myList = [1, 2, 3, 4, 5, 6, 7] average ns = sum ns...

Couldn't match type ‘Integer’ with ‘Int’ Couldn't match type ‘Integer’ with ‘Int’ haskell Couldn Integer Couldn't match type ‘Integer’ with ‘Int’ I'm starting my journey into Haskell and running into my first issue: In my Haskell script: when i'm in the ghci repl , i get two different results: if i type > ave...

[ -0.0218505859375, -0.005889892578125, 0.0203857421875, 0.001556396484375, -0.0096435546875, 0.00738525390625, -0.00122833251953125, 0.0067138671875, 0.002838134765625, -0.0174560546875, 0.0269775390625, -0.03173828125, 0.0164794921875, -0.00396728515625, 0.00384521484375, -0.0101928710...

[ 191147, 19, 3768, 18, 14858, 10644, 4153, 67, 1505, 678, 1556, 142508, 44401, 120696, 20625, 51042, 5117, 31089, 26499, 23, 31380, 318, 2424, 6626, 12921, 50339, 83080, 116, 138, 201, 84751, 34292, 9790, 759, 154663, 18499, 10625, 52366, 28...

[ 0.1016845703125, 0.006439208984375, 0.0501708984375, 0.1480712890625, 0.2020263671875, 0.2122802734375, 0.1068115234375, 0.1826171875, 0.1778564453125, 0.08856201171875, 0.137451171875, 0.216552734375, 0.215576171875, 0.0184326171875, 0.1302490234375, 0.01055908203125, 0.021377563476...

embed

55133331_c0

55133331

haskell

0

Title: How to store value of function call to a variable Problem title: How to store value of function call to a variable Tags: haskell Problem: How to store value of function call to a variable I have this function where I need to check if the gdc of the numbers [1..n] and n is == 1 and do some calculations then. So I...

How to store value of function call to a variable How to store value of function call to a variable haskell first How Integer n-1 How to store value of function call to a variable I have this function where I need to check if the gdc of the numbers [1..n] and n is == 1 and do some calculations then. So I am stuck becau...

[ -0.0189208984375, -0.002288818359375, -0.0004444122314453125, 0.01190185546875, 0.007598876953125, 0.00482177734375, 0.0010833740234375, 0.0003147125244140625, 0.004608154296875, -0.0279541015625, 0.01708984375, -0.0037841796875, 0.00860595703125, -0.0026092529296875, 0.0191650390625, ...

[ 11249, 47, 4343, 34292, 111, 32354, 11782, 77336, 10, 1556, 142508, 5117, 44401, 653, 5759, 3871, 12765, 2174, 706, 71, 238, 70, 101935, 19, 69112, 106, 74481, 179933, 831, 7413, 3917, 61475, 678, 14012, 361, 6863, 195625, 1830, 24209, 30...

[ 0.0989990234375, 0.185302734375, 0.2208251953125, 0.2332763671875, 0.111572265625, 0.2379150390625, 0.2318115234375, 0.296875, 0.0275421142578125, 0.1414794921875, 0.2371826171875, 0.10205078125, 0.1676025390625, 0.1217041015625, 0.1654052734375, 0.001800537109375, 0.137451171875, ...

embed

55880423_c0

55880423

haskell

0

Title: Free Monad for AST > 1-arity? Problem title: Free Monad for AST > 1-arity? Tags: category-theory, haskell, compiler-construction Problem: Free Monad for AST > 1-arity? When I'm saying 1-arity | 2-arity | n-arity , I'm referring to tree in grap theory k-ary tree : a k-ary tree is a rooted tree in which each...

Free Monad for AST > 1-arity? Free Monad for AST > 1-arity? category-theory haskell compiler-construction Free Monad AST Toy Output Bell Done Free Monad for AST > 1-arity? When I'm saying 1-arity | 2-arity | n-arity , I'm referring to tree in grap theory k-ary tree : I have been using Free Monad in my project to ...

[ 0.00323486328125, 0.00201416015625, -0.00579833984375, 0.00799560546875, -0.002288818359375, 0.0008697509765625, -0.0201416015625, -0.00445556640625, -0.01153564453125, -0.0250244140625, 0.0186767578125, -0.0299072265625, 0.0030364990234375, 0.02197265625, -0.0145263671875, -0.01086425...

[ 5153, 60331, 71, 100, 48963, 5386, 4317, 147, 2481, 95487, 2347, 30675, 1556, 142508, 9969, 34759, 238478, 109451, 13538, 33500, 984, 977, 54433, 4720, 653, 53201, 4224, 254, 154453, 472, 6635, 13452, 28282, 19336, 28, 114479, 27781, 93232, ...

[ 0.2049560546875, 0.2269287109375, 0.2108154296875, 0.064208984375, 0.188720703125, 0.1258544921875, 0.1243896484375, 0.162841796875, 0.1788330078125, 0.108154296875, 0.0472412109375, 0.010345458984375, 0.09814453125, 0.212890625, 0.06878662109375, 0.043487548828125, 0.02783203125, ...

embed

61021188_c0

61021188

haskell

0

Title: Converting rational number to string Problem title: Converting rational number to string Tags: rational-number, haskell Problem: Converting rational number to string I have the following requirements: given a rational number (x % y): If y != 1 => return "x y" Otherwise: return "x" The following function works: i...

Converting rational number to string Converting rational number to string rational-number haskell Data.Ratio Converting my_show Integral Show Ratio Converting rational number to string I have the following requirements: given a rational number (x % y): If y != 1 => return "x y" Otherwise: return "x" The following funct...

[ -0.0238037109375, -0.0126953125, -0.0004329681396484375, -0.004791259765625, 0.00518798828125, 0.003814697265625, 0.0208740234375, 0.0023040771484375, 0.0009918212890625, 0.0103759765625, 0.01214599609375, 0.003692626953125, 0.0030364990234375, -0.00171661376953125, -0.0069580078125, 0...

[ 1657, 814, 1916, 168487, 14012, 47, 79315, 2606, 1297, 1556, 142508, 11809, 1052, 28645, 759, 31374, 204681, 17367, 2552, 5565, 25632, 96679, 34475, 1745, 113, 4263, 711, 106, 44357, 30646, 425, 90825, 32354, 43240, 442, 7722, 1286, 27650, ...

[ 0.044189453125, 0.1302490234375, 0.0278778076171875, 0.2474365234375, 0.1746826171875, 0.1041259765625, 0.263427734375, 0.1197509765625, 0.0341796875, 0.0885009765625, 0.1781005859375, 0.0694580078125, 0.0880126953125, 0.16015625, 0.0841064453125, 0.14794921875, 0.134521484375, 0.1...

embed

24233238_c0

24233238

haskell

0

Title: Comparing Elements at the same Index in two lists Problem title: Comparing Elements at the same Index in two lists Tags: haskell Problem: Comparing Elements at the same Index in two lists My problem is the following: I have one function that returns a specific list, lets say we have: Func = [1,14,12,19,17] Now I...

Comparing Elements at the same Index in two lists Comparing Elements at the same Index in two lists haskell Comparing Elements Index Func List Comparing Elements at the same Index in two lists My problem is the following: I have one function that returns a specific list, lets say we have: Func = [1,14,12,19,17] Now I h...

[ 0.0000762939453125, 0.00176239013671875, -0.0032958984375, -0.004119873046875, -0.00933837890625, 0.0147705078125, 0.0196533203125, -0.002777099609375, 0.0125732421875, -0.0076904296875, 0.005035400390625, -0.004638671875, 0.004119873046875, 0.0220947265625, -0.01336669921875, -0.00466...

[ 113307, 214, 48325, 99, 5701, 31471, 23, 6626, 5303, 1556, 142508, 28670, 32036, 2967, 70, 1632, 32354, 30646, 29458, 238, 2592, 1530, 2947, 2489, 15700, 1662, 2681, 3444, 7413, 1810, 2174, 5117, 12830, 105950, 47, 17932, 65395, 19, 27781, ...

[ 0.2001953125, 0.055816650390625, 0.2098388671875, 0.03082275390625, 0.1236572265625, 0.24365234375, 0.041656494140625, 0.1671142578125, 0.20458984375, 0.135498046875, 0.2149658203125, 0.1431884765625, 0.1595458984375, 0.1055908203125, 0.012359619140625, 0.0181121826171875, 0.16479492...

embed

64981503_c0

64981503

haskell

0

Title: Getting a type mismatch error with the Haskell zipWith function Problem title: Getting a type mismatch error with the Haskell zipWith function Tags: types, algebraic-data-types, custom-data-type, type-mismatch, haskell Problem: Getting a type mismatch error with the Haskell zipWith function I am new to Haskell. ...

Getting a type mismatch error with the Haskell zipWith function Getting a type mismatch error with the Haskell zipWith function types algebraic-data-types custom-data-type type-mismatch haskell Getting Haskell Neuron Double Read Show Getting a type mismatch error with the Haskell zipWith function I am new to Haskell. I...

[ -0.0019378662109375, 0.0147705078125, -0.00738525390625, 0.0244140625, -0.0167236328125, 0.0189208984375, -0.00958251953125, 0.00106048583984375, 0.00421142578125, -0.03515625, -0.00101470947265625, -0.010986328125, -0.006103515625, -0.0142822265625, -0.01055908203125, -0.00537109375, ...

[ 210732, 10644, 1239, 98753, 18499, 20625, 142508, 68330, 194583, 32354, 678, 52895, 2844, 10135, 50986, 114122, 2179, 1556, 107481, 19, 107172, 4764, 17367, 3525, 2053, 10002, 5303, 142424, 31577, 10554, 12638, 12830, 157272, 3789, 9969, 1340, ...

[ 0.00274658203125, 0.2041015625, 0.1163330078125, 0.2481689453125, 0.1771240234375, 0.1138916015625, 0.18994140625, 0.191650390625, 0.257080078125, 0.107666015625, 0.0284576416015625, 0.134765625, 0.001251220703125, 0.01348876953125, 0.1221923828125, 0.0648193359375, 0.0657958984375, ...

embed

30961498_c0

30961498

haskell

0

Title: LLVM compilation not working with Haskell on Yosemite Problem title: LLVM compilation not working with Haskell on Yosemite Tags: llvm, haskell, ghc Problem: LLVM compilation not working with Haskell on Yosemite I'm trying to use llvm with haskell and I'm getting the error "illegal hardware instruction" Details: ...

LLVM compilation not working with Haskell on Yosemite LLVM compilation not working with Haskell on Yosemite llvm haskell ghc LLVM Haskell Yosemite Main Hello World firstProgram.hs LLVM compilation not working with Haskell on Yosemite I'm trying to use llvm with haskell and I'm getting the error "illegal hardware instru...

[ -0.01470947265625, -0.01007080078125, -0.004119873046875, 0.0091552734375, 0.00020313262939453125, 0.00872802734375, -0.0042724609375, -0.019287109375, -0.029052734375, -0.0390625, -0.0020599365234375, -0.025390625, 0.01708984375, -0.00372314453125, 0.01470947265625, -0.003768920898437...

[ 99954, 47599, 98352, 959, 20697, 678, 20625, 142508, 98, 6949, 184, 35093, 96, 3723, 39, 1556, 31380, 238, 12321, 35378, 6661, 5117, 148968, 127, 31577, 4527, 18499, 2186, 2870, 76407, 188336, 9969, 49725, 8781, 33600, 31, 8999, 1528, 3034,...

[ 0.1658935546875, 0.2900390625, 0.20654296875, 0.055328369140625, 0.1336669921875, 0.1456298828125, 0.1541748046875, 0.25537109375, 0.06097412109375, 0.159912109375, 0.1142578125, 0.2047119140625, 0.055908203125, 0.1844482421875, 0.1822509765625, 0.1304931640625, 0.1058349609375, 0....

embed

58281577_c0

58281577

haskell

0

Title: State with IO in Haskell for CLI application Problem title: State with IO in Haskell for CLI application Tags: haskell, immutability, state Problem: State with IO in Haskell for CLI application I am trying to write a simple implementation of the game Hangman in Haskell and one problem I have is keeping the state...

State with IO in Haskell for CLI application State with IO in Haskell for CLI application haskell immutability state State Haskell CLI Char StateT State with IO in Haskell for CLI application I am trying to write a simple implementation of the game Hangman in Haskell and one problem I have is keeping the state of the g...

[ -0.01123046875, -0.00958251953125, -0.00848388671875, 0.0191650390625, -0.0021209716796875, 0.0177001953125, 0.01043701171875, -0.01300048828125, 0.006134033203125, -0.0103759765625, 0.01953125, -0.006011962890625, -0.0015106201171875, 0.0250244140625, -0.0216064453125, 0.0036163330078...

[ 22836, 678, 17780, 23, 20625, 142508, 100, 313, 10927, 38415, 1556, 566, 14311, 41159, 11341, 21656, 618, 31577, 33022, 10, 8781, 208124, 6712, 43454, 669, 2967, 120260, 111, 112892, 164789, 11389, 33342, 9655, 37202, 831, 26366, 35166, 11249...

[ 0.2076416015625, 0.14306640625, 0.2147216796875, 0.07476806640625, 0.157470703125, 0.243896484375, 0.0626220703125, 0.0273590087890625, 0.1552734375, 0.1114501953125, 0.13671875, 0.0291595458984375, 0.1566162109375, 0.05401611328125, 0.2318115234375, 0.1605224609375, 0.126220703125, ...

embed

10576868_c0

10576868

haskell

0

Title: How can I uninstall a version of a Cabal package? Problem title: How can I uninstall a version of a Cabal package? Tags: ghc, haskell, cabal Problem: How can I uninstall a version of a Cabal package? Happstack Lite is breaking on me because it's getting blaze-html version 0.5 and it wants version 0.4. Cabal says...

How can I uninstall a version of a Cabal package? How can I uninstall a version of a Cabal package? ghc haskell cabal How Cabal How can I uninstall a version of a Cabal package? Happstack Lite is breaking on me because it's getting blaze-html version 0.5 and it wants version 0.4. Cabal says that both versions 0.4.3.4 a...

[ 0.01043701171875, 0.0113525390625, 0.029541015625, 0.0198974609375, -0.016845703125, -0.0128173828125, -0.0140380859375, 0.01104736328125, -0.0031890869140625, 0.030029296875, -0.0167236328125, -0.0299072265625, -0.007659912109375, -0.000873565673828125, -0.01409912109375, -0.005615234...

[ 11249, 831, 51, 80383, 11389, 30438, 289, 98169, 31380, 238, 1556, 142508, 109524, 111, 208612, 590, 2594, 52687, 116987, 98, 163, 20949, 9932, 731, 7693, 81730, 86171, 121254, 15044, 172508, 99929, 20600, 3444, 87388, 4527, 114210, 959, 7510...

[ 0.055511474609375, 0.06500244140625, 0.153076171875, 0.2452392578125, 0.220703125, 0.2021484375, 0.19287109375, 0.197509765625, 0.1290283203125, 0.13525390625, 0.0989990234375, 0.2025146484375, 0.2452392578125, 0.00390625, 0.1668701171875, 0.1221923828125, 0.139404296875, 0.1910400...

embed

41030290_c1

41030290

haskell

1

second <- peekC case (first, msecond) of (0x1b, Just 0x5b) -> do dropWhileC (not . Word8.isLetter) dropC 1 _ -> yield first toWord8 = concatC toByteString :: Monad m => ConduitM Word8 ByteString m () toByteString = (mapC BS.singleton .| foldC) >>= yield This program is supposed to echo back the filtered contents of std...

[ 0.00604248046875, 0.000835418701171875, -0.0216064453125, 0.01373291015625, -0.01080322265625, 0.025146484375, 0.00604248046875, 0.005523681640625, 0.01708984375, 0.007171630859375, -0.01239013671875, 0.006927490234375, 0.00848388671875, 0.006378173828125, -0.01483154296875, -0.0016250...

[ 17932, 280, 343, 441, 7225, 347, 191633, 22085, 425, 275, 9563, 757, 758, 36069, 979, 133, 22543, 1019, 164, 5267, 3055, 106, 11180, 19388, 5117, 47, 164805, 158, 4460, 75358, 67, 71713, 60331, 71, 1657, 112061, 594, 3311, 62346, 1507, ...

[ 0.15576171875, 0.10302734375, 0.1224365234375, 0.09490966796875, 0.058074951171875, 0.0816650390625, 0.1795654296875, 0.000213623046875, 0.034423828125, 0.059478759765625, 0.073974609375, 0.03155517578125, 0.053466796875, 0.146728515625, 0.0806884765625, 0.045562744140625, 0.07165527...

embed

9786675_c0

9786675

haskell

0

Title: List of tuples to just list using map haskell Problem title: List of tuples to just list using map haskell Tags: haskell Problem: List of tuples to just list using map haskell I want to convert list of tuples: [(2,2,2), (3,3,3), (4,4,4), (5,5,5)] to just list: [2,2,2,3,3,3,4,4,4,5,5,5] I try this map (\(a,b,c,d)...

List of tuples to just list using map haskell List of tuples to just list using map haskell haskell map the List a:b:c:d Prelude a:b:c Num Possible List of tuples to just list using map haskell I want to convert list of tuples: [(2,2,2), (3,3,3), (4,4,4), (5,5,5)] to just list: [2,2,2,3,3,3,4,4,4,5,5,5] I try this but ...

[ -0.0020751953125, 0.0107421875, 0.01300048828125, 0.00946044921875, -0.0093994140625, 0.0125732421875, -0.006591796875, 0.013916015625, 0.00787353515625, -0.03271484375, -0.0033416748046875, -0.03369140625, 0.00390625, 0.0201416015625, -0.008544921875, -0.005035400390625, -0.00150299...

[ 32036, 111, 370, 99726, 47, 1660, 5303, 17368, 22288, 1556, 142508, 10, 12, 275, 238, 71, 1914, 822, 112, 52782, 115861, 2661, 3444, 96760, 378, 54753, 304, 10461, 6896, 363, 21320, 9451, 124093, 11516, 125592, 268, 155761, 80389, 9790, 1...

[ 0.19091796875, 0.06463623046875, 0.192138671875, 0.297607421875, 0.1011962890625, 0.1832275390625, 0.261474609375, 0.0919189453125, 0.245361328125, 0.1834716796875, 0.2467041015625, 0.04351806640625, 0.04962158203125, 0.047271728515625, 0.037994384765625, 0.10137939453125, 0.06268310...

embed

32531508_c0

32531508

haskell

0

Title: Haskell parse error from incorrect indent Problem title: Haskell parse error from incorrect indent Tags: haskell Problem: Haskell parse error from incorrect indent Can anyone explain why this is a syntax error? f = f' where f' = do if True then return () else return () main = f If I give more indentation to the ...

Haskell parse error from incorrect indent Haskell parse error from incorrect indent haskell incorrect Haskell Haskell parse error from incorrect indent Can anyone explain why this is a syntax error? If I give more indentation to the if block, then it somehow compiles well. Or I can just separate the where , which I'd n...

[ 0.004547119140625, 0.006988525390625, -0.0186767578125, 0.00537109375, -0.0101318359375, 0.01483154296875, -0.0235595703125, -0.003570556640625, 0.007415771484375, -0.0159912109375, 0.003631591796875, -0.009033203125, -0.00014209747314453125, 0.00250244140625, 0.016845703125, 0.0087890...

[ 20625, 142508, 366, 184, 18499, 1295, 214552, 18597, 18, 1556, 73342, 15400, 903, 6002, 86531, 8337, 1286, 22062, 2174, 46389, 209303, 9969, 1340, 5299, 84797, 7440, 3638, 187136, 13416, 68346, 100094, 4068, 363, 211032, 44084, 27781, 17932 ]

[ 0.1297607421875, 0.208984375, 0.166015625, 0.08837890625, 0.1708984375, 0.0867919921875, 0.2088623046875, 0.2017822265625, 0.138427734375, 0.15673828125, 0.08099365234375, 0.074462890625, 0.011260986328125, 0.046600341796875, 0.172607421875, 0.012786865234375, 0.07037353515625, 0.1...

embed

64408116_c0

64408116

haskell

0

Title: Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Problem title: Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Tags: macos, haskell, gtk3, user-interface Problem: Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Haskell-gi seems to be the most up-to-date...

Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Installing Haskell-gi on macOS Catalina and creating GUI in Haskell macos haskell gtk3 user-interface Installing Haskell-gi Catalina GUI Haskell gtk3 Installing Haskell-gi on macOS Catalina and creating GUI in Haskell Haskell-gi seems to be the most up...

[ -0.012451171875, 0.003448486328125, 0.01123046875, -0.008544921875, 0.002349853515625, 0.0079345703125, 0.009765625, -0.01953125, -0.00225830078125, -0.007720947265625, -0.0096435546875, -0.078125, -0.011474609375, -0.0166015625, -0.01373291015625, 0.000957489013671875, -0.0114135742...

[ 107951, 20625, 142508, 735, 19138, 7285, 128342, 885, 105233, 195490, 7840, 1556, 31472, 363, 38937, 10433, 2684, 17489, 527, 29735, 47, 128239, 35773, 143006, 6982, 19048, 20600, 442, 155965, 62270, 32102, 30700, 4727, 20697, 3773, 5809, 959, ...

[ 0.1405029296875, 0.1439208984375, 0.265380859375, 0.198486328125, 0.1192626953125, 0.1015625, 0.178955078125, 0.2056884765625, 0.088623046875, 0.2161865234375, 0.04248046875, 0.059967041015625, 0.1309814453125, 0.10614013671875, 0.010009765625, 0.010467529296875, 0.0193634033203125, ...

embed

73056166_c0

73056166

haskell

0

Title: Expand a NominalDiffTime by a factor Problem title: Expand a NominalDiffTime by a factor Tags: haskell Problem: Expand a NominalDiffTime by a factor Using the time library in Haskell, I have computed delta :: NominalDiffTime previously in my program, and I have a successFactor :: Double , successFactor = 2.8 . I...

Expand a NominalDiffTime by a factor Expand a NominalDiffTime by a factor haskell Expand NominalDiffTime Double Couldn time1.9.3:Data.Time.Clock.Internal.NominalDiffTime.NominalDiffTime Expand a NominalDiffTime by a factor Using the time library in Haskell, I have computed delta :: NominalDiffTime previously in my prog...

[ 0.0145263671875, 0.006622314453125, 0.0115966796875, 0.03759765625, 0.005950927734375, -0.0279541015625, -0.007415771484375, 0.020263671875, -0.01007080078125, -0.022705078125, 0.01019287109375, -0.016845703125, -0.01531982421875, -0.0220947265625, -0.0299072265625, -0.015869140625, ...

[ 60075, 2940, 438, 1249, 289, 397, 32920, 70059, 390, 31461, 10, 1556, 142508, 107172, 191147, 1733, 158304, 363, 12, 137989, 21135, 44851, 5021, 35773, 20625, 7077, 40703, 198395, 1528, 36272, 135518, 1290, 1984, 82295, 3444, 76, 9969, 6743, ...

[ 0.150634765625, 0.0859375, 0.108154296875, 0.185791015625, 0.06787109375, 0.08966064453125, 0.2220458984375, 0.2454833984375, 0.1126708984375, 0.242431640625, 0.013641357421875, 0.1334228515625, 0.243896484375, 0.176025390625, 0.1439208984375, 0.19189453125, 0.1348876953125, 0.0860...

embed

46373083_c0

46373083

haskell

0

Title: How to create a function that expects a Integral List Problem title: How to create a function that expects a Integral List Tags: haskell Problem: How to create a function that expects a Integral List So I'm learning Haskell for school and was learning about functions, syntax and typeclasses over at learnyouahask...

How to create a function that expects a Integral List How to create a function that expects a Integral List haskell How Integral List Num How to create a function that expects a Integral List So I'm learning Haskell for school and was learning about functions, syntax and typeclasses over at learnyouahaskell and was won...

[ -0.005218505859375, -0.0172119140625, -0.00173187255859375, 0.026611328125, -0.01287841796875, 0.0233154296875, -0.000560760498046875, -0.023681640625, -0.0026702880859375, -0.00872802734375, 0.0130615234375, -0.038330078125, 0.0024871826171875, 0.0048828125, -0.01043701171875, -0.0104...

[ 11249, 28282, 32354, 450, 41206, 7, 204681, 32036, 47, 10, 1556, 142508, 52782, 52080, 20625, 100, 10696, 10644, 67413, 30698, 53927, 149016, 51776, 23, 5303, 237, 171859, 100094, 15190, 26455, 18770, 6626, 5423, 756, 765, 111, 103332, 18507,...

[ 0.07415771484375, 0.194580078125, 0.209716796875, 0.0618896484375, 0.2470703125, 0.06732177734375, 0.25244140625, 0.25244140625, 0.0184783935546875, 0.022552490234375, 0.127197265625, 0.198974609375, 0.168701171875, 0.0267791748046875, 0.093994140625, 0.010406494140625, 0.07464599609...

embed

48239570_c0

48239570

haskell

0

Title: A type constructor IS a monad or HAS a monad? Problem title: A type constructor IS a monad or HAS a monad? Tags: category-theory, scala, language-agnostic, haskell, functional-programming Problem: A type constructor IS a monad or HAS a monad? People usually say a type IS a monad. In some functional languages and...

A type constructor IS a monad or HAS a monad? A type constructor IS a monad or HAS a monad? category-theory scala language-agnostic haskell functional-programming HAS A type constructor IS a monad or HAS a monad? People usually say a type IS a monad. In some functional languages and libraries (like Scala/Scalaz), you h...

[ -0.0006561279296875, -0.00836181640625, -0.007476806640625, 0.0201416015625, -0.00189208984375, -0.008544921875, -0.004241943359375, 0.002197265625, -0.0036163330078125, -0.032958984375, 0.0225830078125, -0.0341796875, 0.004730224609375, 0.007293701171875, -0.00653076171875, -0.0016021...

[ 10644, 64549, 748, 15744, 10, 2667, 712, 707, 101413, 62, 95487, 146232, 46876, 2895, 1556, 142508, 123309, 28966, 41021, 56104, 5154, 35773, 152653, 62309, 169, 765, 32036, 86769, 61924, 60331, 71, 208124, 84797, 7311, 69871, 5426, 105233, 1...

[ 0.284912109375, 0.1993408203125, 0.176513671875, 0.135009765625, 0.0655517578125, 0.1632080078125, 0.2078857421875, 0.022674560546875, 0.1566162109375, 0.046051025390625, 0.0892333984375, 0.1121826171875, 0.1195068359375, 0.057403564453125, 0.0513916015625, 0.1563720703125, 0.1446533...

embed

13106036_c0

13106036

haskell

0

Title: Link to static file in Yesod that doesn't have Haskell identifier Problem title: Link to static file in Yesod that doesn't have Haskell identifier Tags: haskell, yesod Problem: Link to static file in Yesod that doesn't have Haskell identifier Given a default Yesod scaffold, with file upload implemented...

Link to static file in Yesod that doesn't have Haskell identifier Link to static file in Yesod that doesn't have Haskell identifier haskell yesod Link Yesod Haskell Link to static file in Yesod that doesn't have Haskell identifier Given a default Yesod scaffold, with file upload implemented by moving the uplo...

[ -0.000698089599609375, 0.0196533203125, 0.016845703125, -0.0064697265625, -0.0211181640625, 0.0172119140625, -0.00982666015625, -0.00439453125, -0.007720947265625, -0.03857421875, -0.031982421875, -0.0213623046875, -0.011474609375, 0.0079345703125, 0.005157470703125, -0.01055908203125,...

[ 12779, 47, 201939, 11435, 32635, 2199, 22027, 3768, 18, 765, 20625, 142508, 42485, 56, 23, 1556, 2422, 23722, 114977, 9023, 2407, 42822, 70622, 29479, 98567, 3934, 14364, 3642, 54, 3126, 53, 3638, 102158, 174350, 5213, 13348, 139392, 87, 83...

[ 0.196044921875, 0.1815185546875, 0.26025390625, 0.1842041015625, 0.1788330078125, 0.2449951171875, 0.0780029296875, 0.03277587890625, 0.10028076171875, 0.049285888671875, 0.1397705078125, 0.2388916015625, 0.1842041015625, 0.07403564453125, 0.050567626953125, 0.1107177734375, 0.130859...

embed

25780555_c0

25780555

haskell

0

Title: Best way to generate a list with state (Haskell) Problem title: Best way to generate a list with state (Haskell) Tags: haskell, monad-transformers, state-monad, monads Problem: Best way to generate a list with state (Haskell) Let's say I want to generate a list of items, while keeping track of some state. For ex...

Best way to generate a list with state (Haskell) Best way to generate a list with state (Haskell) haskell monad-transformers state-monad monads Best Haskell State Best way to generate a list with state (Haskell) Let's say I want to generate a list of items, while keeping track of some state. For example, generate [1..]...

[ -0.01318359375, -0.000370025634765625, -0.00341796875, -0.018310546875, 0.00787353515625, -0.009033203125, -0.01904296875, -0.0166015625, 0.0074462890625, -0.036865234375, 0.010498046875, 0.01300048828125, -0.00848388671875, 0.01336669921875, -0.01165771484375, -0.01385498046875, -0....

[ 11345, 3917, 139392, 5303, 678, 11341, 6495, 7, 142508, 1556, 2667, 712, 215175, 1314, 3796, 20625, 22836, 10, 3444, 55769, 120260, 28560, 68252, 5, 2060, 96759, 101935, 627, 8066, 37202, 6626, 48322, 20594, 903, 4879, 155370, 60331, 6468, ...

[ 0.1055908203125, 0.06982421875, 0.2210693359375, 0.2435302734375, 0.12060546875, 0.23388671875, 0.08642578125, 0.049468994140625, 0.2440185546875, 0.0904541015625, 0.115478515625, 0.1292724609375, 0.179931640625, 0.0933837890625, 0.05975341796875, 0.10076904296875, 0.1907958984375, ...

embed

52488255_c0

52488255

haskell

0

Title: join for different monads in Haskell Problem title: join for different monads in Haskell Tags: monads, haskell Problem: join for different monads in Haskell I know I can use join to remove the first level of list join [["dog"]] " output ["dog"] But why the following is not working join $ (Just ["dog"]) got error...

join for different monads in Haskell join for different monads in Haskell monads haskell Haskell Just Couldn Maybe Monad join for different monads in Haskell I know I can use join to remove the first level of list join [["dog"]] " output ["dog"] But why the following is not working We know Maybe and [] are both Monad i...

[ -0.01397705078125, 0.005340576171875, 0.006805419921875, 0.01324462890625, 0.0087890625, 0.018310546875, -0.00531005859375, 0.01544189453125, 0.018798828125, -0.001678466796875, 0.0184326171875, -0.040283203125, 0.00665283203125, -0.0284423828125, -0.01470947265625, -0.005859375, -0....

[ 33284, 100, 12921, 2667, 712, 7, 23, 20625, 142508, 1556, 9563, 191147, 83425, 60331, 71, 3714, 831, 4527, 87388, 5117, 17366, 111, 5303, 38507, 140992, 15400, 25632, 959, 20697, 136, 15044, 83, 44691, 4734, 5701, 10644, 32354, 21373, 2499,...

[ 0.253662109375, 0.1318359375, 0.199951171875, 0.1302490234375, 0.1531982421875, 0.05072021484375, 0.051361083984375, 0.130615234375, 0.2578125, 0.09814453125, 0.0221710205078125, 0.1025390625, 0.26416015625, 0.1800537109375, 0.1390380859375, 0.0521240234375, 0.033843994140625, 0.02...

embed

21584744_c0

21584744

haskell

0

Title: How do I use a function depending on the type of an argument? Problem title: How do I use a function depending on the type of an argument? Tags: haskell, opengl Problem: How do I use a function depending on the type of an argument? I am using Haskell and OpenGL. OpenGL has a way to load variables using a set of ...

How do I use a function depending on the type of an argument? How do I use a function depending on the type of an argument? haskell opengl How glUniform1i glUniform1f glUniform2i intValue1 intValue2 How do I use a function depending on the type of an argument? I am using Haskell and OpenGL. OpenGL has a way to load var...

[ -0.00677490234375, 0.002960205078125, -0.005645751953125, -0.020751953125, 0.0013427734375, 0.0062255859375, -0.0189208984375, -0.000797271728515625, -0.00075531005859375, -0.0047607421875, -0.00732421875, -0.038818359375, 0.008056640625, -0.0286865234375, 0, -0.005401611328125, -0.0...

[ 11249, 54, 87, 4527, 32354, 8, 96819, 98, 10644, 111, 10750, 10, 142, 1556, 142508, 9803, 11016, 39575, 85600, 5037, 14, 420, 23, 18, 856, 50770, 418, 304, 17368, 20625, 136, 13527, 78703, 3917, 72367, 77336, 5423, 61514, 3900, 19309, 4...

[ 0.1102294921875, 0.044158935546875, 0.043731689453125, 0.16650390625, 0.25048828125, 0.1126708984375, 0.1981201171875, 0.090576171875, 0.1962890625, 0.0694580078125, 0.24609375, 0.07452392578125, 0.03424072265625, 0.07958984375, 0.202880859375, 0.08917236328125, 0.149658203125, 0.0...

embed

4340091_c0

4340091

haskell

0

Title: Iterating along 2 lists at the same time in haskell (without resorting to zip) Problem title: Iterating along 2 lists at the same time in haskell (without resorting to zip) Tags: functional-programming, haskell Problem: Iterating along 2 lists at the same time in haskell (without resorting to zip) I have 2 lists...

Iterating along 2 lists at the same time in haskell (without resorting to zip) Iterating along 2 lists at the same time in haskell (without resorting to zip) functional-programming haskell Iterating Iterating along 2 lists at the same time in haskell (without resorting to zip) I have 2 lists: and and I'd like to turn i...

[ -0.003082275390625, 0.0062255859375, -0.0128173828125, 0.0038299560546875, -0.004486083984375, 0.025146484375, -0.011474609375, -0.008544921875, 0.0185546875, -0.0478515625, 0.01019287109375, 0.001922607421875, 0.01904296875, 0.0107421875, -0.0101318359375, 0.011474609375, -0.0123291...

[ 87, 67, 98767, 33233, 116, 5303, 7, 5701, 1733, 1556, 142508, 6056, 70634, 68330, 23, 123309, 28966, 76228, 765, 1884, 15504, 3934, 75935, 32354, 14602, 1660, 450, 43240, 32316, 11522, 3917, 163846, 15490, 17368, 3444, 17, 8560, 831, 18, ...

[ 0.09228515625, 0.19677734375, 0.13134765625, 0.1993408203125, 0.174072265625, 0.2252197265625, 0.007354736328125, 0.117919921875, 0.08251953125, 0.134033203125, 0.21630859375, 0.065673828125, 0.08282470703125, 0.197998046875, 0.01812744140625, 0.1063232421875, 0.047821044921875, 0....

embed

69215371_c0

69215371

haskell

0

Title: How to "translate" in Haskell? Problem title: How to "translate" in Haskell? Tags: recursion, haskell Problem: How to "translate" in Haskell? I have been trying to beat this problem for some time. I have been given a "dictionary" with translations. The assignment is that i am going to use thi...

How to "translate" in Haskell? How to "translate" in Haskell? recursion haskell How Haskell x:xs y:ys How to "translate" in Haskell? I have been trying to beat this problem for some time. I have been given a "dictionary" with translations. The assignment is that i am going to use this dictionary for...

[ 0.0047607421875, 0.00799560546875, -0.00823974609375, -0.0017547607421875, 0.0074462890625, 0.00921630859375, -0.000881195068359375, -0.00537109375, 0.0101318359375, -0.007598876953125, 0.01202392578125, -0.0263671875, -0.00970458984375, 0.0037078857421875, -0.00159454345703125, 0.0042...

[ 11249, 47, 41502, 30145, 19309, 23, 20625, 142508, 195625, 1830, 1556, 1022, 12, 425, 7, 113, 4778, 31577, 42659, 2967, 34475, 428, 10763, 6635, 678, 153648, 95486, 4527, 45, 60042, 3900, 143, 1916, 34153, 27781, 21732, 1224, 2203, 549, 3...

[ 0.0904541015625, 0.07525634765625, 0.0494384765625, 0.199951171875, 0.2366943359375, 0.0748291015625, 0.1556396484375, 0.23876953125, 0.1737060546875, 0.064453125, 0.1474609375, 0.0557861328125, 0.06005859375, 0.065185546875, 0.04034423828125, 0.0628662109375, 0.1165771484375, 0.00...

embed

37927780_c0

37927780

haskell

0

Title: errors when I try to return a list Problem title: errors when I try to return a list Tags: compiler-errors, roguelike, haskell Problem: errors when I try to return a list Now I improved the code a bit, cut something off it, etc. Here is the source code: import Prelude {-- DEFINE THE TYPES --} data Tile = Tile --...

errors when I try to return a list errors when I try to return a list compiler-errors roguelike haskell Prelude DEFINE TYPES Tile Char Bool Dungeon MAIN test.log SIZE MAP FUNCTIONS main.hs:42:26 Couldn Expected Actual errors when I try to return a list Now I improved the code a bit, cut something off it, etc. Here is t...

[ 0.0036468505859375, 0.0101318359375, -0.00750732421875, 0.02197265625, -0.005767822265625, 0.00469970703125, -0.0167236328125, -0.0252685546875, -0.01092529296875, 0.0091552734375, 0.00167083740234375, -0.0159912109375, 0.010498046875, 0.01312255859375, -0.00150299072265625, 0.01733398...

[ 18499, 9790, 30646, 5303, 9969, 34759, 188800, 2062, 6261, 5062, 1556, 142508, 1914, 822, 112, 202001, 94588, 5064, 21656, 2460, 929, 125669, 13, 191, 3034, 4867, 19157, 105748, 136258, 5201, 127, 28194, 191147, 60075, 100582, 10, 52295, 1815...

[ 0.196044921875, 0.14599609375, 0.2252197265625, 0.2130126953125, 0.137939453125, 0.08648681640625, 0.13330078125, 0.052642822265625, 0.135498046875, 0.1561279296875, 0.0732421875, 0.183349609375, 0.029266357421875, 0.115478515625, 0.0521240234375, 0.0307159423828125, 0.064453125, 0...

embed

29277874_c0

29277874

haskell

0

Title: How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] Problem title: How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] Tags: haskell Problem: How to define a list ...

How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] How to define a list which evaluates to the sequence [(0,0), (1,0), (2,0), (3,0), etc.] and [(0,0), (0,1), (0,2), (0,3), etc.] haskell How How to define a list which evaluates to the sequence [...

[ 0.0174560546875, 0.0257568359375, -0.025390625, 0.0106201171875, 0, -0.0002231597900390625, -0.0107421875, 0.008056640625, 0.01239013671875, -0.0128173828125, -0.00518798828125, -0.0103759765625, 0.00665283203125, 0.0238037109375, -0.02197265625, 0.01239013671875, 0.0069580078125, ...

[ 11249, 47, 61924, 5303, 3129, 151575, 90, 40, 944, 3956, 63527, 206808, 216969, 128188, 22085, 17727, 10461, 21320, 10, 136, 1556, 142508, 9842, 1679, 20625, 149016, 3642, 831, 6626, 1632, 3789, 48716, 1927, 11907, 28412, 1810, 5117, 22027, ...

[ 0.1051025390625, 0.20263671875, 0.281982421875, 0.291748046875, 0.07501220703125, 0.2274169921875, 0.1021728515625, 0.09765625, 0.1640625, 0.09478759765625, 0.23681640625, 0.1878662109375, 0.2061767578125, 0.2069091796875, 0.0660400390625, 0.053680419921875, 0.064208984375, 0.12927...

embed

59129935_c0

59129935

haskell

0

Title: List instance of semigroup mappeding respective pairs of elements Problem title: List instance of semigroup mappeding respective pairs of elements Tags: haskell, list, semigroup Problem: List instance of semigroup mappeding respective pairs of elements I am looking for most common Haskell library that introduces...

List instance of semigroup mappeding respective pairs of elements List instance of semigroup mappeding respective pairs of elements haskell list semigroup List Semigroup SList foldl1 List instance of semigroup mappeding respective pairs of elements I am looking for most common Haskell library that introduces [a] wrappe...

[ -0.01165771484375, 0.01409912109375, -0.0037078857421875, 0.005157470703125, -0.0286865234375, 0.0225830078125, -0.0177001953125, -0.0023956298828125, 0.021240234375, -0.00115203857421875, 0.004638671875, 0.0286865234375, 0.0028228759765625, 0.010498046875, -0.0164794921875, 0.01031494...

[ 32036, 110527, 36137, 51588, 291, 48398, 214, 107013, 80836, 80854, 1556, 142508, 5303, 84420, 159, 154663, 18344, 20469, 418, 16487, 2684, 39210, 20625, 35773, 1294, 65508, 11, 137565, 1264, 34648, 101426, 102329, 9858, 3305, 47, 21373, 3917, ...

[ 0.1904296875, 0.2320556640625, 0.229248046875, 0.268798828125, 0.1627197265625, 0.138427734375, 0.00823974609375, 0.153564453125, 0.1917724609375, 0.1715087890625, 0.1141357421875, 0.213134765625, 0.1353759765625, 0.231201171875, 0.10638427734375, 0.27099609375, 0.0743408203125, 0....

embed

59556478_c0

59556478

haskell

0

Title: Prefix or infix: which is idiomatic in Haskell? Problem title: Prefix or infix: which is idiomatic in Haskell? Tags: infix-operator, prefix-operator, haskell Problem: Prefix or infix: which is idiomatic in Haskell? I am new to Haskell and do not know which is idiomatic - using operators in prefix form or infix f...

Prefix or infix: which is idiomatic in Haskell? Prefix or infix: which is idiomatic in Haskell? infix-operator prefix-operator haskell Prefix Haskell Prefix or infix: which is idiomatic in Haskell? I am new to Haskell and do not know which is idiomatic - using operators in prefix form or infix form. From what I've noti...

[ 0.01373291015625, -0.0224609375, 0.0244140625, -0.006378173828125, 0.001190185546875, -0.0017852783203125, -0.004974365234375, 0.004241943359375, -0.001922607421875, -0.0262451171875, 0.007781982421875, -0.0216064453125, 0.01123046875, -0.0174560546875, -0.0120849609375, 0.004211425781...

[ 1914, 55923, 707, 23, 3129, 49666, 9523, 20625, 142508, 83, 206469, 183114, 1556, 3525, 47, 959, 3714, 17368, 39933, 3173, 32354, 678, 5361, 124850, 123055, 4369, 1639, 6396, 3021, 11814, 124901, 7228, 1257, 229231, 57767, 191722, 1295, 14036...

[ 0.129638671875, 0.2362060546875, 0.04705810546875, 0.1356201171875, 0.0433349609375, 0.21826171875, 0.1534423828125, 0.14013671875, 0.25, 0.040679931640625, 0.20654296875, 0.262939453125, 0.1246337890625, 0.03057861328125, 0.010498046875, 0.015045166015625, 0.04766845703125, 0.0596...

embed

27127316_c0

27127316

haskell

0

Title: Haskell - Implementing First Order Logic Expressions Problem title: Haskell - Implementing First Order Logic Expressions Tags: first-order-logic, ghci, haskell Problem: Haskell - Implementing First Order Logic Expressions I am trying to implement FOL using Haskell. First order logic can be in the form of proposi...

Haskell - Implementing First Order Logic Expressions Haskell - Implementing First Order Logic Expressions first-order-logic ghci haskell Haskell Implementing First Order Logic Expressions Prop Not Impl Equiv ForAll Exists Ord Multiple Haskell - Implementing First Order Logic Expressions I am trying to implement FOL usi...

[ 0.0220947265625, -0.01141357421875, -0.00179290771484375, 0.017822265625, -0.01220703125, -0.00177764892578125, 0.000782012939453125, -0.017578125, 0.00048065185546875, -0.0155029296875, -0.00909423828125, -0.01708984375, 0.006439208984375, -0.015380859375, 0.0054931640625, 0.024902343...

[ 20625, 142508, 153941, 23972, 81206, 50592, 25129, 5117, 80596, 137043, 31380, 318, 1556, 43796, 11205, 29128, 141, 145666, 334, 1326, 43512, 5443, 64370, 35379, 19335, 8705, 17514, 31577, 29479, 172155, 17368, 12989, 62775, 831, 3173, 89261, 1...

[ 0.1505126953125, 0.2685546875, 0.1473388671875, 0.118896484375, 0.1793212890625, 0.1607666015625, 0.13232421875, 0.09619140625, 0.2093505859375, 0.1676025390625, 0.081787109375, 0.097412109375, 0.1529541015625, 0.19970703125, 0.1368408203125, 0.123291015625, 0.07110595703125, 0.103...

embed

27927115_c1

27927115

haskell

1

that citation and recursively parse through the rest of the list until I've checked everything. Step 3: Make a helper function to convert the string representation of the citation number into an Int (possibly, unwords ) since I have to replace the citation with its corresponding element in the given list. Step 4: Then...

[ -0.0169677734375, -0.00408935546875, 0.0172119140625, 0.021484375, -0.021728515625, 0.01153564453125, -0.005340576171875, 0.00994873046875, 0.0260009765625, 0.008544921875, -0.00750732421875, -0.00897216796875, -0.00665283203125, -0.00592041015625, 0.0123291015625, -0.0081787109375, ...

[ 450, 15869, 1363, 195625, 366, 184, 5303, 12765, 297, 26818, 4358, 56, 32354, 96760, 79315, 18811, 14012, 360, 18, 51, 47416, 91995, 70, 678, 42518, 12830, 23, 50478, 27959, 456, 7, 15504, 150011, 4420, 3934, 88902, 15005, 71713, 214, 233...

[ 0.052215576171875, 0.2049560546875, 0.0751953125, 0.0273895263671875, 0.097412109375, 0.064208984375, 0.18798828125, 0.0877685546875, 0.001434326171875, 0.0528564453125, 0.092041015625, 0.041778564453125, 0.072509765625, 0.0948486328125, 0.2158203125, 0.148193359375, 0.0623779296875,...

embed

74811030_c0

74811030

haskell

0

Title: Algebraic data type list into an actual list Problem title: Algebraic data type list into an actual list Tags: algebraic-data-types, haskell, list Problem: Algebraic data type list into an actual list I am tying to create a function where I enter an Algebraic data type list, and it should output an actual list. ...

Algebraic data type list into an actual list Algebraic data type list into an actual list algebraic-data-types haskell list Algebraic list1 Cons Empty Elements Show List Algebraic data type list into an actual list I am tying to create a function where I enter an Algebraic data type list, and it should output an actual...

[ 0.002227783203125, 0.008056640625, -0.0004425048828125, 0.0245361328125, -0.005279541015625, 0.03076171875, -0.035888671875, -0.0067138671875, 0.004608154296875, -0.010986328125, 0.002349853515625, -0.0262451171875, 0.01226806640625, 0.0289306640625, -0.0003108978271484375, 0.013549804...

[ 884, 429, 2844, 1771, 2053, 10644, 5303, 3934, 142, 8561, 144, 10135, 50986, 1556, 142508, 418, 39215, 31678, 939, 48325, 17367, 32036, 2281, 214, 28282, 32354, 30957, 140992, 765, 436, 11935, 7, 724, 13538, 7077, 5608, 683, 75935, 25632, ...

[ 0.02874755859375, 0.0787353515625, 0.134033203125, 0.0411376953125, 0.1328125, 0.202880859375, 0.19775390625, 0.1396484375, 0.045257568359375, 0.16748046875, 0.03546142578125, 0.1058349609375, 0.1796875, 0.099365234375, 0.1971435546875, 0.013275146484375, 0.15185546875, 0.123046875...

embed

46426228_c0

46426228

haskell

0

Title: Automatic Dependency Management with stack such as `stack add <module>` Problem title: Automatic Dependency Management with stack such as `stack add <module>` Tags: haskell, npm-install, yarnpkg, haskell-stack, cabal Problem: Automatic Dependency Management with stack such as `stack add ` it there a ...

Automatic Dependency Management with stack such as `stack add <module>` Automatic Dependency Management with stack such as `stack add <module>` haskell npm-install yarnpkg haskell-stack cabal Automatic Dependency Management Automatic Dependency Management with stack such as `stack add ` it there a command t...

[ 0.0004482269287109375, 0.0220947265625, 0.00592041015625, 0.0159912109375, 0.001953125, 0.0174560546875, -0.005523681640625, 0.01300048828125, -0.01007080078125, -0.0093994140625, 0.01422119140625, -0.0086669921875, -0.0076904296875, 0.029296875, -0.0029144287109375, -0.00787353515625,...

[ 51719, 262, 26885, 27771, 25924, 678, 177261, 590, 2594, 15190, 83279, 1556, 142508, 25037, 39, 80383, 38933, 83018, 8517, 109524, 442, 2685, 75101, 14192, 47, 42548, 23, 11435, 5351, 142267, 19, 20600, 108999, 120, 5670, 23009, 3525, 88996, ...

[ 0.15087890625, 0.07958984375, 0.175537109375, 0.1304931640625, 0.15869140625, 0.047149658203125, 0.243408203125, 0.11083984375, 0.1131591796875, 0.152587890625, 0.1549072265625, 0.0673828125, 0.1978759765625, 0.1307373046875, 0.15478515625, 0.10595703125, 0.1260986328125, 0.0258483...

embed

65123956_c0

65123956

haskell

0

Title: How `fix f = let {x = f x} in x` is evaluated? Problem title: How `fix f = let {x = f x} in x` is evaluated? Tags: evaluation, fixpoint-combinators, lazy-evaluation, haskell Problem: How `fix f = let {x = f x} in x` is evaluated? fix f = let {x = f x} in x Talking about let , I thought that let P = Q in R would ...

How `fix f = let {x = f x} in x` is evaluated? How `fix f = let {x = f x} in x` is evaluated? evaluation fixpoint-combinators lazy-evaluation haskell How How `fix f = let {x = f x} in x` is evaluated? fix f = let {x = f x} in x Talking about let , I thought that let P = Q in R would evaluate Q -> Q' then P is replaced ...

[ 0.0023956298828125, 0.00634765625, 0.01312255859375, 0.0033416748046875, 0.0189208984375, -0.01611328125, 0.0035552978515625, -0.01251220703125, -0.0029296875, 0.005035400390625, 0.00139617919921875, 0.0213623046875, -0.005340576171875, 0.002593994140625, 0.0284423828125, -0.0236816406...

[ 11249, 55923, 1238, 2203, 2633, 425, 1022, 23, 151575, 297, 219836, 30022, 38496, 19155, 22230, 21, 3285, 159258, 1556, 142508, 17569, 436, 2396, 627, 13, 33079, 91995, 25, 80934, 56566, 3642, 28987, 24209, 3678, 31635, 10336, 43701, 990, 2...

[ 0.0467529296875, 0.30712890625, 0.200927734375, 0.0921630859375, 0.18798828125, 0.0924072265625, 0.09515380859375, 0.1373291015625, 0.2186279296875, 0.0718994140625, 0.1617431640625, 0.2462158203125, 0.1195068359375, 0.10675048828125, 0.048309326171875, 0.040771484375, 0.101745605468...

embed

5947340_c0

5947340

haskell

0

Title: Overriding (==) in Haskell Problem title: Overriding (==) in Haskell Tags: types, typeclass, haskell, algebraic-data-types Problem: Overriding (==) in Haskell I have the following algebraic data types: data Exp = Con Int | Var String | Op Opkind Exp Exp | Input deriving (Show,Eq) data Opkind = Plus | Minus | Mul...

Overriding (==) in Haskell Overriding (==) in Haskell types typeclass haskell algebraic-data-types Overriding Haskell Exp Con Opkind Input Show Plus Minus Mult Div More Equal Overriding (==) in Haskell I have the following algebraic data types: That represent expressions in a simple toy language. However, because I der...

[ 0.00994873046875, 0.01458740234375, 0.00396728515625, 0.0341796875, 0.023681640625, -0.002349853515625, -0.000713348388671875, -0.0079345703125, 0.006866455078125, 0.01214599609375, 0.002197265625, -0.006439208984375, 0.0250244140625, 0.006011962890625, -0.0224609375, 0.001106262207031...

[ 9578, 416, 6238, 69112, 20625, 142508, 23, 52895, 10644, 67413, 1556, 429, 2844, 10135, 50986, 60075, 1657, 2331, 68347, 360, 17367, 8183, 24169, 81212, 53026, 5455, 71723, 25632, 2053, 33636, 125195, 8781, 72713, 46876, 122, 5844, 864, 81827...

[ 0.114990234375, 0.1923828125, 0.05792236328125, 0.278564453125, 0.1531982421875, 0.24951171875, 0.01702880859375, 0.1885986328125, 0.1024169921875, 0.1353759765625, 0.13671875, 0.02569580078125, 0.039947509765625, 0.0447998046875, 0.138427734375, 0.1068115234375, 0.141357421875, 0....

embed

36489313_c0

36489313

haskell

0

Title: How to model the output of the binary lambda calculus? Problem title: How to model the output of the binary lambda calculus? Tags: interpreter, haskell, lambda-calculus, programming-languages Problem: How to model the output of the binary lambda calculus? I am trying to write an interpreter for John Tromp's bina...

How to model the output of the binary lambda calculus? How to model the output of the binary lambda calculus? interpreter haskell lambda-calculus programming-languages How How to model the output of the binary lambda calculus? I am trying to write an interpreter for John Tromp's binary lambda calculus I have written co...

[ 0.01116943359375, 0.0001068115234375, 0.006683349609375, 0.0159912109375, -0.00457763671875, 0.0208740234375, 0.0035552978515625, -0.01019287109375, -0.01153564453125, -0.0115966796875, -0.0196533203125, -0.0130615234375, -0.0030059814453125, -0.00311279296875, 0.006561279296875, 0.010...

[ 11249, 47, 3299, 140992, 2394, 6635, 21, 6492, 85, 44805, 223, 70, 111, 29481, 56, 1556, 142508, 6827, 94739, 196651, 33022, 4939, 8302, 2676, 18151, 2392, 107730, 3934, 2053, 45646, 33636, 20324, 51, 50986, 48941, 107, 106357, 13579, 96276...

[ 0.0826416015625, 0.0806884765625, 0.2279052734375, 0.2481689453125, 0.1573486328125, 0.1414794921875, 0.05316162109375, 0.1737060546875, 0.1295166015625, 0.1859130859375, 0.145751953125, 0.0286865234375, 0.026092529296875, 0.1619873046875, 0.0841064453125, 0.041046142578125, 0.201293...

embed

36736504_c0

36736504

haskell

0

Title: Rendering CDATA with Haskell XHT Library Problem title: Rendering CDATA with Haskell XHT Library Tags: haskell, hxt, xml Problem: Rendering CDATA with Haskell XHT Library How can I make HXT library to output CDATA? For example running test in this snippet will result in <?xml version="1.0" encoding="UTF-8"?> <te...

Rendering CDATA with Haskell XHT Library Rendering CDATA with Haskell XHT Library haskell hxt xml Text.XML.HXT.Core Rendering CDATA Haskell XHT Library UTF-8 ArrowXml XmlTree somefile.xml HXT Rendering CDATA with Haskell XHT Library How can I make HXT library to output CDATA? For example running test in this snippet wi...

[ 0.005126953125, 0.00041961669921875, 0.01251220703125, 0.005279541015625, 0.0262451171875, -0.006988525390625, 0.0028533935546875, -0.01190185546875, -0.01141357421875, 0.000331878662109375, -0.025146484375, -0.0279541015625, -0.0084228515625, -0.00799560546875, 0.006744384765625, 0.00...

[ 63137, 4209, 7915, 17758, 678, 20625, 142508, 1193, 18544, 103835, 1556, 1096, 29062, 131492, 24129, 39456, 841, 70981, 50886, 30992, 17376, 15555, 7237, 62731, 3060, 29822, 572, 3249, 35773, 1294, 140992, 51042, 3034, 93, 58134, 16750, 4966, ...

[ 0.1263427734375, 0.0268402099609375, 0.1326904296875, 0.2030029296875, 0.0587158203125, 0.11376953125, 0.199462890625, 0.0670166015625, 0.210205078125, 0.1849365234375, 0.073974609375, 0.0223236083984375, 0.1846923828125, 0.1611328125, 0.0672607421875, 0.0772705078125, 0.021163940429...

embed

7372120_c0

7372120

haskell

0

Title: Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? Problem title: Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? Tags: haskell Problem: Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? I'm trying to better understand the effect/mean...

Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? haskell Is `\x -> ⊥ x` equal (under `seq`) to `⊥`, `\x -> ⊥` or nothing at all? I'm trying to better understand the effect/meaning of seq on -> -typed values, or ra...

[ 0.01611328125, -0.00244140625, -0.0019989013671875, 0.01171875, -0.01519775390625, -0.00092315673828125, 0.007171630859375, 0.005615234375, 0.0024261474609375, 0.01953125, -0.0157470703125, 0.00958251953125, -0.0013427734375, -0.00787353515625, -0.0093994140625, -0.01019287109375, -0...

[ 425, 20, 1230, 5386, 247699, 1022, 105950, 24658, 184, 864, 33720, 756, 47, 1556, 142508, 2071, 41872, 33079, 707, 21543, 37440, 40, 50986, 142424, 601, 841, 73493, 26950, 27494, 20625, 34798, 61924, 237, 13416, 80934, 1238, 5608, 6002, 18,...

[ 0.1229248046875, 0.069091796875, 0.0650634765625, 0.1634521484375, 0.254638671875, 0.121337890625, 0.17236328125, 0.10614013671875, 0.109130859375, 0.2193603515625, 0.1385498046875, 0.0986328125, 0.00579833984375, 0.051788330078125, 0.1832275390625, 0.00750732421875, 0.00494384765625...

embed

45287954_c0

45287954

haskell

0

Title: Is having a `(a -> b) -> b` equivalent to having an `a`? Problem title: Is having a `(a -> b) -> b` equivalent to having an `a`? Tags: functional-programming, haskell, purely-functional Problem: Is having a `(a -> b) -> b` equivalent to having an `a`? In a pure functional language, the only thing you...

Is having a `(a -> b) -> b` equivalent to having an `a`? Is having a `(a -> b) -> b` equivalent to having an `a`? functional-programming haskell purely-functional Is having a `(a -> b) -> b` equivalent to having an `a`? In a pure functional language, the only thing you can do with a value is apply a functio...

[ 0.01116943359375, 0.01422119140625, 0.006256103515625, -0.00118255615234375, -0.006683349609375, 0.0174560546875, 0.005218505859375, -0.018798828125, 0.006744384765625, -0.0155029296875, -0.00665283203125, 0.03369140625, -0.014892578125, -0.00872802734375, 0.0067138671875, -0.019287109...

[ 2071, 19441, 10, 11, 20, 1230, 5386, 876, 183234, 47, 142, 123309, 28966, 1556, 142508, 34166, 137175, 289, 9473, 33079, 46876, 4734, 13580, 831, 54, 678, 34292, 59911, 32354, 442, 49041, 10644, 1238, 1984, 44540, 21392, 202319, 91995, 1178...

[ 0.038116455078125, 0.114501953125, 0.0933837890625, 0.162841796875, 0.0697021484375, 0.0726318359375, 0.1600341796875, 0.2003173828125, 0.16650390625, 0.0584716796875, 0.0276947021484375, 0.19970703125, 0.07720947265625, 0.10382080078125, 0.2261962890625, 0.1021728515625, 0.0859375, ...

embed

32615426_c0

32615426

haskell

0

Title: Checking function in Haskell Problem title: Checking function in Haskell Tags: haskell Problem: Checking function in Haskell I'm working on some CS homework and this is my first experience with Haskell, so I have a question. I've declared a data type data Date = Date Int Int Int deriving (Show) and I have this f...

Checking function in Haskell Checking function in Haskell haskell Checking Haskell Date Show Maybe Just Nothing Checking function in Haskell I'm working on some CS homework and this is my first experience with Haskell, so I have a question. I've declared a data type and I have this function testdate: I want to make a n...

[ -0.007293701171875, -0.007415771484375, 0.0089111328125, 0.024658203125, 0.00994873046875, 0.020263671875, -0.0050048828125, -0.000020623207092285156, -0.00830078125, 0.031982421875, -0.0026397705078125, -0.00799560546875, 0.0031280517578125, -0.004547119140625, -0.0133056640625, 0.009...

[ 38679, 214, 32354, 20625, 142508, 23, 1556, 25512, 17367, 83425, 9563, 182747, 25841, 16981, 159978, 2053, 10644, 3034, 17489, 3444, 3249, 3525, 12765, 1957, 2174, 29568, 707, 98320, 30646, 5622, 2806, 54, 903 ]

[ 0.207275390625, 0.0185089111328125, 0.1798095703125, 0.128662109375, 0.2193603515625, 0.014068603515625, 0.117431640625, 0.1787109375, 0.1524658203125, 0.1058349609375, 0.04705810546875, 0.135986328125, 0.00396728515625, 0.021453857421875, 0.0880126953125, 0.056396484375, 0.123535156...

embed

55938210_c1

55938210

haskell

1

, Tree 4), (2, Tree 6)] -- 4 instead of 5 => cycle | otherwise = [(1, Tree $ 2 * n + 1), (2, Tree $ 2 * n + 2)] isGoal (Tree n) = n == 13 Which generates the children. Well,the problem is that the function above still visits nodes even if they are in the visited set and I don't understand why. So,for example, starting ...

[ 0.00445556640625, 0.0157470703125, -0.003936767578125, -0.004486083984375, 0.0074462890625, 0.0203857421875, -0.0291748046875, -0.0191650390625, 0.01202392578125, -0.060791015625, -0.00311279296875, -0.0032501220703125, -0.006591796875, 0.017333984375, 0.0040283203125, 0.010009765625, ...

[ 101344, 13956, 4700, 35914, 4210, 201, 64457, 190, 105823, 120262, 3650, 116, 997, 4879, 4958, 83, 17903, 289, 62731, 13, 653, 69112, 702, 139392, 70, 20020, 2967, 32354, 36917, 7464, 19922, 7, 110, 988, 3853, 2174, 36997, 5423, 136, 18, ...

[ 0.28271484375, 0.2154541015625, 0.07177734375, 0.1697998046875, 0.01605224609375, 0.2088623046875, 0.1092529296875, 0.1224365234375, 0.2607421875, 0.0743408203125, 0.006103515625, 0.10260009765625, 0.1180419921875, 0.0096435546875, 0.0207672119140625, 0.120361328125, 0.1885986328125,...

embed

33703195_c0

33703195

haskell

0

Title: Why is prepending to a list instantaneous? Problem title: Why is prepending to a list instantaneous? Tags: haskell Problem: Why is prepending to a list instantaneous? I am going through an Haskell tutorial about lists, and it claims: Watch out when repeatedly using the ++ operator on long strings ... Haskell has...

Why is prepending to a list instantaneous? Why is prepending to a list instantaneous? haskell Why Why is prepending to a list instantaneous? I am going through an Haskell tutorial about lists, and it claims: But, in my mind, things should be the other way around. : has to go through all elements in the list because it ...

[ 0.00531005859375, 0.0033721923828125, 0.01312255859375, 0.00174713134765625, -0.005889892578125, -0.0012054443359375, 0.01141357421875, -0.0024566650390625, 0.022705078125, -0.00909423828125, 0.0147705078125, -0.035400390625, 0.006683349609375, 0.01519775390625, -0.0162353515625, -0.00...

[ 44084, 83, 479, 96819, 47, 5303, 34648, 6130, 10821, 1556, 142508, 20625, 57143, 140526, 7086, 8966, 5608, 3789, 3917, 10932, 738, 8305, 756, 80854, 6637, 27117, 122925, 136044, 37223, 831, 114689, 3525, 12830, 3564, 16940, 100094, 63805 ]

[ 0.1407470703125, 0.07275390625, 0.1912841796875, 0.302001953125, 0.1519775390625, 0.2127685546875, 0.137939453125, 0.156005859375, 0.139404296875, 0.0904541015625, 0.2105712890625, 0.0814208984375, 0.0572509765625, 0.00579833984375, 0.04888916015625, 0.00762939453125, 0.0345458984375...

embed

35069169_c0

35069169

haskell

0

Title: Make Haskell List Recursion function more efficient Problem title: Make Haskell List Recursion function more efficient Tags: list, haskell, boolean, pattern-matching, recursion Problem: Make Haskell List Recursion function more efficient I've written a function that will compare two lists and check to see if the...

Make Haskell List Recursion function more efficient Make Haskell List Recursion function more efficient list haskell boolean pattern-matching recursion Make Haskell List Recursion Bool x:xs y:ys Make Haskell List Recursion function more efficient I've written a function that will compare two lists and check to see if t...

[ -0.016845703125, 0.01214599609375, 0.0242919921875, -0.000675201416015625, 0.0023956298828125, -0.00469970703125, -0.0172119140625, 0.0081787109375, 0.00860595703125, 0.01470947265625, 0.0184326171875, -0.01275634765625, 0.0126953125, -0.002166748046875, -0.000949859619140625, 0.010314...

[ 26176, 20625, 142508, 32036, 165428, 42, 6889, 32354, 1286, 93766, 5303, 1556, 337, 31, 34677, 103510, 98753, 214, 195625, 2460, 929, 1022, 12, 425, 113, 4778, 59121, 69101, 6626, 12765, 1957, 2174, 5117, 83, 183114, 111, 17932, 8110, 16940...

[ 0.09521484375, 0.1240234375, 0.22509765625, 0.196533203125, 0.1422119140625, 0.168701171875, 0.1199951171875, 0.162109375, 0.1314697265625, 0.2352294921875, 0.183349609375, 0.103759765625, 0.001556396484375, 0.04058837890625, 0.1312255859375, 0.1619873046875, 0.1676025390625, 0.024...

embed

53088261_c0

53088261

haskell

0

Title: Tree or not (Haskell type understanding) Problem title: Tree or not (Haskell type understanding) Tags: binary-tree, graph-theory, haskell, types Problem: Tree or not (Haskell type understanding) In "A Gentle Introduction to Haskell" we have such declaration of Tree's type: data Tree a = Leaf a | Branch (Tree a) ...

Tree or not (Haskell type understanding) Tree or not (Haskell type understanding) binary-tree graph-theory haskell types Tree Haskell Leaf Branch Ord Show Read Main Integer Tree or not (Haskell type understanding) In "A Gentle Introduction to Haskell" we have such declaration of Tree's type: Let's to make some values o...

[ 0.0113525390625, 0.0185546875, -0.00799560546875, 0.016845703125, 0.0223388671875, 0.0130615234375, -0.029541015625, -0.022216796875, -0.006072998046875, -0.0255126953125, -0.01904296875, -0.023193359375, 0.003143310546875, 0.003143310546875, 0.0042724609375, 0.0220947265625, 0.02185...

[ 101344, 707, 959, 6495, 7, 142508, 10644, 100094, 2394, 6635, 62600, 41382, 1556, 52895, 20625, 2407, 21110, 35379, 17367, 4764, 12321, 44401, 44704, 21635, 142424, 31380, 318, 10, 910, 83, 756, 8622, 105823, 903, 44691, 80934, 26785, 121742,...

[ 0.304443359375, 0.088623046875, 0.1207275390625, 0.0748291015625, 0.05926513671875, 0.220703125, 0.2159423828125, 0.1236572265625, 0.08270263671875, 0.04949951171875, 0.212646484375, 0.1500244140625, 0.087646484375, 0.1202392578125, 0.0987548828125, 0.061981201171875, 0.0222930908203...

embed

19025621_c0

19025621

haskell

0

Title: Reorder a list based on example list Problem title: Reorder a list based on example list Tags: list, haskell Problem: Reorder a list based on example list I would like to know how to reorder a list of lists based on an example list. Here is an example to clarify my question: ["Foo", "Bar", "Something"] That is e...

Reorder a list based on example list Reorder a list based on example list list haskell Reorder Foo Bar Something Reorder a list based on example list I would like to know how to reorder a list of lists based on an example list. Here is an example to clarify my question: That is example list, now I want to reorder the l...

[ 0.004119873046875, 0.01190185546875, -0.0137939453125, 0.01446533203125, -0.00640869140625, 0.011962890625, 0.003448486328125, 0.003326416015625, 0.006988525390625, 0.027099609375, 0.002777099609375, -0.0023193359375, -0.003753662109375, 0.0213623046875, -0.01055908203125, -0.011657714...

[ 853, 80596, 5303, 35509, 98, 27781, 1556, 142508, 9572, 31, 3253, 200905, 1884, 3714, 3642, 47, 456, 111, 7, 17306, 3444, 127887, 35064, 16487, 4734, 10336, 12638, 46132, 291, 26783, 202317, 32354, 6626, 80854, 4488, 184017 ]

[ 0.1275634765625, 0.2802734375, 0.229736328125, 0.1407470703125, 0.0635986328125, 0.2548828125, 0.10040283203125, 0.1944580078125, 0.1173095703125, 0.055816650390625, 0.1488037109375, 0.0292816162109375, 0.0253448486328125, 0.03277587890625, 0.03656005859375, 0.045562744140625, 0.1333...

embed

75568232_c0

75568232

haskell

0

Title: Elegant way to apply curried function to indexed traversal Problem title: Elegant way to apply curried function to indexed traversal Tags: haskell, haskell-lens Problem: Elegant way to apply curried function to indexed traversal I want to compose a curried function f :: i -> a -> b With an indexed traversal l ::...

Elegant way to apply curried function to indexed traversal Elegant way to apply curried function to indexed traversal haskell haskell-lens Elegant IndexedTraversal IndexedGetting Endo Elegant way to apply curried function to indexed traversal I want to compose a curried function With an indexed traversal apply it to an...

[ -0.00469970703125, 0.00750732421875, 0.0120849609375, -0.008056640625, -0.00689697265625, -0.0130615234375, 0.00023365020751953125, 0.0008697509765625, 0.0184326171875, -0.0625, 0.0128173828125, 0.00994873046875, -0.016357421875, 0.000640869140625, -0.006317138671875, -0.03076171875, ...

[ 161231, 3917, 59911, 9709, 46572, 32354, 47, 63262, 297, 37317, 289, 1556, 142508, 1977, 31471, 28542, 814, 2317, 10429, 19514, 357, 246, 3444, 150350, 17106, 142, 91, 136, 2046, 4420, 10, 275, 1257, 4966, 2806, 1884, 22321, 1290, 4627, 1...

[ 0.2490234375, 0.08740234375, 0.17041015625, 0.149169921875, 0.249267578125, 0.19287109375, 0.0821533203125, 0.200927734375, 0.10699462890625, 0.2135009765625, 0.136474609375, 0.11572265625, 0.2047119140625, 0.155517578125, 0.2000732421875, 0.089599609375, 0.1842041015625, 0.1110839...

embed

43884930_c0

43884930

haskell

0

Title: error parsing in haskell code Problem title: error parsing in haskell code Tags: recursion, haskell Problem: error parsing in haskell code My haskell code goes as follows : module Lain where let value = 0 divideBy ::(Ord a, Num a)=>a -> a -> a divideBy _ 0 = 0 divideBy num den | (num - den) >= 0 = do value = val...

error parsing in haskell code error parsing in haskell code recursion haskell Lain Ord Num Lain.hs:18:1 Failed error parsing in haskell code My haskell code goes as follows : The error goes on loading the haskell Lain.hs file is : app/Lain.hs:18:1: error: parse error (possibly incorrect indentation or mismatched bracke...

[ -0.00958251953125, 0.029052734375, -0.023193359375, -0.0030059814453125, 0.01141357421875, 0.005859375, 0.0054931640625, -0.021484375, 0.00244140625, -0.0390625, -0.0021209716796875, -0.0206298828125, 0.00494384765625, -0.015380859375, 0.01092529296875, 0.01092529296875, -0.008483886...

[ 18499, 366, 6953, 23, 1556, 142508, 18151, 195625, 1830, 239, 73, 35379, 52782, 127, 7, 24033, 19721, 190355, 60899, 28960, 98, 72367, 214, 5, 11435, 4027, 2729, 184, 7522, 214552, 18597, 22062, 1239, 98753, 1620, 27853, 88996, 351, 13, 1...

[ 0.226318359375, 0.1734619140625, 0.072998046875, 0.06805419921875, 0.1654052734375, 0.2230224609375, 0.1810302734375, 0.2098388671875, 0.0318603515625, 0.1312255859375, 0.1702880859375, 0.1610107421875, 0.1097412109375, 0.119384765625, 0.06201171875, 0.1617431640625, 0.1346435546875,...

embed

4646963_c0

4646963

haskell

0

Title: Importing haskell library on Mac OSX gives error Problem title: Importing haskell library on Mac OSX gives error Tags: haskell, compiler-errors Problem: Importing haskell library on Mac OSX gives error I've just installed GHC 6.6 on OSX 10.6 and importing fails, for example module Main where import IO gives the ...

Importing haskell library on Mac OSX gives error Importing haskell library on Mac OSX gives error haskell compiler-errors IO Importing Mac OSX Main Bad IO.hi ghc-6.6 GHC i386-apple-darwin interactiveUI:flush Importing haskell library on Mac OSX gives error I've just installed GHC 6.6 on OSX 10.6 and importing fails, fo...

[ 0.000751495361328125, 0.007568359375, -0.004974365234375, 0.007415771484375, 0.00360107421875, 0.014404296875, -0.0115966796875, -0.00677490234375, -0.02490234375, -0.0283203125, -0.0150146484375, -0.04541015625, 0.004150390625, -0.01031494140625, 0.0189208984375, -0.00750732421875, ...

[ 92966, 1556, 142508, 35773, 1294, 98, 4727, 11787, 1542, 76199, 18499, 9969, 34759, 188800, 17780, 12321, 12745, 979, 31380, 238, 156960, 527, 73265, 105742, 9007, 9494, 212398, 33457, 18026, 1495, 20600, 4068, 910, 24927, 35782, 27781, 831, ...

[ 0.2305908203125, 0.19140625, 0.2744140625, 0.1898193359375, 0.060791015625, 0.015594482421875, 0.1439208984375, 0.1434326171875, 0.13525390625, 0.05560302734375, 0.1893310546875, 0.128173828125, 0.1336669921875, 0.19140625, 0.1641845703125, 0.0826416015625, 0.15380859375, 0.1182861...

embed

8918990_c0

8918990

haskell

0

Title: Why is the type of this function (a -> a) -> a? Problem title: Why is the type of this function (a -> a) -> a? Tags: anonymous, haskell, y-combinator, types, recursion Problem: Why is the type of this function (a -> a) -> a? Why is the type of this function (a -> a) -> a? Prelude> let y f = f (y f) P...

Why is the type of this function (a -> a) -> a? Why is the type of this function (a -> a) -> a? anonymous haskell y-combinator types recursion Why Prelude WTFIsGoingOnOnTheRHS Why is the type of this function (a -> a) -> a? Why is the type of this function (a -> a) -> a? Shouldn't it be an infinite/recursiv...

[ 0.0179443359375, -0.0023193359375, 0.014404296875, 0.0123291015625, 0.02685546875, 0.0045166015625, 0.00640869140625, 0.00885009765625, -0.0185546875, -0.0263671875, -0.00335693359375, -0.001922607421875, -0.0189208984375, -0.0059814453125, 0.00836181640625, -0.00848388671875, 0.0109...

[ 44084, 83, 10644, 111, 903, 32354, 11, 20, 1230, 5386, 10, 52184, 10821, 1556, 142508, 113, 277, 19155, 1290, 52895, 195625, 1830, 1914, 822, 112, 601, 30992, 29598, 17903, 214, 20320, 3957, 1052, 38131, 70, 33079, 151117, 54241, 48650, 5...

[ 0.142822265625, 0.053375244140625, 0.1962890625, 0.0753173828125, 0.10467529296875, 0.177001953125, 0.1124267578125, 0.0367431640625, 0.037841796875, 0.1529541015625, 0.1612548828125, 0.10546875, 0.001007080078125, 0.090087890625, 0.2073974609375, 0.1197509765625, 0.0157623291015625,...

embed

5854122_c0

5854122

haskell

0

Title: How to terminate in a recursive function in Haskell? Problem title: How to terminate in a recursive function in Haskell? Tags: haskell, recursion, termination Problem: How to terminate in a recursive function in Haskell? I have a function that needs to terminate on a certain condition. So for example say we have...

How to terminate in a recursive function in Haskell? How to terminate in a recursive function in Haskell? haskell recursion termination How Haskell a:as func2 a:func a:func2 How to terminate in a recursive function in Haskell? I have a function that needs to terminate on a certain condition. So for example say we have ...

[ 0.0052490234375, 0.006744384765625, -0.006744384765625, -0.00164794921875, -0.00616455078125, 0.0179443359375, -0.005462646484375, 0.0167236328125, 0.00060272216796875, -0.0130615234375, 0.00445556640625, -0.01513671875, -0.00616455078125, 0.0123291015625, 0.01239013671875, -0.00064849...

[ 11249, 47, 121011, 13, 23, 195625, 5844, 32354, 20625, 142508, 1556, 1830, 29527, 10, 162, 7477, 304, 16498, 238, 27117, 98, 24233, 35431, 3444, 1632, 35839, 237, 3638, 217684, 2046, 40907, 34292, 4153, 18, 107730, 4734, 35142, 24491, 14242...

[ 0.09088134765625, 0.0689697265625, 0.247802734375, 0.19482421875, 0.092041015625, 0.228759765625, 0.16845703125, 0.2061767578125, 0.1385498046875, 0.24365234375, 0.1280517578125, 0.07147216796875, 0.2205810546875, 0.061187744140625, 0.075439453125, 0.1153564453125, 0.1378173828125, ...

embed

22772349_c1

22772349

haskell

1

1 yesod-1.2.5.2 depends on yesod-core-1.2.10 which failed to install. yesod-auth-1.3.0.2 depends on yesod-core-1.2.10 which failed to install. yesod-core-1.2.10 failed during the building phase. The exception was: ExitFailure 1 yesod-form-1.3.8.1 depends on yesod-core-1.2.10 which failed to install. yesod-persistent-1...

[ -0.024169921875, 0.01177978515625, 0.0038604736328125, 0.0091552734375, -0.009033203125, -0.00634765625, -0.012939453125, -0.017578125, -0.0091552734375, 0.03369140625, -0.00043487548828125, -0.042724609375, -0.0181884765625, 0.0048828125, 0.0035552978515625, -0.00518798828125, 0.005...

[ 2422, 23722, 48400, 158296, 56566, 30854, 963, 165523, 20600, 916, 927, 81046, 133684, 20271, 33976, 93402, 131527, 5443, 217, 17647, 379, 3408, 106, 5037, 206730, 21777, 6892, 5, 70147, 47, 2071, 148431, 23, 52922, 4588, 759, 36279, 28864, ...

[ 0.18701171875, 0.275146484375, 0.1573486328125, 0.2052001953125, 0.197021484375, 0.179931640625, 0.1802978515625, 0.18994140625, 0.1441650390625, 0.06292724609375, 0.07135009765625, 0.1033935546875, 0.1417236328125, 0.023101806640625, 0.0948486328125, 0.0792236328125, 0.1646728515625...

embed

29134349_c1

29134349

haskell

1

‘field1’: field1 = iso (\ (Foo x_a3NK) -> x_a3NK) Foo So I think it generated: field1 :: Lens' (Foo a) a I've also tried makeFields and makeClassy , to no avail. I know I could work around this with: field1 :: (Class1 a) => Lens' (Foo a) a field1 = lens _field1 (\ foo val -> Foo { _field1 = val }) But is there a way t...

[ 0.00115966796875, -0.00872802734375, -0.00946044921875, 0.00909423828125, 0.004150390625, 0.0086669921875, 0.00701904296875, -0.01007080078125, 0, -0.024169921875, -0.005645751953125, 0.0279541015625, -0.00909423828125, -0.0118408203125, 0.00634765625, -0.022216796875, 0.000379562377...

[ 28394, 418, 44457, 2203, 13882, 27591, 31, 1022, 11, 363, 25035, 9572, 5351, 139392, 1984, 18226, 7, 25, 10, 3249, 6159, 19388, 140803, 53, 110, 5809, 4488, 10932, 903, 44357, 3098, 5775, 3502, 3917, 54, 442, 866, 47754, 196631, 20625, ...

[ 0.2313232421875, 0.1611328125, 0.2420654296875, 0.039154052734375, 0.20166015625, 0.09588623046875, 0.1048583984375, 0.0347900390625, 0.008544921875, 0.0156707763671875, 0.1240234375, 0.130126953125, 0.04638671875, 0.1739501953125, 0.109619140625, 0.20166015625, 0.06036376953125, 0...

embed

70894897_c0

70894897

haskell

0

Title: Why am I getting a parse error for input "|" in Haskell for guards? Problem title: Why am I getting a parse error for input "|" in Haskell for guards? Tags: haskell, guard Problem: Why am I getting a parse error for input "|" in Haskell for guards? I'm writing a code to find the median of 3 n...

Why am I getting a parse error for input "|" in Haskell for guards? Why am I getting a parse error for input "|" in Haskell for guards? haskell guard Why Haskell Median max3 min3 Why am I getting a parse error for input "|" in Haskell for guards? I'm writing a code to find the median of 3 numbers bu...

[ -0.00927734375, 0.01422119140625, 0.0201416015625, -0.005706787109375, 0.00750732421875, 0.0130615234375, -0.038330078125, 0.00469970703125, 0.00096893310546875, -0.01202392578125, -0.01312255859375, -0.03515625, 0.0167236328125, -0.0107421875, 0.009521484375, -0.0036773681640625, -0...

[ 44084, 444, 87, 20949, 366, 184, 18499, 100, 107730, 41502, 58745, 1230, 20625, 142508, 56050, 7, 619, 23, 1556, 4794, 19, 18389, 363, 881, 32562, 18151, 7413, 2450, 138, 101935, 134234, 13315, 7076, 90791, 121742, 645, 13438, 69427, 4358 ]

[ 0.1328125, 0.0491943359375, 0.007080078125, 0.04791259765625, 0.1580810546875, 0.1416015625, 0.215576171875, 0.0672607421875, 0.1727294921875, 0.0841064453125, 0.18212890625, 0.03094482421875, 0.1451416015625, 0.241455078125, 0.2266845703125, 0.050567626953125, 0.00732421875, 0.045...

embed

43071045_c0

43071045

haskell

0

Title: How can I concatenate user input in a list Problem title: How can I concatenate user input in a list Tags: recursion, haskell, list Problem: How can I concatenate user input in a list I would like to get codes from the user and insert it in a list, but the problem is when the user say that don't wanna insert mor...

How can I concatenate user input in a list How can I concatenate user input in a list recursion haskell list How Integer Another code::String How can I concatenate user input in a list I would like to get codes from the user and insert it in a list, but the problem is when the user say that don't wanna insert more code...

[ -0.0147705078125, -0.021240234375, 0.004486083984375, 0.01385498046875, 0.017333984375, 0.0120849609375, -0.0125732421875, 0.000926971435546875, 0.0020294189453125, -0.05810546875, -0.004486083984375, -0.03955078125, -0.01190185546875, 0.0096435546875, -0.006683349609375, -0.0031280517...

[ 11249, 831, 87, 158, 33478, 76, 67, 38937, 107730, 23, 5303, 195625, 1830, 1556, 142508, 44401, 116267, 18151, 71713, 214, 10, 1884, 2046, 1295, 183540, 2967, 5154, 18, 6165, 1286, 57, 4126, 678, 101935, 17368, 11782, 55300, 13438, 30646, ...

[ 0.09112548828125, 0.0804443359375, 0.04107666015625, 0.1280517578125, 0.1837158203125, 0.15673828125, 0.1041259765625, 0.183349609375, 0.224609375, 0.080078125, 0.1995849609375, 0.14794921875, 0.082275390625, 0.10040283203125, 0.177490234375, 0.16064453125, 0.0631103515625, 0.17297...

embed

32419598_c0

32419598

haskell

0

Title: Algorithm to merge two lists Problem title: Algorithm to merge two lists Tags: list, haskell Problem: Algorithm to merge two lists I'm trying to merge two lists of tuples, x and y . Basically is I have these lists: [("hello", "hi"), ("foo", "baz"), ("this", "that")] --and [("foo", "bar"), ("hello", "world"), ("g...

Algorithm to merge two lists Algorithm to merge two lists list haskell Algorithm x:xs y:ys Algorithm to merge two lists I'm trying to merge two lists of tuples, x and y . Basically is I have these lists: I've written this so far: The problem with this solution is that it only merges that are the same index. How can I e...

[ -0.00186920166015625, 0.02734375, 0.004791259765625, 0.01519775390625, 0.00179290771484375, 0.0072021484375, -0.017822265625, -0.001434326171875, 0.01611328125, 0.0089111328125, -0.001220703125, 0.00555419921875, 0.0084228515625, 0.009521484375, -0.003173828125, -0.0089111328125, -0....

[ 109847, 2783, 18337, 47, 42564, 6626, 5303, 7, 1556, 142508, 1022, 12, 425, 113, 4778, 31577, 370, 99726, 136, 6097, 59121, 2060, 2967, 29806, 4734, 621, 5701, 63262, 93766, 8560, 645, 17932, 3934, 70, 5117 ]

[ 0.171875, 0.15576171875, 0.1065673828125, 0.09002685546875, 0.24755859375, 0.2054443359375, 0.243408203125, 0.1058349609375, 0.135009765625, 0.2078857421875, 0.081298828125, 0.05633544921875, 0.0855712890625, 0.1126708984375, 0.1546630859375, 0.06182861328125, 0.09808349609375, 0.1...

embed

63396432_c2

63396432

haskell

2

. Code signals: /home/nick/.stack/snapshots/x86_64-linux-tinfo6/59804b23a4d63c47966b839bf0007deca79c979c9d5aa499d8828f7acbc09797/8.8.3/bin/gtk2hsC2hs, /home/nick/.stack/snapshots/x86_64-linux-tinfo6/59804b23a4d63c47966b839bf0007deca79c979c9d5aa499d8828f7acbc09797/8.8.3/bin/gtk2hsHookGenerator, /home/nick/.stack/snapsho...

1de0b3576c4a5f79 a7d5d8 b9bd790e3091cf3e10cc5b6c0aa6789904463f24 b9bd790e3091cf3e10cc5b6c b9bd790 e3091cf3e10cc5b6c0aa6789904463f24721de0b3576c4a5f79a7d5d8 x86_64 linux-tinfo6 b9bd790e3091cf3e10cc5b6c0aa6789904463f24721de0b3576c4a5f79a7d5d8 b9bd790e3091cf3e10cc5b6c0aa678990 Cabal-3 bytestring-0.10.10.0 Copying gtk2hsC2...

[ 0.004913330078125, 0.01043701171875, -0.00347900390625, 0.0045166015625, 0.0093994140625, 0.00121307373046875, 0.0014801025390625, -0.00189971923828125, -0.014404296875, -0.01080322265625, -0.01129150390625, -0.04150390625, -0.0024261474609375, -0.00439453125, -0.01287841796875, 0.0170...

[ 106, 112, 275, 5843, 11835, 238, 11, 758, 420, 22377, 10, 966, 71, 1019, 876, 1126, 123048, 13, 12183, 67466, 363, 963, 10060, 910, 2389, 180730, 2357, 34145, 1197, 28, 61158, 142430, 3117, 617, 15276, 454, 13307, 11508, 6077, 9, 18, ...

[ 0.001678466796875, 0.0482177734375, 0.009765625, 0.019439697265625, 0.0226287841796875, 0.00970458984375, 0.009765625, 0.00970458984375, 0.009857177734375, 0.0869140625, 0.00921630859375, 0.009613037109375, 0.00982666015625, 0.00970458984375, 0.009246826171875, 0.009674072265625, 0.0...

embed

11347655_c0

11347655

haskell

0

Title: Correct control monad for aliasing Problem title: Correct control monad for aliasing Tags: monad-transformers, haskell, monads Problem: Correct control monad for aliasing I have a monadic function which returns a user id: do id <- getUserId I need to be able to "superimpose", on getUserId, a function which looks...

Correct control monad for aliasing Correct control monad for aliasing monad-transformers haskell monads Correct Correct control monad for aliasing I have a monadic function which returns a user id: I need to be able to "superimpose", on getUserId, a function which looks up, and returns, an alias to the value returned b...

[ -0.023681640625, 0.01104736328125, 0.000682830810546875, 0.01361083984375, 0.00787353515625, 0.0224609375, 0.000946044921875, 0.00836181640625, -0.015380859375, -0.016845703125, 0.01239013671875, -0.0142822265625, -0.01324462890625, -0.003997802734375, 0.00799560546875, 0.0002098083496...

[ 46348, 15390, 6226, 2667, 712, 100, 55109, 214, 215175, 1314, 1556, 142508, 11, 18403, 32354, 30646, 38937, 3447, 3871, 19048, 59104, 178451, 2046, 1062, 2189, 568, 71, 33342, 1257, 47, 34292, 176377, 5809, 33022, 29458, 55725, 162, 456, 43...

[ 0.118408203125, 0.0447998046875, 0.217529296875, 0.1478271484375, 0.202392578125, 0.0421142578125, 0.263427734375, 0.13720703125, 0.183837890625, 0.0253448486328125, 0.059539794921875, 0.19580078125, 0.0631103515625, 0.0679931640625, 0.1514892578125, 0.1256103515625, 0.130859375, 0...

embed

15848856_c1

15848856

haskell

1

or bad practices. From the linked wikipedia article on Anti-Patterns : ... there must be at least two key elements present to formally distinguish an actual anti-pattern from a simple bad habit, bad practice, or bad idea : some repeated pattern of action, process or structure that initially appears to be beneficial, b...

[ -0.0009307861328125, 0.01373291015625, 0.01190185546875, -0.02490234375, 0.0021209716796875, 0.004913330078125, 0.004852294921875, 0.0169677734375, -0.0027923583984375, -0.0113525390625, 0.01080322265625, -0.032470703125, -0.0064697265625, 0.014404296875, -0.00390625, -0.00885009765625...

[ 707, 6494, 41361, 7, 7168, 8332, 9, 8335, 3055, 1779, 8110, 19713, 6626, 22799, 80854, 13379, 23113, 157167, 1495, 8561, 2874, 4453, 22766, 1295, 8781, 62122, 6528, 119140, 103510, 22631, 9433, 45646, 61475, 135179, 48588, 141, 1284, 20654, ...

[ 0.07366943359375, 0.176025390625, 0.250732421875, 0.0178680419921875, 0.0330810546875, 0.253173828125, 0.090576171875, 0.210205078125, 0.21484375, 0.0936279296875, 0.05120849609375, 0.041015625, 0.109619140625, 0.1177978515625, 0.1156005859375, 0.06787109375, 0.08282470703125, 0.15...

embed

53450533_c0

53450533

haskell

0

Title: Haskell - Iterate Tuple with Different Functions Problem title: Haskell - Iterate Tuple with Different Functions Tags: haskell Problem: Haskell - Iterate Tuple with Different Functions I have been trying to to iterate the cand data in order to apply a function "pt_string". Pt :: (Float, Float) Person :: (Pt, Pt,...

Haskell - Iterate Tuple with Different Functions Haskell - Iterate Tuple with Different Functions haskell Haskell Iterate Tuple Different Functions Float Person Point pt_string Haskell - Iterate Tuple with Different Functions I have been trying to to iterate the cand data in order to apply a function "pt_string". My id...

[ 0.01361083984375, -0.019287109375, -0.01287841796875, 0.0291748046875, -0.00093841552734375, -0.004486083984375, 0.00762939453125, 0.0036773681640625, 0.01025390625, -0.01446533203125, -0.0164794921875, -0.0103759765625, 0.01373291015625, 0.01312255859375, -0.0174560546875, 0.004852294...

[ 20625, 142508, 8560, 67, 1371, 8705, 678, 242520, 28670, 10763, 1556, 87, 38699, 257, 15270, 41097, 27037, 454, 91693, 31577, 17, 7841, 2053, 59911, 32354, 6328, 6528, 11782, 12921, 3917, 12638, 12830, 370, 6366, 133, 13448, 22288, 147534, ...

[ 0.111328125, 0.2303466796875, 0.2021484375, 0.0933837890625, 0.0982666015625, 0.1966552734375, 0.0679931640625, 0.1392822265625, 0.1444091796875, 0.0802001953125, 0.101806640625, 0.020782470703125, 0.157470703125, 0.0257415771484375, 0.1402587890625, 0.1650390625, 0.1959228515625, ...

embed

13443237_c0

13443237

haskell

0

Title: All possible sublists of a list Problem title: All possible sublists of a list Tags: haskell, list Problem: All possible sublists of a list I need to write a function that generates a list containing lists of all the possible sublists of a list. So the type must be: partitions :: [a] -> [[[a]]] and it should giv...

All possible sublists of a list All possible sublists of a list haskell list All x:xs ys:x:zs All possible sublists of a list I need to write a function that generates a list containing lists of all the possible sublists of a list. So the type must be: and it should give: I'm thinking a list comprehension is the best w...

[ -0.008056640625, 0.0003757476806640625, 0.01385498046875, 0.006683349609375, -0.0177001953125, 0.01171875, -0.0189208984375, -0.017578125, 0.0086669921875, -0.004119873046875, -0.002777099609375, -0.006195068359375, 0.0311279296875, 0.0027313232421875, -0.0206298828125, 0.01806640625, ...

[ 3164, 7722, 1614, 6562, 7, 111, 5303, 10, 1556, 142508, 1022, 12, 425, 113, 169, 3871, 33022, 32354, 139392, 70541, 214, 756, 70, 10644, 8110, 5608, 8337, 47644, 46683, 3220, 6889, 2965, 3917, 2060, 104250, 18499, 41206, 3714, 30022, 1231...

[ 0.14794921875, 0.215576171875, 0.218505859375, 0.26025390625, 0.1376953125, 0.06707763671875, 0.193115234375, 0.014404296875, 0.1318359375, 0.1942138671875, 0.09027099609375, 0.036865234375, 0.08624267578125, 0.07080078125, 0.0712890625, 0.042724609375, 0.0682373046875, 0.130615234...

embed

34748759_c0

34748759

haskell

0

Title: Sampling a behaviour from outside network Problem title: Sampling a behaviour from outside network Tags: sodiumfrp, reactive-banana, haskell, io, frp Problem: Sampling a behaviour from outside network Since sodium has been deprecated by the author I'm trying to port my code to reactive-banana. However, there see...

Sampling a behaviour from outside network Sampling a behaviour from outside network sodiumfrp reactive-banana haskell io frp outside Sampling Behaviour Sampling a behaviour from outside network Since sodium has been deprecated by the author I'm trying to port my code to reactive-banana. However, there seem to be some i...

[ 0.01953125, 0.03125, -0.003143310546875, 0.01239013671875, -0.00732421875, 0.0220947265625, 0.01708984375, 0.015625, 0.0164794921875, -0.0732421875, 0.00543212890625, -0.013916015625, -0.002044677734375, 0.0177001953125, 0.0181884765625, -0.00897216796875, 0.004608154296875, 0.0180...

[ 3362, 254, 2069, 224833, 1295, 50782, 33120, 221, 28483, 7079, 456, 71232, 105281, 11, 1556, 142508, 22995, 14119, 873, 98409, 10, 8, 4692, 4460, 42179, 31577, 11469, 18151, 47, 23, 2271, 38242, 117538, 17721, 6626, 7941, 1733, 645, 277, ...

[ 0.1885986328125, 0.1949462890625, 0.1236572265625, 0.27001953125, 0.142578125, 0.1983642578125, 0.1585693359375, 0.16748046875, 0.2481689453125, 0.08721923828125, 0.10052490234375, 0.2257080078125, 0.19580078125, 0.1751708984375, 0.1103515625, 0.221435546875, 0.1685791015625, 0.062...

embed

53136545_c0

53136545

haskell

0

Title: Haskell function which sorts a list of integer lists according to the length of the sublists Problem title: Haskell function which sorts a list of integer lists according to the length of the sublists Tags: haskell Problem: Haskell function which sorts a list of integer lists according to the length of the subli...

Haskell function which sorts a list of integer lists according to the length of the sublists Haskell function which sorts a list of integer lists according to the length of the sublists haskell Data.List Haskell Ord Num Haskell function which sorts a list of integer lists according to the length of the sublists I have ...

[ -0.00836181640625, 0.020263671875, 0.0206298828125, 0.001190185546875, -0.0125732421875, 0.01287841796875, -0.006500244140625, -0.007476806640625, -0.000858306884765625, -0.006256103515625, -0.01104736328125, -0.0022125244140625, 0.003570556640625, 0.006561279296875, -0.00897216796875, ...

[ 20625, 142508, 32354, 3129, 12096, 7, 5303, 892, 1505, 59499, 140909, 1614, 6562, 111, 1556, 11809, 154663, 35379, 52782, 765, 3444, 47, 23, 82800, 12989, 15072, 1884, 903, 14037, 1632, 29806, 959, 4966, 3917, 13319 ]

[ 0.1395263671875, 0.2470703125, 0.1982421875, 0.0491943359375, 0.2254638671875, 0.05712890625, 0.206298828125, 0.134033203125, 0.133544921875, 0.0965576171875, 0.170654296875, 0.18212890625, 0.1983642578125, 0.0267486572265625, 0.1226806640625, 0.07586669921875, 0.14599609375, 0.148...

embed

48365642_c0

48365642

haskell

0

Title: Koch snowflake in Haskell (CodeWorld) Problem title: Koch snowflake in Haskell (CodeWorld) Tags: codeworld, haskell Problem: Koch snowflake in Haskell (CodeWorld) Through the Haskell package, CodeWorld ( https://hackage.haskell.org/package/codeworld-api ) , I need to draw Koch's snowflake. You can use this packa...

Koch snowflake in Haskell (CodeWorld) Koch snowflake in Haskell (CodeWorld) codeworld haskell CodeWorld Koch Haskell Picture Koch snowflake in Haskell (CodeWorld) Through the Haskell package, CodeWorld ( https://hackage.haskell.org/package/codeworld-api ) , I need to draw Koch's snowflake. You can use this package onli...

[ 0.00058746337890625, 0.004486083984375, 0.0125732421875, 0.01202392578125, 0.00677490234375, 0.01123046875, 0.0252685546875, -0.0201416015625, -0.01434326171875, -0.01806640625, -0.01953125, -0.0203857421875, -0.0198974609375, 0.006378173828125, -0.0025787353515625, -0.00439453125, 0...

[ 103857, 108203, 13034, 350, 23, 20625, 142508, 114211, 70646, 18151, 32554, 1556, 28864, 158656, 98169, 139509, 10557, 1478, 29102, 40899, 40897, 3871, 79442, 25, 7, 4527, 903, 1118, 7026, 442, 3126, 94835, 12333, 7168, 856, 191, 605, 3581, ...

[ 0.280029296875, 0.1573486328125, 0.220703125, 0.1414794921875, 0.060302734375, 0.1142578125, 0.2410888671875, 0.137939453125, 0.167236328125, 0.07904052734375, 0.142822265625, 0.0751953125, 0.1556396484375, 0.173828125, 0.1859130859375, 0.1358642578125, 0.050872802734375, 0.0132751...

embed

9630142_c3

9630142

haskell

3

8e3a71ad38b -package-id time-1.4-3e186a51d3674e5d65b5a7925db3d3a7 -package-id utf8-string-0.3.7-528cea24d4cad2c1cb19a75d1ad8976c -package-id xml-1.3.12-d665e5a084b52511c150438a3c9fb8d1 -package-id zip-archive-0.1.1.7-463904d956f1052cc58a2c9e5deeee2c -package-id zlib-0.5.3.3-9ed15628a121b3b57f97b7acc02bf5d9 -O -O2 -Wall...

[ 0.00145721435546875, -0.0218505859375, 0.0262451171875, 0.004425048828125, -0.000728607177734375, 0.003082275390625, -0.046630859375, -0.0181884765625, -0.006683349609375, -0.00982666015625, -0.006744384765625, -0.0291748046875, 0.0111083984375, -0.02001953125, -0.003448486328125, 0.00...

[ 382, 11, 15770, 712, 10991, 275, 20, 29102, 4588, 532, 1733, 91977, 71, 48073, 486, 420, 1019, 91693, 23320, 5, 109981, 3882, 45710, 25426, 131492, 81046, 68330, 147488, 102014, 133760, 180234, 97, 5612, 93645, 670, 304, 198076, 157, 4205, ...

[ 0.1220703125, 0.036956787109375, 0.09368896484375, 0.0081787109375, 0.1351318359375, 0.041534423828125, 0.0217437744140625, 0.230712890625, 0.06951904296875, 0.082763671875, 0.181396484375, 0.097900390625, 0.018402099609375, 0.0035400390625, 0.032379150390625, 0.014923095703125, 0.09...

embed

1106431_c0

1106431

haskell

0

Title: What are some good intermediate problems and projects for learning Haskell? Problem title: What are some good intermediate problems and projects for learning Haskell? Tags: haskell Problem: What are some good intermediate problems and projects for learning Haskell? I just recently started diving into Real World ...

What are some good intermediate problems and projects for learning Haskell? What are some good intermediate problems and projects for learning Haskell? haskell What Haskell What are some good intermediate problems and projects for learning Haskell? I just recently started diving into Real World Haskell and the book pro...

[ -0.00125885009765625, 0.004425048828125, 0.009033203125, 0.0140380859375, -0.006072998046875, 0.01123046875, -0.01348876953125, -0.00787353515625, 0.020263671875, -0.00360107421875, -0.00125885009765625, -0.032470703125, -0.0012359619140625, 0.024169921875, -0.01263427734375, -0.008911...

[ 4865, 3060, 4127, 81814, 2182, 44402, 136, 77635, 100, 52080, 20625, 142508, 1556, 621, 26859, 45, 6496, 5120, 6661, 12877, 41361, 81979, 157666, 86869, 140528, 104902, 11522, 28219, 46876, 130732, 8966, 831, 104250, 35978, 99, 6183, 66801, 7...

[ 0.083740234375, 0.0455322265625, 0.1419677734375, 0.1865234375, 0.1099853515625, 0.185791015625, 0.08551025390625, 0.166748046875, 0.058319091796875, 0.1292724609375, 0.192138671875, 0.272216796875, 0.17041015625, 0.01123046875, 0.002471923828125, 0.021636962890625, 0.01226806640625,...

embed

13207261_c0

13207261

haskell

0

Title: How to set the working directory of WinGHCi Problem title: How to set the working directory of WinGHCi Tags: ghc, windows-7, haskell, winghci Problem: How to set the working directory of WinGHCi I just installed WinGHCi. When I try to load an .hs file with Ctrl+L, it opens the file browser in C:\Program Files (x...

How to set the working directory of WinGHCi How to set the working directory of WinGHCi ghc windows-7 haskell winghci How WinGHCi Program Files x86 Haskell Platform MyPath windows-7 How to set the working directory of WinGHCi I just installed WinGHCi. When I try to load an .hs file with Ctrl+L, it opens the file browse...

[ -0.0026397705078125, 0.0057373046875, 0.0027313232421875, 0.0262451171875, -0.01361083984375, 0.0155029296875, 0.00022125244140625, -0.0189208984375, -0.0031585693359375, -0.024658203125, 0.006805419921875, 0.007354736328125, -0.005828857421875, 0.004302978515625, -0.006072998046875, 0...

[ 11249, 5423, 20697, 14364, 53, 111, 17686, 41877, 40658, 47, 31380, 238, 54825, 16709, 1556, 142508, 14775, 127, 318, 7663, 42724, 15276, 20625, 70968, 2646, 683, 10519, 70, 20600, 72367, 5, 11435, 68847, 1328, 866, 9803, 31842, 313, 148968...

[ 0.05450439453125, 0.178466796875, 0.2032470703125, 0.206787109375, 0.1248779296875, 0.07269287109375, 0.1334228515625, 0.1741943359375, 0.253173828125, 0.014739990234375, 0.0894775390625, 0.06939697265625, 0.0657958984375, 0.1011962890625, 0.09906005859375, 0.1878662109375, 0.1235351...

embed

43958571_c0

43958571

haskell

0

Title: Passing two arguments of differing types Problem title: Passing two arguments of differing types Tags: haskell Problem: Passing two arguments of differing types I want to create a function, let's call it altHead, that takes 2 variables and outputs a variable such that: a -> [a] -> a I want to call it like this: ...

Passing two arguments of differing types Passing two arguments of differing types haskell Passing x:xs Passing two arguments of differing types I want to create a function, let's call it altHead, that takes 2 variables and outputs a variable such that: I want to call it like this: What it should do is to look at the fi...

[ 0.0140380859375, 0.0027618408203125, -0.00616455078125, 0.00604248046875, 0.002288818359375, 0.0191650390625, 0.005035400390625, -0.0107421875, 0.0208740234375, -0.01806640625, 0.029052734375, 0.00830078125, 0.01287841796875, 0.0228271484375, -0.005828857421875, -0.0218505859375, 0.0...

[ 28872, 6626, 10750, 111, 129927, 214, 52895, 1556, 142508, 1022, 12, 425, 7, 3444, 28282, 32354, 2641, 13025, 712, 51776, 116, 77336, 140992, 11782, 5608, 6713, 99, 5117, 5303, 4263, 201505, 30646, 285, 34292, 120262, 25632, 18151, 18822, 4...

[ 0.109619140625, 0.1217041015625, 0.22412109375, 0.002410888671875, 0.1683349609375, 0.0748291015625, 0.1641845703125, 0.1357421875, 0.20166015625, 0.0911865234375, 0.0731201171875, 0.13427734375, 0.09686279296875, 0.0418701171875, 0.06988525390625, 0.1490478515625, 0.1334228515625, ...

embed

10669217_c0

10669217

haskell

0

Title: efficient functional data structure for finite bijections Problem title: efficient functional data structure for finite bijections Tags: bijection, data-structures, functional-programming, haskell, ocaml Problem: efficient functional data structure for finite bijections I'm looking for a functional data structur...

efficient functional data structure for finite bijections efficient functional data structure for finite bijections bijection data-structures functional-programming haskell ocaml efficient functional data structure for finite bijections I'm looking for a functional data structure that represents finite bijections betwe...

[ 0.00022983551025390625, 0.0262451171875, -0.00439453125, -0.0244140625, -0.006622314453125, 0.005645751953125, 0.007049560546875, -0.002349853515625, -0.00830078125, -0.0260009765625, 0.0120849609375, 0.00946044921875, 0.0003757476806640625, 0.00335693359375, 0.0074462890625, 0.0080566...

[ 93766, 123309, 2053, 45646, 100, 94418, 13, 1582, 58994, 137656, 28966, 1556, 142508, 36, 9779, 141, 16487, 33636, 17721, 6626, 52895, 83, 32628, 24500, 45964, 1733, 17723, 179635, 1238, 111, 13267, 653, 65042, 678, 3525, 80836, 80854, 27140,...

[ 0.2081298828125, 0.2120361328125, 0.14404296875, 0.2210693359375, 0.040283203125, 0.195068359375, 0.07080078125, 0.1500244140625, 0.1947021484375, 0.1590576171875, 0.0885009765625, 0.114501953125, 0.2139892578125, 0.0836181640625, 0.0947265625, 0.107177734375, 0.06878662109375, 0.1...

embed

19060560_c0

19060560

haskell

0

Title: Haskell module ,parse error on input 'sayhello'"` Problem title: Haskell module ,parse error on input 'sayhello'"` Tags: haskell Problem: Haskell module ,parse error on input 'sayhello'"` module sayhello ( inChinese , inSpanish ) where inChinese = "Ni Hao" inSpanish= "Hola" import s...

Haskell module ,parse error on input 'sayhello'"` Haskell module ,parse error on input 'sayhello'"` haskell sayhello Haskell Hao Hola sayhello.inChinese sayhello.inSpanish module.hs:1:8 Haskell module ,parse error on input 'sayhello'"` I got error from this code. "module.hs:1:8: parse erro...

[ -0.0037384033203125, 0.0031890869140625, -0.01123046875, 0.0260009765625, -0.005584716796875, 0.0177001953125, 0.0152587890625, -0.0096435546875, -0.018798828125, -0.008056640625, -0.016845703125, -0.042724609375, 0.03271484375, -0.0164794921875, -0.0026397705078125, -0.0042724609375, ...

[ 20625, 142508, 88996, 2500, 184, 18499, 98, 107730, 3768, 20347, 127, 13817, 1556, 5154, 1391, 47958, 73, 51379, 24366, 141667, 78183, 1019, 1295, 903, 18151, 83279, 13, 7, 19721, 12, 366, 28219, 4358, 2967, 4527, 1407, 56, 7225, 9351, 13...

[ 0.159423828125, 0.251953125, 0.2396240234375, 0.138671875, 0.13671875, 0.2210693359375, 0.0628662109375, 0.2198486328125, 0.0914306640625, 0.1431884765625, 0.122314453125, 0.244140625, 0.1151123046875, 0.1248779296875, 0.10498046875, 0.197265625, 0.01165771484375, 0.08941650390625,...

embed

30220219_c0

30220219

haskell

0

Title: Why length return Int and not Num Problem title: Why length return Int and not Num Tags: haskell Problem: Why length return Int and not Num Is there any reason for restricting length function to Int and not to Num ? A lot of functions from prelude have the restriction to Int type and not to a more generic type /...

Why length return Int and not Num Why length return Int and not Num haskell Why Num Integral Why length return Int and not Num Is there any reason for restricting length function to Int and not to Num ? A lot of functions from prelude have the restriction to Int type and not to a more generic type / typeclass: But ther...

[ -0.01318359375, 0.00775146484375, 0.01324462890625, 0.01318359375, -0.002288818359375, 0.006500244140625, 0.000759124755859375, 0.007568359375, 0.01483154296875, -0.00049591064453125, -0.0208740234375, -0.051025390625, 0.0030364990234375, 0.005279541015625, 0.007568359375, -0.001152038...

[ 44084, 140909, 30646, 360, 18, 136, 959, 52782, 1556, 142508, 204681, 2499, 31635, 173072, 32354, 47, 5915, 7, 479, 822, 112, 185190, 10644, 189534, 67413, 1286, 11809, 5, 154663, 5117, 61924, 17932 ]

[ 0.1304931640625, 0.258544921875, 0.1817626953125, 0.1585693359375, 0.19775390625, 0.072998046875, 0.116455078125, 0.2235107421875, 0.132080078125, 0.2403564453125, 0.22119140625, 0.00885009765625, 0.10400390625, 0.15283203125, 0.16064453125, 0.012786865234375, 0.040924072265625, 0....

embed

23754319_c0

23754319

haskell

0

Title: Haskell Diagrams double lined arrows Problem title: Haskell Diagrams double lined arrows Tags: haskell-diagrams, haskell Problem: Haskell Diagrams double lined arrows I'm working now on my library for Bachelor thesis and I need Your help for making new line type. Bellow there is code for single line, double head...

Haskell Diagrams double lined arrows Haskell Diagrams double lined arrows haskell-diagrams haskell Haskell Diagrams Haskell Diagrams double lined arrows I'm working now on my library for Bachelor thesis and I need Your help for making new line type. Bellow there is code for single line, double head arrow: <-> . I would...

[ -0.007781982421875, 0.00004673004150390625, 0.0023651123046875, 0.0162353515625, -0.006866455078125, 0.00994873046875, -0.024169921875, 0.00543212890625, -0.0091552734375, -0.0093994140625, 0.005157470703125, -0.00262451171875, 0.00811767578125, 0.0019683837890625, -0.006134033203125, ...

[ 20625, 142508, 4512, 25561, 41929, 13315, 71, 118201, 1556, 3390, 20697, 35773, 147697, 159688, 3871, 4358, 20662, 3525, 10644, 873, 41566, 18151, 11001, 10336, 4426, 103607, 26458, 81273, 3249, 1295, 2256, 2203, 141037, 168407, 150369, 3509, 3...

[ 0.1226806640625, 0.217529296875, 0.1260986328125, 0.1519775390625, 0.198974609375, 0.173583984375, 0.03125, 0.2255859375, 0.11572265625, 0.08544921875, 0.055450439453125, 0.072509765625, 0.0943603515625, 0.099609375, 0.0209503173828125, 0.0906982421875, 0.0280609130859375, 0.068481...

embed

52038907_c0

52038907

haskell

0

Title: Haskell - why getSymbolicLinkTarget is not in scope? Problem title: Haskell - why getSymbolicLinkTarget is not in scope? Tags: haskell Problem: Haskell - why getSymbolicLinkTarget is not in scope? I get this error: /home/jacek/hasktemp/src/Main.hs:40:31: error: Variable not in scope: getSymbolicLinkTarget :: [Ch...

Haskell - why getSymbolicLinkTarget is not in scope? Haskell - why getSymbolicLinkTarget is not in scope? haskell System.Directory Haskell Main.hs:40:31 Variable Char Haskell - why getSymbolicLinkTarget is not in scope? I get this error: when I try to find the target of a symlink. The gist of my code is here: https://g...

[ 0.004730224609375, 0.00016021728515625, 0.01080322265625, 0.033203125, 0.01165771484375, 0.0255126953125, -0.0019378662109375, 0.0113525390625, -0.0216064453125, -0.004058837890625, -0.005279541015625, -0.0255126953125, -0.02734375, -0.00958251953125, -0.01458740234375, -0.000109195709...

[ 20625, 142508, 15400, 2046, 65183, 36846, 1771, 64287, 63031, 3794, 83, 959, 23, 70820, 1556, 12353, 184911, 12321, 27321, 84572, 2886, 21656, 18499, 9790, 7413, 30388, 954, 39, 10187, 3016, 271, 18151, 3688, 735, 15769, 32102, 232, 24927, ...

[ 0.131103515625, 0.233642578125, 0.1263427734375, 0.1251220703125, 0.0855712890625, 0.1878662109375, 0.060577392578125, 0.2139892578125, 0.19140625, 0.199462890625, 0.07220458984375, 0.136474609375, 0.1136474609375, 0.2156982421875, 0.09033203125, 0.024627685546875, 0.043731689453125,...

embed

7451548_c0

7451548

haskell

0

Title: Is there a "unit" class? Would it be useful? Problem title: Is there a "unit" class? Would it be useful? Tags: alternative-functor, haskell, monoids Problem: Is there a "unit" class? Would it be useful? Is there a class for types having a single unit value (not sure of the correct terminology...

Is there a "unit" class? Would it be useful? Is there a "unit" class? Would it be useful? alternative-functor haskell monoids Would Unit Maybe Nothing Default Reader Is there a "unit" class? Would it be useful? Is there a class for types having a single unit value (not sure of the correct terminolog...

[ 0.015869140625, 0.0277099609375, 0.021484375, -0.00927734375, -0.00823974609375, -0.027099609375, 0.00162506103515625, -0.0103759765625, 0.0024566650390625, -0.009033203125, -0.03173828125, -0.0001697540283203125, -0.00823974609375, -0.0028839111328125, -0.01043701171875, 0.00515747070...

[ 2685, 10, 309, 217, 18507, 154559, 80234, 30700, 16498, 18770, 1556, 142508, 22460, 30185, 46640, 83425, 182747, 262, 1021, 7136, 122636, 2071, 186, 100, 52895, 19441, 11001, 25072, 34292, 18614, 678, 3060, 479, 112, 5983, 77879, 60331, 71, ...

[ 0.08935546875, 0.09368896484375, 0.2425537109375, 0.238037109375, 0.274169921875, 0.0909423828125, 0.1966552734375, 0.09716796875, 0.03973388671875, 0.0333251953125, 0.0965576171875, 0.2208251953125, 0.1083984375, 0.1414794921875, 0.211181640625, 0.0909423828125, 0.09942626953125, ...

embed

43271059_c0

43271059

haskell

0

Title: How to read the bind operator ">>=" in words? Problem title: How to read the bind operator ">>=" in words? Tags: haskell, monads Problem: How to read the bind operator ">>=" in words? When reading code, I like to be able to form sentences in my head. For example, x <- getChar coul...

How to read the bind operator ">>=" in words? How to read the bind operator ">>=" in words? haskell monads How How to read the bind operator ">>=" in words? When reading code, I like to be able to form sentences in my head. For example, x <- getChar could be something like "x slurps getC...

[ -0.00494384765625, -0.01336669921875, 0.01275634765625, 0.00897216796875, 0.0017547607421875, 0.010498046875, 0.0230712890625, -0.00665283203125, 0.006744384765625, -0.0074462890625, 0.0031280517578125, -0.0225830078125, -0.01226806640625, -0.00640869140625, 0.0005950927734375, 0.00445...

[ 11249, 47, 12301, 68557, 39933, 41502, 5386, 23, 34153, 1556, 142508, 2667, 712, 7, 70, 30813, 22422, 16454, 18151, 1884, 19048, 3173, 149357, 10336, 1022, 4426, 2046, 84068, 5809, 425, 10681, 876, 2806, 275, 190659, 60331, 18403, 16666, 71...

[ 0.07647705078125, 0.0596923828125, 0.2032470703125, 0.25830078125, 0.2391357421875, 0.053192138671875, 0.1197509765625, 0.0941162109375, 0.2005615234375, 0.0843505859375, 0.215576171875, 0.061767578125, 0.0943603515625, 0.0318603515625, 0.003814697265625, 0.2431640625, 0.03369140625,...

embed

46703780_c0

46703780

haskell

0

Title: How to capture string in haskell regex expression? Problem title: How to capture string in haskell regex expression? Tags: regex, haskell Problem: How to capture string in haskell regex expression? With module Text.Regex.Posix,I can check if a string matchs a regex expression,but I don't know how to capture elem...

How to capture string in haskell regex expression? How to capture string in haskell regex expression? regex haskell How Match i:MAIL a-zA-Z0-9 SIZE mailMatch.Groups ToString How to capture string in haskell regex expression? With module Text.Regex.Posix,I can check if a string matchs a regex expression,but I don't know...

[ -0.019775390625, 0.008544921875, 0.008056640625, 0.04541015625, 0.0001544952392578125, 0.01129150390625, 0.00836181640625, 0.02197265625, -0.00592041015625, 0.020263671875, 0.00011491775512695312, -0.00098419189453125, -0.004638671875, -0.0311279296875, 0.00299072265625, -0.00570678710...

[ 11249, 47, 141621, 79315, 23, 1556, 142508, 6835, 3355, 125195, 67407, 17, 108971, 10, 169, 284, 1511, 2389, 15205, 10000, 19157, 6648, 79520, 206, 205072, 717, 71713, 214, 88996, 24129, 54601, 7192, 4084, 12765, 2174, 14858, 3714, 3642, 12...

[ 0.051483154296875, 0.0286712646484375, 0.2120361328125, 0.261962890625, 0.051849365234375, 0.1536865234375, 0.231201171875, 0.15283203125, 0.1959228515625, 0.2049560546875, 0.1395263671875, 0.04925537109375, 0.09613037109375, 0.03106689453125, 0.02099609375, 0.023345947265625, 0.0188...

embed

9440343_c1

9440343

haskell

1

call depends on the type of user (Unregistered or Customer). I believe this can be achieved by adding handleMessage to the class and instances: class ClientData a where cdSocket :: a -> Socket handleMessage :: a -> String -> IO () instance ClientData UnregisteredClientData where cdSocket = ucdSocket handleMessage unre...

[ 0.0047607421875, 0.0211181640625, -0.0047607421875, 0.027099609375, 0.00946044921875, 0.01104736328125, -0.00604248046875, 0.01190185546875, 0.0023040771484375, -0.048583984375, -0.010986328125, -0.0260009765625, 0.0155029296875, 0.01611328125, -0.01202392578125, -0.005950927734375, ...

[ 11782, 56566, 7, 10644, 38937, 14256, 105199, 124765, 18822, 831, 69307, 154107, 34831, 594, 6011, 429, 18507, 136, 110527, 91732, 137989, 10, 56329, 8912, 27853, 1061, 23351, 17780, 992, 150, 51, 5343, 147, 197648, 71574, 43373, 68163, 177, ...

[ 0.264892578125, 0.1077880859375, 0.0166473388671875, 0.07611083984375, 0.1846923828125, 0.047576904296875, 0.1849365234375, 0.214111328125, 0.031280517578125, 0.018768310546875, 0.1109619140625, 0.10345458984375, 0.181640625, 0.04833984375, 0.1141357421875, 0.034576416015625, 0.15393...

embed

56631989_c0

56631989

haskell

0

Title: How to match the rest of the list, no matter the length Problem title: How to match the rest of the list, no matter the length Tags: list, haskell, pattern-matching Problem: How to match the rest of the list, no matter the length I want to write a function which takes a list of String s with pattern matching. Fo...

How to match the rest of the list, no matter the length How to match the rest of the list, no matter the length list haskell pattern-matching How Either Command Right Left How to match the rest of the list, no matter the length I want to write a function which takes a list of String s with pattern matching. For example...

[ -0.010009765625, 0.01531982421875, 0.0015411376953125, 0.0113525390625, 0.002899169921875, 0.007049560546875, -0.0107421875, 0.01080322265625, 0.0238037109375, 0.0137939453125, 0.0242919921875, -0.00775146484375, 0.00946044921875, -0.0037078857421875, -0.00860595703125, 0.0009193420410...

[ 11249, 47, 14858, 10588, 111, 5303, 26866, 140909, 110, 1556, 142508, 103510, 98753, 9319, 123573, 90911, 636, 2480, 3444, 33022, 32354, 51776, 23351, 214, 91, 678, 12765, 166117, 5423, 366, 184, 7614, 9405, 3509, 19770, 27494, 43581, 51515, ...

[ 0.0838623046875, 0.04266357421875, 0.258056640625, 0.127197265625, 0.05615234375, 0.1727294921875, 0.06964111328125, 0.1146240234375, 0.008026123046875, 0.1148681640625, 0.19970703125, 0.19775390625, 0.2188720703125, 0.04736328125, 0.187255859375, 0.0986328125, 0.03131103515625, 0....

embed

10197712_c0

10197712

haskell

0

Title: How to upgrade gtk2hsC2hs? Problem title: How to upgrade gtk2hsC2hs? Tags: glib, cabal, haskell, gtk2hs, gtk Problem: How to upgrade gtk2hsC2hs? I am trying cabal install glib-0.12.3 under my Ubuntu 11.10 using cabal-install 0.10.2. However, it shows the following error messages: setup: The program gtk2hsC2hs ve...

How to upgrade gtk2hsC2hs? How to upgrade gtk2hsC2hs? glib cabal haskell gtk2hs gtk How gtk2hsC2hs glib-0.12.3 Error ExitFailure gtk2hs How to upgrade gtk2hsC2hs? I am trying cabal install glib-0.12.3 under my Ubuntu 11.10 using cabal-install 0.10.2. However, it shows the following error messages: After half an hour's ...

[ -0.00836181640625, 0.02734375, -0.00183868408203125, 0.004852294921875, 0.01251220703125, 0.01239013671875, -0.00799560546875, 0.000335693359375, 0.00811767578125, 0.01190185546875, 0.0062255859375, -0.06640625, 0.004730224609375, -0.0157470703125, -0.005767822265625, -0.00759887695312...

[ 11249, 47, 116086, 706, 31472, 304, 127, 7, 441, 1978, 275, 109524, 1556, 142508, 102014, 120883, 212059, 5443, 217, 17647, 379, 3408, 31577, 20600, 1379, 116890, 4541, 963, 17368, 80383, 107754, 133684, 25632, 18499, 89914, 23552, 56816, 339...

[ 0.099609375, 0.06658935546875, 0.24169921875, 0.09246826171875, 0.2037353515625, 0.14599609375, 0.1815185546875, 0.116455078125, 0.051666259765625, 0.2037353515625, 0.210693359375, 0.2529296875, 0.1297607421875, 0.2208251953125, 0.140380859375, 0.191162109375, 0.1546630859375, 0.14...

embed

12120507_c0

12120507

haskell

0

Title: Ambiguous Types, and Defaults for Overloaded Numeric Operations Problem title: Ambiguous Types, and Defaults for Overloaded Numeric Operations Tags: haskell Problem: Ambiguous Types, and Defaults for Overloaded Numeric Operations import Data.Dynamic default(Integer,Double) a :: Num a => a a = 5 -- show :: Show a...

Ambiguous Types, and Defaults for Overloaded Numeric Operations Ambiguous Types, and Defaults for Overloaded Numeric Operations haskell Data.Dynamic Ambiguous Types Defaults Overloaded Numeric Operations Integer Double Num Show Typeable Dynamic LINE WORKS WELL LEADS TYPE ERROR Ambiguous Types, and Defaults for Overload...

[ 0.021240234375, -0.00250244140625, 0.0021209716796875, 0.0291748046875, 0.004913330078125, -0.00013637542724609375, -0.01904296875, -0.002349853515625, -0.007110595703125, 0.00019931793212890625, -0.03759765625, -0.04638671875, 0.004119873046875, 0.001953125, 0.004852294921875, 0.00473...

[ 10250, 12282, 10821, 60457, 136, 262, 1021, 7136, 100, 9578, 63033, 297, 93511, 102203, 1556, 142508, 11809, 29673, 21068, 44401, 107172, 52782, 17367, 2886, 73327, 130028, 231355, 56051, 110376, 95267, 151206, 18, 28219, 15400, 5117, 24931, 11...

[ 0.158203125, 0.2288818359375, 0.1409912109375, 0.22119140625, 0.0615234375, 0.07366943359375, 0.1453857421875, 0.1165771484375, 0.051055908203125, 0.1282958984375, 0.1651611328125, 0.043487548828125, 0.08721923828125, 0.18017578125, 0.10205078125, 0.2139892578125, 0.103759765625, 0...

embed

1465426_c0

1465426

haskell

0

Title: Libraries "rt" and "dl" in Cygwin Problem title: Libraries "rt" and "dl" in Cygwin Tags: cygwin, haskell, static-libraries Problem: Libraries "rt" and "dl" in Cygwin Perhaps this is stupid but I'm unable to find out which package I have to install in Cygwin to fix the foll...

Libraries "rt" and "dl" in Cygwin Libraries "rt" and "dl" in Cygwin cygwin haskell static-libraries Libraries Cygwin config.status unix.buildinfo HsUnixConfig.h cabal.exe Missing HsUnix.h Libraries "rt" and "dl" in Cygwin Perhaps this is stupid but I'm unable to find out which pa...

[ 0.00823974609375, 0.003570556640625, 0.0234375, -0.02099609375, -0.0045166015625, 0.006317138671875, 0.0002727508544921875, 0.01275634765625, -0.003875732421875, -0.00933837890625, -0.0186767578125, -0.022216796875, -0.006439208984375, 0.0225830078125, 0.000301361083984375, -0.01135253...

[ 165867, 10484, 3198, 136, 20469, 23, 27939, 177, 9494, 19932, 1556, 142508, 201939, 150, 2844, 153837, 45215, 51, 4084, 177149, 7319, 572, 7, 85600, 83671, 127, 109524, 46480, 16771, 425, 110833, 2886, 7413, 98169, 765, 20600, 30022, 132283, ...

[ 0.234619140625, 0.194091796875, 0.21142578125, 0.07366943359375, 0.1817626953125, 0.046875, 0.141357421875, 0.11962890625, 0.266357421875, 0.080078125, 0.0966796875, 0.223388671875, 0.1590576171875, 0.11669921875, 0.1920166015625, 0.1361083984375, 0.0849609375, 0.0435791015625, 0...

embed

53470725_c0

53470725

haskell

0

Title: Parse error on input ‘module’ when importing a module Problem title: Parse error on input ‘module’ when importing a module Tags: compiler-errors, haskell Problem: Parse error on input ‘module’ when importing a module This is the source code of the file Solitaire.hs: import MergeSort module Solitaire where a :: I...

Parse error on input ‘module’ when importing a module Parse error on input ‘module’ when importing a module compiler-errors haskell MergeSort Parse Solitaire Solitaire.hs:3:1 Failed Parse error on input ‘module’ when importing a module This is the source code of the file Solitaire.hs: MergeSort.hs and Solitaire.hs are ...

[ -0.00119781494140625, 0.00946044921875, -0.0218505859375, 0.0181884765625, -0.005218505859375, 0.0181884765625, 0.011474609375, -0.0108642578125, -0.0004024505615234375, -0.03662109375, -0.030517578125, 0.00494384765625, 0.01068115234375, -0.01263427734375, -0.000934600830078125, -0.00...

[ 2392, 184, 18499, 107730, 83279, 13, 24927, 214, 88996, 9969, 34759, 188800, 1556, 142508, 6035, 429, 158240, 18, 124725, 44386, 127, 363, 19721, 190355, 31344, 18151, 11435, 5701, 14364, 17686, 318, 31577, 72367, 151134, 75101, 63033, 7, 193...

[ 0.1343994140625, 0.1387939453125, 0.1778564453125, 0.14892578125, 0.1583251953125, 0.05621337890625, 0.2113037109375, 0.08282470703125, 0.20703125, 0.0498046875, 0.050689697265625, 0.1314697265625, 0.0987548828125, 0.1942138671875, 0.1668701171875, 0.150146484375, 0.2109375, 0.0570...

embed

27773779_c0

27773779

haskell

0

Title: Implementing List#flatten in Haskell Problem title: Implementing List#flatten in Haskell Tags: scala, haskell Problem: Implementing List#flatten in Haskell Scala offers a List#flatten method for going from List[Option[A]] to List[A] . scala> val list = List(Some(10), None) list: List[Option[Int]] = List(Some(10)...

Implementing List#flatten in Haskell Implementing List#flatten in Haskell scala haskell Implementing List Haskell Option Some None list.flatten res11 Maybe Just Nothing Implementing List#flatten in Haskell Scala offers a List#flatten method for going from List[Option[A]] to List[A] . I attempted to implement it in Hask...

[ 0.000171661376953125, 0.01904296875, 0.021728515625, -0.008544921875, 0.007476806640625, 0.0023040771484375, 0.00994873046875, -0.01324462890625, -0.005706787109375, 0.02294921875, -0.00372314453125, -0.006103515625, -0.00347900390625, 0.001068115234375, -0.004364013671875, 0.008544921...

[ 153941, 32036, 4904, 150632, 510, 20625, 142508, 23, 146232, 1556, 86769, 31384, 438, 5303, 3332, 1662, 83425, 9563, 182747, 152653, 11, 55300, 7730, 1295, 39029, 284, 47, 81887, 29479, 2301, 18, 1884, 15824, 706, 83, 2878, 289, 351, 188, ...

[ 0.16455078125, 0.2003173828125, 0.10986328125, 0.1883544921875, 0.232421875, 0.128173828125, 0.2264404296875, 0.0141143798828125, 0.146728515625, 0.1097412109375, 0.17431640625, 0.05194091796875, 0.078369140625, 0.160400390625, 0.049072265625, 0.08740234375, 0.0841064453125, 0.0333...

embed

28567722_c0

28567722

haskell

0

Title: No space concatenating with an empty doc in wl-pprint Problem title: No space concatenating with an empty doc in wl-pprint Tags: pretty-print, haskell Problem: No space concatenating with an empty doc in wl-pprint I'm using wl-pprint to output a data type with its fields rendered and separated with spaces. Some ...

No space concatenating with an empty doc in wl-pprint No space concatenating with an empty doc in wl-pprint pretty-print haskell Nothing Doc No space concatenating with an empty doc in wl-pprint I'm using wl-pprint to output a data type with its fields rendered and separated with spaces. Some of the fields can be Nothi...

[ -0.01275634765625, -0.007354736328125, -0.00135040283203125, 0.01470947265625, -0.0255126953125, 0.00531005859375, 0.0034637451171875, -0.029296875, 0.00787353515625, 0.0185546875, 0.0169677734375, -0.01318359375, -0.019287109375, -0.01507568359375, -0.008544921875, -0.0011444091796875...

[ 438, 32628, 158, 4460, 33, 678, 201505, 51584, 148, 141, 254, 35662, 28875, 1556, 142508, 182747, 29048, 23, 140992, 2053, 10644, 44457, 79516, 84797, 831, 89159, 3444, 15190, 4173, 11737, 79315, 72546, 177099, 78934, 35773, 1328, 39933, 237,...

[ 0.081298828125, 0.228515625, 0.03240966796875, 0.1134033203125, 0.045166015625, 0.04388427734375, 0.2078857421875, 0.1671142578125, 0.03143310546875, 0.095458984375, 0.051300048828125, 0.197509765625, 0.111572265625, 0.0794677734375, 0.162109375, 0.1514892578125, 0.1630859375, 0.03...

embed

28658485_c1

28658485

haskell

1

Col $ lsToRGB $ wordsWhen (==',') str where -- could also use splitOn wordsWhen :: (Char -> Bool) -> String -> [String] wordsWhen p s = case dropWhile p s of "" -> [] s' -> w : wordsWhen p s'' where (w, s'') = break p s' -- take a list of strings and make a triple of ints lsToRGB :: [String] -> (Int,Int,Int) lsToRGB (a...

[ -0.0191650390625, -0.017333984375, -0.0028533935546875, 0.0322265625, -0.000698089599609375, 0.0286865234375, 0.010986328125, -0.00811767578125, 0.003662109375, 0.0091552734375, -0.0026702880859375, -0.019775390625, 0.031982421875, -0.00347900390625, -0.026611328125, 0.007232666015625,...

[ 11554, 3650, 96, 7, 7763, 1052, 8359, 34153, 186048, 69112, 25, 7704, 7440, 4210, 5809, 4527, 65450, 20320, 1984, 84068, 33079, 2460, 929, 23351, 214, 71713, 915, 91, 7225, 36069, 979, 111, 148, 4765, 434, 2203, 36356, 5646, 5303, 79315, ...

[ 0.25048828125, 0.1375732421875, 0.084228515625, 0.037445068359375, 0.20751953125, 0.1231689453125, 0.231201171875, 0.1944580078125, 0.2069091796875, 0.1697998046875, 0.119873046875, 0.1806640625, 0.112548828125, 0.04681396484375, 0.045867919921875, 0.09454345703125, 0.1556396484375, ...

embed

70924797_c1

70924797

haskell

1

901s elapsed) by changing the update function to this: update g k = runIdentity $ Map.traverseWithKey (\i jmap -> pure $ shortmap i jmap) g Why does using traverseWithKey in the Identity monad speed up performance? I checked the IntMap source code but couldn't figure out the reason. Is this a bug or the expected behavi...

[ -0.013427734375, 0.0166015625, 0.0086669921875, -0.00714111328125, -0.0025787353515625, 0.004180908203125, -0.004119873046875, 0.00872802734375, -0.01123046875, -0.01422119140625, 0.0194091796875, 0.03271484375, -0.017822265625, 0.014892578125, 0.003204345703125, 0.0126953125, 0.0072...

[ 189202, 7, 127966, 71, 151134, 28350, 32354, 903, 706, 472, 11675, 568, 37379, 2481, 42719, 1517, 37676, 194583, 162429, 1647, 62346, 34166, 16610, 44084, 14602, 17368, 37317, 13, 71257, 2667, 712, 38352, 1257, 23718, 360, 18, 166179, 31344, ...

[ 0.26025390625, 0.0271453857421875, 0.116943359375, 0.0206298828125, 0.1160888671875, 0.175048828125, 0.11328125, 0.040130615234375, 0.0775146484375, 0.087646484375, 0.1015625, 0.033203125, 0.1875, 0.1207275390625, 0.1494140625, 0.072265625, 0.17578125, 0.19970703125, 0.2514648437...

embed

42396730_c0

42396730

haskell

0

Title: Removing the usage of fromJust Problem title: Removing the usage of fromJust Tags: haskell, option-type, refactoring Problem: Removing the usage of fromJust Say, I have some code like this: data Record = Record { validate :: Maybe Bool, mobile :: Text } someFunction :: Monad m => m () someFunction = do (record :...

Removing the usage of fromJust Removing the usage of fromJust haskell option-type refactoring Removing Record Maybe Bool Text Monad Just Nothing Removing the usage of fromJust Say, I have some code like this: Now when hasValidate has some value of Just _ , I can know for sure that record isn't Nothing . Is there a way ...

[ -0.00653076171875, 0.019287109375, 0.01422119140625, 0.00494384765625, 0.004302978515625, 0.00689697265625, 0.005889892578125, 0.0194091796875, -0.00250244140625, -0.03564453125, 0.00811767578125, -0.02197265625, 0.000667572021484375, 0.004058837890625, -0.006439208984375, -0.001365661...

[ 853, 432, 6496, 127689, 111, 1295, 127794, 1556, 142508, 35829, 50986, 456, 144810, 54877, 83425, 2460, 929, 24129, 60331, 71, 9563, 182747, 25916, 18151, 42272, 1683, 67, 34292, 101, 3714, 9077, 17164, 56112, 18, 3917, 87388, 15490, 48716, ...

[ 0.005096435546875, 0.1400146484375, 0.011138916015625, 0.1715087890625, 0.03326416015625, 0.237060546875, 0.212646484375, 0.1790771484375, 0.219482421875, 0.184814453125, 0.06793212890625, 0.02215576171875, 0.1417236328125, 0.1641845703125, 0.061309814453125, 0.050811767578125, 0.131...

embed