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
31251163_c0	31251163	haskell	0	Title: What is the FlexibleContexts extension good for? Could you please explain it using a simple example? Problem title: What is the FlexibleContexts extension good for? Could you please explain it using a simple example? Tags: haskell, ghc Problem: What is the FlexibleContexts extension good for? Could you please ex...	What is the FlexibleContexts extension good for? Could you please explain it using a simple example? What is the FlexibleContexts extension good for? Could you please explain it using a simple example? haskell ghc a What FlexibleContexts Could What is the FlexibleContexts extension good for? Could you please explain it...	[ 0.00860595703125, 0.002593994140625, 0.0240478515625, 0.008056640625, -0.01483154296875, -0.004486083984375, -0.011474609375, -0.00127410888671875, 0.0093994140625, -0.0157470703125, 0.00921630859375, -0.0390625, -0.016845703125, 0.01953125, -0.01092529296875, -0.016357421875, 0.0120...	[ 4865, 83, 180842, 2661, 11935, 22829, 7, 111938, 4127, 100, 191147, 22936, 73342, 8781, 27781, 70, 1556, 142508, 31380, 238, 10, 442, 17368, 28219, 20594, 67573, 12301, 19917, 66882, 46754, 78688, 2367, 903, 14602, 15400, 32316, 5608, 4527, ...	[ 0.0767822265625, 0.02093505859375, 0.2266845703125, 0.179931640625, 0.1217041015625, 0.2193603515625, 0.079345703125, 0.182861328125, 0.15185546875, 0.1243896484375, 0.14404296875, 0.000640869140625, 0.105712890625, 0.055328369140625, 0.111083984375, 0.00933837890625, 0.108154296875,...	embed
19619377_c0	19619377	haskell	0	Title: Can't get Data.List functions to work in haskell Problem title: Can't get Data.List functions to work in haskell Tags: ghci, haskell Problem: Can't get Data.List functions to work in haskell I'm building a haskell program, and I want to use the library Data.List. So at the top of my program I've added ...	Can't get Data.List functions to work in haskell Can't get Data.List functions to work in haskell ghci haskell Data.List Can Data.List.isAlpha Not Data.List.nub Can't get Data.List functions to work in haskell I'm building a haskell program, and I want to use the library Data.List. So at the top of my program...	[ 0, 0.00096893310546875, 0.01092529296875, 0.00616455078125, -0.00537109375, 0.0145263671875, 0.023681640625, 0.00193023681640625, 0.01348876953125, -0.0257568359375, -0.00775146484375, -0.03759765625, 0.01385498046875, 0.00408935546875, -0.022705078125, -0.0072021484375, 0.0023651123...	[ 4171, 3768, 18, 2046, 11809, 5, 154663, 32354, 7, 47, 4488, 23, 1556, 142508, 31380, 318, 164, 6210, 14612, 11205, 19, 5829, 33976, 1528, 3444, 4527, 35773, 1294, 2663, 49814, 24927, 35064, 10644, 1022, 9969, 1340, 18499, 70820, 1135, 157...	[ 0.08319091796875, 0.08892822265625, 0.07781982421875, 0.1002197265625, 0.197265625, 0.092529296875, 0.28955078125, 0.24755859375, 0.0419921875, 0.0491943359375, 0.149658203125, 0.07366943359375, 0.1510009765625, 0.27099609375, 0.0684814453125, 0.10498046875, 0.1192626953125, 0.1265...	embed
20066831_c0	20066831	haskell	0	Title: how to return an entire list using a function that removes redundant students from the list Problem title: how to return an entire list using a function that removes redundant students from the list Tags: haskell Problem: how to return an entire list using a function that removes redundant students from the list...	how to return an entire list using a function that removes redundant students from the list how to return an entire list using a function that removes redundant students from the list haskell a the Data.List CourseData Bsc280 Sylvee Bsc209 Bsc205 x:xs how to return an entire list using a function that removes redundant...	[ -0.005126953125, 0.01007080078125, 0.0036773681640625, 0.0147705078125, -0.0067138671875, -0.003997802734375, -0.000713348388671875, -0.003814697265625, 0.007720947265625, -0.01348876953125, -0.0166015625, 0.006072998046875, 0.0201416015625, 0.005584716796875, -0.025146484375, 0.019775...	[ 3642, 47, 30646, 64194, 5303, 17368, 32354, 87388, 7, 4842, 35405, 18, 25921, 1295, 1556, 142508, 70, 11809, 154663, 154162, 137989, 10382, 88628, 100973, 7039, 1126, 143422, 2967, 14194, 239825, 693, 254, 3444, 125663, 756, 15490, 171763, 28...	[ 0.0721435546875, 0.0238494873046875, 0.2347412109375, 0.169189453125, 0.2135009765625, 0.0819091796875, 0.2022705078125, 0.1417236328125, 0.033203125, 0.095703125, 0.2005615234375, 0.0858154296875, 0.208740234375, 0.0570068359375, 0.07232666015625, 0.1942138671875, 0.0204925537109375...	embed
74305406_c0	74305406	haskell	0	Title: How to use a vector to cache results within a Haskell function? Problem title: How to use a vector to cache results within a Haskell function? Tags: memoization, haskell Problem: How to use a vector to cache results within a Haskell function? I have a computationally expensive vector I want to index into inside ...	How to use a vector to cache results within a Haskell function? How to use a vector to cache results within a Haskell function? memoization haskell How Haskell How to use a vector to cache results within a Haskell function? I have a computationally expensive vector I want to index into inside a function, but since the ...	[ 0.0010986328125, 0.002838134765625, -0.003021240234375, -0.0023193359375, 0.011474609375, -0.00506591796875, 0.01025390625, -0.001434326171875, 0.0035400390625, -0.034912109375, -0.00994873046875, 0.0150146484375, -0.0228271484375, 0.0223388671875, 0.01544189453125, 0.01611328125, -0...	[ 11249, 4527, 173, 18770, 47, 82365, 50339, 28032, 20625, 142508, 32354, 163, 432, 47691, 1556, 10, 181135, 135587, 3444, 63262, 3934, 46132, 23180, 8306, 11814, 151107, 27875, 10932, 17203, 118562, 65970, 142424, 29367, 6528, 156672, 27781, 195...	[ 0.0811767578125, 0.115966796875, 0.1959228515625, 0.234619140625, 0.044189453125, 0.244873046875, 0.1787109375, 0.1220703125, 0.1300048828125, 0.239501953125, 0.1678466796875, 0.1005859375, 0.1357421875, 0.106689453125, 0.1212158203125, 0.0361328125, 0.0167236328125, 0.12646484375,...	embed
44349534_c0	44349534	haskell	0	Title: Extraction IO data inside other Monad Problem title: Extraction IO data inside other Monad Tags: monads, ios, haskell Problem: Extraction IO data inside other Monad I am using HDBC-Sqlite3, I would like to make queries depending on the page I am in. And I would like to get the data out of the IO Monad. It should...	Extraction IO data inside other Monad Extraction IO data inside other Monad monads ios haskell definitions Extraction Monad connectSqlite3 test.db SELECT Here Mathskell.Views.Read.render Extraction IO data inside other Monad I am using HDBC-Sqlite3, I would like to make queries depending on the page I am in. And I woul...	[ -0.00982666015625, 0.03173828125, 0.00897216796875, 0.007568359375, 0.021728515625, 0.01318359375, -0.00762939453125, -0.007781982421875, 0.00090789794921875, -0.07080078125, 0.012939453125, -0.061767578125, -0.021240234375, -0.02001953125, 0.0019683837890625, -0.00171661376953125, -...	[ 31501, 10763, 17780, 2053, 46132, 3789, 60331, 71, 2667, 712, 17, 232, 1556, 142508, 80934, 37067, 95255, 67, 363, 3034, 48073, 6755, 144832, 11853, 78804, 100474, 31345, 18280, 17368, 4732, 24318, 1884, 41, 96819, 9191, 2046, 1810, 111, 77...	[ 0.1983642578125, 0.11181640625, 0.243408203125, 0.1865234375, 0.1607666015625, 0.130126953125, 0.209228515625, 0.1815185546875, 0.1129150390625, 0.133544921875, 0.0601806640625, 0.13671875, 0.1009521484375, 0.2423095703125, 0.08209228515625, 0.1092529296875, 0.1597900390625, 0.1796...	embed
44608214_c1	44608214	haskell	1	of lazy bytestrings (by replacing Data.ByteString.Lazy with Data.ByteString ), this problem does not occur anymore . I'd like to understand that. Any explanation? (I would particularly like to know how to solve this issue but still using lazy bytestrings) EDIT To be perhaps more precise, the problem still occurs with ...	of lazy bytestrings (by replacing Data.ByteString.Lazy with Data.ByteString ), this problem does not occur anymore . I'd like to understand that. Any explanation? (I would particularly like to know how to solve this issue but still using lazy bytestrings) EDIT To be perhaps more precise, the problem still occurs with ...	[ 0.01318359375, 0.0157470703125, -0.0166015625, -0.003448486328125, -0.0011444091796875, 0.01708984375, 0.00164794921875, 0.00372314453125, 0.00927734375, 0.004119873046875, 0.00701904296875, 0.017822265625, -0.001556396484375, 0.0177001953125, 0.00823974609375, -0.003265380859375, 0....	[ 111, 21, 3285, 390, 6954, 46828, 456, 133266, 11809, 75358, 67, 71713, 214, 2729, 5, 903, 2967, 14602, 959, 74918, 176683, 1884, 28219, 187136, 106480, 86869, 31089, 7464, 17368, 172864, 134995, 678, 1528, 24927, 217225, 237, 90944, 48097, ...	[ 0.05389404296875, 0.1634521484375, 0.2489013671875, 0.10687255859375, 0.11669921875, 0.2076416015625, 0.030303955078125, 0.1072998046875, 0.132080078125, 0.0892333984375, 0.11279296875, 0.2059326171875, 0.0662841796875, 0.1768798828125, 0.005767822265625, 0.052032470703125, 0.1510009...	embed
78866826_c0	78866826	haskell	0	Title: TVar that blocks read until change? Problem title: TVar that blocks read until change? Tags: haskell, concurrency Problem: TVar that blocks read until change? I'm trying to wrap my head around how to correctly communicate between threads in Haskell. I have multiple threads that read some state, and whenever it c...	TVar that blocks read until change? TVar that blocks read until change? haskell concurrency TVar TVar that blocks read until change? I'm trying to wrap my head around how to correctly communicate between threads in Haskell. I have multiple threads that read some state, and whenever it changes they need to do some updat...	[ -0.01153564453125, 0.0067138671875, 0.001068115234375, -0.0028076171875, 0.020751953125, 0.004058837890625, 0.0096435546875, 0.00994873046875, 0.008056640625, -0.0206298828125, 0.01416015625, 0.005218505859375, 0.01287841796875, 0.017578125, -0.003448486328125, 0.017333984375, 0.0109...	[ 1910, 147, 450, 46389, 7, 12301, 24189, 15549, 32, 1556, 142508, 108636, 982, 137565, 26785, 127219, 17721, 86997, 20625, 48716, 11341, 217684, 65572, 28350, 831, 54811, 66160, 3229, 32562, 4734, 1632, 2965, 13580, 14037, 33022, 47, 43581, 12...	[ 0.1793212890625, 0.2225341796875, 0.061279296875, 0.21533203125, 0.0147247314453125, 0.2159423828125, 0.190673828125, 0.2103271484375, 0.001129150390625, 0.11572265625, 0.23876953125, 0.143798828125, 0.0670166015625, 0.0111083984375, 0.03900146484375, 0.1016845703125, 0.039794921875,...	embed
29881538_c1	29881538	haskell	1	runStateT (runZipperT_ computation) (ZipperState left right) return (x, (left', right')) it's works and I can compose with other monads import Control.Monad.Identity import Control.Monad.State import ZipperT length' :: [a] -> Int length' xs = runIdentity (execStateT (runZipperT contar ([], xs)) 0) where contar = headR...	runStateT (runZipperT_ computation) (ZipperState left right) return (x, (left', right')) it's works and I can compose with other monads import Control.Monad.Identity import Control.Monad.State import ZipperT length' :: [a] -> Int length' xs = runIdentity (execStateT (runZipperT contar ([], xs)) 0) where contar = headR...	[ -0.0167236328125, 0.0198974609375, -0.00897216796875, 0.0164794921875, -0.00046539306640625, 0.01385498046875, -0.0037689208984375, -0.01239013671875, 0.0074462890625, -0.052490234375, 0.00823974609375, 0.0247802734375, 0.00848388671875, 0.02294921875, 0.004608154296875, -0.00238037109...	[ 11675, 135206, 13, 618, 16428, 60348, 8079, 454, 181135, 25737, 7108, 30646, 425, 2480, 25, 442, 43240, 831, 150350, 678, 3789, 2667, 712, 24927, 27131, 46674, 37379, 2481, 9315, 140909, 18, 1022, 568, 46480, 24505, 757, 10336, 1052, 7225, ...	[ 0.1458740234375, 0.21630859375, 0.10546875, 0.1951904296875, 0.1107177734375, 0.1861572265625, 0.199951171875, 0.022491455078125, 0.15771484375, 0.0938720703125, 0.1363525390625, 0.1634521484375, 0.06109619140625, 0.1153564453125, 0.013946533203125, 0.008758544921875, 0.1126708984375...	embed
55810774_c1	55810774	haskell	1	go xs go [] = 1 randomInts :: Int -> StdGen -> [Int] randomInts k g = let result = take k (randoms g) in force result `seq` result testFunction = parSort main = do args <- getArgs let count \| null args = 500000 \| otherwise = read (head args) input <- randomInts count `fmap` getStdGen start <- getCurrentTime let sorted...	go xs go [] = 1 randomInts :: Int -> StdGen -> [Int] randomInts k g = let result = take k (randoms g) in force result `seq` result testFunction = parSort main = do args <- getArgs let count \| null args = 500000 \| otherwise = read (head args) input <- randomInts count `fmap` getStdGen start <- getCurrentTime let sorted...	[ -0.01397705078125, 0.01007080078125, -0.005615234375, -0.034912109375, -0.002960205078125, -0.0025634765625, -0.000492095947265625, -0.02099609375, -0.0113525390625, -0.022705078125, 0.00408935546875, 0.031982421875, 0.005126953125, -0.0078125, 0, -0.0194091796875, 0.0013580322265625...	[ 738, 1022, 7, 2203, 106, 96759, 4153, 933, 1984, 360, 18, 2907, 71, 105376, 472, 706, 2633, 16750, 5646, 46258, 16, 37772, 184, 864, 3034, 97249, 366, 158240, 5201, 79459, 54529, 56574, 2101, 9508, 120262, 12301, 31251, 107730, 62346, 374...	[ 0.1822509765625, 0.1356201171875, 0.111572265625, 0.0204010009765625, 0.03289794921875, 0.197509765625, 0.09454345703125, 0.1204833984375, 0.00396728515625, 0.04302978515625, 0.043365478515625, 0.137939453125, 0.0166473388671875, 0.1429443359375, 0.05584716796875, 0.0816650390625, 0....	embed
15766904_c1	15766904	haskell	1	type classes are: -- \|Full generational replacement selection protocol fullGenerational :: (Phenotype b) => (Int -> [b] -> IO [(b, b)]) -> --Selection mechanism Int -> --Elitism Int -> --The number of children to create Double -> --Crossover rate Double -> --Mutation rate [b] -> --Population to select from IO [b] --Th...	type classes are: -- \|Full generational replacement selection protocol fullGenerational :: (Phenotype b) => (Int -> [b] -> IO [(b, b)]) -> --Selection mechanism Int -> --Elitism Int -> --The number of children to create Double -> --Crossover rate Double -> --Mutation rate [b] -> --Population to select from IO [b] --Th...	[ -0.006317138671875, 0.00897216796875, 0.006805419921875, 0.004241943359375, -0.029296875, 0.007293701171875, -0.00732421875, -0.031982421875, 0.009521484375, -0.00628662109375, 0.00049591064453125, -0.00157928466796875, -0.0269775390625, -0.014892578125, -0.00160980224609375, -0.013549...	[ 10644, 61112, 621, 12, 4210, 6, 58745, 121962, 58093, 289, 91995, 674, 132216, 91363, 4393, 135932, 30494, 1984, 45689, 21004, 50986, 876, 4153, 17780, 275, 104475, 58994, 191619, 360, 18, 7623, 23240, 39, 14012, 20020, 28282, 107172, 3666, ...	[ 0.2841796875, 0.286376953125, 0.119384765625, 0.02960205078125, 0.03668212890625, 0.000335693359375, 0.0276336669921875, 0.1533203125, 0.1876220703125, 0.121826171875, 0.192138671875, 0.059326171875, 0.2181396484375, 0.219970703125, 0.19091796875, 0.1319580078125, 0.1060791015625, ...	embed
42578331_c0	42578331	haskell	0	Title: Aeson: parse JSON with unknown key in Haskell Problem title: Aeson: parse JSON with unknown key in Haskell Tags: ghc, haskell, aeson Problem: Aeson: parse JSON with unknown key in Haskell I would like to parse the following JSON using Aeson in Haskell: { "foo": { "name": "name 1", "location": "location 1" }, "ba...	Aeson: parse JSON with unknown key in Haskell Aeson: parse JSON with unknown key in Haskell ghc haskell aeson Aeson JSON Haskell Entry Show FromJSON Object Aeson: parse JSON with unknown key in Haskell I would like to parse the following JSON using Aeson in Haskell: The keys name and location are known, but foo and bar...	[ -0.0023345947265625, -0.009033203125, -0.002899169921875, 0.005126953125, -0.007537841796875, 0.00177001953125, 0.00469970703125, 0.0126953125, -0.00830078125, -0.00811767578125, -0.0140380859375, 0.0142822265625, 0.013427734375, 0.003143310546875, -0.0020599365234375, -0.0089721679687...	[ 62, 90, 191, 12, 366, 184, 821, 58627, 678, 51, 69723, 19, 22799, 20625, 142508, 23, 31380, 238, 1556, 10, 357, 15123, 17367, 28090, 1375, 134549, 1884, 25632, 17368, 9351, 136, 31913, 51529, 1284, 5775, 31, 1909, 621, 72367, 2053, 237,...	[ 0.12890625, 0.151123046875, 0.196044921875, 0.001922607421875, 0.1402587890625, 0.11376953125, 0.149169921875, 0.2298583984375, 0.0687255859375, 0.0931396484375, 0.203369140625, 0.04449462890625, 0.184814453125, 0.140380859375, 0.2225341796875, 0.04376220703125, 0.057861328125, 0.0...	embed
14077219_c0	14077219	haskell	0	Title: How to parse uncertain data from JSON in Haskell? Problem title: How to parse uncertain data from JSON in Haskell? Tags: parsing, json, haskell Problem: How to parse uncertain data from JSON in Haskell? I used the answer in json_answer (Text.JSON package) and I've got a generic json Haskell data type. It's ok to...	How to parse uncertain data from JSON in Haskell? How to parse uncertain data from JSON in Haskell? parsing json haskell JSON How Haskell JSObject JSONObject JSString JSONString www.example.com How to parse uncertain data from JSON in Haskell? I used the answer in json_answer (Text.JSON package) and I've got a generic ...	[ -0.01287841796875, 0.026611328125, 0.01287841796875, 0.0189208984375, -0.00148773193359375, 0.018310546875, 0.005523681640625, -0.00482177734375, -0.013916015625, -0.0118408203125, -0.0162353515625, -0.022216796875, 0.00897216796875, -0.003936767578125, -0.0006103515625, 0.00537109375,...	[ 11249, 366, 184, 51, 106290, 73, 2053, 1295, 821, 58627, 23, 20625, 142508, 6953, 1647, 1681, 1556, 13055, 75161, 2852, 71713, 35166, 10133, 6488, 174379, 1375, 98169, 189534, 10644, 3664, 61924, 114122, 24233, 83, 57553, 62, 61687, 44457, ...	[ 0.043975830078125, 0.17431640625, 0.1173095703125, 0.1451416015625, 0.254150390625, 0.104248046875, 0.1522216796875, 0.09698486328125, 0.1424560546875, 0.224365234375, 0.06646728515625, 0.1492919921875, 0.2386474609375, 0.063232421875, 0.1094970703125, 0.158447265625, 0.122314453125,...	embed
35918281_c1	35918281	haskell	1	menu database user menu :: [Film] -> String -> IO() menu database user = do putStrLn "This is the Main Menu" putStrLn "Choose one of the following options:" putStrLn "2. give all films in the database" putStrLn "Your Option:" functionSelected <- getLine if (read functionSelected :: Int) > 0 && (read functionSelected :...	menu database user menu :: [Film] -> String -> IO() menu database user = do putStrLn "This is the Main Menu" putStrLn "Choose one of the following options:" putStrLn "2. give all films in the database" putStrLn "Your Option:" functionSelected <- getLine if (read functionSelected :: Int) > 0 && (read functionSelected :...	[ 0.00072479248046875, -0.01611328125, 0.0023193359375, 0.0272216796875, -0.0185546875, -0.006927490234375, 0.00469970703125, -0.00885009765625, -0.007476806640625, -0.00933837890625, -0.0155029296875, -0.0289306640625, -0.000553131103515625, 0.00555419921875, 0.0081787109375, -0.0050659...	[ 8026, 63399, 38937, 102278, 23351, 214, 17780, 132, 54, 3884, 71713, 866, 19, 73243, 12321, 49434, 107522, 25632, 50717, 5442, 8337, 756, 54180, 86769, 32354, 100184, 2046, 93232, 2174, 39116, 757, 483, 19667, 35829, 37223, 28484, 97249, 4153...	[ 0.2410888671875, 0.190185546875, 0.1558837890625, 0.139892578125, 0.159912109375, 0.08392333984375, 0.1939697265625, 0.045440673828125, 0.009033203125, 0.0902099609375, 0.1292724609375, 0.0313720703125, 0.033416748046875, 0.05987548828125, 0.1087646484375, 0.237548828125, 0.003692626...	embed
36751906_c0	36751906	haskell	0	Title: Least common multiple without using gcd Problem title: Least common multiple without using gcd Tags: haskell Problem: Least common multiple without using gcd With gcd its fairly easy but i do not understand how to tie in all the functions to make it happen without. kgv :: Int -> Int -> Int kgv x y = abs ((x `quo...	Least common multiple without using gcd Least common multiple without using gcd haskell gcd Least prime_factors n-1 x:xs Least common multiple without using gcd With gcd its fairly easy but i do not understand how to tie in all the functions to make it happen without. I got this function to find the prime factors which...	[ -0.037353515625, 0.031005859375, 0.0019683837890625, -0.006256103515625, 0.0186767578125, 0.020751953125, 0.00109100341796875, -0.006866455078125, 0.01513671875, -0.01348876953125, 0.00885009765625, -0.02734375, 0.0162353515625, 0.007598876953125, -0.01123046875, 0.00078582763671875, ...	[ 636, 4438, 39210, 48716, 15490, 17368, 22109, 71, 1556, 142508, 20809, 144810, 653, 5759, 1022, 12, 425, 6863, 23468, 28219, 4817, 23, 32354, 53383, 7413, 120103, 43240, 20697, 51776, 38132, 14012, 1295, 1632, 5303, 12765, 2174, 98, 3789, 9...	[ 0.1011962890625, 0.177001953125, 0.1685791015625, 0.2264404296875, 0.1361083984375, 0.05633544921875, 0.16455078125, 0.183349609375, 0.10711669921875, 0.215087890625, 0.1429443359375, 0.2008056640625, 0.009613037109375, 0.11376953125, 0.06988525390625, 0.0269775390625, 0.084594726562...	embed
24151941_c0	24151941	haskell	0	Title: Aeson Prisms with "free" references Problem title: Aeson Prisms with "free" references Tags: aeson, haskell-lens, haskell Problem: Aeson Prisms with "free" references Just read the brilliant " Lens/Aeson Traversals/Prisms" article and have a real-world application. Given the following anonymi...	Aeson Prisms with "free" references Aeson Prisms with "free" references aeson haskell-lens haskell Aeson Prisms Locations Just Aeson Prisms with "free" references Just read the brilliant " Lens/Aeson Traversals/Prisms" article and have a real-world application. Given the following anonymized JSON st...	[ -0.0068359375, 0.01239013671875, -0.000751495361328125, 0.0029296875, -0.00022602081298828125, 0.00799560546875, 0.0007781982421875, 0.0126953125, 0.00016307830810546875, -0.0142822265625, 0.0147705078125, 0.052001953125, 0.0220947265625, -0.00653076171875, -0.006744384765625, -0.01879...	[ 62, 90, 191, 20204, 4432, 678, 32087, 91067, 10, 1556, 142508, 1977, 90788, 12301, 230451, 18226, 7, 284, 4937, 7864, 16765, 33163, 2773, 32554, 38415, 52184, 821, 58627, 45646, 3642, 2806, 87, 4067, 39, 1810, 42486, 43257, 3501, 29458, 3...	[ 0.09228515625, 0.1285400390625, 0.1710205078125, 0.2213134765625, 0.1817626953125, 0.0333251953125, 0.1656494140625, 0.2025146484375, 0.0277862548828125, 0.06610107421875, 0.1888427734375, 0.1209716796875, 0.1558837890625, 0.0836181640625, 0.08984375, 0.177001953125, 0.124755859375, ...	embed
38395117_c0	38395117	haskell	0	Title: Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? Problem title: Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? Tags: haskell Problem: Why does replacing the dollar sign ($) with parentheses in this expression leads to an ...	Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? haskell it Why Couldn Integer Relevant Possible Why does replacing the dollar sign ($) with parentheses in this expression leads to ...	[ -0.01202392578125, 0.005828857421875, 0.005828857421875, 0.00927734375, -0.020263671875, 0.007659912109375, -0.01092529296875, 0.0177001953125, 0.002197265625, -0.01409912109375, -0.006011962890625, -0.00933837890625, -0.00213623046875, 0.003204345703125, 0.005645751953125, -0.00074768...	[ 44084, 14602, 456, 133266, 15437, 24092, 4369, 678, 49129, 35412, 90, 125195, 37105, 47, 142, 18499, 7, 1556, 142508, 442, 191147, 19, 44401, 853, 133, 30624, 115861, 2661, 903, 6626, 18344, 7569, 9, 757, 22288, 90081, 56216, 80019, 3650, ...	[ 0.160400390625, 0.037445068359375, 0.0465087890625, 0.1343994140625, 0.2174072265625, 0.188720703125, 0.2294921875, 0.0540771484375, 0.1436767578125, 0.177734375, 0.1092529296875, 0.243408203125, 0.1455078125, 0.041748046875, 0.044677734375, 0.25146484375, 0.02783203125, 0.11889648...	embed
1897306_c1	1897306	haskell	1	can pass them to modifyX. Is there a nice clean way of solving this problem, or am I stuck with defining my own getters and setters? Put another way, is there a way of connecting the functions created by record syntax up with type classes (both the getters and setters)? EDIT Here's the real problem I'm trying to solve...	can pass them to modifyX. Is there a nice clean way of solving this problem, or am I stuck with defining my own getters and setters? Put another way, is there a way of connecting the functions created by record syntax up with type classes (both the getters and setters)? EDIT Here's the real problem I'm trying to solve...	[ -0.00592041015625, 0.004974365234375, -0.0019378662109375, -0.021240234375, -0.003509521484375, -0.01708984375, 0.000415802001953125, -0.0208740234375, 0.01123046875, -0.00096893310546875, -0.01611328125, 0.01116943359375, 0.00384521484375, 0.000682830810546875, -0.01904296875, -0.0044...	[ 831, 27875, 2856, 47, 2811, 40383, 1542, 26267, 46622, 3917, 3115, 2967, 13204, 10002, 2046, 23962, 136, 88685, 37067, 32354, 7, 75935, 17164, 6002, 86531, 10644, 61112, 2773, 31577, 86869, 32562, 10, 111, 62548, 103391, 4527, 12353, 5, 119...	[ 0.044769287109375, 0.1654052734375, 0.0601806640625, 0.0635986328125, 0.1500244140625, 0.1708984375, 0.17333984375, 0.00750732421875, 0.1025390625, 0.0254058837890625, 0.065673828125, 0.110107421875, 0.1116943359375, 0.0345458984375, 0.1282958984375, 0.1571044921875, 0.0604248046875,...	embed
71895399_c0	71895399	haskell	0	Title: haskell Differences in two words Problem title: haskell Differences in two words Tags: haskell, types, algorithm Problem: haskell Differences in two words I have 2 words with the same length, for example: "mother" and "father". My program should: a) if the letter in the x position in the first word is the same a...	haskell Differences in two words haskell Differences in two words haskell types algorithm Differences x:xs y:ys Couldn Char haskell Differences in two words I have 2 words with the same length, for example: "mother" and "father". My program should: a) if the letter in the x position in the first word is the same as in ...	[ 0.009765625, 0.0057373046875, -0.0078125, 0.01031494140625, 0.00323486328125, 0.005645751953125, -0.00701904296875, 0.003692626953125, -0.002716064453125, 0.0296630859375, 0.0128173828125, -0.022705078125, 0.01116943359375, -0.006866455078125, -0.0167236328125, 0.0115966796875, 0.019...	[ 1556, 142508, 803, 18234, 69098, 6626, 34153, 23, 52895, 234873, 1022, 12, 425, 7, 113, 4778, 191147, 21656, 765, 116, 5701, 140909, 432, 9319, 136, 1021, 2646, 1528, 5608, 2174, 31330, 19069, 5117, 2565, 17932, 24765, 6863, 3687, 876, 18...	[ 0.1728515625, 0.27294921875, 0.1107177734375, 0.189208984375, 0.05889892578125, 0.1292724609375, 0.204345703125, 0.012664794921875, 0.13037109375, 0.17236328125, 0.10418701171875, 0.029266357421875, 0.09649658203125, 0.009918212890625, 0.0699462890625, 0.1134033203125, 0.057800292968...	embed
45178189_c0	45178189	haskell	0	Title: GHC Prefer one specialization over another Problem title: GHC Prefer one specialization over another Tags: haskell, ghc Problem: GHC Prefer one specialization over another I have a Haskell typeclass function that looks like the following: class Foo m where foo :: Num a => m a -> a I want to generate two speciali...	GHC Prefer one specialization over another GHC Prefer one specialization over another haskell ghc GHC Prefer Foo Num SPECIALIZE GHC Prefer one specialization over another I have a Haskell typeclass function that looks like the following: I want to generate two specializations of foo , one for anytime that m ~ X Int and...	[ 0.016357421875, 0.0128173828125, -0.0023345947265625, -0.01708984375, -0.0040283203125, 0.0034942626953125, -0.004730224609375, -0.01348876953125, 0.0174560546875, 0.034423828125, -0.00408935546875, -0.0126953125, 0.005889892578125, 0.005157470703125, -0.00726318359375, 0.0137329101562...	[ 527, 73265, 176005, 1632, 5361, 47691, 645, 15700, 1556, 142508, 31380, 238, 9572, 31, 52782, 224343, 568, 19157, 87, 765, 20625, 10644, 67413, 32354, 33342, 1884, 25632, 3444, 139392, 6626, 179202, 17514, 5775, 2499, 347, 6780, 1193, 360, ...	[ 0.1090087890625, 0.219970703125, 0.219482421875, 0.0997314453125, 0.204345703125, 0.1474609375, 0.081298828125, 0.046417236328125, 0.13525390625, 0.2314453125, 0.1168212890625, 0.08526611328125, 0.1790771484375, 0.1986083984375, 0.1600341796875, 0.1888427734375, 0.05816650390625, 0...	embed
48043167_c0	48043167	haskell	0	Title: Why is <$> left associative? Problem title: Why is <$> left associative? Tags: apply, associativity, haskell Problem: Why is <$> left associative? fmap is also <$> because it is function application ( $ ) in the functor category. (+5) $ (10) $ 10 -- 105 (+5) <$> (10) <$> [1,2,3] -- [15,25,35] Then ...	Why is <$> left associative? Why is <$> left associative? apply associativity haskell Why ERROR Why is <$> left associative? fmap is also <$> because it is function application ( $ ) in the functor category. Then I thought, well in that case <*> is function application in the applicative functor category, a...	[ 0.0291748046875, 0.00872802734375, 0.01708984375, 0.01153564453125, 0.0036468505859375, 0.0036773681640625, -0.004608154296875, -0.000919342041015625, 0.019287109375, -0.036865234375, 0.0235595703125, -0.012939453125, -0.0009918212890625, 0.0084228515625, 0.00421142578125, -0.008544921...	[ 44084, 83, 1277, 4369, 5386, 25737, 166027, 272, 59911, 3760, 1556, 142508, 151206, 24638, 1238, 62346, 2843, 6637, 32354, 38415, 3650, 23, 7477, 18770, 95487, 17569, 1639, 41816, 4935, 4488, 4426, 43240, 1810, 96276, 1305, 277, 40322, 22183,...	[ 0.1214599609375, 0.03778076171875, 0.0233154296875, 0.1417236328125, 0.0966796875, 0.24755859375, 0.2021484375, 0.132080078125, 0.14892578125, 0.0992431640625, 0.1431884765625, 0.2169189453125, 0.074951171875, 0.0197906494140625, 0.107666015625, 0.234619140625, 0.0264129638671875, ...	embed
10020234_c0	10020234	haskell	0	Title: How to know when an apparently pure Haskell interface hides unsafe operations? Problem title: How to know when an apparently pure Haskell interface hides unsafe operations? Tags: haskell, purely-functional, unsafe-perform-io Problem: How to know when an apparently pure Haskell interface hides unsafe operations? ...	How to know when an apparently pure Haskell interface hides unsafe operations? How to know when an apparently pure Haskell interface hides unsafe operations? haskell purely-functional unsafe-perform-io How Haskell How to know when an apparently pure Haskell interface hides unsafe operations? I have been reading about u...	[ -0.0047607421875, 0.0048828125, 0.0184326171875, 0.01507568359375, -0.01019287109375, 0.01324462890625, -0.01116943359375, -0.01104736328125, -0.002532958984375, -0.00933837890625, -0.00017261505126953125, -0.028564453125, -0.01300048828125, -0.0028076171875, 0.018310546875, 0.00634765...	[ 11249, 47, 3714, 3229, 198371, 34166, 20625, 142508, 101758, 1274, 988, 51, 115840, 41018, 7, 1556, 538, 137175, 1264, 5037, 846, 142, 15277, 17780, 26458, 14315, 2773, 46876, 19048, 78974, 173591, 65998, 105506, 107419, 63773, 3917, 36766, 5...	[ 0.0819091796875, 0.0430908203125, 0.1541748046875, 0.08538818359375, 0.1878662109375, 0.223876953125, 0.136962890625, 0.23876953125, 0.258544921875, 0.1708984375, 0.1507568359375, 0.109130859375, 0.217041015625, 0.1868896484375, 0.0625, 0.115478515625, 0.050628662109375, 0.11425781...	embed
3993730_c0	3993730	haskell	0	Title: Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? Problem title: Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? Tags: haskell, functional-programming Problem: Should I read t...	Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? haskell functional-programming Should Introduction Functional Programming Bird Wadle...	[ 0.005645751953125, -0.003326416015625, 0.005645751953125, 0.0101318359375, -0.019287109375, 0.0108642578125, -0.01361083984375, -0.00072479248046875, -0.0062255859375, -0.0181884765625, -0.016845703125, -0.00604248046875, -0.0225830078125, -0.0135498046875, 0.02099609375, -0.0140991210...	[ 151117, 12301, 5117, 707, 17932, 79737, 4153, 2955, 77391, 47, 28670, 10763, 27958, 214, 390, 72607, 619, 25133, 92009, 603, 111, 1556, 142508, 123309, 28966, 44891, 87, 11522, 3501, 4527, 140988, 20625, 39210, 67330, 69236, 85583, 56037, 449...	[ 0.126220703125, 0.21044921875, 0.158447265625, 0.0693359375, 0.199462890625, 0.21875, 0.0467529296875, 0.135498046875, 0.1480712890625, 0.09619140625, 0.1663818359375, 0.1591796875, 0.2098388671875, 0.09136962890625, 0.05816650390625, 0.1861572265625, 0.1429443359375, 0.03988647460...	embed
28041411_c1	28041411	haskell	1	In the second argument of `(<)', namely `floor (sqrt x)' In the first argument of `takeWhile', namely `(< floor (sqrt x))' This is weird: :t floor gives me (Integral b, RealFrac a) => a -> b , which means that this floor should be returning a integer. How can I add an instance declaration (or do whatever is necessary ...	In the second argument of `(<)', namely `floor (sqrt x)' In the first argument of `takeWhile', namely `(< floor (sqrt x))' This is weird: :t floor gives me (Integral b, RealFrac a) => a -> b , which means that this floor should be returning a integer. How can I add an instance declaration (or do whatever is necessary ...	[ -0.0164794921875, 0.01904296875, 0.0093994140625, -0.0133056640625, 0.0087890625, 0.006988525390625, 0.0091552734375, -0.0245361328125, 0.016357421875, -0.0162353515625, 0.0238037109375, -0.00372314453125, 0.001373291015625, -0.006591796875, -0.00836181640625, -0.01123046875, -0.0048...	[ 360, 17932, 10750, 16093, 25, 4, 110987, 52347, 748, 864, 3198, 1022, 70, 5117, 78219, 1456, 979, 133, 74912, 16, 3293, 83, 179459, 18, 76199, 163, 67, 5739, 141, 876, 5120, 919, 20251, 10, 44357, 33079, 6, 450, 903, 5608, 30646, 214,...	[ 0.020172119140625, 0.1727294921875, 0.266357421875, 0.2425537109375, 0.002899169921875, 0.003753662109375, 0.005767822265625, 0.1497802734375, 0.1124267578125, 0.08203125, 0.1246337890625, 0.10357666015625, 0.00286865234375, 0.1187744140625, 0.1912841796875, 0.0787353515625, 0.245239...	embed
69803485_c0	69803485	haskell	0	Title: Haskell: get all paths Problem title: Haskell: get all paths Tags: haskell Problem: Haskell: get all paths I'm looking for a smart way to get all paths traversing a given data structure. I figured out that I need a function like this: allPaths :: (a -> [a]) -> a -> [[a]] It takes a seed a and a function a -> [a]...	Haskell: get all paths Haskell: get all paths haskell Haskell Haskell: get all paths I'm looking for a smart way to get all paths traversing a given data structure. I figured out that I need a function like this: It takes a seed a and a function a -> [a] (from each "a", you can get to multiple a's). The result is a lis...	[ 0.0103759765625, 0.01214599609375, -0.00750732421875, 0.006591796875, 0.00933837890625, 0.01031494140625, -0.006744384765625, -0.01177978515625, -0.0020294189453125, -0.06103515625, 0.00909423828125, -0.009033203125, -0.006988525390625, 0.04248046875, 0.00628662109375, -0.0071716308593...	[ 20625, 142508, 2046, 756, 60875, 12, 7, 1556, 16487, 100, 18775, 3917, 47, 37317, 214, 34475, 2053, 45646, 26366, 3871, 32354, 1884, 903, 51776, 40, 297, 10, 136, 33079, 11, 12638, 831, 48716, 25, 16750, 5303, 72134, 1295, 80934, 22027, ...	[ 0.1484375, 0.221923828125, 0.14404296875, 0.207763671875, 0.266357421875, 0.0141754150390625, 0.1171875, 0.144775390625, 0.048004150390625, 0.004669189453125, 0.1279296875, 0.044677734375, 0.08184814453125, 0.1666259765625, 0.06011962890625, 0.043121337890625, 0.09765625, 0.1632080...	embed
13346200_c0	13346200	haskell	0	Title: Type-safe difference lists Problem title: Type-safe difference lists Tags: types, haskell Problem: Type-safe difference lists A common idiom in Haskell, difference lists, is to represent a list xs as the value (xs ++) . Then (.) becomes " (++) " and id becomes " [] " (in fact this works for any monoid or categor...	Type-safe difference lists Type-safe difference lists types haskell Type-safe DList ShowS Type-safe difference lists A common idiom in Haskell, difference lists, is to represent a list xs as the value (xs ++) . Then (.) becomes " (++) " and id becomes " [] " (in fact this works for any monoid or category). Since we can...	[ 0.00457763671875, 0.009033203125, 0.00469970703125, 0.01361083984375, 0.00168609619140625, 0.018310546875, -0.00848388671875, -0.0072021484375, -0.00396728515625, -0.006195068359375, -0.0029449462890625, -0.004119873046875, -0.005279541015625, 0.0118408203125, -0.00531005859375, 0.0156...	[ 60457, 115840, 60212, 5303, 52895, 1556, 142508, 391, 154663, 17367, 294, 39210, 13373, 306, 23, 20625, 33636, 1022, 7, 237, 34292, 425, 37223, 5, 24209, 3447, 43240, 22460, 532, 95487, 831, 150350, 32354, 53697, 1733, 26267, 93766, 45367, ...	[ 0.2030029296875, 0.2003173828125, 0.2578125, 0.2222900390625, 0.145751953125, 0.1077880859375, 0.244140625, 0.1004638671875, 0.2364501953125, 0.177978515625, 0.08453369140625, 0.124755859375, 0.185302734375, 0.195068359375, 0.0257110595703125, 0.1181640625, 0.18701171875, 0.1038208...	embed
37015327_c0	37015327	haskell	0	Title: Solving and producing and equation with variables indexed by a given set (Haskell) Problem title: Solving and producing and equation with variables indexed by a given set (Haskell) Tags: linear-equation, variables, haskell, indexing Problem: Solving and producing and equation with variables indexed by a given se...	Solving and producing and equation with variables indexed by a given set (Haskell) Solving and producing and equation with variables indexed by a given set (Haskell) linear-equation variables haskell indexing Solving Haskell d_1 d_r Sum d_i x_i Solving and producing and equation with variables indexed by a given set (H...	[ -0.0115966796875, 0.00799560546875, -0.005462646484375, 0.01904296875, -0.00421142578125, -0.0074462890625, -0.007720947265625, 0.0244140625, 0.01513671875, -0.020751953125, -0.00799560546875, -0.0118408203125, 0.009033203125, -0.009033203125, -0.0084228515625, 0.01055908203125, 0.03...	[ 6678, 6496, 136, 27024, 5490, 678, 77336, 63262, 34475, 5423, 6495, 7, 142508, 28, 390, 192617, 13, 1556, 20625, 104, 115187, 454, 42, 36335, 14, 1022, 3444, 86869, 25632, 2967, 23, 10842, 653, 186, 6083, 14012, 2633, 62, 71, 24491, 101...	[ 0.1204833984375, 0.0491943359375, 0.08087158203125, 0.1639404296875, 0.1923828125, 0.10076904296875, 0.18603515625, 0.1776123046875, 0.038787841796875, 0.15283203125, 0.09893798828125, 0.0767822265625, 0.25537109375, 0.033477783203125, 0.041961669921875, 0.09906005859375, 0.025665283...	embed
37513423_c0	37513423	haskell	0	Title: Haskell Exception: Prelude.read: no parse Problem title: Haskell Exception: Prelude.read: no parse Tags: haskell Problem: Haskell Exception: Prelude.read: no parse I am new to Haskell, kinda 2 days since I study Haskell, and I want to do a project with files. I did it already in c++ and now I want to do it in Ha...	Haskell Exception: Prelude.read: no parse Haskell Exception: Prelude.read: no parse haskell System.IO Haskell Exception Prelude.read Please code1 book.txt Cod Haskell Exception: Prelude.read: no parse I am new to Haskell, kinda 2 days since I study Haskell, and I want to do a project with files. I did it already in c++...	[ 0.01129150390625, 0.00537109375, 0.0014495849609375, 0.010986328125, 0.0308837890625, 0.01141357421875, 0.0011138916015625, -0.00201416015625, -0.005767822265625, -0.039794921875, -0.0216064453125, -0.038330078125, -0.0150146484375, -0.004669189453125, 0.033203125, -0.03759765625, 0....	[ 20625, 142508, 5443, 63928, 1914, 822, 112, 39116, 12, 110, 366, 184, 1556, 12353, 17780, 30607, 18151, 418, 12877, 124326, 55879, 3525, 13452, 678, 102158, 37223, 10176, 35773, 1294, 68067, 3445, 3884, 3934, 11435, 4343, 237, 23, 18, 959, ...	[ 0.1441650390625, 0.206787109375, 0.08660888671875, 0.1688232421875, 0.1258544921875, 0.2054443359375, 0.1541748046875, 0.25244140625, 0.0272369384765625, 0.1363525390625, 0.1864013671875, 0.140625, 0.1346435546875, 0.07000732421875, 0.13916015625, 0.182373046875, 0.21923828125, 0.0...	embed
26579731_c0	26579731	haskell	0	Title: Is a list comprehension or a sequential filter more optimized? Problem title: Is a list comprehension or a sequential filter more optimized? Tags: optimization, list-comprehension, computation-theory, algorithm, haskell Problem: Is a list comprehension or a sequential filter more optimized? Let's say you have to...	Is a list comprehension or a sequential filter more optimized? Is a list comprehension or a sequential filter more optimized? optimization list-comprehension computation-theory algorithm haskell Is a list comprehension or a sequential filter more optimized? Let's say you have to return the sum of all the multiples of 2...	[ -0.007171630859375, 0.01483154296875, 0.01312255859375, -0.003997802734375, 0.0023040771484375, -0.01104736328125, -0.0164794921875, -0.00909423828125, 0.004425048828125, -0.02783203125, -0.0030059814453125, 0.00311279296875, 0.033935546875, -0.006683349609375, -0.0257568359375, 0.0033...	[ 5303, 46683, 3220, 6889, 707, 243228, 289, 46312, 1286, 15572, 29367, 87235, 277, 4692, 181135, 234873, 1556, 142508, 2071, 10, 30646, 10554, 756, 48716, 116, 136, 138, 5423, 892, 26255, 1295, 106, 45881, 20625, 18151, 33022, 6713, 4527, 69...	[ 0.2261962890625, 0.1849365234375, 0.1661376953125, 0.1092529296875, 0.0701904296875, 0.2227783203125, 0.04901123046875, 0.25244140625, 0.159912109375, 0.2152099609375, 0.14892578125, 0.159912109375, 0.03997802734375, 0.1297607421875, 0.06744384765625, 0.1927490234375, 0.09619140625, ...	embed
33188801_c0	33188801	haskell	0	Title: Haskell optimization program Problem title: Haskell optimization program Tags: haskell Problem: Haskell optimization program Have the task I need to implement the function Change, which will take the value and split it into the possible combinations from list of coins(random list) Example: coins = [2,3,7] GHCi> ...	Haskell optimization program Haskell optimization program haskell Haskell GHCi Num Ord n-1 x:xs Haskell optimization program Have the task I need to implement the function Change, which will take the value and split it into the possible combinations from list of coins(random list) Example: That's what I did: But this c...	[ -0.03564453125, 0.0026702880859375, -0.0040283203125, -0.0002613067626953125, -0.0072021484375, 0.0042724609375, -0.029296875, -0.0024871826171875, 0.015869140625, -0.0091552734375, -0.01220703125, 0.0272216796875, 0.0255126953125, 0.00156402587890625, -0.005615234375, 0.00009059906005...	[ 20625, 142508, 87235, 1363, 1528, 1556, 527, 73265, 14, 52782, 35379, 653, 5759, 1022, 12, 425, 31901, 66211, 87, 3871, 29479, 32354, 87377, 1221, 5646, 34292, 136, 65450, 3934, 7722, 162515, 1295, 5303, 43780, 7, 46258, 89536, 6777, 4966, ...	[ 0.167236328125, 0.26806640625, 0.2337646484375, 0.047576904296875, 0.1624755859375, 0.15185546875, 0.0633544921875, 0.10186767578125, 0.12744140625, 0.1578369140625, 0.206298828125, 0.042449951171875, 0.1214599609375, 0.0716552734375, 0.026519775390625, 0.0760498046875, 0.04592895507...	embed
55760073_c0	55760073	haskell	0	Title: Count frequency of every element in a list using just comparison operators Problem title: Count frequency of every element in a list using just comparison operators Tags: haskell Problem: Count frequency of every element in a list using just comparison operators I am new to Haskell and I have to count the freque...	Count frequency of every element in a list using just comparison operators Count frequency of every element in a list using just comparison operators haskell just Data.Map Count Ord Count frequency of every element in a list using just comparison operators I am new to Haskell and I have to count the frequencies of elem...	[ 0.0009002685546875, 0.0159912109375, -0.01708984375, -0.022216796875, 0.00238037109375, -0.0012054443359375, -0.00531005859375, -0.010986328125, 0.00439453125, -0.0159912109375, -0.004058837890625, -0.01055908203125, 0.0322265625, 0.033935546875, -0.016845703125, -0.01904296875, -0.0...	[ 108210, 12478, 944, 27771, 11907, 12830, 5303, 1660, 225490, 39933, 23, 1556, 142508, 11809, 166179, 35379, 17368, 3525, 20625, 54529, 117538, 80854, 30646, 22799, 34292, 80836, 14012, 20028, 74918, 107730, 2389, 304, 216969, 71928, 140992, 5608,...	[ 0.198974609375, 0.21875, 0.17724609375, 0.07373046875, 0.12890625, 0.1929931640625, 0.201416015625, 0.12548828125, 0.24560546875, 0.20361328125, 0.04522705078125, 0.113525390625, 0.2220458984375, 0.088134765625, 0.16845703125, 0.164794921875, 0.00152587890625, 0.034393310546875, ...	embed
26632866_c0	26632866	haskell	0	Title: conduit stream to list of actions Problem title: conduit stream to list of actions Tags: conduit, haskell Problem: conduit stream to list of actions I have: an infinite network stream as source (responseBody response) a parser: myParser = many1 parseOneObj of type Parser [MyObj] I would like to handle each objec...	conduit stream to list of actions conduit stream to list of actions conduit haskell many1 Parser MyObj CL.mapM_ B.putStrLn conduit stream to list of actions I have: an infinite network stream as source (responseBody response) a parser: myParser = many1 parseOneObj of type Parser [MyObj] I would like to handle each obje...	[ -0.007568359375, 0.0137939453125, -0.004486083984375, 0.000713348388671875, 0.01141357421875, 0.0390625, -0.00154876708984375, -0.004425048828125, 0.0157470703125, -0.044677734375, -0.019287109375, -0.01318359375, 0.01904296875, -0.004669189453125, 0.0019683837890625, -0.00260925292968...	[ 120565, 75973, 47, 5303, 111, 61972, 1556, 142508, 5941, 418, 2392, 2189, 2646, 46471, 170, 46323, 62346, 335, 7077, 71713, 765, 54241, 13, 33120, 31344, 134719, 12647, 1459, 57553, 366, 759, 28636, 184, 62068, 10644, 31852, 2806, 1884, 348...	[ 0.265380859375, 0.269287109375, 0.1251220703125, 0.1829833984375, 0.06201171875, 0.22998046875, 0.09814453125, 0.203369140625, 0.159912109375, 0.0816650390625, 0.08837890625, 0.1278076171875, 0.0682373046875, 0.0986328125, 0.1187744140625, 0.025146484375, 0.059783935546875, 0.02555...	embed
43985848_c0	43985848	haskell	0	Title: What are the differences between skylighting, pygments and Linguist? Problem title: What are the differences between skylighting, pygments and Linguist? Tags: github-linguist, haskell, pandoc, pygments, syntax-highlighting Problem: What are the differences between skylighting, pygments and Linguist? Aside from b...	What are the differences between skylighting, pygments and Linguist? What are the differences between skylighting, pygments and Linguist? github-linguist haskell pandoc pygments syntax-highlighting What Linguist What are the differences between skylighting, pygments and Linguist? Aside from being written in haskell, py...	[ 0.0023956298828125, 0.0087890625, -0.00823974609375, 0.009765625, -0.01190185546875, 0.01513671875, 0.0017547607421875, 0.0169677734375, -0.0019073486328125, 0.033935546875, 0.0242919921875, -0.018798828125, -0.0033721923828125, 0.002349853515625, -0.00634765625, 0.01055908203125, 0....	[ 60212, 7, 17721, 20704, 177476, 17198, 177, 9035, 136, 39286, 34, 1419, 62270, 32102, 65279, 1556, 142508, 2652, 29713, 6002, 86531, 84396, 4865, 59121, 23, 50828, 21922, 53, 5201, 285, 46876, 8060, 12921, 70796, 45646, 1836, 11814, 1940, 1...	[ 0.212646484375, 0.073486328125, 0.056549072265625, 0.1895751953125, 0.247802734375, 0.160888671875, 0.1890869140625, 0.19921875, 0.024658203125, 0.17041015625, 0.1842041015625, 0.1585693359375, 0.1090087890625, 0.16943359375, 0.1802978515625, 0.07281494140625, 0.1939697265625, 0.07...	embed
36481476_c0	36481476	haskell	0	Title: How to implement mathematics induction on Haskell Problem title: How to implement mathematics induction on Haskell Tags: proof, math, induction, haskell Problem: How to implement mathematics induction on Haskell data Nat = Zero \| Succ Nat type Predicate = (Nat -> Bool) -- forAllNat p = (p n) for every finite def...	How to implement mathematics induction on Haskell How to implement mathematics induction on Haskell proof math induction haskell How Haskell Nat Zero Succ Predicate Bool How to implement mathematics induction on Haskell Question: Prove that if basecase p and indstep p , then forAllNat p What I do not understand is that...	[ -0.01385498046875, -0.006256103515625, 0.0037384033203125, 0.0286865234375, 0.006378173828125, 0.007568359375, 0.00860595703125, -0.01470947265625, -0.01458740234375, -0.027587890625, 0.0146484375, -0.00007343292236328125, -0.024169921875, -0.0076904296875, -0.002410888671875, 0.004699...	[ 11249, 47, 29479, 291, 140363, 41637, 23, 77391, 98, 20625, 142508, 98869, 48909, 1556, 68875, 83947, 1832, 10060, 7145, 2063, 2460, 929, 1250, 272, 2174, 3647, 58437, 915, 136, 2752, 95528, 100, 43512, 4645, 18, 28219, 5608, 87599, 436, ...	[ 0.074951171875, 0.0279998779296875, 0.204833984375, 0.01776123046875, 0.1541748046875, 0.13916015625, 0.1273193359375, 0.239990234375, 0.1153564453125, 0.1787109375, 0.2587890625, 0.1436767578125, 0.128173828125, 0.1602783203125, 0.196533203125, 0.17041015625, 0.10986328125, 0.1683...	embed
4033103_c0	4033103	haskell	0	Title: Type error using Criterion Problem title: Type error using Criterion Tags: haskell-criterion, haskell Problem: Type error using Criterion I read the documentation and some articles that talk about the package, but I'm new to Haskell and did not understand much but I tried .... Below is what I did: module Main wh...	Type error using Criterion Type error using Criterion haskell-criterion haskell Control.Exception Criterion Control.Parallel Data.List IO Data.Char Criterion.Main Type Main LANGUAGE BangPatterns FilePath mkList1.txt Couldn Type error using Criterion I read the documentation and some articles that talk about the package...	[ 0.0052490234375, -0.01708984375, -0.0093994140625, -0.0037078857421875, 0.00457763671875, -0.01434326171875, 0.006134033203125, -0.015380859375, 0.01092529296875, -0.01007080078125, 0.0030517578125, -0.030517578125, -0.00628662109375, -0.026123046875, 0.00186920166015625, -0.0132446289...	[ 60457, 18499, 17368, 26315, 720, 1830, 1556, 142508, 59869, 56, 27131, 63928, 55292, 1229, 11809, 154663, 17780, 84068, 168793, 12321, 98064, 26387, 8335, 3055, 42724, 10519, 19201, 418, 124326, 191147, 12301, 209806, 98169, 3525, 20625, 28219, ...	[ 0.248779296875, 0.2161865234375, 0.09210205078125, 0.1651611328125, 0.198486328125, 0.17626953125, 0.14111328125, 0.2022705078125, 0.11865234375, 0.1485595703125, 0.1561279296875, 0.05303955078125, 0.00482177734375, 0.0660400390625, 0.050384521484375, 0.1695556640625, 0.0642700195312...	embed
40555972_c0	40555972	haskell	0	Title: How do you make a custom filter? Problem title: How do you make a custom filter? Tags: haskell, filter Problem: How do you make a custom filter? I am having trouble trying to figure this out myself with no success. I am trying to make my own Filter where instead of not including something in the List because it ...	How do you make a custom filter? How do you make a custom filter? haskell filter How Bool x:xs isIt1andOnly1 How do you make a custom filter? I am having trouble trying to figure this out myself with no success. I am trying to make my own Filter where instead of not including something in the List because it is false i...	[ -0.002899169921875, 0.0164794921875, -0.0108642578125, -0.0169677734375, -0.002899169921875, 0.00457763671875, 0.01239013671875, -0.0021209716796875, 0.0184326171875, -0.007720947265625, 0.01434326171875, -0.007110595703125, -0.0011749267578125, 0.01434326171875, -0.01513671875, 0.0044...	[ 11249, 54, 398, 3249, 10, 114122, 46312, 1556, 142508, 2460, 929, 1022, 425, 7, 83, 23389, 418, 2940, 20320, 538, 63134, 26366, 35978, 36272, 31577, 10002, 128896, 64457, 959, 26719, 32036, 6637, 98320, 442, 14602, 9844, 18151, 37842, 759, ...	[ 0.0841064453125, 0.06146240234375, 0.04705810546875, 0.15380859375, 0.0780029296875, 0.26025390625, 0.29443359375, 0.14306640625, 0.205078125, 0.0841064453125, 0.177978515625, 0.08233642578125, 0.0894775390625, 0.013580322265625, 0.09832763671875, 0.1839599609375, 0.09417724609375, ...	embed
22416292_c0	22416292	haskell	0	Title: Project Euler #14 Tips in Haskell? Problem title: Project Euler #14 Tips in Haskell? Tags: optimization, math, haskell Problem: Project Euler #14 Tips in Haskell? I am trying euler challenge 14 . I was wondering if I could have any tips for calculating it quickly in haskell. I tried this naive approach. import D...	Project Euler #14 Tips in Haskell? Project Euler #14 Tips in Haskell? optimization math haskell Project Euler Tips Haskell Main System.Timeout Nothing Project Euler #14 Tips in Haskell? I am trying euler challenge 14 . I was wondering if I could have any tips for calculating it quickly in haskell. I tried this naive ap...	[ -0.004364013671875, 0.001220703125, 0.0022125244140625, -0.00543212890625, 0.007354736328125, 0.01043701171875, -0.005157470703125, -0.01287841796875, 0.0027008056640625, -0.060302734375, -0.0030670166015625, 0.0036163330078125, -0.00946044921875, 0.01165771484375, 0.01123046875, 0.002...	[ 27331, 5177, 603, 468, 2592, 13785, 23, 20625, 142508, 87235, 48909, 1556, 12321, 12353, 70059, 6056, 182747, 31577, 1175, 66801, 616, 6305, 74481, 1916, 442, 69405, 37842, 5844, 51515, 34739, 5792, 4989, 17368, 39531, 184, 65780, 9136, 41911...	[ 0.10205078125, 0.1226806640625, 0.166748046875, 0.054168701171875, 0.204833984375, 0.1864013671875, 0.0867919921875, 0.1539306640625, 0.2568359375, 0.1295166015625, 0.0787353515625, 0.1473388671875, 0.0872802734375, 0.111328125, 0.1416015625, 0.1480712890625, 0.1680908203125, 0.057...	embed
74246650_c1	74246650	haskell	1	code of the classes. I've been thinking for a long time and i can't find a resonable solution, all help is welcome , thank you! data Tree a = Empty \| Node a (Tree a) (Tree a) data Forest a = Nil \| Cons (Tree a) (Forest a) instance Show a => Show (Tree a) where show Empty = "()" show (Node b (xl) (xr)) = "(" ++ show xl...	code of the classes. I've been thinking for a long time and i can't find a resonable solution, all help is welcome , thank you! data Tree a = Empty \| Node a (Tree a) (Tree a) data Forest a = Nil \| Cons (Tree a) (Forest a) instance Show a => Show (Tree a) where show Empty = "()" show (Node b (xl) (xr)) = "(" ++ show xl...	[ -0.00007390975952148438, 0.00750732421875, -0.013916015625, 0.01104736328125, 0.0067138671875, 0.0108642578125, -0.005859375, -0.025146484375, 0.00180816650390625, -0.011474609375, -0.0211181640625, -0.0240478515625, 0.002716064453125, 0.0262451171875, -0.0078125, -0.01263427734375, ...	[ 18151, 111, 70, 61112, 47644, 4989, 1733, 831, 18, 7413, 191, 2886, 29806, 756, 4358, 81907, 38, 2053, 101344, 10, 2203, 31678, 939, 58745, 438, 112, 62731, 87282, 77175, 39215, 18537, 525, 110527, 17367, 7639, 5021, 876, 92595, 37223, 10...	[ 0.26611328125, 0.15869140625, 0.0799560546875, 0.262939453125, 0.06231689453125, 0.036163330078125, 0.01190185546875, 0.022705078125, 0.05792236328125, 0.009246826171875, 0.043121337890625, 0.03045654296875, 0.1202392578125, 0.0517578125, 0.046417236328125, 0.0266876220703125, 0.0372...	embed
69921366_c1	69921366	haskell	1	/et/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.7.temp/ghc-8.10.7/ Error: Error encountered while installing GHC with make install run in /home/et/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.7.temp/ghc-8.10.7/ The following directories may now contain files, but won't be used by stack: - /home/et/.stack/programs/x86_...	/et/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.7.temp/ghc-8.10.7/ Error: Error encountered while installing GHC with make install run in /home/et/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.7.temp/ghc-8.10.7/ The following directories may now contain files, but won't be used by stack: - /home/et/.stack/programs/x86_...	[ 0.015869140625, 0.008544921875, 0.0286865234375, 0.004180908203125, 0.01025390625, -0.0101318359375, -0.031494140625, -0.0322265625, -0.0113525390625, 0.03515625, 0.006744384765625, -0.0179443359375, 0.001739501953125, -0.00103759765625, 0.000934600830078125, 0.01055908203125, 0.0049...	[ 248, 126, 64, 590, 2594, 18749, 7, 15276, 13307, 2397, 6077, 9486, 238, 18, 7319, 910, 17376, 10179, 966, 5, 34224, 212059, 190647, 297, 12960, 20600, 214, 527, 73265, 678, 3249, 11675, 23, 29552, 9, 25632, 14364, 3387, 1543, 5036, 7054...	[ 0.0309906005859375, 0.1517333984375, 0.0182647705078125, 0.12060546875, 0.156494140625, 0.1610107421875, 0.012603759765625, 0.2054443359375, 0.1719970703125, 0.0819091796875, 0.1224365234375, 0.11376953125, 0.136962890625, 0.079833984375, 0.1907958984375, 0.1397705078125, 0.100219726...	embed
12255540_c0	12255540	haskell	0	Title: Encapsulation of GADT pattern matches Problem title: Encapsulation of GADT pattern matches Tags: haskell, refactoring, pattern-matching, gadt Problem: Encapsulation of GADT pattern matches In this code there are repeated fragments: insert x (AATree t) = case insert' x t of Same t -> AATree t Inc t -> AATree t in...	Encapsulation of GADT pattern matches Encapsulation of GADT pattern matches haskell refactoring pattern-matching gadt Encapsulation GADT AATree Same Inc Ord AANode Black Succ AnyColor Red insert2 Encapsulation of GADT pattern matches In this code there are repeated fragments: So it is tempting to write a function: And ...	[ -0.0262451171875, -0.0162353515625, 0.01611328125, -0.0150146484375, 0.003326416015625, -0.0035247802734375, -0.04248046875, -0.0224609375, 0.0159912109375, -0.003814697265625, 0.0167236328125, -0.003326416015625, 0.0045166015625, -0.023681640625, 0.0155029296875, 0.008056640625, 0.0...	[ 357, 15644, 7, 72403, 23749, 41072, 103510, 14858, 1556, 142508, 456, 144810, 98753, 914, 13384, 107, 13, 99908, 8942, 35379, 37026, 31, 112, 10074, 1832, 10060, 28541, 1484, 6096, 183540, 304, 90, 903, 18151, 119140, 38551, 20805, 1916, 33...	[ 0.060943603515625, 0.1925048828125, 0.07501220703125, 0.07464599609375, 0.1588134765625, 0.236328125, 0.204345703125, 0.1744384765625, 0.103759765625, 0.192626953125, 0.05926513671875, 0.14697265625, 0.1455078125, 0.09747314453125, 0.1820068359375, 0.07476806640625, 0.0062255859375, ...	embed
24851167_c0	24851167	haskell	0	Title: How to search a tuple and increment while saving the results Problem title: How to search a tuple and increment while saving the results Tags: haskell Problem: How to search a tuple and increment while saving the results import Data.Char import Data.List import Data.Maybe -- Sample test data type Movies = (Strin...	How to search a tuple and increment while saving the results How to search a tuple and increment while saving the results haskell Data.Char Data.List Data.Maybe How Sample Movies Will Smith Rise Planet Apes James Franco Godzilla Bryan Cranston How to search a tuple and increment while saving the results Thanks guys for...	[ 0.0108642578125, 0.0213623046875, 0.015380859375, 0.0064697265625, 0.009765625, 0.0113525390625, -0.00811767578125, 0.005096435546875, 0.020263671875, -0.0037384033203125, 0.0106201171875, 0.004150390625, 0.0107421875, 0.0341796875, 0.00193023681640625, -0.015625, 0.005584716796875, ...	[ 11249, 33938, 370, 8705, 136, 158661, 12960, 57, 6496, 50339, 47, 10, 70, 1556, 142508, 11809, 84068, 154663, 82419, 947, 33209, 83896, 20255, 37700, 24116, 13, 40357, 5787, 90, 14631, 36160, 3430, 169, 2298, 153095, 1603, 19386, 6, 51484, ...	[ 0.057342529296875, 0.274658203125, 0.1727294921875, 0.280517578125, 0.153076171875, 0.279052734375, 0.1253662109375, 0.180419921875, 0.1539306640625, 0.2325439453125, 0.0279693603515625, 0.07440185546875, 0.002288818359375, 0.1514892578125, 0.262451171875, 0.123291015625, 0.159057617...	embed
22049679_c0	22049679	haskell	0	Title: Data type combining other data types with tuple? Syntax needed - Haskell Problem title: Data type combining other data types with tuple? Syntax needed - Haskell Tags: haskell Problem: Data type combining other data types with tuple? Syntax needed - Haskell just a quick question as I'm not sure how to symatically...	Data type combining other data types with tuple? Syntax needed - Haskell Data type combining other data types with tuple? Syntax needed - Haskell haskell Data Syntax Haskell Teacher Assitant Student Classroom Assistant Data type combining other data types with tuple? Syntax needed - Haskell just a quick question as I'm...	[ 0.0020904541015625, 0.010498046875, 0.00213623046875, 0.0302734375, -0.0069580078125, -0.0027618408203125, -0.016357421875, 0.0021820068359375, -0.00885009765625, -0.01220703125, -0.0026397705078125, -0.01470947265625, 0.001312255859375, 0.0185546875, -0.0361328125, 0.0079345703125, ...	[ 11809, 10644, 375, 964, 3789, 2053, 52895, 678, 370, 8705, 19010, 86531, 44841, 20625, 142508, 592, 1556, 165136, 1301, 172, 18211, 26696, 35014, 28905, 181595, 63773, 9077, 2227, 3034, 29459, 765, 70541, 9351, 32070, 3444, 3249, 15700, 35839...	[ 0.1239013671875, 0.2147216796875, 0.09423828125, 0.1666259765625, 0.119873046875, 0.1800537109375, 0.20556640625, 0.09698486328125, 0.1160888671875, 0.221923828125, 0.108154296875, 0.1744384765625, 0.1024169921875, 0.118896484375, 0.2197265625, 0.0076904296875, 0.08392333984375, 0....	embed
73434721_c0	73434721	haskell	0	Title: Strict type alias in Haskell Problem title: Strict type alias in Haskell Tags: haskell Problem: Strict type alias in Haskell Suppose I have a recursive function taking 3 integers, each having a different meaning, e.g. func :: Int -> Int -> Int -> SomeType1 -> SomeType2 What I want is to prevent myself from misty...	Strict type alias in Haskell Strict type alias in Haskell haskell Strict Haskell SomeType1 SomeType2 FuncFirstArg FuncSecondArg FuncThirdArg Strict type alias in Haskell Suppose I have a recursive function taking 3 integers, each having a different meaning, e.g. What I want is to prevent myself from mistyping the order...	[ 0.0027008056640625, 0.0059814453125, 0.0045166015625, 0.0037841796875, 0.01287841796875, 0.0184326171875, -0.0081787109375, 0.0194091796875, -0.005828857421875, -0.0007781982421875, 0.0091552734375, -0.021728515625, -0.0120849609375, 0.0130615234375, 0.00408935546875, 0.025390625, 0....	[ 73425, 15390, 10644, 55109, 20625, 142508, 1556, 31384, 196707, 418, 304, 28670, 207263, 7614, 177, 2271, 117177, 4216, 195625, 5844, 32354, 35971, 138, 892, 26255, 12921, 91084, 3444, 56282, 35978, 1239, 46280, 12989, 10750, 1884, 7477, 238, ...	[ 0.1943359375, 0.1231689453125, 0.2108154296875, 0.25244140625, 0.1309814453125, 0.236328125, 0.1156005859375, 0.0190582275390625, 0.2061767578125, 0.029876708984375, 0.0220184326171875, 0.08172607421875, 0.03619384765625, 0.0799560546875, 0.1097412109375, 0.054779052734375, 0.0358581...	embed
40647332_c0	40647332	haskell	0	Title: Why do you need let keyword in do block? Problem title: Why do you need let keyword in do block? Tags: haskell, let Problem: Why do you need let keyword in do block? What is the reason for having let in do block. -- codeblock A main = do let a = 0 let f a = a + 1 let b = f 0 print (a,b) -- codeblock B main = do ...	Why do you need let keyword in do block? Why do you need let keyword in do block? haskell let Why Why do you need let keyword in do block? What is the reason for having let in do block. Assume all let without in must followed by = (Is this true?) Compiler should be able to imply let from = and preprocess/de-sugar codeb...	[ 0.002716064453125, 0.01202392578125, 0.0107421875, 0.0159912109375, -0.004119873046875, 0.005584716796875, -0.004608154296875, 0.0089111328125, 0.004119873046875, 0.01043701171875, -0.0108642578125, -0.00811767578125, -0.01092529296875, 0.007781982421875, 0.01361083984375, 0.0086059570...	[ 44084, 3871, 2633, 166117, 23, 54, 46389, 1556, 142508, 31635, 19441, 66596, 756, 15490, 8110, 134629, 2203, 29568, 15612, 34759, 19048, 21980, 538, 1295, 479, 63923, 112, 1159, 1970, 18151, 81409, 335, 47, 62, 17368, 26531, 55076, 391, 237...	[ 0.097412109375, 0.151123046875, 0.2115478515625, 0.225830078125, 0.10107421875, 0.1217041015625, 0.2186279296875, 0.102783203125, 0.1939697265625, 0.0770263671875, 0.05926513671875, 0.01739501953125, 0.009429931640625, 0.0902099609375, 0.0309295654296875, 0.06787109375, 0.13317871093...	embed
45675403_c0	45675403	haskell	0	Title: Getting the first available port in Haskell, in a platform-independent way Problem title: Getting the first available port in Haskell, in a platform-independent way Tags: network-programming, haskell Problem: Getting the first available port in Haskell, in a platform-independent way I'd like to get the first ava...	Getting the first available port in Haskell, in a platform-independent way Getting the first available port in Haskell, in a platform-independent way network-programming haskell Getting Haskell Get Integer AF_INET Stream SockAddrInet aNY_PORT iNADDR_ANY Getting the first available port in Haskell, in a platform-indepen...	[ -0.023681640625, 0.0223388671875, 0.000644683837890625, -0.007080078125, -0.00055694580078125, -0.0028533935546875, -0.00909423828125, -0.004241943359375, 0.0037841796875, -0.057373046875, 0.0228271484375, -0.004608154296875, -0.000255584716796875, 0.0294189453125, -0.006561279296875, ...	[ 210732, 5117, 19882, 11469, 20625, 142508, 13651, 181063, 23, 3917, 33120, 28966, 1556, 20779, 44401, 28211, 17777, 115061, 1061, 7569, 126, 25182, 91599, 149300, 23498, 93333, 1884, 2046, 99091, 4034, 94878, 17368, 68557, 32354, 9077, 171859, ...	[ 0.08465576171875, 0.155029296875, 0.1663818359375, 0.219970703125, 0.13232421875, 0.24169921875, 0.100341796875, 0.089111328125, 0.016082763671875, 0.01422119140625, 0.056488037109375, 0.033782958984375, 0.08758544921875, 0.0677490234375, 0.14794921875, 0.1143798828125, 0.11755371093...	embed
8703319_c0	8703319	haskell	0	Title: Haskell projects to study and learn from? Problem title: Haskell projects to study and learn from? Tags: open-source, haskell Problem: Haskell projects to study and learn from? As a developer who is new to Haskell, I am looking for open-source Haskell applications that I could study and learn from. In particular...	Haskell projects to study and learn from? Haskell projects to study and learn from? open-source haskell Haskell Haskell projects to study and learn from? As a developer who is new to Haskell, I am looking for open-source Haskell applications that I could study and learn from. In particular, I am looking for open-source...	[ -0.00007200241088867188, 0.01458740234375, 0.0079345703125, 0.006317138671875, 0.000576019287109375, -0.0011444091796875, -0.0264892578125, -0.00189208984375, 0.019775390625, -0.0062255859375, 0.011962890625, -0.044677734375, -0.000568389892578125, 0.004425048828125, -0.005340576171875, ...	[ 20625, 142508, 77635, 47, 35187, 136, 30698, 1295, 32, 9803, 60427, 1556, 106001, 3525, 16487, 86685, 87, 5809, 100, 7639, 11249, 33022, 33120, 10723, 105994, 5299, 27226, 57553, 19161, 11192, 8305, 5550, 254, 1467, 39642, 2806, 95134, 27781,...	[ 0.154296875, 0.25341796875, 0.214599609375, 0.06695556640625, 0.1329345703125, 0.056182861328125, 0.1307373046875, 0.1109619140625, 0.00653076171875, 0.1546630859375, 0.174560546875, 0.1358642578125, 0.09375, 0.0758056640625, 0.04498291015625, 0.1524658203125, 0.004119873046875, 0....	embed
9686665_c0	9686665	haskell	0	Title: How can I test a higher-order function using QuickCheck? Problem title: How can I test a higher-order function using QuickCheck? Tags: haskell, quickcheck Problem: How can I test a higher-order function using QuickCheck? I have a higher-order function that I want to test, and one of the properties I want to test...	How can I test a higher-order function using QuickCheck? How can I test a higher-order function using QuickCheck? haskell quickcheck QuickCheck How Bool How can I test a higher-order function using QuickCheck? I have a higher-order function that I want to test, and one of the properties I want to test is what it does w...	[ -0.0098876953125, 0.00109100341796875, 0.0001239776611328125, -0.01397705078125, 0.000904083251953125, 0.01092529296875, 0.015380859375, -0.04296875, 0.00616455078125, -0.02197265625, -0.00014972686767578125, 0.0186767578125, -0.025390625, -0.0211181640625, 0.00762939453125, -0.0209960...	[ 11249, 831, 87, 3034, 77546, 80596, 32354, 17368, 89038, 202567, 1556, 142508, 63773, 78292, 2460, 929, 3444, 183871, 14602, 678, 115081, 23, 164156, 27781, 6528, 166904, 145823, 4034, 11001, 10, 28282, 1507, 5303, 1653, 2063, 14192, 47, 7279...	[ 0.0760498046875, 0.09002685546875, 0.03326416015625, 0.24267578125, 0.1478271484375, 0.1968994140625, 0.1927490234375, 0.0926513671875, 0.1658935546875, 0.309814453125, 0.08660888671875, 0.1927490234375, 0.1102294921875, 0.2298583984375, 0.0362548828125, 0.115478515625, 0.02252197265...	embed
73681440_c0	73681440	haskell	0	Title: How to terminate an array modification function in haskell? Problem title: How to terminate an array modification function in haskell? Tags: haskell Problem: How to terminate an array modification function in haskell? So I have this function... removeDuplicate :: [CustomType] -> [CustomType] removeDuplicate [] =...	How to terminate an array modification function in haskell? How to terminate an array modification function in haskell? haskell How CustomType x:y:xs How to terminate an array modification function in haskell? So I have this function... Here, I have to check if there is an element in the array(sorted) which is equal to...	[ 0.0064697265625, 0.031494140625, 0.0026397705078125, -0.017333984375, -0.004119873046875, -0.006591796875, -0.003631591796875, 0.01068115234375, 0.0006866455078125, -0.006072998046875, -0.0013580322265625, -0.00445556640625, 0.0213623046875, -0.0068359375, -0.00653076171875, 0.00366210...	[ 11249, 121011, 13, 10298, 53, 129344, 32354, 1556, 142508, 130664, 196707, 425, 23, 765, 12765, 2174, 12830, 62351, 105950, 3789, 80854, 2886, 4488, 29527, 1363, 35431, 903, 3934, 54241, 40956, 645, 3688, 36997, 54529, 16648, 20625, 34831 ]	[ 0.0657958984375, 0.2186279296875, 0.1329345703125, 0.1549072265625, 0.1387939453125, 0.25927734375, 0.1849365234375, 0.125, 0.216552734375, 0.17822265625, 0.2027587890625, 0.0292510986328125, 0.0152435302734375, 0.002227783203125, 0.143798828125, 0.031646728515625, 0.116943359375, ...	embed
4438393_c0	4438393	haskell	0	Title: Represent Flowchart-specified Algorithms in Haskell Problem title: Represent Flowchart-specified Algorithms in Haskell Tags: haskell Problem: Represent Flowchart-specified Algorithms in Haskell I'm confronted with the task of implementing algorithms (mostly business logic style) expressed as flowcharts. I'm awar...	Represent Flowchart-specified Algorithms in Haskell Represent Flowchart-specified Algorithms in Haskell haskell Represent Flowchart-specified Algorithms Haskell Represent Flowchart-specified Algorithms in Haskell I'm confronted with the task of implementing algorithms (mostly business logic style) expressed as flowchar...	[ 0.002960205078125, -0.0016326904296875, 0.01324462890625, 0.0029296875, 0.00543212890625, 0.01708984375, -0.01611328125, -0.00787353515625, -0.0185546875, 0.017333984375, -0.0038604736328125, -0.004302978515625, -0.00022411346435546875, 0.037353515625, -0.006622314453125, 0.00646972656...	[ 853, 55247, 38699, 9336, 3960, 16711, 47314, 109847, 2783, 18337, 20625, 142508, 23, 1556, 20549, 66211, 29479, 234873, 8063, 62775, 20623, 36510, 86608, 9254, 933, 959, 2965, 18811, 217904, 40899, 57266, 4527, 313, 9059, 179933, 29458, 237, ...	[ 0.0704345703125, 0.2216796875, 0.1690673828125, 0.1212158203125, 0.22509765625, 0.154296875, 0.0535888671875, 0.1441650390625, 0.1270751953125, 0.0675048828125, 0.151123046875, 0.269775390625, 0.0232086181640625, 0.1358642578125, 0.0290985107421875, 0.04559326171875, 0.115234375, 0...	embed
45987740_c0	45987740	haskell	0	Title: Type class instance redefining Problem title: Type class instance redefining Tags: duplicates, haskell, instance, monads, redefinition Problem: Type class instance redefining I am trying to answer this question: "Given the algebraic data type data Maybe a = Nothing \| Just a pick the correct instance declaration ...	Type class instance redefining Type class instance redefining duplicates haskell instance monads redefinition Type Maybe Nothing Just Monad HwEx9.hs:16:10 Duplicate Defined GHC.Base Type class instance redefining I am trying to answer this question: "Given the algebraic data type pick the correct instance declaration t...	[ -0.0201416015625, 0.00994873046875, 0.0177001953125, 0.0101318359375, 0.01220703125, 0.0037384033203125, 0.00396728515625, 0.012939453125, -0.00124359130859375, -0.025146484375, -0.0302734375, -0.021484375, 0.007293701171875, 0.00537109375, 0.0179443359375, 0.0064697265625, 0.0050048...	[ 60457, 18507, 110527, 456, 49919, 171763, 1636, 1556, 142508, 2667, 712, 83425, 182747, 9563, 60331, 71, 19279, 1126, 786, 52721, 67, 262, 5983, 527, 73265, 63473, 31577, 35166, 429, 2844, 2053, 10644, 39580, 26785, 21635, 45831, 64549, 748, ...	[ 0.256591796875, 0.2310791015625, 0.262451171875, 0.1082763671875, 0.1826171875, 0.2242431640625, 0.06634521484375, 0.08251953125, 0.185791015625, 0.1087646484375, 0.124267578125, 0.255859375, 0.12939453125, 0.034698486328125, 0.1903076171875, 0.168701171875, 0.0576171875, 0.0526428...	embed
6222521_c0	6222521	haskell	0	Title: Haskell do syntax and I/O Problem title: Haskell do syntax and I/O Tags: haskell, ghci, ghc Problem: Haskell do syntax and I/O I was playing around with a simple program in Haskell: hello :: String -> String hello s = "Hello, " ++ (trim s) ++ "!\n" trim :: String -> String trim [] = [] trim s = head $ words s ma...	Haskell do syntax and I/O Haskell do syntax and I/O haskell ghci ghc Haskell Hello Please John Doe hello.exe hello.hs Haskell do syntax and I/O I was playing around with a simple program in Haskell: This is the output I am expecting: This works as expected when I load the program into ghci. However when I compile the p...	[ -0.00933837890625, 0.0004405975341796875, 0.00494384765625, 0.017578125, -0.020263671875, 0.038330078125, 0.003082275390625, 0.007049560546875, 0.0052490234375, -0.0162353515625, 0.00555419921875, -0.03662109375, -0.01312255859375, -0.00433349609375, 0.0078125, 0.01214599609375, 0.01...	[ 20625, 142508, 54, 6002, 86531, 136, 87, 64, 670, 1556, 31380, 318, 238, 35378, 30607, 4939, 984, 13, 33600, 31, 46480, 127, 75169, 10932, 8781, 1528, 3293, 83, 140992, 41206, 214, 43240, 84751, 72367, 3934, 33306, 3229, 9969, 1340, 17368...	[ 0.1470947265625, 0.2587890625, 0.1483154296875, 0.1181640625, 0.2001953125, 0.0241851806640625, 0.02886962890625, 0.193359375, 0.1407470703125, 0.1435546875, 0.1358642578125, 0.1591796875, 0.030364990234375, 0.1571044921875, 0.1746826171875, 0.1260986328125, 0.1287841796875, 0.1353...	embed
28492777_c0	28492777	haskell	0	Title: Binary Search Tree Haskell Problem title: Binary Search Tree Haskell Tags: functional-programming, haskell, binary-search-tree Problem: Binary Search Tree Haskell I have an insert function for a Binary Search Tree in Haskel. My insert functions first two lines look like this insert :: (Ord a) => BST a -> a -> BS...	Binary Search Tree Haskell Binary Search Tree Haskell functional-programming haskell binary-search-tree Binary Search Tree Haskell Ord BST Nil Node Occurs Expected Actual Binary Search Tree Haskell I have an insert function for a Binary Search Tree in Haskel. My insert functions first two lines look like this I know th...	[ -0.00072479248046875, -0.003021240234375, 0.01104736328125, -0.009521484375, 0.024658203125, 0.02001953125, -0.0201416015625, -0.042236328125, -0.0135498046875, -0.03515625, -0.00543212890625, -0.042724609375, 0.008544921875, 0.00616455078125, 0.0023193359375, 0.0016632080078125, 0.0...	[ 54092, 1294, 33086, 101344, 20625, 142508, 123309, 28966, 1556, 2394, 6635, 86250, 62600, 35379, 335, 8545, 77175, 438, 112, 180, 238, 48650, 60075, 13, 100582, 183540, 32354, 2590, 5117, 6626, 124519, 6713, 1884, 903, 3714, 43240, 3034, 1100...	[ 0.1995849609375, 0.113037109375, 0.2017822265625, 0.2420654296875, 0.1458740234375, 0.2398681640625, 0.1553955078125, 0.10308837890625, 0.1412353515625, 0.1834716796875, 0.1351318359375, 0.179931640625, 0.21630859375, 0.1358642578125, 0.077880859375, 0.1688232421875, 0.206298828125, ...	embed
73341047_c0	73341047	haskell	0	Title: Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution Problem title: Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution Tags: haskell, memory, performance Problem: Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution I'm trying to solve this problem https://codeforces.com/contest/285/problem/C?lo...	Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution haskell memory performance Data.List Data.Int Contest TIME_LIMIT_EXCEEDED Haskell Int64 Test Input Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution I'm trying to solve this problem https://codefo...	[ -0.031005859375, 0.00180816650390625, 0.0057373046875, 0.00173187255859375, -0.0089111328125, -0.005645751953125, -0.004791259765625, -0.0026702880859375, -0.011962890625, -0.0152587890625, 0.01708984375, 0.002197265625, -0.004547119140625, 0.00408935546875, 0.00909423828125, -0.005004...	[ 185631, 2967, 110500, 83318, 6371, 26939, 10854, 104739, 397, 100, 20625, 142508, 29806, 1556, 98323, 23718, 11809, 154663, 13307, 8647, 360, 31577, 86869, 40899, 50930, 64, 2271, 6954, 101800, 38953, 98908, 3034, 966, 17475, 4382, 4432, 15572,...	[ 0.239501953125, 0.1578369140625, 0.214599609375, 0.1846923828125, 0.136474609375, 0.1192626953125, 0.1502685546875, 0.1446533203125, 0.07708740234375, 0.061126708984375, 0.147705078125, 0.2271728515625, 0.1651611328125, 0.126708984375, 0.1396484375, 0.117431640625, 0.016693115234375,...	embed
49565868_c0	49565868	haskell	0	Title: Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map and Data.HashMap can be made instances? Problem title: Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map an...	Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map and Data.HashMap can be made instances? Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map and Data.HashMap can be ...	[ -0.006378173828125, 0.0208740234375, 0.004302978515625, -0.004669189453125, -0.0084228515625, -0.003173828125, 0.003265380859375, -0.00182342529296875, 0.000759124755859375, -0.0216064453125, -0.000461578369140625, -0.0017852783203125, 0.017578125, 0.00860595703125, 0.0017547607421875, ...	[ 101790, 32316, 189534, 162, 45388, 45023, 10298, 53, 428, 10763, 6635, 10644, 67413, 20625, 142508, 11809, 166179, 6495, 1495, 831, 7228, 110527, 2685, 23, 15044, 136, 166027, 272, 19305, 1556, 5, 162087, 42719, 4331, 61687, 26946, 237, 10773...	[ 0.042633056640625, 0.1119384765625, 0.1805419921875, 0.0156707763671875, 0.142333984375, 0.1142578125, 0.1314697265625, 0.0955810546875, 0.026702880859375, 0.14013671875, 0.0667724609375, 0.17333984375, 0.244873046875, 0.12744140625, 0.2379150390625, 0.1033935546875, 0.205322265625, ...	embed
58317239_c0	58317239	haskell	0	Title: Binary search tree predicate with helper functions Problem title: Binary search tree predicate with helper functions Tags: tree, predicate, binary-search-tree, haskell, binary-tree Problem: Binary search tree predicate with helper functions data BinaryTree a = Null \| Node (BinaryTree a) a (BinaryTree a) deriving...	Binary search tree predicate with helper functions Binary search tree predicate with helper functions tree predicate binary-search-tree haskell binary-tree Binary BinaryTree Node Show BSTree Ord Bool Binary search tree predicate with helper functions How can I use treeBSMin and treeBSMax as helper functions of isBSTree...	[ 0.016845703125, 0.0010833740234375, 0.002410888671875, -0.0179443359375, 0.0155029296875, 0.0419921875, -0.0012969970703125, -0.03759765625, -0.00081634521484375, 0.0040283203125, -0.02392578125, 0.002197265625, 0.0084228515625, -0.0047607421875, 0.0213623046875, 0.00518798828125, 0....	[ 54092, 1294, 33938, 53201, 1653, 2063, 67, 678, 4358, 56, 32354, 2394, 6635, 86250, 62600, 1556, 142508, 62731, 13, 438, 112, 17367, 84145, 35379, 2460, 929, 4527, 20429, 59076, 71346, 83, 7413, 36766 ]	[ 0.1771240234375, 0.095458984375, 0.1966552734375, 0.23046875, 0.10418701171875, 0.162109375, 0.05145263671875, 0.08599853515625, 0.157958984375, 0.114990234375, 0.158447265625, 0.1640625, 0.1463623046875, 0.1812744140625, 0.2047119140625, 0.09869384765625, 0.1881103515625, 0.182739...	embed
14096954_c1	14096954	haskell	1	TVar t0' with actual type `IO a0' In the return type of a call of `atomically' In a stmt of a 'do' block: buff <- atomically newBuffer In the expression: do { buff <- atomically newBuffer; atomically $ put buff unblocked; computeBlock buff; return buff } Does anybody know what the problem is, or maybe another way to im...	TVar t0' with actual type `IO a0' In the return type of a call of `atomically' In a stmt of a 'do' block: buff <- atomically newBuffer In the expression: do { buff <- atomically newBuffer; atomically $ put buff unblocked; computeBlock buff; return buff } Does anybody know what the problem is, or maybe another way to im...	[ -0.0150146484375, 0.00811767578125, -0.00592041015625, 0.0228271484375, 0.008544921875, 0.01171875, 0.01324462890625, 0.003082275390625, 0.008056640625, -0.00567626953125, 0.0169677734375, -0.0023040771484375, 0.002777099609375, -0.003936767578125, 0.005035400390625, -0.00811767578125,...	[ 1910, 147, 808, 2389, 8561, 10644, 17780, 10, 30646, 11782, 5928, 71407, 6138, 39, 18, 111, 246, 46389, 123759, 34627, 3525, 7235, 18234, 125195, 54, 3650, 3884, 51, 81409, 9969, 6743, 166191, 3714, 2967, 29479, 6528, 18151, 28350, 83184, ...	[ 0.194091796875, 0.2213134765625, 0.049652099609375, 0.1513671875, 0.1248779296875, 0.165771484375, 0.1690673828125, 0.1197509765625, 0.188720703125, 0.152099609375, 0.1256103515625, 0.14794921875, 0.0728759765625, 0.022003173828125, 0.0933837890625, 0.0176849365234375, 0.126586914062...	embed
25487119_c0	25487119	haskell	0	Title: How do I get lazy streaming into the foldl'? Problem title: How do I get lazy streaming into the foldl'? Tags: space-leak, streaming, lazy-loading, lazy-io, haskell Problem: How do I get lazy streaming into the foldl'? How does one make their own streaming code? I was generating about 1,000,000,000 ran...	How do I get lazy streaming into the foldl'? How do I get lazy streaming into the foldl'? space-leak streaming lazy-loading lazy-io haskell How Would Ace How do I get lazy streaming into the foldl'? How does one make their own streaming code? I was generating about 1,000,000,000 random pairs of war decks, and...	[ -0.0103759765625, 0.007720947265625, 0.00750732421875, -0.0296630859375, 0.00689697265625, 0.01470947265625, -0.006103515625, -0.0128173828125, -0.0079345703125, -0.058837890625, 0.018310546875, -0.001617431640625, -0.000797271728515625, 0.01385498046875, -0.00775146484375, -0.01031494...	[ 11249, 2046, 21, 3285, 65296, 3934, 18344, 20469, 3768, 70, 32628, 133, 344, 63033, 846, 1556, 142508, 154559, 70280, 54, 25, 3249, 10002, 18151, 12663, 1672, 75534, 158887, 96759, 80836, 1631, 8, 22824, 36663, 75973, 95, 29191, 11675, 678,...	[ 0.0555419921875, 0.107666015625, 0.16796875, 0.247802734375, 0.243896484375, 0.1634521484375, 0.1617431640625, 0.21240234375, 0.0283050537109375, 0.0230865478515625, 0.1612548828125, 0.1302490234375, 0.1495361328125, 0.0863037109375, 0.154052734375, 0.05963134765625, 0.1942138671875,...	embed
39913349_c0	39913349	haskell	0	Title: Haskell beginner: Is this too imperative like? Problem title: Haskell beginner: Is this too imperative like? Tags: haskell Problem: Haskell beginner: Is this too imperative like? *Sorry for the extremely elementary question, but I am just starting out with Haskell. I have a Snap web app with a handler handleUser...	Haskell beginner: Is this too imperative like? Haskell beginner: Is this too imperative like? haskell Haskell Handler App Nothing Capout Just SELECT WHERE h:_ Username Haskell beginner: Is this too imperative like? *Sorry for the extremely elementary question, but I am just starting out with Haskell. I have a Snap web ...	[ 0.003753662109375, 0.0208740234375, 0.000652313232421875, 0.01177978515625, 0.000797271728515625, 0.0223388671875, 0.007110595703125, -0.03173828125, 0.0166015625, -0.048828125, 0.012451171875, -0.0281982421875, -0.01324462890625, -0.018798828125, -0.0205078125, 0.000682830810546875, ...	[ 20625, 142508, 9842, 1679, 2071, 903, 5792, 222530, 13, 1884, 1556, 10639, 603, 5659, 182747, 14304, 6056, 9563, 6755, 144832, 841, 30096, 1096, 12, 53400, 11627, 158240, 1294, 111531, 131830, 72134, 1810, 678, 121190, 1467, 4027, 35863, 3483...	[ 0.1575927734375, 0.2432861328125, 0.0938720703125, 0.07098388671875, 0.06854248046875, 0.087890625, 0.169677734375, 0.224853515625, 0.09820556640625, 0.1346435546875, 0.130859375, 0.1474609375, 0.168212890625, 0.1439208984375, 0.13330078125, 0.138671875, 0.176513671875, 0.051452636...	embed
72553398_c0	72553398	haskell	0	Title: What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? Problem title: What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? Tags: monoids, applicative, haskell, distributive, category-theory Problem: What is a cocartesian comonoid, and what is a cocartesian comonoid...	What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? monoids applicative haskell distributive category-theory What What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? I've been experimenting ...	[ 0.00830078125, -0.00469970703125, 0.006378173828125, 0.01019287109375, 0.00179290771484375, 0.013671875, 0.00787353515625, -0.01483154296875, -0.0048828125, 0.000827789306640625, -0.0264892578125, -0.0133056640625, -0.01416015625, 0.0185546875, 0.00029754638671875, 0.0052490234375, -...	[ 4865, 83, 138091, 15492, 39209, 533, 157, 532, 136, 2367, 14, 2465, 7477, 18770, 10, 22460, 30185, 41816, 4935, 1556, 142508, 15917, 95487, 2347, 30675, 28007, 75571, 42991, 33946, 21771, 51529, 45646, 91067, 28290, 198395, 48903, 80234, 4904...	[ 0.04400634765625, 0.0810546875, 0.101806640625, 0.1676025390625, 0.1724853515625, 0.1815185546875, 0.1414794921875, 0.1639404296875, 0.07574462890625, 0.055908203125, 0.060028076171875, 0.08148193359375, 0.1500244140625, 0.1488037109375, 0.045867919921875, 0.1558837890625, 0.18347167...	embed
74732049_c0	74732049	haskell	0	Title: haskell sorting list of custom datatypes based on common atributes without usingf modules Problem title: haskell sorting list of custom datatypes based on common atributes without usingf modules Tags: sorting, pattern-matching, haskell, custom-data-attribute, algebraic-data-types Problem: haskell sorting list of...	haskell sorting list of custom datatypes based on common atributes without usingf modules haskell sorting list of custom datatypes based on common atributes without usingf modules sorting pattern-matching haskell custom-data-attribute algebraic-data-types Cuidado Comprar Medicar x:xs med7 med4 haskell sorting list of c...	[ -0.003875732421875, 0.00714111328125, 0.00787353515625, -0.002777099609375, 0.00799560546875, 0.004608154296875, -0.0162353515625, 0.0081787109375, 0.015869140625, 0.003753662109375, 0.00186920166015625, -0.0078125, 0.015625, -0.01373291015625, -0.00946044921875, -0.0177001953125, 0....	[ 1556, 142508, 12096, 214, 5303, 114122, 2053, 50986, 35509, 39210, 146256, 90, 15490, 17368, 420, 88996, 103510, 98753, 10135, 257, 191145, 429, 2844, 3003, 3812, 31, 15612, 3701, 142519, 42, 1022, 425, 128, 966, 617, 31577, 12989, 12921, 1...	[ 0.1348876953125, 0.21435546875, 0.20361328125, 0.03265380859375, 0.1488037109375, 0.2015380859375, 0.0841064453125, 0.251220703125, 0.048126220703125, 0.1419677734375, 0.201904296875, 0.01318359375, 0.0845947265625, 0.0552978515625, 0.0638427734375, 0.1148681640625, 0.175048828125, ...	embed
49199011_c0	49199011	haskell	0	Title: Defining new function as a composition of functions while adding additional behaviours Problem title: Defining new function as a composition of functions while adding additional behaviours Tags: haskell, functional-programming Problem: Defining new function as a composition of functions while adding additional b...	Defining new function as a composition of functions while adding additional behaviours Defining new function as a composition of functions while adding additional behaviours haskell functional-programming Defining Defining new function as a composition of functions while adding additional behaviours I have started to s...	[ 0.006072998046875, 0.007354736328125, -0.005584716796875, 0.00994873046875, 0.0091552734375, 0.022216796875, -0.0018157958984375, 0.0072021484375, 0.0322265625, -0.01068115234375, -0.00860595703125, 0.0022430419921875, 0.0262451171875, 0.0174560546875, -0.000911712646484375, 0.00860595...	[ 88606, 3525, 32354, 237, 166577, 111, 12960, 154107, 78301, 224833, 1556, 142508, 123309, 28966, 86869, 10078, 44402, 20625, 29806, 8337, 201505, 5303, 903, 2046, 136, 18499, 28412, 29458, 1284, 15190, 6097, 13315, 18151, 3917, 4527, 10644, 132...	[ 0.193603515625, 0.14697265625, 0.230224609375, 0.0396728515625, 0.2274169921875, 0.02178955078125, 0.10888671875, 0.1182861328125, 0.1376953125, 0.1773681640625, 0.08905029296875, 0.1917724609375, 0.1143798828125, 0.052398681640625, 0.0489501953125, 0.1943359375, 0.0985107421875, 0...	embed
8110567_c0	8110567	haskell	0	Title: getting error Prelude.read: no parse Problem title: getting error Prelude.read: no parse Tags: haskell Problem: getting error Prelude.read: no parse I am very new in haskell, i wrote the code for item details and search the detail for each item. type Code = Int type Name = String type Database = (Code,Name) text...	getting error Prelude.read: no parse getting error Prelude.read: no parse haskell Prelude.read Name Database textfile::IO base.txt fun::IO Please show1 textshow::IO show1::Code getting error Prelude.read: no parse I am very new in haskell, i wrote the code for item details and search the detail for each item. code for ...	[ 0.02197265625, -0.009033203125, 0.0101318359375, 0.0252685546875, 0.0225830078125, 0.0034942626953125, 0.0040283203125, -0.010986328125, 0.007080078125, -0.00787353515625, -0.007537841796875, -0.0191650390625, 0.002471923828125, -0.0118408203125, 0.006805419921875, -0.02294921875, 0....	[ 20949, 18499, 1914, 822, 112, 39116, 110, 366, 184, 1556, 142508, 15757, 187781, 7986, 29822, 17780, 3647, 124326, 7477, 7639, 31374, 114211, 3525, 54397, 18151, 35735, 41653, 33938, 22443, 2967, 20697, 4127, 11001, 2053, 114689, 15700, 141377,...	[ 0.07232666015625, 0.216552734375, 0.11669921875, 0.1903076171875, 0.1256103515625, 0.2197265625, 0.151611328125, 0.1883544921875, 0.176513671875, 0.144287109375, 0.21533203125, 0.0877685546875, 0.139404296875, 0.05389404296875, 0.103271484375, 0.126220703125, 0.134521484375, 0.1069...	embed
60518561_c1	60518561	haskell	1	resulting values is not a pure function, but may itself fail. I'm not a Haskell programmer but from the type of eval (Div x y) it seems be that of Maybe(Maybe Int) - which can simply be squashed , no? (Something like a flatten in Scala or join in Haskell). What really is the issue here? Irrespective of whether x,y are...	resulting values is not a pure function, but may itself fail. I'm not a Haskell programmer but from the type of eval (Div x y) it seems be that of Maybe(Maybe Int) - which can simply be squashed , no? (Something like a flatten in Scala or join in Haskell). What really is the issue here? Irrespective of whether x,y are...	[ -0.0223388671875, 0.004425048828125, 0.0220947265625, -0.0019378662109375, 0.0086669921875, 0.004730224609375, 0.017333984375, -0.0277099609375, 0.0194091796875, 0.00182342529296875, 0.0196533203125, 0.004119873046875, 0.002532958984375, 0.0067138671875, 0.008544921875, -0.024780273437...	[ 16750, 214, 142424, 83, 959, 34166, 32354, 1543, 68034, 35782, 20625, 142508, 77848, 10644, 28, 1405, 192576, 1022, 113, 37202, 83425, 82419, 372, 360, 18, 831, 42856, 232429, 297, 49878, 510, 152653, 11, 33284, 6183, 31089, 53, 9563, 64113...	[ 0.178466796875, 0.10125732421875, 0.200439453125, 0.001678466796875, 0.06072998046875, 0.15380859375, 0.1639404296875, 0.1351318359375, 0.1114501953125, 0.2164306640625, 0.08990478515625, 0.2244873046875, 0.09344482421875, 0.151123046875, 0.0113525390625, 0.2137451171875, 0.169799804...	embed
37184230_c1	37184230	haskell	1	-> case lookup n s of Nothing -> runStateT (makeNewTree n) s -- makeNewTree n s Just wt -> deRefWeak wt >>= \mt -> case mt of Nothing -> runStateT (makeNewTree n) s Just t -> return (t,s) makeNewTree :: Integer -> StateT TreeCache IO NTree makeNewTree n = StateT $ \s -> mdo wt <- mkWeak n t Nothing (ts, s') <- runStat...	-> case lookup n s of Nothing -> runStateT (makeNewTree n) s -- makeNewTree n s Just wt -> deRefWeak wt >>= \mt -> case mt of Nothing -> runStateT (makeNewTree n) s Just t -> return (t,s) makeNewTree :: Integer -> StateT TreeCache IO NTree makeNewTree n = StateT $ \s -> mdo wt <- mkWeak n t Nothing (ts, s') <- runStat...	[ -0.01080322265625, 0.0037994384765625, -0.00188446044921875, -0.0274658203125, 0.00860595703125, 0.0186767578125, -0.0181884765625, -0.000492095947265625, -0.0022735595703125, -0.055419921875, -0.00885009765625, 0.007171630859375, -0.0098876953125, 0.007598876953125, 0.007232666015625, ...	[ 33079, 7225, 6713, 2037, 653, 91, 111, 182747, 11675, 135206, 618, 55898, 46568, 62731, 13, 3249, 9563, 18, 8, 190015, 12137, 344, 808, 30646, 44401, 22836, 101344, 441, 46994, 17780, 107, 246, 62346, 20370, 74694, 20020, 142424, 22288, 422...	[ 0.0347900390625, 0.2060546875, 0.10198974609375, 0.13037109375, 0.066162109375, 0.02691650390625, 0.0848388671875, 0.150146484375, 0.0589599609375, 0.0772705078125, 0.1087646484375, 0.03997802734375, 0.08447265625, 0.2391357421875, 0.045623779296875, 0.06964111328125, 0.0611572265625...	embed
15302255_c0	15302255	haskell	0	Title: ByteCodeLink error with GHCi and C file Problem title: ByteCodeLink error with GHCi and C file Tags: cabal, ghci, haskell Problem: ByteCodeLink error with GHCi and C file When I run my file using a foreign import for a C function I made, I get this error. ByteCodeLink: can't find label During interactive linking...	ByteCodeLink error with GHCi and C file ByteCodeLink error with GHCi and C file cabal ghci haskell the ByteCodeLink GHCi During DLLs Restart Alternatively haskell.org ByteCodeLink error with GHCi and C file When I run my file using a foreign import for a C function I made, I get this error. After creating a .cabal file...	[ 0.02880859375, -0.00689697265625, 0.004913330078125, 0.01068115234375, -0.002288818359375, 0.01544189453125, 0.00689697265625, 0.0250244140625, -0.005218505859375, -0.04248046875, -0.01239013671875, -0.052734375, -0.0181884765625, 0.0015716552734375, 0.002593994140625, -0.01171875, 0...	[ 3311, 67, 114211, 64287, 18499, 678, 527, 73265, 14, 136, 313, 11435, 109524, 31380, 318, 1556, 142508, 133698, 391, 23708, 853, 17137, 1478, 11675, 17368, 110613, 24927, 32354, 7228, 903, 105233, 408, 3571, 72367, 7464, 2046, 25647 ]	[ 0.10546875, 0.1455078125, 0.2132568359375, 0.2315673828125, 0.19384765625, 0.094970703125, 0.1064453125, 0.152587890625, 0.2010498046875, 0.06439208984375, 0.143310546875, 0.15380859375, 0.233642578125, 0.1094970703125, 0.1337890625, 0.1295166015625, 0.2352294921875, 0.052185058593...	embed
15343806_c0	15343806	haskell	0	Title: Can't use list of typeclasses inside data declaration Problem title: Can't use list of typeclasses inside data declaration Tags: haskell, typeclass Problem: Can't use list of typeclasses inside data declaration I'm new to Haskell and I like the programming approach of it a lot! I've been running into t...	Can't use list of typeclasses inside data declaration Can't use list of typeclasses inside data declaration haskell typeclass Can Part Event NoteEvent DecrescendoEvent VolumeEvent KeyEvent Can't use list of typeclasses inside data declaration I'm new to Haskell and I like the programming approach of it a lot!...	[ 0.00145721435546875, 0.00958251953125, 0.009765625, -0.0019378662109375, -0.01214599609375, 0.00008821487426757812, -0.00139617919921875, 0.00177001953125, 0.0029296875, -0.040283203125, -0.009765625, -0.026123046875, -0.00007581710815429688, 0.0164794921875, -0.027587890625, -0.013610...	[ 4171, 3768, 4527, 5303, 10644, 67413, 90, 46132, 2053, 21635, 18, 1556, 142508, 16995, 36943, 18622, 192134, 262, 124165, 4017, 98872, 26824, 3525, 20625, 1884, 56037, 51515, 2967, 116, 128120, 4488, 55681, 31425, 18151, 86673, 100, 19612, 38...	[ 0.043609619140625, 0.0728759765625, 0.1256103515625, 0.1640625, 0.2291259765625, 0.25830078125, 0.031585693359375, 0.133544921875, 0.155029296875, 0.189453125, 0.0298004150390625, 0.117919921875, 0.2022705078125, 0.130126953125, 0.20849609375, 0.182373046875, 0.2127685546875, 0.134...	embed
37770984_c1	37770984	haskell	1	questions here: First, the pragmatic one. How to solve the problem at hand, without getting into the Reader monad, which might involve changing a lot of function signatures across my app. Second, the one oriented to learning. Haskell has immutable values , which is understood and appreciated. Does it even have immutab...	questions here: First, the pragmatic one. How to solve the problem at hand, without getting into the Reader monad, which might involve changing a lot of function signatures across my app. Second, the one oriented to learning. Haskell has immutable values , which is understood and appreciated. Does it even have immutab...	[ 0.01806640625, 0.0034332275390625, 0.002044677734375, -0.0205078125, 0.018310546875, 0.00150299072265625, 0.0211181640625, -0.0150146484375, 0.000751495361328125, -0.0289306640625, -0.00457763671875, -0.0181884765625, -0.001983642578125, -0.01202392578125, 0.01068115234375, 0.000999450...	[ 17582, 3688, 147118, 1771, 1632, 11249, 47, 86869, 2967, 3535, 15490, 122636, 2667, 712, 13648, 151134, 5915, 32354, 138256, 36880, 759, 4027, 77648, 23509, 297, 52080, 20625, 142508, 1556, 566, 561, 22819, 142424, 217064, 77947, 3853, 765, 7...	[ 0.1083984375, 0.041839599609375, 0.1497802734375, 0.03302001953125, 0.014373779296875, 0.037811279296875, 0.0345458984375, 0.1661376953125, 0.1451416015625, 0.06414794921875, 0.1075439453125, 0.269287109375, 0.07855224609375, 0.0799560546875, 0.02398681640625, 0.09442138671875, 0.036...	embed
5367167_c0	5367167	haskell	0	Title: Haskell record syntax Problem title: Haskell record syntax Tags: syntactic-sugar, syntax, layout, haskell Problem: Haskell record syntax Haskell's record syntax is considered by many to be a wart on an otherwise elegant language, on account of its ugly syntax and namespace pollution. On the other hand it's often...	Haskell record syntax Haskell record syntax syntactic-sugar syntax layout haskell Haskell Foo Show Haskell record syntax Haskell's record syntax is considered by many to be a wart on an otherwise elegant language, on account of its ugly syntax and namespace pollution. On the other hand it's often more useful than the p...	[ 0.020751953125, 0.0201416015625, 0.0038299560546875, 0.0186767578125, 0.0033416748046875, 0.00604248046875, -0.0155029296875, 0.007232666015625, 0.001373291015625, -0.00836181640625, -0.0030670166015625, 0.00159454345703125, -0.01220703125, -0.007049560546875, 0.00238037109375, -0.0285...	[ 20625, 142508, 17164, 6002, 86531, 102, 49086, 1159, 1970, 108802, 1556, 9572, 31, 17367, 90698, 5941, 186, 10, 1631, 18, 98, 120262, 27650, 46876, 15426, 75, 110608, 136, 210716, 210115, 27983, 1286, 80234, 19069, 35509, 30700, 175399, 21635...	[ 0.1517333984375, 0.2666015625, 0.23974609375, 0.1697998046875, 0.201904296875, 0.119140625, 0.041351318359375, 0.1148681640625, 0.154541015625, 0.1871337890625, 0.1214599609375, 0.1876220703125, 0.15576171875, 0.16552734375, 0.0799560546875, 0.038116455078125, 0.04931640625, 0.0329...	embed
47042731_c0	47042731	haskell	0	Title: Eta reduction in haskell Problem title: Eta reduction in haskell Tags: haskell, reduction Problem: Eta reduction in haskell I tried for a long time to reduct this function in haskell, I want to express for example: mySum x y = x + y mySum x y = (+) x y mySum x = (+) x mySum = (+) -- it's Messi's goal! My functio...	Eta reduction in haskell Eta reduction in haskell haskell reduction Eta Messi Eta reduction in haskell I tried for a long time to reduct this function in haskell, I want to express for example: My function it a little more complex, but I really can't do it, I was looking out here and there, and I know there are some te...	[ -0.00482177734375, -0.004241943359375, 0.0111083984375, 0.0262451171875, -0.00035858154296875, 0.00732421875, -0.013427734375, 0.0032806396484375, -0.01324462890625, -0.026123046875, 0.002471923828125, 0.00518798828125, -0.00164794921875, 0.00567626953125, -0.001861572265625, -0.011108...	[ 25623, 456, 77391, 23, 1556, 142508, 33024, 37842, 4989, 1733, 74906, 18, 903, 32354, 3444, 36510, 27781, 10176, 1286, 27140, 6183, 831, 54, 442, 16487, 1810, 3714, 3060, 53088, 2811, 40383, 7108, 5609, 4527, 147505, 4163, 179933, 3688, 504...	[ 0.2978515625, 0.188720703125, 0.1829833984375, 0.055511474609375, 0.1497802734375, 0.2371826171875, 0.283447265625, 0.08453369140625, 0.06390380859375, 0.044525146484375, 0.1856689453125, 0.17041015625, 0.060272216796875, 0.17431640625, 0.0247039794921875, 0.1181640625, 0.07666015625...	embed
58755712_c0	58755712	haskell	0	Title: using list comprehension how do i calculate how many digits there are in a list of characters Problem title: using list comprehension how do i calculate how many digits there are in a list of characters Tags: haskell Problem: using list comprehension how do i calculate how many digits there are in a list of char...	using list comprehension how do i calculate how many digits there are in a list of characters using list comprehension how do i calculate how many digits there are in a list of characters haskell list Char x:xs using list comprehension how do i calculate how many digits there are in a list of characters I need to calcu...	[ -0.00421142578125, 0.0031280517578125, 0.003509521484375, 0.0101318359375, 0.00156402587890625, 0.01116943359375, 0.0072021484375, 0.027099609375, 0.0264892578125, -0.01171875, -0.01312255859375, -0.035888671875, 0.0206298828125, 0.0228271484375, -0.026123046875, -0.01544189453125, 0...	[ 17368, 5303, 46683, 3220, 6889, 3642, 17, 74481, 67, 5941, 153939, 7, 2685, 621, 23, 124850, 1556, 142508, 21656, 1022, 12, 425, 14012, 108975, 20625, 195625, 1830, 237875, 4527, 418, 363, 617, 11, 71, 420, 35166, 190, 77546, 12989, 32354...	[ 0.09375, 0.2000732421875, 0.154296875, 0.1614990234375, 0.06268310546875, 0.07275390625, 0.038665771484375, 0.173828125, 0.0697021484375, 0.1273193359375, 0.2232666015625, 0.1005859375, 0.0914306640625, 0.0732421875, 0.0633544921875, 0.1971435546875, 0.13525390625, 0.2296142578125,...	embed
39087731_c0	39087731	haskell	0	Title: CPP within Haddock Problem title: CPP within Haddock Tags: haskell, haddock, c-preprocessor Problem: CPP within Haddock I can change haddocks based on a flag if I put the entire block within the CPP conditional branches: #if SOME_MACRO -- \| Whether SOME_MACRO is true -- >>> someMacro -- True someMacro :: Bool so...	CPP within Haddock CPP within Haddock haskell haddock c-preprocessor CPP Haddock SOME_MACRO Whether Bool CPP within Haddock I can change haddocks based on a flag if I put the entire block within the CPP conditional branches: And the documentation looks as you'd expect it to, and doctest also works as expected. But that...	[ 0.00015735626220703125, 0.00506591796875, 0.000640869140625, 0.00726318359375, -0.000865936279296875, 0.0341796875, 0.032470703125, -0.007049560546875, -0.004791259765625, 0.015625, -0.0166015625, -0.0032196044921875, -0.007568359375, 0.0016937255859375, 0.006134033203125, 0.0004673004...	[ 313, 17487, 28032, 28129, 138414, 1556, 142508, 1902, 501, 4692, 63923, 91245, 14255, 156458, 2460, 929, 831, 15549, 7, 35509, 49938, 3884, 64194, 46389, 35431, 289, 90356, 209806, 33342, 41206, 51584, 6954, 43240, 84751, 121097, 17431, 45296, ...	[ 0.1104736328125, 0.31005859375, 0.153076171875, 0.1947021484375, 0.265625, 0.0830078125, 0.1846923828125, 0.1524658203125, 0.00390625, 0.1014404296875, 0.09051513671875, 0.008697509765625, 0.048431396484375, 0.0303497314453125, 0.099853515625, 0.18603515625, 0.003082275390625, 0.19...	embed
40899314_c0	40899314	haskell	0	Title: Accepting input using Haskell Problem title: Accepting input using Haskell Tags: input, haskell Problem: Accepting input using Haskell I have to read input as: 1 <- number of lines next 10 20 30 2 <- number of lines next 5 5 5 6 8 9 0 <- terminating condition The output should be: output of f[(10,20,30)] output ...	Accepting input using Haskell Accepting input using Haskell input haskell Haskell Accepting Case n:m:o:rest Accepting input using Haskell I have to read input as: The output should be: I also need to print the case number: eg. The function which produces the output has type: f :: [(Int,Int,Int)] -> Int I am using it as...	[ -0.0074462890625, 0.00640869140625, -0.01483154296875, 0.000827789306640625, -0.003997802734375, 0.017822265625, 0.00021266937255859375, -0.007232666015625, 0.005950927734375, -0.018310546875, 0.0166015625, -0.0159912109375, 0.004425048828125, -0.0030975341796875, 0.0064697265625, -0.0...	[ 111383, 107730, 17368, 20625, 142508, 214, 1556, 43731, 653, 39, 31, 56644, 87, 765, 12301, 237, 140992, 5608, 186, 3871, 28412, 70, 7225, 14012, 32354, 27489, 7, 10644, 1238, 1984, 4153, 18, 33079, 360, 109312, 7103, 1632, 3034, 1284, 13...	[ 0.1884765625, 0.21875, 0.0787353515625, 0.155517578125, 0.24658203125, 0.0159912109375, 0.1435546875, 0.1593017578125, 0.022216796875, 0.0242767333984375, 0.10162353515625, 0.16748046875, 0.00018310546875, 0.043670654296875, 0.1781005859375, 0.1033935546875, 0.198974609375, 0.06237...	embed
43904910_c1	43904910	haskell	1	I don't compile with -threaded. I tried increasing the number of fractions to 2000000 main = print $ parAddFracs $ toReciprocal $ intList 2000000 and compiling with -threaded, +RTS -N1 runs in ~17.8 seconds and +RTS -N4 runs in ~15.6 seconds. When running with +RTS -N4 I see the cpu usage is between ~120% and ~350%, b...	I don't compile with -threaded. I tried increasing the number of fractions to 2000000 main = print $ parAddFracs $ toReciprocal $ intList 2000000 and compiling with -threaded, +RTS -N1 runs in ~17.8 seconds and +RTS -N4 runs in ~15.6 seconds. When running with +RTS -N4 I see the cpu usage is between ~120% and ~350%, b...	[ -0.021484375, 0.007293701171875, -0.0042724609375, 0.0005950927734375, -0.003631591796875, 0.004119873046875, -0.01177978515625, -0.001739501953125, -0.010986328125, -0.006988525390625, -0.004150390625, 0.008544921875, 0.009033203125, 0.004547119140625, -0.006134033203125, -0.004638671...	[ 87, 2301, 18, 9969, 1340, 678, 20, 927, 39116, 297, 37842, 118055, 14012, 175921, 116, 197094, 5201, 28412, 366, 4028, 108386, 4439, 47, 318, 3454, 23, 154663, 49725, 997, 20503, 294, 839, 418, 127877, 176391, 94131, 617, 124525, 51042, 1...	[ 0.009796142578125, 0.0455322265625, 0.0858154296875, 0.1954345703125, 0.1778564453125, 0.08544921875, 0.010040283203125, 0.0290985107421875, 0.1978759765625, 0.13134765625, 0.0263519287109375, 0.1033935546875, 0.0218353271484375, 0.2132568359375, 0.030364990234375, 0.1343994140625, 0...	embed
79297359_c0	79297359	haskell	0	Title: How to exclude field record wildcard imports from ghc -Wmissing-import-lists? Problem title: How to exclude field record wildcard imports from ghc -Wmissing-import-lists? Tags: haskell, ghc Problem: How to exclude field record wildcard imports from ghc -Wmissing-import-lists? I'd like to get the behavior of -Xmi...	How to exclude field record wildcard imports from ghc -Wmissing-import-lists? How to exclude field record wildcard imports from ghc -Wmissing-import-lists? haskell ghc ghc Prelude How Wmissing-import-lists Xmissing-import-lists XNoImplicitPrelude Bool NoFieldSelectors OverloadedRecordDot How to exclude field record wil...	[ -0.00015735626220703125, -0.01416015625, -0.00921630859375, 0.01214599609375, -0.01483154296875, 0.01202392578125, 0.01446533203125, 0.0086669921875, 0.00543212890625, 0.01385498046875, 0.00341796875, -0.0029754638671875, 0.00640869140625, -0.0003604888916015625, -0.00244140625, -0.023...	[ 11249, 47, 39041, 112, 44457, 17164, 56409, 38931, 24927, 7, 1295, 31380, 238, 1456, 45188, 214, 60270, 6562, 1556, 142508, 1914, 822, 601, 1193, 5021, 128878, 60923, 19273, 2460, 929, 438, 6159, 19388, 4233, 187075, 9578, 63033, 297, 32271...	[ 0.06756591796875, 0.00732421875, 0.192626953125, 0.07611083984375, 0.1904296875, 0.1964111328125, 0.1474609375, 0.206298828125, 0.2425537109375, 0.06524658203125, 0.044830322265625, 0.087890625, 0.12060546875, 0.05670166015625, 0.158203125, 0.089111328125, 0.218505859375, 0.1717529...	embed
30305439_c0	30305439	haskell	0	Title: Can I save regex state for next input? Problem title: Can I save regex state for next input? Tags: regex, finite-automata, haskell Problem: Can I save regex state for next input? I parse TCP packets with some data and this data can divided in several packets. I can't save packets, so after passing first packet I...	Can I save regex state for next input? Can I save regex state for next input? regex finite-automata haskell Text.Regex.TDFA System.Environment Can Seq.hs inpStr1 Bool inpStr2 Can I save regex state for next input? I parse TCP packets with some data and this data can divided in several packets. I can't save packets, so ...	[ -0.000804901123046875, 0.0108642578125, -0.00811767578125, 0.04736328125, -0.000728607177734375, 0.0162353515625, 0.01483154296875, 0.0242919921875, 0.00628662109375, -0.0177001953125, 0.007080078125, 0.022705078125, 0.01361083984375, 0.015869140625, -0.00189208984375, 0.0078125, 0.0...	[ 4171, 30098, 6835, 3355, 11341, 100, 11737, 107730, 87, 94418, 52344, 11, 1556, 142508, 24129, 54601, 14676, 12353, 686, 1900, 503, 864, 127, 7, 23, 254, 71713, 418, 2460, 929, 304, 366, 184, 17854, 43824, 7831, 2053, 101637, 40368, 831, ...	[ 0.07415771484375, 0.2039794921875, 0.161865234375, 0.21875, 0.177001953125, 0.09033203125, 0.126708984375, 0.1605224609375, 0.0238494873046875, 0.0914306640625, 0.1160888671875, 0.052978515625, 0.0701904296875, 0.205810546875, 0.06561279296875, 0.079833984375, 0.1156005859375, 0.05...	embed
59595690_c0	59595690	haskell	0	Title: How do the requirements for the instances of the Applicative type class relate to their implementations for Functor Problem title: How do the requirements for the instances of the Applicative type class relate to their implementations for Functor Tags: typeclass, haskell, functor, applicative Problem: How do the...	How do the requirements for the instances of the Applicative type class relate to their implementations for Functor How do the requirements for the instances of the Applicative type class relate to their implementations for Functor typeclass haskell functor applicative How Applicative Functor How do the requirements fo...	[ 0.01043701171875, 0.00433349609375, 0.015380859375, 0.0234375, -0.00732421875, 0.0224609375, -0.00124359130859375, -0.01116943359375, 0.0255126953125, 0.0194091796875, -0.00592041015625, -0.025146484375, -0.005889892578125, 0.018798828125, -0.005828857421875, -0.01513671875, 0.017089...	[ 11249, 96679, 110527, 5659, 11048, 4935, 10644, 18507, 33444, 208124, 28670, 18770, 7, 67413, 1556, 142508, 7477, 41816, 100, 20625, 35773, 209806, 11907, 8110, 40407, 22759, 91736, 182324, 34166, 3447, 81, 166577, 75, 148, 12840, 178851, 8780,...	[ 0.0880126953125, 0.2186279296875, 0.2261962890625, 0.1822509765625, 0.21240234375, 0.1890869140625, 0.1890869140625, 0.2227783203125, 0.109130859375, 0.172607421875, 0.17919921875, 0.170654296875, 0.007720947265625, 0.123291015625, 0.12109375, 0.2359619140625, 0.0921630859375, 0.16...	embed
5354431_c0	5354431	haskell	0	Title: How to get the type as a String in Haskell? Problem title: How to get the type as a String in Haskell? Tags: introspection, haskell, reflection Problem: How to get the type as a String in Haskell? Let's say I have a type MyType defined in module My.Module. I want to have the String "My.Module.MyType" (or somethi...	How to get the type as a String in Haskell? How to get the type as a String in Haskell? introspection haskell reflection How Haskell My.Module MyType MyType2 MyConstructor2 My.Module.MyType My.Module.MyType2 How to get the type as a String in Haskell? Let's say I have a type MyType defined in module My.Module. I want t...	[ -0.004669189453125, -0.0005340576171875, -0.0032501220703125, 0.0341796875, -0.00396728515625, 0.01904296875, 0.00109100341796875, 0.0068359375, -0.003143310546875, -0.0267333984375, 0.007110595703125, -0.013671875, -0.004486083984375, 0.0030517578125, -0.0034637451171875, 0.0053405761...	[ 11249, 47, 2046, 70, 10644, 237, 10, 23351, 214, 23, 20625, 142508, 64627, 16711, 1556, 44961, 2646, 91616, 196707, 304, 36716, 8782, 31852, 61924, 88996, 3444, 105237, 13648, 11417, 31, 9351, 65572, 3714, 9969, 169463, 140992, 16487, 100, ...	[ 0.0506591796875, 0.012451171875, 0.1214599609375, 0.0609130859375, 0.28564453125, 0.16552734375, 0.1141357421875, 0.19580078125, 0.140869140625, 0.09283447265625, 0.1339111328125, 0.23046875, 0.0487060546875, 0.0780029296875, 0.1019287109375, 0.1260986328125, 0.1220703125, 0.062133...	embed
69439965_c0	69439965	haskell	0	Title: Map then filter in Haskell Problem title: Map then filter in Haskell Tags: higher-order-functions, functional-programming, map-function, haskell, filtering Problem: Map then filter in Haskell I want to Map an Integer type list in Haskell, and then if the map function returns Nothing I want to discard the result....	Map then filter in Haskell Map then filter in Haskell higher-order-functions functional-programming map-function haskell filtering Map Haskell Integer Maybe Just Nothing Map then filter in Haskell I want to Map an Integer type list in Haskell, and then if the map function returns Nothing I want to discard the result. T...	[ -0.00970458984375, -0.004425048828125, -0.006256103515625, -0.01397705078125, 0.002777099609375, 0.01904296875, -0.004486083984375, -0.004974365234375, 0.006805419921875, 0.000774383544921875, -0.0201416015625, -0.01434326171875, -0.01324462890625, 0.0159912109375, 0.002838134765625, -...	[ 42719, 7068, 46312, 23, 20625, 142508, 77546, 80596, 137175, 123309, 28966, 22288, 1556, 44401, 83425, 9563, 182747, 3444, 47, 10644, 5303, 2174, 32354, 30646, 17116, 5861, 16750, 31577, 33022, 138256, 17569, 214552, 3525, 115992, 44691, 18822, ...	[ 0.239501953125, 0.2156982421875, 0.261474609375, 0.0203704833984375, 0.13623046875, 0.231689453125, 0.037872314453125, 0.1258544921875, 0.148681640625, 0.1142578125, 0.0740966796875, 0.2236328125, 0.1138916015625, 0.1949462890625, 0.1038818359375, 0.045623779296875, 0.1728515625, 0...	embed
70067203_c0	70067203	haskell	0	Title: Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) Problem title: Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) Tags: fold, string, list, haskell Problem: Create a function that takes a string (so...	Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) fold string list haskell Create Asdf c:c1 Create a function that takes a string (some sentence) and split ...	[ -0.007110595703125, -0.00933837890625, -0.027099609375, 0.0201416015625, -0.02392578125, 0.003662109375, 0.008056640625, 0.004669189453125, 0.020751953125, -0.0120849609375, 0.004119873046875, 0.003936767578125, -0.00787353515625, 0.0042724609375, 0.00341796875, 0.009765625, -0.00384...	[ 151313, 32354, 450, 51776, 79315, 149357, 16, 136, 65450, 3934, 5303, 370, 99726, 47416, 140909, 2565, 43452, 42822, 1556, 142508, 1301, 71, 420, 501, 12, 238, 418, 111, 208124, 33342, 1884, 18499, 831, 959, 26366, 1810, 103510, 132283 ]	[ 0.147705078125, 0.2142333984375, 0.0411376953125, 0.1199951171875, 0.216552734375, 0.1895751953125, 0.019073486328125, 0.0443115234375, 0.1961669921875, 0.0965576171875, 0.1737060546875, 0.1248779296875, 0.2257080078125, 0.1204833984375, 0.1138916015625, 0.11962890625, 0.017471313476...	embed
10913063_c1	10913063	haskell	1	receive socket [] putStrLn $ unwords ["Received response : ",unpack reply])) serverMain :: IO () serverMain = withContext 1 (\context-> do putStrLn "Listening at 5554" withSocket context Rep $ (\socket-> do connect socket "tcp://127.0.0.1:5554" forever $ do message<-receive socket [] -- this throws an IO Exception putS...	receive socket [] putStrLn $ unwords ["Received response : ",unpack reply])) serverMain :: IO () serverMain = withContext 1 (\context-> do putStrLn "Listening at 5554" withSocket context Rep $ (\socket-> do connect socket "tcp://127.0.0.1:5554" forever $ do message<-receive socket [] -- this throws an IO Exception putS...	[ 0.01025390625, 0.01336669921875, -0.00836181640625, 0.03271484375, 0.00860595703125, 0.01202392578125, 0.001617431640625, -0.007720947265625, 0.0030059814453125, -0.03369140625, 0.0137939453125, -0.0126953125, 0.03515625, 0.00201416015625, -0.01312255859375, 0.01019287109375, 0.01708...	[ 53299, 221, 27853, 3884, 71713, 866, 3650, 51, 47416, 329, 14, 4126, 57553, 309, 29102, 75836, 10723, 168793, 17780, 678, 22829, 154663, 214, 99, 190, 163670, 8912, 43701, 33742, 991, 37067, 121422, 1530, 129884, 28565, 12338, 136993, 26008, ...	[ 0.19970703125, 0.1080322265625, 0.188232421875, 0.125732421875, 0.10791015625, 0.04095458984375, 0.053802490234375, 0.07427978515625, 0.1842041015625, 0.11962890625, 0.025390625, 0.05853271484375, 0.1162109375, 0.052520751953125, 0.1898193359375, 0.1051025390625, 0.16162109375, 0.1...	embed
17525149_c0	17525149	haskell	0	Title: Create List of Strings in Haskell Problem title: Create List of Strings in Haskell Tags: haskell Problem: Create List of Strings in Haskell I am making the pilgrimage from Java to Haskell. Broadly speaking, I get the main concepts behind Haskell. Reading all the tutorials and books 'makes sense' but I am getting...	Create List of Strings in Haskell Create List of Strings in Haskell haskell Create List Strings Haskell Create List of Strings in Haskell I am making the pilgrimage from Java to Haskell. Broadly speaking, I get the main concepts behind Haskell. Reading all the tutorials and books 'makes sense' but I am getting stuck wr...	[ 0.01202392578125, 0.00799560546875, -0.0133056640625, 0.00982666015625, -0.0086669921875, 0.02392578125, -0.0093994140625, -0.00457763671875, -0.004486083984375, 0.0223388671875, 0.0050048828125, -0.033203125, 0.0145263671875, 0.01495361328125, -0.00830078125, 0.01043701171875, 0.009...	[ 151313, 32036, 111, 23351, 5180, 20625, 142508, 23, 1556, 37926, 1295, 41925, 47, 23755, 50155, 57143, 42840, 10422, 179933, 32562, 10002, 18151, 206597, 3444, 28282, 4382, 102158, 11435, 5426, 123055, 1176, 29822, 115187, 124326, 14105, 70541, ...	[ 0.1190185546875, 0.227294921875, 0.06134033203125, 0.2269287109375, 0.1806640625, 0.145751953125, 0.219482421875, 0.05743408203125, 0.1336669921875, 0.02349853515625, 0.0264739990234375, 0.1080322265625, 0.023468017578125, 0.0435791015625, 0.029022216796875, 0.0550537109375, 0.004516...	embed
2437103_c0	2437103	haskell	0	Title: Invoke Haskell function with heterogeneous arguments? Problem title: Invoke Haskell function with heterogeneous arguments? Tags: haskell, types, xml Problem: Invoke Haskell function with heterogeneous arguments? I'm currently working on a Haskell project which automatically tests some functions based on an XML s...	Invoke Haskell function with heterogeneous arguments? Invoke Haskell function with heterogeneous arguments? haskell types xml Invoke Haskell Invoke Haskell function with heterogeneous arguments? I'm currently working on a Haskell project which automatically tests some functions based on an XML specification. The XML sp...	[ 0.005706787109375, -0.0025634765625, -0.002838134765625, -0.00250244140625, 0.00738525390625, 0.0052490234375, -0.012451171875, -0.00537109375, -0.0150146484375, -0.009521484375, -0.00170135498046875, -0.04931640625, -0.005035400390625, 0.00238037109375, -0.0016937255859375, -0.0076293...	[ 360, 23253, 20625, 142508, 32354, 678, 77099, 15292, 10821, 10750, 7, 13, 1556, 52895, 131492, 20697, 13452, 191082, 109921, 35509, 92537, 29458, 76199, 12638, 84751, 16750, 22691, 5941, 12921, 125663, 1295, 366, 12301, 23, 17368, 2046, 1810, ...	[ 0.0474853515625, 0.166259765625, 0.1473388671875, 0.261474609375, 0.1973876953125, 0.05621337890625, 0.2266845703125, 0.1904296875, 0.05084228515625, 0.2353515625, 0.0411376953125, 0.0189208984375, 0.11865234375, 0.1552734375, 0.18115234375, 0.029022216796875, 0.00927734375, 0.1217...	embed
39819495_c0	39819495	haskell	0	Title: How to use Monad.Writer for tracing? Problem title: How to use Monad.Writer for tracing? Tags: monads, haskell, trace Problem: How to use Monad.Writer for tracing? My code looks like this: I would like to use tell inside the tokenize function in order to write to the same Writer Monad. Is this possible ? tokeniz...	How to use Monad.Writer for tracing? How to use Monad.Writer for tracing? monads haskell trace How Monad.Writer T.Text Token T.null T.snoc T.head T.tail W.Writer W.tell W.runWriter forM_ How to use Monad.Writer for tracing? My code looks like this: I would like to use tell inside the tokenize function in order to write...	[ -0.02197265625, 0.0179443359375, -0.00970458984375, 0.0098876953125, -0.0018463134765625, -0.0189208984375, -0.00543212890625, -0.0091552734375, -0.00885009765625, -0.0302734375, -0.00408935546875, 0.02490234375, 0.003631591796875, -0.0164794921875, 0.009033203125, -0.00677490234375, ...	[ 11249, 47, 4527, 60331, 71, 1456, 2783, 56, 100, 1152, 21896, 5, 2667, 712, 7, 1556, 142508, 144851, 384, 174379, 717, 1098, 139550, 54387, 31251, 46741, 601, 67, 1181, 16428, 18151, 33342, 2806, 1884, 14192, 46132, 20650, 32354, 33022, 5...	[ 0.07379150390625, 0.087890625, 0.1025390625, 0.17529296875, 0.1737060546875, 0.1043701171875, 0.2119140625, 0.1868896484375, 0.047882080078125, 0.19384765625, 0.1600341796875, 0.017974853515625, 0.08917236328125, 0.1510009765625, 0.02447509765625, 0.0958251953125, 0.1900634765625, ...	embed
26724889_c0	26724889	haskell	0	Title: Replace only the head of the list in haskell? Problem title: Replace only the head of the list in haskell? Tags: haskell Problem: Replace only the head of the list in haskell? I have a list like: [[0,0,0,1,0],[1,0,0,1,0],[0,0,1,1,0],[0,0,0,0,0],[1,0,0,0,1]] and I want to replace the head of this list, which is [...	Replace only the head of the list in haskell? Replace only the head of the list in haskell? haskell Replace RandomGen Float Nothing Just i-1 Replace only the head of the list in haskell? I have a list like: [[0,0,0,1,0],[1,0,0,1,0],[0,0,1,1,0],[0,0,0,0,0],[1,0,0,0,1]] and I want to replace the head of this list, which ...	[ -0.02001953125, 0.007293701171875, 0.00537109375, -0.00009441375732421875, 0.003570556640625, 0.0026092529296875, 0.000782012939453125, -0.00927734375, 0.01611328125, -0.01373291015625, 0.022216796875, 0.017333984375, 0.002899169921875, -0.001708984375, 0.0048828125, -0.000968933105468...	[ 853, 23935, 4734, 10336, 111, 5303, 23, 1556, 142508, 32, 39643, 306, 105376, 38699, 257, 182747, 9563, 17, 5759, 70, 765, 1884, 2389, 63527, 206808, 76172, 3444, 47, 91995, 903, 6, 678, 304, 133063, 2046, 110558, 5, 831, 32354, 30646 ]	[ 0.0751953125, 0.1929931640625, 0.136962890625, 0.22412109375, 0.1129150390625, 0.2125244140625, 0.094970703125, 0.186767578125, 0.270263671875, 0.0226593017578125, 0.1390380859375, 0.07415771484375, 0.1829833984375, 0.1480712890625, 0.052581787109375, 0.13134765625, 0.048828125, 0....	embed
44744884_c0	44744884	haskell	0	Title: What does deriving do/mean in Haskell? Problem title: What does deriving do/mean in Haskell? Tags: deriving, functional-programming, haskell Problem: What does deriving do/mean in Haskell? The definition of deriving on stack overflow is: "In Haskell, a derived instance is an instance declaration that is generate...	What does deriving do/mean in Haskell? What does deriving do/mean in Haskell? deriving functional-programming haskell What Haskell BaseballPlayer Pitcher Catcher Infielder Outfielder Show Bool What does deriving do/mean in Haskell? The definition of deriving on stack overflow is: I don't really understand any of it to ...	[ 0.0341796875, 0.0040283203125, 0.0037078857421875, 0.016357421875, 0.0157470703125, 0.0194091796875, 0.00537109375, 0.0106201171875, 0.007354736328125, -0.0174560546875, -0.002349853515625, -0.01531982421875, 0.01104736328125, -0.0002155303955078125, -0.0296630859375, -0.0096435546875,...	[ 4865, 14602, 16406, 6496, 54, 282, 66, 23, 20625, 142508, 123309, 28966, 1556, 44978, 12126, 142581, 45533, 5372, 18826, 28394, 56, 13538, 17367, 2460, 929, 64, 80934, 111, 98, 177261, 645, 118664, 83, 28219, 2499, 442, 42551, 18151, 2367, ...	[ 0.0855712890625, 0.0703125, 0.2119140625, 0.260009765625, 0.10162353515625, 0.1031494140625, 0.134765625, 0.052154541015625, 0.12255859375, 0.25048828125, 0.133544921875, 0.0965576171875, 0.115966796875, 0.06805419921875, 0.062042236328125, 0.13720703125, 0.06085205078125, 0.068786...	embed
67855059_c0	67855059	haskell	0	Title: Breaking a list on a given value into a list of sublists Problem title: Breaking a list on a given value into a list of sublists Tags: sublist, recursion, list, haskell Problem: Breaking a list on a given value into a list of sublists The multipleLists function needs to remove a given value from a list and retur...	Breaking a list on a given value into a list of sublists Breaking a list on a given value into a list of sublists sublist recursion list haskell Breaking x:xs Breaking a list on a given value into a list of sublists The multipleLists function needs to remove a given value from a list and return a list of lists. These s...	[ -0.0177001953125, 0.00051116943359375, -0.002349853515625, 0.00106048583984375, -0.025634765625, 0.0113525390625, 0.003326416015625, -0.00482177734375, 0.02392578125, 0.0037994384765625, 0.0002384185791015625, 0.01324462890625, 0.01422119140625, 0.01214599609375, 0.005706787109375, 0.0...	[ 91365, 5303, 98, 34475, 34292, 3934, 111, 1614, 6562, 195625, 1830, 1556, 142508, 1022, 12, 425, 48716, 154663, 7, 32354, 27117, 47, 87388, 1295, 136, 30646, 21115, 12638, 12830, 24189, 5962, 184750, 96276, 3525, 4034, 5351, 44691, 70, 1202...	[ 0.2054443359375, 0.2135009765625, 0.070068359375, 0.0599365234375, 0.138671875, 0.09716796875, 0.0341796875, 0.2025146484375, 0.238037109375, 0.11474609375, 0.01458740234375, 0.078369140625, 0.1661376953125, 0.06378173828125, 0.0263214111328125, 0.07391357421875, 0.2398681640625, 0...	embed
69960701_c0	69960701	haskell	0	Title: Pascal Triangle Find position x, y with Haskell function Problem title: Pascal Triangle Find position x, y with Haskell function Tags: pascals-triangle, haskell Problem: Pascal Triangle Find position x, y with Haskell function I want to get 2 integers from an input like pascal 2 1. This input should be 2, becaus...	Pascal Triangle Find position x, y with Haskell function Pascal Triangle Find position x, y with Haskell function pascals-triangle haskell Pascal Triangle Find Haskell Invalid row-1 pos-1 Unexpected You BlockArguments Pascal Triangle Find position x, y with Haskell function I want to get 2 integers from an input like p...	[ -0.01373291015625, 0.0115966796875, 0.0201416015625, -0.00347900390625, 0.017333984375, 0.005859375, 0.009765625, -0.00457763671875, 0.0035858154296875, 0.01092529296875, 0.01336669921875, -0.0201416015625, -0.00616455078125, 0.005584716796875, -0.0269775390625, 0.0064697265625, -0.0...	[ 167599, 4699, 109217, 26040, 19069, 1022, 4, 113, 678, 20625, 142508, 32354, 452, 6827, 7, 3996, 1556, 7013, 15555, 5759, 3864, 992, 83613, 13, 2583, 80231, 7614, 1234, 3444, 2046, 116, 892, 26255, 1295, 107730, 1884, 615, 5608, 70, 5303,...	[ 0.210205078125, 0.1676025390625, 0.1712646484375, 0.1124267578125, 0.2235107421875, 0.1104736328125, 0.05108642578125, 0.16259765625, 0.0950927734375, 0.1356201171875, 0.2481689453125, 0.1256103515625, 0.0924072265625, 0.1552734375, 0.056549072265625, 0.1607666015625, 0.13330078125, ...	embed
56202894_c0	56202894	haskell	0	Title: What is the precedence of `->`, `=` and ` ` in Haskell? Problem title: What is the precedence of `->`, `=` and ` ` in Haskell? Tags: operator-precedence, haskell Problem: What is the precedence of `->`, `=` and ` ` in Haskell? I'm trying to figure out some default operator precedences in Haskell, but I was...	What is the precedence of `->`, `=` and ` ` in Haskell? What is the precedence of `->`, `=` and ` ` in Haskell? operator-precedence haskell What Haskell What is the precedence of `->`, `=` and ` ` in Haskell? I'm trying to figure out some default operator precedences in Haskell, but I was unable to find some good...	[ 0.030517578125, -0.00457763671875, 0.00665283203125, 0.0040283203125, -0.00616455078125, -0.0098876953125, 0.014892578125, -0.00958251953125, -0.000408172607421875, -0.01153564453125, -0.0022125244140625, -0.0133056640625, 0.00933837890625, -0.0064697265625, -0.004180908203125, -0.0062...	[ 4865, 107671, 6620, 9, 1230, 5386, 1369, 136, 9473, 23, 20625, 142508, 39933, 4692, 37534, 1556, 83, 70, 111, 103607, 4, 26366, 114977, 69098, 209806, 33079, 2203, 162, 1238, 1022, 14, 78690, 41877, 17304, 6002, 86531, 18499, 6097, 6448, ...	[ 0.037139892578125, 0.1961669921875, 0.1285400390625, 0.0872802734375, 0.06146240234375, 0.139892578125, 0.2255859375, 0.1292724609375, 0.09521484375, 0.09912109375, 0.1571044921875, 0.25341796875, 0.2078857421875, 0.108154296875, 0.1417236328125, 0.132080078125, 0.0258331298828125, ...	embed
13003150_c0	13003150	haskell	0	Title: Why do I get an Could not deduce (Ord a) error? Problem title: Why do I get an Could not deduce (Ord a) error? Tags: haskell Problem: Why do I get an Could not deduce (Ord a) error? I am trying to find the list with the smallest sum of elements.: shortest :: (Num a) => [[a]] -> [a] shortest [] = [] shortest (x:x...	Why do I get an Could not deduce (Ord a) error? Why do I get an Could not deduce (Ord a) error? haskell a the Why Could Ord Num x:xs code.hs Possible Why do I get an Could not deduce (Ord a) error? I am trying to find the list with the smallest sum of elements.: That gives me the following error: Why doesn't the functi...	[ -0.01495361328125, 0.00823974609375, 0.01531982421875, -0.011962890625, -0.00116729736328125, 0.01531982421875, 0.008056640625, -0.0194091796875, 0.0179443359375, 0.001983642578125, -0.0018310546875, -0.0341796875, -0.00762939453125, -0.00176239013671875, -0.005340576171875, 0.01068115...	[ 44084, 54, 87, 2046, 142, 191147, 959, 8, 106357, 143045, 10, 18499, 1556, 142508, 35379, 52782, 1022, 425, 7, 18151, 127, 115861, 2661, 31577, 7413, 5303, 678, 19336, 525, 10554, 80854, 22027, 18, 32354, 10644, 78292 ]	[ 0.10723876953125, 0.016021728515625, 0.006927490234375, 0.042999267578125, 0.041534423828125, 0.1654052734375, 0.17822265625, 0.1639404296875, 0.2171630859375, 0.212158203125, 0.155029296875, 0.1954345703125, 0.1029052734375, 0.200439453125, 0.192626953125, 0.134033203125, 0.01486206...	embed
25678858_c0	25678858	haskell	0	Title: Is there a better way of doing this in Haskell? Problem title: Is there a better way of doing this in Haskell? Tags: haskell, integer-arithmetic Problem: Is there a better way of doing this in Haskell? I have written the following to assist grand kids with their home schooling work and to keep mind working by le...	Is there a better way of doing this in Haskell? Is there a better way of doing this in Haskell? haskell integer-arithmetic Haskell Please Result Proof Is there a better way of doing this in Haskell? I have written the following to assist grand kids with their home schooling work and to keep mind working by learning how...	[ -0.0281982421875, 0.005706787109375, 0.0101318359375, -0.004913330078125, -0.001983642578125, 0.01409912109375, 0.0128173828125, -0.01397705078125, -0.00335693359375, -0.0308837890625, 0.0155029296875, -0.0174560546875, -0.00860595703125, 0.0223388671875, -0.00982666015625, -0.01312255...	[ 11522, 3917, 20594, 903, 23, 20625, 142508, 1556, 892, 1505, 9, 147, 8962, 282, 9523, 30607, 126684, 1250, 4390, 2685, 10, 111, 59121, 25632, 47, 30793, 9963, 34376, 5368, 10696, 214, 4488, 13695, 7086, 20697, 52080, 3642, 1528, 17569, 45...	[ 0.15966796875, 0.084228515625, 0.0899658203125, 0.09814453125, 0.08746337890625, 0.16650390625, 0.2509765625, 0.1546630859375, 0.134765625, 0.177490234375, 0.016387939453125, 0.0308685302734375, 0.1474609375, 0.1142578125, 0.090087890625, 0.1732177734375, 0.1839599609375, 0.1376953...	embed
19876433_c0	19876433	haskell	0	Title: Arrays with rigid variable Problem title: Arrays with rigid variable Tags: arrays, haskell Problem: Arrays with rigid variable Well, I was doing a problem in which function I was using had a rigid variable. I had an idea of using arrays for that problem. So I thought of using arrays with same rigid variable as o...	Arrays with rigid variable Arrays with rigid variable arrays haskell Arrays Array Arrays with rigid variable Well, I was doing a problem in which function I was using had a rigid variable. I had an idea of using arrays for that problem. So I thought of using arrays with same rigid variable as of the function I was crea...	[ 0, 0.0167236328125, 0.0028228759765625, -0.0034027099609375, 0.0137939453125, -0.00665283203125, -0.0184326171875, 0.00860595703125, 0.023193359375, -0.01513671875, 0.0147705078125, 0.01019287109375, -0.0118408203125, 0.01202392578125, 0.00031280517578125, -0.0213623046875, 0.0041809...	[ 69253, 4778, 678, 128652, 77336, 10298, 1556, 142508, 53, 20594, 2967, 32354, 17368, 6528, 17569, 5701, 105233, 110, 3642, 3249, 10, 37842, 25632, 21543, 18499, 20949, 83, 111, 7722, 30022, 1884, 11814 ]	[ 0.2044677734375, 0.222412109375, 0.11572265625, 0.282958984375, 0.266845703125, 0.2044677734375, 0.1356201171875, 0.2110595703125, 0.19970703125, 0.00006103515625, 0.094482421875, 0.143798828125, 0.05718994140625, 0.07012939453125, 0.01416015625, 0.036468505859375, 0.0672607421875, ...	embed
49232503_c0	49232503	haskell	0	Title: Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Problem title: Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Tags: parsing, haskell Problem: Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Given the following Text: To allow the Parser type to be made into instances of classes, it ...	Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) parsing haskell Haskell Graham Hutton Book Parsing Parser Char x:xs Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Given the following Text: Question: Why do we need a "dummy variable" and how ...	[ -0.0185546875, 0.0213623046875, 0.020751953125, 0.01953125, 0.00079345703125, 0.02197265625, -0.012451171875, -0.028076171875, 0.0064697265625, -0.0113525390625, 0.016357421875, -0.021240234375, -0.005859375, 0.00299072265625, -0.00701904296875, 0.0140380859375, 0.0189208984375, -0...	[ 20625, 142508, 147756, 97595, 1507, 2392, 68388, 16999, 366, 1556, 2189, 21656, 1022, 12, 425, 6953, 77878, 24129, 68185, 44084, 54, 642, 3871, 10, 10863, 1176, 77336, 136, 3642, 14602, 2046, 11814 ]	[ 0.10107421875, 0.201904296875, 0.053955078125, 0.02667236328125, 0.099853515625, 0.0755615234375, 0.040557861328125, 0.045318603515625, 0.046844482421875, 0.07012939453125, 0.073486328125, 0.12109375, 0.10675048828125, 0.0335693359375, 0.10400390625, 0.00445556640625, 0.0390930175781...	embed
38245696_c0	38245696	haskell	0	Title: Understanding monads in scala Problem title: Understanding monads in scala Tags: haskell, monads, scala Problem: Understanding monads in scala I'm trying to understand what monads are (not just in scala, but by example using scala). Let's consider the most (in my opinion) simple example of a monad: scala.Some As...	Understanding monads in scala Understanding monads in scala haskell monads scala Understanding scala.Some Option Understanding monads in scala I'm trying to understand what monads are (not just in scala, but by example using scala). Let's consider the most (in my opinion) simple example of a monad: As some articles sta...	[ 0.0322265625, 0.0225830078125, 0.01556396484375, 0.0133056640625, 0.001800537109375, -0.0157470703125, 0.00051116943359375, -0.0216064453125, 0.00335693359375, -0.0152587890625, -0.01068115234375, -0.0272216796875, -0.0159912109375, 0.00146484375, 0.00439453125, -0.00732421875, 0.000...	[ 9626, 144057, 2667, 712, 7, 23, 146232, 1556, 142508, 86769, 31577, 28219, 2367, 621, 27781, 2684, 33153, 8781, 11907, 54704, 10422, 5608, 479, 86687, 91736, 49878, 166179, 25072, 32354, 80934, 282, 11522, 95487, 154453, 38496, 179635, 134598, ...	[ 0.1015625, 0.06756591796875, 0.170166015625, 0.2410888671875, 0.1202392578125, 0.07427978515625, 0.260498046875, 0.0947265625, 0.1920166015625, 0.2144775390625, 0.003387451171875, 0.08740234375, 0.0318603515625, 0.1063232421875, 0.134033203125, 0.018951416015625, 0.008758544921875, ...	embed
65028047_c0	65028047	haskell	0	Title: Strange (to me) Haskell Syntax Problem title: Strange (to me) Haskell Syntax Tags: syntax, haskell Problem: Strange (to me) Haskell Syntax I'm an intermediate Haskell programmer (if you measure by how long I've been using it, not necessarily by skill :-) ). I often feel like a newbie. In looking through the Hask...	Strange (to me) Haskell Syntax Strange (to me) Haskell Syntax syntax haskell Strange Haskell Syntax Main Point Float Yields Strange (to me) Haskell Syntax I'm an intermediate Haskell programmer (if you measure by how long I've been using it, not necessarily by skill :-) ). I often feel like a newbie. In looking through...	[ -0.01171875, 0.0220947265625, 0.01483154296875, 0.0013275146484375, 0.018310546875, 0.01214599609375, -0.01446533203125, -0.00567626953125, 0.01611328125, -0.00555419921875, 0.006561279296875, -0.01275634765625, 0.008056640625, -0.02001953125, -0.0022125244140625, -0.0098876953125, -...	[ 187791, 188, 163, 20625, 142508, 19010, 86531, 16, 6002, 1556, 12321, 41097, 38699, 257, 42341, 19388, 81814, 2182, 77848, 72350, 4989, 17368, 112419, 27983, 12319, 1884, 3525, 9014, 46173, 31344, 40899, 959, 16031, 64549, 24592, 35064, 6954, ...	[ 0.2418212890625, 0.1412353515625, 0.1336669921875, 0.160888671875, 0.280029296875, 0.1875, 0.2340087890625, 0.045562744140625, 0.154541015625, 0.144775390625, 0.0885009765625, 0.1689453125, 0.1751708984375, 0.09027099609375, 0.1534423828125, 0.22265625, 0.045928955078125, 0.0579528...	embed
15309327_c0	15309327	haskell	0	Title: Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? Problem title: Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? Tags: command-line, haskell, shell Problem: Which Haskell idioms can I use to implement re...	Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? command-line haskell shell Which Haskell Which Haskell idioms can I use to implement realtime find-as-you-type a...	[ -0.0133056640625, -0.0009307861328125, 0.010498046875, -0.00064849853515625, 0.00494384765625, 0.0115966796875, 0.013671875, 0.0133056640625, -0.01190185546875, -0.0242919921875, -0.00811767578125, -0.02099609375, -0.01019287109375, -0.00335693359375, -0.0123291015625, 0.0126953125, ...	[ 130078, 20625, 142508, 13373, 28016, 831, 4527, 29479, 2773, 6032, 7413, 162, 53927, 50986, 1809, 277, 131801, 99, 75101, 13315, 2256, 1556, 128019, 87, 34831, 62822, 44057, 43315, 139993, 60089, 20623, 11435, 33938, 36461, 2967, 31577, 11389, ...	[ 0.0794677734375, 0.140380859375, 0.2335205078125, 0.1953125, 0.197509765625, 0.05712890625, 0.1058349609375, 0.117919921875, 0.1300048828125, 0.1134033203125, 0.171630859375, 0.1768798828125, 0.1002197265625, 0.1759033203125, 0.150390625, 0.10626220703125, 0.1812744140625, 0.004821...	embed
21919433_c0	21919433	haskell	0	Title: OO classes represented in Haskell Problem title: OO classes represented in Haskell Tags: haskell, oop Problem: OO classes represented in Haskell H! Suppose I have an abstract class Robot with a few attributs like 'position' and 'weight'. This abstract class implements three methods : 'take', 'drop' and 'move', b...	OO classes represented in Haskell OO classes represented in Haskell haskell oop Haskell Robot Char Action OO classes represented in Haskell H! Suppose I have an abstract class Robot with a few attributs like 'position' and 'weight'. This abstract class implements three methods : 'take', 'drop' and 'move', but also has ...	[ 0.00994873046875, 0.0069580078125, 0.006256103515625, 0.006622314453125, -0.002105712890625, 0.0054931640625, 0.0167236328125, -0.0019989013671875, 0.017822265625, -0.002838134765625, -0.017578125, -0.03515625, -0.00543212890625, -0.008056640625, -0.0380859375, -0.0028839111328125, 0...	[ 30563, 61112, 33636, 20625, 142508, 23, 1556, 32500, 66349, 21656, 57945, 297, 572, 38, 121691, 164789, 18507, 10846, 150380, 40322, 136, 165598, 29479, 17262, 150624, 78219, 138810, 432, 272, 55300, 55898, 284, 10763, 6626, 1614, 67413, 12724,...	[ 0.25048828125, 0.26025390625, 0.212646484375, 0.1588134765625, 0.26416015625, 0.05859375, 0.1478271484375, 0.1749267578125, 0.22705078125, 0.146484375, 0.1632080078125, 0.0155029296875, 0.1165771484375, 0.0179290771484375, 0.02410888671875, 0.1622314453125, 0.2054443359375, 0.04913...	embed
17578728_c0	17578728	haskell	0	Title: Encoding "Less Than" with Haskell Problem title: Encoding "Less Than" with Haskell Tags: haskell, gadt, singleton-type, dependent-type Problem: Encoding "Less Than" with Haskell am hoping some Haskell experts can help clarify something. Is it possible to define Nat in the usual way (via @dorc...	Encoding "Less Than" with Haskell Encoding "Less Than" with Haskell haskell gadt singleton-type dependent-type Encoding Less Than Haskell Nat Succ Zero LessThan Encoding "Less Than" with Haskell am hoping some Haskell experts can help clarify something. Is it possible to define Nat in the usual way ...	[ -0.00157928466796875, 0.01470947265625, -0.005401611328125, -0.00799560546875, 0.00003743171691894531, -0.0196533203125, 0.0057373046875, 0.0027618408203125, 0.0101318359375, -0.00927734375, 0.016845703125, -0.0225830078125, -0.004547119140625, -0.00102996826171875, 0.01458740234375, -...	[ 357, 587, 6238, 68016, 7, 72820, 678, 20625, 142508, 1556, 914, 13384, 11001, 1507, 50986, 108750, 1734, 68875, 1832, 10060, 83947, 1121, 156377, 78688, 17306, 7722, 61924, 115723, 9254, 43609, 52895, 20117, 618, 41911, 100, 5584, 653, 136, ...	[ 0.0682373046875, 0.2025146484375, 0.023590087890625, 0.2197265625, 0.1541748046875, 0.25341796875, 0.080322265625, 0.1251220703125, 0.234130859375, 0.1053466796875, 0.0295257568359375, 0.1177978515625, 0.08837890625, 0.1708984375, 0.1676025390625, 0.1861572265625, 0.2176513671875, ...	embed
53179993_c0	53179993	haskell	0	Title: How do you get the most recent version of Cabal for Haskell? Problem title: How do you get the most recent version of Cabal for Haskell? Tags: cabal, haskell Problem: How do you get the most recent version of Cabal for Haskell? I've just spent about an hour going in circles trying to get version 2 of Cabal. Init...	How do you get the most recent version of Cabal for Haskell? How do you get the most recent version of Cabal for Haskell? cabal haskell How Cabal Haskell How do you get the most recent version of Cabal for Haskell? I've just spent about an hour going in circles trying to get version 2 of Cabal. Initially I found that t...	[ 0.013427734375, 0.0035400390625, 0.02294921875, 0.007354736328125, -0.003143310546875, 0.0146484375, -0.01177978515625, 0.00927734375, 0.001495361328125, 0.01025390625, -0.00616455078125, -0.049560546875, -0.0034027099609375, -0.005950927734375, 0.00119781494140625, -0.00909423828125, ...	[ 11249, 54, 2046, 70, 2684, 17309, 11389, 111, 30438, 289, 100, 20625, 142508, 109524, 1556, 398, 56816, 130370, 31577, 116, 678, 29908, 59076, 18, 20600, 106, 28350, 167934, 80383, 18499, 43581, 361, 4488, 787, 3444, 23035, 13438, 5423, 442...	[ 0.10662841796875, 0.060791015625, 0.1226806640625, 0.001068115234375, 0.1180419921875, 0.1611328125, 0.190673828125, 0.111572265625, 0.2183837890625, 0.22705078125, 0.090576171875, 0.1497802734375, 0.2666015625, 0.239501953125, 0.14013671875, 0.0216217041015625, 0.06591796875, 0.01...	embed
47115813_c1	47115813	haskell	1	-> Bool check1 (Not (Equal a b)) (Equal c d) \| a == c && b == d = False \| a == d && b == c = False \| otherwise = True check1 (Not (Equal a b)) (Not (Equal c d)) \| (check1 (Not (Equal a b)) (Equal c d)) == False = False \| otherwise = True check1 (Not (Equal a b)) (Or c d) = ((check1 (Not (Equal a b)) c) \|\| (check1 (Not...	-> Bool check1 (Not (Equal a b)) (Equal c d) \| a == c && b == d = False \| a == d && b == c = False \| otherwise = True check1 (Not (Equal a b)) (Not (Equal c d)) \| (check1 (Not (Equal a b)) (Equal c d)) == False = False \| otherwise = True check1 (Not (Equal a b)) (Or c d) = ((check1 (Not (Equal a b)) c) \|\| (check1 (Not...	[ 0.00131988525390625, 0.00994873046875, -0.0021820068359375, 0.021728515625, -0.01519775390625, 0.0137939453125, -0.0027618408203125, -0.0228271484375, 0.013671875, -0.0096435546875, 0.00084686279296875, 0.0126953125, 0.0157470703125, -0.00494384765625, 0.008056640625, -0.0147705078125,...	[ 33079, 2460, 929, 12765, 418, 122116, 647, 71723, 10, 876, 501, 104, 58745, 69112, 619, 1230, 22225, 120262, 2203, 87599, 78292, 19060, 37839, 61637, 182867, 15190, 864, 50592, 62775, 3493, 2965, 3917, 53333, 3444, 28271, 47, 15700, 28864, ...	[ 0.1650390625, 0.13818359375, 0.2308349609375, 0.25732421875, 0.1307373046875, 0.182373046875, 0.0252227783203125, 0.1771240234375, 0.07159423828125, 0.1298828125, 0.093017578125, 0.156005859375, 0.0330810546875, 0.124267578125, 0.014068603515625, 0.0850830078125, 0.1358642578125, 0...	embed
47550833_c0	47550833	haskell	0	Title: Hamming with lists in Haskell Problem title: Hamming with lists in Haskell Tags: haskell, hamming-numbers, functional-programming, list, smooth-numbers Problem: Hamming with lists in Haskell I want to write a hamming function in Haskell that gets a list as Input. I already have this: merge :: [Integer] -> [Integ...	Hamming with lists in Haskell Hamming with lists in Haskell haskell hamming-numbers functional-programming list smooth-numbers Hamming Haskell Integer x:xs y:ys Hamming with lists in Haskell I want to write a hamming function in Haskell that gets a list as Input. I already have this: That was easy. But now i want somet...	[ -0.01904296875, 0.01251220703125, 0.000339508056640625, -0.011474609375, -0.0022430419921875, 0.0238037109375, -0.0042724609375, -0.01129150390625, -0.0030059814453125, -0.0208740234375, -0.01251220703125, -0.031982421875, 0.0135498046875, 0.0208740234375, -0.007659912109375, -0.003311...	[ 1391, 58838, 678, 5303, 20625, 142508, 23, 1556, 256, 2606, 1297, 123309, 28966, 156100, 44401, 1022, 425, 113, 4778, 7, 3444, 33022, 32354, 62163, 237, 360, 7077, 21771, 23468, 5036, 1884, 528, 128191, 166590, 268, 107730, 8561, 106, 5608,...	[ 0.2109375, 0.256591796875, 0.1322021484375, 0.22607421875, 0.15576171875, 0.2401123046875, 0.0143280029296875, 0.147705078125, 0.1910400390625, 0.1295166015625, 0.139892578125, 0.1492919921875, 0.083251953125, 0.2374267578125, 0.148193359375, 0.04827880859375, 0.0859375, 0.04205322...	embed
33736975_c0	33736975	haskell	0	Title: How to define an n-sided polygon function in haskell Problem title: How to define an n-sided polygon function in haskell Tags: polygon, haskell Problem: How to define an n-sided polygon function in haskell I need to define a function that moves the "pen", which starts at (0,0) in the bottom left, around to draw ...	How to define an n-sided polygon function in haskell How to define an n-sided polygon function in haskell polygon haskell How Command Double How to define an n-sided polygon function in haskell I need to define a function that moves the "pen", which starts at (0,0) in the bottom left, around to draw the correct polygon...	[ -0.02197265625, -0.003082275390625, -0.004974365234375, 0.0010528564453125, -0.0031585693359375, 0.02294921875, 0.0201416015625, -0.0189208984375, -0.006378173828125, -0.01190185546875, -0.002410888671875, -0.024658203125, 0.0034027099609375, -0.00701904296875, -0.0021209716796875, 0.0...	[ 11249, 61924, 653, 8752, 71, 35874, 6126, 32354, 23, 1556, 142508, 47, 142, 9, 123573, 107172, 3871, 25813, 7, 2278, 4034, 99, 63527, 103136, 25737, 10932, 79442, 26785, 96819, 107730, 11907, 5609, 115700, 140909, 615, 15490, 24927, 32316, ...	[ 0.0595703125, 0.2381591796875, 0.1500244140625, 0.1903076171875, 0.09466552734375, 0.201904296875, 0.2198486328125, 0.2210693359375, 0.051513671875, 0.1514892578125, 0.227294921875, 0.0221405029296875, 0.023651123046875, 0.0189056396484375, 0.227783203125, 0.211181640625, 0.028137207...	embed

31251163_c0

31251163

haskell

0

Title: What is the FlexibleContexts extension good for? Could you please explain it using a simple example? Problem title: What is the FlexibleContexts extension good for? Could you please explain it using a simple example? Tags: haskell, ghc Problem: What is the FlexibleContexts extension good for? Could you please ex...

What is the FlexibleContexts extension good for? Could you please explain it using a simple example? What is the FlexibleContexts extension good for? Could you please explain it using a simple example? haskell ghc a What FlexibleContexts Could What is the FlexibleContexts extension good for? Could you please explain it...

[ 0.00860595703125, 0.002593994140625, 0.0240478515625, 0.008056640625, -0.01483154296875, -0.004486083984375, -0.011474609375, -0.00127410888671875, 0.0093994140625, -0.0157470703125, 0.00921630859375, -0.0390625, -0.016845703125, 0.01953125, -0.01092529296875, -0.016357421875, 0.0120...

[ 4865, 83, 180842, 2661, 11935, 22829, 7, 111938, 4127, 100, 191147, 22936, 73342, 8781, 27781, 70, 1556, 142508, 31380, 238, 10, 442, 17368, 28219, 20594, 67573, 12301, 19917, 66882, 46754, 78688, 2367, 903, 14602, 15400, 32316, 5608, 4527, ...

[ 0.0767822265625, 0.02093505859375, 0.2266845703125, 0.179931640625, 0.1217041015625, 0.2193603515625, 0.079345703125, 0.182861328125, 0.15185546875, 0.1243896484375, 0.14404296875, 0.000640869140625, 0.105712890625, 0.055328369140625, 0.111083984375, 0.00933837890625, 0.108154296875,...

embed

19619377_c0

19619377

haskell

0

Title: Can't get Data.List functions to work in haskell Problem title: Can't get Data.List functions to work in haskell Tags: ghci, haskell Problem: Can't get Data.List functions to work in haskell I'm building a haskell program, and I want to use the library Data.List. So at the top of my program I've added ...

Can't get Data.List functions to work in haskell Can't get Data.List functions to work in haskell ghci haskell Data.List Can Data.List.isAlpha Not Data.List.nub Can't get Data.List functions to work in haskell I'm building a haskell program, and I want to use the library Data.List. So at the top of my program...

[ 0, 0.00096893310546875, 0.01092529296875, 0.00616455078125, -0.00537109375, 0.0145263671875, 0.023681640625, 0.00193023681640625, 0.01348876953125, -0.0257568359375, -0.00775146484375, -0.03759765625, 0.01385498046875, 0.00408935546875, -0.022705078125, -0.0072021484375, 0.0023651123...

[ 4171, 3768, 18, 2046, 11809, 5, 154663, 32354, 7, 47, 4488, 23, 1556, 142508, 31380, 318, 164, 6210, 14612, 11205, 19, 5829, 33976, 1528, 3444, 4527, 35773, 1294, 2663, 49814, 24927, 35064, 10644, 1022, 9969, 1340, 18499, 70820, 1135, 157...

[ 0.08319091796875, 0.08892822265625, 0.07781982421875, 0.1002197265625, 0.197265625, 0.092529296875, 0.28955078125, 0.24755859375, 0.0419921875, 0.0491943359375, 0.149658203125, 0.07366943359375, 0.1510009765625, 0.27099609375, 0.0684814453125, 0.10498046875, 0.1192626953125, 0.1265...

embed

20066831_c0

20066831

haskell

0

Title: how to return an entire list using a function that removes redundant students from the list Problem title: how to return an entire list using a function that removes redundant students from the list Tags: haskell Problem: how to return an entire list using a function that removes redundant students from the list...

how to return an entire list using a function that removes redundant students from the list how to return an entire list using a function that removes redundant students from the list haskell a the Data.List CourseData Bsc280 Sylvee Bsc209 Bsc205 x:xs how to return an entire list using a function that removes redundant...

[ -0.005126953125, 0.01007080078125, 0.0036773681640625, 0.0147705078125, -0.0067138671875, -0.003997802734375, -0.000713348388671875, -0.003814697265625, 0.007720947265625, -0.01348876953125, -0.0166015625, 0.006072998046875, 0.0201416015625, 0.005584716796875, -0.025146484375, 0.019775...

[ 3642, 47, 30646, 64194, 5303, 17368, 32354, 87388, 7, 4842, 35405, 18, 25921, 1295, 1556, 142508, 70, 11809, 154663, 154162, 137989, 10382, 88628, 100973, 7039, 1126, 143422, 2967, 14194, 239825, 693, 254, 3444, 125663, 756, 15490, 171763, 28...

[ 0.0721435546875, 0.0238494873046875, 0.2347412109375, 0.169189453125, 0.2135009765625, 0.0819091796875, 0.2022705078125, 0.1417236328125, 0.033203125, 0.095703125, 0.2005615234375, 0.0858154296875, 0.208740234375, 0.0570068359375, 0.07232666015625, 0.1942138671875, 0.0204925537109375...

embed

74305406_c0

74305406

haskell

0

Title: How to use a vector to cache results within a Haskell function? Problem title: How to use a vector to cache results within a Haskell function? Tags: memoization, haskell Problem: How to use a vector to cache results within a Haskell function? I have a computationally expensive vector I want to index into inside ...

How to use a vector to cache results within a Haskell function? How to use a vector to cache results within a Haskell function? memoization haskell How Haskell How to use a vector to cache results within a Haskell function? I have a computationally expensive vector I want to index into inside a function, but since the ...

[ 0.0010986328125, 0.002838134765625, -0.003021240234375, -0.0023193359375, 0.011474609375, -0.00506591796875, 0.01025390625, -0.001434326171875, 0.0035400390625, -0.034912109375, -0.00994873046875, 0.0150146484375, -0.0228271484375, 0.0223388671875, 0.01544189453125, 0.01611328125, -0...

[ 11249, 4527, 173, 18770, 47, 82365, 50339, 28032, 20625, 142508, 32354, 163, 432, 47691, 1556, 10, 181135, 135587, 3444, 63262, 3934, 46132, 23180, 8306, 11814, 151107, 27875, 10932, 17203, 118562, 65970, 142424, 29367, 6528, 156672, 27781, 195...

[ 0.0811767578125, 0.115966796875, 0.1959228515625, 0.234619140625, 0.044189453125, 0.244873046875, 0.1787109375, 0.1220703125, 0.1300048828125, 0.239501953125, 0.1678466796875, 0.1005859375, 0.1357421875, 0.106689453125, 0.1212158203125, 0.0361328125, 0.0167236328125, 0.12646484375,...

embed

44349534_c0

44349534

haskell

0

Title: Extraction IO data inside other Monad Problem title: Extraction IO data inside other Monad Tags: monads, ios, haskell Problem: Extraction IO data inside other Monad I am using HDBC-Sqlite3, I would like to make queries depending on the page I am in. And I would like to get the data out of the IO Monad. It should...

Extraction IO data inside other Monad Extraction IO data inside other Monad monads ios haskell definitions Extraction Monad connectSqlite3 test.db SELECT Here Mathskell.Views.Read.render Extraction IO data inside other Monad I am using HDBC-Sqlite3, I would like to make queries depending on the page I am in. And I woul...

[ -0.00982666015625, 0.03173828125, 0.00897216796875, 0.007568359375, 0.021728515625, 0.01318359375, -0.00762939453125, -0.007781982421875, 0.00090789794921875, -0.07080078125, 0.012939453125, -0.061767578125, -0.021240234375, -0.02001953125, 0.0019683837890625, -0.00171661376953125, -...

[ 31501, 10763, 17780, 2053, 46132, 3789, 60331, 71, 2667, 712, 17, 232, 1556, 142508, 80934, 37067, 95255, 67, 363, 3034, 48073, 6755, 144832, 11853, 78804, 100474, 31345, 18280, 17368, 4732, 24318, 1884, 41, 96819, 9191, 2046, 1810, 111, 77...

[ 0.1983642578125, 0.11181640625, 0.243408203125, 0.1865234375, 0.1607666015625, 0.130126953125, 0.209228515625, 0.1815185546875, 0.1129150390625, 0.133544921875, 0.0601806640625, 0.13671875, 0.1009521484375, 0.2423095703125, 0.08209228515625, 0.1092529296875, 0.1597900390625, 0.1796...

embed

44608214_c1

44608214

haskell

1

of lazy bytestrings (by replacing Data.ByteString.Lazy with Data.ByteString ), this problem does not occur anymore . I'd like to understand that. Any explanation? (I would particularly like to know how to solve this issue but still using lazy bytestrings) EDIT To be perhaps more precise, the problem still occurs with ...

[ 0.01318359375, 0.0157470703125, -0.0166015625, -0.003448486328125, -0.0011444091796875, 0.01708984375, 0.00164794921875, 0.00372314453125, 0.00927734375, 0.004119873046875, 0.00701904296875, 0.017822265625, -0.001556396484375, 0.0177001953125, 0.00823974609375, -0.003265380859375, 0....

[ 111, 21, 3285, 390, 6954, 46828, 456, 133266, 11809, 75358, 67, 71713, 214, 2729, 5, 903, 2967, 14602, 959, 74918, 176683, 1884, 28219, 187136, 106480, 86869, 31089, 7464, 17368, 172864, 134995, 678, 1528, 24927, 217225, 237, 90944, 48097, ...

[ 0.05389404296875, 0.1634521484375, 0.2489013671875, 0.10687255859375, 0.11669921875, 0.2076416015625, 0.030303955078125, 0.1072998046875, 0.132080078125, 0.0892333984375, 0.11279296875, 0.2059326171875, 0.0662841796875, 0.1768798828125, 0.005767822265625, 0.052032470703125, 0.1510009...

embed

78866826_c0

78866826

haskell

0

Title: TVar that blocks read until change? Problem title: TVar that blocks read until change? Tags: haskell, concurrency Problem: TVar that blocks read until change? I'm trying to wrap my head around how to correctly communicate between threads in Haskell. I have multiple threads that read some state, and whenever it c...

TVar that blocks read until change? TVar that blocks read until change? haskell concurrency TVar TVar that blocks read until change? I'm trying to wrap my head around how to correctly communicate between threads in Haskell. I have multiple threads that read some state, and whenever it changes they need to do some updat...

[ -0.01153564453125, 0.0067138671875, 0.001068115234375, -0.0028076171875, 0.020751953125, 0.004058837890625, 0.0096435546875, 0.00994873046875, 0.008056640625, -0.0206298828125, 0.01416015625, 0.005218505859375, 0.01287841796875, 0.017578125, -0.003448486328125, 0.017333984375, 0.0109...

[ 1910, 147, 450, 46389, 7, 12301, 24189, 15549, 32, 1556, 142508, 108636, 982, 137565, 26785, 127219, 17721, 86997, 20625, 48716, 11341, 217684, 65572, 28350, 831, 54811, 66160, 3229, 32562, 4734, 1632, 2965, 13580, 14037, 33022, 47, 43581, 12...

[ 0.1793212890625, 0.2225341796875, 0.061279296875, 0.21533203125, 0.0147247314453125, 0.2159423828125, 0.190673828125, 0.2103271484375, 0.001129150390625, 0.11572265625, 0.23876953125, 0.143798828125, 0.0670166015625, 0.0111083984375, 0.03900146484375, 0.1016845703125, 0.039794921875,...

embed

29881538_c1

29881538

haskell

1

runStateT (runZipperT_ computation) (ZipperState left right) return (x, (left', right')) it's works and I can compose with other monads import Control.Monad.Identity import Control.Monad.State import ZipperT length' :: [a] -> Int length' xs = runIdentity (execStateT (runZipperT contar ([], xs)) 0) where contar = headR...

[ -0.0167236328125, 0.0198974609375, -0.00897216796875, 0.0164794921875, -0.00046539306640625, 0.01385498046875, -0.0037689208984375, -0.01239013671875, 0.0074462890625, -0.052490234375, 0.00823974609375, 0.0247802734375, 0.00848388671875, 0.02294921875, 0.004608154296875, -0.00238037109...

[ 11675, 135206, 13, 618, 16428, 60348, 8079, 454, 181135, 25737, 7108, 30646, 425, 2480, 25, 442, 43240, 831, 150350, 678, 3789, 2667, 712, 24927, 27131, 46674, 37379, 2481, 9315, 140909, 18, 1022, 568, 46480, 24505, 757, 10336, 1052, 7225, ...

[ 0.1458740234375, 0.21630859375, 0.10546875, 0.1951904296875, 0.1107177734375, 0.1861572265625, 0.199951171875, 0.022491455078125, 0.15771484375, 0.0938720703125, 0.1363525390625, 0.1634521484375, 0.06109619140625, 0.1153564453125, 0.013946533203125, 0.008758544921875, 0.1126708984375...

embed

55810774_c1

55810774

haskell

1

go xs go [] = 1 randomInts :: Int -> StdGen -> [Int] randomInts k g = let result = take k (randoms g) in force result `seq` result testFunction = parSort main = do args <- getArgs let count | null args = 500000 | otherwise = read (head args) input <- randomInts count `fmap` getStdGen start <- getCurrentTime let sorted...

[ -0.01397705078125, 0.01007080078125, -0.005615234375, -0.034912109375, -0.002960205078125, -0.0025634765625, -0.000492095947265625, -0.02099609375, -0.0113525390625, -0.022705078125, 0.00408935546875, 0.031982421875, 0.005126953125, -0.0078125, 0, -0.0194091796875, 0.0013580322265625...

[ 738, 1022, 7, 2203, 106, 96759, 4153, 933, 1984, 360, 18, 2907, 71, 105376, 472, 706, 2633, 16750, 5646, 46258, 16, 37772, 184, 864, 3034, 97249, 366, 158240, 5201, 79459, 54529, 56574, 2101, 9508, 120262, 12301, 31251, 107730, 62346, 374...

[ 0.1822509765625, 0.1356201171875, 0.111572265625, 0.0204010009765625, 0.03289794921875, 0.197509765625, 0.09454345703125, 0.1204833984375, 0.00396728515625, 0.04302978515625, 0.043365478515625, 0.137939453125, 0.0166473388671875, 0.1429443359375, 0.05584716796875, 0.0816650390625, 0....

embed

15766904_c1

15766904

haskell

1

type classes are: -- |Full generational replacement selection protocol fullGenerational :: (Phenotype b) => (Int -> [b] -> IO [(b, b)]) -> --Selection mechanism Int -> --Elitism Int -> --The number of children to create Double -> --Crossover rate Double -> --Mutation rate [b] -> --Population to select from IO [b] --Th...

[ -0.006317138671875, 0.00897216796875, 0.006805419921875, 0.004241943359375, -0.029296875, 0.007293701171875, -0.00732421875, -0.031982421875, 0.009521484375, -0.00628662109375, 0.00049591064453125, -0.00157928466796875, -0.0269775390625, -0.014892578125, -0.00160980224609375, -0.013549...

[ 10644, 61112, 621, 12, 4210, 6, 58745, 121962, 58093, 289, 91995, 674, 132216, 91363, 4393, 135932, 30494, 1984, 45689, 21004, 50986, 876, 4153, 17780, 275, 104475, 58994, 191619, 360, 18, 7623, 23240, 39, 14012, 20020, 28282, 107172, 3666, ...

[ 0.2841796875, 0.286376953125, 0.119384765625, 0.02960205078125, 0.03668212890625, 0.000335693359375, 0.0276336669921875, 0.1533203125, 0.1876220703125, 0.121826171875, 0.192138671875, 0.059326171875, 0.2181396484375, 0.219970703125, 0.19091796875, 0.1319580078125, 0.1060791015625, ...

embed

42578331_c0

42578331

haskell

0

Title: Aeson: parse JSON with unknown key in Haskell Problem title: Aeson: parse JSON with unknown key in Haskell Tags: ghc, haskell, aeson Problem: Aeson: parse JSON with unknown key in Haskell I would like to parse the following JSON using Aeson in Haskell: { "foo": { "name": "name 1", "location": "location 1" }, "ba...

Aeson: parse JSON with unknown key in Haskell Aeson: parse JSON with unknown key in Haskell ghc haskell aeson Aeson JSON Haskell Entry Show FromJSON Object Aeson: parse JSON with unknown key in Haskell I would like to parse the following JSON using Aeson in Haskell: The keys name and location are known, but foo and bar...

[ -0.0023345947265625, -0.009033203125, -0.002899169921875, 0.005126953125, -0.007537841796875, 0.00177001953125, 0.00469970703125, 0.0126953125, -0.00830078125, -0.00811767578125, -0.0140380859375, 0.0142822265625, 0.013427734375, 0.003143310546875, -0.0020599365234375, -0.0089721679687...

[ 62, 90, 191, 12, 366, 184, 821, 58627, 678, 51, 69723, 19, 22799, 20625, 142508, 23, 31380, 238, 1556, 10, 357, 15123, 17367, 28090, 1375, 134549, 1884, 25632, 17368, 9351, 136, 31913, 51529, 1284, 5775, 31, 1909, 621, 72367, 2053, 237,...

[ 0.12890625, 0.151123046875, 0.196044921875, 0.001922607421875, 0.1402587890625, 0.11376953125, 0.149169921875, 0.2298583984375, 0.0687255859375, 0.0931396484375, 0.203369140625, 0.04449462890625, 0.184814453125, 0.140380859375, 0.2225341796875, 0.04376220703125, 0.057861328125, 0.0...

embed

14077219_c0

14077219

haskell

0

Title: How to parse uncertain data from JSON in Haskell? Problem title: How to parse uncertain data from JSON in Haskell? Tags: parsing, json, haskell Problem: How to parse uncertain data from JSON in Haskell? I used the answer in json_answer (Text.JSON package) and I've got a generic json Haskell data type. It's ok to...

How to parse uncertain data from JSON in Haskell? How to parse uncertain data from JSON in Haskell? parsing json haskell JSON How Haskell JSObject JSONObject JSString JSONString www.example.com How to parse uncertain data from JSON in Haskell? I used the answer in json_answer (Text.JSON package) and I've got a generic ...

[ -0.01287841796875, 0.026611328125, 0.01287841796875, 0.0189208984375, -0.00148773193359375, 0.018310546875, 0.005523681640625, -0.00482177734375, -0.013916015625, -0.0118408203125, -0.0162353515625, -0.022216796875, 0.00897216796875, -0.003936767578125, -0.0006103515625, 0.00537109375,...

[ 11249, 366, 184, 51, 106290, 73, 2053, 1295, 821, 58627, 23, 20625, 142508, 6953, 1647, 1681, 1556, 13055, 75161, 2852, 71713, 35166, 10133, 6488, 174379, 1375, 98169, 189534, 10644, 3664, 61924, 114122, 24233, 83, 57553, 62, 61687, 44457, ...

[ 0.043975830078125, 0.17431640625, 0.1173095703125, 0.1451416015625, 0.254150390625, 0.104248046875, 0.1522216796875, 0.09698486328125, 0.1424560546875, 0.224365234375, 0.06646728515625, 0.1492919921875, 0.2386474609375, 0.063232421875, 0.1094970703125, 0.158447265625, 0.122314453125,...

embed

35918281_c1

35918281

haskell

1

menu database user menu :: [Film] -> String -> IO() menu database user = do putStrLn "This is the Main Menu" putStrLn "Choose one of the following options:" putStrLn "2. give all films in the database" putStrLn "Your Option:" functionSelected <- getLine if (read functionSelected :: Int) > 0 && (read functionSelected :...

[ 0.00072479248046875, -0.01611328125, 0.0023193359375, 0.0272216796875, -0.0185546875, -0.006927490234375, 0.00469970703125, -0.00885009765625, -0.007476806640625, -0.00933837890625, -0.0155029296875, -0.0289306640625, -0.000553131103515625, 0.00555419921875, 0.0081787109375, -0.0050659...

[ 8026, 63399, 38937, 102278, 23351, 214, 17780, 132, 54, 3884, 71713, 866, 19, 73243, 12321, 49434, 107522, 25632, 50717, 5442, 8337, 756, 54180, 86769, 32354, 100184, 2046, 93232, 2174, 39116, 757, 483, 19667, 35829, 37223, 28484, 97249, 4153...

[ 0.2410888671875, 0.190185546875, 0.1558837890625, 0.139892578125, 0.159912109375, 0.08392333984375, 0.1939697265625, 0.045440673828125, 0.009033203125, 0.0902099609375, 0.1292724609375, 0.0313720703125, 0.033416748046875, 0.05987548828125, 0.1087646484375, 0.237548828125, 0.003692626...

embed

36751906_c0

36751906

haskell

0

Title: Least common multiple without using gcd Problem title: Least common multiple without using gcd Tags: haskell Problem: Least common multiple without using gcd With gcd its fairly easy but i do not understand how to tie in all the functions to make it happen without. kgv :: Int -> Int -> Int kgv x y = abs ((x `quo...

Least common multiple without using gcd Least common multiple without using gcd haskell gcd Least prime_factors n-1 x:xs Least common multiple without using gcd With gcd its fairly easy but i do not understand how to tie in all the functions to make it happen without. I got this function to find the prime factors which...

[ -0.037353515625, 0.031005859375, 0.0019683837890625, -0.006256103515625, 0.0186767578125, 0.020751953125, 0.00109100341796875, -0.006866455078125, 0.01513671875, -0.01348876953125, 0.00885009765625, -0.02734375, 0.0162353515625, 0.007598876953125, -0.01123046875, 0.00078582763671875, ...

[ 636, 4438, 39210, 48716, 15490, 17368, 22109, 71, 1556, 142508, 20809, 144810, 653, 5759, 1022, 12, 425, 6863, 23468, 28219, 4817, 23, 32354, 53383, 7413, 120103, 43240, 20697, 51776, 38132, 14012, 1295, 1632, 5303, 12765, 2174, 98, 3789, 9...

[ 0.1011962890625, 0.177001953125, 0.1685791015625, 0.2264404296875, 0.1361083984375, 0.05633544921875, 0.16455078125, 0.183349609375, 0.10711669921875, 0.215087890625, 0.1429443359375, 0.2008056640625, 0.009613037109375, 0.11376953125, 0.06988525390625, 0.0269775390625, 0.084594726562...

embed

24151941_c0

24151941

haskell

0

Title: Aeson Prisms with "free" references Problem title: Aeson Prisms with "free" references Tags: aeson, haskell-lens, haskell Problem: Aeson Prisms with "free" references Just read the brilliant " Lens/Aeson Traversals/Prisms" article and have a real-world application. Given the following anonymi...

Aeson Prisms with "free" references Aeson Prisms with "free" references aeson haskell-lens haskell Aeson Prisms Locations Just Aeson Prisms with "free" references Just read the brilliant " Lens/Aeson Traversals/Prisms" article and have a real-world application. Given the following anonymized JSON st...

[ -0.0068359375, 0.01239013671875, -0.000751495361328125, 0.0029296875, -0.00022602081298828125, 0.00799560546875, 0.0007781982421875, 0.0126953125, 0.00016307830810546875, -0.0142822265625, 0.0147705078125, 0.052001953125, 0.0220947265625, -0.00653076171875, -0.006744384765625, -0.01879...

[ 62, 90, 191, 20204, 4432, 678, 32087, 91067, 10, 1556, 142508, 1977, 90788, 12301, 230451, 18226, 7, 284, 4937, 7864, 16765, 33163, 2773, 32554, 38415, 52184, 821, 58627, 45646, 3642, 2806, 87, 4067, 39, 1810, 42486, 43257, 3501, 29458, 3...

[ 0.09228515625, 0.1285400390625, 0.1710205078125, 0.2213134765625, 0.1817626953125, 0.0333251953125, 0.1656494140625, 0.2025146484375, 0.0277862548828125, 0.06610107421875, 0.1888427734375, 0.1209716796875, 0.1558837890625, 0.0836181640625, 0.08984375, 0.177001953125, 0.124755859375, ...

embed

38395117_c0

38395117

haskell

0

Title: Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? Problem title: Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? Tags: haskell Problem: Why does replacing the dollar sign ($) with parentheses in this expression leads to an ...

Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? Why does replacing the dollar sign ($) with parentheses in this expression leads to an error? haskell it Why Couldn Integer Relevant Possible Why does replacing the dollar sign ($) with parentheses in this expression leads to ...

[ -0.01202392578125, 0.005828857421875, 0.005828857421875, 0.00927734375, -0.020263671875, 0.007659912109375, -0.01092529296875, 0.0177001953125, 0.002197265625, -0.01409912109375, -0.006011962890625, -0.00933837890625, -0.00213623046875, 0.003204345703125, 0.005645751953125, -0.00074768...

[ 44084, 14602, 456, 133266, 15437, 24092, 4369, 678, 49129, 35412, 90, 125195, 37105, 47, 142, 18499, 7, 1556, 142508, 442, 191147, 19, 44401, 853, 133, 30624, 115861, 2661, 903, 6626, 18344, 7569, 9, 757, 22288, 90081, 56216, 80019, 3650, ...

[ 0.160400390625, 0.037445068359375, 0.0465087890625, 0.1343994140625, 0.2174072265625, 0.188720703125, 0.2294921875, 0.0540771484375, 0.1436767578125, 0.177734375, 0.1092529296875, 0.243408203125, 0.1455078125, 0.041748046875, 0.044677734375, 0.25146484375, 0.02783203125, 0.11889648...

embed

1897306_c1

1897306

haskell

1

can pass them to modifyX. Is there a nice clean way of solving this problem, or am I stuck with defining my own getters and setters? Put another way, is there a way of connecting the functions created by record syntax up with type classes (both the getters and setters)? EDIT Here's the real problem I'm trying to solve...

[ -0.00592041015625, 0.004974365234375, -0.0019378662109375, -0.021240234375, -0.003509521484375, -0.01708984375, 0.000415802001953125, -0.0208740234375, 0.01123046875, -0.00096893310546875, -0.01611328125, 0.01116943359375, 0.00384521484375, 0.000682830810546875, -0.01904296875, -0.0044...

[ 831, 27875, 2856, 47, 2811, 40383, 1542, 26267, 46622, 3917, 3115, 2967, 13204, 10002, 2046, 23962, 136, 88685, 37067, 32354, 7, 75935, 17164, 6002, 86531, 10644, 61112, 2773, 31577, 86869, 32562, 10, 111, 62548, 103391, 4527, 12353, 5, 119...

[ 0.044769287109375, 0.1654052734375, 0.0601806640625, 0.0635986328125, 0.1500244140625, 0.1708984375, 0.17333984375, 0.00750732421875, 0.1025390625, 0.0254058837890625, 0.065673828125, 0.110107421875, 0.1116943359375, 0.0345458984375, 0.1282958984375, 0.1571044921875, 0.0604248046875,...

embed

71895399_c0

71895399

haskell

0

Title: haskell Differences in two words Problem title: haskell Differences in two words Tags: haskell, types, algorithm Problem: haskell Differences in two words I have 2 words with the same length, for example: "mother" and "father". My program should: a) if the letter in the x position in the first word is the same a...

haskell Differences in two words haskell Differences in two words haskell types algorithm Differences x:xs y:ys Couldn Char haskell Differences in two words I have 2 words with the same length, for example: "mother" and "father". My program should: a) if the letter in the x position in the first word is the same as in ...

[ 0.009765625, 0.0057373046875, -0.0078125, 0.01031494140625, 0.00323486328125, 0.005645751953125, -0.00701904296875, 0.003692626953125, -0.002716064453125, 0.0296630859375, 0.0128173828125, -0.022705078125, 0.01116943359375, -0.006866455078125, -0.0167236328125, 0.0115966796875, 0.019...

[ 1556, 142508, 803, 18234, 69098, 6626, 34153, 23, 52895, 234873, 1022, 12, 425, 7, 113, 4778, 191147, 21656, 765, 116, 5701, 140909, 432, 9319, 136, 1021, 2646, 1528, 5608, 2174, 31330, 19069, 5117, 2565, 17932, 24765, 6863, 3687, 876, 18...

[ 0.1728515625, 0.27294921875, 0.1107177734375, 0.189208984375, 0.05889892578125, 0.1292724609375, 0.204345703125, 0.012664794921875, 0.13037109375, 0.17236328125, 0.10418701171875, 0.029266357421875, 0.09649658203125, 0.009918212890625, 0.0699462890625, 0.1134033203125, 0.057800292968...

embed

45178189_c0

45178189

haskell

0

Title: GHC Prefer one specialization over another Problem title: GHC Prefer one specialization over another Tags: haskell, ghc Problem: GHC Prefer one specialization over another I have a Haskell typeclass function that looks like the following: class Foo m where foo :: Num a => m a -> a I want to generate two speciali...

GHC Prefer one specialization over another GHC Prefer one specialization over another haskell ghc GHC Prefer Foo Num SPECIALIZE GHC Prefer one specialization over another I have a Haskell typeclass function that looks like the following: I want to generate two specializations of foo , one for anytime that m ~ X Int and...

[ 0.016357421875, 0.0128173828125, -0.0023345947265625, -0.01708984375, -0.0040283203125, 0.0034942626953125, -0.004730224609375, -0.01348876953125, 0.0174560546875, 0.034423828125, -0.00408935546875, -0.0126953125, 0.005889892578125, 0.005157470703125, -0.00726318359375, 0.0137329101562...

[ 527, 73265, 176005, 1632, 5361, 47691, 645, 15700, 1556, 142508, 31380, 238, 9572, 31, 52782, 224343, 568, 19157, 87, 765, 20625, 10644, 67413, 32354, 33342, 1884, 25632, 3444, 139392, 6626, 179202, 17514, 5775, 2499, 347, 6780, 1193, 360, ...

[ 0.1090087890625, 0.219970703125, 0.219482421875, 0.0997314453125, 0.204345703125, 0.1474609375, 0.081298828125, 0.046417236328125, 0.13525390625, 0.2314453125, 0.1168212890625, 0.08526611328125, 0.1790771484375, 0.1986083984375, 0.1600341796875, 0.1888427734375, 0.05816650390625, 0...

embed

48043167_c0

48043167

haskell

0

Title: Why is <$> left associative? Problem title: Why is <$> left associative? Tags: apply, associativity, haskell Problem: Why is <$> left associative? fmap is also <$> because it is function application ( $ ) in the functor category. (+5) $ (*10) $ 10 -- 105 (+5) <$> (*10) <$> [1,2,3] -- [15,25,35] Then ...

Why is <$> left associative? Why is <$> left associative? apply associativity haskell Why ERROR Why is <$> left associative? fmap is also <$> because it is function application ( $ ) in the functor category. Then I thought, well in that case <*> is function application in the applicative functor category, a...

[ 0.0291748046875, 0.00872802734375, 0.01708984375, 0.01153564453125, 0.0036468505859375, 0.0036773681640625, -0.004608154296875, -0.000919342041015625, 0.019287109375, -0.036865234375, 0.0235595703125, -0.012939453125, -0.0009918212890625, 0.0084228515625, 0.00421142578125, -0.008544921...

[ 44084, 83, 1277, 4369, 5386, 25737, 166027, 272, 59911, 3760, 1556, 142508, 151206, 24638, 1238, 62346, 2843, 6637, 32354, 38415, 3650, 23, 7477, 18770, 95487, 17569, 1639, 41816, 4935, 4488, 4426, 43240, 1810, 96276, 1305, 277, 40322, 22183,...

[ 0.1214599609375, 0.03778076171875, 0.0233154296875, 0.1417236328125, 0.0966796875, 0.24755859375, 0.2021484375, 0.132080078125, 0.14892578125, 0.0992431640625, 0.1431884765625, 0.2169189453125, 0.074951171875, 0.0197906494140625, 0.107666015625, 0.234619140625, 0.0264129638671875, ...

embed

10020234_c0

10020234

haskell

0

Title: How to know when an apparently pure Haskell interface hides unsafe operations? Problem title: How to know when an apparently pure Haskell interface hides unsafe operations? Tags: haskell, purely-functional, unsafe-perform-io Problem: How to know when an apparently pure Haskell interface hides unsafe operations? ...

How to know when an apparently pure Haskell interface hides unsafe operations? How to know when an apparently pure Haskell interface hides unsafe operations? haskell purely-functional unsafe-perform-io How Haskell How to know when an apparently pure Haskell interface hides unsafe operations? I have been reading about u...

[ -0.0047607421875, 0.0048828125, 0.0184326171875, 0.01507568359375, -0.01019287109375, 0.01324462890625, -0.01116943359375, -0.01104736328125, -0.002532958984375, -0.00933837890625, -0.00017261505126953125, -0.028564453125, -0.01300048828125, -0.0028076171875, 0.018310546875, 0.00634765...

[ 11249, 47, 3714, 3229, 198371, 34166, 20625, 142508, 101758, 1274, 988, 51, 115840, 41018, 7, 1556, 538, 137175, 1264, 5037, 846, 142, 15277, 17780, 26458, 14315, 2773, 46876, 19048, 78974, 173591, 65998, 105506, 107419, 63773, 3917, 36766, 5...

[ 0.0819091796875, 0.0430908203125, 0.1541748046875, 0.08538818359375, 0.1878662109375, 0.223876953125, 0.136962890625, 0.23876953125, 0.258544921875, 0.1708984375, 0.1507568359375, 0.109130859375, 0.217041015625, 0.1868896484375, 0.0625, 0.115478515625, 0.050628662109375, 0.11425781...

embed

3993730_c0

3993730

haskell

0

Title: Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? Problem title: Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? Tags: haskell, functional-programming Problem: Should I read t...

Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? Should I read the first or second edition of "Introduction to Functional Programming" by Bird & Wadler? haskell functional-programming Should Introduction Functional Programming Bird Wadle...

[ 0.005645751953125, -0.003326416015625, 0.005645751953125, 0.0101318359375, -0.019287109375, 0.0108642578125, -0.01361083984375, -0.00072479248046875, -0.0062255859375, -0.0181884765625, -0.016845703125, -0.00604248046875, -0.0225830078125, -0.0135498046875, 0.02099609375, -0.0140991210...

[ 151117, 12301, 5117, 707, 17932, 79737, 4153, 2955, 77391, 47, 28670, 10763, 27958, 214, 390, 72607, 619, 25133, 92009, 603, 111, 1556, 142508, 123309, 28966, 44891, 87, 11522, 3501, 4527, 140988, 20625, 39210, 67330, 69236, 85583, 56037, 449...

[ 0.126220703125, 0.21044921875, 0.158447265625, 0.0693359375, 0.199462890625, 0.21875, 0.0467529296875, 0.135498046875, 0.1480712890625, 0.09619140625, 0.1663818359375, 0.1591796875, 0.2098388671875, 0.09136962890625, 0.05816650390625, 0.1861572265625, 0.1429443359375, 0.03988647460...

embed

28041411_c1

28041411

haskell

1

In the second argument of `(<)', namely `floor (sqrt x)' In the first argument of `takeWhile', namely `(< floor (sqrt x))' This is weird: :t floor gives me (Integral b, RealFrac a) => a -> b , which means that this floor should be returning a integer. How can I add an instance declaration (or do whatever is necessary ...

[ -0.0164794921875, 0.01904296875, 0.0093994140625, -0.0133056640625, 0.0087890625, 0.006988525390625, 0.0091552734375, -0.0245361328125, 0.016357421875, -0.0162353515625, 0.0238037109375, -0.00372314453125, 0.001373291015625, -0.006591796875, -0.00836181640625, -0.01123046875, -0.0048...

[ 360, 17932, 10750, 16093, 25, 4, 110987, 52347, 748, 864, 3198, 1022, 70, 5117, 78219, 1456, 979, 133, 74912, 16, 3293, 83, 179459, 18, 76199, 163, 67, 5739, 141, 876, 5120, 919, 20251, 10, 44357, 33079, 6, 450, 903, 5608, 30646, 214,...

[ 0.020172119140625, 0.1727294921875, 0.266357421875, 0.2425537109375, 0.002899169921875, 0.003753662109375, 0.005767822265625, 0.1497802734375, 0.1124267578125, 0.08203125, 0.1246337890625, 0.10357666015625, 0.00286865234375, 0.1187744140625, 0.1912841796875, 0.0787353515625, 0.245239...

embed

69803485_c0

69803485

haskell

0

Title: Haskell: get all paths Problem title: Haskell: get all paths Tags: haskell Problem: Haskell: get all paths I'm looking for a smart way to get all paths traversing a given data structure. I figured out that I need a function like this: allPaths :: (a -> [a]) -> a -> [[a]] It takes a seed a and a function a -> [a]...

Haskell: get all paths Haskell: get all paths haskell Haskell Haskell: get all paths I'm looking for a smart way to get all paths traversing a given data structure. I figured out that I need a function like this: It takes a seed a and a function a -> [a] (from each "a", you can get to multiple a's). The result is a lis...

[ 0.0103759765625, 0.01214599609375, -0.00750732421875, 0.006591796875, 0.00933837890625, 0.01031494140625, -0.006744384765625, -0.01177978515625, -0.0020294189453125, -0.06103515625, 0.00909423828125, -0.009033203125, -0.006988525390625, 0.04248046875, 0.00628662109375, -0.0071716308593...

[ 20625, 142508, 2046, 756, 60875, 12, 7, 1556, 16487, 100, 18775, 3917, 47, 37317, 214, 34475, 2053, 45646, 26366, 3871, 32354, 1884, 903, 51776, 40, 297, 10, 136, 33079, 11, 12638, 831, 48716, 25, 16750, 5303, 72134, 1295, 80934, 22027, ...

[ 0.1484375, 0.221923828125, 0.14404296875, 0.207763671875, 0.266357421875, 0.0141754150390625, 0.1171875, 0.144775390625, 0.048004150390625, 0.004669189453125, 0.1279296875, 0.044677734375, 0.08184814453125, 0.1666259765625, 0.06011962890625, 0.043121337890625, 0.09765625, 0.1632080...

embed

13346200_c0

13346200

haskell

0

Title: Type-safe difference lists Problem title: Type-safe difference lists Tags: types, haskell Problem: Type-safe difference lists A common idiom in Haskell, difference lists, is to represent a list xs as the value (xs ++) . Then (.) becomes " (++) " and id becomes " [] " (in fact this works for any monoid or categor...

Type-safe difference lists Type-safe difference lists types haskell Type-safe DList ShowS Type-safe difference lists A common idiom in Haskell, difference lists, is to represent a list xs as the value (xs ++) . Then (.) becomes " (++) " and id becomes " [] " (in fact this works for any monoid or category). Since we can...

[ 0.00457763671875, 0.009033203125, 0.00469970703125, 0.01361083984375, 0.00168609619140625, 0.018310546875, -0.00848388671875, -0.0072021484375, -0.00396728515625, -0.006195068359375, -0.0029449462890625, -0.004119873046875, -0.005279541015625, 0.0118408203125, -0.00531005859375, 0.0156...

[ 60457, 115840, 60212, 5303, 52895, 1556, 142508, 391, 154663, 17367, 294, 39210, 13373, 306, 23, 20625, 33636, 1022, 7, 237, 34292, 425, 37223, 5, 24209, 3447, 43240, 22460, 532, 95487, 831, 150350, 32354, 53697, 1733, 26267, 93766, 45367, ...

[ 0.2030029296875, 0.2003173828125, 0.2578125, 0.2222900390625, 0.145751953125, 0.1077880859375, 0.244140625, 0.1004638671875, 0.2364501953125, 0.177978515625, 0.08453369140625, 0.124755859375, 0.185302734375, 0.195068359375, 0.0257110595703125, 0.1181640625, 0.18701171875, 0.1038208...

embed

37015327_c0

37015327

haskell

0

Title: Solving and producing and equation with variables indexed by a given set (Haskell) Problem title: Solving and producing and equation with variables indexed by a given set (Haskell) Tags: linear-equation, variables, haskell, indexing Problem: Solving and producing and equation with variables indexed by a given se...

Solving and producing and equation with variables indexed by a given set (Haskell) Solving and producing and equation with variables indexed by a given set (Haskell) linear-equation variables haskell indexing Solving Haskell d_1 d_r Sum d_i x_i Solving and producing and equation with variables indexed by a given set (H...

[ -0.0115966796875, 0.00799560546875, -0.005462646484375, 0.01904296875, -0.00421142578125, -0.0074462890625, -0.007720947265625, 0.0244140625, 0.01513671875, -0.020751953125, -0.00799560546875, -0.0118408203125, 0.009033203125, -0.009033203125, -0.0084228515625, 0.01055908203125, 0.03...

[ 6678, 6496, 136, 27024, 5490, 678, 77336, 63262, 34475, 5423, 6495, 7, 142508, 28, 390, 192617, 13, 1556, 20625, 104, 115187, 454, 42, 36335, 14, 1022, 3444, 86869, 25632, 2967, 23, 10842, 653, 186, 6083, 14012, 2633, 62, 71, 24491, 101...

[ 0.1204833984375, 0.0491943359375, 0.08087158203125, 0.1639404296875, 0.1923828125, 0.10076904296875, 0.18603515625, 0.1776123046875, 0.038787841796875, 0.15283203125, 0.09893798828125, 0.0767822265625, 0.25537109375, 0.033477783203125, 0.041961669921875, 0.09906005859375, 0.025665283...

embed

37513423_c0

37513423

haskell

0

Title: Haskell Exception: Prelude.read: no parse Problem title: Haskell Exception: Prelude.read: no parse Tags: haskell Problem: Haskell Exception: Prelude.read: no parse I am new to Haskell, kinda 2 days since I study Haskell, and I want to do a project with files. I did it already in c++ and now I want to do it in Ha...

Haskell Exception: Prelude.read: no parse Haskell Exception: Prelude.read: no parse haskell System.IO Haskell Exception Prelude.read Please code1 book.txt Cod Haskell Exception: Prelude.read: no parse I am new to Haskell, kinda 2 days since I study Haskell, and I want to do a project with files. I did it already in c++...

[ 0.01129150390625, 0.00537109375, 0.0014495849609375, 0.010986328125, 0.0308837890625, 0.01141357421875, 0.0011138916015625, -0.00201416015625, -0.005767822265625, -0.039794921875, -0.0216064453125, -0.038330078125, -0.0150146484375, -0.004669189453125, 0.033203125, -0.03759765625, 0....

[ 20625, 142508, 5443, 63928, 1914, 822, 112, 39116, 12, 110, 366, 184, 1556, 12353, 17780, 30607, 18151, 418, 12877, 124326, 55879, 3525, 13452, 678, 102158, 37223, 10176, 35773, 1294, 68067, 3445, 3884, 3934, 11435, 4343, 237, 23, 18, 959, ...

[ 0.1441650390625, 0.206787109375, 0.08660888671875, 0.1688232421875, 0.1258544921875, 0.2054443359375, 0.1541748046875, 0.25244140625, 0.0272369384765625, 0.1363525390625, 0.1864013671875, 0.140625, 0.1346435546875, 0.07000732421875, 0.13916015625, 0.182373046875, 0.21923828125, 0.0...

embed

26579731_c0

26579731

haskell

0

Title: Is a list comprehension or a sequential filter more optimized? Problem title: Is a list comprehension or a sequential filter more optimized? Tags: optimization, list-comprehension, computation-theory, algorithm, haskell Problem: Is a list comprehension or a sequential filter more optimized? Let's say you have to...

Is a list comprehension or a sequential filter more optimized? Is a list comprehension or a sequential filter more optimized? optimization list-comprehension computation-theory algorithm haskell Is a list comprehension or a sequential filter more optimized? Let's say you have to return the sum of all the multiples of 2...

[ -0.007171630859375, 0.01483154296875, 0.01312255859375, -0.003997802734375, 0.0023040771484375, -0.01104736328125, -0.0164794921875, -0.00909423828125, 0.004425048828125, -0.02783203125, -0.0030059814453125, 0.00311279296875, 0.033935546875, -0.006683349609375, -0.0257568359375, 0.0033...

[ 5303, 46683, 3220, 6889, 707, 243228, 289, 46312, 1286, 15572, 29367, 87235, 277, 4692, 181135, 234873, 1556, 142508, 2071, 10, 30646, 10554, 756, 48716, 116, 136, 138, 5423, 892, 26255, 1295, 106, 45881, 20625, 18151, 33022, 6713, 4527, 69...

[ 0.2261962890625, 0.1849365234375, 0.1661376953125, 0.1092529296875, 0.0701904296875, 0.2227783203125, 0.04901123046875, 0.25244140625, 0.159912109375, 0.2152099609375, 0.14892578125, 0.159912109375, 0.03997802734375, 0.1297607421875, 0.06744384765625, 0.1927490234375, 0.09619140625, ...

embed

33188801_c0

33188801

haskell

0

Title: Haskell optimization program Problem title: Haskell optimization program Tags: haskell Problem: Haskell optimization program Have the task I need to implement the function Change, which will take the value and split it into the possible combinations from list of coins(random list) Example: coins = [2,3,7] GHCi> ...

Haskell optimization program Haskell optimization program haskell Haskell GHCi Num Ord n-1 x:xs Haskell optimization program Have the task I need to implement the function Change, which will take the value and split it into the possible combinations from list of coins(random list) Example: That's what I did: But this c...

[ -0.03564453125, 0.0026702880859375, -0.0040283203125, -0.0002613067626953125, -0.0072021484375, 0.0042724609375, -0.029296875, -0.0024871826171875, 0.015869140625, -0.0091552734375, -0.01220703125, 0.0272216796875, 0.0255126953125, 0.00156402587890625, -0.005615234375, 0.00009059906005...

[ 20625, 142508, 87235, 1363, 1528, 1556, 527, 73265, 14, 52782, 35379, 653, 5759, 1022, 12, 425, 31901, 66211, 87, 3871, 29479, 32354, 87377, 1221, 5646, 34292, 136, 65450, 3934, 7722, 162515, 1295, 5303, 43780, 7, 46258, 89536, 6777, 4966, ...

[ 0.167236328125, 0.26806640625, 0.2337646484375, 0.047576904296875, 0.1624755859375, 0.15185546875, 0.0633544921875, 0.10186767578125, 0.12744140625, 0.1578369140625, 0.206298828125, 0.042449951171875, 0.1214599609375, 0.0716552734375, 0.026519775390625, 0.0760498046875, 0.04592895507...

embed

55760073_c0

55760073

haskell

0

Title: Count frequency of every element in a list using just comparison operators Problem title: Count frequency of every element in a list using just comparison operators Tags: haskell Problem: Count frequency of every element in a list using just comparison operators I am new to Haskell and I have to count the freque...

Count frequency of every element in a list using just comparison operators Count frequency of every element in a list using just comparison operators haskell just Data.Map Count Ord Count frequency of every element in a list using just comparison operators I am new to Haskell and I have to count the frequencies of elem...

[ 0.0009002685546875, 0.0159912109375, -0.01708984375, -0.022216796875, 0.00238037109375, -0.0012054443359375, -0.00531005859375, -0.010986328125, 0.00439453125, -0.0159912109375, -0.004058837890625, -0.01055908203125, 0.0322265625, 0.033935546875, -0.016845703125, -0.01904296875, -0.0...

[ 108210, 12478, 944, 27771, 11907, 12830, 5303, 1660, 225490, 39933, 23, 1556, 142508, 11809, 166179, 35379, 17368, 3525, 20625, 54529, 117538, 80854, 30646, 22799, 34292, 80836, 14012, 20028, 74918, 107730, 2389, 304, 216969, 71928, 140992, 5608,...

[ 0.198974609375, 0.21875, 0.17724609375, 0.07373046875, 0.12890625, 0.1929931640625, 0.201416015625, 0.12548828125, 0.24560546875, 0.20361328125, 0.04522705078125, 0.113525390625, 0.2220458984375, 0.088134765625, 0.16845703125, 0.164794921875, 0.00152587890625, 0.034393310546875, ...

embed

26632866_c0

26632866

haskell

0

Title: conduit stream to list of actions Problem title: conduit stream to list of actions Tags: conduit, haskell Problem: conduit stream to list of actions I have: an infinite network stream as source (responseBody response) a parser: myParser = many1 parseOneObj of type Parser [MyObj] I would like to handle each objec...

conduit stream to list of actions conduit stream to list of actions conduit haskell many1 Parser MyObj CL.mapM_ B.putStrLn conduit stream to list of actions I have: an infinite network stream as source (responseBody response) a parser: myParser = many1 parseOneObj of type Parser [MyObj] I would like to handle each obje...

[ -0.007568359375, 0.0137939453125, -0.004486083984375, 0.000713348388671875, 0.01141357421875, 0.0390625, -0.00154876708984375, -0.004425048828125, 0.0157470703125, -0.044677734375, -0.019287109375, -0.01318359375, 0.01904296875, -0.004669189453125, 0.0019683837890625, -0.00260925292968...

[ 120565, 75973, 47, 5303, 111, 61972, 1556, 142508, 5941, 418, 2392, 2189, 2646, 46471, 170, 46323, 62346, 335, 7077, 71713, 765, 54241, 13, 33120, 31344, 134719, 12647, 1459, 57553, 366, 759, 28636, 184, 62068, 10644, 31852, 2806, 1884, 348...

[ 0.265380859375, 0.269287109375, 0.1251220703125, 0.1829833984375, 0.06201171875, 0.22998046875, 0.09814453125, 0.203369140625, 0.159912109375, 0.0816650390625, 0.08837890625, 0.1278076171875, 0.0682373046875, 0.0986328125, 0.1187744140625, 0.025146484375, 0.059783935546875, 0.02555...

embed

43985848_c0

43985848

haskell

0

Title: What are the differences between skylighting, pygments and Linguist? Problem title: What are the differences between skylighting, pygments and Linguist? Tags: github-linguist, haskell, pandoc, pygments, syntax-highlighting Problem: What are the differences between skylighting, pygments and Linguist? Aside from b...

What are the differences between skylighting, pygments and Linguist? What are the differences between skylighting, pygments and Linguist? github-linguist haskell pandoc pygments syntax-highlighting What Linguist What are the differences between skylighting, pygments and Linguist? Aside from being written in haskell, py...

[ 0.0023956298828125, 0.0087890625, -0.00823974609375, 0.009765625, -0.01190185546875, 0.01513671875, 0.0017547607421875, 0.0169677734375, -0.0019073486328125, 0.033935546875, 0.0242919921875, -0.018798828125, -0.0033721923828125, 0.002349853515625, -0.00634765625, 0.01055908203125, 0....

[ 60212, 7, 17721, 20704, 177476, 17198, 177, 9035, 136, 39286, 34, 1419, 62270, 32102, 65279, 1556, 142508, 2652, 29713, 6002, 86531, 84396, 4865, 59121, 23, 50828, 21922, 53, 5201, 285, 46876, 8060, 12921, 70796, 45646, 1836, 11814, 1940, 1...

[ 0.212646484375, 0.073486328125, 0.056549072265625, 0.1895751953125, 0.247802734375, 0.160888671875, 0.1890869140625, 0.19921875, 0.024658203125, 0.17041015625, 0.1842041015625, 0.1585693359375, 0.1090087890625, 0.16943359375, 0.1802978515625, 0.07281494140625, 0.1939697265625, 0.07...

embed

36481476_c0

36481476

haskell

0

Title: How to implement mathematics induction on Haskell Problem title: How to implement mathematics induction on Haskell Tags: proof, math, induction, haskell Problem: How to implement mathematics induction on Haskell data Nat = Zero | Succ Nat type Predicate = (Nat -> Bool) -- forAllNat p = (p n) for every finite def...

How to implement mathematics induction on Haskell How to implement mathematics induction on Haskell proof math induction haskell How Haskell Nat Zero Succ Predicate Bool How to implement mathematics induction on Haskell Question: Prove that if basecase p and indstep p , then forAllNat p What I do not understand is that...

[ -0.01385498046875, -0.006256103515625, 0.0037384033203125, 0.0286865234375, 0.006378173828125, 0.007568359375, 0.00860595703125, -0.01470947265625, -0.01458740234375, -0.027587890625, 0.0146484375, -0.00007343292236328125, -0.024169921875, -0.0076904296875, -0.002410888671875, 0.004699...

[ 11249, 47, 29479, 291, 140363, 41637, 23, 77391, 98, 20625, 142508, 98869, 48909, 1556, 68875, 83947, 1832, 10060, 7145, 2063, 2460, 929, 1250, 272, 2174, 3647, 58437, 915, 136, 2752, 95528, 100, 43512, 4645, 18, 28219, 5608, 87599, 436, ...

[ 0.074951171875, 0.0279998779296875, 0.204833984375, 0.01776123046875, 0.1541748046875, 0.13916015625, 0.1273193359375, 0.239990234375, 0.1153564453125, 0.1787109375, 0.2587890625, 0.1436767578125, 0.128173828125, 0.1602783203125, 0.196533203125, 0.17041015625, 0.10986328125, 0.1683...

embed

4033103_c0

4033103

haskell

0

Title: Type error using Criterion Problem title: Type error using Criterion Tags: haskell-criterion, haskell Problem: Type error using Criterion I read the documentation and some articles that talk about the package, but I'm new to Haskell and did not understand much but I tried .... Below is what I did: module Main wh...

Type error using Criterion Type error using Criterion haskell-criterion haskell Control.Exception Criterion Control.Parallel Data.List IO Data.Char Criterion.Main Type Main LANGUAGE BangPatterns FilePath mkList1.txt Couldn Type error using Criterion I read the documentation and some articles that talk about the package...

[ 0.0052490234375, -0.01708984375, -0.0093994140625, -0.0037078857421875, 0.00457763671875, -0.01434326171875, 0.006134033203125, -0.015380859375, 0.01092529296875, -0.01007080078125, 0.0030517578125, -0.030517578125, -0.00628662109375, -0.026123046875, 0.00186920166015625, -0.0132446289...

[ 60457, 18499, 17368, 26315, 720, 1830, 1556, 142508, 59869, 56, 27131, 63928, 55292, 1229, 11809, 154663, 17780, 84068, 168793, 12321, 98064, 26387, 8335, 3055, 42724, 10519, 19201, 418, 124326, 191147, 12301, 209806, 98169, 3525, 20625, 28219, ...

[ 0.248779296875, 0.2161865234375, 0.09210205078125, 0.1651611328125, 0.198486328125, 0.17626953125, 0.14111328125, 0.2022705078125, 0.11865234375, 0.1485595703125, 0.1561279296875, 0.05303955078125, 0.00482177734375, 0.0660400390625, 0.050384521484375, 0.1695556640625, 0.0642700195312...

embed

40555972_c0

40555972

haskell

0

Title: How do you make a custom filter? Problem title: How do you make a custom filter? Tags: haskell, filter Problem: How do you make a custom filter? I am having trouble trying to figure this out myself with no success. I am trying to make my own Filter where instead of not including something in the List because it ...

How do you make a custom filter? How do you make a custom filter? haskell filter How Bool x:xs isIt1andOnly1 How do you make a custom filter? I am having trouble trying to figure this out myself with no success. I am trying to make my own Filter where instead of not including something in the List because it is false i...

[ -0.002899169921875, 0.0164794921875, -0.0108642578125, -0.0169677734375, -0.002899169921875, 0.00457763671875, 0.01239013671875, -0.0021209716796875, 0.0184326171875, -0.007720947265625, 0.01434326171875, -0.007110595703125, -0.0011749267578125, 0.01434326171875, -0.01513671875, 0.0044...

[ 11249, 54, 398, 3249, 10, 114122, 46312, 1556, 142508, 2460, 929, 1022, 425, 7, 83, 23389, 418, 2940, 20320, 538, 63134, 26366, 35978, 36272, 31577, 10002, 128896, 64457, 959, 26719, 32036, 6637, 98320, 442, 14602, 9844, 18151, 37842, 759, ...

[ 0.0841064453125, 0.06146240234375, 0.04705810546875, 0.15380859375, 0.0780029296875, 0.26025390625, 0.29443359375, 0.14306640625, 0.205078125, 0.0841064453125, 0.177978515625, 0.08233642578125, 0.0894775390625, 0.013580322265625, 0.09832763671875, 0.1839599609375, 0.09417724609375, ...

embed

22416292_c0

22416292

haskell

0

Title: Project Euler #14 Tips in Haskell? Problem title: Project Euler #14 Tips in Haskell? Tags: optimization, math, haskell Problem: Project Euler #14 Tips in Haskell? I am trying euler challenge 14 . I was wondering if I could have any tips for calculating it quickly in haskell. I tried this naive approach. import D...

Project Euler #14 Tips in Haskell? Project Euler #14 Tips in Haskell? optimization math haskell Project Euler Tips Haskell Main System.Timeout Nothing Project Euler #14 Tips in Haskell? I am trying euler challenge 14 . I was wondering if I could have any tips for calculating it quickly in haskell. I tried this naive ap...

[ -0.004364013671875, 0.001220703125, 0.0022125244140625, -0.00543212890625, 0.007354736328125, 0.01043701171875, -0.005157470703125, -0.01287841796875, 0.0027008056640625, -0.060302734375, -0.0030670166015625, 0.0036163330078125, -0.00946044921875, 0.01165771484375, 0.01123046875, 0.002...

[ 27331, 5177, 603, 468, 2592, 13785, 23, 20625, 142508, 87235, 48909, 1556, 12321, 12353, 70059, 6056, 182747, 31577, 1175, 66801, 616, 6305, 74481, 1916, 442, 69405, 37842, 5844, 51515, 34739, 5792, 4989, 17368, 39531, 184, 65780, 9136, 41911...

[ 0.10205078125, 0.1226806640625, 0.166748046875, 0.054168701171875, 0.204833984375, 0.1864013671875, 0.0867919921875, 0.1539306640625, 0.2568359375, 0.1295166015625, 0.0787353515625, 0.1473388671875, 0.0872802734375, 0.111328125, 0.1416015625, 0.1480712890625, 0.1680908203125, 0.057...

embed

74246650_c1

74246650

haskell

1

code of the classes. I've been thinking for a long time and i can't find a resonable solution, all help is welcome , thank you! data Tree a = Empty | Node a (Tree a) (Tree a) data Forest a = Nil | Cons (Tree a) (Forest a) instance Show a => Show (Tree a) where show Empty = "()" show (Node b (xl) (xr)) = "(" ++ show xl...

[ -0.00007390975952148438, 0.00750732421875, -0.013916015625, 0.01104736328125, 0.0067138671875, 0.0108642578125, -0.005859375, -0.025146484375, 0.00180816650390625, -0.011474609375, -0.0211181640625, -0.0240478515625, 0.002716064453125, 0.0262451171875, -0.0078125, -0.01263427734375, ...

[ 18151, 111, 70, 61112, 47644, 4989, 1733, 831, 18, 7413, 191, 2886, 29806, 756, 4358, 81907, 38, 2053, 101344, 10, 2203, 31678, 939, 58745, 438, 112, 62731, 87282, 77175, 39215, 18537, 525, 110527, 17367, 7639, 5021, 876, 92595, 37223, 10...

[ 0.26611328125, 0.15869140625, 0.0799560546875, 0.262939453125, 0.06231689453125, 0.036163330078125, 0.01190185546875, 0.022705078125, 0.05792236328125, 0.009246826171875, 0.043121337890625, 0.03045654296875, 0.1202392578125, 0.0517578125, 0.046417236328125, 0.0266876220703125, 0.0372...

embed

69921366_c1

69921366

haskell

1

/et/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.7.temp/ghc-8.10.7/ Error: Error encountered while installing GHC with make install run in /home/et/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.7.temp/ghc-8.10.7/ The following directories may now contain files, but won't be used by stack: - /home/et/.stack/programs/x86_...

[ 0.015869140625, 0.008544921875, 0.0286865234375, 0.004180908203125, 0.01025390625, -0.0101318359375, -0.031494140625, -0.0322265625, -0.0113525390625, 0.03515625, 0.006744384765625, -0.0179443359375, 0.001739501953125, -0.00103759765625, 0.000934600830078125, 0.01055908203125, 0.0049...

[ 248, 126, 64, 590, 2594, 18749, 7, 15276, 13307, 2397, 6077, 9486, 238, 18, 7319, 910, 17376, 10179, 966, 5, 34224, 212059, 190647, 297, 12960, 20600, 214, 527, 73265, 678, 3249, 11675, 23, 29552, 9, 25632, 14364, 3387, 1543, 5036, 7054...

[ 0.0309906005859375, 0.1517333984375, 0.0182647705078125, 0.12060546875, 0.156494140625, 0.1610107421875, 0.012603759765625, 0.2054443359375, 0.1719970703125, 0.0819091796875, 0.1224365234375, 0.11376953125, 0.136962890625, 0.079833984375, 0.1907958984375, 0.1397705078125, 0.100219726...

embed

12255540_c0

12255540

haskell

0

Title: Encapsulation of GADT pattern matches Problem title: Encapsulation of GADT pattern matches Tags: haskell, refactoring, pattern-matching, gadt Problem: Encapsulation of GADT pattern matches In this code there are repeated fragments: insert x (AATree t) = case insert' x t of Same t -> AATree t Inc t -> AATree t in...

Encapsulation of GADT pattern matches Encapsulation of GADT pattern matches haskell refactoring pattern-matching gadt Encapsulation GADT AATree Same Inc Ord AANode Black Succ AnyColor Red insert2 Encapsulation of GADT pattern matches In this code there are repeated fragments: So it is tempting to write a function: And ...

[ -0.0262451171875, -0.0162353515625, 0.01611328125, -0.0150146484375, 0.003326416015625, -0.0035247802734375, -0.04248046875, -0.0224609375, 0.0159912109375, -0.003814697265625, 0.0167236328125, -0.003326416015625, 0.0045166015625, -0.023681640625, 0.0155029296875, 0.008056640625, 0.0...

[ 357, 15644, 7, 72403, 23749, 41072, 103510, 14858, 1556, 142508, 456, 144810, 98753, 914, 13384, 107, 13, 99908, 8942, 35379, 37026, 31, 112, 10074, 1832, 10060, 28541, 1484, 6096, 183540, 304, 90, 903, 18151, 119140, 38551, 20805, 1916, 33...

[ 0.060943603515625, 0.1925048828125, 0.07501220703125, 0.07464599609375, 0.1588134765625, 0.236328125, 0.204345703125, 0.1744384765625, 0.103759765625, 0.192626953125, 0.05926513671875, 0.14697265625, 0.1455078125, 0.09747314453125, 0.1820068359375, 0.07476806640625, 0.0062255859375, ...

embed

24851167_c0

24851167

haskell

0

Title: How to search a tuple and increment while saving the results Problem title: How to search a tuple and increment while saving the results Tags: haskell Problem: How to search a tuple and increment while saving the results import Data.Char import Data.List import Data.Maybe -- Sample test data type Movies = (Strin...

How to search a tuple and increment while saving the results How to search a tuple and increment while saving the results haskell Data.Char Data.List Data.Maybe How Sample Movies Will Smith Rise Planet Apes James Franco Godzilla Bryan Cranston How to search a tuple and increment while saving the results Thanks guys for...

[ 0.0108642578125, 0.0213623046875, 0.015380859375, 0.0064697265625, 0.009765625, 0.0113525390625, -0.00811767578125, 0.005096435546875, 0.020263671875, -0.0037384033203125, 0.0106201171875, 0.004150390625, 0.0107421875, 0.0341796875, 0.00193023681640625, -0.015625, 0.005584716796875, ...

[ 11249, 33938, 370, 8705, 136, 158661, 12960, 57, 6496, 50339, 47, 10, 70, 1556, 142508, 11809, 84068, 154663, 82419, 947, 33209, 83896, 20255, 37700, 24116, 13, 40357, 5787, 90, 14631, 36160, 3430, 169, 2298, 153095, 1603, 19386, 6, 51484, ...

[ 0.057342529296875, 0.274658203125, 0.1727294921875, 0.280517578125, 0.153076171875, 0.279052734375, 0.1253662109375, 0.180419921875, 0.1539306640625, 0.2325439453125, 0.0279693603515625, 0.07440185546875, 0.002288818359375, 0.1514892578125, 0.262451171875, 0.123291015625, 0.159057617...

embed

22049679_c0

22049679

haskell

0

Title: Data type combining other data types with tuple? Syntax needed - Haskell Problem title: Data type combining other data types with tuple? Syntax needed - Haskell Tags: haskell Problem: Data type combining other data types with tuple? Syntax needed - Haskell just a quick question as I'm not sure how to symatically...

Data type combining other data types with tuple? Syntax needed - Haskell Data type combining other data types with tuple? Syntax needed - Haskell haskell Data Syntax Haskell Teacher Assitant Student Classroom Assistant Data type combining other data types with tuple? Syntax needed - Haskell just a quick question as I'm...

[ 0.0020904541015625, 0.010498046875, 0.00213623046875, 0.0302734375, -0.0069580078125, -0.0027618408203125, -0.016357421875, 0.0021820068359375, -0.00885009765625, -0.01220703125, -0.0026397705078125, -0.01470947265625, 0.001312255859375, 0.0185546875, -0.0361328125, 0.0079345703125, ...

[ 11809, 10644, 375, 964, 3789, 2053, 52895, 678, 370, 8705, 19010, 86531, 44841, 20625, 142508, 592, 1556, 165136, 1301, 172, 18211, 26696, 35014, 28905, 181595, 63773, 9077, 2227, 3034, 29459, 765, 70541, 9351, 32070, 3444, 3249, 15700, 35839...

[ 0.1239013671875, 0.2147216796875, 0.09423828125, 0.1666259765625, 0.119873046875, 0.1800537109375, 0.20556640625, 0.09698486328125, 0.1160888671875, 0.221923828125, 0.108154296875, 0.1744384765625, 0.1024169921875, 0.118896484375, 0.2197265625, 0.0076904296875, 0.08392333984375, 0....

embed

73434721_c0

73434721

haskell

0

Title: Strict type alias in Haskell Problem title: Strict type alias in Haskell Tags: haskell Problem: Strict type alias in Haskell Suppose I have a recursive function taking 3 integers, each having a different meaning, e.g. func :: Int -> Int -> Int -> SomeType1 -> SomeType2 What I want is to prevent myself from misty...

Strict type alias in Haskell Strict type alias in Haskell haskell Strict Haskell SomeType1 SomeType2 FuncFirstArg FuncSecondArg FuncThirdArg Strict type alias in Haskell Suppose I have a recursive function taking 3 integers, each having a different meaning, e.g. What I want is to prevent myself from mistyping the order...

[ 0.0027008056640625, 0.0059814453125, 0.0045166015625, 0.0037841796875, 0.01287841796875, 0.0184326171875, -0.0081787109375, 0.0194091796875, -0.005828857421875, -0.0007781982421875, 0.0091552734375, -0.021728515625, -0.0120849609375, 0.0130615234375, 0.00408935546875, 0.025390625, 0....

[ 73425, 15390, 10644, 55109, 20625, 142508, 1556, 31384, 196707, 418, 304, 28670, 207263, 7614, 177, 2271, 117177, 4216, 195625, 5844, 32354, 35971, 138, 892, 26255, 12921, 91084, 3444, 56282, 35978, 1239, 46280, 12989, 10750, 1884, 7477, 238, ...

[ 0.1943359375, 0.1231689453125, 0.2108154296875, 0.25244140625, 0.1309814453125, 0.236328125, 0.1156005859375, 0.0190582275390625, 0.2061767578125, 0.029876708984375, 0.0220184326171875, 0.08172607421875, 0.03619384765625, 0.0799560546875, 0.1097412109375, 0.054779052734375, 0.0358581...

embed

40647332_c0

40647332

haskell

0

Title: Why do you need let keyword in do block? Problem title: Why do you need let keyword in do block? Tags: haskell, let Problem: Why do you need let keyword in do block? What is the reason for having let in do block. -- codeblock A main = do let a = 0 let f a = a + 1 let b = f 0 print (a,b) -- codeblock B main = do ...

Why do you need let keyword in do block? Why do you need let keyword in do block? haskell let Why Why do you need let keyword in do block? What is the reason for having let in do block. Assume all let without in must followed by = (Is this true?) Compiler should be able to imply let from = and preprocess/de-sugar codeb...

[ 0.002716064453125, 0.01202392578125, 0.0107421875, 0.0159912109375, -0.004119873046875, 0.005584716796875, -0.004608154296875, 0.0089111328125, 0.004119873046875, 0.01043701171875, -0.0108642578125, -0.00811767578125, -0.01092529296875, 0.007781982421875, 0.01361083984375, 0.0086059570...

[ 44084, 3871, 2633, 166117, 23, 54, 46389, 1556, 142508, 31635, 19441, 66596, 756, 15490, 8110, 134629, 2203, 29568, 15612, 34759, 19048, 21980, 538, 1295, 479, 63923, 112, 1159, 1970, 18151, 81409, 335, 47, 62, 17368, 26531, 55076, 391, 237...

[ 0.097412109375, 0.151123046875, 0.2115478515625, 0.225830078125, 0.10107421875, 0.1217041015625, 0.2186279296875, 0.102783203125, 0.1939697265625, 0.0770263671875, 0.05926513671875, 0.01739501953125, 0.009429931640625, 0.0902099609375, 0.0309295654296875, 0.06787109375, 0.13317871093...

embed

45675403_c0

45675403

haskell

0

Title: Getting the first available port in Haskell, in a platform-independent way Problem title: Getting the first available port in Haskell, in a platform-independent way Tags: network-programming, haskell Problem: Getting the first available port in Haskell, in a platform-independent way I'd like to get the first ava...

Getting the first available port in Haskell, in a platform-independent way Getting the first available port in Haskell, in a platform-independent way network-programming haskell Getting Haskell Get Integer AF_INET Stream SockAddrInet aNY_PORT iNADDR_ANY Getting the first available port in Haskell, in a platform-indepen...

[ -0.023681640625, 0.0223388671875, 0.000644683837890625, -0.007080078125, -0.00055694580078125, -0.0028533935546875, -0.00909423828125, -0.004241943359375, 0.0037841796875, -0.057373046875, 0.0228271484375, -0.004608154296875, -0.000255584716796875, 0.0294189453125, -0.006561279296875, ...

[ 210732, 5117, 19882, 11469, 20625, 142508, 13651, 181063, 23, 3917, 33120, 28966, 1556, 20779, 44401, 28211, 17777, 115061, 1061, 7569, 126, 25182, 91599, 149300, 23498, 93333, 1884, 2046, 99091, 4034, 94878, 17368, 68557, 32354, 9077, 171859, ...

[ 0.08465576171875, 0.155029296875, 0.1663818359375, 0.219970703125, 0.13232421875, 0.24169921875, 0.100341796875, 0.089111328125, 0.016082763671875, 0.01422119140625, 0.056488037109375, 0.033782958984375, 0.08758544921875, 0.0677490234375, 0.14794921875, 0.1143798828125, 0.11755371093...

embed

8703319_c0

8703319

haskell

0

Title: Haskell projects to study and learn from? Problem title: Haskell projects to study and learn from? Tags: open-source, haskell Problem: Haskell projects to study and learn from? As a developer who is new to Haskell, I am looking for open-source Haskell applications that I could study and learn from. In particular...

Haskell projects to study and learn from? Haskell projects to study and learn from? open-source haskell Haskell Haskell projects to study and learn from? As a developer who is new to Haskell, I am looking for open-source Haskell applications that I could study and learn from. In particular, I am looking for open-source...

[ -0.00007200241088867188, 0.01458740234375, 0.0079345703125, 0.006317138671875, 0.000576019287109375, -0.0011444091796875, -0.0264892578125, -0.00189208984375, 0.019775390625, -0.0062255859375, 0.011962890625, -0.044677734375, -0.000568389892578125, 0.004425048828125, -0.005340576171875, ...

[ 20625, 142508, 77635, 47, 35187, 136, 30698, 1295, 32, 9803, 60427, 1556, 106001, 3525, 16487, 86685, 87, 5809, 100, 7639, 11249, 33022, 33120, 10723, 105994, 5299, 27226, 57553, 19161, 11192, 8305, 5550, 254, 1467, 39642, 2806, 95134, 27781,...

[ 0.154296875, 0.25341796875, 0.214599609375, 0.06695556640625, 0.1329345703125, 0.056182861328125, 0.1307373046875, 0.1109619140625, 0.00653076171875, 0.1546630859375, 0.174560546875, 0.1358642578125, 0.09375, 0.0758056640625, 0.04498291015625, 0.1524658203125, 0.004119873046875, 0....

embed

9686665_c0

9686665

haskell

0

Title: How can I test a higher-order function using QuickCheck? Problem title: How can I test a higher-order function using QuickCheck? Tags: haskell, quickcheck Problem: How can I test a higher-order function using QuickCheck? I have a higher-order function that I want to test, and one of the properties I want to test...

How can I test a higher-order function using QuickCheck? How can I test a higher-order function using QuickCheck? haskell quickcheck QuickCheck How Bool How can I test a higher-order function using QuickCheck? I have a higher-order function that I want to test, and one of the properties I want to test is what it does w...

[ -0.0098876953125, 0.00109100341796875, 0.0001239776611328125, -0.01397705078125, 0.000904083251953125, 0.01092529296875, 0.015380859375, -0.04296875, 0.00616455078125, -0.02197265625, -0.00014972686767578125, 0.0186767578125, -0.025390625, -0.0211181640625, 0.00762939453125, -0.0209960...

[ 11249, 831, 87, 3034, 77546, 80596, 32354, 17368, 89038, 202567, 1556, 142508, 63773, 78292, 2460, 929, 3444, 183871, 14602, 678, 115081, 23, 164156, 27781, 6528, 166904, 145823, 4034, 11001, 10, 28282, 1507, 5303, 1653, 2063, 14192, 47, 7279...

[ 0.0760498046875, 0.09002685546875, 0.03326416015625, 0.24267578125, 0.1478271484375, 0.1968994140625, 0.1927490234375, 0.0926513671875, 0.1658935546875, 0.309814453125, 0.08660888671875, 0.1927490234375, 0.1102294921875, 0.2298583984375, 0.0362548828125, 0.115478515625, 0.02252197265...

embed

73681440_c0

73681440

haskell

0

Title: How to terminate an array modification function in haskell? Problem title: How to terminate an array modification function in haskell? Tags: haskell Problem: How to terminate an array modification function in haskell? So I have this function... removeDuplicate :: [CustomType] -> [CustomType] removeDuplicate [] =...

How to terminate an array modification function in haskell? How to terminate an array modification function in haskell? haskell How CustomType x:y:xs How to terminate an array modification function in haskell? So I have this function... Here, I have to check if there is an element in the array(sorted) which is equal to...

[ 0.0064697265625, 0.031494140625, 0.0026397705078125, -0.017333984375, -0.004119873046875, -0.006591796875, -0.003631591796875, 0.01068115234375, 0.0006866455078125, -0.006072998046875, -0.0013580322265625, -0.00445556640625, 0.0213623046875, -0.0068359375, -0.00653076171875, 0.00366210...

[ 11249, 121011, 13, 10298, 53, 129344, 32354, 1556, 142508, 130664, 196707, 425, 23, 765, 12765, 2174, 12830, 62351, 105950, 3789, 80854, 2886, 4488, 29527, 1363, 35431, 903, 3934, 54241, 40956, 645, 3688, 36997, 54529, 16648, 20625, 34831 ]

[ 0.0657958984375, 0.2186279296875, 0.1329345703125, 0.1549072265625, 0.1387939453125, 0.25927734375, 0.1849365234375, 0.125, 0.216552734375, 0.17822265625, 0.2027587890625, 0.0292510986328125, 0.0152435302734375, 0.002227783203125, 0.143798828125, 0.031646728515625, 0.116943359375, ...

embed

4438393_c0

4438393

haskell

0

Title: Represent Flowchart-specified Algorithms in Haskell Problem title: Represent Flowchart-specified Algorithms in Haskell Tags: haskell Problem: Represent Flowchart-specified Algorithms in Haskell I'm confronted with the task of implementing algorithms (mostly business logic style) expressed as flowcharts. I'm awar...

Represent Flowchart-specified Algorithms in Haskell Represent Flowchart-specified Algorithms in Haskell haskell Represent Flowchart-specified Algorithms Haskell Represent Flowchart-specified Algorithms in Haskell I'm confronted with the task of implementing algorithms (mostly business logic style) expressed as flowchar...

[ 0.002960205078125, -0.0016326904296875, 0.01324462890625, 0.0029296875, 0.00543212890625, 0.01708984375, -0.01611328125, -0.00787353515625, -0.0185546875, 0.017333984375, -0.0038604736328125, -0.004302978515625, -0.00022411346435546875, 0.037353515625, -0.006622314453125, 0.00646972656...

[ 853, 55247, 38699, 9336, 3960, 16711, 47314, 109847, 2783, 18337, 20625, 142508, 23, 1556, 20549, 66211, 29479, 234873, 8063, 62775, 20623, 36510, 86608, 9254, 933, 959, 2965, 18811, 217904, 40899, 57266, 4527, 313, 9059, 179933, 29458, 237, ...

[ 0.0704345703125, 0.2216796875, 0.1690673828125, 0.1212158203125, 0.22509765625, 0.154296875, 0.0535888671875, 0.1441650390625, 0.1270751953125, 0.0675048828125, 0.151123046875, 0.269775390625, 0.0232086181640625, 0.1358642578125, 0.0290985107421875, 0.04559326171875, 0.115234375, 0...

embed

45987740_c0

45987740

haskell

0

Title: Type class instance redefining Problem title: Type class instance redefining Tags: duplicates, haskell, instance, monads, redefinition Problem: Type class instance redefining I am trying to answer this question: "Given the algebraic data type data Maybe a = Nothing | Just a pick the correct instance declaration ...

Type class instance redefining Type class instance redefining duplicates haskell instance monads redefinition Type Maybe Nothing Just Monad HwEx9.hs:16:10 Duplicate Defined GHC.Base Type class instance redefining I am trying to answer this question: "Given the algebraic data type pick the correct instance declaration t...

[ -0.0201416015625, 0.00994873046875, 0.0177001953125, 0.0101318359375, 0.01220703125, 0.0037384033203125, 0.00396728515625, 0.012939453125, -0.00124359130859375, -0.025146484375, -0.0302734375, -0.021484375, 0.007293701171875, 0.00537109375, 0.0179443359375, 0.0064697265625, 0.0050048...

[ 60457, 18507, 110527, 456, 49919, 171763, 1636, 1556, 142508, 2667, 712, 83425, 182747, 9563, 60331, 71, 19279, 1126, 786, 52721, 67, 262, 5983, 527, 73265, 63473, 31577, 35166, 429, 2844, 2053, 10644, 39580, 26785, 21635, 45831, 64549, 748, ...

[ 0.256591796875, 0.2310791015625, 0.262451171875, 0.1082763671875, 0.1826171875, 0.2242431640625, 0.06634521484375, 0.08251953125, 0.185791015625, 0.1087646484375, 0.124267578125, 0.255859375, 0.12939453125, 0.034698486328125, 0.1903076171875, 0.168701171875, 0.0576171875, 0.0526428...

embed

6222521_c0

6222521

haskell

0

Title: Haskell do syntax and I/O Problem title: Haskell do syntax and I/O Tags: haskell, ghci, ghc Problem: Haskell do syntax and I/O I was playing around with a simple program in Haskell: hello :: String -> String hello s = "Hello, " ++ (trim s) ++ "!\n" trim :: String -> String trim [] = [] trim s = head $ words s ma...

Haskell do syntax and I/O Haskell do syntax and I/O haskell ghci ghc Haskell Hello Please John Doe hello.exe hello.hs Haskell do syntax and I/O I was playing around with a simple program in Haskell: This is the output I am expecting: This works as expected when I load the program into ghci. However when I compile the p...

[ -0.00933837890625, 0.0004405975341796875, 0.00494384765625, 0.017578125, -0.020263671875, 0.038330078125, 0.003082275390625, 0.007049560546875, 0.0052490234375, -0.0162353515625, 0.00555419921875, -0.03662109375, -0.01312255859375, -0.00433349609375, 0.0078125, 0.01214599609375, 0.01...

[ 20625, 142508, 54, 6002, 86531, 136, 87, 64, 670, 1556, 31380, 318, 238, 35378, 30607, 4939, 984, 13, 33600, 31, 46480, 127, 75169, 10932, 8781, 1528, 3293, 83, 140992, 41206, 214, 43240, 84751, 72367, 3934, 33306, 3229, 9969, 1340, 17368...

[ 0.1470947265625, 0.2587890625, 0.1483154296875, 0.1181640625, 0.2001953125, 0.0241851806640625, 0.02886962890625, 0.193359375, 0.1407470703125, 0.1435546875, 0.1358642578125, 0.1591796875, 0.030364990234375, 0.1571044921875, 0.1746826171875, 0.1260986328125, 0.1287841796875, 0.1353...

embed

28492777_c0

28492777

haskell

0

Title: Binary Search Tree Haskell Problem title: Binary Search Tree Haskell Tags: functional-programming, haskell, binary-search-tree Problem: Binary Search Tree Haskell I have an insert function for a Binary Search Tree in Haskel. My insert functions first two lines look like this insert :: (Ord a) => BST a -> a -> BS...

Binary Search Tree Haskell Binary Search Tree Haskell functional-programming haskell binary-search-tree Binary Search Tree Haskell Ord BST Nil Node Occurs Expected Actual Binary Search Tree Haskell I have an insert function for a Binary Search Tree in Haskel. My insert functions first two lines look like this I know th...

[ -0.00072479248046875, -0.003021240234375, 0.01104736328125, -0.009521484375, 0.024658203125, 0.02001953125, -0.0201416015625, -0.042236328125, -0.0135498046875, -0.03515625, -0.00543212890625, -0.042724609375, 0.008544921875, 0.00616455078125, 0.0023193359375, 0.0016632080078125, 0.0...

[ 54092, 1294, 33086, 101344, 20625, 142508, 123309, 28966, 1556, 2394, 6635, 86250, 62600, 35379, 335, 8545, 77175, 438, 112, 180, 238, 48650, 60075, 13, 100582, 183540, 32354, 2590, 5117, 6626, 124519, 6713, 1884, 903, 3714, 43240, 3034, 1100...

[ 0.1995849609375, 0.113037109375, 0.2017822265625, 0.2420654296875, 0.1458740234375, 0.2398681640625, 0.1553955078125, 0.10308837890625, 0.1412353515625, 0.1834716796875, 0.1351318359375, 0.179931640625, 0.21630859375, 0.1358642578125, 0.077880859375, 0.1688232421875, 0.206298828125, ...

embed

73341047_c0

73341047

haskell

0

Title: Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution Problem title: Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution Tags: haskell, memory, performance Problem: Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution I'm trying to solve this problem https://codeforces.com/contest/285/problem/C?lo...

Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution haskell memory performance Data.List Data.Int Contest TIME_LIMIT_EXCEEDED Haskell Int64 Test Input Contest problem: TIME_LIMIT_EXCEEDED for Haskell solution I'm trying to solve this problem https://codefo...

[ -0.031005859375, 0.00180816650390625, 0.0057373046875, 0.00173187255859375, -0.0089111328125, -0.005645751953125, -0.004791259765625, -0.0026702880859375, -0.011962890625, -0.0152587890625, 0.01708984375, 0.002197265625, -0.004547119140625, 0.00408935546875, 0.00909423828125, -0.005004...

[ 185631, 2967, 110500, 83318, 6371, 26939, 10854, 104739, 397, 100, 20625, 142508, 29806, 1556, 98323, 23718, 11809, 154663, 13307, 8647, 360, 31577, 86869, 40899, 50930, 64, 2271, 6954, 101800, 38953, 98908, 3034, 966, 17475, 4382, 4432, 15572,...

[ 0.239501953125, 0.1578369140625, 0.214599609375, 0.1846923828125, 0.136474609375, 0.1192626953125, 0.1502685546875, 0.1446533203125, 0.07708740234375, 0.061126708984375, 0.147705078125, 0.2271728515625, 0.1651611328125, 0.126708984375, 0.1396484375, 0.117431640625, 0.016693115234375,...

embed

49565868_c0

49565868

haskell

0

Title: Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map and Data.HashMap can be made instances? Problem title: Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map an...

Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map and Data.HashMap can be made instances? Does there exist a generic "associative array" or "dictionary" typeclass in Haskell for which both Data.Map and Data.HashMap can be ...

[ -0.006378173828125, 0.0208740234375, 0.004302978515625, -0.004669189453125, -0.0084228515625, -0.003173828125, 0.003265380859375, -0.00182342529296875, 0.000759124755859375, -0.0216064453125, -0.000461578369140625, -0.0017852783203125, 0.017578125, 0.00860595703125, 0.0017547607421875, ...

[ 101790, 32316, 189534, 162, 45388, 45023, 10298, 53, 428, 10763, 6635, 10644, 67413, 20625, 142508, 11809, 166179, 6495, 1495, 831, 7228, 110527, 2685, 23, 15044, 136, 166027, 272, 19305, 1556, 5, 162087, 42719, 4331, 61687, 26946, 237, 10773...

[ 0.042633056640625, 0.1119384765625, 0.1805419921875, 0.0156707763671875, 0.142333984375, 0.1142578125, 0.1314697265625, 0.0955810546875, 0.026702880859375, 0.14013671875, 0.0667724609375, 0.17333984375, 0.244873046875, 0.12744140625, 0.2379150390625, 0.1033935546875, 0.205322265625, ...

embed

58317239_c0

58317239

haskell

0

Title: Binary search tree predicate with helper functions Problem title: Binary search tree predicate with helper functions Tags: tree, predicate, binary-search-tree, haskell, binary-tree Problem: Binary search tree predicate with helper functions data BinaryTree a = Null | Node (BinaryTree a) a (BinaryTree a) deriving...

Binary search tree predicate with helper functions Binary search tree predicate with helper functions tree predicate binary-search-tree haskell binary-tree Binary BinaryTree Node Show BSTree Ord Bool Binary search tree predicate with helper functions How can I use treeBSMin and treeBSMax as helper functions of isBSTree...

[ 0.016845703125, 0.0010833740234375, 0.002410888671875, -0.0179443359375, 0.0155029296875, 0.0419921875, -0.0012969970703125, -0.03759765625, -0.00081634521484375, 0.0040283203125, -0.02392578125, 0.002197265625, 0.0084228515625, -0.0047607421875, 0.0213623046875, 0.00518798828125, 0....

[ 54092, 1294, 33938, 53201, 1653, 2063, 67, 678, 4358, 56, 32354, 2394, 6635, 86250, 62600, 1556, 142508, 62731, 13, 438, 112, 17367, 84145, 35379, 2460, 929, 4527, 20429, 59076, 71346, 83, 7413, 36766 ]

[ 0.1771240234375, 0.095458984375, 0.1966552734375, 0.23046875, 0.10418701171875, 0.162109375, 0.05145263671875, 0.08599853515625, 0.157958984375, 0.114990234375, 0.158447265625, 0.1640625, 0.1463623046875, 0.1812744140625, 0.2047119140625, 0.09869384765625, 0.1881103515625, 0.182739...

embed

14096954_c1

14096954

haskell

1

TVar t0' with actual type `IO a0' In the return type of a call of `atomically' In a stmt of a 'do' block: buff <- atomically newBuffer In the expression: do { buff <- atomically newBuffer; atomically $ put buff unblocked; computeBlock buff; return buff } Does anybody know what the problem is, or maybe another way to im...

[ -0.0150146484375, 0.00811767578125, -0.00592041015625, 0.0228271484375, 0.008544921875, 0.01171875, 0.01324462890625, 0.003082275390625, 0.008056640625, -0.00567626953125, 0.0169677734375, -0.0023040771484375, 0.002777099609375, -0.003936767578125, 0.005035400390625, -0.00811767578125,...

[ 1910, 147, 808, 2389, 8561, 10644, 17780, 10, 30646, 11782, 5928, 71407, 6138, 39, 18, 111, 246, 46389, 123759, 34627, 3525, 7235, 18234, 125195, 54, 3650, 3884, 51, 81409, 9969, 6743, 166191, 3714, 2967, 29479, 6528, 18151, 28350, 83184, ...

[ 0.194091796875, 0.2213134765625, 0.049652099609375, 0.1513671875, 0.1248779296875, 0.165771484375, 0.1690673828125, 0.1197509765625, 0.188720703125, 0.152099609375, 0.1256103515625, 0.14794921875, 0.0728759765625, 0.022003173828125, 0.0933837890625, 0.0176849365234375, 0.126586914062...

embed

25487119_c0

25487119

haskell

0

Title: How do I get lazy streaming into the foldl'? Problem title: How do I get lazy streaming into the foldl'? Tags: space-leak, streaming, lazy-loading, lazy-io, haskell Problem: How do I get lazy streaming into the foldl'? How does one make their own streaming code? I was generating about 1,000,000,000 ran...

How do I get lazy streaming into the foldl'? How do I get lazy streaming into the foldl'? space-leak streaming lazy-loading lazy-io haskell How Would Ace How do I get lazy streaming into the foldl'? How does one make their own streaming code? I was generating about 1,000,000,000 random pairs of war decks, and...

[ -0.0103759765625, 0.007720947265625, 0.00750732421875, -0.0296630859375, 0.00689697265625, 0.01470947265625, -0.006103515625, -0.0128173828125, -0.0079345703125, -0.058837890625, 0.018310546875, -0.001617431640625, -0.000797271728515625, 0.01385498046875, -0.00775146484375, -0.01031494...

[ 11249, 2046, 21, 3285, 65296, 3934, 18344, 20469, 3768, 70, 32628, 133, 344, 63033, 846, 1556, 142508, 154559, 70280, 54, 25, 3249, 10002, 18151, 12663, 1672, 75534, 158887, 96759, 80836, 1631, 8, 22824, 36663, 75973, 95, 29191, 11675, 678,...

[ 0.0555419921875, 0.107666015625, 0.16796875, 0.247802734375, 0.243896484375, 0.1634521484375, 0.1617431640625, 0.21240234375, 0.0283050537109375, 0.0230865478515625, 0.1612548828125, 0.1302490234375, 0.1495361328125, 0.0863037109375, 0.154052734375, 0.05963134765625, 0.1942138671875,...

embed

39913349_c0

39913349

haskell

0

Title: Haskell beginner: Is this too imperative like? Problem title: Haskell beginner: Is this too imperative like? Tags: haskell Problem: Haskell beginner: Is this too imperative like? *Sorry for the extremely elementary question, but I am just starting out with Haskell. I have a Snap web app with a handler handleUser...

Haskell beginner: Is this too imperative like? Haskell beginner: Is this too imperative like? haskell Haskell Handler App Nothing Capout Just SELECT WHERE h:_ Username Haskell beginner: Is this too imperative like? *Sorry for the extremely elementary question, but I am just starting out with Haskell. I have a Snap web ...

[ 0.003753662109375, 0.0208740234375, 0.000652313232421875, 0.01177978515625, 0.000797271728515625, 0.0223388671875, 0.007110595703125, -0.03173828125, 0.0166015625, -0.048828125, 0.012451171875, -0.0281982421875, -0.01324462890625, -0.018798828125, -0.0205078125, 0.000682830810546875, ...

[ 20625, 142508, 9842, 1679, 2071, 903, 5792, 222530, 13, 1884, 1556, 10639, 603, 5659, 182747, 14304, 6056, 9563, 6755, 144832, 841, 30096, 1096, 12, 53400, 11627, 158240, 1294, 111531, 131830, 72134, 1810, 678, 121190, 1467, 4027, 35863, 3483...

[ 0.1575927734375, 0.2432861328125, 0.0938720703125, 0.07098388671875, 0.06854248046875, 0.087890625, 0.169677734375, 0.224853515625, 0.09820556640625, 0.1346435546875, 0.130859375, 0.1474609375, 0.168212890625, 0.1439208984375, 0.13330078125, 0.138671875, 0.176513671875, 0.051452636...

embed

72553398_c0

72553398

haskell

0

Title: What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? Problem title: What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? Tags: monoids, applicative, haskell, distributive, category-theory Problem: What is a cocartesian comonoid, and what is a cocartesian comonoid...

What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? monoids applicative haskell distributive category-theory What What is a cocartesian comonoid, and what is a cocartesian comonoidal functor? I've been experimenting ...

[ 0.00830078125, -0.00469970703125, 0.006378173828125, 0.01019287109375, 0.00179290771484375, 0.013671875, 0.00787353515625, -0.01483154296875, -0.0048828125, 0.000827789306640625, -0.0264892578125, -0.0133056640625, -0.01416015625, 0.0185546875, 0.00029754638671875, 0.0052490234375, -...

[ 4865, 83, 138091, 15492, 39209, 533, 157, 532, 136, 2367, 14, 2465, 7477, 18770, 10, 22460, 30185, 41816, 4935, 1556, 142508, 15917, 95487, 2347, 30675, 28007, 75571, 42991, 33946, 21771, 51529, 45646, 91067, 28290, 198395, 48903, 80234, 4904...

[ 0.04400634765625, 0.0810546875, 0.101806640625, 0.1676025390625, 0.1724853515625, 0.1815185546875, 0.1414794921875, 0.1639404296875, 0.07574462890625, 0.055908203125, 0.060028076171875, 0.08148193359375, 0.1500244140625, 0.1488037109375, 0.045867919921875, 0.1558837890625, 0.18347167...

embed

74732049_c0

74732049

haskell

0

Title: haskell sorting list of custom datatypes based on common atributes without usingf modules Problem title: haskell sorting list of custom datatypes based on common atributes without usingf modules Tags: sorting, pattern-matching, haskell, custom-data-attribute, algebraic-data-types Problem: haskell sorting list of...

haskell sorting list of custom datatypes based on common atributes without usingf modules haskell sorting list of custom datatypes based on common atributes without usingf modules sorting pattern-matching haskell custom-data-attribute algebraic-data-types Cuidado Comprar Medicar x:xs med7 med4 haskell sorting list of c...

[ -0.003875732421875, 0.00714111328125, 0.00787353515625, -0.002777099609375, 0.00799560546875, 0.004608154296875, -0.0162353515625, 0.0081787109375, 0.015869140625, 0.003753662109375, 0.00186920166015625, -0.0078125, 0.015625, -0.01373291015625, -0.00946044921875, -0.0177001953125, 0....

[ 1556, 142508, 12096, 214, 5303, 114122, 2053, 50986, 35509, 39210, 146256, 90, 15490, 17368, 420, 88996, 103510, 98753, 10135, 257, 191145, 429, 2844, 3003, 3812, 31, 15612, 3701, 142519, 42, 1022, 425, 128, 966, 617, 31577, 12989, 12921, 1...

[ 0.1348876953125, 0.21435546875, 0.20361328125, 0.03265380859375, 0.1488037109375, 0.2015380859375, 0.0841064453125, 0.251220703125, 0.048126220703125, 0.1419677734375, 0.201904296875, 0.01318359375, 0.0845947265625, 0.0552978515625, 0.0638427734375, 0.1148681640625, 0.175048828125, ...

embed

49199011_c0

49199011

haskell

0

Title: Defining new function as a composition of functions while adding additional behaviours Problem title: Defining new function as a composition of functions while adding additional behaviours Tags: haskell, functional-programming Problem: Defining new function as a composition of functions while adding additional b...

Defining new function as a composition of functions while adding additional behaviours Defining new function as a composition of functions while adding additional behaviours haskell functional-programming Defining Defining new function as a composition of functions while adding additional behaviours I have started to s...

[ 0.006072998046875, 0.007354736328125, -0.005584716796875, 0.00994873046875, 0.0091552734375, 0.022216796875, -0.0018157958984375, 0.0072021484375, 0.0322265625, -0.01068115234375, -0.00860595703125, 0.0022430419921875, 0.0262451171875, 0.0174560546875, -0.000911712646484375, 0.00860595...

[ 88606, 3525, 32354, 237, 166577, 111, 12960, 154107, 78301, 224833, 1556, 142508, 123309, 28966, 86869, 10078, 44402, 20625, 29806, 8337, 201505, 5303, 903, 2046, 136, 18499, 28412, 29458, 1284, 15190, 6097, 13315, 18151, 3917, 4527, 10644, 132...

[ 0.193603515625, 0.14697265625, 0.230224609375, 0.0396728515625, 0.2274169921875, 0.02178955078125, 0.10888671875, 0.1182861328125, 0.1376953125, 0.1773681640625, 0.08905029296875, 0.1917724609375, 0.1143798828125, 0.052398681640625, 0.0489501953125, 0.1943359375, 0.0985107421875, 0...

embed

8110567_c0

8110567

haskell

0

Title: getting error Prelude.read: no parse Problem title: getting error Prelude.read: no parse Tags: haskell Problem: getting error Prelude.read: no parse I am very new in haskell, i wrote the code for item details and search the detail for each item. type Code = Int type Name = String type Database = (Code,Name) text...

getting error Prelude.read: no parse getting error Prelude.read: no parse haskell Prelude.read Name Database textfile::IO base.txt fun::IO Please show1 textshow::IO show1::Code getting error Prelude.read: no parse I am very new in haskell, i wrote the code for item details and search the detail for each item. code for ...

[ 0.02197265625, -0.009033203125, 0.0101318359375, 0.0252685546875, 0.0225830078125, 0.0034942626953125, 0.0040283203125, -0.010986328125, 0.007080078125, -0.00787353515625, -0.007537841796875, -0.0191650390625, 0.002471923828125, -0.0118408203125, 0.006805419921875, -0.02294921875, 0....

[ 20949, 18499, 1914, 822, 112, 39116, 110, 366, 184, 1556, 142508, 15757, 187781, 7986, 29822, 17780, 3647, 124326, 7477, 7639, 31374, 114211, 3525, 54397, 18151, 35735, 41653, 33938, 22443, 2967, 20697, 4127, 11001, 2053, 114689, 15700, 141377,...

[ 0.07232666015625, 0.216552734375, 0.11669921875, 0.1903076171875, 0.1256103515625, 0.2197265625, 0.151611328125, 0.1883544921875, 0.176513671875, 0.144287109375, 0.21533203125, 0.0877685546875, 0.139404296875, 0.05389404296875, 0.103271484375, 0.126220703125, 0.134521484375, 0.1069...

embed

60518561_c1

60518561

haskell

1

resulting values is not a pure function, but may itself fail. I'm not a Haskell programmer but from the type of eval (Div x y) it seems be that of Maybe(Maybe Int) - which can simply be squashed , no? (Something like a flatten in Scala or join in Haskell). What really is the issue here? Irrespective of whether x,y are...

[ -0.0223388671875, 0.004425048828125, 0.0220947265625, -0.0019378662109375, 0.0086669921875, 0.004730224609375, 0.017333984375, -0.0277099609375, 0.0194091796875, 0.00182342529296875, 0.0196533203125, 0.004119873046875, 0.002532958984375, 0.0067138671875, 0.008544921875, -0.024780273437...

[ 16750, 214, 142424, 83, 959, 34166, 32354, 1543, 68034, 35782, 20625, 142508, 77848, 10644, 28, 1405, 192576, 1022, 113, 37202, 83425, 82419, 372, 360, 18, 831, 42856, 232429, 297, 49878, 510, 152653, 11, 33284, 6183, 31089, 53, 9563, 64113...

[ 0.178466796875, 0.10125732421875, 0.200439453125, 0.001678466796875, 0.06072998046875, 0.15380859375, 0.1639404296875, 0.1351318359375, 0.1114501953125, 0.2164306640625, 0.08990478515625, 0.2244873046875, 0.09344482421875, 0.151123046875, 0.0113525390625, 0.2137451171875, 0.169799804...

embed

37184230_c1

37184230

haskell

1

-> case lookup n s of Nothing -> runStateT (makeNewTree n) s -- makeNewTree n s Just wt -> deRefWeak wt >>= \mt -> case mt of Nothing -> runStateT (makeNewTree n) s Just t -> return (t,s) makeNewTree :: Integer -> StateT TreeCache IO NTree makeNewTree n = StateT $ \s -> mdo wt <- mkWeak n t Nothing (ts, s') <- runStat...

[ -0.01080322265625, 0.0037994384765625, -0.00188446044921875, -0.0274658203125, 0.00860595703125, 0.0186767578125, -0.0181884765625, -0.000492095947265625, -0.0022735595703125, -0.055419921875, -0.00885009765625, 0.007171630859375, -0.0098876953125, 0.007598876953125, 0.007232666015625, ...

[ 33079, 7225, 6713, 2037, 653, 91, 111, 182747, 11675, 135206, 618, 55898, 46568, 62731, 13, 3249, 9563, 18, 8, 190015, 12137, 344, 808, 30646, 44401, 22836, 101344, 441, 46994, 17780, 107, 246, 62346, 20370, 74694, 20020, 142424, 22288, 422...

[ 0.0347900390625, 0.2060546875, 0.10198974609375, 0.13037109375, 0.066162109375, 0.02691650390625, 0.0848388671875, 0.150146484375, 0.0589599609375, 0.0772705078125, 0.1087646484375, 0.03997802734375, 0.08447265625, 0.2391357421875, 0.045623779296875, 0.06964111328125, 0.0611572265625...

embed

15302255_c0

15302255

haskell

0

Title: ByteCodeLink error with GHCi and C file Problem title: ByteCodeLink error with GHCi and C file Tags: cabal, ghci, haskell Problem: ByteCodeLink error with GHCi and C file When I run my file using a foreign import for a C function I made, I get this error. ByteCodeLink: can't find label During interactive linking...

ByteCodeLink error with GHCi and C file ByteCodeLink error with GHCi and C file cabal ghci haskell the ByteCodeLink GHCi During DLLs Restart Alternatively haskell.org ByteCodeLink error with GHCi and C file When I run my file using a foreign import for a C function I made, I get this error. After creating a .cabal file...

[ 0.02880859375, -0.00689697265625, 0.004913330078125, 0.01068115234375, -0.002288818359375, 0.01544189453125, 0.00689697265625, 0.0250244140625, -0.005218505859375, -0.04248046875, -0.01239013671875, -0.052734375, -0.0181884765625, 0.0015716552734375, 0.002593994140625, -0.01171875, 0...

[ 3311, 67, 114211, 64287, 18499, 678, 527, 73265, 14, 136, 313, 11435, 109524, 31380, 318, 1556, 142508, 133698, 391, 23708, 853, 17137, 1478, 11675, 17368, 110613, 24927, 32354, 7228, 903, 105233, 408, 3571, 72367, 7464, 2046, 25647 ]

[ 0.10546875, 0.1455078125, 0.2132568359375, 0.2315673828125, 0.19384765625, 0.094970703125, 0.1064453125, 0.152587890625, 0.2010498046875, 0.06439208984375, 0.143310546875, 0.15380859375, 0.233642578125, 0.1094970703125, 0.1337890625, 0.1295166015625, 0.2352294921875, 0.052185058593...

embed

15343806_c0

15343806

haskell

0

Title: Can't use list of typeclasses inside data declaration Problem title: Can't use list of typeclasses inside data declaration Tags: haskell, typeclass Problem: Can't use list of typeclasses inside data declaration I'm new to Haskell and I like the programming approach of it a lot! I've been running into t...

Can't use list of typeclasses inside data declaration Can't use list of typeclasses inside data declaration haskell typeclass Can Part Event NoteEvent DecrescendoEvent VolumeEvent KeyEvent Can't use list of typeclasses inside data declaration I'm new to Haskell and I like the programming approach of it a lot!...

[ 0.00145721435546875, 0.00958251953125, 0.009765625, -0.0019378662109375, -0.01214599609375, 0.00008821487426757812, -0.00139617919921875, 0.00177001953125, 0.0029296875, -0.040283203125, -0.009765625, -0.026123046875, -0.00007581710815429688, 0.0164794921875, -0.027587890625, -0.013610...

[ 4171, 3768, 4527, 5303, 10644, 67413, 90, 46132, 2053, 21635, 18, 1556, 142508, 16995, 36943, 18622, 192134, 262, 124165, 4017, 98872, 26824, 3525, 20625, 1884, 56037, 51515, 2967, 116, 128120, 4488, 55681, 31425, 18151, 86673, 100, 19612, 38...

[ 0.043609619140625, 0.0728759765625, 0.1256103515625, 0.1640625, 0.2291259765625, 0.25830078125, 0.031585693359375, 0.133544921875, 0.155029296875, 0.189453125, 0.0298004150390625, 0.117919921875, 0.2022705078125, 0.130126953125, 0.20849609375, 0.182373046875, 0.2127685546875, 0.134...

embed

37770984_c1

37770984

haskell

1

questions here: First, the pragmatic one. How to solve the problem at hand, without getting into the Reader monad, which might involve changing a lot of function signatures across my app. Second, the one oriented to learning. Haskell has immutable values , which is understood and appreciated. Does it even have immutab...

[ 0.01806640625, 0.0034332275390625, 0.002044677734375, -0.0205078125, 0.018310546875, 0.00150299072265625, 0.0211181640625, -0.0150146484375, 0.000751495361328125, -0.0289306640625, -0.00457763671875, -0.0181884765625, -0.001983642578125, -0.01202392578125, 0.01068115234375, 0.000999450...

[ 17582, 3688, 147118, 1771, 1632, 11249, 47, 86869, 2967, 3535, 15490, 122636, 2667, 712, 13648, 151134, 5915, 32354, 138256, 36880, 759, 4027, 77648, 23509, 297, 52080, 20625, 142508, 1556, 566, 561, 22819, 142424, 217064, 77947, 3853, 765, 7...

[ 0.1083984375, 0.041839599609375, 0.1497802734375, 0.03302001953125, 0.014373779296875, 0.037811279296875, 0.0345458984375, 0.1661376953125, 0.1451416015625, 0.06414794921875, 0.1075439453125, 0.269287109375, 0.07855224609375, 0.0799560546875, 0.02398681640625, 0.09442138671875, 0.036...

embed

5367167_c0

5367167

haskell

0

Title: Haskell record syntax Problem title: Haskell record syntax Tags: syntactic-sugar, syntax, layout, haskell Problem: Haskell record syntax Haskell's record syntax is considered by many to be a wart on an otherwise elegant language, on account of its ugly syntax and namespace pollution. On the other hand it's often...

Haskell record syntax Haskell record syntax syntactic-sugar syntax layout haskell Haskell Foo Show Haskell record syntax Haskell's record syntax is considered by many to be a wart on an otherwise elegant language, on account of its ugly syntax and namespace pollution. On the other hand it's often more useful than the p...

[ 0.020751953125, 0.0201416015625, 0.0038299560546875, 0.0186767578125, 0.0033416748046875, 0.00604248046875, -0.0155029296875, 0.007232666015625, 0.001373291015625, -0.00836181640625, -0.0030670166015625, 0.00159454345703125, -0.01220703125, -0.007049560546875, 0.00238037109375, -0.0285...

[ 20625, 142508, 17164, 6002, 86531, 102, 49086, 1159, 1970, 108802, 1556, 9572, 31, 17367, 90698, 5941, 186, 10, 1631, 18, 98, 120262, 27650, 46876, 15426, 75, 110608, 136, 210716, 210115, 27983, 1286, 80234, 19069, 35509, 30700, 175399, 21635...

[ 0.1517333984375, 0.2666015625, 0.23974609375, 0.1697998046875, 0.201904296875, 0.119140625, 0.041351318359375, 0.1148681640625, 0.154541015625, 0.1871337890625, 0.1214599609375, 0.1876220703125, 0.15576171875, 0.16552734375, 0.0799560546875, 0.038116455078125, 0.04931640625, 0.0329...

embed

47042731_c0

47042731

haskell

0

Title: Eta reduction in haskell Problem title: Eta reduction in haskell Tags: haskell, reduction Problem: Eta reduction in haskell I tried for a long time to reduct this function in haskell, I want to express for example: mySum x y = x + y mySum x y = (+) x y mySum x = (+) x mySum = (+) -- it's Messi's goal! My functio...

Eta reduction in haskell Eta reduction in haskell haskell reduction Eta Messi Eta reduction in haskell I tried for a long time to reduct this function in haskell, I want to express for example: My function it a little more complex, but I really can't do it, I was looking out here and there, and I know there are some te...

[ -0.00482177734375, -0.004241943359375, 0.0111083984375, 0.0262451171875, -0.00035858154296875, 0.00732421875, -0.013427734375, 0.0032806396484375, -0.01324462890625, -0.026123046875, 0.002471923828125, 0.00518798828125, -0.00164794921875, 0.00567626953125, -0.001861572265625, -0.011108...

[ 25623, 456, 77391, 23, 1556, 142508, 33024, 37842, 4989, 1733, 74906, 18, 903, 32354, 3444, 36510, 27781, 10176, 1286, 27140, 6183, 831, 54, 442, 16487, 1810, 3714, 3060, 53088, 2811, 40383, 7108, 5609, 4527, 147505, 4163, 179933, 3688, 504...

[ 0.2978515625, 0.188720703125, 0.1829833984375, 0.055511474609375, 0.1497802734375, 0.2371826171875, 0.283447265625, 0.08453369140625, 0.06390380859375, 0.044525146484375, 0.1856689453125, 0.17041015625, 0.060272216796875, 0.17431640625, 0.0247039794921875, 0.1181640625, 0.07666015625...

embed

58755712_c0

58755712

haskell

0

Title: using list comprehension how do i calculate how many digits there are in a list of characters Problem title: using list comprehension how do i calculate how many digits there are in a list of characters Tags: haskell Problem: using list comprehension how do i calculate how many digits there are in a list of char...

using list comprehension how do i calculate how many digits there are in a list of characters using list comprehension how do i calculate how many digits there are in a list of characters haskell list Char x:xs using list comprehension how do i calculate how many digits there are in a list of characters I need to calcu...

[ -0.00421142578125, 0.0031280517578125, 0.003509521484375, 0.0101318359375, 0.00156402587890625, 0.01116943359375, 0.0072021484375, 0.027099609375, 0.0264892578125, -0.01171875, -0.01312255859375, -0.035888671875, 0.0206298828125, 0.0228271484375, -0.026123046875, -0.01544189453125, 0...

[ 17368, 5303, 46683, 3220, 6889, 3642, 17, 74481, 67, 5941, 153939, 7, 2685, 621, 23, 124850, 1556, 142508, 21656, 1022, 12, 425, 14012, 108975, 20625, 195625, 1830, 237875, 4527, 418, 363, 617, 11, 71, 420, 35166, 190, 77546, 12989, 32354...

[ 0.09375, 0.2000732421875, 0.154296875, 0.1614990234375, 0.06268310546875, 0.07275390625, 0.038665771484375, 0.173828125, 0.0697021484375, 0.1273193359375, 0.2232666015625, 0.1005859375, 0.0914306640625, 0.0732421875, 0.0633544921875, 0.1971435546875, 0.13525390625, 0.2296142578125,...

embed

39087731_c0

39087731

haskell

0

Title: CPP within Haddock Problem title: CPP within Haddock Tags: haskell, haddock, c-preprocessor Problem: CPP within Haddock I can change haddocks based on a flag if I put the entire block within the CPP conditional branches: #if SOME_MACRO -- | Whether SOME_MACRO is true -- >>> someMacro -- True someMacro :: Bool so...

CPP within Haddock CPP within Haddock haskell haddock c-preprocessor CPP Haddock SOME_MACRO Whether Bool CPP within Haddock I can change haddocks based on a flag if I put the entire block within the CPP conditional branches: And the documentation looks as you'd expect it to, and doctest also works as expected. But that...

[ 0.00015735626220703125, 0.00506591796875, 0.000640869140625, 0.00726318359375, -0.000865936279296875, 0.0341796875, 0.032470703125, -0.007049560546875, -0.004791259765625, 0.015625, -0.0166015625, -0.0032196044921875, -0.007568359375, 0.0016937255859375, 0.006134033203125, 0.0004673004...

[ 313, 17487, 28032, 28129, 138414, 1556, 142508, 1902, 501, 4692, 63923, 91245, 14255, 156458, 2460, 929, 831, 15549, 7, 35509, 49938, 3884, 64194, 46389, 35431, 289, 90356, 209806, 33342, 41206, 51584, 6954, 43240, 84751, 121097, 17431, 45296, ...

[ 0.1104736328125, 0.31005859375, 0.153076171875, 0.1947021484375, 0.265625, 0.0830078125, 0.1846923828125, 0.1524658203125, 0.00390625, 0.1014404296875, 0.09051513671875, 0.008697509765625, 0.048431396484375, 0.0303497314453125, 0.099853515625, 0.18603515625, 0.003082275390625, 0.19...

embed

40899314_c0

40899314

haskell

0

Title: Accepting input using Haskell Problem title: Accepting input using Haskell Tags: input, haskell Problem: Accepting input using Haskell I have to read input as: 1 <- number of lines next 10 20 30 2 <- number of lines next 5 5 5 6 8 9 0 <- terminating condition The output should be: output of f[(10,20,30)] output ...

Accepting input using Haskell Accepting input using Haskell input haskell Haskell Accepting Case n:m:o:rest Accepting input using Haskell I have to read input as: The output should be: I also need to print the case number: eg. The function which produces the output has type: f :: [(Int,Int,Int)] -> Int I am using it as...

[ -0.0074462890625, 0.00640869140625, -0.01483154296875, 0.000827789306640625, -0.003997802734375, 0.017822265625, 0.00021266937255859375, -0.007232666015625, 0.005950927734375, -0.018310546875, 0.0166015625, -0.0159912109375, 0.004425048828125, -0.0030975341796875, 0.0064697265625, -0.0...

[ 111383, 107730, 17368, 20625, 142508, 214, 1556, 43731, 653, 39, 31, 56644, 87, 765, 12301, 237, 140992, 5608, 186, 3871, 28412, 70, 7225, 14012, 32354, 27489, 7, 10644, 1238, 1984, 4153, 18, 33079, 360, 109312, 7103, 1632, 3034, 1284, 13...

[ 0.1884765625, 0.21875, 0.0787353515625, 0.155517578125, 0.24658203125, 0.0159912109375, 0.1435546875, 0.1593017578125, 0.022216796875, 0.0242767333984375, 0.10162353515625, 0.16748046875, 0.00018310546875, 0.043670654296875, 0.1781005859375, 0.1033935546875, 0.198974609375, 0.06237...

embed

43904910_c1

43904910

haskell

1

I don't compile with -threaded. I tried increasing the number of fractions to 2000000 main = print $ parAddFracs $ toReciprocal $ intList 2000000 and compiling with -threaded, +RTS -N1 runs in ~17.8 seconds and +RTS -N4 runs in ~15.6 seconds. When running with +RTS -N4 I see the cpu usage is between ~120% and ~350%, b...

[ -0.021484375, 0.007293701171875, -0.0042724609375, 0.0005950927734375, -0.003631591796875, 0.004119873046875, -0.01177978515625, -0.001739501953125, -0.010986328125, -0.006988525390625, -0.004150390625, 0.008544921875, 0.009033203125, 0.004547119140625, -0.006134033203125, -0.004638671...

[ 87, 2301, 18, 9969, 1340, 678, 20, 927, 39116, 297, 37842, 118055, 14012, 175921, 116, 197094, 5201, 28412, 366, 4028, 108386, 4439, 47, 318, 3454, 23, 154663, 49725, 997, 20503, 294, 839, 418, 127877, 176391, 94131, 617, 124525, 51042, 1...

[ 0.009796142578125, 0.0455322265625, 0.0858154296875, 0.1954345703125, 0.1778564453125, 0.08544921875, 0.010040283203125, 0.0290985107421875, 0.1978759765625, 0.13134765625, 0.0263519287109375, 0.1033935546875, 0.0218353271484375, 0.2132568359375, 0.030364990234375, 0.1343994140625, 0...

embed

79297359_c0

79297359

haskell

0

Title: How to exclude field record wildcard imports from ghc -Wmissing-import-lists? Problem title: How to exclude field record wildcard imports from ghc -Wmissing-import-lists? Tags: haskell, ghc Problem: How to exclude field record wildcard imports from ghc -Wmissing-import-lists? I'd like to get the behavior of -Xmi...

How to exclude field record wildcard imports from ghc -Wmissing-import-lists? How to exclude field record wildcard imports from ghc -Wmissing-import-lists? haskell ghc ghc Prelude How Wmissing-import-lists Xmissing-import-lists XNoImplicitPrelude Bool NoFieldSelectors OverloadedRecordDot How to exclude field record wil...

[ -0.00015735626220703125, -0.01416015625, -0.00921630859375, 0.01214599609375, -0.01483154296875, 0.01202392578125, 0.01446533203125, 0.0086669921875, 0.00543212890625, 0.01385498046875, 0.00341796875, -0.0029754638671875, 0.00640869140625, -0.0003604888916015625, -0.00244140625, -0.023...

[ 11249, 47, 39041, 112, 44457, 17164, 56409, 38931, 24927, 7, 1295, 31380, 238, 1456, 45188, 214, 60270, 6562, 1556, 142508, 1914, 822, 601, 1193, 5021, 128878, 60923, 19273, 2460, 929, 438, 6159, 19388, 4233, 187075, 9578, 63033, 297, 32271...

[ 0.06756591796875, 0.00732421875, 0.192626953125, 0.07611083984375, 0.1904296875, 0.1964111328125, 0.1474609375, 0.206298828125, 0.2425537109375, 0.06524658203125, 0.044830322265625, 0.087890625, 0.12060546875, 0.05670166015625, 0.158203125, 0.089111328125, 0.218505859375, 0.1717529...

embed

30305439_c0

30305439

haskell

0

Title: Can I save regex state for next input? Problem title: Can I save regex state for next input? Tags: regex, finite-automata, haskell Problem: Can I save regex state for next input? I parse TCP packets with some data and this data can divided in several packets. I can't save packets, so after passing first packet I...

Can I save regex state for next input? Can I save regex state for next input? regex finite-automata haskell Text.Regex.TDFA System.Environment Can Seq.hs inpStr1 Bool inpStr2 Can I save regex state for next input? I parse TCP packets with some data and this data can divided in several packets. I can't save packets, so ...

[ -0.000804901123046875, 0.0108642578125, -0.00811767578125, 0.04736328125, -0.000728607177734375, 0.0162353515625, 0.01483154296875, 0.0242919921875, 0.00628662109375, -0.0177001953125, 0.007080078125, 0.022705078125, 0.01361083984375, 0.015869140625, -0.00189208984375, 0.0078125, 0.0...

[ 4171, 30098, 6835, 3355, 11341, 100, 11737, 107730, 87, 94418, 52344, 11, 1556, 142508, 24129, 54601, 14676, 12353, 686, 1900, 503, 864, 127, 7, 23, 254, 71713, 418, 2460, 929, 304, 366, 184, 17854, 43824, 7831, 2053, 101637, 40368, 831, ...

[ 0.07415771484375, 0.2039794921875, 0.161865234375, 0.21875, 0.177001953125, 0.09033203125, 0.126708984375, 0.1605224609375, 0.0238494873046875, 0.0914306640625, 0.1160888671875, 0.052978515625, 0.0701904296875, 0.205810546875, 0.06561279296875, 0.079833984375, 0.1156005859375, 0.05...

embed

59595690_c0

59595690

haskell

0

Title: How do the requirements for the instances of the Applicative type class relate to their implementations for Functor Problem title: How do the requirements for the instances of the Applicative type class relate to their implementations for Functor Tags: typeclass, haskell, functor, applicative Problem: How do the...

How do the requirements for the instances of the Applicative type class relate to their implementations for Functor How do the requirements for the instances of the Applicative type class relate to their implementations for Functor typeclass haskell functor applicative How Applicative Functor How do the requirements fo...

[ 0.01043701171875, 0.00433349609375, 0.015380859375, 0.0234375, -0.00732421875, 0.0224609375, -0.00124359130859375, -0.01116943359375, 0.0255126953125, 0.0194091796875, -0.00592041015625, -0.025146484375, -0.005889892578125, 0.018798828125, -0.005828857421875, -0.01513671875, 0.017089...

[ 11249, 96679, 110527, 5659, 11048, 4935, 10644, 18507, 33444, 208124, 28670, 18770, 7, 67413, 1556, 142508, 7477, 41816, 100, 20625, 35773, 209806, 11907, 8110, 40407, 22759, 91736, 182324, 34166, 3447, 81, 166577, 75, 148, 12840, 178851, 8780,...

[ 0.0880126953125, 0.2186279296875, 0.2261962890625, 0.1822509765625, 0.21240234375, 0.1890869140625, 0.1890869140625, 0.2227783203125, 0.109130859375, 0.172607421875, 0.17919921875, 0.170654296875, 0.007720947265625, 0.123291015625, 0.12109375, 0.2359619140625, 0.0921630859375, 0.16...

embed

5354431_c0

5354431

haskell

0

Title: How to get the type as a String in Haskell? Problem title: How to get the type as a String in Haskell? Tags: introspection, haskell, reflection Problem: How to get the type as a String in Haskell? Let's say I have a type MyType defined in module My.Module. I want to have the String "My.Module.MyType" (or somethi...

How to get the type as a String in Haskell? How to get the type as a String in Haskell? introspection haskell reflection How Haskell My.Module MyType MyType2 MyConstructor2 My.Module.MyType My.Module.MyType2 How to get the type as a String in Haskell? Let's say I have a type MyType defined in module My.Module. I want t...

[ -0.004669189453125, -0.0005340576171875, -0.0032501220703125, 0.0341796875, -0.00396728515625, 0.01904296875, 0.00109100341796875, 0.0068359375, -0.003143310546875, -0.0267333984375, 0.007110595703125, -0.013671875, -0.004486083984375, 0.0030517578125, -0.0034637451171875, 0.0053405761...

[ 11249, 47, 2046, 70, 10644, 237, 10, 23351, 214, 23, 20625, 142508, 64627, 16711, 1556, 44961, 2646, 91616, 196707, 304, 36716, 8782, 31852, 61924, 88996, 3444, 105237, 13648, 11417, 31, 9351, 65572, 3714, 9969, 169463, 140992, 16487, 100, ...

[ 0.0506591796875, 0.012451171875, 0.1214599609375, 0.0609130859375, 0.28564453125, 0.16552734375, 0.1141357421875, 0.19580078125, 0.140869140625, 0.09283447265625, 0.1339111328125, 0.23046875, 0.0487060546875, 0.0780029296875, 0.1019287109375, 0.1260986328125, 0.1220703125, 0.062133...

embed

69439965_c0

69439965

haskell

0

Title: Map then filter in Haskell Problem title: Map then filter in Haskell Tags: higher-order-functions, functional-programming, map-function, haskell, filtering Problem: Map then filter in Haskell I want to Map an Integer type list in Haskell, and then if the map function returns Nothing I want to discard the result....

Map then filter in Haskell Map then filter in Haskell higher-order-functions functional-programming map-function haskell filtering Map Haskell Integer Maybe Just Nothing Map then filter in Haskell I want to Map an Integer type list in Haskell, and then if the map function returns Nothing I want to discard the result. T...

[ -0.00970458984375, -0.004425048828125, -0.006256103515625, -0.01397705078125, 0.002777099609375, 0.01904296875, -0.004486083984375, -0.004974365234375, 0.006805419921875, 0.000774383544921875, -0.0201416015625, -0.01434326171875, -0.01324462890625, 0.0159912109375, 0.002838134765625, -...

[ 42719, 7068, 46312, 23, 20625, 142508, 77546, 80596, 137175, 123309, 28966, 22288, 1556, 44401, 83425, 9563, 182747, 3444, 47, 10644, 5303, 2174, 32354, 30646, 17116, 5861, 16750, 31577, 33022, 138256, 17569, 214552, 3525, 115992, 44691, 18822, ...

[ 0.239501953125, 0.2156982421875, 0.261474609375, 0.0203704833984375, 0.13623046875, 0.231689453125, 0.037872314453125, 0.1258544921875, 0.148681640625, 0.1142578125, 0.0740966796875, 0.2236328125, 0.1138916015625, 0.1949462890625, 0.1038818359375, 0.045623779296875, 0.1728515625, 0...

embed

70067203_c0

70067203

haskell

0

Title: Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) Problem title: Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) Tags: fold, string, list, haskell Problem: Create a function that takes a string (so...

Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) Create a function that takes a string (some sentence) and split it into list of tuples (word, length word) fold string list haskell Create Asdf c:c1 Create a function that takes a string (some sentence) and split ...

[ -0.007110595703125, -0.00933837890625, -0.027099609375, 0.0201416015625, -0.02392578125, 0.003662109375, 0.008056640625, 0.004669189453125, 0.020751953125, -0.0120849609375, 0.004119873046875, 0.003936767578125, -0.00787353515625, 0.0042724609375, 0.00341796875, 0.009765625, -0.00384...

[ 151313, 32354, 450, 51776, 79315, 149357, 16, 136, 65450, 3934, 5303, 370, 99726, 47416, 140909, 2565, 43452, 42822, 1556, 142508, 1301, 71, 420, 501, 12, 238, 418, 111, 208124, 33342, 1884, 18499, 831, 959, 26366, 1810, 103510, 132283 ]

[ 0.147705078125, 0.2142333984375, 0.0411376953125, 0.1199951171875, 0.216552734375, 0.1895751953125, 0.019073486328125, 0.0443115234375, 0.1961669921875, 0.0965576171875, 0.1737060546875, 0.1248779296875, 0.2257080078125, 0.1204833984375, 0.1138916015625, 0.11962890625, 0.017471313476...

embed

10913063_c1

10913063

haskell

1

receive socket [] putStrLn $ unwords ["Received response : ",unpack reply])) serverMain :: IO () serverMain = withContext 1 (\context-> do putStrLn "Listening at 5554" withSocket context Rep $ (\socket-> do connect socket "tcp://127.0.0.1:5554" forever $ do message<-receive socket [] -- this throws an IO Exception putS...

[ 0.01025390625, 0.01336669921875, -0.00836181640625, 0.03271484375, 0.00860595703125, 0.01202392578125, 0.001617431640625, -0.007720947265625, 0.0030059814453125, -0.03369140625, 0.0137939453125, -0.0126953125, 0.03515625, 0.00201416015625, -0.01312255859375, 0.01019287109375, 0.01708...

[ 53299, 221, 27853, 3884, 71713, 866, 3650, 51, 47416, 329, 14, 4126, 57553, 309, 29102, 75836, 10723, 168793, 17780, 678, 22829, 154663, 214, 99, 190, 163670, 8912, 43701, 33742, 991, 37067, 121422, 1530, 129884, 28565, 12338, 136993, 26008, ...

[ 0.19970703125, 0.1080322265625, 0.188232421875, 0.125732421875, 0.10791015625, 0.04095458984375, 0.053802490234375, 0.07427978515625, 0.1842041015625, 0.11962890625, 0.025390625, 0.05853271484375, 0.1162109375, 0.052520751953125, 0.1898193359375, 0.1051025390625, 0.16162109375, 0.1...

embed

17525149_c0

17525149

haskell

0

Title: Create List of Strings in Haskell Problem title: Create List of Strings in Haskell Tags: haskell Problem: Create List of Strings in Haskell I am making the pilgrimage from Java to Haskell. Broadly speaking, I get the main concepts behind Haskell. Reading all the tutorials and books 'makes sense' but I am getting...

Create List of Strings in Haskell Create List of Strings in Haskell haskell Create List Strings Haskell Create List of Strings in Haskell I am making the pilgrimage from Java to Haskell. Broadly speaking, I get the main concepts behind Haskell. Reading all the tutorials and books 'makes sense' but I am getting stuck wr...

[ 0.01202392578125, 0.00799560546875, -0.0133056640625, 0.00982666015625, -0.0086669921875, 0.02392578125, -0.0093994140625, -0.00457763671875, -0.004486083984375, 0.0223388671875, 0.0050048828125, -0.033203125, 0.0145263671875, 0.01495361328125, -0.00830078125, 0.01043701171875, 0.009...

[ 151313, 32036, 111, 23351, 5180, 20625, 142508, 23, 1556, 37926, 1295, 41925, 47, 23755, 50155, 57143, 42840, 10422, 179933, 32562, 10002, 18151, 206597, 3444, 28282, 4382, 102158, 11435, 5426, 123055, 1176, 29822, 115187, 124326, 14105, 70541, ...

[ 0.1190185546875, 0.227294921875, 0.06134033203125, 0.2269287109375, 0.1806640625, 0.145751953125, 0.219482421875, 0.05743408203125, 0.1336669921875, 0.02349853515625, 0.0264739990234375, 0.1080322265625, 0.023468017578125, 0.0435791015625, 0.029022216796875, 0.0550537109375, 0.004516...

embed

2437103_c0

2437103

haskell

0

Title: Invoke Haskell function with heterogeneous arguments? Problem title: Invoke Haskell function with heterogeneous arguments? Tags: haskell, types, xml Problem: Invoke Haskell function with heterogeneous arguments? I'm currently working on a Haskell project which automatically tests some functions based on an XML s...

Invoke Haskell function with heterogeneous arguments? Invoke Haskell function with heterogeneous arguments? haskell types xml Invoke Haskell Invoke Haskell function with heterogeneous arguments? I'm currently working on a Haskell project which automatically tests some functions based on an XML specification. The XML sp...

[ 0.005706787109375, -0.0025634765625, -0.002838134765625, -0.00250244140625, 0.00738525390625, 0.0052490234375, -0.012451171875, -0.00537109375, -0.0150146484375, -0.009521484375, -0.00170135498046875, -0.04931640625, -0.005035400390625, 0.00238037109375, -0.0016937255859375, -0.0076293...

[ 360, 23253, 20625, 142508, 32354, 678, 77099, 15292, 10821, 10750, 7, 13, 1556, 52895, 131492, 20697, 13452, 191082, 109921, 35509, 92537, 29458, 76199, 12638, 84751, 16750, 22691, 5941, 12921, 125663, 1295, 366, 12301, 23, 17368, 2046, 1810, ...

[ 0.0474853515625, 0.166259765625, 0.1473388671875, 0.261474609375, 0.1973876953125, 0.05621337890625, 0.2266845703125, 0.1904296875, 0.05084228515625, 0.2353515625, 0.0411376953125, 0.0189208984375, 0.11865234375, 0.1552734375, 0.18115234375, 0.029022216796875, 0.00927734375, 0.1217...

embed

39819495_c0

39819495

haskell

0

Title: How to use Monad.Writer for tracing? Problem title: How to use Monad.Writer for tracing? Tags: monads, haskell, trace Problem: How to use Monad.Writer for tracing? My code looks like this: I would like to use tell inside the tokenize function in order to write to the same Writer Monad. Is this possible ? tokeniz...

How to use Monad.Writer for tracing? How to use Monad.Writer for tracing? monads haskell trace How Monad.Writer T.Text Token T.null T.snoc T.head T.tail W.Writer W.tell W.runWriter forM_ How to use Monad.Writer for tracing? My code looks like this: I would like to use tell inside the tokenize function in order to write...

[ -0.02197265625, 0.0179443359375, -0.00970458984375, 0.0098876953125, -0.0018463134765625, -0.0189208984375, -0.00543212890625, -0.0091552734375, -0.00885009765625, -0.0302734375, -0.00408935546875, 0.02490234375, 0.003631591796875, -0.0164794921875, 0.009033203125, -0.00677490234375, ...

[ 11249, 47, 4527, 60331, 71, 1456, 2783, 56, 100, 1152, 21896, 5, 2667, 712, 7, 1556, 142508, 144851, 384, 174379, 717, 1098, 139550, 54387, 31251, 46741, 601, 67, 1181, 16428, 18151, 33342, 2806, 1884, 14192, 46132, 20650, 32354, 33022, 5...

[ 0.07379150390625, 0.087890625, 0.1025390625, 0.17529296875, 0.1737060546875, 0.1043701171875, 0.2119140625, 0.1868896484375, 0.047882080078125, 0.19384765625, 0.1600341796875, 0.017974853515625, 0.08917236328125, 0.1510009765625, 0.02447509765625, 0.0958251953125, 0.1900634765625, ...

embed

26724889_c0

26724889

haskell

0

Title: Replace only the head of the list in haskell? Problem title: Replace only the head of the list in haskell? Tags: haskell Problem: Replace only the head of the list in haskell? I have a list like: [[0,0,0,1,0],[1,0,0,1,0],[0,0,1,1,0],[0,0,0,0,0],[1,0,0,0,1]] and I want to replace the head of this list, which is [...

Replace only the head of the list in haskell? Replace only the head of the list in haskell? haskell Replace RandomGen Float Nothing Just i-1 Replace only the head of the list in haskell? I have a list like: [[0,0,0,1,0],[1,0,0,1,0],[0,0,1,1,0],[0,0,0,0,0],[1,0,0,0,1]] and I want to replace the head of this list, which ...

[ -0.02001953125, 0.007293701171875, 0.00537109375, -0.00009441375732421875, 0.003570556640625, 0.0026092529296875, 0.000782012939453125, -0.00927734375, 0.01611328125, -0.01373291015625, 0.022216796875, 0.017333984375, 0.002899169921875, -0.001708984375, 0.0048828125, -0.000968933105468...

[ 853, 23935, 4734, 10336, 111, 5303, 23, 1556, 142508, 32, 39643, 306, 105376, 38699, 257, 182747, 9563, 17, 5759, 70, 765, 1884, 2389, 63527, 206808, 76172, 3444, 47, 91995, 903, 6, 678, 304, 133063, 2046, 110558, 5, 831, 32354, 30646 ]

[ 0.0751953125, 0.1929931640625, 0.136962890625, 0.22412109375, 0.1129150390625, 0.2125244140625, 0.094970703125, 0.186767578125, 0.270263671875, 0.0226593017578125, 0.1390380859375, 0.07415771484375, 0.1829833984375, 0.1480712890625, 0.052581787109375, 0.13134765625, 0.048828125, 0....

embed

44744884_c0

44744884

haskell

0

Title: What does deriving do/mean in Haskell? Problem title: What does deriving do/mean in Haskell? Tags: deriving, functional-programming, haskell Problem: What does deriving do/mean in Haskell? The definition of deriving on stack overflow is: "In Haskell, a derived instance is an instance declaration that is generate...

What does deriving do/mean in Haskell? What does deriving do/mean in Haskell? deriving functional-programming haskell What Haskell BaseballPlayer Pitcher Catcher Infielder Outfielder Show Bool What does deriving do/mean in Haskell? The definition of deriving on stack overflow is: I don't really understand any of it to ...

[ 0.0341796875, 0.0040283203125, 0.0037078857421875, 0.016357421875, 0.0157470703125, 0.0194091796875, 0.00537109375, 0.0106201171875, 0.007354736328125, -0.0174560546875, -0.002349853515625, -0.01531982421875, 0.01104736328125, -0.0002155303955078125, -0.0296630859375, -0.0096435546875,...

[ 4865, 14602, 16406, 6496, 54, 282, 66, 23, 20625, 142508, 123309, 28966, 1556, 44978, 12126, 142581, 45533, 5372, 18826, 28394, 56, 13538, 17367, 2460, 929, 64, 80934, 111, 98, 177261, 645, 118664, 83, 28219, 2499, 442, 42551, 18151, 2367, ...

[ 0.0855712890625, 0.0703125, 0.2119140625, 0.260009765625, 0.10162353515625, 0.1031494140625, 0.134765625, 0.052154541015625, 0.12255859375, 0.25048828125, 0.133544921875, 0.0965576171875, 0.115966796875, 0.06805419921875, 0.062042236328125, 0.13720703125, 0.06085205078125, 0.068786...

embed

67855059_c0

67855059

haskell

0

Title: Breaking a list on a given value into a list of sublists Problem title: Breaking a list on a given value into a list of sublists Tags: sublist, recursion, list, haskell Problem: Breaking a list on a given value into a list of sublists The multipleLists function needs to remove a given value from a list and retur...

Breaking a list on a given value into a list of sublists Breaking a list on a given value into a list of sublists sublist recursion list haskell Breaking x:xs Breaking a list on a given value into a list of sublists The multipleLists function needs to remove a given value from a list and return a list of lists. These s...

[ -0.0177001953125, 0.00051116943359375, -0.002349853515625, 0.00106048583984375, -0.025634765625, 0.0113525390625, 0.003326416015625, -0.00482177734375, 0.02392578125, 0.0037994384765625, 0.0002384185791015625, 0.01324462890625, 0.01422119140625, 0.01214599609375, 0.005706787109375, 0.0...

[ 91365, 5303, 98, 34475, 34292, 3934, 111, 1614, 6562, 195625, 1830, 1556, 142508, 1022, 12, 425, 48716, 154663, 7, 32354, 27117, 47, 87388, 1295, 136, 30646, 21115, 12638, 12830, 24189, 5962, 184750, 96276, 3525, 4034, 5351, 44691, 70, 1202...

[ 0.2054443359375, 0.2135009765625, 0.070068359375, 0.0599365234375, 0.138671875, 0.09716796875, 0.0341796875, 0.2025146484375, 0.238037109375, 0.11474609375, 0.01458740234375, 0.078369140625, 0.1661376953125, 0.06378173828125, 0.0263214111328125, 0.07391357421875, 0.2398681640625, 0...

embed

69960701_c0

69960701

haskell

0

Title: Pascal Triangle Find position x, y with Haskell function Problem title: Pascal Triangle Find position x, y with Haskell function Tags: pascals-triangle, haskell Problem: Pascal Triangle Find position x, y with Haskell function I want to get 2 integers from an input like pascal 2 1. This input should be 2, becaus...

Pascal Triangle Find position x, y with Haskell function Pascal Triangle Find position x, y with Haskell function pascals-triangle haskell Pascal Triangle Find Haskell Invalid row-1 pos-1 Unexpected You BlockArguments Pascal Triangle Find position x, y with Haskell function I want to get 2 integers from an input like p...

[ -0.01373291015625, 0.0115966796875, 0.0201416015625, -0.00347900390625, 0.017333984375, 0.005859375, 0.009765625, -0.00457763671875, 0.0035858154296875, 0.01092529296875, 0.01336669921875, -0.0201416015625, -0.00616455078125, 0.005584716796875, -0.0269775390625, 0.0064697265625, -0.0...

[ 167599, 4699, 109217, 26040, 19069, 1022, 4, 113, 678, 20625, 142508, 32354, 452, 6827, 7, 3996, 1556, 7013, 15555, 5759, 3864, 992, 83613, 13, 2583, 80231, 7614, 1234, 3444, 2046, 116, 892, 26255, 1295, 107730, 1884, 615, 5608, 70, 5303,...

[ 0.210205078125, 0.1676025390625, 0.1712646484375, 0.1124267578125, 0.2235107421875, 0.1104736328125, 0.05108642578125, 0.16259765625, 0.0950927734375, 0.1356201171875, 0.2481689453125, 0.1256103515625, 0.0924072265625, 0.1552734375, 0.056549072265625, 0.1607666015625, 0.13330078125, ...

embed

56202894_c0

56202894

haskell

0

Title: What is the precedence of `->`, `=` and ` ` in Haskell? Problem title: What is the precedence of `->`, `=` and ` ` in Haskell? Tags: operator-precedence, haskell Problem: What is the precedence of `->`, `=` and ` ` in Haskell? I'm trying to figure out some default operator precedences in Haskell, but I was...

What is the precedence of `->`, `=` and ` ` in Haskell? What is the precedence of `->`, `=` and ` ` in Haskell? operator-precedence haskell What Haskell What is the precedence of `->`, `=` and ` ` in Haskell? I'm trying to figure out some default operator precedences in Haskell, but I was unable to find some good...

[ 0.030517578125, -0.00457763671875, 0.00665283203125, 0.0040283203125, -0.00616455078125, -0.0098876953125, 0.014892578125, -0.00958251953125, -0.000408172607421875, -0.01153564453125, -0.0022125244140625, -0.0133056640625, 0.00933837890625, -0.0064697265625, -0.004180908203125, -0.0062...

[ 4865, 107671, 6620, 9, 1230, 5386, 1369, 136, 9473, 23, 20625, 142508, 39933, 4692, 37534, 1556, 83, 70, 111, 103607, 4, 26366, 114977, 69098, 209806, 33079, 2203, 162, 1238, 1022, 14, 78690, 41877, 17304, 6002, 86531, 18499, 6097, 6448, ...

[ 0.037139892578125, 0.1961669921875, 0.1285400390625, 0.0872802734375, 0.06146240234375, 0.139892578125, 0.2255859375, 0.1292724609375, 0.09521484375, 0.09912109375, 0.1571044921875, 0.25341796875, 0.2078857421875, 0.108154296875, 0.1417236328125, 0.132080078125, 0.0258331298828125, ...

embed

13003150_c0

13003150

haskell

0

Title: Why do I get an Could not deduce (Ord a) error? Problem title: Why do I get an Could not deduce (Ord a) error? Tags: haskell Problem: Why do I get an Could not deduce (Ord a) error? I am trying to find the list with the smallest sum of elements.: shortest :: (Num a) => [[a]] -> [a] shortest [] = [] shortest (x:x...

Why do I get an Could not deduce (Ord a) error? Why do I get an Could not deduce (Ord a) error? haskell a the Why Could Ord Num x:xs code.hs Possible Why do I get an Could not deduce (Ord a) error? I am trying to find the list with the smallest sum of elements.: That gives me the following error: Why doesn't the functi...

[ -0.01495361328125, 0.00823974609375, 0.01531982421875, -0.011962890625, -0.00116729736328125, 0.01531982421875, 0.008056640625, -0.0194091796875, 0.0179443359375, 0.001983642578125, -0.0018310546875, -0.0341796875, -0.00762939453125, -0.00176239013671875, -0.005340576171875, 0.01068115...

[ 44084, 54, 87, 2046, 142, 191147, 959, 8, 106357, 143045, 10, 18499, 1556, 142508, 35379, 52782, 1022, 425, 7, 18151, 127, 115861, 2661, 31577, 7413, 5303, 678, 19336, 525, 10554, 80854, 22027, 18, 32354, 10644, 78292 ]

[ 0.10723876953125, 0.016021728515625, 0.006927490234375, 0.042999267578125, 0.041534423828125, 0.1654052734375, 0.17822265625, 0.1639404296875, 0.2171630859375, 0.212158203125, 0.155029296875, 0.1954345703125, 0.1029052734375, 0.200439453125, 0.192626953125, 0.134033203125, 0.01486206...

embed

25678858_c0

25678858

haskell

0

Title: Is there a better way of doing this in Haskell? Problem title: Is there a better way of doing this in Haskell? Tags: haskell, integer-arithmetic Problem: Is there a better way of doing this in Haskell? I have written the following to assist grand kids with their home schooling work and to keep mind working by le...

Is there a better way of doing this in Haskell? Is there a better way of doing this in Haskell? haskell integer-arithmetic Haskell Please Result Proof Is there a better way of doing this in Haskell? I have written the following to assist grand kids with their home schooling work and to keep mind working by learning how...

[ -0.0281982421875, 0.005706787109375, 0.0101318359375, -0.004913330078125, -0.001983642578125, 0.01409912109375, 0.0128173828125, -0.01397705078125, -0.00335693359375, -0.0308837890625, 0.0155029296875, -0.0174560546875, -0.00860595703125, 0.0223388671875, -0.00982666015625, -0.01312255...

[ 11522, 3917, 20594, 903, 23, 20625, 142508, 1556, 892, 1505, 9, 147, 8962, 282, 9523, 30607, 126684, 1250, 4390, 2685, 10, 111, 59121, 25632, 47, 30793, 9963, 34376, 5368, 10696, 214, 4488, 13695, 7086, 20697, 52080, 3642, 1528, 17569, 45...

[ 0.15966796875, 0.084228515625, 0.0899658203125, 0.09814453125, 0.08746337890625, 0.16650390625, 0.2509765625, 0.1546630859375, 0.134765625, 0.177490234375, 0.016387939453125, 0.0308685302734375, 0.1474609375, 0.1142578125, 0.090087890625, 0.1732177734375, 0.1839599609375, 0.1376953...

embed

19876433_c0

19876433

haskell

0

Title: Arrays with rigid variable Problem title: Arrays with rigid variable Tags: arrays, haskell Problem: Arrays with rigid variable Well, I was doing a problem in which function I was using had a rigid variable. I had an idea of using arrays for that problem. So I thought of using arrays with same rigid variable as o...

Arrays with rigid variable Arrays with rigid variable arrays haskell Arrays Array Arrays with rigid variable Well, I was doing a problem in which function I was using had a rigid variable. I had an idea of using arrays for that problem. So I thought of using arrays with same rigid variable as of the function I was crea...

[ 0, 0.0167236328125, 0.0028228759765625, -0.0034027099609375, 0.0137939453125, -0.00665283203125, -0.0184326171875, 0.00860595703125, 0.023193359375, -0.01513671875, 0.0147705078125, 0.01019287109375, -0.0118408203125, 0.01202392578125, 0.00031280517578125, -0.0213623046875, 0.0041809...

[ 69253, 4778, 678, 128652, 77336, 10298, 1556, 142508, 53, 20594, 2967, 32354, 17368, 6528, 17569, 5701, 105233, 110, 3642, 3249, 10, 37842, 25632, 21543, 18499, 20949, 83, 111, 7722, 30022, 1884, 11814 ]

[ 0.2044677734375, 0.222412109375, 0.11572265625, 0.282958984375, 0.266845703125, 0.2044677734375, 0.1356201171875, 0.2110595703125, 0.19970703125, 0.00006103515625, 0.094482421875, 0.143798828125, 0.05718994140625, 0.07012939453125, 0.01416015625, 0.036468505859375, 0.0672607421875, ...

embed

49232503_c0

49232503

haskell

0

Title: Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Problem title: Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Tags: parsing, haskell Problem: Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Given the following Text: To allow the Parser type to be made into instances of classes, it ...

Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) parsing haskell Haskell Graham Hutton Book Parsing Parser Char x:xs Haskell: Graham Hutton Book on Parsing (page 178,CH 13.3) Given the following Text: Question: Why do we need a "dummy variable" and how ...

[ -0.0185546875, 0.0213623046875, 0.020751953125, 0.01953125, 0.00079345703125, 0.02197265625, -0.012451171875, -0.028076171875, 0.0064697265625, -0.0113525390625, 0.016357421875, -0.021240234375, -0.005859375, 0.00299072265625, -0.00701904296875, 0.0140380859375, 0.0189208984375, -0...

[ 20625, 142508, 147756, 97595, 1507, 2392, 68388, 16999, 366, 1556, 2189, 21656, 1022, 12, 425, 6953, 77878, 24129, 68185, 44084, 54, 642, 3871, 10, 10863, 1176, 77336, 136, 3642, 14602, 2046, 11814 ]

[ 0.10107421875, 0.201904296875, 0.053955078125, 0.02667236328125, 0.099853515625, 0.0755615234375, 0.040557861328125, 0.045318603515625, 0.046844482421875, 0.07012939453125, 0.073486328125, 0.12109375, 0.10675048828125, 0.0335693359375, 0.10400390625, 0.00445556640625, 0.0390930175781...

embed

38245696_c0

38245696

haskell

0

Title: Understanding monads in scala Problem title: Understanding monads in scala Tags: haskell, monads, scala Problem: Understanding monads in scala I'm trying to understand what monads are (not just in scala, but by example using scala). Let's consider the most (in my opinion) simple example of a monad: scala.Some As...

Understanding monads in scala Understanding monads in scala haskell monads scala Understanding scala.Some Option Understanding monads in scala I'm trying to understand what monads are (not just in scala, but by example using scala). Let's consider the most (in my opinion) simple example of a monad: As some articles sta...

[ 0.0322265625, 0.0225830078125, 0.01556396484375, 0.0133056640625, 0.001800537109375, -0.0157470703125, 0.00051116943359375, -0.0216064453125, 0.00335693359375, -0.0152587890625, -0.01068115234375, -0.0272216796875, -0.0159912109375, 0.00146484375, 0.00439453125, -0.00732421875, 0.000...

[ 9626, 144057, 2667, 712, 7, 23, 146232, 1556, 142508, 86769, 31577, 28219, 2367, 621, 27781, 2684, 33153, 8781, 11907, 54704, 10422, 5608, 479, 86687, 91736, 49878, 166179, 25072, 32354, 80934, 282, 11522, 95487, 154453, 38496, 179635, 134598, ...

[ 0.1015625, 0.06756591796875, 0.170166015625, 0.2410888671875, 0.1202392578125, 0.07427978515625, 0.260498046875, 0.0947265625, 0.1920166015625, 0.2144775390625, 0.003387451171875, 0.08740234375, 0.0318603515625, 0.1063232421875, 0.134033203125, 0.018951416015625, 0.008758544921875, ...

embed

65028047_c0

65028047

haskell

0

Title: Strange (to me) Haskell Syntax Problem title: Strange (to me) Haskell Syntax Tags: syntax, haskell Problem: Strange (to me) Haskell Syntax I'm an intermediate Haskell programmer (if you measure by how long I've been using it, not necessarily by skill :-) ). I often feel like a newbie. In looking through the Hask...

Strange (to me) Haskell Syntax Strange (to me) Haskell Syntax syntax haskell Strange Haskell Syntax Main Point Float Yields Strange (to me) Haskell Syntax I'm an intermediate Haskell programmer (if you measure by how long I've been using it, not necessarily by skill :-) ). I often feel like a newbie. In looking through...

[ -0.01171875, 0.0220947265625, 0.01483154296875, 0.0013275146484375, 0.018310546875, 0.01214599609375, -0.01446533203125, -0.00567626953125, 0.01611328125, -0.00555419921875, 0.006561279296875, -0.01275634765625, 0.008056640625, -0.02001953125, -0.0022125244140625, -0.0098876953125, -...

[ 187791, 188, 163, 20625, 142508, 19010, 86531, 16, 6002, 1556, 12321, 41097, 38699, 257, 42341, 19388, 81814, 2182, 77848, 72350, 4989, 17368, 112419, 27983, 12319, 1884, 3525, 9014, 46173, 31344, 40899, 959, 16031, 64549, 24592, 35064, 6954, ...

[ 0.2418212890625, 0.1412353515625, 0.1336669921875, 0.160888671875, 0.280029296875, 0.1875, 0.2340087890625, 0.045562744140625, 0.154541015625, 0.144775390625, 0.0885009765625, 0.1689453125, 0.1751708984375, 0.09027099609375, 0.1534423828125, 0.22265625, 0.045928955078125, 0.0579528...

embed

15309327_c0

15309327

haskell

0

Title: Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? Problem title: Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? Tags: command-line, haskell, shell Problem: Which Haskell idioms can I use to implement re...

Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? Which Haskell idioms can I use to implement realtime find-as-you-type autocomplete at the command line? command-line haskell shell Which Haskell Which Haskell idioms can I use to implement realtime find-as-you-type a...

[ -0.0133056640625, -0.0009307861328125, 0.010498046875, -0.00064849853515625, 0.00494384765625, 0.0115966796875, 0.013671875, 0.0133056640625, -0.01190185546875, -0.0242919921875, -0.00811767578125, -0.02099609375, -0.01019287109375, -0.00335693359375, -0.0123291015625, 0.0126953125, ...

[ 130078, 20625, 142508, 13373, 28016, 831, 4527, 29479, 2773, 6032, 7413, 162, 53927, 50986, 1809, 277, 131801, 99, 75101, 13315, 2256, 1556, 128019, 87, 34831, 62822, 44057, 43315, 139993, 60089, 20623, 11435, 33938, 36461, 2967, 31577, 11389, ...

[ 0.0794677734375, 0.140380859375, 0.2335205078125, 0.1953125, 0.197509765625, 0.05712890625, 0.1058349609375, 0.117919921875, 0.1300048828125, 0.1134033203125, 0.171630859375, 0.1768798828125, 0.1002197265625, 0.1759033203125, 0.150390625, 0.10626220703125, 0.1812744140625, 0.004821...

embed

21919433_c0

21919433

haskell

0

Title: OO classes represented in Haskell Problem title: OO classes represented in Haskell Tags: haskell, oop Problem: OO classes represented in Haskell H! Suppose I have an abstract class Robot with a few attributs like 'position' and 'weight'. This abstract class implements three methods : 'take', 'drop' and 'move', b...

OO classes represented in Haskell OO classes represented in Haskell haskell oop Haskell Robot Char Action OO classes represented in Haskell H! Suppose I have an abstract class Robot with a few attributs like 'position' and 'weight'. This abstract class implements three methods : 'take', 'drop' and 'move', but also has ...

[ 0.00994873046875, 0.0069580078125, 0.006256103515625, 0.006622314453125, -0.002105712890625, 0.0054931640625, 0.0167236328125, -0.0019989013671875, 0.017822265625, -0.002838134765625, -0.017578125, -0.03515625, -0.00543212890625, -0.008056640625, -0.0380859375, -0.0028839111328125, 0...

[ 30563, 61112, 33636, 20625, 142508, 23, 1556, 32500, 66349, 21656, 57945, 297, 572, 38, 121691, 164789, 18507, 10846, 150380, 40322, 136, 165598, 29479, 17262, 150624, 78219, 138810, 432, 272, 55300, 55898, 284, 10763, 6626, 1614, 67413, 12724,...

[ 0.25048828125, 0.26025390625, 0.212646484375, 0.1588134765625, 0.26416015625, 0.05859375, 0.1478271484375, 0.1749267578125, 0.22705078125, 0.146484375, 0.1632080078125, 0.0155029296875, 0.1165771484375, 0.0179290771484375, 0.02410888671875, 0.1622314453125, 0.2054443359375, 0.04913...

embed

17578728_c0

17578728

haskell

0

Title: Encoding "Less Than" with Haskell Problem title: Encoding "Less Than" with Haskell Tags: haskell, gadt, singleton-type, dependent-type Problem: Encoding "Less Than" with Haskell am hoping some Haskell experts can help clarify something. Is it possible to define Nat in the usual way (via @dorc...

Encoding "Less Than" with Haskell Encoding "Less Than" with Haskell haskell gadt singleton-type dependent-type Encoding Less Than Haskell Nat Succ Zero LessThan Encoding "Less Than" with Haskell am hoping some Haskell experts can help clarify something. Is it possible to define Nat in the usual way ...

[ -0.00157928466796875, 0.01470947265625, -0.005401611328125, -0.00799560546875, 0.00003743171691894531, -0.0196533203125, 0.0057373046875, 0.0027618408203125, 0.0101318359375, -0.00927734375, 0.016845703125, -0.0225830078125, -0.004547119140625, -0.00102996826171875, 0.01458740234375, -...

[ 357, 587, 6238, 68016, 7, 72820, 678, 20625, 142508, 1556, 914, 13384, 11001, 1507, 50986, 108750, 1734, 68875, 1832, 10060, 83947, 1121, 156377, 78688, 17306, 7722, 61924, 115723, 9254, 43609, 52895, 20117, 618, 41911, 100, 5584, 653, 136, ...

[ 0.0682373046875, 0.2025146484375, 0.023590087890625, 0.2197265625, 0.1541748046875, 0.25341796875, 0.080322265625, 0.1251220703125, 0.234130859375, 0.1053466796875, 0.0295257568359375, 0.1177978515625, 0.08837890625, 0.1708984375, 0.1676025390625, 0.1861572265625, 0.2176513671875, ...

embed

53179993_c0

53179993

haskell

0

Title: How do you get the most recent version of Cabal for Haskell? Problem title: How do you get the most recent version of Cabal for Haskell? Tags: cabal, haskell Problem: How do you get the most recent version of Cabal for Haskell? I've just spent about an hour going in circles trying to get version 2 of Cabal. Init...

How do you get the most recent version of Cabal for Haskell? How do you get the most recent version of Cabal for Haskell? cabal haskell How Cabal Haskell How do you get the most recent version of Cabal for Haskell? I've just spent about an hour going in circles trying to get version 2 of Cabal. Initially I found that t...

[ 0.013427734375, 0.0035400390625, 0.02294921875, 0.007354736328125, -0.003143310546875, 0.0146484375, -0.01177978515625, 0.00927734375, 0.001495361328125, 0.01025390625, -0.00616455078125, -0.049560546875, -0.0034027099609375, -0.005950927734375, 0.00119781494140625, -0.00909423828125, ...

[ 11249, 54, 2046, 70, 2684, 17309, 11389, 111, 30438, 289, 100, 20625, 142508, 109524, 1556, 398, 56816, 130370, 31577, 116, 678, 29908, 59076, 18, 20600, 106, 28350, 167934, 80383, 18499, 43581, 361, 4488, 787, 3444, 23035, 13438, 5423, 442...

[ 0.10662841796875, 0.060791015625, 0.1226806640625, 0.001068115234375, 0.1180419921875, 0.1611328125, 0.190673828125, 0.111572265625, 0.2183837890625, 0.22705078125, 0.090576171875, 0.1497802734375, 0.2666015625, 0.239501953125, 0.14013671875, 0.0216217041015625, 0.06591796875, 0.01...

embed

47115813_c1

47115813

haskell

1

-> Bool check1 (Not (Equal a b)) (Equal c d) | a == c && b == d = False | a == d && b == c = False | otherwise = True check1 (Not (Equal a b)) (Not (Equal c d)) | (check1 (Not (Equal a b)) (Equal c d)) == False = False | otherwise = True check1 (Not (Equal a b)) (Or c d) = ((check1 (Not (Equal a b)) c) || (check1 (Not...

[ 0.00131988525390625, 0.00994873046875, -0.0021820068359375, 0.021728515625, -0.01519775390625, 0.0137939453125, -0.0027618408203125, -0.0228271484375, 0.013671875, -0.0096435546875, 0.00084686279296875, 0.0126953125, 0.0157470703125, -0.00494384765625, 0.008056640625, -0.0147705078125,...

[ 33079, 2460, 929, 12765, 418, 122116, 647, 71723, 10, 876, 501, 104, 58745, 69112, 619, 1230, 22225, 120262, 2203, 87599, 78292, 19060, 37839, 61637, 182867, 15190, 864, 50592, 62775, 3493, 2965, 3917, 53333, 3444, 28271, 47, 15700, 28864, ...

[ 0.1650390625, 0.13818359375, 0.2308349609375, 0.25732421875, 0.1307373046875, 0.182373046875, 0.0252227783203125, 0.1771240234375, 0.07159423828125, 0.1298828125, 0.093017578125, 0.156005859375, 0.0330810546875, 0.124267578125, 0.014068603515625, 0.0850830078125, 0.1358642578125, 0...

embed

47550833_c0

47550833

haskell

0

Title: Hamming with lists in Haskell Problem title: Hamming with lists in Haskell Tags: haskell, hamming-numbers, functional-programming, list, smooth-numbers Problem: Hamming with lists in Haskell I want to write a hamming function in Haskell that gets a list as Input. I already have this: merge :: [Integer] -> [Integ...

Hamming with lists in Haskell Hamming with lists in Haskell haskell hamming-numbers functional-programming list smooth-numbers Hamming Haskell Integer x:xs y:ys Hamming with lists in Haskell I want to write a hamming function in Haskell that gets a list as Input. I already have this: That was easy. But now i want somet...

[ -0.01904296875, 0.01251220703125, 0.000339508056640625, -0.011474609375, -0.0022430419921875, 0.0238037109375, -0.0042724609375, -0.01129150390625, -0.0030059814453125, -0.0208740234375, -0.01251220703125, -0.031982421875, 0.0135498046875, 0.0208740234375, -0.007659912109375, -0.003311...

[ 1391, 58838, 678, 5303, 20625, 142508, 23, 1556, 256, 2606, 1297, 123309, 28966, 156100, 44401, 1022, 425, 113, 4778, 7, 3444, 33022, 32354, 62163, 237, 360, 7077, 21771, 23468, 5036, 1884, 528, 128191, 166590, 268, 107730, 8561, 106, 5608,...

[ 0.2109375, 0.256591796875, 0.1322021484375, 0.22607421875, 0.15576171875, 0.2401123046875, 0.0143280029296875, 0.147705078125, 0.1910400390625, 0.1295166015625, 0.139892578125, 0.1492919921875, 0.083251953125, 0.2374267578125, 0.148193359375, 0.04827880859375, 0.0859375, 0.04205322...

embed

33736975_c0

33736975

haskell

0

Title: How to define an n-sided polygon function in haskell Problem title: How to define an n-sided polygon function in haskell Tags: polygon, haskell Problem: How to define an n-sided polygon function in haskell I need to define a function that moves the "pen", which starts at (0,0) in the bottom left, around to draw ...

How to define an n-sided polygon function in haskell How to define an n-sided polygon function in haskell polygon haskell How Command Double How to define an n-sided polygon function in haskell I need to define a function that moves the "pen", which starts at (0,0) in the bottom left, around to draw the correct polygon...

[ -0.02197265625, -0.003082275390625, -0.004974365234375, 0.0010528564453125, -0.0031585693359375, 0.02294921875, 0.0201416015625, -0.0189208984375, -0.006378173828125, -0.01190185546875, -0.002410888671875, -0.024658203125, 0.0034027099609375, -0.00701904296875, -0.0021209716796875, 0.0...

[ 11249, 61924, 653, 8752, 71, 35874, 6126, 32354, 23, 1556, 142508, 47, 142, 9, 123573, 107172, 3871, 25813, 7, 2278, 4034, 99, 63527, 103136, 25737, 10932, 79442, 26785, 96819, 107730, 11907, 5609, 115700, 140909, 615, 15490, 24927, 32316, ...

[ 0.0595703125, 0.2381591796875, 0.1500244140625, 0.1903076171875, 0.09466552734375, 0.201904296875, 0.2198486328125, 0.2210693359375, 0.051513671875, 0.1514892578125, 0.227294921875, 0.0221405029296875, 0.023651123046875, 0.0189056396484375, 0.227783203125, 0.211181640625, 0.028137207...

embed