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
29014044_c0	29014044	haskell	0	Title: How to display the list but without a certain item. Problem title: How to display the list but without a certain item. Tags: haskell, list Problem: How to display the list but without a certain item. I have the following list, that contains a list of strings.. I have already searched the orginal list for the lis...	How to display the list but without a certain item. How to display the list but without a certain item. haskell list How George How to display the list but without a certain item. I have the following list, that contains a list of strings.. I have already searched the orginal list for the lists that contain the string ...	[ -0.0004730224609375, 0.01141357421875, -0.01422119140625, -0.002166748046875, 0.01165771484375, 0.007568359375, 0.00823974609375, 0.0218505859375, 0.000568389892578125, -0.0037384033203125, 0.00250244140625, -0.0162353515625, -0.0016326904296875, 0.0225830078125, -0.023681640625, 0.003...	[ 11249, 47, 44116, 70, 5303, 1284, 15490, 24233, 35735, 1556, 142508, 14787, 25632, 70541, 79315, 33938, 30910, 5928, 32599, 46683, 3220, 3714, 3642, 4358 ]	[ 0.07366943359375, 0.03472900390625, 0.191650390625, 0.00384521484375, 0.2203369140625, 0.1339111328125, 0.1556396484375, 0.06842041015625, 0.14306640625, 0.1170654296875, 0.2156982421875, 0.1717529296875, 0.0428466796875, 0.09619140625, 0.1605224609375, 0.010223388671875, 0.012481689...	embed
43667374_c0	43667374	haskell	0	Title: Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) Problem title: Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) Tags: monads, monoids, haskell, applicative Problem: Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) I recall this is very basic, and could simply be done with pattern matching even through a lambda lik...	Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) monads monoids haskell applicative Mappend Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) I recall this is very basic, and could simply be done with pattern matching even through a lambda like (\a b -> (fst a + fst b, snd a...	[ -0.00897216796875, 0.006378173828125, -0.001739501953125, 0.034423828125, 0.00775146484375, 0.03076171875, -0.0106201171875, 0.004791259765625, 0.030517578125, -0.01806640625, 0.009765625, -0.016357421875, -0.005950927734375, 0.02001953125, 0.0050048828125, -0.0284423828125, -0.00259...	[ 911, 9858, 71, 11, 418, 275, 17727, 136, 304, 10461, 3934, 1328, 876, 2667, 712, 22460, 30185, 1556, 142508, 41816, 4935, 189232, 903, 4552, 62822, 5809, 42856, 16940, 103510, 14858, 214, 3853, 8305, 21, 6492, 85, 33079, 271, 997, 2208, ...	[ 0.208984375, 0.2052001953125, 0.1953125, 0.08270263671875, 0.063232421875, 0.1387939453125, 0.0860595703125, 0.053070068359375, 0.1173095703125, 0.139892578125, 0.1553955078125, 0.08837890625, 0.117431640625, 0.116943359375, 0.12939453125, 0.1751708984375, 0.2076416015625, 0.138916...	embed
46384713_c0	46384713	haskell	0	Title: How to know the data type of a value of a sum type Problem title: How to know the data type of a value of a sum type Tags: haskell Problem: How to know the data type of a value of a sum type Say I have such sum type data YesOrNo = Yes \| No If somehow I have a value of this type in GHCI >:t yOrN yOrN :: YesOrNo I...	How to know the data type of a value of a sum type How to know the data type of a value of a sum type haskell How YesOrNo Yes How to know the data type of a value of a sum type Say I have such sum type If somehow I have a value of this type in GHCI Is it possible to get the data type of this value so that I know if it'...	[ 0.0002956390380859375, 0.003814697265625, 0.0084228515625, 0.031982421875, -0.0218505859375, 0.005889892578125, -0.00946044921875, 0.00653076171875, -0.01019287109375, -0.01495361328125, 0.007476806640625, -0.019775390625, -0.0186767578125, -0.0177001953125, 0.00836181640625, 0.0016326...	[ 11249, 47, 3714, 70, 2053, 10644, 111, 34292, 10554, 10, 1556, 142508, 32635, 19060, 5021, 87, 765, 6044, 209303, 903, 23, 41877, 17304, 7722, 2046, 707, 438, 17368, 35773, 1294, 30646, 209, 1328, 52895, 139509, 4588, 10557, 29102, 275, 1...	[ 0.08990478515625, 0.07098388671875, 0.133056640625, 0.0164642333984375, 0.1656494140625, 0.252197265625, 0.0723876953125, 0.1929931640625, 0.2052001953125, 0.014373779296875, 0.142333984375, 0.217529296875, 0.1429443359375, 0.1016845703125, 0.1529541015625, 0.003875732421875, 0.02713...	embed
9448384_c0	9448384	haskell	0	Title: Re-define "stringLiteral" token in Parsec.Token Problem title: Re-define "stringLiteral" token in Parsec.Token Tags: parsing, pascal, haskell, parsec Problem: Re-define "stringLiteral" token in Parsec.Token I am developing Pascal language parser in Haskell using Parsec library and I need to r...	Re-define "stringLiteral" token in Parsec.Token Re-define "stringLiteral" token in Parsec.Token parsing pascal haskell parsec Re-define Parsec.Token Re-define "stringLiteral" token in Parsec.Token I am developing Pascal language parser in Haskell using Parsec library and I need to re-define some tok...	[ 0.00180816650390625, 0.0255126953125, 0.000629425048828125, 0.035400390625, -0.023193359375, -0.009765625, -0.00116729736328125, 0.003509521484375, -0.00086212158203125, 0.01153564453125, -0.0042724609375, -0.00665283203125, -0.019775390625, 0.0004405975341796875, 0.00732421875, 0.0220...	[ 853, 112, 64552, 91693, 9506, 720, 289, 41502, 47, 1098, 2392, 39797, 7763, 366, 452, 6827, 1556, 142508, 168698, 167599, 46876, 2189, 20625, 35773, 3871, 456, 84694, 61924, 18507, 7225, 15549, 3642, 79315, 14858, 114977, 80934, 9844, 17721, ...	[ 0.1165771484375, 0.11181640625, 0.1685791015625, 0.1815185546875, 0.094970703125, 0.1689453125, 0.1651611328125, 0.005126953125, 0.1455078125, 0.218017578125, 0.147216796875, 0.25244140625, 0.1336669921875, 0.1002197265625, 0.0220489501953125, 0.07763671875, 0.07220458984375, 0.208...	embed
32728329_c0	32728329	haskell	0	Title: How to SPECIALIZE for a hsc2hs type? Problem title: How to SPECIALIZE for a hsc2hs type? Tags: ghc, hsc2hs, haskell Problem: How to SPECIALIZE for a hsc2hs type? I'm trying to use the SPECIALIZE pragma to a type I get through hsc2hs's #type . I tried something like this: {-# SPECIALIZE someFn :: #{type DWORD} ->...	How to SPECIALIZE for a hsc2hs type? How to SPECIALIZE for a hsc2hs type? ghc hsc2hs haskell How SPECIALIZE hsc2hs DWORD Bool How to SPECIALIZE for a hsc2hs type? I'm trying to use the SPECIALIZE pragma to a type I get through hsc2hs's #type . I tried something like this: That attempt fails with a parse error on input ...	[ 0.01287841796875, 0.032958984375, -0.0030364990234375, -0.01611328125, -0.00110626220703125, 0.0126953125, -0.00439453125, 0.0028839111328125, 0.00011348724365234375, 0.0025177001953125, -0.016845703125, -0.004852294921875, -0.00194549560546875, -0.018798828125, -0.0108642578125, 0.023...	[ 11249, 47, 224343, 568, 19157, 100, 1096, 10382, 304, 127, 7, 10644, 31380, 238, 1556, 142508, 30439, 36639, 929, 31577, 4527, 58827, 192, 8305, 468, 50986, 37842, 81887, 35782, 366, 184, 18499, 107730, 4904, 5117, 35166, 4488, 156377, 4662...	[ 0.06427001953125, 0.0550537109375, 0.21142578125, 0.1221923828125, 0.1739501953125, 0.0853271484375, 0.092529296875, 0.119873046875, 0.110595703125, 0.1427001953125, 0.08709716796875, 0.17919921875, 0.033355712890625, 0.0147705078125, 0.103759765625, 0.166259765625, 0.021514892578125...	embed
63975163_c0	63975163	haskell	0	Title: Type pararmeter as the data/value constructor Problem title: Type pararmeter as the data/value constructor Tags: haskell Problem: Type pararmeter as the data/value constructor Reading through Numeric.LinearProgramming I am confused by the type declaration data Bound x = x :<=: Double \| x :>=: Double \| x :&: (Dou...	Type pararmeter as the data/value constructor Type pararmeter as the data/value constructor haskell Type Numeric.LinearProgramming Bound Double Free Show Type pararmeter as the data/value constructor Reading through Numeric.LinearProgramming I am confused by the type declaration Suppose we input Int in place of x . The...	[ -0.00046539306640625, 0.0118408203125, -0.00830078125, 0.00653076171875, 0.005645751953125, 0.0191650390625, -0.00101470947265625, -0.01220703125, 0.003570556640625, 0.00738525390625, -0.00689697265625, -0.044921875, 0.00811767578125, 0.00872802734375, -0.00909423828125, 0.002136230468...	[ 60457, 121, 42, 29089, 237, 2053, 64, 27494, 64549, 748, 1556, 142508, 93511, 1771, 93232, 172895, 2460, 7030, 107172, 5153, 17367, 104951, 8305, 55681, 10644, 21635, 121691, 107730, 360, 18, 3687, 1022, 32786, 1230, 48400, 96060, 1984, 83, ...	[ 0.2724609375, 0.1396484375, 0.06378173828125, 0.2139892578125, 0.08929443359375, 0.1279296875, 0.029754638671875, 0.1455078125, 0.1859130859375, 0.125732421875, 0.12939453125, 0.222900390625, 0.065185546875, 0.004913330078125, 0.0950927734375, 0.1048583984375, 0.051605224609375, 0....	embed
24806859_c0	24806859	haskell	0	Title: Adding to list, Haskell compiling error Problem title: Adding to list, Haskell compiling error Tags: haskell Problem: Adding to list, Haskell compiling error -- Sample test data type Sales = (String, String, Int) testData :: [Sales] testData :: [("Me and My Broken Heart","Rixton"),("It’s My Birthday","will.i.am"...	Adding to list, Haskell compiling error Adding to list, Haskell compiling error haskell Adding Haskell Sample Sales Broken Heart Rixton Birthday will.i.am Problem Ariana Grande Adding to list, Haskell compiling error I get the error "illegal literal in type : "Me and my broken	[ -0.00665283203125, 0.00518798828125, 0.001129150390625, 0.02001953125, -0.006195068359375, 0.0289306640625, -0.02685546875, 0.01043701171875, 0.006011962890625, -0.006378173828125, 0.0037078857421875, -0.021240234375, 0.01507568359375, 0.02197265625, -0.004150390625, -0.00811767578125,...	[ 62, 59725, 47, 5303, 20625, 142508, 9969, 49725, 18499, 1556, 947, 33209, 88583, 13177, 1098, 60861, 2975, 425, 1507, 158080, 1221, 14, 302, 15649, 120524, 11, 22634, 70, 2186, 2870, 15659, 289, 10644, 6696, 136, 759, 148431 ]	[ 0.0902099609375, 0.1358642578125, 0.1517333984375, 0.1934814453125, 0.1534423828125, 0.24462890625, 0.1573486328125, 0.143798828125, 0.2049560546875, 0.13818359375, 0.0830078125, 0.152099609375, 0.1484375, 0.1939697265625, 0.1085205078125, 0.2178955078125, 0.06414794921875, 0.07684...	embed
49976795_c0	49976795	haskell	0	Title: Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter Problem title: Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter Tags: haskell, monad-transformers Problem: Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter I just discovered that RWST...	Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter haskell monad-transformers Why RWST MonadReader MonadState MonadWriter Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter I just discovered tha...	[ -0.01068115234375, 0.000518798828125, 0.00982666015625, -0.0155029296875, 0.00848388671875, -0.0235595703125, 0.002410888671875, -0.0140380859375, -0.0135498046875, 0.02685546875, -0.003936767578125, 0.0052490234375, -0.0146484375, 0.00147247314453125, -0.007476806640625, -0.0132446289...	[ 44084, 83, 78691, 8545, 153, 347, 10, 959, 110527, 60331, 71, 31345, 56, 135206, 1456, 2783, 1556, 142508, 2667, 712, 215175, 1314, 13, 161063, 27198, 85358, 70270, 2806, 109312, 52295, 1821, 41159, 19048, 4527, 5, 1369, 223, 172561, 31635,...	[ 0.1002197265625, 0.033355712890625, 0.16650390625, 0.203857421875, 0.1043701171875, 0.14013671875, 0.047454833984375, 0.0994873046875, 0.2215576171875, 0.1448974609375, 0.106689453125, 0.2105712890625, 0.13720703125, 0.1533203125, 0.072265625, 0.1546630859375, 0.06365966796875, 0.1...	embed
53831352_c0	53831352	haskell	0	Title: HASKELL : handling NULL value in database query with Maybe (or other ...) Problem title: HASKELL : handling NULL value in database query with Maybe (or other ...) Tags: haskell Problem: HASKELL : handling NULL value in database query with Maybe (or other ...) I have this query in SQL used by my Haskell code: let...	HASKELL : handling NULL value in database query with Maybe (or other ...) HASKELL : handling NULL value in database query with Maybe (or other ...) haskell WDS HASKELL Maybe qry_head_WDS DNUM DISC Query bd_rows_WDS Only name::String forM_ Text.unpack Exception UnexpectedNull Text Main HASKELL : handling NULL value in d...	[ 0.01177978515625, -0.0054931640625, 0.0081787109375, 0.01165771484375, -0.00531005859375, 0.006744384765625, 0.016845703125, -0.02734375, -0.0072021484375, 0.004150390625, 0.00537109375, -0.01055908203125, -0.006591796875, -0.0103759765625, -0.019287109375, -0.009521484375, 0.0128173...	[ 11666, 10762, 56051, 45064, 18057, 23708, 34292, 63399, 41, 1294, 678, 83425, 3789, 1556, 142508, 601, 13526, 31251, 109020, 62562, 58836, 34145, 15555, 1456, 87293, 9351, 71713, 100, 594, 24129, 309, 29102, 63928, 992, 83613, 18444, 1181, 12...	[ 0.1156005859375, 0.138427734375, 0.2138671875, 0.1727294921875, 0.1943359375, 0.1934814453125, 0.2177734375, 0.176513671875, 0.114990234375, 0.076416015625, 0.0679931640625, 0.2802734375, 0.082763671875, 0.1009521484375, 0.212890625, 0.01171875, 0.1072998046875, 0.08740234375, 0....	embed
26697048_c0	26697048	haskell	0	Title: Getting parse error on using head function on a list in haskell Problem title: Getting parse error on using head function on a list in haskell Tags: compiler-errors, haskell Problem: Getting parse error on using head function on a list in haskell I have a function, ground n p, with two input parameters n and p, ...	Getting parse error on using head function on a list in haskell Getting parse error on using head function on a list in haskell compiler-errors haskell head Getting Getting parse error on using head function on a list in haskell I have a function, ground n p, with two input parameters n and p, that returns like this: [...	[ -0.00537109375, 0.01080322265625, -0.002197265625, 0.0029754638671875, -0.00092315673828125, 0.020751953125, -0.00640869140625, -0.0036773681640625, 0.0133056640625, -0.051025390625, -0.00189208984375, -0.00830078125, 0.0230712890625, -0.0081787109375, 0, -0.016357421875, 0.003784179...	[ 210732, 366, 184, 18499, 98, 17368, 10336, 32354, 5303, 23, 1556, 142508, 9969, 34759, 188800, 765, 61585, 653, 915, 6626, 107730, 171859, 136, 30646, 1884, 206808, 76172, 63527, 418, 25632, 5646, 181135, 2046, 16093, 9, 44084, 3525, 6967, ...	[ 0.08428955078125, 0.16064453125, 0.1715087890625, 0.2122802734375, 0.1025390625, 0.10205078125, 0.25048828125, 0.161376953125, 0.1651611328125, 0.0288543701171875, 0.1588134765625, 0.229248046875, 0.0792236328125, 0.07220458984375, 0.1522216796875, 0.007537841796875, 0.1595458984375,...	embed
27987261_c0	27987261	haskell	0	Title: Verifying condition in Haskell Problem title: Verifying condition in Haskell Tags: list, haskell, recursion Problem: Verifying condition in Haskell I need a function that checks a condition on a list. For example: countP :: [a] -> (a -> Bool) -> Int with the input: countP [1,-2,0,-1,5] (>0) should return 2, beca...	Verifying condition in Haskell Verifying condition in Haskell list haskell recursion Verifying Haskell Bool x:xs Verifying condition in Haskell I need a function that checks a condition on a list. For example: with the input: should return 2, because there are two numbers greater than zero. Here's what i've done so far...	[ -0.0048828125, 0.0035552978515625, -0.000007450580596923828, 0.00732421875, 0.000782012939453125, 0.02587890625, 0.00848388671875, 0.002593994140625, 0.027099609375, -0.00390625, 0.01055908203125, -0.03271484375, 0.020751953125, 0.01422119140625, -0.002410888671875, 0.0137939453125, ...	[ 1446, 151138, 35431, 23, 20625, 142508, 5303, 1556, 195625, 1830, 2460, 929, 1022, 425, 3871, 32354, 12765, 7, 98, 678, 107730, 5608, 30646, 116, 6637, 621, 6626, 101935, 117396, 3501, 45234, 16940, 2060, 214, 68252, 76172, 64457, 70, 14012...	[ 0.190673828125, 0.1781005859375, 0.265869140625, 0.07025146484375, 0.1812744140625, 0.269287109375, 0.1962890625, 0.1612548828125, 0.1910400390625, 0.022857666015625, 0.0872802734375, 0.1773681640625, 0.0335693359375, 0.06683349609375, 0.0989990234375, 0.1727294921875, 0.197509765625...	embed
22437812_c1	22437812	haskell	1	every combinator be expression in terms of "compose" and "reverse compose", and is there a scheme to derive the combination of "compose" and "reverse compose" directly from the structure of the pointful combinator (i.e., without going through the complete rewrite process)? For instance, is it possible to directly deri...	every combinator be expression in terms of "compose" and "reverse compose", and is there a scheme to derive the combination of "compose" and "reverse compose" directly from the structure of the pointful combinator (i.e., without going through the complete rewrite process)? For instance, is it possible to directly deri...	[ -0.01202392578125, 0.02685546875, -0.01214599609375, 0.0230712890625, -0.0003070831298828125, 0.007720947265625, 0.00262451171875, 0.020751953125, 0.01348876953125, -0.00421142578125, -0.0128173828125, -0.00897216796875, 0.0030670166015625, 0.016845703125, -0.026123046875, 0.0000963211...	[ 11907, 22321, 1290, 186, 125195, 69407, 277, 78381, 107, 37676, 150350, 150370, 122, 5844, 162515, 105237, 1295, 45646, 6275, 7844, 18781, 7722, 32087, 11389, 41872, 97, 33079, 113, 16487, 32354, 9351, 31667, 62775, 100, 501, 136, 1690, 37202...	[ 0.10467529296875, 0.255126953125, 0.1875, 0.03411865234375, 0.193359375, 0.032623291015625, 0.1309814453125, 0.2030029296875, 0.055877685546875, 0.1866455078125, 0.25537109375, 0.10791015625, 0.09521484375, 0.10498046875, 0.1689453125, 0.09326171875, 0.0430908203125, 0.156616210937...	embed
31911335_c1	31911335	haskell	1	e1 :\| e2) = e1 :\| (apply xs f e2) apply (L:xs) f (e1 :=> e2) = (apply xs f e1) :=> e2 apply (R:xs) f (e1 :=> e2) = e1 :=> (apply xs f e2) apply (L:xs) f (e1 := e2) = (apply xs f e1) := e2 apply (R:xs) f (e1 := e2) = e1 := (apply xs f e2) apply (x:xs) f (Not' e) = apply xs f e The function works fine. But can I use some...	e1 :\| e2) = e1 :\| (apply xs f e2) apply (L:xs) f (e1 :=> e2) = (apply xs f e1) :=> e2 apply (R:xs) f (e1 :=> e2) = e1 :=> (apply xs f e2) apply (L:xs) f (e1 := e2) = (apply xs f e1) := e2 apply (R:xs) f (e1 := e2) = e1 := (apply xs f e2) apply (x:xs) f (Not' e) = apply xs f e The function works fine. But can I use some...	[ 0.00604248046875, -0.00115203857421875, 0.007476806640625, -0.01031494140625, 0.0186767578125, 0.0068359375, -0.002044677734375, 0.01495361328125, 0.030029296875, -0.00970458984375, 0.027587890625, 0.0028533935546875, 0.0274658203125, 0.009765625, 0.005157470703125, -0.00860595703125, ...	[ 28, 418, 152, 58745, 10461, 2203, 9007, 538, 1022, 7, 1238, 59911, 866, 12, 425, 13, 17727, 304, 1052, 122116, 25, 32354, 43240, 5885, 4966, 831, 4527, 3060, 2053, 64549, 748, 41123, 71, 38931, 1286, 8781, 1884, 903, 1984, 7192, 172, ...	[ 0.1668701171875, 0.1314697265625, 0.010101318359375, 0.02960205078125, 0.2161865234375, 0.04583740234375, 0.1292724609375, 0.115478515625, 0.0859375, 0.0712890625, 0.17041015625, 0.2159423828125, 0.0672607421875, 0.05303955078125, 0.0921630859375, 0.09844970703125, 0.0814208984375, ...	embed
56517712_c0	56517712	haskell	0	Title: Given a list of list of Booleans, return a Boolean Problem title: Given a list of list of Booleans, return a Boolean Tags: haskell Problem: Given a list of list of Booleans, return a Boolean I have a function, defined as follows, that is given a list of lists of Booleans and returns a Boolean: evaluates :: [[Boo...	Given a list of list of Booleans, return a Boolean Given a list of list of Booleans, return a Boolean haskell Given Booleans Boolean Bool y:ys Given a list of list of Booleans, return a Boolean I have a function, defined as follows, that is given a list of lists of Booleans and returns a Boolean: I tried the following ...	[ 0.00921630859375, 0.0081787109375, 0.01104736328125, 0.018310546875, 0.010498046875, 0.01312255859375, 0.0245361328125, -0.0218505859375, 0.0185546875, 0.0228271484375, 0.004302978515625, 0.009033203125, 0.00726318359375, -0.003082275390625, -0.0216064453125, -0.004730224609375, 0.00...	[ 77878, 5303, 111, 73783, 34677, 7, 30646, 10, 1556, 142508, 19, 2460, 929, 113, 12, 4778, 32354, 61924, 28960, 34475, 37842, 25632, 3917, 22027, 18, 4488, 16750, 41206, 83, 1326, 42805, 882, 22225, 87599, 17647, 11971, 184 ]	[ 0.1029052734375, 0.1513671875, 0.056854248046875, 0.16748046875, 0.257080078125, 0.03131103515625, 0.2156982421875, 0.054046630859375, 0.1346435546875, 0.2252197265625, 0.0294036865234375, 0.08642578125, 0.1513671875, 0.0831298828125, 0.0076904296875, 0.134033203125, 0.1912841796875,...	embed
3518619_c0	3518619	haskell	0	Title: How to configure GHCi to automatically import modules Problem title: How to configure GHCi to automatically import modules Tags: haskell, ghci Problem: How to configure GHCi to automatically import modules When I use GHCi, I almost always end up importing Control.Applicative , Data.List , etc. . Is there a way t...	How to configure GHCi to automatically import modules How to configure GHCi to automatically import modules haskell ghci modules How GHCi Control.Applicative Data.List Prelude Database.HDBC Database.HDBC.Sqlite3 System.Directory How to configure GHCi to automatically import modules When I use GHCi, I almost always end ...	[ -0.0115966796875, -0.006378173828125, -0.0028839111328125, 0.025146484375, -0.003936767578125, 0.00836181640625, 0.01251220703125, -0.01141357421875, 0.007659912109375, -0.0235595703125, -0.00823974609375, -0.03515625, -0.01043701171875, -0.00567626953125, -0.01104736328125, -0.0078125...	[ 11249, 222495, 527, 73265, 14, 191082, 24927, 88996, 47, 1556, 142508, 31380, 318, 27131, 39179, 11048, 11809, 154663, 1914, 822, 187781, 16291, 24318, 95255, 67, 363, 12353, 7, 4527, 39555, 11343, 3564, 13695, 105876, 8371, 4989 ]	[ 0.0479736328125, 0.2181396484375, 0.09796142578125, 0.177734375, 0.2303466796875, 0.214599609375, 0.2578125, 0.2442626953125, 0.00469970703125, 0.104736328125, 0.195068359375, 0.1142578125, 0.1683349609375, 0.1668701171875, 0.061859130859375, 0.1097412109375, 0.08001708984375, 0.10...	embed
26139360_c0	26139360	haskell	0	Title: Parse json dynamically with Data.Aeson Problem title: Parse json dynamically with Data.Aeson Tags: json, haskell Problem: Parse json dynamically with Data.Aeson I follow docs and try: let st = do result <- decode "{\"name\":\"Dave\",\"age\":2}" --bss flip parseMaybe result $ \obj -> do name <- obj .: "name" retu...	Parse json dynamically with Data.Aeson Parse json dynamically with Data.Aeson json haskell Parse Data.Aeson Dave Parse json dynamically with Data.Aeson I follow docs and try: I get: How to do it properly? What am I doing wrong?	[ 0.00714111328125, -0.00537109375, 0.012451171875, 0.011962890625, -0.0279541015625, 0.023681640625, -0.0145263671875, 0.00921630859375, -0.0111083984375, -0.0308837890625, -0.01214599609375, 0.0184326171875, 0.0003948211669921875, -0.0167236328125, 0.01220703125, -0.00830078125, 0.00...	[ 2392, 184, 1647, 1681, 84079, 25958, 678, 11809, 284, 90, 191, 1556, 142508, 103383, 28960, 54, 4439, 9790, 11249, 155965, 444, 44691 ]	[ 0.1494140625, 0.09686279296875, 0.140869140625, 0.2249755859375, 0.1868896484375, 0.10919189453125, 0.093505859375, 0.10968017578125, 0.07891845703125, 0.113037109375, 0.1947021484375, 0.12054443359375, 0.1962890625, 0.1806640625, 0.08819580078125, 0.03253173828125, 0.020233154296875...	embed
71759825_c0	71759825	haskell	0	Title: Defining a function that satisfies a type in Haskell Problem title: Defining a function that satisfies a type in Haskell Tags: types, type-inference, haskell, ghci Problem: Defining a function that satisfies a type in Haskell Considering the type foo :: a -> ((b -> a) -> c) -> c I want to create a function that ...	Defining a function that satisfies a type in Haskell Defining a function that satisfies a type in Haskell types type-inference haskell ghci Defining Haskell foo2 Defining a function that satisfies a type in Haskell Considering the type I want to create a function that satisfies this type... I know foo x y = y (\z -> x)...	[ 0.01806640625, -0.00469970703125, -0.01202392578125, 0.0140380859375, 0.009521484375, 0.001556396484375, -0.0159912109375, 0.01177978515625, 0.016357421875, -0.00141143798828125, 0.0019073486328125, -0.03369140625, -0.014404296875, -0.003662109375, 0.0037384033203125, -0.0025634765625,...	[ 88606, 32354, 450, 40407, 3387, 10644, 23, 20625, 142508, 10, 52895, 73, 69988, 1556, 31380, 318, 5775, 31, 304, 449, 137399, 3444, 28282, 903, 3714, 1022, 113, 2203, 41872, 169, 33079, 39563, 152, 50986, 527, 73265, 14, 2046, 47, 2704, ...	[ 0.1849365234375, 0.2423095703125, 0.081298828125, 0.2335205078125, 0.123779296875, 0.261474609375, 0.058197021484375, 0.14794921875, 0.251708984375, 0.007537841796875, 0.2000732421875, 0.0237579345703125, 0.1275634765625, 0.1270751953125, 0.08544921875, 0.11767578125, 0.130126953125,...	embed
41966893_c1	41966893	haskell	1	>>= either (return . Left) (\x -> unIOEither (f x)) instance MonadThrow IOEither where throwM e = IOEither (throwM @IO e) instance MonadCatch IOEither where catch (IOEither aIO) f = IOEither $ catch @IO aIO (unIOEither . f) instance MonadMask IOEither where mask f = IOEither $ mask @IO $ \restore -> unIOEither $ f (IO...	>>= either (return . Left) (\x -> unIOEither (f x)) instance MonadThrow IOEither where throwM e = IOEither (throwM @IO e) instance MonadCatch IOEither where catch (IOEither aIO) f = IOEither $ catch @IO aIO (unIOEither . f) instance MonadMask IOEither where mask f = IOEither $ mask @IO $ \restore -> unIOEither $ f (IO...	[ -0.0260009765625, -0.004058837890625, 0.0208740234375, 0.000476837158203125, 0.01068115234375, 0.0037841796875, -0.0026092529296875, -0.0263671875, 0.0017547607421875, 0.013916015625, -0.00213623046875, -0.0162353515625, 0.0024871826171875, 0.0030364990234375, 0.004150390625, -0.011230...	[ 6396, 1369, 40101, 65395, 19, 636, 2480, 425, 51, 17780, 647, 14, 9319, 420, 1022, 110527, 60331, 71, 20800, 15555, 104250, 594, 28, 2203, 1374, 76775, 206, 105556, 10, 1238, 3650, 309, 53049, 92, 6, 7021, 45804, 14359, 9167, 107, 16, ...	[ 0.1177978515625, 0.0400390625, 0.2281494140625, 0.11376953125, 0.0160675048828125, 0.0268707275390625, 0.116455078125, 0.10247802734375, 0.130859375, 0.22021484375, 0.047760009765625, 0.0782470703125, 0.22314453125, 0.0655517578125, 0.10986328125, 0.2529296875, 0.1929931640625, 0.1...	embed
59154523_c0	59154523	haskell	0	Title: How to define data type in GHCi Problem title: How to define data type in GHCi Tags: haskell Problem: How to define data type in GHCi I'm reading from " Making Our Own Types and Typeclasses " part from "Learn You a Haskell for Great Good!". By following the text I wrote the code in GHCi and got an error. data Sh...	How to define data type in GHCi How to define data type in GHCi haskell How GHCi Shape Circle Float Rectangle Variable How to define data type in GHCi I'm reading from " Making Our Own Types and Typeclasses " part from "Learn You a Haskell for Great Good!". By following the text I wrote the code in GHCi and got an erro...	[ 0.0128173828125, 0.0201416015625, -0.002471923828125, 0.0205078125, 0.00341796875, 0.00139617919921875, -0.002197265625, 0.02099609375, -0.003204345703125, -0.00921630859375, -0.015869140625, -0.0400390625, -0.01043701171875, -0.01422119140625, 0.017578125, 0.01544189453125, 0.022216...	[ 11249, 47, 61924, 2053, 10644, 23, 527, 73265, 14, 1556, 142508, 7224, 1081, 163731, 38699, 257, 48224, 14525, 133, 84572, 2886, 16454, 22929, 7710, 60457, 136, 67413, 147, 2583, 20625, 100, 18621, 3890, 25632, 18151, 18499, 87, 33022, 3039...	[ 0.06903076171875, 0.033111572265625, 0.2081298828125, 0.1805419921875, 0.2705078125, 0.05548095703125, 0.117431640625, 0.1519775390625, 0.221923828125, 0.1307373046875, 0.216796875, 0.1318359375, 0.03338623046875, 0.1409912109375, 0.147216796875, 0.05743408203125, 0.0158843994140625,...	embed
26895904_c0	26895904	haskell	0	Title: Repeat elements of a list Problem title: Repeat elements of a list Tags: haskell Problem: Repeat elements of a list I am writing a small function repeat k lt. it will repeat all elements in a list k times. This is my approach and following is the code i tried repeat 0 xs = xs repeat k [] = [] repeat k (x:xs) \|k ...	Repeat elements of a list Repeat elements of a list haskell Repeat x:xs x:repeat k-1 Repeat elements of a list I am writing a small function repeat k lt. it will repeat all elements in a list k times. This is my approach and following is the code i tried Then i realized i am just removing the head and pushing it back i...	[ 0.004302978515625, 0.018798828125, -0.00014972686767578125, -0.0052490234375, -0.00151824951171875, 0.00860595703125, 0.001556396484375, -0.01202392578125, 0.005828857421875, -0.00726318359375, 0.00616455078125, -0.0142822265625, -0.002655029296875, 0.0142822265625, 0.00164031982421875, ...	[ 33742, 13, 257, 80854, 111, 5303, 1556, 142508, 1022, 12, 425, 7, 107, 1081, 472, 5759, 32562, 19336, 32354, 119140, 18, 1221, 756, 23, 10, 20028, 51515, 25632, 70, 18151, 37842, 185171, 49146, 6496, 10336, 25944, 4420, 46132, 4527, 37223...	[ 0.230224609375, 0.2489013671875, 0.1568603515625, 0.206787109375, 0.0921630859375, 0.20654296875, 0.13623046875, 0.21142578125, 0.0924072265625, 0.04608154296875, 0.08343505859375, 0.048065185546875, 0.088134765625, 0.248046875, 0.1727294921875, 0.15576171875, 0.06329345703125, 0.0...	embed
27302970_c0	27302970	haskell	0	Title: Prelude "and" and "or" functions on empty lists Problem title: Prelude "and" and "or" functions on empty lists Tags: haskell, ghci Problem: Prelude "and" and "or" functions on empty lists I've just started to play with Haskell using GHCI. The REPL comes with a bunch of bui...	Prelude "and" and "or" functions on empty lists Prelude "and" and "or" functions on empty lists haskell ghci Prelude Bool Prelude "and" and "or" functions on empty lists I've just started to play with Haskell using GHCI. The REPL comes with a bunch of built in functions. For exam...	[ 0.0172119140625, -0.00180816650390625, 0.00164031982421875, 0.004669189453125, -0.01611328125, 0.0303955078125, 0.000850677490234375, -0.0087890625, 0.007537841796875, 0.020751953125, -0.00469970703125, -0.02734375, -0.01092529296875, 0.009765625, 0.0086669921875, -0.016357421875, 0....	[ 1914, 822, 112, 2940, 136, 748, 32354, 98, 201505, 5303, 1556, 142508, 31380, 318, 2460, 929, 11301, 20625, 41877, 17304, 9069, 21130, 32497, 147306, 88303, 23, 707, 34390, 31, 34677, 12647, 33079, 100, 7, 76199, 4127, 89397, 6044, 224833, ...	[ 0.0999755859375, 0.2003173828125, 0.0950927734375, 0.182373046875, 0.133544921875, 0.1905517578125, 0.2069091796875, 0.053070068359375, 0.2237548828125, 0.228271484375, 0.07635498046875, 0.2498779296875, 0.06402587890625, 0.117431640625, 0.10302734375, 0.216552734375, 0.0298767089843...	embed
47257942_c0	47257942	haskell	0	Title: Function with a -> a -> a possible in Haskell? Problem title: Function with a -> a -> a possible in Haskell? Tags: haskell Problem: Function with a -> a -> a possible in Haskell? I am going through Haskell Programming book and an in exercise on page 140, the author states this: A hypothetical functio...	Function with a -> a -> a possible in Haskell? Function with a -> a -> a possible in Haskell? haskell Haskell Write Function with a -> a -> a possible in Haskell? I am going through Haskell Programming book and an in exercise on page 140, the author states this: A hypothetical function a->a->a has two possi...	[ 0.01171875, 0.01312255859375, 0.005950927734375, 0.01214599609375, -0.01080322265625, 0.0211181640625, -0.01263427734375, -0.0078125, 0.0067138671875, -0.0052490234375, -0.00787353515625, -0.006683349609375, -0.0031585693359375, 0.0255126953125, 0.0157470703125, -0.005401611328125, 0...	[ 28670, 10763, 678, 10, 20, 1230, 5386, 7722, 23, 20625, 142508, 1556, 601, 18781, 33079, 12877, 81979, 12664, 170933, 70760, 32354, 103607, 11, 6626, 208124, 15044, 11389, 21980, 51776, 10750, 136, 959, 10422, 159978, 79459, 31380, 318, 7108,...	[ 0.159912109375, 0.08056640625, 0.1279296875, 0.1763916015625, 0.1036376953125, 0.0550537109375, 0.175048828125, 0.27880859375, 0.046539306640625, 0.135498046875, 0.2401123046875, 0.072998046875, 0.031524658203125, 0.08612060546875, 0.1888427734375, 0.040435791015625, 0.03005981445312...	embed
5557082_c0	5557082	haskell	0	Title: What does the ($=) (dollar equals) operator do in Haskell GLUT library? Problem title: What does the ($=) (dollar equals) operator do in Haskell GLUT library? Tags: haskell, opengl, syntax Problem: What does the ($=) (dollar equals) operator do in Haskell GLUT library? I was looking through some game code writte...	What does the ($=) (dollar equals) operator do in Haskell GLUT library? What does the ($=) (dollar equals) operator do in Haskell GLUT library? haskell opengl syntax What Haskell GLUT What does the ($=) (dollar equals) operator do in Haskell GLUT library? I was looking through some game code written in Haskell using th...	[ 0.004241943359375, 0.0013427734375, 0.01239013671875, -0.0213623046875, 0.006317138671875, 0.005279541015625, -0.00848388671875, 0.0016937255859375, -0.006744384765625, 0.0162353515625, -0.0027313232421875, -0.007781982421875, 0.02099609375, -0.00848388671875, -0.02392578125, 0.0150756...	[ 4865, 14602, 70, 4369, 1369, 16, 5876, 320, 105950, 7, 39933, 54, 23, 20625, 142508, 527, 143662, 35773, 1294, 1556, 9803, 11016, 6002, 86531, 15, 8305, 6712, 18151, 59121, 17368, 903, 13695, 160, 26783, 219743, 130481, 2831, 442, 64557, ...	[ 0.0755615234375, 0.055267333984375, 0.04278564453125, 0.161865234375, 0.251708984375, 0.039459228515625, 0.1678466796875, 0.1778564453125, 0.2337646484375, 0.133544921875, 0.239990234375, 0.105712890625, 0.033782958984375, 0.1171875, 0.2135009765625, 0.0802001953125, 0.25, 0.139526...	embed
25769820_c0	25769820	haskell	0	Title: Minimum of Two Maybes Problem title: Minimum of Two Maybes Tags: option-type, haskell Problem: Minimum of Two Maybes I want to get the minimum of two maybe values, or if one is nothing get the non-nothing one, or return nothing if both inputs are nothing. I can write a simple function to do this, but I suspect t...	Minimum of Two Maybes Minimum of Two Maybes option-type haskell Minimum Two Maybes Ord Maybe Nothing Just Minimum of Two Maybes I want to get the minimum of two maybe values, or if one is nothing get the non-nothing one, or return nothing if both inputs are nothing. I can write a simple function to do this, but I suspe...	[ -0.00023651123046875, -0.007537841796875, 0.0286865234375, 0.01043701171875, 0.00927734375, 0.0233154296875, 0.0201416015625, -0.0228271484375, -0.0030059814453125, 0.0166015625, 0.000118255615234375, 0.01220703125, -0.00015544891357421875, -0.002655029296875, -0.007568359375, 0.004943...	[ 173858, 111, 32964, 83425, 7, 35829, 50986, 1556, 142508, 35379, 182747, 3444, 47, 2046, 70, 15440, 6626, 51139, 142424, 2174, 1632, 33720, 351, 157, 64113, 30646, 15044, 107730, 621, 33022, 8781, 32354, 54, 903, 92610, 3917, 15490, 32562, ...	[ 0.231201171875, 0.1143798828125, 0.1966552734375, 0.257080078125, 0.06219482421875, 0.1666259765625, 0.075927734375, 0.1134033203125, 0.2056884765625, 0.1064453125, 0.1278076171875, 0.0941162109375, 0.031982421875, 0.114013671875, 0.042144775390625, 0.231689453125, 0.1715087890625, ...	embed
26344514_c0	26344514	haskell	0	Title: (Haskell) Displaying a list in plain English? Problem title: (Haskell) Displaying a list in plain English? Tags: haskell, functional-programming Problem: (Haskell) Displaying a list in plain English? I've been writing a really simple text game engine, and I've come across a problem: I need to be able to print a ...	(Haskell) Displaying a list in plain English? (Haskell) Displaying a list in plain English? haskell functional-programming Haskell Displaying English (Haskell) Displaying a list in plain English? I've been writing a really simple text game engine, and I've come across a problem: I need to be able to print a list of ite...	[ -0.00946044921875, -0.003631591796875, 0.0048828125, 0.0166015625, 0.007049560546875, 0.0184326171875, -0.005828857421875, -0.01708984375, -0.004486083984375, 0.0167236328125, -0.00616455078125, -0.021728515625, 0.004974365234375, 0.01953125, -0.00909423828125, 0.0024871826171875, 0....	[ 6495, 7, 142508, 90045, 214, 10, 5303, 23, 111719, 14941, 32, 1556, 123309, 28966, 20625, 32562, 6183, 8781, 7986, 6712, 87907, 36880, 2967, 3871, 19048, 28412, 55769, 175457, 85590, 32354, 51776, 10298, 79315, 140992, 2856, 1884, 3642, 11957...	[ 0.087890625, 0.06219482421875, 0.22998046875, 0.17138671875, 0.05596923828125, 0.0440673828125, 0.2308349609375, 0.089599609375, 0.1580810546875, 0.2413330078125, 0.0089111328125, 0.123291015625, 0.10498046875, 0.05657958984375, 0.1236572265625, 0.060394287109375, 0.003173828125, 0...	embed
37455495_c0	37455495	haskell	0	Title: Generate server sided images (QR codes) and display them on a page with Yesod Problem title: Generate server sided images (QR codes) and display them on a page with Yesod Tags: yesod, qr-code, haskell Problem: Generate server sided images (QR codes) and display them on a page with Yesod I'd like to be able to ge...	Generate server sided images (QR codes) and display them on a page with Yesod Generate server sided images (QR codes) and display them on a page with Yesod yesod qr-code haskell Generate Yesod Generate server sided images (QR codes) and display them on a page with Yesod I'd like to be able to generate arbitrary qr code...	[ 0.006072998046875, 0.017333984375, -0.010009765625, -0.0111083984375, -0.01422119140625, 0.0252685546875, -0.005523681640625, -0.01263427734375, -0.0169677734375, -0.02587890625, 0.0040283203125, -0.00970458984375, 0.006195068359375, 0.01904296875, -0.005523681640625, -0.024658203125, ...	[ 155370, 67, 10723, 5609, 71, 43079, 2737, 1052, 18151, 44116, 9191, 678, 32635, 2199, 2422, 23722, 8096, 42, 40899, 1556, 142508, 1884, 19048, 139392, 61799, 1467, 149976, 765, 12008, 3714, 3126, 1257, 79631, 12663, 117233, 14578, 35773, 1409...	[ 0.16650390625, 0.06396484375, 0.1708984375, 0.12060546875, 0.1016845703125, 0.199462890625, 0.0787353515625, 0.1502685546875, 0.221435546875, 0.1329345703125, 0.1002197265625, 0.0830078125, 0.169677734375, 0.234619140625, 0.128662109375, 0.1922607421875, 0.08740234375, 0.1307373046...	embed
49986342_c1	49986342	haskell	1	This says that undefined should work for any RuntimeRep , even unlifted types. Here is an example of using undefined as an unboxed, unlifted Int# in GHCi: > :set -XMagicHash > import GHC.Prim > import GHC.Exts > I# (undefined :: Int#) *** Exception: Prelude.undefined I've always thought of undefined as being the same ...	This says that undefined should work for any RuntimeRep , even unlifted types. Here is an example of using undefined as an unboxed, unlifted Int# in GHCi: > :set -XMagicHash > import GHC.Prim > import GHC.Exts > I# (undefined :: Int#) *** Exception: Prelude.undefined I've always thought of undefined as being the same ...	[ -0.00982666015625, 0.01287841796875, 0.025390625, -0.007171630859375, 0, 0.005218505859375, -0.0128173828125, -0.010009765625, -0.000583648681640625, 0.012451171875, 0.00408935546875, -0.03466796875, 0.013671875, 0.01708984375, -0.00457763671875, 0.0054931640625, 0.0303955078125, -...	[ 9232, 5983, 297, 5608, 4488, 2499, 28398, 6032, 4332, 254, 51, 104501, 52895, 27781, 17368, 11728, 360, 18, 4904, 527, 73265, 14, 3509, 1542, 54084, 1771, 6495, 1495, 24927, 145111, 19279, 933, 59437, 63928, 1914, 822, 112, 17569, 8035, 5...	[ 0.210693359375, 0.24169921875, 0.176513671875, 0.007415771484375, 0.12255859375, 0.044219970703125, 0.07305908203125, 0.1307373046875, 0.1363525390625, 0.179931640625, 0.1015625, 0.228271484375, 0.181640625, 0.09326171875, 0.04937744140625, 0.17822265625, 0.013336181640625, 0.05920...	embed
28857275_c1	28857275	haskell	1	module Syntax.Name and this module is compiled. It is not used in the test module though. I also tried turning the package into a library and having the test-suite build-depends on the library. The linker error proceeds. This is the Haskell Platform from OpenSuSE 13.1, GHC 7.8.3 which locks Cabal to 1.18.1.3. Code sig...	module Syntax.Name and this module is compiled. It is not used in the test module though. I also tried turning the package into a library and having the test-suite build-depends on the library. The linker error proceeds. This is the Haskell Platform from OpenSuSE 13.1, GHC 7.8.3 which locks Cabal to 1.18.1.3. Code sig...	[ 0.004241943359375, -0.001434326171875, -0.00897216796875, -0.0008544921875, -0.0076904296875, 0.0021820068359375, -0.0042724609375, 0.01019287109375, -0.01806640625, 0.0179443359375, -0.01904296875, -0.0279541015625, -0.0185546875, -0.006866455078125, 0.00762939453125, -0.0059204101562...	[ 88996, 19010, 86531, 163612, 903, 375, 5974, 297, 1650, 83, 959, 11814, 3034, 37842, 174548, 98169, 10, 35773, 68879, 13, 45367, 105254, 1294, 3126, 56, 18499, 172337, 20625, 142508, 70968, 13527, 14168, 9127, 5847, 418, 527, 73265, 361, 52...	[ 0.235595703125, 0.1212158203125, 0.2086181640625, 0.2210693359375, 0.046356201171875, 0.06610107421875, 0.1929931640625, 0.07037353515625, 0.01019287109375, 0.03692626953125, 0.103759765625, 0.1273193359375, 0.201171875, 0.023956298828125, 0.04266357421875, 0.1898193359375, 0.0032348...	embed
21650802_c0	21650802	haskell	0	Title: Error in list to tree Problem title: Error in list to tree Tags: tree, list, haskell Problem: Error in list to tree Consider the following type: data LTree a = Leaf a \| Fork (LTree a) (LTree a) build :: [(a,Int)] -> LTree a build l = fst (buildaccum 0 l)e I have a list and want to build a tree buildaccum :: Int ...	Error in list to tree Error in list to tree tree list haskell Error LTree Leaf Fork Couldn Error in list to tree Consider the following type: I have a list and want to build a tree In ghci, I get the following error: Can you spot the error, please?	[ 0.0191650390625, 0.000766754150390625, -0.01318359375, -0.01171875, 0.0140380859375, 0.02978515625, -0.044921875, -0.028076171875, 0.0074462890625, -0.0250244140625, 0.0260009765625, -0.00102996826171875, 0.0137939453125, 0.00384521484375, 0.00299072265625, 0.0025634765625, 0.0129394...	[ 212059, 23, 5303, 47, 53201, 1556, 142508, 107, 13, 636, 2407, 1326, 92, 191147, 19, 10644, 765, 3444, 45367, 31380, 318, 25632, 18499, 4171, 13162, 22936 ]	[ 0.2147216796875, 0.1212158203125, 0.21533203125, 0.2275390625, 0.25439453125, 0.10748291015625, 0.20654296875, 0.15576171875, 0.04644775390625, 0.054443359375, 0.1580810546875, 0.1478271484375, 0.11102294921875, 0.11236572265625, 0.031280517578125, 0.07513427734375, 0.037139892578125...	embed
46895199_c0	46895199	haskell	0	Title: No output will be generated because there is no Main module Problem title: No output will be generated because there is no Main module Tags: program-entry-point, haskell Problem: No output will be generated because there is no Main module I wrote a simple module called Test : module Test (main) where main = putS...	No output will be generated because there is no Main module No output will be generated because there is no Main module program-entry-point haskell Main Test Hello Test.hs Compiling Test.o No output will be generated because there is no Main module I wrote a simple module called Test : However, when i try to compile it...	[ -0.00543212890625, 0.021728515625, 0.005157470703125, 0.01251220703125, -0.012939453125, 0.0177001953125, 0.00439453125, -0.01318359375, -0.00848388671875, -0.00112152099609375, -0.014404296875, -0.031982421875, 0.00140380859375, -0.002899169921875, 0.002777099609375, -0.0098876953125,...	[ 438, 140992, 1221, 139392, 6637, 110, 12321, 88996, 1528, 33, 15123, 38496, 1556, 142508, 8647, 35378, 127, 15612, 49725, 31, 2685, 54397, 8781, 9790, 9969, 1340, 1829, 25632, 75101, 13315, 18499 ]	[ 0.1024169921875, 0.2353515625, 0.077392578125, 0.1771240234375, 0.0511474609375, 0.126708984375, 0.15771484375, 0.2467041015625, 0.081787109375, 0.005889892578125, 0.077880859375, 0.077392578125, 0.1329345703125, 0.197509765625, 0.253662109375, 0.104248046875, 0.0853271484375, 0.10...	embed
54732806_c0	54732806	haskell	0	Title: is this piece of haskell code correct, if so why? Problem title: is this piece of haskell code correct, if so why? Tags: haskell Problem: is this piece of haskell code correct, if so why? the haskell wiki (here : https://wiki.haskell.org/State_Monad ) says the state monad bind operator is defined like this : (>>...	is this piece of haskell code correct, if so why? is this piece of haskell code correct, if so why? haskell State act1 fact2 act2 is this piece of haskell code correct, if so why? the haskell wiki (here : https://wiki.haskell.org/State_Monad ) says the state monad bind operator is defined like this : however it seems i...	[ -0.0164794921875, 0.00074005126953125, 0.0108642578125, 0.01116943359375, 0.002410888671875, 0.016357421875, -0.00946044921875, -0.00138092041015625, 0.000385284423828125, -0.01287841796875, 0.0181884765625, 0.005706787109375, -0.011962890625, 0.006561279296875, -0.0113525390625, -0.00...	[ 83, 903, 63847, 1556, 142508, 18151, 26785, 15400, 22836, 27992, 418, 15824, 304, 111, 34356, 13691, 10557, 135206, 13, 46674, 712, 11341, 2667, 68557, 39933, 61924, 71, 1884, 49903, 37202, 214552, 16750, 32354, 137565, 20051, 23, 64549, 748,...	[ 0.06634521484375, 0.08355712890625, 0.1116943359375, 0.125244140625, 0.2108154296875, 0.1373291015625, 0.1837158203125, 0.092041015625, 0.161376953125, 0.123779296875, 0.053955078125, 0.138916015625, 0.0994873046875, 0.00714111328125, 0.070068359375, 0.0265350341796875, 0.07849121093...	embed
15552397_c0	15552397	haskell	0	Title: Tutorial on stochastic simulation in Haskell Problem title: Tutorial on stochastic simulation in Haskell Tags: stochastic, haskell, simulation, stochastic-process Problem: Tutorial on stochastic simulation in Haskell I'd like to use Haskell for stochastic simulation, but I don't know how. I've read Hutton's 'Pro...	Tutorial on stochastic simulation in Haskell Tutorial on stochastic simulation in Haskell stochastic haskell simulation stochastic-process Tutorial Haskell Tutorial on stochastic simulation in Haskell I'd like to use Haskell for stochastic simulation, but I don't know how. I've read Hutton's 'Programming in Haskell', a...	[ 0.003265380859375, 0.0220947265625, 0.0185546875, -0.00579833984375, -0.003875732421875, 0.0157470703125, 0.0125732421875, -0.01153564453125, -0.0111083984375, -0.04638671875, -0.0054931640625, 0.010009765625, -0.00762939453125, 0.007293701171875, 0.00933837890625, 0.0115966796875, -...	[ 183447, 98, 3474, 1436, 28692, 40226, 1363, 23, 20625, 142508, 1556, 63923, 1884, 4527, 100, 18, 3714, 3642, 12301, 97595, 1507, 172895, 104577, 32562, 72694, 48242, 123309, 103391, 4034, 5256, 12096, 23468, 222530, 46876, 627, 707, 17198, 50...	[ 0.2152099609375, 0.061370849609375, 0.1444091796875, 0.2012939453125, 0.111572265625, 0.2578125, 0.060882568359375, 0.0589599609375, 0.158203125, 0.266845703125, 0.1383056640625, 0.1043701171875, 0.07928466796875, 0.12451171875, 0.05377197265625, 0.0206451416015625, 0.069091796875, ...	embed
40183084_c0	40183084	haskell	0	Title: Is it possible to express the "type of functions that receive 2 nats and return their sum"? Problem title: Is it possible to express the "type of functions that receive 2 nats and return their sum"? Tags: dependent-type, agda, haskell, idris, types Problem: Is it possible to express the "type...	Is it possible to express the "type of functions that receive 2 nats and return their sum"? Is it possible to express the "type of functions that receive 2 nats and return their sum"? dependent-type agda haskell idris types CNat Type a:Type Is it possible to express the "type of functions that recei...	[ 0.002838134765625, 0.00933837890625, -0.001678466796875, 0.0250244140625, -0.005096435546875, -0.00787353515625, 0.01519775390625, 0.0008697509765625, 0.01361083984375, -0.044921875, 0.00007677078247070312, -0.01409912109375, -0.00823974609375, 0.00186920166015625, 0.00897216796875, 0....	[ 2071, 7722, 36510, 50986, 32354, 53299, 116, 24, 933, 30646, 10554, 108750, 1377, 85, 1556, 142508, 3679, 52895, 61658, 257, 60457, 10, 196707, 442, 450, 136, 2363, 6626, 1022, 113, 15700, 18, 97, 15190, 69112 ]	[ 0.01031494140625, 0.1690673828125, 0.2044677734375, 0.1895751953125, 0.1912841796875, 0.1300048828125, 0.1829833984375, 0.1617431640625, 0.13623046875, 0.17724609375, 0.193115234375, 0.15478515625, 0.010528564453125, 0.062103271484375, 0.06024169921875, 0.2149658203125, 0.11962890625...	embed
40334968_c0	40334968	haskell	0	Title: Nested guards on Haskell Problem title: Nested guards on Haskell Tags: haskell Problem: Nested guards on Haskell Haskell disallows the following style of nested guards although they look aesthetically natural and concise: x \| condition_1 \| condition_1_1 \| condition_1_1_1 = expression_1_1_1 \| ... \| ... \| ... I go...	Nested guards on Haskell Nested guards on Haskell haskell Nested Haskell condition_1 condition_1_1 condition_1_1_1 expression_1_1_1 Nested guards on Haskell Haskell disallows the following style of nested guards although they look aesthetically natural and concise: I got a few pointers e.g. 1 and 2 , but still can't he...	[ -0.0225830078125, 0.013916015625, 0.01239013671875, -0.01129150390625, 0.0250244140625, 0.011474609375, -0.0272216796875, -0.00946044921875, 0.01043701171875, -0.000732421875, 0.01611328125, -0.0206298828125, 0.00148773193359375, 0.0238037109375, 0.0078125, -0.007354736328125, 0.0012...	[ 28701, 71, 56050, 7, 20625, 142508, 1556, 35431, 115187, 125195, 98, 6392, 41566, 25632, 20623, 8512, 6713, 525, 1448, 6083, 158, 318, 6275, 26458, 52889, 15044, 6044, 22024, 6002, 102, 49086, 101087, 208124, 65508, 63323, 4935, 240456, 53894...	[ 0.247314453125, 0.1019287109375, 0.25634765625, 0.0662841796875, 0.14501953125, 0.2210693359375, 0.1383056640625, 0.16357421875, 0.0111083984375, 0.16357421875, 0.0062255859375, 0.088134765625, 0.1044921875, 0.02001953125, 0.17041015625, 0.231201171875, 0.1090087890625, 0.070129394...	embed
50059974_c0	50059974	haskell	0	Title: cross sum operation in Haskell Problem title: cross sum operation in Haskell Tags: math, haskell, recursion Problem: cross sum operation in Haskell I need to determine a recursive function crosssum :: Int -> Int in Haskell to calculate the cross sum of positive numbers. I am not allowed to use any functions from...	cross sum operation in Haskell cross sum operation in Haskell math haskell recursion Haskell cross sum operation in Haskell I need to determine a recursive function crosssum :: Int -> Int in Haskell to calculate the cross sum of positive numbers. I am not allowed to use any functions from the hierarchical library besid...	[ -0.0240478515625, 0.035888671875, 0.023193359375, -0.01409912109375, 0.0067138671875, 0.0027313232421875, -0.0186767578125, -0.00011730194091796875, -0.001007080078125, -0.0162353515625, 0.00567626953125, -0.03076171875, -0.0023040771484375, 0.017822265625, 0.0081787109375, 0.010070800...	[ 41421, 10554, 41018, 23, 20625, 142508, 48909, 1556, 195625, 1830, 3871, 83324, 5844, 32354, 11832, 1984, 360, 18, 33079, 74481, 24491, 101935, 959, 107003, 4527, 1295, 1791, 54689, 35773, 30338, 12, 2740, 37223, 16093, 18221, 2811, 1230, 183...	[ 0.21337890625, 0.2548828125, 0.1785888671875, 0.07476806640625, 0.15625, 0.2459716796875, 0.093994140625, 0.1397705078125, 0.160888671875, 0.005462646484375, 0.0465087890625, 0.084228515625, 0.09906005859375, 0.152587890625, 0.25830078125, 0.05780029296875, 0.09796142578125, 0.1296...	embed
53788045_c0	53788045	haskell	0	Title: Using a lens over something that isn't a functor Problem title: Using a lens over something that isn't a functor Tags: haskell, haskell-lens Problem: Using a lens over something that isn't a functor I have a lens(') myLens' :: (Functor f) => (a -> f a) -> (s -> f s) And I need a function lensWithoutFun...	Using a lens over something that isn't a functor Using a lens over something that isn't a functor haskell haskell-lens Using Functor PopType Maybe Using a lens over something that isn't a functor I have a lens(') And I need a function (The particular type I'm interested in is which could be made into a Functo...	[ 0.001922607421875, 0.0020904541015625, -0.01336669921875, -0.00653076171875, 0.0078125, 0.00970458984375, -0.006744384765625, -0.024658203125, -0.009033203125, -0.033447265625, 0.0076904296875, 0.0037078857421875, -0.0172119140625, -0.0157470703125, 0.0162353515625, -0.0152587890625, ...	[ 345, 6953, 3098, 7, 645, 9844, 56112, 3768, 18, 7477, 18770, 10, 450, 1556, 142508, 1977, 28670, 11584, 196707, 83425, 765, 25, 3871, 32354, 17311, 10644, 60892, 5809, 7228, 3934, 2174, 36663, 11522, 3917, 54, 903, 3789, 28282, 197648, 35...	[ 0.1087646484375, 0.0556640625, 0.20849609375, 0.1180419921875, 0.142333984375, 0.0721435546875, 0.11767578125, 0.0655517578125, 0.11865234375, 0.1533203125, 0.2381591796875, 0.05694580078125, 0.01776123046875, 0.1201171875, 0.2249755859375, 0.183349609375, 0.1962890625, 0.191162109...	embed
27076491_c0	27076491	haskell	0	Title: Aeson: parse enumerated data types Problem title: Aeson: parse enumerated data types Tags: haskell, aeson, json Problem: Aeson: parse enumerated data types How can I declare an instance of FromJSON of the following data type: data Privacy = Everyone \| AllFriends \| FriendsOfFriends \| Self So that the following st...	Aeson: parse enumerated data types Aeson: parse enumerated data types haskell aeson json Aeson Privacy Everyone AllFriends FriendsOfFriends ALL_FRIENDS FRIENDS_OF_FRIENDS Parsing Aeson: parse enumerated data types How can I declare an instance of FromJSON of the following data type: So that the following string to enum...	[ -0.005218505859375, 0.00830078125, -0.00933837890625, 0.043701171875, -0.0059814453125, 0.0033111572265625, -0.005706787109375, 0.0078125, -0.01080322265625, -0.004302978515625, 0.005462646484375, -0.0130615234375, 0.0086669921875, 0.01953125, -0.00830078125, 0.0179443359375, 0.01483...	[ 62, 90, 191, 12, 366, 184, 189085, 3674, 2053, 52895, 1556, 142508, 10, 1647, 1681, 104909, 191096, 3164, 919, 21347, 6468, 102517, 132887, 58837, 46290, 48057, 13526, 172837, 39015, 294, 82341, 2392, 6953, 831, 87, 159978, 142, 110527, 280...	[ 0.1219482421875, 0.1278076171875, 0.19287109375, 0.04083251953125, 0.158447265625, 0.06634521484375, 0.2235107421875, 0.09307861328125, 0.1412353515625, 0.2183837890625, 0.0924072265625, 0.2022705078125, 0.0703125, 0.0933837890625, 0.17919921875, 0.2034912109375, 0.161865234375, 0....	embed
61243217_c0	61243217	haskell	0	Title: Haskell: Typeclass vs passing a function Problem title: Haskell: Typeclass vs passing a function Tags: functional-programming, higher-order-functions, haskell Problem: Haskell: Typeclass vs passing a function To me it seems that you can always pass function arguments rather than using a typeclass. For example ra...	Haskell: Typeclass vs passing a function Haskell: Typeclass vs passing a function functional-programming higher-order-functions haskell Haskell Typeclass Bool Haskell: Typeclass vs passing a function To me it seems that you can always pass function arguments rather than using a typeclass. For example rather than defini...	[ 0.01080322265625, 0.0159912109375, 0.0010986328125, -0.00341796875, 0.005859375, 0.0125732421875, 0.00188446044921875, -0.0113525390625, -0.0213623046875, -0.03955078125, 0.00506591796875, -0.00689697265625, -0.01324462890625, -0.004913330078125, -0.0037841796875, -0.01458740234375, ...	[ 20625, 142508, 60457, 67413, 20209, 452, 32354, 6953, 123309, 28966, 77546, 80596, 137175, 1556, 2460, 929, 163, 37202, 831, 11343, 27875, 10750, 43257, 17368, 10644, 13204, 161789, 117414, 110527, 864, 4171, 61924, 88, 195, 15490, 12447 ]	[ 0.08929443359375, 0.224609375, 0.208251953125, 0.27685546875, 0.0980224609375, 0.10198974609375, 0.1815185546875, 0.0232391357421875, 0.107666015625, 0.003326416015625, 0.000701904296875, 0.05926513671875, 0.09375, 0.049285888671875, 0.012969970703125, 0.092041015625, 0.0110473632812...	embed
10087945_c0	10087945	haskell	0	Title: Piping data between two network sockets on Windows Problem title: Piping data between two network sockets on Windows Tags: haskell, network-programming, sockets, windows Problem: Piping data between two network sockets on Windows Given two network sockets, what is the most efficient way to pipe data from one to ...	Piping data between two network sockets on Windows Piping data between two network sockets on Windows haskell network-programming sockets windows Piping Windows Piping data between two network sockets on Windows Given two network sockets, what is the most efficient way to pipe data from one to the other without touchin...	[ -0.0035858154296875, 0.0306396484375, -0.0142822265625, 0.01470947265625, -0.00775146484375, 0.00098419189453125, -0.0205078125, -0.0257568359375, -0.0098876953125, -0.0128173828125, 0.009033203125, 0.0179443359375, 0.0218505859375, 0.005859375, 0.00970458984375, 0.0006256103515625, ...	[ 93128, 214, 2053, 17721, 6626, 33120, 221, 27853, 3773, 1556, 142508, 28966, 54825, 2684, 93766, 3917, 47, 137158, 1295, 1632, 3789, 15490, 23996, 10941, 2499, 16751, 11782, 61687, 111240, 188, 991, 2147, 10366, 77924, 583, 32628, 21373, 5213...	[ 0.2132568359375, 0.127685546875, 0.190673828125, 0.1434326171875, 0.1728515625, 0.135986328125, 0.121826171875, 0.212890625, 0.2100830078125, 0.1351318359375, 0.231201171875, 0.0828857421875, 0.1546630859375, 0.06256103515625, 0.17724609375, 0.06219482421875, 0.157470703125, 0.2595...	embed
34096394_c2	34096394	haskell	2	14, "optionValue": "14" } ] } ] } and here is my code so far: CODE {-# LANGUAGE OverloadedStrings #-} import Data.Aeson import Control.Applicative import qualified Data.ByteString.Lazy.Char8 as BS jsonFile :: FilePath jsonFile = "test.json" getJSON :: IO BS.ByteString getJSON = Code signals: Data.Aeson, Control.Applica...	14, "optionValue": "14" } ] } ] } and here is my code so far: CODE {-# LANGUAGE OverloadedStrings #-} import Data.Aeson import Control.Applicative import qualified Data.ByteString.Lazy.Char8 as BS jsonFile :: FilePath jsonFile = "test.json" getJSON :: IO BS.ByteString getJSON = Code signals: Data.Aeson, Control.Applica...	[ 0.018798828125, 0.0130615234375, -0.00151824951171875, 0.0069580078125, -0.012939453125, 0.00787353515625, 0.0028533935546875, 0.00830078125, -0.0020751953125, 0.03466796875, 0.00153350830078125, 0.0089111328125, -0.009033203125, -0.0274658203125, 0.01214599609375, 0.0118408203125, 0...	[ 616, 109585, 856, 50770, 58, 2592, 136, 3688, 83, 759, 18151, 221, 2060, 12, 8244, 8399, 3358, 98064, 75930, 9578, 63033, 297, 71713, 5180, 24927, 11809, 5, 284, 90, 191, 27131, 39179, 11048, 4935, 217225, 75358, 67, 214, 2729, 3285, 84...	[ 0.1942138671875, 0.25830078125, 0.1256103515625, 0.1873779296875, 0.01300048828125, 0.1796875, 0.03204345703125, 0.119384765625, 0.0823974609375, 0.1265869140625, 0.251220703125, 0.056060791015625, 0.1470947265625, 0.011566162109375, 0.1982421875, 0.1370849609375, 0.05426025390625, ...	embed
35658802_c0	35658802	haskell	0	Title: How do I transform a pattern on booleans to an if condition? Problem title: How do I transform a pattern on booleans to an if condition? Tags: boolean, haskell, if-statement Problem: How do I transform a pattern on booleans to an if condition? I'm new to Haskell and I'm trying to transform the pattern matching b...	How do I transform a pattern on booleans to an if condition? How do I transform a pattern on booleans to an if condition? boolean haskell if-statement How Bool myOr2 Then How do I transform a pattern on booleans to an if condition? I'm new to Haskell and I'm trying to transform the pattern matching below to an if condi...	[ -0.005767822265625, 0.006561279296875, 0.0017547607421875, 0.0084228515625, 0.01611328125, 0.0164794921875, 0.00360107421875, -0.0023651123046875, -0.0034027099609375, 0.00811767578125, 0.006072998046875, -0.00001823902130126953, -0.0028228759765625, 0.004180908203125, 0.0172119140625, ...	[ 11249, 54, 87, 27198, 10, 103510, 98, 337, 16836, 10133, 47, 142, 2174, 35431, 31, 34677, 1556, 142508, 61340, 2460, 929, 759, 19060, 304, 47009, 3525, 20625, 31577, 14858, 35064, 1257, 678, 1284, 22027, 18, 3853, 9969, 1340, 5351, 20594,...	[ 0.0859375, 0.047119140625, 0.047088623046875, 0.219482421875, 0.044708251953125, 0.271728515625, 0.0767822265625, 0.08154296875, 0.1619873046875, 0.1566162109375, 0.09490966796875, 0.0775146484375, 0.261474609375, 0.25537109375, 0.081787109375, 0.12841796875, 0.12353515625, 0.22143...	embed
18220246_c0	18220246	haskell	0	Title: Type-Pathway in Defining Bind for the List Monad Problem title: Type-Pathway in Defining Bind for the List Monad Tags: haskell Problem: Type-Pathway in Defining Bind for the List Monad In the text Learn You A Haskell , the list monad is defined like so: instance Monad [] where return x = [x] xs >>= f = concat (m...	Type-Pathway in Defining Bind for the List Monad Type-Pathway in Defining Bind for the List Monad haskell Type-Pathway Defining Bind List Monad Type-Pathway in Defining Bind for the List Monad In the text Learn You A Haskell , the list monad is defined like so: Since the bind operator is supposed to convert list-values...	[ -0.014892578125, 0.0108642578125, 0.00408935546875, 0.018798828125, -0.000797271728515625, 0.003021240234375, -0.0034027099609375, 0.00102996826171875, 0.0133056640625, 0.00946044921875, -0.00007581710815429688, -0.04345703125, -0.003143310546875, 0.01202392578125, -0.0020751953125, 0....	[ 60457, 683, 10519, 7514, 88606, 16666, 71, 100, 32036, 60331, 23, 1556, 142508, 449, 7986, 134031, 2583, 20625, 70, 5303, 2667, 712, 61924, 1884, 221, 68557, 39933, 134598, 96760, 27494, 3934, 3059, 158, 4460, 85247, 135355, 7432, 80934, 10...	[ 0.213623046875, 0.054534912109375, 0.10552978515625, 0.1624755859375, 0.1514892578125, 0.218017578125, 0.1170654296875, 0.028167724609375, 0.1700439453125, 0.1910400390625, 0.000152587890625, 0.08441162109375, 0.2490234375, 0.016510009765625, 0.010772705078125, 0.05389404296875, 0.05...	embed
4988598_c0	4988598	haskell	0	Title: How can I run my haskell functions through Java Problem title: How can I run my haskell functions through Java Tags: java, haskell Problem: How can I run my haskell functions through Java Lets say I have a haskell function add in math.hs How can I run the add function through a Java program and store the output ...	How can I run my haskell functions through Java How can I run my haskell functions through Java java haskell file How Java math.hs How can I run my haskell functions through Java Lets say I have a haskell function add in math.hs How can I run the add function through a Java program and store the output as a variable? M...	[ 0.0086669921875, -0.0019378662109375, -0.00128936767578125, 0.00994873046875, 0.000823974609375, 0.029052734375, 0.00002467632293701172, 0.0093994140625, -0.00970458984375, -0.045166015625, 0.007354736328125, -0.00335693359375, -0.0155029296875, -0.007720947265625, 0.006103515625, -0.0...	[ 11249, 831, 11675, 759, 1556, 142508, 32354, 7, 8305, 41925, 87, 79, 330, 11435, 48909, 127, 15190, 5, 1528, 4343, 140992, 237, 10, 77336, 25632, 56065, 17203, 36746, 31, 29481, 56, 979, 71924, 5201, 46480 ]	[ 0.07733154296875, 0.1085205078125, 0.158935546875, 0.0838623046875, 0.1751708984375, 0.27880859375, 0.2142333984375, 0.0767822265625, 0.158203125, 0.255859375, 0.00994873046875, 0.1124267578125, 0.1746826171875, 0.10577392578125, 0.20947265625, 0.1470947265625, 0.1707763671875, 0.0...	embed
20908056_c0	20908056	haskell	0	Title: How to use IOArray in Haskell records? Problem title: How to use IOArray in Haskell records? Tags: arrays, haskell, record Problem: How to use IOArray in Haskell records? I'm trying to adapt the example code from haskell.org but cant seem to get it to work. http://www.haskell.org/haskellwiki/Arrays#Mutable_IO_ar...	How to use IOArray in Haskell records? How to use IOArray in Haskell records? arrays haskell record Data.Array.IO How IOArray Haskell SomeData Float How to use IOArray in Haskell records? I'm trying to adapt the example code from haskell.org but cant seem to get it to work. http://www.haskell.org/haskellwiki/Arrays#Mut...	[ -0.00823974609375, -0.008544921875, -0.0084228515625, 0.00640869140625, 0.00799560546875, 0.006988525390625, 0.002227783203125, 0.00009775161743164062, 0.0059814453125, 0.01397705078125, 0.0021820068359375, -0.018310546875, 0.00726318359375, -0.0167236328125, 0.0198974609375, -0.029418...	[ 11249, 47, 4527, 87, 44593, 42, 7092, 23, 20625, 142508, 115923, 32, 10298, 4778, 1556, 17164, 11809, 7614, 17780, 31384, 137989, 38699, 257, 39908, 27781, 18151, 1478, 45767, 48903, 4488, 10557, 13691, 10685, 22819, 19305, 3882, 83279, 4235 ...	[ 0.10040283203125, 0.0523681640625, 0.1424560546875, 0.144287109375, 0.166748046875, 0.111572265625, 0.28515625, 0.0625, 0.1474609375, 0.24462890625, 0.198486328125, 0.006866455078125, 0.131103515625, 0.06298828125, 0.124755859375, 0.16015625, 0.06146240234375, 0.104736328125, 0.1...	embed
43193602_c1	43193602	haskell	1	1))(A(2))) println(Instance.Instance.toStr(A(1))(A("bla"))) // this compiles, but it should not } How can I define override def toStr: A[_] =>A[_] => String = x => x=> "AA" such that println(Instance.Instance.toStr(A(1))(A("bla"))) does not compile ? As it ( putStrLn $ "bla " ++ (toStr (A 1) (A "String")) ) does not co...	1))(A(2))) println(Instance.Instance.toStr(A(1))(A("bla"))) // this compiles, but it should not } How can I define override def toStr: A[_] =>A[_] => String = x => x=> "AA" such that println(Instance.Instance.toStr(A(1))(A("bla"))) does not compile ? As it ( putStrLn $ "bla " ++ (toStr (A 1) (A "String")) ) does not co...	[ -0.00433349609375, -0.0038909912109375, 0.00482177734375, 0.0198974609375, 0.0068359375, 0.00689697265625, 0.0113525390625, -0.00360107421875, 0.0162353515625, -0.005035400390625, -0.0269775390625, -0.02001953125, 0.01129150390625, 0.00286865234375, 0.00433349609375, -0.0224609375, 0...	[ 4879, 51421, 284, 40970, 28412, 19, 116071, 188, 71713, 27750, 7119, 903, 9969, 1340, 1284, 5608, 959, 61924, 645, 416, 112, 8, 420, 47, 62, 454, 23351, 214, 1022, 15467, 141, 14602, 3884, 3650, 37223, 20625, 142508, 18151, 81887, 618, ...	[ 0.06512451171875, 0.046478271484375, 0.1009521484375, 0.07037353515625, 0.118408203125, 0.065673828125, 0.1341552734375, 0.14794921875, 0.231201171875, 0.05072021484375, 0.17626953125, 0.006866455078125, 0.1580810546875, 0.1700439453125, 0.002105712890625, 0.07366943359375, 0.1145019...	embed
48488178_c0	48488178	haskell	0	Title: Can Nullable be used as a functor in C#? Problem title: Can Nullable be used as a functor in C#? Tags: haskell, functor, functional-programming, c%23, nullable Problem: Can Nullable be used as a functor in C#? Consider the following code in C#. public int Foo(int a) { // ... } // in some other method int? x = 0;...	Can Nullable be used as a functor in C#? Can Nullable be used as a functor in C#? haskell functor functional-programming c%23 nullable Can Nullable Foo Maybe Functor Can Nullable be used as a functor in C#? Consider the following code in C#. The last line will return a compilation error cannot convert from 'int?' to 'i...	[ 0.003662109375, 0.001068115234375, 0.02734375, -0.0033416748046875, 0.0106201171875, 0.0022735595703125, 0.004791259765625, -0.0107421875, 0.01544189453125, -0.0025634765625, -0.0185546875, -0.01446533203125, -0.0103759765625, 0.0201416015625, -0.0074462890625, -0.01434326171875, 0.0...	[ 4171, 27786, 2661, 11814, 237, 10, 7477, 18770, 23, 313, 4904, 1556, 142508, 123309, 28966, 501, 3742, 9229, 9572, 31, 83425, 28670, 186, 137399, 25632, 18151, 4568, 13315, 30646, 98352, 18499, 53418, 96760, 1295, 4288, 32, 44075, 20174, 20...	[ 0.09259033203125, 0.2396240234375, 0.280517578125, 0.1796875, 0.100341796875, 0.0924072265625, 0.2047119140625, 0.2181396484375, 0.08917236328125, 0.094482421875, 0.228271484375, 0.0760498046875, 0.20556640625, 0.142578125, 0.049041748046875, 0.035980224609375, 0.066162109375, 0.19...	embed
54645038_c0	54645038	haskell	0	Title: Haskell, traversable getting values from Maybe [list] Problem title: Haskell, traversable getting values from Maybe [list] Tags: list, option-type, pattern-matching, haskell Problem: Haskell, traversable getting values from Maybe [list] Found the need for using Traversable . It returned a list like this generate...	Haskell, traversable getting values from Maybe [list] Haskell, traversable getting values from Maybe [list] list option-type pattern-matching haskell Maybe Haskell Traversable Just Nothing Haskell, traversable getting values from Maybe [list] Found the need for using Traversable . It returned a list like this generates...	[ -0.0028076171875, -0.0027618408203125, -0.00811767578125, -0.00653076171875, 0.006683349609375, 0.000637054443359375, 0.00628662109375, 0.010009765625, 0.0174560546875, -0.010009765625, 0.0152587890625, 0.0015716552734375, 0.01025390625, -0.003082275390625, 0.0027008056640625, 0.012634...	[ 20625, 142508, 37317, 2886, 20949, 142424, 1295, 83425, 6562, 4, 5303, 35829, 50986, 103510, 98753, 1556, 4937, 7864, 9563, 182747, 215624, 3871, 17368, 176377, 10, 1884, 903, 139392, 1238, 4332, 2424, 154663, 2203, 304, 617, 3559, 3714, 3642...	[ 0.1451416015625, 0.2286376953125, 0.2255859375, 0.236328125, 0.1016845703125, 0.1719970703125, 0.096435546875, 0.33935546875, 0.224609375, 0.003509521484375, 0.1982421875, 0.1905517578125, 0.1207275390625, 0.2188720703125, 0.26513671875, 0.1441650390625, 0.1455078125, 0.20056152343...	embed
57489844_c0	57489844	haskell	0	Title: How does readIORef work: creates copy or it does not? Problem title: How does readIORef work: creates copy or it does not? Tags: ioref, do-notation, immutability, io-monad, haskell Problem: How does readIORef work: creates copy or it does not? What exactly does this code do? Is someMap a copy of the object (of :...	How does readIORef work: creates copy or it does not? How does readIORef work: creates copy or it does not? ioref do-notation immutability io-monad haskell How Data.Map.Strict.Map How does readIORef work: creates copy or it does not? What exactly does this code do? Is someMap a copy of the object (of ::Data.Map.Strict....	[ 0.000385284423828125, 0.0089111328125, 0.00469970703125, 0.00347900390625, -0.01409912109375, -0.00518798828125, 0.01251220703125, 0.010498046875, 0.0069580078125, -0.01708984375, 0.0247802734375, -0.0150146484375, 0.0162353515625, 0.00909423828125, 0.021240234375, -0.0026397705078125,...	[ 11249, 14602, 12301, 123435, 4240, 4488, 28282, 43658, 959, 22995, 29087, 54, 157, 22062, 14311, 41159, 3796, 712, 1556, 142508, 11809, 166179, 62233, 18, 707, 4865, 66161, 18151, 3060, 10, 36746, 137989, 15005, 759, 91067, 15549, 86997, 313,...	[ 0.04241943359375, 0.03594970703125, 0.1688232421875, 0.1259765625, 0.2379150390625, 0.1341552734375, 0.13232421875, 0.19921875, 0.0994873046875, 0.165771484375, 0.280029296875, 0.037261962890625, 0.0948486328125, 0.036407470703125, 0.1103515625, 0.015869140625, 0.034271240234375, 0...	embed
14109562_c0	14109562	haskell	0	Title: Parsing XML into records Problem title: Parsing XML into records Tags: xml, haskell Problem: Parsing XML into records I’d like to write a Haskell library to work with a web service API. I get an XML or JSON response from the server, say it looks like this: <foo> <bar>1</bar> <baz>moo</baz> </foo> I want to turn ...	Parsing XML into records Parsing XML into records xml haskell Parsing XML Foo Integer Parsing XML into records I’d like to write a Haskell library to work with a web service API. I get an XML or JSON response from the server, say it looks like this: I want to turn it into a record: How can I abstract this so that I don...	[ -0.0078125, 0.0185546875, 0.0093994140625, -0.004425048828125, 0.00909423828125, 0.0308837890625, -0.01519775390625, -0.007171630859375, -0.006988525390625, 0.000904083251953125, -0.01177978515625, -0.042724609375, -0.0111083984375, 0.00701904296875, 0.002166748046875, -0.0103149414062...	[ 2392, 6953, 92537, 3934, 115923, 131492, 1556, 142508, 9572, 31, 44401, 1884, 33022, 20625, 35773, 1294, 4488, 678, 1467, 4516, 61687, 2046, 707, 821, 58627, 57553, 10723, 33342, 903, 3444, 47, 15504, 10, 17164, 11249, 831, 164789, 23009, 3...	[ 0.17138671875, 0.09832763671875, 0.2939453125, 0.2127685546875, 0.270263671875, 0.2401123046875, 0.1334228515625, 0.224609375, 0.1578369140625, 0.1263427734375, 0.1981201171875, 0.097900390625, 0.0924072265625, 0.1258544921875, 0.15771484375, 0.0845947265625, 0.057220458984375, 0.0...	embed
14224904_c0	14224904	haskell	0	Title: Haskell Eq definition realizing a result Problem title: Haskell Eq definition realizing a result Tags: typeclass, haskell Problem: Haskell Eq definition realizing a result I was reading the definition for the Eq typeclass in the Data library, and I'm confused. At what point is it realized that two values are equ...	Haskell Eq definition realizing a result Haskell Eq definition realizing a result typeclass haskell Haskell Bool Haskell Eq definition realizing a result I was reading the definition for the Eq typeclass in the Data library, and I'm confused. At what point is it realized that two values are equal or not equal. From wha...	[ 0.0216064453125, 0.01177978515625, 0.01470947265625, 0.017822265625, 0.02587890625, 0.01324462890625, -0.00035858154296875, -0.011962890625, 0.0023040771484375, 0.0400390625, -0.00299072265625, -0.02490234375, 0.0021209716796875, 0.006256103515625, 0.0042724609375, 0.006866455078125, ...	[ 20625, 142508, 241, 864, 80934, 14823, 214, 10, 16750, 10644, 67413, 1556, 2460, 929, 16454, 11809, 35773, 55681, 6275, 442, 185171, 450, 6626, 142424, 621, 105950, 707, 959, 1884, 2806, 1660, 11782, 12638, 3789, 606, 54241, 316, 1650, 6192...	[ 0.1485595703125, 0.243408203125, 0.110595703125, 0.28466796875, 0.1689453125, 0.282958984375, 0.10565185546875, 0.054962158203125, 0.25048828125, 0.1541748046875, 0.2037353515625, 0.1163330078125, 0.1453857421875, 0.250244140625, 0.0218048095703125, 0.044158935546875, 0.065185546875,...	embed
23259718_c0	23259718	haskell	0	Title: Haskell, passing a function to filter in one line? Problem title: Haskell, passing a function to filter in one line? Tags: haskell Problem: Haskell, passing a function to filter in one line? I want to filter everything that is not divisible by 3 from a list in Haskell, this is technically what I want to do filte...	Haskell, passing a function to filter in one line? Haskell, passing a function to filter in one line? haskell Haskell Haskell, passing a function to filter in one line? I want to filter everything that is not divisible by 3 from a list in Haskell, this is technically what I want to do The problem is, mod x 3 won't retu...	[ -0.0098876953125, 0.0224609375, 0.006500244140625, -0.02880859375, 0.022216796875, 0.00543212890625, 0.006988525390625, -0.0185546875, 0.00848388671875, -0.03125, -0.00008440017700195312, -0.00150299072265625, 0.000762939453125, -0.003265380859375, -0.024658203125, -0.011474609375, 0...	[ 20625, 142508, 452, 6953, 32354, 47, 46312, 23, 1632, 13315, 1556, 3444, 26818, 83, 959, 45, 99017, 390, 138, 1295, 5303, 121392, 2967, 2811, 1022, 23742, 18, 30646, 337, 31, 34677, 34292, 3917, 168861, 9709, 46572, 9077, 7722, 11814, 691...	[ 0.1434326171875, 0.2425537109375, 0.07611083984375, 0.036376953125, 0.2137451171875, 0.0204620361328125, 0.25244140625, 0.058685302734375, 0.124755859375, 0.162841796875, 0.1259765625, 0.087646484375, 0.09149169921875, 0.011322021484375, 0.07763671875, 0.038330078125, 0.1522216796875...	embed
20027707_c0	20027707	haskell	0	Title: What is a Combinator in Haskell Problem title: What is a Combinator in Haskell Tags: combinators, haskell Problem: What is a Combinator in Haskell In Real World Haskell , they describe combinators like this: In Haskell, we refer to functions that take other functions as arguments and return new functions as comb...	What is a Combinator in Haskell What is a Combinator in Haskell combinators haskell What Combinator Haskell Maybe What is a Combinator in Haskell In Real World Haskell , they describe combinators like this: And then later they state that maybeIO function is a combinator and its type signature looks like this: But all I...	[ -0.0184326171875, -0.003082275390625, 0.01177978515625, 0.01104736328125, 0.0289306640625, 0.0272216796875, 0.00020313262939453125, -0.0004367828369140625, -0.0059814453125, -0.00885009765625, -0.02294921875, -0.0257568359375, 0.00701904296875, 0.0018463134765625, 0.005706787109375, -0...	[ 4865, 83, 10, 106935, 19, 4597, 23, 20625, 142508, 22321, 22230, 1556, 83425, 5120, 6661, 98363, 1884, 903, 7068, 14432, 11341, 51139, 17780, 32354, 1290, 10644, 138256, 33342, 756, 1957, 51776, 34292, 137565, 20051, 2667, 712, 30646, 3642, ...	[ 0.1207275390625, 0.118408203125, 0.1341552734375, 0.257568359375, 0.2275390625, 0.25732421875, 0.1214599609375, 0.1649169921875, 0.2724609375, 0.278076171875, 0.196533203125, 0.1502685546875, 0.2020263671875, 0.1146240234375, 0.0997314453125, 0.1092529296875, 0.08062744140625, 0.04...	embed
47068188_c0	47068188	haskell	0	Title: How do I use ReadFile with getContents in do? Problem title: How do I use ReadFile with getContents in do? Tags: haskell Problem: How do I use ReadFile with getContents in do? I've been trying to take a user input string and read a dictionary into my main loop but whenever I try to check if my string is in the d...	How do I use ReadFile with getContents in do? How do I use ReadFile with getContents in do? haskell How ReadFile How do I use ReadFile with getContents in do? I've been trying to take a user input string and read a dictionary into my main loop but whenever I try to check if my string is in the dictionary, I get a false...	[ 0.00628662109375, 0.005615234375, 0.0033721923828125, -0.001007080078125, -0.00958251953125, 0.0159912109375, 0.036865234375, -0.006591796875, -0.01031494140625, -0.0264892578125, 0.01495361328125, -0.01409912109375, -0.0238037109375, -0.01226806640625, 0.00921630859375, 0.004058837890...	[ 11249, 4527, 4764, 174350, 678, 2046, 11935, 25352, 7, 23, 54, 1556, 142508, 31577, 5646, 38937, 107730, 79315, 136, 12301, 45, 10763, 6635, 3934, 5201, 40956, 217684, 12765, 2174, 83, 98320, 30646, 77947, 48225, 11435, 5701, 1733 ]	[ 0.041595458984375, 0.09716796875, 0.22021484375, 0.269775390625, 0.1011962890625, 0.119140625, 0.08428955078125, 0.1729736328125, 0.03863525390625, 0.0556640625, 0.1405029296875, 0.1024169921875, 0.1832275390625, 0.025177001953125, 0.0450439453125, 0.1043701171875, 0.127197265625, ...	embed
56852668_c0	56852668	haskell	0	Title: Unable to create a type-level list with a single element Problem title: Unable to create a type-level list with a single element Tags: haskell, data-kinds Problem: Unable to create a type-level list with a single element I'm scratching my head with the following behaviour. Is there an obvious reason why this is ...	Unable to create a type-level list with a single element Unable to create a type-level list with a single element haskell data-kinds Unable Prelude XDataKinds Bool Expected Unable to create a type-level list with a single element I'm scratching my head with the following behaviour. Is there an obvious reason why this i...	[ 0.0059814453125, 0.00762939453125, -0.01141357421875, 0.000720977783203125, 0.004852294921875, -0.003814697265625, -0.0174560546875, 0.00014400482177734375, -0.0003261566162109375, -0.007415771484375, -0.00518798828125, -0.035888671875, 0.0024566650390625, -0.005706787109375, -0.01385498...	[ 992, 2886, 28282, 10644, 67919, 5303, 678, 11001, 12830, 1556, 142508, 2053, 68347, 1914, 822, 112, 1193, 137989, 605, 7250, 2460, 929, 60075, 13, 206597, 10336, 25632, 224833, 162520, 31635, 7225, 527, 73265, 3217, 158406, 54608 ]	[ 0.03961181640625, 0.1439208984375, 0.1572265625, 0.2052001953125, 0.231201171875, 0.1968994140625, 0.050384521484375, 0.138916015625, 0.181396484375, 0.111572265625, 0.2103271484375, 0.0875244140625, 0.1591796875, 0.044403076171875, 0.128173828125, 0.034942626953125, 0.062744140625, ...	embed
33720858_c0	33720858	haskell	0	Title: Position of elements Problem title: Position of elements Tags: haskell Problem: Position of elements the function should give me the position of the searched elements. e. : index 'b' "dfbhjbd" -> [3,6] I've got so far: index b (x:xs) = length ( takeWhile ( /= b) xs ) but takeWhile will immediately stop after fin...	Position of elements Position of elements haskell Position x:xs x:tak Position of elements the function should give me the position of the searched elements. e. : index 'b' "dfbhjbd" -> [3,6] I've got so far: index b (x:xs) = length ( takeWhile ( /= b) xs ) but takeWhile will immediately stop after finding the matching...	[ 0.01385498046875, 0.0196533203125, -0.002105712890625, -0.000125885009765625, -0.0201416015625, 0.029052734375, 0.01129150390625, 0.00213623046875, 0.0308837890625, -0.0205078125, 0.008056640625, -0.001129150390625, 0.00860595703125, 0.01611328125, -0.006011962890625, -0.00074768066406...	[ 99428, 111, 80854, 1556, 142508, 1022, 12, 425, 7, 1865, 32354, 5608, 8337, 163, 70, 19069, 33938, 297, 28, 63262, 275, 420, 5871, 170, 34145, 33079, 122101, 910, 2060, 876, 2203, 140909, 5646, 979, 133, 248, 1369, 1284, 1456, 109312, 7...	[ 0.2388916015625, 0.150146484375, 0.2144775390625, 0.15185546875, 0.2301025390625, 0.0732421875, 0.03564453125, 0.1156005859375, 0.081298828125, 0.17578125, 0.1844482421875, 0.09259033203125, 0.0758056640625, 0.0518798828125, 0.0253143310546875, 0.2164306640625, 0.1951904296875, 0.0...	embed
26394199_c0	26394199	haskell	0	Title: Using TemplateHaskell to list all names in a namespace Problem title: Using TemplateHaskell to list all names in a namespace Tags: haskell, template-haskell Problem: Using TemplateHaskell to list all names in a namespace I want a TemplateHaskell function variablesInScope :: Q [Name] that returns a list of the Na...	Using TemplateHaskell to list all names in a namespace Using TemplateHaskell to list all names in a namespace haskell template-haskell Using TemplateHaskell Name Info Maybe Using TemplateHaskell to list all names in a namespace I want a TemplateHaskell function variablesInScope :: Q [Name] that returns a list of the Na...	[ 0.0135498046875, -0.01123046875, 0.00811767578125, 0.02294921875, 0.0072021484375, 0.0068359375, 0.0002727508544921875, -0.00099945068359375, -0.01318359375, -0.0390625, 0.0089111328125, -0.0108642578125, 0.0030059814453125, -0.0057373046875, 0.019287109375, 0.02099609375, -0.0096435...	[ 345, 196631, 6495, 7, 142508, 5303, 756, 123055, 210716, 23, 1556, 110934, 10557, 15757, 14048, 83425, 3444, 32354, 77336, 4153, 61278, 61122, 1984, 2396, 163612, 30646, 111, 70820, 903, 4677, 19882, 29479, 456, 40383, 6713, 2037, 50770, 2335...	[ 0.0390625, 0.250732421875, 0.0797119140625, 0.051300048828125, 0.207275390625, 0.17822265625, 0.0992431640625, 0.199462890625, 0.230712890625, 0.0186767578125, 0.103271484375, 0.251708984375, 0.1102294921875, 0.156005859375, 0.1968994140625, 0.00250244140625, 0.098388671875, 0.1827...	embed
20499129_c0	20499129	haskell	0	Title: Explain this 'Merge' Function in Haskell Problem title: Explain this 'Merge' Function in Haskell Tags: mergesort, sorting, haskell Problem: Explain this 'Merge' Function in Haskell I am learning Haskell and I am having trouble understanding this function. I am implementing mergesort. I have t...	Explain this 'Merge' Function in Haskell Explain this 'Merge' Function in Haskell mergesort sorting haskell Explain Merge Haskell x:xt y:yt Explain this 'Merge' Function in Haskell I am learning Haskell and I am having trouble understanding this function. I am implementing mergesort. I have the merg...	[ 0.006622314453125, 0.0267333984375, 0.01397705078125, -0.01190185546875, 0.00927734375, -0.002655029296875, -0.0206298828125, -0.00970458984375, 0.0076904296875, 0.040283203125, 0.00982666015625, -0.0098876953125, 0.0166015625, -0.00159454345703125, 0.0037384033203125, -0.0167236328125...	[ 60075, 16442, 903, 3768, 30248, 429, 28670, 10763, 23, 20625, 142508, 42564, 62351, 12096, 214, 1556, 6035, 1022, 12, 29062, 113, 20191, 52080, 63134, 100094, 32354, 29479, 195625, 5844, 28219, 2367, 1991, 20594, 222530, 46876, 6002, 86531, 3...	[ 0.0789794921875, 0.1361083984375, 0.1087646484375, 0.0718994140625, 0.2152099609375, 0.2059326171875, 0.1734619140625, 0.08734130859375, 0.046417236328125, 0.141357421875, 0.238525390625, 0.255859375, 0.22900390625, 0.1868896484375, 0.010284423828125, 0.120361328125, 0.1944580078125,...	embed
70341841_c0	70341841	haskell	0	Title: How to use show to print character without single quotes? Problem title: How to use show to print character without single quotes? Tags: haskell Problem: How to use show to print character without single quotes? I'm defining an instance of the Show typeclass for a custom data type where in the single lettered ch...	How to use show to print character without single quotes? How to use show to print character without single quotes? haskell How How to use show to print character without single quotes? I'm defining an instance of the Show typeclass for a custom data type where in the single lettered character name is returned but it r...	[ 0.0054931640625, 0.006927490234375, 0.01171875, 0.013427734375, -0.00860595703125, 0.01104736328125, 0.00848388671875, -0.00701904296875, 0.0098876953125, 0.01104736328125, -0.0263671875, -0.042724609375, -0.009033203125, 0.01348876953125, -0.03564453125, 0.00872802734375, -0.0065307...	[ 11249, 47, 4527, 7639, 28412, 62816, 15490, 11001, 66747, 1556, 142508, 13204, 110527, 17367, 10644, 67413, 114122, 2053, 66185, 9351, 176377, 1284, 30646, 678, 137567, 11, 237, 130250, 3642, 76228, 6056, 7464, 17368, 85689, 21441, 1507, 5303, ...	[ 0.07135009765625, 0.033477783203125, 0.1015625, 0.298095703125, 0.1962890625, 0.193603515625, 0.133544921875, 0.1282958984375, 0.21044921875, 0.1121826171875, 0.1888427734375, 0.041473388671875, 0.05145263671875, 0.25244140625, 0.088134765625, 0.1103515625, 0.0469970703125, 0.06304...	embed
44000862_c0	44000862	haskell	0	Title: Convert Type with ByteString to Text? Problem title: Convert Type with ByteString to Text? Tags: haskell Problem: Convert Type with ByteString to Text? Using conduit , my private repo code fails to compile: Expected type: ConduitM Text Void (Control.Monad.Trans.Resource.Internal.ResourceT IO) () Actual type: Con...	Convert Type with ByteString to Text? Convert Type with ByteString to Text? haskell Convert Type ByteString Text Expected ConduitM Control.Monad.Trans.Resource.Internal.ResourceT Actual Helper Convert Type with ByteString to Text? Using conduit , my private repo code fails to compile: How can I define a function?	[ 0.01806640625, -0.0125732421875, 0.006317138671875, 0.0164794921875, -0.01214599609375, 0.022705078125, -0.0133056640625, -0.00860595703125, -0.00579833984375, 0.006072998046875, -0.01055908203125, -0.015380859375, 0.00689697265625, 0.0067138671875, 0.0029449462890625, -0.0035858154296...	[ 1657, 11549, 60457, 678, 3311, 67, 71713, 214, 47, 24129, 1556, 142508, 60075, 13, 89829, 112061, 594, 27131, 46674, 712, 62624, 60427, 44851, 618, 100582, 39527, 56, 345, 120565, 14375, 93392, 18151, 35782, 9969, 1340, 61924, 32354 ]	[ 0.072509765625, 0.157470703125, 0.27294921875, 0.102294921875, 0.1033935546875, 0.1317138671875, 0.198974609375, 0.085693359375, 0.0966796875, 0.2479248046875, 0.1124267578125, 0.211181640625, 0.0804443359375, 0.09613037109375, 0.03411865234375, 0.1424560546875, 0.076904296875, 0.1...	embed
70277534_c0	70277534	haskell	0	Title: Can we construct an infinite list that satisfies a given bit predicate? Problem title: Can we construct an infinite list that satisfies a given bit predicate? Tags: haskell, list, bitstring, predicate Problem: Can we construct an infinite list that satisfies a given bit predicate? If we have a given predicate p ...	Can we construct an infinite list that satisfies a given bit predicate? Can we construct an infinite list that satisfies a given bit predicate? haskell list bitstring predicate Can Bool Can we construct an infinite list that satisfies a given bit predicate? If we have a given predicate p :: [Bool] -> Bool that take an ...	[ 0.01263427734375, -0.006866455078125, -0.01226806640625, 0.009521484375, -0.0025634765625, 0.017822265625, 0.01220703125, 0.003082275390625, -0.0003070831298828125, -0.01495361328125, 0.01904296875, -0.022705078125, 0.00390625, 0.00103759765625, -0.0030517578125, 0.021728515625, 0.00...	[ 4171, 642, 64549, 54241, 13, 5303, 450, 40407, 3387, 34475, 4785, 1653, 2063, 67, 142, 1556, 142508, 91693, 2460, 929, 915, 12647, 33079, 5646, 171859, 30646, 87599, 707, 22225, 35509, 51, 69723, 27289, 110, 6528, 4488, 1810, 32354, 1238, ...	[ 0.10064697265625, 0.0701904296875, 0.205322265625, 0.184326171875, 0.115234375, 0.251708984375, 0.0098876953125, 0.18359375, 0.0633544921875, 0.0728759765625, 0.166259765625, 0.17236328125, 0.1832275390625, 0.055511474609375, 0.0244598388671875, 0.0987548828125, 0.2015380859375, 0....	embed
32980278_c0	32980278	haskell	0	Title: Confuse about flip function Problem title: Confuse about flip function Tags: haskell Problem: Confuse about flip function charIn :: Char -> String -> Bool charIn _ [] = False charIn x (y:ys) = x==y \|\| charIn x ys isWord :: String -> Bool isWord = all $ flip charIn "abcdefghijklmnopqrstuvwxyz" -- isword "abc" (Re...	Confuse about flip function Confuse about flip function haskell Confuse Char Bool y:ys Result ab1 Confuse about flip function I'm confuse about the way flip function works. I know it flips first two arguments but how does it work in the above code? Does it just flip the string argument and charIn "abcdefghijklmnopqrstu...	[ 0.0155029296875, -0.00750732421875, 0.0069580078125, 0.01116943359375, 0.0003070831298828125, 0.038818359375, 0.02197265625, -0.01556396484375, -0.007598876953125, 0.017333984375, 0.0267333984375, 0.00958251953125, -0.01470947265625, 0.01611328125, -0.006988525390625, -0.00112152099609...	[ 106161, 4032, 1672, 147505, 32354, 1556, 142508, 21656, 2460, 929, 113, 4778, 126684, 1563, 418, 55681, 184, 3917, 43240, 3714, 442, 7, 5117, 6626, 10750, 3642, 14602, 4488, 36917, 18151, 101790, 1660, 79315, 136, 21441, 4153, 2055, 71574, ...	[ 0.149169921875, 0.139892578125, 0.056884765625, 0.285400390625, 0.22119140625, 0.10400390625, 0.23681640625, 0.1326904296875, 0.051300048828125, 0.1455078125, 0.0208740234375, 0.1016845703125, 0.1573486328125, 0.0999755859375, 0.040863037109375, 0.1160888671875, 0.08392333984375, 0...	embed
13706072_c0	13706072	haskell	0	Title: Apply a function to lists in a list Problem title: Apply a function to lists in a list Tags: haskell Problem: Apply a function to lists in a list I want a function that in each of the lists of a list ([[],[],[]]) makes the sum of the elements and if it is even add to that list a 0 and a 1, otherwise. I tried wit...	Apply a function to lists in a list Apply a function to lists in a list haskell Apply Matrix Matr x:xs Apply a function to lists in a list I want a function that in each of the lists of a list ([[],[],[]]) makes the sum of the elements and if it is even add to that list a 0 and a 1, otherwise. I tried with this, but it...	[ -0.017822265625, 0.0264892578125, 0.0179443359375, -0.0040283203125, 0.000476837158203125, 0.01708984375, 0.006927490234375, 0.01287841796875, 0.02197265625, 0.0164794921875, 0.011474609375, -0.01055908203125, 0.01031494140625, 0.01031494140625, -0.004364013671875, 0.0010833740234375, ...	[ 5659, 538, 10, 32354, 47, 5303, 7, 23, 1556, 142508, 194234, 7656, 42, 1022, 12, 425, 87, 3444, 450, 12638, 111, 86245, 30482, 10554, 80854, 2174, 3853, 15190, 757, 136, 106, 120262, 37842, 903, 26785, 100, 10336, 3714, 3249, 27060, 818...	[ 0.194580078125, 0.10162353515625, 0.0501708984375, 0.259765625, 0.17041015625, 0.254150390625, 0.109130859375, 0.10101318359375, 0.158935546875, 0.250244140625, 0.216796875, 0.131591796875, 0.10986328125, 0.0408935546875, 0.042694091796875, 0.07659912109375, 0.0357666015625, 0.1516...	embed
7185366_c1	7185366	haskell	1	type safety and include 'B4 (Either X Y)' and put in some nice runtime errors for when it has the wrong value. Maybe there's a better way to approach "almost the same" data types? Update: so I worked around by writing a pseudo-fmap: convert :: (a -> b) -> A a -> A b Which at least allows me to separate the conversion ...	type safety and include 'B4 (Either X Y)' and put in some nice runtime errors for when it has the wrong value. Maybe there's a better way to approach "almost the same" data types? Update: so I worked around by writing a pseudo-fmap: convert :: (a -> b) -> A a -> A b Which at least allows me to separate the conversion ...	[ -0.018798828125, -0.01177978515625, -0.01348876953125, -0.000904083251953125, -0.0211181640625, 0.035400390625, -0.0115966796875, 0.0037384033203125, 0.03369140625, -0.00128173828125, -0.0062255859375, 0.00677490234375, 0.004119873046875, 0.006011962890625, -0.01446533203125, -0.002182...	[ 10644, 81900, 26698, 571, 617, 9319, 1193, 990, 3884, 26267, 11675, 6032, 18499, 44691, 34292, 11522, 3917, 51515, 840, 18, 5701, 2053, 52895, 79786, 10932, 32562, 74189, 420, 62346, 96760, 1984, 11, 33079, 876, 19713, 114864, 84797, 142477, ...	[ 0.25146484375, 0.232666015625, 0.1148681640625, 0.058685302734375, 0.1531982421875, 0.07958984375, 0.0908203125, 0.12646484375, 0.016265869140625, 0.044464111328125, 0.02301025390625, 0.03729248046875, 0.1207275390625, 0.108642578125, 0.10498046875, 0.0335693359375, 0.038177490234375...	embed
8366093_c1	8366093	haskell	1	getting confused by monads (and the context that the trap me into!), and the do statement. I really want to write something like this, but I know it's wrong: firstLine <- contents.head (m,n) <- map read (words firstLine) because contents is not a list - but a monad. Any help on the next step would be great. So I've ju...	getting confused by monads (and the context that the trap me into!), and the do statement. I really want to write something like this, but I know it's wrong: firstLine <- contents.head (m,n) <- map read (words firstLine) because contents is not a list - but a monad. Any help on the next step would be great. So I've ju...	[ -0.0177001953125, 0.00439453125, -0.00112152099609375, 0.01214599609375, -0.004669189453125, 0.01141357421875, 0.0189208984375, 0.0062255859375, 0.013916015625, -0.038818359375, -0.01007080078125, 0.00885009765625, -0.006988525390625, -0.0059814453125, 0.020263671875, -0.00370788574218...	[ 20949, 55681, 5281, 2667, 712, 7, 43701, 63819, 3934, 54, 63805, 6183, 3444, 33022, 1884, 903, 3714, 44691, 5117, 93232, 10941, 5, 31251, 39, 19, 22288, 12301, 47416, 959, 5303, 4358, 29954, 134053, 831, 60520, 594, 124519, 174350, 2046, ...	[ 0.0219879150390625, 0.1295166015625, 0.0733642578125, 0.152099609375, 0.2142333984375, 0.1307373046875, 0.1195068359375, 0.18115234375, 0.004638671875, 0.1434326171875, 0.1822509765625, 0.09619140625, 0.06634521484375, 0.087890625, 0.039886474609375, 0.0153350830078125, 0.08215332031...	embed
8585192_c4	8585192	haskell	4	877c150b681896452f205f4, mime-mail-0.4.1.0-05d76f10c6f18f7178113a6d760f371a, monad-control-0.3.1-092d8fe82727181557b850f795f847bc, persistent-0.6.4.3-6e59b956a206ce4f4a9296367507c2b8, persistent-sqlite-0.6.2.1-d32462e51baa09b53b6fd83dae922fc7, shakespeare-css-0.10.4-f8e17e4528d3a37edee74b13441720de, shakespeare-js-0.10...	877c150b681896452f205f4, mime-mail-0.4.1.0-05d76f10c6f18f7178113a6d760f371a, monad-control-0.3.1-092d8fe82727181557b850f795f847bc, persistent-0.6.4.3-6e59b956a206ce4f4a9296367507c2b8, persistent-sqlite-0.6.2.1-d32462e51baa09b53b6fd83dae922fc7, shakespeare-css-0.10.4-f8e17e4528d3a37edee74b13441720de, shakespeare-js-0.10...	[ -0.00994873046875, 0.0111083984375, 0.0108642578125, 0.0172119140625, 0.007598876953125, 0.0072021484375, -0.036865234375, 0.00103759765625, 0.015869140625, 0.00848388671875, 0.005767822265625, -0.01373291015625, -0.0257568359375, -0.0023040771484375, 0.013671875, 0.018798828125, -0....	[ 6, 182055, 238, 19236, 275, 16028, 1819, 11648, 170265, 420, 143422, 617, 4, 324, 282, 9, 2065, 121254, 5, 102107, 87741, 71, 11835, 963, 910, 139305, 116597, 11, 110216, 118552, 2667, 712, 81988, 170179, 180033, 12231, 1019, 2242, 159595, ...	[ 0.1116943359375, 0.232177734375, 0.0994873046875, 0.1622314453125, 0.0902099609375, 0.155029296875, 0.10791015625, 0.1156005859375, 0.163818359375, 0.086181640625, 0.1748046875, 0.1566162109375, 0.1204833984375, 0.1802978515625, 0.25732421875, 0.097900390625, 0.2064208984375, 0.163...	embed
64851169_c0	64851169	haskell	0	Title: Haskell - Check if position is even/odd Problem title: Haskell - Check if position is even/odd Tags: haskell Problem: Haskell - Check if position is even/odd What I need to do is to apply alternately 2 functions in a list. For example: (2) (-3) [4,5,6,7,8] would result in [8,2,12,4,16] , because 42 , 5-3 , 6*2...	Haskell - Check if position is even/odd Haskell - Check if position is even/odd haskell Haskell Check Haskell - Check if position is even/odd What I need to do is to apply alternately 2 functions in a list. For example: would result in [8,2,12,4,16] , because 42 , 5-3 , 62 , 7-3 , 8*2 ... What I was thinking was and ...	[ -0.005828857421875, 0.01287841796875, 0.005645751953125, 0.0034637451171875, -0.007476806640625, 0.0301513671875, 0.00299072265625, 0.01458740234375, 0.004974365234375, 0.0120849609375, 0.0185546875, -0.01068115234375, 0.018310546875, 0.005889892578125, -0.00823974609375, 0.00215148925...	[ 20625, 142508, 38679, 2174, 19069, 83, 3853, 64, 13606, 1556, 3871, 54, 59911, 75939, 21286, 116, 32354, 23, 5303, 2806, 16750, 1019, 304, 1530, 617, 2485, 6637, 149878, 190, 8316, 305, 382, 1639, 47644, 136, 420, 1022, 4426, 9, 7, 1238...	[ 0.152587890625, 0.260986328125, 0.207275390625, 0.1251220703125, 0.2374267578125, 0.1201171875, 0.22509765625, 0.093017578125, 0.237548828125, 0.1407470703125, 0.06439208984375, 0.008270263671875, 0.134521484375, 0.122802734375, 0.03717041015625, 0.1097412109375, 0.149658203125, 0....	embed
65653918_c0	65653918	haskell	0	Title: How to move all occurrences of the first element of the list to the end of the list in Haskell? Problem title: How to move all occurrences of the first element of the list to the end of the list in Haskell? Tags: haskell Problem: How to move all occurrences of the first element of the list to the end of the list...	How to move all occurrences of the first element of the list to the end of the list in Haskell? How to move all occurrences of the first element of the list to the end of the list in Haskell? haskell How Haskell x:xs How to move all occurrences of the first element of the list to the end of the list in Haskell? I want ...	[ -0.0003833770751953125, 0.00311279296875, 0.00067138671875, 0.01361083984375, -0.006195068359375, 0.00909423828125, 0.000946044921875, 0.0169677734375, 0.02099609375, -0.0169677734375, -0.006561279296875, 0.0196533203125, 0.0244140625, 0.00799560546875, -0.00119781494140625, -0.0013275...	[ 11249, 47, 25813, 756, 74918, 42, 69098, 5117, 12830, 5303, 3564, 111, 20625, 142508, 1556, 425, 23, 3444, 125663, 136, 1295, 3884, 5036, 107730, 122101, 617, 363, 758, 1019, 30646, 163, 163324, 92714, 96386, 36663, 64457 ]	[ 0.0955810546875, 0.1549072265625, 0.1962890625, 0.1351318359375, 0.1693115234375, 0.118408203125, 0.0849609375, 0.1602783203125, 0.176513671875, 0.1866455078125, 0.2215576171875, 0.0928955078125, 0.1492919921875, 0.2452392578125, 0.1053466796875, 0.0556640625, 0.06597900390625, 0.0...	embed
56942063_c1	56942063	haskell	1	\| t == 2 = Type2 handleMessage Type1 msg = handleType1 msg handleMessage Type2 msg = handleType2 msg Again, we can push the switch around, but I'm not really seeing something elegant. I'm hoping for several things: Cohesion: code is bundled together well. Adding a new handle requires little boilerplate. None would be ...	\| t == 2 = Type2 handleMessage Type1 msg = handleType1 msg handleMessage Type2 msg = handleType2 msg Again, we can push the switch around, but I'm not really seeing something elegant. I'm hoping for several things: Cohesion: code is bundled together well. Adding a new handle requires little boilerplate. None would be ...	[ 0.0103759765625, 0.0098876953125, -0.021728515625, 0.01470947265625, -0.01336669921875, 0.000301361083984375, -0.0137939453125, 0.0003108978271484375, 0.009033203125, -0.00921630859375, 0.007049560546875, 0.0024871826171875, 0.006256103515625, -0.004638671875, -0.0006561279296875, 0.00...	[ 808, 69112, 116, 2203, 60457, 304, 34831, 594, 6011, 429, 418, 68163, 177, 196707, 831, 25944, 70, 101089, 10932, 959, 86681, 9844, 27650, 156377, 100, 40368, 8966, 1311, 1106, 6889, 18151, 57134, 6259, 25842, 5299, 62, 59725, 3525, 144570,...	[ 0.1126708984375, 0.0926513671875, 0.1290283203125, 0.030914306640625, 0.21533203125, 0.1361083984375, 0.2442626953125, 0.039703369140625, 0.167724609375, 0.0318603515625, 0.05523681640625, 0.0595703125, 0.082275390625, 0.185546875, 0.0258941650390625, 0.1324462890625, 0.0071105957031...	embed
34175173_c0	34175173	haskell	0	Title: Haskell: Could not find module `Data.List.Split' Problem title: Haskell: Could not find module `Data.List.Split' Tags: haskell Problem: Haskell: Could not find module `Data.List.Split' I'm trying to split a list in Haskell. As to my knowledge, the easiest way to do this is with splitOn , but this funct...	Haskell: Could not find module `Data.List.Split' Haskell: Could not find module `Data.List.Split' haskell Data.List.Split Haskell Could Data.List Haskell: Could not find module `Data.List.Split' I'm trying to split a list in Haskell. As to my knowledge, the easiest way to do this is with splitOn , but this fu...	[ -0.0147705078125, 0.0150146484375, -0.0096435546875, -0.006866455078125, -0.01361083984375, 0.0279541015625, 0.024169921875, -0.00701904296875, 0.0035858154296875, -0.01055908203125, -0.017578125, -0.031005859375, 0.0026092529296875, 0.01519775390625, 0.0018768310546875, -0.00173187255...	[ 20625, 142508, 191147, 959, 7413, 88996, 137989, 154663, 31923, 4353, 3768, 1556, 11809, 5, 31577, 65450, 5303, 1544, 525, 678, 20320, 32354, 144570, 24927, 1914, 822, 18499, 4488, 86869, 23468, 88303, 30700 ]	[ 0.12890625, 0.2117919921875, 0.1024169921875, 0.11181640625, 0.1768798828125, 0.223876953125, 0.1512451171875, 0.2322998046875, 0.126953125, 0.23876953125, 0.06494140625, 0.1043701171875, 0.1370849609375, 0.0328369140625, 0.0277252197265625, 0.2374267578125, 0.20947265625, 0.061645...	embed
15784841_c0	15784841	haskell	0	Title: What actually $ function does in haskell? Problem title: What actually $ function does in haskell? Tags: dollar-sign, haskell-prelude, operators, syntax, haskell Problem: What actually $ function does in haskell? I know $ :: (a->b) -> a -> b f $ x = f x Intuitively it seems to me, like to say, 1. $ delays the ev...	What actually $ function does in haskell? What actually $ function does in haskell? dollar-sign haskell-prelude operators syntax haskell What What actually $ function does in haskell? I know Intuitively it seems to me, like to say, 1. $ delays the evaluation of the function to its left 2. evaluates whats to its right 3...	[ 0.01275634765625, -0.00020503997802734375, 0.0361328125, -0.003143310546875, -0.00799560546875, 0.01708984375, 0.01513671875, 0.00909423828125, 0.01324462890625, -0.0167236328125, -0.000545501708984375, -0.0037078857421875, -0.00732421875, 0.00677490234375, -0.020751953125, 0.003677368...	[ 4865, 20653, 3650, 32354, 14602, 23, 1556, 142508, 15437, 31304, 4692, 822, 112, 39933, 6002, 86531, 3714, 18425, 37202, 1884, 5154, 615, 8, 5259, 7, 219836, 47, 25737, 787, 151575, 2367, 7108, 1031, 61590, 16750, 15787, 10422, 28219, 15400...	[ 0.08111572265625, 0.209228515625, 0.25244140625, 0.240966796875, 0.1435546875, 0.0816650390625, 0.1329345703125, 0.239990234375, 0.1531982421875, 0.141845703125, 0.020904541015625, 0.1163330078125, 0.031707763671875, 0.167236328125, 0.02752685546875, 0.04071044921875, 0.001708984375,...	embed
17600168_c0	17600168	haskell	0	Title: Haskell newtype syntax Problem title: Haskell newtype syntax Tags: newtype, haskell Problem: Haskell newtype syntax Please help me to understand the following definition: newtype Writer w a = Writer { runWriter :: (a,w) } instance (Monoid w) => Monad (Writer w) where return a = Writer (a,mempty) (Writer (a,w)) >...	Haskell newtype syntax Haskell newtype syntax newtype haskell Haskell Writer Monoid Monad Haskell newtype syntax Please help me to understand the following definition: Why is runWriter is declared as when its actual type is: Once I tried with ghci I realized this must be some implicit argument since type "a" has to be ...	[ -0.0189208984375, 0.0107421875, 0.00787353515625, 0.00982666015625, -0.00323486328125, 0.0057373046875, -0.0177001953125, -0.0166015625, 0.00482177734375, 0.0191650390625, 0.00665283203125, 0.00439453125, -0.01007080078125, -0.019287109375, 0.001800537109375, -0.0155029296875, 0.0217...	[ 20625, 142508, 3525, 50986, 6002, 86531, 1556, 601, 2783, 56, 77879, 532, 60331, 71, 4358, 28219, 25632, 80934, 44084, 83, 11675, 1456, 159978, 237, 3229, 8561, 10644, 37842, 31380, 318, 185171, 165164, 10750, 11, 83324, 66161, 123087, 3688 ]	[ 0.110595703125, 0.2308349609375, 0.1077880859375, 0.27978515625, 0.1317138671875, 0.1484375, 0.0972900390625, 0.0726318359375, 0.2083740234375, 0.1707763671875, 0.1207275390625, 0.0966796875, 0.12060546875, 0.068359375, 0.02783203125, 0.07421875, 0.022003173828125, 0.13623046875, ...	embed
53585992_c0	53585992	haskell	0	Title: How to sort a massiv array along innermost dimension? Problem title: How to sort a massiv array along innermost dimension? Tags: sorting, multidimensional-array, massiv, arrays, haskell Problem: How to sort a massiv array along innermost dimension? I have an Array r Ix2 a such that (Manifest r Ix2 a, Ord a) . I'...	How to sort a massiv array along innermost dimension? How to sort a massiv array along innermost dimension? sorting multidimensional-array massiv arrays haskell How Array Ix2 Manifest Ord Vector How to sort a massiv array along innermost dimension? I have an Array r Ix2 a such that (Manifest r Ix2 a, Ord a) . I'd like ...	[ 0.003387451171875, 0.015869140625, -0.01513671875, 0.01300048828125, -0.006103515625, 0.0111083984375, 0.00726318359375, -0.0107421875, -0.0087890625, 0.000896453857421875, 0.00408935546875, -0.003265380859375, -0.0028533935546875, 0.007659912109375, -0.022216796875, -0.005157470703125...	[ 11249, 47, 12096, 127123, 10298, 53, 33233, 75414, 840, 18, 91403, 214, 6024, 157955, 19305, 4778, 1556, 142508, 69253, 87, 425, 304, 92669, 35379, 2609, 18770, 1690, 10, 6044, 14, 13576, 1884, 98, 12638, 15555, 70796, 36880, 29479, 21972, ...	[ 0.088623046875, 0.049591064453125, 0.236572265625, 0.247802734375, 0.148681640625, 0.123046875, 0.1097412109375, 0.1195068359375, 0.093505859375, 0.04376220703125, 0.1480712890625, 0.0294189453125, 0.0149078369140625, 0.0843505859375, 0.07305908203125, 0.02752685546875, 0.04663085937...	embed
41551942_c3	41551942	haskell	3	P32; Sp = Sp - 4; call GHC.Num.+_info() args: 20, res: 0, upd: 4; } } Code signals: Can, my_sum, my_sum_s24N_entry, info_tbl, c25x, block_c25x_info, rep:StackRep, c267, my_sum_s24N_info, rep:HeapRep, Fun, fun_type, ArgSpec, stack_info, arg_space, updfr_space, Just, _s24N::P32, _s24O::P32, P32, SpLim, c268, c269, HpLim,...	P32; Sp = Sp - 4; call GHC.Num.+_info() args: 20, res: 0, upd: 4; } } Code signals: Can, my_sum, my_sum_s24N_entry, info_tbl, c25x, block_c25x_info, rep:StackRep, c267, my_sum_s24N_info, rep:HeapRep, Fun, fun_type, ArgSpec, stack_info, arg_space, updfr_space, Just, _s24N::P32, _s24O::P32, P32, SpLim, c268, c269, HpLim,...	[ -0.0166015625, 0.0025177001953125, 0.02001953125, 0.00579833984375, -0.005828857421875, 0.023193359375, -0.00164794921875, 0.004119873046875, 0.0247802734375, -0.035400390625, 0.00830078125, -0.019775390625, -0.00054168701171875, 0.000659942626953125, 0.027099609375, -0.0103759765625, ...	[ 436, 6460, 74, 8019, 2203, 20, 201, 11782, 527, 73265, 839, 316, 1328, 7319, 79459, 387, 3332, 757, 4, 1257, 71, 51912, 28864, 26073, 7, 12, 4171, 759, 11832, 2357, 33, 15123, 3004, 9030, 501, 2588, 425, 46389, 454, 10958, 42378, 2594...	[ 0.1778564453125, 0.33935546875, 0.048614501953125, 0.1942138671875, 0.06268310546875, 0.072509765625, 0.1483154296875, 0.1903076171875, 0.1287841796875, 0.2349853515625, 0.0927734375, 0.1741943359375, 0.1182861328125, 0.228759765625, 0.2027587890625, 0.1151123046875, 0.1214599609375,...	embed
30590909_c0	30590909	haskell	0	Title: Haskell grouping list elements by fst Problem title: Haskell grouping list elements by fst Tags: list-comprehension, haskell Problem: Haskell grouping list elements by fst I'm trying to write a function group::[(Int, Int)]->[[(Int, Int)]] that would group elements of a list of tuples into subgroups dependant on ...	Haskell grouping list elements by fst Haskell grouping list elements by fst list-comprehension haskell Haskell Haskell grouping list elements by fst I'm trying to write a function that would group elements of a list of tuples into subgroups dependant on the first coordinate, ie: should result in I'd imagine list compre...	[ 0.00457763671875, 0.0034942626953125, -0.004302978515625, 0.00341796875, -0.0120849609375, 0.024658203125, -0.013671875, 0.0093994140625, 0.0133056640625, -0.0106201171875, 0.00001823902130126953, 0.005340576171875, -0.0025787353515625, 0.006683349609375, -0.017822265625, 0.00753784179...	[ 20625, 142508, 21115, 214, 5303, 80854, 390, 1238, 271, 277, 4692, 3220, 6889, 1556, 31577, 33022, 32354, 370, 99726, 3934, 1614, 51588, 56566, 1236, 5117, 176866, 13, 5608, 16750, 28987, 46683, 70, 3917, 4785, 179933, 67660, 166589, 5646, ...	[ 0.1356201171875, 0.234130859375, 0.2242431640625, 0.052734375, 0.1805419921875, 0.1993408203125, 0.08203125, 0.10546875, 0.184326171875, 0.08258056640625, 0.164306640625, 0.1666259765625, 0.03497314453125, 0.1357421875, 0.038665771484375, 0.0670166015625, 0.162353515625, 0.10339355...	embed
13954878_c0	13954878	haskell	0	Title: Why can data type not be serialized although it is member of the show class? Problem title: Why can data type not be serialized although it is member of the show class? Tags: haskell Problem: Why can data type not be serialized although it is member of the show class? data Mine = Firstname String \| Lastname Stri...	Why can data type not be serialized although it is member of the show class? Why can data type not be serialized although it is member of the show class? haskell Why Mine Firstname Lastname Show Serialize Not Why can data type not be serialized although it is member of the show class? This does not compile and gives th...	[ 0.0050048828125, 0.0087890625, 0.00848388671875, -0.0029144287109375, -0.0244140625, -0.003326416015625, -0.0081787109375, 0.01397705078125, -0.00421142578125, 0.0005340576171875, -0.0087890625, -0.000644683837890625, 0.0257568359375, 0.03173828125, -0.004058837890625, -0.0034332275390...	[ 44084, 831, 2053, 10644, 959, 35686, 29367, 102971, 32786, 7639, 18507, 83, 111, 1556, 142508, 56713, 23972, 11627, 21672, 17367, 135188, 20650, 11205, 186, 9969, 1340, 18499, 903, 51592, 43032 ]	[ 0.1080322265625, 0.08056640625, 0.13427734375, 0.206298828125, 0.1473388671875, 0.21142578125, 0.0924072265625, 0.09088134765625, 0.13623046875, 0.1923828125, 0.1732177734375, 0.0205535888671875, 0.0386962890625, 0.0877685546875, 0.1865234375, 0.1236572265625, 0.060394287109375, 0....	embed
23241587_c0	23241587	haskell	0	Title: C/C++ wrapper for Haskell IO monad Problem title: C/C++ wrapper for Haskell IO monad Tags: haskell, c%2B%2B, linker, static-linking, monads Problem: C/C++ wrapper for Haskell IO monad I want to call a Haskell function from C/C++. I have already read a few tutorials related to that topic, but IO monad calls are n...	C/C++ wrapper for Haskell IO monad C/C++ wrapper for Haskell IO monad haskell c%2B%2B linker static-linking monads Haskell C/C++ wrapper for Haskell IO monad I want to call a Haskell function from C/C++. I have already read a few tutorials related to that topic, but IO monad calls are not covered in them. In particular...	[ 0.0034332275390625, 0.0013580322265625, 0.0047607421875, 0.00063323974609375, -0.01361083984375, 0.0030059814453125, 0.007415771484375, -0.0064697265625, -0.01806640625, -0.04150390625, 0.00299072265625, -0.048095703125, -0.010009765625, -0.0091552734375, 0.0213623046875, 0.00126647949...	[ 313, 64, 441, 37223, 137565, 1264, 100, 20625, 142508, 17780, 2667, 712, 1556, 501, 3126, 56, 201939, 10187, 214, 87, 3444, 11782, 32354, 1295, 21771, 12301, 57143, 28451, 621, 959, 127918, 17311, 2806, 1884, 4527, 78974, 1984, 71713, 33079...	[ 0.123291015625, 0.1484375, 0.066162109375, 0.2548828125, 0.209716796875, 0.189453125, 0.0645751953125, 0.169677734375, 0.2744140625, 0.2281494140625, 0.130126953125, 0.163330078125, 0.139404296875, 0.04443359375, 0.1407470703125, 0.1041259765625, 0.135009765625, 0.1439208984375, ...	embed
53140675_c0	53140675	haskell	0	Title: Convert a list of digits to a number HASKELL Problem title: Convert a list of digits to a number HASKELL Tags: ghci, haskell, winghci Problem: Convert a list of digits to a number HASKELL I want to make a function in haskell that given a list of single digits, i make the full number. I was thinking in using inte...	Convert a list of digits to a number HASKELL Convert a list of digits to a number HASKELL ghci haskell winghci Convert HASKELL funcion5 x:xs Convert a list of digits to a number HASKELL I want to make a function in haskell that given a list of single digits, i make the full number. I was thinking in using intensive lis...	[ -0.0185546875, -0.000232696533203125, 0.0021514892578125, -0.0003910064697265625, -0.01611328125, 0.0167236328125, -0.0072021484375, 0.024658203125, 0.0155029296875, -0.02734375, 0.003326416015625, -0.006805419921875, -0.009521484375, 0.016357421875, -0.01953125, -0.0087890625, 0.023...	[ 1657, 11549, 5303, 111, 153939, 7, 47, 10, 14012, 11666, 10762, 56051, 31380, 318, 1556, 142508, 14775, 127, 7477, 6447, 758, 1022, 12, 425, 3444, 3249, 32354, 23, 34475, 11001, 17, 4393, 47644, 17368, 40894, 32926, 18151, 28960, 581, 652...	[ 0.0662841796875, 0.1842041015625, 0.21484375, 0.0433349609375, 0.234130859375, 0.08251953125, 0.1341552734375, 0.114013671875, 0.2384033203125, 0.148681640625, 0.1317138671875, 0.193359375, 0.0416259765625, 0.08514404296875, 0.17236328125, 0.2467041015625, 0.10009765625, 0.02522277...	embed
29068636_c0	29068636	haskell	0	Title: Haskell nested where clauses Problem title: Haskell nested where clauses Tags: syntax-error, haskell Problem: Haskell nested where clauses I am a beginner coder in haskell, while doing an exercise from the first chapter of this amazing book: http://book.realworldhaskell.org/read/getting-started.html I came acros...	Haskell nested where clauses Haskell nested where clauses syntax-error haskell Haskell wonderbox:ch01 quux.txt WC.hs:5:9 Haskell nested where clauses I am a beginner coder in haskell, while doing an exercise from the first chapter of this amazing book: http://book.realworldhaskell.org/read/getting-started.html I came a...	[ -0.004302978515625, 0.0111083984375, -0.016357421875, -0.00946044921875, 0.001312255859375, 0.025390625, -0.01043701171875, -0.017822265625, 0.0033721923828125, -0.0234375, -0.01318359375, -0.038818359375, 0.0296630859375, 0.006622314453125, 0.0009918212890625, 0.00909423828125, 0.01...	[ 20625, 142508, 8512, 71, 7440, 70731, 90, 6002, 86531, 188800, 1556, 32195, 11728, 206, 6746, 1103, 6077, 124326, 127, 1126, 9842, 1679, 552, 820, 81979, 139539, 44613, 12877, 30544, 32554, 10557, 39116, 17137, 31089, 44084, 831, 87, 959, 9...	[ 0.119140625, 0.2152099609375, 0.2340087890625, 0.0909423828125, 0.225341796875, 0.2117919921875, 0.061553955078125, 0.0848388671875, 0.1595458984375, 0.1505126953125, 0.10107421875, 0.07489013671875, 0.1678466796875, 0.0074462890625, 0.0726318359375, 0.020294189453125, 0.136352539062...	embed
19081535_c0	19081535	haskell	0	Title: How can I replace generators if I need only one result? Problem title: How can I replace generators if I need only one result? Tags: generator, haskell Problem: How can I replace generators if I need only one result? I'm playing with Haskell for first time. I've created function that returns first precise enough...	How can I replace generators if I need only one result? How can I replace generators if I need only one result? generator haskell How Double How can I replace generators if I need only one result? I'm playing with Haskell for first time. I've created function that returns first precise enough result. It works as expect...	[ 0.0019378662109375, -0.0029754638671875, 0.005035400390625, -0.0025634765625, 0.000843048095703125, 0.0255126953125, 0.002685546875, -0.0167236328125, 0.0026092529296875, -0.05322265625, 0.0196533203125, 0.0294189453125, -0.012939453125, -0.00677490234375, 0.01220703125, 0.00927734375,...	[ 11249, 831, 87, 91995, 145823, 7, 2174, 3871, 4734, 1632, 16750, 1556, 142508, 107172, 75169, 20625, 5117, 1733, 75935, 32354, 30646, 134995, 20174, 43240, 84751, 17368, 66211 ]	[ 0.0654296875, 0.081298828125, 0.04498291015625, 0.2012939453125, 0.2900390625, 0.11328125, 0.06048583984375, 0.1328125, 0.1182861328125, 0.1468505859375, 0.18798828125, 0.122802734375, 0.2154541015625, 0.19287109375, 0.062347412109375, 0.108154296875, 0.0775146484375, 0.03059387207...	embed
30019802_c0	30019802	haskell	0	Title: Haskell function foldl (\x y -> x2 + y2) 0 behavior Problem title: Haskell function foldl (\x y -> x2 + y2) 0 behavior Tags: haskell, fold Problem: Haskell function foldl (\x y -> x2 + y2) 0 behavior I stuck with a problem. What's difference between these two functions: foldl (\x y -> x2 + y2) 0 [1...	Haskell function foldl (\x y -> x2 + y2) 0 behavior Haskell function foldl (\x y -> x2 + y2) 0 behavior haskell fold Haskell Haskell function foldl (\x y -> x2 + y2) 0 behavior I stuck with a problem. What's difference between these two functions: where f = \x y -> x2 + y2 . I understand result of foldl :...	[ -0.004791259765625, -0.003204345703125, 0.004058837890625, -0.0032958984375, -0.0067138671875, 0.0216064453125, -0.0002765655517578125, 0.00148773193359375, 0.0021514892578125, -0.0028533935546875, 0.00872802734375, -0.0218505859375, -0.010498046875, 0.005706787109375, 0.0042724609375, ...	[ 20625, 142508, 32354, 18344, 20469, 425, 113, 20, 1230, 5386, 1639, 304, 997, 10461, 757, 123166, 1022, 1556, 42822, 33079, 179933, 2967, 60212, 17721, 6097, 6626, 7440, 1238, 2203, 6, 5, 28219, 16750, 15400, 14602, 7569, 10554, 7103, 12638...	[ 0.12353515625, 0.241455078125, 0.189208984375, 0.1689453125, 0.248046875, 0.06268310546875, 0.163818359375, 0.0155487060546875, 0.00439453125, 0.1099853515625, 0.047149658203125, 0.16943359375, 0.132080078125, 0.164306640625, 0.155517578125, 0.1810302734375, 0.012298583984375, 0.12...	embed
56407905_c1	56407905	haskell	1	root </>))) entries ((root, map fst files) :) . concat <$> mapM (walk . (root </>) . fst) dirs In an equation for ‘walk’: walk root = do entries <- liftIO $ listDirectory root (files, dirs) <- partition snd <$> liftM2 (<$>) zip (mapM (liftIO . doesFileExist . (root </>))) entries ((root, map fst files) :) . concat <$> ...	root </>))) entries ((root, map fst files) :) . concat <$> mapM (walk . (root </>) . fst) dirs In an equation for ‘walk’: walk root = do entries <- liftIO $ listDirectory root (files, dirs) <- partition snd <$> liftM2 (<$>) zip (mapM (liftIO . doesFileExist . (root </>))) entries ((root, map fst files) :) . concat <$> ...	[ 0.0126953125, 0.01171875, 0.004150390625, 0.00021839141845703125, -0.009765625, 0.00848388671875, -0.01556396484375, -0.0155029296875, 0.0062255859375, -0.044189453125, -0.005126953125, -0.0022430419921875, 0.01141357421875, 0.031494140625, 0.0064697265625, 0.00173187255859375, -0.00...	[ 74855, 42946, 2740, 32149, 112820, 90, 148920, 22288, 1238, 271, 102158, 158, 4460, 594, 94449, 5402, 28, 5490, 35691, 2203, 54, 60520, 17780, 3650, 5303, 184911, 30675, 29822, 2878, 2208, 304, 68330, 62346, 104501, 14602, 174350, 19279, 1419...	[ 0.291015625, 0.017059326171875, 0.10479736328125, 0.1456298828125, 0.21728515625, 0.04937744140625, 0.223876953125, 0.10986328125, 0.02978515625, 0.092529296875, 0.09619140625, 0.0906982421875, 0.19970703125, 0.132080078125, 0.243408203125, 0.0843505859375, 0.0390625, 0.21203613281...	embed
58415407_c0	58415407	haskell	0	Title: Count elements in list with list comprehension Problem title: Count elements in list with list comprehension Tags: list, haskell, function Problem: Count elements in list with list comprehension I'm new to Haskell and trying to write a simple function. I would like to get each element compressed by its upcoming ...	Count elements in list with list comprehension Count elements in list with list comprehension list haskell function Data.List Count Char x:xs Count elements in list with list comprehension I'm new to Haskell and trying to write a simple function. I would like to get each element compressed by its upcoming frequency. Fo...	[ -0.00122833251953125, -0.0026092529296875, 0.00189971923828125, 0.0172119140625, 0.021240234375, 0.023681640625, 0.0177001953125, -0.0026702880859375, 0.0164794921875, -0.01104736328125, -0.0079345703125, -0.00836181640625, 0.037109375, 0.0262451171875, -0.046630859375, 0.0027923583984...	[ 108210, 80854, 23, 5303, 678, 46683, 3220, 6889, 1556, 142508, 32354, 11809, 154663, 21656, 1022, 12, 425, 7, 3525, 20625, 31577, 33022, 8781, 1884, 2046, 12638, 12830, 375, 11856, 1257, 277, 12478, 944, 107730, 11, 10545, 11210, 16750, 181...	[ 0.2069091796875, 0.21826171875, 0.090087890625, 0.180419921875, 0.1282958984375, 0.1478271484375, 0.1500244140625, 0.0245819091796875, 0.103759765625, 0.1976318359375, 0.1246337890625, 0.08819580078125, 0.1591796875, 0.1478271484375, 0.050537109375, 0.0186309814453125, 0.077270507812...	embed
12354089_c0	12354089	haskell	0	Title: Ambigous type variable Problem title: Ambigous type variable Tags: type-constraints, haskell Problem: Ambigous type variable I wrote a little haskell program that just counts how many ones there are in a number (Int). When I try to execute it haskell complains about ambigous variable constraints. I know that it ...	Ambigous type variable Ambigous type variable type-constraints haskell Ambigous count_ones n-10 n_new Ambigous type variable I wrote a little haskell program that just counts how many ones there are in a number (Int). When I try to execute it haskell complains about ambigous variable constraints. I know that it comes f...	[ -0.0033416748046875, -0.0093994140625, -0.020263671875, 0.01080322265625, 0.023193359375, 0.0035552978515625, -0.0238037109375, 0.01300048828125, 0.0019378662109375, -0.037353515625, 0.004608154296875, -0.04345703125, 0.0142822265625, 0.019775390625, 0.000637054443359375, -0.0222167968...	[ 10250, 20828, 223, 10644, 77336, 2271, 2816, 4288, 1556, 142508, 54529, 25749, 653, 9193, 54936, 54397, 10176, 1528, 1660, 3642, 5941, 64333, 2685, 23, 14012, 4153, 18, 9790, 71924, 186992, 920, 158, 32497, 4527, 74912, 177261, 118664, 10932,...	[ 0.1812744140625, 0.1422119140625, 0.1500244140625, 0.1619873046875, 0.249267578125, 0.043853759765625, 0.171875, 0.1361083984375, 0.1468505859375, 0.2242431640625, 0.1488037109375, 0.174072265625, 0.01611328125, 0.1383056640625, 0.1180419921875, 0.04144287109375, 0.081298828125, 0....	embed
23724823_c0	23724823	haskell	0	Title: how do you annotate type in HList Problem title: how do you annotate type in HList Tags: hlist, haskell Problem: how do you annotate type in HList I'm trying to use HList and I need to annotate it but I can't figure out how to do it. If if type the following in ghci >:t "hello" .*. HNil I got the following type ...	how do you annotate type in HList how do you annotate type in HList hlist haskell HList HNil how do you annotate type in HList I'm trying to use HList and I need to annotate it but I can't figure out how to do it. If if type the following in ghci I got the following type signature : HList ((':) * [Char] ('[] *)) Which ...	[ 0.00897216796875, -0.004180908203125, -0.004486083984375, 0.007080078125, -0.0172119140625, -0.005126953125, -0.0025634765625, -0.0003070831298828125, 0.005035400390625, -0.01141357421875, -0.00040435791015625, -0.052490234375, 0.00347900390625, -0.0002803802490234375, -0.02685546875, ...	[ 3642, 8668, 19888, 10644, 23, 572, 154663, 1096, 6562, 1556, 142508, 79059, 379, 4527, 26366, 54, 25632, 31380, 318, 138256, 60494, 12, 84068, 1065, 661, 28219, 18499, 17368, 1639, 154453, 23351, 7413 ]	[ 0.05548095703125, 0.17529296875, 0.1849365234375, 0.2330322265625, 0.0689697265625, 0.148681640625, 0.25048828125, 0.10546875, 0.234375, 0.10205078125, 0.1727294921875, 0.0833740234375, 0.1502685546875, 0.03271484375, 0.008087158203125, 0.001708984375, 0.061279296875, 0.08038330078...	embed
5151858_c0	5151858	haskell	0	Title: Running a Haskell program on the Android OS Problem title: Running a Haskell program on the Android OS Tags: android, executable, haskell Problem: Running a Haskell program on the Android OS Forenote: This is an extension of the thread started on /r/haskell Lets start with the facts: Android is one awesome Opera...	Running a Haskell program on the Android OS Running a Haskell program on the Android OS android executable haskell Running Haskell Android Running a Haskell program on the Android OS Forenote: This is an extension of the thread started on /r/haskell Lets start with the facts: Android is one awesome Operating System Has...	[ 0.00799560546875, 0.018310546875, 0.006317138671875, 0.007720947265625, -0.00677490234375, 0.01348876953125, -0.0052490234375, -0.004180908203125, -0.0269775390625, -0.050048828125, 0.00189971923828125, -0.029296875, 0.00180816650390625, 0.0048828125, -0.00341796875, -0.005767822265625...	[ 28398, 592, 20625, 142508, 1528, 98, 70, 3952, 11787, 10, 54527, 71924, 2886, 1556, 52445, 111938, 86997, 26859, 10557, 4034, 15824, 83, 1632, 79929, 16556, 1916, 12353, 2965, 56037, 449, 46876, 23208, 123019, 375, 964, 2856, 2806, 3249, 34...	[ 0.1473388671875, 0.055908203125, 0.1748046875, 0.27685546875, 0.1861572265625, 0.0999755859375, 0.04443359375, 0.2509765625, 0.1690673828125, 0.044586181640625, 0.208251953125, 0.103515625, 0.087158203125, 0.16796875, 0.03106689453125, 0.04010009765625, 0.037078857421875, 0.0049743...	embed
32412743_c0	32412743	haskell	0	Title: I already have an add function how can I use it in multiplication function? Problem title: I already have an add function how can I use it in multiplication function? Tags: haskell Problem: I already have an add function how can I use it in multiplication function? So far I have the definitions for n-1 and n+1 w...	I already have an add function how can I use it in multiplication function? I already have an add function how can I use it in multiplication function? haskell I already have an add function how can I use it in multiplication function? So far I have the definitions for n-1 and n+1 with suc and inc respectively How can ...	[ -0.021484375, 0.021240234375, 0.0238037109375, 0.0164794921875, 0.0004711151123046875, 0.01708984375, -0.000743865966796875, -0.011962890625, 0.000370025634765625, -0.05859375, 0.0157470703125, -0.0279541015625, -0.023681640625, 0.00002193450927734375, 0.0225830078125, -0.023193359375,...	[ 87, 21771, 765, 142, 15190, 32354, 3642, 831, 4527, 442, 23, 127664, 1363, 1556, 142508, 2060, 80934, 653, 5759, 136, 21748, 678, 42593, 238, 903, 17368, 4734, 195625, 1830, 2174, 92733, 110, 997, 20, 3714, 16750, 1022, 661, 113, 105950, ...	[ 0.059814453125, 0.1993408203125, 0.148193359375, 0.0821533203125, 0.2147216796875, 0.25830078125, 0.0802001953125, 0.1201171875, 0.1778564453125, 0.0611572265625, 0.082763671875, 0.2115478515625, 0.101806640625, 0.132568359375, 0.203857421875, 0.020050048828125, 0.1373291015625, 0....	embed
27322591_c0	27322591	haskell	0	Title: Haskell Guards and SublimeText 3 Problem title: Haskell Guards and SublimeText 3 Tags: syntax, syntax-highlighting, sublimetext3, sublimetext, haskell Problem: Haskell Guards and SublimeText 3 I switched over to Sublime Text 3 but now that I was coding some Haskell in ST3 I noticed something quite odd, which is ...	Haskell Guards and SublimeText 3 Haskell Guards and SublimeText 3 syntax syntax-highlighting sublimetext3 sublimetext haskell Haskell Guards SublimeText sublimetext3 Haskell Guards and SublimeText 3 I switched over to Sublime Text 3 but now that I was coding some Haskell in ST3 I noticed something quite odd, which is t...	[ -0.00421142578125, 0.0174560546875, 0.01361083984375, -0.0274658203125, 0.01123046875, -0.000583648681640625, -0.029296875, 0.0218505859375, -0.002471923828125, 0.01513671875, 0.003509521484375, -0.0098876953125, -0.01220703125, 0.0003490447998046875, 0.013671875, -0.007415771484375, ...	[ 20625, 142508, 135440, 7, 136, 8273, 150, 282, 174379, 138, 6002, 86531, 84396, 177476, 117584, 13, 22829, 363, 1556, 101089, 645, 24129, 552, 16992, 156672, 70270, 127308, 214, 62775, 56050, 33022, 5117, 35011, 134855, 12921, 24092, 17664, 2...	[ 0.119384765625, 0.2137451171875, 0.2296142578125, 0.109130859375, 0.015716552734375, 0.090087890625, 0.10382080078125, 0.1136474609375, 0.1817626953125, 0.161865234375, 0.1075439453125, 0.213134765625, 0.1046142578125, 0.1719970703125, 0.167236328125, 0.02386474609375, 0.171142578125...	embed
30369954_c0	30369954	haskell	0	Title: How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? Problem title: How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? Tags: haskell, foldleft, recursion Problem: How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? I am l...	How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? haskell foldleft recursion How How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? I am learning haskell and I tried to writ...	[ -0.01068115234375, 0.01177978515625, 0.0189208984375, 0.01708984375, -0.0189208984375, 0.011962890625, 0.0037994384765625, 0.000568389892578125, 0.000286102294921875, -0.019287109375, 0.0101318359375, -0.00567626953125, 0.010009765625, 0.007293701171875, 0.004974365234375, -0.024414062...	[ 11249, 14602, 903, 18344, 20469, 77007, 32354, 4488, 1176, 107, 37676, 2203, 420, 21392, 84142, 1556, 142508, 19298, 2480, 195625, 1830, 52080, 37842, 33022, 10002, 39531, 184, 15490, 17368, 29806, 31577, 28219, 96276, 20271, 219836, 831, 18, ...	[ 0.094970703125, 0.0833740234375, 0.1064453125, 0.183349609375, 0.236328125, 0.150146484375, 0.1929931640625, 0.1591796875, 0.1343994140625, 0.1448974609375, 0.31640625, 0.1070556640625, 0.1044921875, 0.2298583984375, 0.1044921875, 0.08709716796875, 0.19921875, 0.0802001953125, 0....	embed
12318985_c0	12318985	haskell	0	Title: Print NominalDiffTime in Haskell Problem title: Print NominalDiffTime in Haskell Tags: type-conversion, haskell Problem: Print NominalDiffTime in Haskell I have piece of code like this in my Haskell program: ... start <- getCurrentTime ... end <- getCurrentTime ... delta = end `diffUTCTime` start ... After this,...	Print NominalDiffTime in Haskell Print NominalDiffTime in Haskell type-conversion haskell Print NominalDiffTime Haskell Num PrintfArg Print NominalDiffTime in Haskell I have piece of code like this in my Haskell program: After this, delta has type NominalDiffTime . As written in the documentation, this type in inherite...	[ -0.0181884765625, 0.0091552734375, 0.0194091796875, 0.0033111572265625, -0.007476806640625, -0.004119873046875, 0.0096435546875, -0.00152587890625, -0.004486083984375, -0.010986328125, 0.004058837890625, -0.035400390625, -0.002227783203125, -0.0155029296875, -0.023193359375, 0.00331115...	[ 39754, 438, 1249, 289, 397, 32920, 70059, 20625, 142508, 23, 10644, 2271, 46354, 1556, 52782, 420, 7614, 177, 63847, 18151, 1884, 903, 1528, 24372, 40703, 59121, 209806, 86151, 3444, 28412, 442, 678, 138, 27781, 44677, 7103, 32380, 2749, 20...	[ 0.2066650390625, 0.104736328125, 0.1866455078125, 0.1025390625, 0.0965576171875, 0.1986083984375, 0.239013671875, 0.144775390625, 0.24462890625, 0.022247314453125, 0.1767578125, 0.03021240234375, 0.114501953125, 0.1097412109375, 0.1783447265625, 0.1510009765625, 0.0872802734375, 0....	embed
25352757_c0	25352757	haskell	0	Title: Installing mingwrt into the haskell-platform without mingw-get Problem title: Installing mingwrt into the haskell-platform without mingw-get Tags: haskell, mingw, windows, haskell-platform Problem: Installing mingwrt into the haskell-platform without mingw-get The haskell-platform (2014.2.0.0) ships MingGW, but ...	Installing mingwrt into the haskell-platform without mingw-get Installing mingwrt into the haskell-platform without mingw-get haskell mingw windows haskell-platform Installing Installing mingwrt into the haskell-platform without mingw-get The haskell-platform (2014.2.0.0) ships MingGW, but without mingw-get. However, t...	[ -0.005950927734375, -0.00112152099609375, 0.01446533203125, -0.0033721923828125, -0.003814697265625, -0.0010986328125, 0.00244140625, -0.014892578125, 0.0089111328125, -0.02490234375, 0.0101318359375, -0.007171630859375, -0.000919342041015625, -0.000377655029296875, 0.01458740234375, 0...	[ 107951, 881, 115899, 18, 3934, 1556, 142508, 172121, 15490, 46996, 434, 3794, 54825, 7360, 73011, 77495, 109923, 276, 214, 102550, 1284, 9969, 1340, 70, 5423, 98908, 128239, 3871, 29096, 5, 127, 2831, 115723, 59720, 4527, 20600, 959, 99201, ...	[ 0.158447265625, 0.1883544921875, 0.214111328125, 0.211669921875, 0.1236572265625, 0.135986328125, 0.2325439453125, 0.16162109375, 0.1285400390625, 0.19873046875, 0.1876220703125, 0.1868896484375, 0.1011962890625, 0.1591796875, 0.138916015625, 0.052001953125, 0.10400390625, 0.088378...	embed
26452874_c1	26452874	haskell	1	s', count <> onePut)) Side note, I am also stumped as to how I would get the "count" part of the state' out of the state' so I can write it on the screen Maybe it's more helpful to explain what run is supposed to do. For instance if you use a function label, that labels each node in a tree with an incrementing number ...	s', count <> onePut)) Side note, I am also stumped as to how I would get the "count" part of the state' out of the state' so I can write it on the screen Maybe it's more helpful to explain what run is supposed to do. For instance if you use a function label, that labels each node in a tree with an incrementing number ...	[ -0.000293731689453125, -0.007049560546875, -0.0128173828125, 0.0162353515625, 0.0194091796875, 0.0108642578125, -0.03466796875, -0.0260009765625, 0.0205078125, -0.027099609375, 0.0017852783203125, -0.000728607177734375, 0.00188446044921875, 0.00653076171875, 0.0111083984375, -0.0181884...	[ 91, 25, 54529, 1632, 27559, 18, 48708, 20051, 3642, 2046, 71013, 2831, 11341, 1810, 111, 831, 33022, 98, 49119, 98893, 73342, 11675, 83, 134598, 47, 54, 4527, 32354, 67967, 12638, 110, 112, 53201, 158661, 14012, 71924, 152526, 496, 3884, ...	[ 0.048980712890625, 0.1060791015625, 0.2294921875, 0.1385498046875, 0.14501953125, 0.0987548828125, 0.026763916015625, 0.032623291015625, 0.02252197265625, 0.051300048828125, 0.208984375, 0.0966796875, 0.16552734375, 0.087158203125, 0.0404052734375, 0.004302978515625, 0.1353759765625,...	embed
26964933_c0	26964933	haskell	0	Title: Folding over an ITree Problem title: Folding over an ITree Tags: haskell Problem: Folding over an ITree Given the following ITree , from Typeclassopedia : data ITree a = Leaf (Int -> a) \| Node [ITree a] What's the proper signature for foldTree - fold over the entire tree? Here's my incorrect attempt that does no...	Folding over an ITree Folding over an ITree haskell Folding ITree Leaf Node Folding over an ITree Given the following ITree , from Typeclassopedia : data ITree a = Leaf (Int -> a) \| Node [ITree a] What's the proper signature for foldTree - fold over the entire tree? Here's my incorrect attempt that does not compile: Ho...	[ -0.0026092529296875, -0.0042724609375, -0.0023345947265625, -0.0037841796875, -0.0037384033203125, 0.005096435546875, -0.0255126953125, -0.01556396484375, 0.0048828125, -0.0322265625, 0.0098876953125, -0.0322265625, -0.011474609375, 0.0086669921875, -0.01202392578125, -0.016357421875, ...	[ 30077, 6238, 645, 142, 107, 13, 1556, 142508, 636, 2407, 438, 112, 60457, 67413, 76994, 2053, 5959, 10, 18, 33079, 27798, 138256, 42822, 62731, 64194, 53201, 214552, 81887, 9969, 1340, 452, 201505, 5303, 1022, 7225, 70270, 17932, 103510, 14...	[ 0.2191162109375, 0.108642578125, 0.1756591796875, 0.0577392578125, 0.1983642578125, 0.1541748046875, 0.0970458984375, 0.192626953125, 0.06634521484375, 0.1744384765625, 0.115478515625, 0.1561279296875, 0.06134033203125, 0.0689697265625, 0.07562255859375, 0.103759765625, 0.00308227539...	embed
28888587_c0	28888587	haskell	0	Title: Can GHC warn about the uses of dangerous non-total functions? Problem title: Can GHC warn about the uses of dangerous non-total functions? Tags: ghc, crash, error-handling, haskell, compiler-warnings Problem: Can GHC warn about the uses of dangerous non-total functions? I have been writing quickly some code in H...	Can GHC warn about the uses of dangerous non-total functions? Can GHC warn about the uses of dangerous non-total functions? ghc crash error-handling haskell compiler-warnings Can GHC Can GHC warn about the uses of dangerous non-total functions? I have been writing quickly some code in Haskell, and used a dangerous non-...	[ 0.0022125244140625, 0.00537109375, 0.0135498046875, -0.00396728515625, -0.018798828125, 0.023681640625, -0.0074462890625, -0.004241943359375, -0.00775146484375, -0.033447265625, 0.0067138671875, -0.012451171875, 0.01239013671875, 0.00994873046875, 0.0233154296875, -0.000919342041015625...	[ 4171, 527, 73265, 1631, 19, 4527, 111, 169907, 351, 188, 1803, 32354, 7, 31380, 238, 150631, 18499, 54885, 1556, 142508, 9969, 34759, 4205, 1672, 32562, 69405, 18151, 20625, 11814, 1295, 127794, 136913, 41206, 34292, 107730, 20623, 4358, 3135...	[ 0.0723876953125, 0.1251220703125, 0.2431640625, 0.1358642578125, 0.061004638671875, 0.142333984375, 0.03619384765625, 0.2086181640625, 0.1795654296875, 0.1202392578125, 0.160888671875, 0.203125, 0.0227813720703125, 0.1094970703125, 0.117919921875, 0.161865234375, 0.12548828125, 0.1...	embed
20967408_c0	20967408	haskell	0	Title: Cabal - how to install specific version of package Problem title: Cabal - how to install specific version of package Tags: cabal, haskell Problem: Cabal - how to install specific version of package I need for example a minor version of a package, for example persistent-postgresql .. or hdbc-mysql or whatever. If...	Cabal - how to install specific version of package Cabal - how to install specific version of package cabal haskell Cabal Cabal - how to install specific version of package I need for example a minor version of a package, for example persistent-postgresql .. or hdbc-mysql or whatever. If I run it will install persisten...	[ 0.015625, 0.005950927734375, 0.021484375, 0.0028076171875, -0.000514984130859375, 0.006591796875, -0.0036163330078125, -0.0106201171875, -0.005584716796875, 0.041015625, 0.0091552734375, -0.0537109375, 0.005401611328125, 0.00408935546875, -0.006744384765625, 0.0028076171875, 0.004699...	[ 30438, 289, 3642, 47, 20600, 29458, 11389, 111, 98169, 109524, 1556, 142508, 3871, 43967, 70560, 2517, 4594, 17562, 99247, 26488, 65037, 74277, 89778, 11675, 41491, 18499, 19713, 25632, 42548, 117538, 132283, 977, 1369, 34635, 1230, 4426, 1884,...	[ 0.1796875, 0.1763916015625, 0.09698486328125, 0.05401611328125, 0.2113037109375, 0.2086181640625, 0.2181396484375, 0.04541015625, 0.2230224609375, 0.25634765625, 0.1173095703125, 0.2095947265625, 0.0672607421875, 0.082763671875, 0.140869140625, 0.0916748046875, 0.0965576171875, 0.1...	embed
43778866_c1	43778866	haskell	1	" = return $ Backend BackendB test :: String -> IO () test name = createBackend name >>= \case Backend imp -> withConn imp 10 100 func If i do not wrap the IBackend returned by createBackend in data Backend , the createBackend function won't compile. But now i have to use a case statement in test function to unbox IBac...	" = return $ Backend BackendB test :: String -> IO () test name = createBackend name >>= \case Backend imp -> withConn imp 10 100 func If i do not wrap the IBackend returned by createBackend in data Backend , the createBackend function won't compile. But now i have to use a case statement in test function to unbox IBac...	[ 0.00032806396484375, 0.01104736328125, -0.004547119140625, 0.0167236328125, 0.00787353515625, -0.003692626953125, 0.00469970703125, -0.02392578125, 0.021728515625, -0.01348876953125, 0.011962890625, -0.0072021484375, -0.0034637451171875, -0.0240478515625, 0.00286865234375, -0.001518249...	[ 44, 2203, 30646, 3650, 26828, 3611, 571, 3034, 23351, 17780, 9351, 28282, 152470, 58437, 21980, 678, 11935, 19, 209, 805, 7477, 959, 137565, 87, 176377, 23, 2053, 32354, 23742, 18, 9969, 1340, 7225, 63805, 51, 11728, 1295, 10176, 1452, 12...	[ 0.0269317626953125, 0.035888671875, 0.12939453125, 0.09112548828125, 0.1805419921875, 0.1951904296875, 0.1539306640625, 0.20947265625, 0.1182861328125, 0.16943359375, 0.044219970703125, 0.1646728515625, 0.1942138671875, 0.1436767578125, 0.119873046875, 0.110595703125, 0.0753173828125...	embed
48131758_c0	48131758	haskell	0	Title: Haskell: how to get the common words Problem title: Haskell: how to get the common words Tags: haskell Problem: Haskell: how to get the common words I am trying to do drop common words function, but I do not know how to get or find the common word list. Do I need to create a common words list? Thank you The ques...	Haskell: how to get the common words Haskell: how to get the common words haskell Haskell Takes English Returns Haskell: how to get the common words I am trying to do drop common words function, but I do not know how to get or find the common word list. Do I need to create a common words list? Thank you The question : ...	[ -0.010009765625, -0.008056640625, -0.020263671875, -0.01312255859375, 0.00015354156494140625, 0.012451171875, 0.0159912109375, -0.0196533203125, 0.00177001953125, -0.01336669921875, 0.0133056640625, -0.00093841552734375, 0.0220947265625, -0.01129150390625, -0.0162353515625, -0.00268554...	[ 20625, 142508, 3642, 47, 2046, 70, 39210, 34153, 1556, 2561, 90, 14941, 173340, 31577, 36069, 32354, 959, 3714, 7413, 2565, 5303, 3871, 28282, 9655, 16750, 1884, 3688, 759, 63049, 7, 18151 ]	[ 0.107666015625, 0.2303466796875, 0.041259765625, 0.0572509765625, 0.12890625, 0.0693359375, 0.18212890625, 0.2208251953125, 0.1146240234375, 0.08203125, 0.055633544921875, 0.1116943359375, 0.148681640625, 0.007904052734375, 0.1837158203125, 0.105224609375, 0.001922607421875, 0.0254...	embed
48884276_c0	48884276	haskell	0	Title: Why doesn't this function work if I use "[xs]" instead of "xs"? Problem title: Why doesn't this function work if I use "[xs]" instead of "xs"? Tags: haskell Problem: Why doesn't this function work if I use "[xs]" instead of "xs"? split :: [a] -> Int -> ([a], [a])...	Why doesn't this function work if I use "[xs]" instead of "xs"? Why doesn't this function work if I use "[xs]" instead of "xs"? haskell Why Why doesn't this function work if I use "[xs]" instead of "xs"? The same code works if I give the variable as xs instead of [xs] ,...	[ -0.0211181640625, 0.01190185546875, -0.00653076171875, -0.0224609375, -0.015869140625, 0.0054931640625, 0.007110595703125, -0.01202392578125, 0.0213623046875, -0.0072021484375, 0.0224609375, 0.000293731689453125, 0.0022125244140625, 0.0020294189453125, -0.006317138671875, 0.01348876953...	[ 44084, 22027, 3768, 18, 903, 32354, 4488, 2174, 4527, 41502, 1065, 425, 7, 64457, 1556, 142508, 268, 581, 5701, 18151, 43240, 8337, 77336, 237, 1022, 378, 138256, 15044, 345, 18499, 103510, 83, 351, 3355, 18391, 4935, 28219, 107730, 26038, ...	[ 0.0858154296875, 0.1136474609375, 0.077880859375, 0.12109375, 0.0950927734375, 0.1964111328125, 0.1446533203125, 0.049224853515625, 0.09149169921875, 0.06036376953125, 0.069091796875, 0.194091796875, 0.170166015625, 0.173583984375, 0.1292724609375, 0.2003173828125, 0.045074462890625,...	embed
15558577_c0	15558577	haskell	0	Title: finding the position of an element from a list of list Problem title: finding the position of an element from a list of list Tags: list, haskell Problem: finding the position of an element from a list of list I want to find the position of an element from a list of list. FOr example , in a given list [[1,2,3],[4...	finding the position of an element from a list of list finding the position of an element from a list of list list haskell a finding the position of an element from a list of list I want to find the position of an element from a list of list. FOr example , in a given list [[1,2,3],[4,5,6],[7,8,9]] I want to find the po...	[ 0.0072021484375, 0.0177001953125, 0.0006561279296875, 0.0011138916015625, -0.0262451171875, 0.0181884765625, -0.00092315673828125, 0.0021209716796875, -0.00518798828125, -0.007476806640625, 0.0218505859375, -0.01806640625, 0.005401611328125, -0.000621795654296875, -0.0306396484375, 0.0...	[ 90791, 70, 19069, 111, 142, 12830, 1295, 10, 5303, 1556, 142508, 87, 3444, 47, 7413, 27781, 23, 34475, 133063, 96386, 617, 104629, 966, 145180, 3217, 32354, 5608, 30646, 363, 90173, 50960, 15555, 136, 17932, 3365, 316, 185723, 442, 831, 9...	[ 0.1363525390625, 0.0670166015625, 0.2344970703125, 0.1370849609375, 0.0179595947265625, 0.227783203125, 0.1737060546875, 0.03460693359375, 0.213134765625, 0.145263671875, 0.2362060546875, 0.033660888671875, 0.087158203125, 0.04669189453125, 0.15234375, 0.08447265625, 0.0018310546875,...	embed
44174573_c0	44174573	haskell	0	Title: Changing Global Cabal Flags from the Command Line with Stack Problem title: Changing Global Cabal Flags from the Command Line with Stack Tags: cabal, haskell-stack, haskell Problem: Changing Global Cabal Flags from the Command Line with Stack From a project's cabal file: flag buildAll Description: Build all prog...	Changing Global Cabal Flags from the Command Line with Stack Changing Global Cabal Flags from the Command Line with Stack cabal haskell-stack haskell the Changing Global Cabal Flags Command Line Stack Description Build Default Changing Global Cabal Flags from the Command Line with Stack From a project's cabal file: I w...	[ 0.004669189453125, -0.00017261505126953125, -0.004364013671875, 0.006378173828125, 0.00823974609375, -0.019775390625, -0.019775390625, 0.013427734375, -0.006988525390625, 0.034912109375, 0.01055908203125, -0.0107421875, 0.003204345703125, 0.01263427734375, -0.00799560546875, 0.01269531...	[ 108193, 13453, 30438, 289, 125726, 7, 1295, 123573, 16777, 678, 6512, 2594, 109524, 1556, 142508, 590, 214, 70643, 121137, 262, 1021, 13452, 11435, 36663, 5423, 903, 29568, 177261, 45367, 46480, 1010, 22819, 80280, 4210, 190872, 43512, 4488, ...	[ 0.2144775390625, 0.1754150390625, 0.197998046875, 0.1514892578125, 0.25537109375, 0.09326171875, 0.053955078125, 0.20263671875, 0.1650390625, 0.0440673828125, 0.1593017578125, 0.126708984375, 0.2236328125, 0.088623046875, 0.1697998046875, 0.1199951171875, 0.021514892578125, 0.13256...	embed
832569_c0	832569	haskell	0	Title: List of Functional code snippets for Procedural Programmers? Problem title: List of Functional code snippets for Procedural Programmers? Tags: ocaml, haskell, code-snippets, functional-programming, f%23 Problem: List of Functional code snippets for Procedural Programmers? Sometimes I still get stuck trying to tr...	List of Functional code snippets for Procedural Programmers? List of Functional code snippets for Procedural Programmers? ocaml haskell code-snippets functional-programming f%23 List Functional Procedural Programmers List of Functional code snippets for Procedural Programmers? Sometimes I still get stuck trying to tran...	[ 0.02734375, -0.0015411376953125, 0.002471923828125, -0.0177001953125, 0.000186920166015625, 0.013427734375, -0.0130615234375, -0.0064697265625, -0.0040283203125, -0.022705078125, 0.00179290771484375, 0.00009059906005859375, -0.01806640625, 0.004364013671875, 0.013427734375, -0.00034332...	[ 32036, 111, 28670, 10763, 289, 18151, 91, 93, 58134, 7, 100, 170470, 27958, 1314, 36, 9779, 141, 1556, 142508, 123309, 28966, 1238, 3949, 3742, 160193, 7464, 179933, 31577, 3900, 19309, 59158, 3934, 5303, 13373, 28016, 291, 48398, 47, 9879,...	[ 0.0960693359375, 0.0207672119140625, 0.146728515625, 0.10693359375, 0.144775390625, 0.177734375, 0.0162506103515625, 0.1285400390625, 0.16162109375, 0.036224365234375, 0.060943603515625, 0.2154541015625, 0.166015625, 0.10595703125, 0.0521240234375, 0.0828857421875, 0.0950927734375, ...	embed

29014044_c0

29014044

haskell

0

Title: How to display the list but without a certain item. Problem title: How to display the list but without a certain item. Tags: haskell, list Problem: How to display the list but without a certain item. I have the following list, that contains a list of strings.. I have already searched the orginal list for the lis...

How to display the list but without a certain item. How to display the list but without a certain item. haskell list How George How to display the list but without a certain item. I have the following list, that contains a list of strings.. I have already searched the orginal list for the lists that contain the string ...

[ -0.0004730224609375, 0.01141357421875, -0.01422119140625, -0.002166748046875, 0.01165771484375, 0.007568359375, 0.00823974609375, 0.0218505859375, 0.000568389892578125, -0.0037384033203125, 0.00250244140625, -0.0162353515625, -0.0016326904296875, 0.0225830078125, -0.023681640625, 0.003...

[ 11249, 47, 44116, 70, 5303, 1284, 15490, 24233, 35735, 1556, 142508, 14787, 25632, 70541, 79315, 33938, 30910, 5928, 32599, 46683, 3220, 3714, 3642, 4358 ]

[ 0.07366943359375, 0.03472900390625, 0.191650390625, 0.00384521484375, 0.2203369140625, 0.1339111328125, 0.1556396484375, 0.06842041015625, 0.14306640625, 0.1170654296875, 0.2156982421875, 0.1717529296875, 0.0428466796875, 0.09619140625, 0.1605224609375, 0.010223388671875, 0.012481689...

embed

43667374_c0

43667374

haskell

0

Title: Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) Problem title: Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) Tags: monads, monoids, haskell, applicative Problem: Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) I recall this is very basic, and could simply be done with pattern matching even through a lambda lik...

Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) monads monoids haskell applicative Mappend Mappend (a1,b1) and (a2,b2) into (a1+a2, b1+b2) I recall this is very basic, and could simply be done with pattern matching even through a lambda like (\a b -> (fst a + fst b, snd a...

[ -0.00897216796875, 0.006378173828125, -0.001739501953125, 0.034423828125, 0.00775146484375, 0.03076171875, -0.0106201171875, 0.004791259765625, 0.030517578125, -0.01806640625, 0.009765625, -0.016357421875, -0.005950927734375, 0.02001953125, 0.0050048828125, -0.0284423828125, -0.00259...

[ 911, 9858, 71, 11, 418, 275, 17727, 136, 304, 10461, 3934, 1328, 876, 2667, 712, 22460, 30185, 1556, 142508, 41816, 4935, 189232, 903, 4552, 62822, 5809, 42856, 16940, 103510, 14858, 214, 3853, 8305, 21, 6492, 85, 33079, 271, 997, 2208, ...

[ 0.208984375, 0.2052001953125, 0.1953125, 0.08270263671875, 0.063232421875, 0.1387939453125, 0.0860595703125, 0.053070068359375, 0.1173095703125, 0.139892578125, 0.1553955078125, 0.08837890625, 0.117431640625, 0.116943359375, 0.12939453125, 0.1751708984375, 0.2076416015625, 0.138916...

embed

46384713_c0

46384713

haskell

0

Title: How to know the data type of a value of a sum type Problem title: How to know the data type of a value of a sum type Tags: haskell Problem: How to know the data type of a value of a sum type Say I have such sum type data YesOrNo = Yes | No If somehow I have a value of this type in GHCI >:t yOrN yOrN :: YesOrNo I...

How to know the data type of a value of a sum type How to know the data type of a value of a sum type haskell How YesOrNo Yes How to know the data type of a value of a sum type Say I have such sum type If somehow I have a value of this type in GHCI Is it possible to get the data type of this value so that I know if it'...

[ 0.0002956390380859375, 0.003814697265625, 0.0084228515625, 0.031982421875, -0.0218505859375, 0.005889892578125, -0.00946044921875, 0.00653076171875, -0.01019287109375, -0.01495361328125, 0.007476806640625, -0.019775390625, -0.0186767578125, -0.0177001953125, 0.00836181640625, 0.0016326...

[ 11249, 47, 3714, 70, 2053, 10644, 111, 34292, 10554, 10, 1556, 142508, 32635, 19060, 5021, 87, 765, 6044, 209303, 903, 23, 41877, 17304, 7722, 2046, 707, 438, 17368, 35773, 1294, 30646, 209, 1328, 52895, 139509, 4588, 10557, 29102, 275, 1...

[ 0.08990478515625, 0.07098388671875, 0.133056640625, 0.0164642333984375, 0.1656494140625, 0.252197265625, 0.0723876953125, 0.1929931640625, 0.2052001953125, 0.014373779296875, 0.142333984375, 0.217529296875, 0.1429443359375, 0.1016845703125, 0.1529541015625, 0.003875732421875, 0.02713...

embed

9448384_c0

9448384

haskell

0

Title: Re-define "stringLiteral" token in Parsec.Token Problem title: Re-define "stringLiteral" token in Parsec.Token Tags: parsing, pascal, haskell, parsec Problem: Re-define "stringLiteral" token in Parsec.Token I am developing Pascal language parser in Haskell using Parsec library and I need to r...

Re-define "stringLiteral" token in Parsec.Token Re-define "stringLiteral" token in Parsec.Token parsing pascal haskell parsec Re-define Parsec.Token Re-define "stringLiteral" token in Parsec.Token I am developing Pascal language parser in Haskell using Parsec library and I need to re-define some tok...

[ 0.00180816650390625, 0.0255126953125, 0.000629425048828125, 0.035400390625, -0.023193359375, -0.009765625, -0.00116729736328125, 0.003509521484375, -0.00086212158203125, 0.01153564453125, -0.0042724609375, -0.00665283203125, -0.019775390625, 0.0004405975341796875, 0.00732421875, 0.0220...

[ 853, 112, 64552, 91693, 9506, 720, 289, 41502, 47, 1098, 2392, 39797, 7763, 366, 452, 6827, 1556, 142508, 168698, 167599, 46876, 2189, 20625, 35773, 3871, 456, 84694, 61924, 18507, 7225, 15549, 3642, 79315, 14858, 114977, 80934, 9844, 17721, ...

[ 0.1165771484375, 0.11181640625, 0.1685791015625, 0.1815185546875, 0.094970703125, 0.1689453125, 0.1651611328125, 0.005126953125, 0.1455078125, 0.218017578125, 0.147216796875, 0.25244140625, 0.1336669921875, 0.1002197265625, 0.0220489501953125, 0.07763671875, 0.07220458984375, 0.208...

embed

32728329_c0

32728329

haskell

0

Title: How to SPECIALIZE for a hsc2hs type? Problem title: How to SPECIALIZE for a hsc2hs type? Tags: ghc, hsc2hs, haskell Problem: How to SPECIALIZE for a hsc2hs type? I'm trying to use the SPECIALIZE pragma to a type I get through hsc2hs's #type . I tried something like this: {-# SPECIALIZE someFn :: #{type DWORD} ->...

How to SPECIALIZE for a hsc2hs type? How to SPECIALIZE for a hsc2hs type? ghc hsc2hs haskell How SPECIALIZE hsc2hs DWORD Bool How to SPECIALIZE for a hsc2hs type? I'm trying to use the SPECIALIZE pragma to a type I get through hsc2hs's #type . I tried something like this: That attempt fails with a parse error on input ...

[ 0.01287841796875, 0.032958984375, -0.0030364990234375, -0.01611328125, -0.00110626220703125, 0.0126953125, -0.00439453125, 0.0028839111328125, 0.00011348724365234375, 0.0025177001953125, -0.016845703125, -0.004852294921875, -0.00194549560546875, -0.018798828125, -0.0108642578125, 0.023...

[ 11249, 47, 224343, 568, 19157, 100, 1096, 10382, 304, 127, 7, 10644, 31380, 238, 1556, 142508, 30439, 36639, 929, 31577, 4527, 58827, 192, 8305, 468, 50986, 37842, 81887, 35782, 366, 184, 18499, 107730, 4904, 5117, 35166, 4488, 156377, 4662...

[ 0.06427001953125, 0.0550537109375, 0.21142578125, 0.1221923828125, 0.1739501953125, 0.0853271484375, 0.092529296875, 0.119873046875, 0.110595703125, 0.1427001953125, 0.08709716796875, 0.17919921875, 0.033355712890625, 0.0147705078125, 0.103759765625, 0.166259765625, 0.021514892578125...

embed

63975163_c0

63975163

haskell

0

Title: Type pararmeter as the data/value constructor Problem title: Type pararmeter as the data/value constructor Tags: haskell Problem: Type pararmeter as the data/value constructor Reading through Numeric.LinearProgramming I am confused by the type declaration data Bound x = x :<=: Double | x :>=: Double | x :&: (Dou...

Type pararmeter as the data/value constructor Type pararmeter as the data/value constructor haskell Type Numeric.LinearProgramming Bound Double Free Show Type pararmeter as the data/value constructor Reading through Numeric.LinearProgramming I am confused by the type declaration Suppose we input Int in place of x . The...

[ -0.00046539306640625, 0.0118408203125, -0.00830078125, 0.00653076171875, 0.005645751953125, 0.0191650390625, -0.00101470947265625, -0.01220703125, 0.003570556640625, 0.00738525390625, -0.00689697265625, -0.044921875, 0.00811767578125, 0.00872802734375, -0.00909423828125, 0.002136230468...

[ 60457, 121, 42, 29089, 237, 2053, 64, 27494, 64549, 748, 1556, 142508, 93511, 1771, 93232, 172895, 2460, 7030, 107172, 5153, 17367, 104951, 8305, 55681, 10644, 21635, 121691, 107730, 360, 18, 3687, 1022, 32786, 1230, 48400, 96060, 1984, 83, ...

[ 0.2724609375, 0.1396484375, 0.06378173828125, 0.2139892578125, 0.08929443359375, 0.1279296875, 0.029754638671875, 0.1455078125, 0.1859130859375, 0.125732421875, 0.12939453125, 0.222900390625, 0.065185546875, 0.004913330078125, 0.0950927734375, 0.1048583984375, 0.051605224609375, 0....

embed

24806859_c0

24806859

haskell

0

Title: Adding to list, Haskell compiling error Problem title: Adding to list, Haskell compiling error Tags: haskell Problem: Adding to list, Haskell compiling error -- Sample test data type Sales = (String, String, Int) testData :: [Sales] testData :: [("Me and My Broken Heart","Rixton"),("It’s My Birthday","will.i.am"...

Adding to list, Haskell compiling error Adding to list, Haskell compiling error haskell Adding Haskell Sample Sales Broken Heart Rixton Birthday will.i.am Problem Ariana Grande Adding to list, Haskell compiling error I get the error "illegal literal in type : "Me and my broken

[ -0.00665283203125, 0.00518798828125, 0.001129150390625, 0.02001953125, -0.006195068359375, 0.0289306640625, -0.02685546875, 0.01043701171875, 0.006011962890625, -0.006378173828125, 0.0037078857421875, -0.021240234375, 0.01507568359375, 0.02197265625, -0.004150390625, -0.00811767578125,...

[ 62, 59725, 47, 5303, 20625, 142508, 9969, 49725, 18499, 1556, 947, 33209, 88583, 13177, 1098, 60861, 2975, 425, 1507, 158080, 1221, 14, 302, 15649, 120524, 11, 22634, 70, 2186, 2870, 15659, 289, 10644, 6696, 136, 759, 148431 ]

[ 0.0902099609375, 0.1358642578125, 0.1517333984375, 0.1934814453125, 0.1534423828125, 0.24462890625, 0.1573486328125, 0.143798828125, 0.2049560546875, 0.13818359375, 0.0830078125, 0.152099609375, 0.1484375, 0.1939697265625, 0.1085205078125, 0.2178955078125, 0.06414794921875, 0.07684...

embed

49976795_c0

49976795

haskell

0

Title: Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter Problem title: Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter Tags: haskell, monad-transformers Problem: Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter I just discovered that RWST...

Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter haskell monad-transformers Why RWST MonadReader MonadState MonadWriter Why is RWST ... m a not an instance of MonadReader, MonadState, MonadWriter I just discovered tha...

[ -0.01068115234375, 0.000518798828125, 0.00982666015625, -0.0155029296875, 0.00848388671875, -0.0235595703125, 0.002410888671875, -0.0140380859375, -0.0135498046875, 0.02685546875, -0.003936767578125, 0.0052490234375, -0.0146484375, 0.00147247314453125, -0.007476806640625, -0.0132446289...

[ 44084, 83, 78691, 8545, 153, 347, 10, 959, 110527, 60331, 71, 31345, 56, 135206, 1456, 2783, 1556, 142508, 2667, 712, 215175, 1314, 13, 161063, 27198, 85358, 70270, 2806, 109312, 52295, 1821, 41159, 19048, 4527, 5, 1369, 223, 172561, 31635,...

[ 0.1002197265625, 0.033355712890625, 0.16650390625, 0.203857421875, 0.1043701171875, 0.14013671875, 0.047454833984375, 0.0994873046875, 0.2215576171875, 0.1448974609375, 0.106689453125, 0.2105712890625, 0.13720703125, 0.1533203125, 0.072265625, 0.1546630859375, 0.06365966796875, 0.1...

embed

53831352_c0

53831352

haskell

0

Title: HASKELL : handling NULL value in database query with Maybe (or other ...) Problem title: HASKELL : handling NULL value in database query with Maybe (or other ...) Tags: haskell Problem: HASKELL : handling NULL value in database query with Maybe (or other ...) I have this query in SQL used by my Haskell code: let...

HASKELL : handling NULL value in database query with Maybe (or other ...) HASKELL : handling NULL value in database query with Maybe (or other ...) haskell WDS HASKELL Maybe qry_head_WDS DNUM DISC Query bd_rows_WDS Only name::String forM_ Text.unpack Exception UnexpectedNull Text Main HASKELL : handling NULL value in d...

[ 0.01177978515625, -0.0054931640625, 0.0081787109375, 0.01165771484375, -0.00531005859375, 0.006744384765625, 0.016845703125, -0.02734375, -0.0072021484375, 0.004150390625, 0.00537109375, -0.01055908203125, -0.006591796875, -0.0103759765625, -0.019287109375, -0.009521484375, 0.0128173...

[ 11666, 10762, 56051, 45064, 18057, 23708, 34292, 63399, 41, 1294, 678, 83425, 3789, 1556, 142508, 601, 13526, 31251, 109020, 62562, 58836, 34145, 15555, 1456, 87293, 9351, 71713, 100, 594, 24129, 309, 29102, 63928, 992, 83613, 18444, 1181, 12...

[ 0.1156005859375, 0.138427734375, 0.2138671875, 0.1727294921875, 0.1943359375, 0.1934814453125, 0.2177734375, 0.176513671875, 0.114990234375, 0.076416015625, 0.0679931640625, 0.2802734375, 0.082763671875, 0.1009521484375, 0.212890625, 0.01171875, 0.1072998046875, 0.08740234375, 0....

embed

26697048_c0

26697048

haskell

0

Title: Getting parse error on using head function on a list in haskell Problem title: Getting parse error on using head function on a list in haskell Tags: compiler-errors, haskell Problem: Getting parse error on using head function on a list in haskell I have a function, ground n p, with two input parameters n and p, ...

Getting parse error on using head function on a list in haskell Getting parse error on using head function on a list in haskell compiler-errors haskell head Getting Getting parse error on using head function on a list in haskell I have a function, ground n p, with two input parameters n and p, that returns like this: [...

[ -0.00537109375, 0.01080322265625, -0.002197265625, 0.0029754638671875, -0.00092315673828125, 0.020751953125, -0.00640869140625, -0.0036773681640625, 0.0133056640625, -0.051025390625, -0.00189208984375, -0.00830078125, 0.0230712890625, -0.0081787109375, 0, -0.016357421875, 0.003784179...

[ 210732, 366, 184, 18499, 98, 17368, 10336, 32354, 5303, 23, 1556, 142508, 9969, 34759, 188800, 765, 61585, 653, 915, 6626, 107730, 171859, 136, 30646, 1884, 206808, 76172, 63527, 418, 25632, 5646, 181135, 2046, 16093, 9, 44084, 3525, 6967, ...

[ 0.08428955078125, 0.16064453125, 0.1715087890625, 0.2122802734375, 0.1025390625, 0.10205078125, 0.25048828125, 0.161376953125, 0.1651611328125, 0.0288543701171875, 0.1588134765625, 0.229248046875, 0.0792236328125, 0.07220458984375, 0.1522216796875, 0.007537841796875, 0.1595458984375,...

embed

27987261_c0

27987261

haskell

0

Title: Verifying condition in Haskell Problem title: Verifying condition in Haskell Tags: list, haskell, recursion Problem: Verifying condition in Haskell I need a function that checks a condition on a list. For example: countP :: [a] -> (a -> Bool) -> Int with the input: countP [1,-2,0,-1,5] (>0) should return 2, beca...

Verifying condition in Haskell Verifying condition in Haskell list haskell recursion Verifying Haskell Bool x:xs Verifying condition in Haskell I need a function that checks a condition on a list. For example: with the input: should return 2, because there are two numbers greater than zero. Here's what i've done so far...

[ -0.0048828125, 0.0035552978515625, -0.000007450580596923828, 0.00732421875, 0.000782012939453125, 0.02587890625, 0.00848388671875, 0.002593994140625, 0.027099609375, -0.00390625, 0.01055908203125, -0.03271484375, 0.020751953125, 0.01422119140625, -0.002410888671875, 0.0137939453125, ...

[ 1446, 151138, 35431, 23, 20625, 142508, 5303, 1556, 195625, 1830, 2460, 929, 1022, 425, 3871, 32354, 12765, 7, 98, 678, 107730, 5608, 30646, 116, 6637, 621, 6626, 101935, 117396, 3501, 45234, 16940, 2060, 214, 68252, 76172, 64457, 70, 14012...

[ 0.190673828125, 0.1781005859375, 0.265869140625, 0.07025146484375, 0.1812744140625, 0.269287109375, 0.1962890625, 0.1612548828125, 0.1910400390625, 0.022857666015625, 0.0872802734375, 0.1773681640625, 0.0335693359375, 0.06683349609375, 0.0989990234375, 0.1727294921875, 0.197509765625...

embed

22437812_c1

22437812

haskell

1

every combinator be expression in terms of "compose" and "reverse compose", and is there a scheme to derive the combination of "compose" and "reverse compose" directly from the structure of the pointful combinator (i.e., without going through the complete rewrite process)? For instance, is it possible to directly deri...

[ -0.01202392578125, 0.02685546875, -0.01214599609375, 0.0230712890625, -0.0003070831298828125, 0.007720947265625, 0.00262451171875, 0.020751953125, 0.01348876953125, -0.00421142578125, -0.0128173828125, -0.00897216796875, 0.0030670166015625, 0.016845703125, -0.026123046875, 0.0000963211...

[ 11907, 22321, 1290, 186, 125195, 69407, 277, 78381, 107, 37676, 150350, 150370, 122, 5844, 162515, 105237, 1295, 45646, 6275, 7844, 18781, 7722, 32087, 11389, 41872, 97, 33079, 113, 16487, 32354, 9351, 31667, 62775, 100, 501, 136, 1690, 37202...

[ 0.10467529296875, 0.255126953125, 0.1875, 0.03411865234375, 0.193359375, 0.032623291015625, 0.1309814453125, 0.2030029296875, 0.055877685546875, 0.1866455078125, 0.25537109375, 0.10791015625, 0.09521484375, 0.10498046875, 0.1689453125, 0.09326171875, 0.0430908203125, 0.156616210937...

embed

31911335_c1

31911335

haskell

1

e1 :| e2) = e1 :| (apply xs f e2) apply (L:xs) f (e1 :=> e2) = (apply xs f e1) :=> e2 apply (R:xs) f (e1 :=> e2) = e1 :=> (apply xs f e2) apply (L:xs) f (e1 := e2) = (apply xs f e1) := e2 apply (R:xs) f (e1 := e2) = e1 := (apply xs f e2) apply (x:xs) f (Not' e) = apply xs f e The function works fine. But can I use some...

[ 0.00604248046875, -0.00115203857421875, 0.007476806640625, -0.01031494140625, 0.0186767578125, 0.0068359375, -0.002044677734375, 0.01495361328125, 0.030029296875, -0.00970458984375, 0.027587890625, 0.0028533935546875, 0.0274658203125, 0.009765625, 0.005157470703125, -0.00860595703125, ...

[ 28, 418, 152, 58745, 10461, 2203, 9007, 538, 1022, 7, 1238, 59911, 866, 12, 425, 13, 17727, 304, 1052, 122116, 25, 32354, 43240, 5885, 4966, 831, 4527, 3060, 2053, 64549, 748, 41123, 71, 38931, 1286, 8781, 1884, 903, 1984, 7192, 172, ...

[ 0.1668701171875, 0.1314697265625, 0.010101318359375, 0.02960205078125, 0.2161865234375, 0.04583740234375, 0.1292724609375, 0.115478515625, 0.0859375, 0.0712890625, 0.17041015625, 0.2159423828125, 0.0672607421875, 0.05303955078125, 0.0921630859375, 0.09844970703125, 0.0814208984375, ...

embed

56517712_c0

56517712

haskell

0

Title: Given a list of list of Booleans, return a Boolean Problem title: Given a list of list of Booleans, return a Boolean Tags: haskell Problem: Given a list of list of Booleans, return a Boolean I have a function, defined as follows, that is given a list of lists of Booleans and returns a Boolean: evaluates :: [[Boo...

Given a list of list of Booleans, return a Boolean Given a list of list of Booleans, return a Boolean haskell Given Booleans Boolean Bool y:ys Given a list of list of Booleans, return a Boolean I have a function, defined as follows, that is given a list of lists of Booleans and returns a Boolean: I tried the following ...

[ 0.00921630859375, 0.0081787109375, 0.01104736328125, 0.018310546875, 0.010498046875, 0.01312255859375, 0.0245361328125, -0.0218505859375, 0.0185546875, 0.0228271484375, 0.004302978515625, 0.009033203125, 0.00726318359375, -0.003082275390625, -0.0216064453125, -0.004730224609375, 0.00...

[ 77878, 5303, 111, 73783, 34677, 7, 30646, 10, 1556, 142508, 19, 2460, 929, 113, 12, 4778, 32354, 61924, 28960, 34475, 37842, 25632, 3917, 22027, 18, 4488, 16750, 41206, 83, 1326, 42805, 882, 22225, 87599, 17647, 11971, 184 ]

[ 0.1029052734375, 0.1513671875, 0.056854248046875, 0.16748046875, 0.257080078125, 0.03131103515625, 0.2156982421875, 0.054046630859375, 0.1346435546875, 0.2252197265625, 0.0294036865234375, 0.08642578125, 0.1513671875, 0.0831298828125, 0.0076904296875, 0.134033203125, 0.1912841796875,...

embed

3518619_c0

3518619

haskell

0

Title: How to configure GHCi to automatically import modules Problem title: How to configure GHCi to automatically import modules Tags: haskell, ghci Problem: How to configure GHCi to automatically import modules When I use GHCi, I almost always end up importing Control.Applicative , Data.List , etc. . Is there a way t...

How to configure GHCi to automatically import modules How to configure GHCi to automatically import modules haskell ghci modules How GHCi Control.Applicative Data.List Prelude Database.HDBC Database.HDBC.Sqlite3 System.Directory How to configure GHCi to automatically import modules When I use GHCi, I almost always end ...

[ -0.0115966796875, -0.006378173828125, -0.0028839111328125, 0.025146484375, -0.003936767578125, 0.00836181640625, 0.01251220703125, -0.01141357421875, 0.007659912109375, -0.0235595703125, -0.00823974609375, -0.03515625, -0.01043701171875, -0.00567626953125, -0.01104736328125, -0.0078125...

[ 11249, 222495, 527, 73265, 14, 191082, 24927, 88996, 47, 1556, 142508, 31380, 318, 27131, 39179, 11048, 11809, 154663, 1914, 822, 187781, 16291, 24318, 95255, 67, 363, 12353, 7, 4527, 39555, 11343, 3564, 13695, 105876, 8371, 4989 ]

[ 0.0479736328125, 0.2181396484375, 0.09796142578125, 0.177734375, 0.2303466796875, 0.214599609375, 0.2578125, 0.2442626953125, 0.00469970703125, 0.104736328125, 0.195068359375, 0.1142578125, 0.1683349609375, 0.1668701171875, 0.061859130859375, 0.1097412109375, 0.08001708984375, 0.10...

embed

26139360_c0

26139360

haskell

0

Title: Parse json dynamically with Data.Aeson Problem title: Parse json dynamically with Data.Aeson Tags: json, haskell Problem: Parse json dynamically with Data.Aeson I follow docs and try: let st = do result <- decode "{\"name\":\"Dave\",\"age\":2}" --bss flip parseMaybe result $ \obj -> do name <- obj .: "name" retu...

Parse json dynamically with Data.Aeson Parse json dynamically with Data.Aeson json haskell Parse Data.Aeson Dave Parse json dynamically with Data.Aeson I follow docs and try: I get: How to do it properly? What am I doing wrong?

[ 0.00714111328125, -0.00537109375, 0.012451171875, 0.011962890625, -0.0279541015625, 0.023681640625, -0.0145263671875, 0.00921630859375, -0.0111083984375, -0.0308837890625, -0.01214599609375, 0.0184326171875, 0.0003948211669921875, -0.0167236328125, 0.01220703125, -0.00830078125, 0.00...

[ 2392, 184, 1647, 1681, 84079, 25958, 678, 11809, 284, 90, 191, 1556, 142508, 103383, 28960, 54, 4439, 9790, 11249, 155965, 444, 44691 ]

[ 0.1494140625, 0.09686279296875, 0.140869140625, 0.2249755859375, 0.1868896484375, 0.10919189453125, 0.093505859375, 0.10968017578125, 0.07891845703125, 0.113037109375, 0.1947021484375, 0.12054443359375, 0.1962890625, 0.1806640625, 0.08819580078125, 0.03253173828125, 0.020233154296875...

embed

71759825_c0

71759825

haskell

0

Title: Defining a function that satisfies a type in Haskell Problem title: Defining a function that satisfies a type in Haskell Tags: types, type-inference, haskell, ghci Problem: Defining a function that satisfies a type in Haskell Considering the type foo :: a -> ((b -> a) -> c) -> c I want to create a function that ...

Defining a function that satisfies a type in Haskell Defining a function that satisfies a type in Haskell types type-inference haskell ghci Defining Haskell foo2 Defining a function that satisfies a type in Haskell Considering the type I want to create a function that satisfies this type... I know foo x y = y (\z -> x)...

[ 0.01806640625, -0.00469970703125, -0.01202392578125, 0.0140380859375, 0.009521484375, 0.001556396484375, -0.0159912109375, 0.01177978515625, 0.016357421875, -0.00141143798828125, 0.0019073486328125, -0.03369140625, -0.014404296875, -0.003662109375, 0.0037384033203125, -0.0025634765625,...

[ 88606, 32354, 450, 40407, 3387, 10644, 23, 20625, 142508, 10, 52895, 73, 69988, 1556, 31380, 318, 5775, 31, 304, 449, 137399, 3444, 28282, 903, 3714, 1022, 113, 2203, 41872, 169, 33079, 39563, 152, 50986, 527, 73265, 14, 2046, 47, 2704, ...

[ 0.1849365234375, 0.2423095703125, 0.081298828125, 0.2335205078125, 0.123779296875, 0.261474609375, 0.058197021484375, 0.14794921875, 0.251708984375, 0.007537841796875, 0.2000732421875, 0.0237579345703125, 0.1275634765625, 0.1270751953125, 0.08544921875, 0.11767578125, 0.130126953125,...

embed

41966893_c1

41966893

haskell

1

>>= either (return . Left) (\x -> unIOEither (f x)) instance MonadThrow IOEither where throwM e = IOEither (throwM @IO e) instance MonadCatch IOEither where catch (IOEither aIO) f = IOEither $ catch @IO aIO (unIOEither . f) instance MonadMask IOEither where mask f = IOEither $ mask @IO $ \restore -> unIOEither $ f (IO...

[ -0.0260009765625, -0.004058837890625, 0.0208740234375, 0.000476837158203125, 0.01068115234375, 0.0037841796875, -0.0026092529296875, -0.0263671875, 0.0017547607421875, 0.013916015625, -0.00213623046875, -0.0162353515625, 0.0024871826171875, 0.0030364990234375, 0.004150390625, -0.011230...

[ 6396, 1369, 40101, 65395, 19, 636, 2480, 425, 51, 17780, 647, 14, 9319, 420, 1022, 110527, 60331, 71, 20800, 15555, 104250, 594, 28, 2203, 1374, 76775, 206, 105556, 10, 1238, 3650, 309, 53049, 92, 6, 7021, 45804, 14359, 9167, 107, 16, ...

[ 0.1177978515625, 0.0400390625, 0.2281494140625, 0.11376953125, 0.0160675048828125, 0.0268707275390625, 0.116455078125, 0.10247802734375, 0.130859375, 0.22021484375, 0.047760009765625, 0.0782470703125, 0.22314453125, 0.0655517578125, 0.10986328125, 0.2529296875, 0.1929931640625, 0.1...

embed

59154523_c0

59154523

haskell

0

Title: How to define data type in GHCi Problem title: How to define data type in GHCi Tags: haskell Problem: How to define data type in GHCi I'm reading from " Making Our Own Types and Typeclasses " part from "Learn You a Haskell for Great Good!". By following the text I wrote the code in GHCi and got an error. data Sh...

How to define data type in GHCi How to define data type in GHCi haskell How GHCi Shape Circle Float Rectangle Variable How to define data type in GHCi I'm reading from " Making Our Own Types and Typeclasses " part from "Learn You a Haskell for Great Good!". By following the text I wrote the code in GHCi and got an erro...

[ 0.0128173828125, 0.0201416015625, -0.002471923828125, 0.0205078125, 0.00341796875, 0.00139617919921875, -0.002197265625, 0.02099609375, -0.003204345703125, -0.00921630859375, -0.015869140625, -0.0400390625, -0.01043701171875, -0.01422119140625, 0.017578125, 0.01544189453125, 0.022216...

[ 11249, 47, 61924, 2053, 10644, 23, 527, 73265, 14, 1556, 142508, 7224, 1081, 163731, 38699, 257, 48224, 14525, 133, 84572, 2886, 16454, 22929, 7710, 60457, 136, 67413, 147, 2583, 20625, 100, 18621, 3890, 25632, 18151, 18499, 87, 33022, 3039...

[ 0.06903076171875, 0.033111572265625, 0.2081298828125, 0.1805419921875, 0.2705078125, 0.05548095703125, 0.117431640625, 0.1519775390625, 0.221923828125, 0.1307373046875, 0.216796875, 0.1318359375, 0.03338623046875, 0.1409912109375, 0.147216796875, 0.05743408203125, 0.0158843994140625,...

embed

26895904_c0

26895904

haskell

0

Title: Repeat elements of a list Problem title: Repeat elements of a list Tags: haskell Problem: Repeat elements of a list I am writing a small function repeat k lt. it will repeat all elements in a list k times. This is my approach and following is the code i tried repeat 0 xs = xs repeat k [] = [] repeat k (x:xs) |k ...

Repeat elements of a list Repeat elements of a list haskell Repeat x:xs x:repeat k-1 Repeat elements of a list I am writing a small function repeat k lt. it will repeat all elements in a list k times. This is my approach and following is the code i tried Then i realized i am just removing the head and pushing it back i...

[ 0.004302978515625, 0.018798828125, -0.00014972686767578125, -0.0052490234375, -0.00151824951171875, 0.00860595703125, 0.001556396484375, -0.01202392578125, 0.005828857421875, -0.00726318359375, 0.00616455078125, -0.0142822265625, -0.002655029296875, 0.0142822265625, 0.00164031982421875, ...

[ 33742, 13, 257, 80854, 111, 5303, 1556, 142508, 1022, 12, 425, 7, 107, 1081, 472, 5759, 32562, 19336, 32354, 119140, 18, 1221, 756, 23, 10, 20028, 51515, 25632, 70, 18151, 37842, 185171, 49146, 6496, 10336, 25944, 4420, 46132, 4527, 37223...

[ 0.230224609375, 0.2489013671875, 0.1568603515625, 0.206787109375, 0.0921630859375, 0.20654296875, 0.13623046875, 0.21142578125, 0.0924072265625, 0.04608154296875, 0.08343505859375, 0.048065185546875, 0.088134765625, 0.248046875, 0.1727294921875, 0.15576171875, 0.06329345703125, 0.0...

embed

27302970_c0

27302970

haskell

0

Title: Prelude "and" and "or" functions on empty lists Problem title: Prelude "and" and "or" functions on empty lists Tags: haskell, ghci Problem: Prelude "and" and "or" functions on empty lists I've just started to play with Haskell using GHCI. The REPL comes with a bunch of bui...

Prelude "and" and "or" functions on empty lists Prelude "and" and "or" functions on empty lists haskell ghci Prelude Bool Prelude "and" and "or" functions on empty lists I've just started to play with Haskell using GHCI. The REPL comes with a bunch of built in functions. For exam...

[ 0.0172119140625, -0.00180816650390625, 0.00164031982421875, 0.004669189453125, -0.01611328125, 0.0303955078125, 0.000850677490234375, -0.0087890625, 0.007537841796875, 0.020751953125, -0.00469970703125, -0.02734375, -0.01092529296875, 0.009765625, 0.0086669921875, -0.016357421875, 0....

[ 1914, 822, 112, 2940, 136, 748, 32354, 98, 201505, 5303, 1556, 142508, 31380, 318, 2460, 929, 11301, 20625, 41877, 17304, 9069, 21130, 32497, 147306, 88303, 23, 707, 34390, 31, 34677, 12647, 33079, 100, 7, 76199, 4127, 89397, 6044, 224833, ...

[ 0.0999755859375, 0.2003173828125, 0.0950927734375, 0.182373046875, 0.133544921875, 0.1905517578125, 0.2069091796875, 0.053070068359375, 0.2237548828125, 0.228271484375, 0.07635498046875, 0.2498779296875, 0.06402587890625, 0.117431640625, 0.10302734375, 0.216552734375, 0.0298767089843...

embed

47257942_c0

47257942

haskell

0

Title: Function with a -> a -> a possible in Haskell? Problem title: Function with a -> a -> a possible in Haskell? Tags: haskell Problem: Function with a -> a -> a possible in Haskell? I am going through Haskell Programming book and an in exercise on page 140, the author states this: A hypothetical functio...

Function with a -> a -> a possible in Haskell? Function with a -> a -> a possible in Haskell? haskell Haskell Write Function with a -> a -> a possible in Haskell? I am going through Haskell Programming book and an in exercise on page 140, the author states this: A hypothetical function a->a->a has two possi...

[ 0.01171875, 0.01312255859375, 0.005950927734375, 0.01214599609375, -0.01080322265625, 0.0211181640625, -0.01263427734375, -0.0078125, 0.0067138671875, -0.0052490234375, -0.00787353515625, -0.006683349609375, -0.0031585693359375, 0.0255126953125, 0.0157470703125, -0.005401611328125, 0...

[ 28670, 10763, 678, 10, 20, 1230, 5386, 7722, 23, 20625, 142508, 1556, 601, 18781, 33079, 12877, 81979, 12664, 170933, 70760, 32354, 103607, 11, 6626, 208124, 15044, 11389, 21980, 51776, 10750, 136, 959, 10422, 159978, 79459, 31380, 318, 7108,...

[ 0.159912109375, 0.08056640625, 0.1279296875, 0.1763916015625, 0.1036376953125, 0.0550537109375, 0.175048828125, 0.27880859375, 0.046539306640625, 0.135498046875, 0.2401123046875, 0.072998046875, 0.031524658203125, 0.08612060546875, 0.1888427734375, 0.040435791015625, 0.03005981445312...

embed

5557082_c0

5557082

haskell

0

Title: What does the ($=) (dollar equals) operator do in Haskell GLUT library? Problem title: What does the ($=) (dollar equals) operator do in Haskell GLUT library? Tags: haskell, opengl, syntax Problem: What does the ($=) (dollar equals) operator do in Haskell GLUT library? I was looking through some game code writte...

What does the ($=) (dollar equals) operator do in Haskell GLUT library? What does the ($=) (dollar equals) operator do in Haskell GLUT library? haskell opengl syntax What Haskell GLUT What does the ($=) (dollar equals) operator do in Haskell GLUT library? I was looking through some game code written in Haskell using th...

[ 0.004241943359375, 0.0013427734375, 0.01239013671875, -0.0213623046875, 0.006317138671875, 0.005279541015625, -0.00848388671875, 0.0016937255859375, -0.006744384765625, 0.0162353515625, -0.0027313232421875, -0.007781982421875, 0.02099609375, -0.00848388671875, -0.02392578125, 0.0150756...

[ 4865, 14602, 70, 4369, 1369, 16, 5876, 320, 105950, 7, 39933, 54, 23, 20625, 142508, 527, 143662, 35773, 1294, 1556, 9803, 11016, 6002, 86531, 15, 8305, 6712, 18151, 59121, 17368, 903, 13695, 160, 26783, 219743, 130481, 2831, 442, 64557, ...

[ 0.0755615234375, 0.055267333984375, 0.04278564453125, 0.161865234375, 0.251708984375, 0.039459228515625, 0.1678466796875, 0.1778564453125, 0.2337646484375, 0.133544921875, 0.239990234375, 0.105712890625, 0.033782958984375, 0.1171875, 0.2135009765625, 0.0802001953125, 0.25, 0.139526...

embed

25769820_c0

25769820

haskell

0

Title: Minimum of Two Maybes Problem title: Minimum of Two Maybes Tags: option-type, haskell Problem: Minimum of Two Maybes I want to get the minimum of two maybe values, or if one is nothing get the non-nothing one, or return nothing if both inputs are nothing. I can write a simple function to do this, but I suspect t...

Minimum of Two Maybes Minimum of Two Maybes option-type haskell Minimum Two Maybes Ord Maybe Nothing Just Minimum of Two Maybes I want to get the minimum of two maybe values, or if one is nothing get the non-nothing one, or return nothing if both inputs are nothing. I can write a simple function to do this, but I suspe...

[ -0.00023651123046875, -0.007537841796875, 0.0286865234375, 0.01043701171875, 0.00927734375, 0.0233154296875, 0.0201416015625, -0.0228271484375, -0.0030059814453125, 0.0166015625, 0.000118255615234375, 0.01220703125, -0.00015544891357421875, -0.002655029296875, -0.007568359375, 0.004943...

[ 173858, 111, 32964, 83425, 7, 35829, 50986, 1556, 142508, 35379, 182747, 3444, 47, 2046, 70, 15440, 6626, 51139, 142424, 2174, 1632, 33720, 351, 157, 64113, 30646, 15044, 107730, 621, 33022, 8781, 32354, 54, 903, 92610, 3917, 15490, 32562, ...

[ 0.231201171875, 0.1143798828125, 0.1966552734375, 0.257080078125, 0.06219482421875, 0.1666259765625, 0.075927734375, 0.1134033203125, 0.2056884765625, 0.1064453125, 0.1278076171875, 0.0941162109375, 0.031982421875, 0.114013671875, 0.042144775390625, 0.231689453125, 0.1715087890625, ...

embed

26344514_c0

26344514

haskell

0

Title: (Haskell) Displaying a list in plain English? Problem title: (Haskell) Displaying a list in plain English? Tags: haskell, functional-programming Problem: (Haskell) Displaying a list in plain English? I've been writing a really simple text game engine, and I've come across a problem: I need to be able to print a ...

(Haskell) Displaying a list in plain English? (Haskell) Displaying a list in plain English? haskell functional-programming Haskell Displaying English (Haskell) Displaying a list in plain English? I've been writing a really simple text game engine, and I've come across a problem: I need to be able to print a list of ite...

[ -0.00946044921875, -0.003631591796875, 0.0048828125, 0.0166015625, 0.007049560546875, 0.0184326171875, -0.005828857421875, -0.01708984375, -0.004486083984375, 0.0167236328125, -0.00616455078125, -0.021728515625, 0.004974365234375, 0.01953125, -0.00909423828125, 0.0024871826171875, 0....

[ 6495, 7, 142508, 90045, 214, 10, 5303, 23, 111719, 14941, 32, 1556, 123309, 28966, 20625, 32562, 6183, 8781, 7986, 6712, 87907, 36880, 2967, 3871, 19048, 28412, 55769, 175457, 85590, 32354, 51776, 10298, 79315, 140992, 2856, 1884, 3642, 11957...

[ 0.087890625, 0.06219482421875, 0.22998046875, 0.17138671875, 0.05596923828125, 0.0440673828125, 0.2308349609375, 0.089599609375, 0.1580810546875, 0.2413330078125, 0.0089111328125, 0.123291015625, 0.10498046875, 0.05657958984375, 0.1236572265625, 0.060394287109375, 0.003173828125, 0...

embed

37455495_c0

37455495

haskell

0

Title: Generate server sided images (QR codes) and display them on a page with Yesod Problem title: Generate server sided images (QR codes) and display them on a page with Yesod Tags: yesod, qr-code, haskell Problem: Generate server sided images (QR codes) and display them on a page with Yesod I'd like to be able to ge...

Generate server sided images (QR codes) and display them on a page with Yesod Generate server sided images (QR codes) and display them on a page with Yesod yesod qr-code haskell Generate Yesod Generate server sided images (QR codes) and display them on a page with Yesod I'd like to be able to generate arbitrary qr code...

[ 0.006072998046875, 0.017333984375, -0.010009765625, -0.0111083984375, -0.01422119140625, 0.0252685546875, -0.005523681640625, -0.01263427734375, -0.0169677734375, -0.02587890625, 0.0040283203125, -0.00970458984375, 0.006195068359375, 0.01904296875, -0.005523681640625, -0.024658203125, ...

[ 155370, 67, 10723, 5609, 71, 43079, 2737, 1052, 18151, 44116, 9191, 678, 32635, 2199, 2422, 23722, 8096, 42, 40899, 1556, 142508, 1884, 19048, 139392, 61799, 1467, 149976, 765, 12008, 3714, 3126, 1257, 79631, 12663, 117233, 14578, 35773, 1409...

[ 0.16650390625, 0.06396484375, 0.1708984375, 0.12060546875, 0.1016845703125, 0.199462890625, 0.0787353515625, 0.1502685546875, 0.221435546875, 0.1329345703125, 0.1002197265625, 0.0830078125, 0.169677734375, 0.234619140625, 0.128662109375, 0.1922607421875, 0.08740234375, 0.1307373046...

embed

49986342_c1

49986342

haskell

1

This says that undefined should work for any RuntimeRep , even unlifted types. Here is an example of using undefined as an unboxed, unlifted Int# in GHCi: > :set -XMagicHash > import GHC.Prim > import GHC.Exts > I# (undefined :: Int#) *** Exception: Prelude.undefined I've always thought of undefined as being the same ...

[ -0.00982666015625, 0.01287841796875, 0.025390625, -0.007171630859375, 0, 0.005218505859375, -0.0128173828125, -0.010009765625, -0.000583648681640625, 0.012451171875, 0.00408935546875, -0.03466796875, 0.013671875, 0.01708984375, -0.00457763671875, 0.0054931640625, 0.0303955078125, -...

[ 9232, 5983, 297, 5608, 4488, 2499, 28398, 6032, 4332, 254, 51, 104501, 52895, 27781, 17368, 11728, 360, 18, 4904, 527, 73265, 14, 3509, 1542, 54084, 1771, 6495, 1495, 24927, 145111, 19279, 933, 59437, 63928, 1914, 822, 112, 17569, 8035, 5...

[ 0.210693359375, 0.24169921875, 0.176513671875, 0.007415771484375, 0.12255859375, 0.044219970703125, 0.07305908203125, 0.1307373046875, 0.1363525390625, 0.179931640625, 0.1015625, 0.228271484375, 0.181640625, 0.09326171875, 0.04937744140625, 0.17822265625, 0.013336181640625, 0.05920...

embed

28857275_c1

28857275

haskell

1

module Syntax.Name and this module is compiled. It is not used in the test module though. I also tried turning the package into a library and having the test-suite build-depends on the library. The linker error proceeds. This is the Haskell Platform from OpenSuSE 13.1, GHC 7.8.3 which locks Cabal to 1.18.1.3. Code sig...

[ 0.004241943359375, -0.001434326171875, -0.00897216796875, -0.0008544921875, -0.0076904296875, 0.0021820068359375, -0.0042724609375, 0.01019287109375, -0.01806640625, 0.0179443359375, -0.01904296875, -0.0279541015625, -0.0185546875, -0.006866455078125, 0.00762939453125, -0.0059204101562...

[ 88996, 19010, 86531, 163612, 903, 375, 5974, 297, 1650, 83, 959, 11814, 3034, 37842, 174548, 98169, 10, 35773, 68879, 13, 45367, 105254, 1294, 3126, 56, 18499, 172337, 20625, 142508, 70968, 13527, 14168, 9127, 5847, 418, 527, 73265, 361, 52...

[ 0.235595703125, 0.1212158203125, 0.2086181640625, 0.2210693359375, 0.046356201171875, 0.06610107421875, 0.1929931640625, 0.07037353515625, 0.01019287109375, 0.03692626953125, 0.103759765625, 0.1273193359375, 0.201171875, 0.023956298828125, 0.04266357421875, 0.1898193359375, 0.0032348...

embed

21650802_c0

21650802

haskell

0

Title: Error in list to tree Problem title: Error in list to tree Tags: tree, list, haskell Problem: Error in list to tree Consider the following type: data LTree a = Leaf a | Fork (LTree a) (LTree a) build :: [(a,Int)] -> LTree a build l = fst (buildaccum 0 l)e I have a list and want to build a tree buildaccum :: Int ...

Error in list to tree Error in list to tree tree list haskell Error LTree Leaf Fork Couldn Error in list to tree Consider the following type: I have a list and want to build a tree In ghci, I get the following error: Can you spot the error, please?

[ 0.0191650390625, 0.000766754150390625, -0.01318359375, -0.01171875, 0.0140380859375, 0.02978515625, -0.044921875, -0.028076171875, 0.0074462890625, -0.0250244140625, 0.0260009765625, -0.00102996826171875, 0.0137939453125, 0.00384521484375, 0.00299072265625, 0.0025634765625, 0.0129394...

[ 212059, 23, 5303, 47, 53201, 1556, 142508, 107, 13, 636, 2407, 1326, 92, 191147, 19, 10644, 765, 3444, 45367, 31380, 318, 25632, 18499, 4171, 13162, 22936 ]

[ 0.2147216796875, 0.1212158203125, 0.21533203125, 0.2275390625, 0.25439453125, 0.10748291015625, 0.20654296875, 0.15576171875, 0.04644775390625, 0.054443359375, 0.1580810546875, 0.1478271484375, 0.11102294921875, 0.11236572265625, 0.031280517578125, 0.07513427734375, 0.037139892578125...

embed

46895199_c0

46895199

haskell

0

Title: No output will be generated because there is no Main module Problem title: No output will be generated because there is no Main module Tags: program-entry-point, haskell Problem: No output will be generated because there is no Main module I wrote a simple module called Test : module Test (main) where main = putS...

No output will be generated because there is no Main module No output will be generated because there is no Main module program-entry-point haskell Main Test Hello Test.hs Compiling Test.o No output will be generated because there is no Main module I wrote a simple module called Test : However, when i try to compile it...

[ -0.00543212890625, 0.021728515625, 0.005157470703125, 0.01251220703125, -0.012939453125, 0.0177001953125, 0.00439453125, -0.01318359375, -0.00848388671875, -0.00112152099609375, -0.014404296875, -0.031982421875, 0.00140380859375, -0.002899169921875, 0.002777099609375, -0.0098876953125,...

[ 438, 140992, 1221, 139392, 6637, 110, 12321, 88996, 1528, 33, 15123, 38496, 1556, 142508, 8647, 35378, 127, 15612, 49725, 31, 2685, 54397, 8781, 9790, 9969, 1340, 1829, 25632, 75101, 13315, 18499 ]

[ 0.1024169921875, 0.2353515625, 0.077392578125, 0.1771240234375, 0.0511474609375, 0.126708984375, 0.15771484375, 0.2467041015625, 0.081787109375, 0.005889892578125, 0.077880859375, 0.077392578125, 0.1329345703125, 0.197509765625, 0.253662109375, 0.104248046875, 0.0853271484375, 0.10...

embed

54732806_c0

54732806

haskell

0

Title: is this piece of haskell code correct, if so why? Problem title: is this piece of haskell code correct, if so why? Tags: haskell Problem: is this piece of haskell code correct, if so why? the haskell wiki (here : https://wiki.haskell.org/State_Monad ) says the state monad bind operator is defined like this : (>>...

is this piece of haskell code correct, if so why? is this piece of haskell code correct, if so why? haskell State act1 fact2 act2 is this piece of haskell code correct, if so why? the haskell wiki (here : https://wiki.haskell.org/State_Monad ) says the state monad bind operator is defined like this : however it seems i...

[ -0.0164794921875, 0.00074005126953125, 0.0108642578125, 0.01116943359375, 0.002410888671875, 0.016357421875, -0.00946044921875, -0.00138092041015625, 0.000385284423828125, -0.01287841796875, 0.0181884765625, 0.005706787109375, -0.011962890625, 0.006561279296875, -0.0113525390625, -0.00...

[ 83, 903, 63847, 1556, 142508, 18151, 26785, 15400, 22836, 27992, 418, 15824, 304, 111, 34356, 13691, 10557, 135206, 13, 46674, 712, 11341, 2667, 68557, 39933, 61924, 71, 1884, 49903, 37202, 214552, 16750, 32354, 137565, 20051, 23, 64549, 748,...

[ 0.06634521484375, 0.08355712890625, 0.1116943359375, 0.125244140625, 0.2108154296875, 0.1373291015625, 0.1837158203125, 0.092041015625, 0.161376953125, 0.123779296875, 0.053955078125, 0.138916015625, 0.0994873046875, 0.00714111328125, 0.070068359375, 0.0265350341796875, 0.07849121093...

embed

15552397_c0

15552397

haskell

0

Title: Tutorial on stochastic simulation in Haskell Problem title: Tutorial on stochastic simulation in Haskell Tags: stochastic, haskell, simulation, stochastic-process Problem: Tutorial on stochastic simulation in Haskell I'd like to use Haskell for stochastic simulation, but I don't know how. I've read Hutton's 'Pro...

Tutorial on stochastic simulation in Haskell Tutorial on stochastic simulation in Haskell stochastic haskell simulation stochastic-process Tutorial Haskell Tutorial on stochastic simulation in Haskell I'd like to use Haskell for stochastic simulation, but I don't know how. I've read Hutton's 'Programming in Haskell', a...

[ 0.003265380859375, 0.0220947265625, 0.0185546875, -0.00579833984375, -0.003875732421875, 0.0157470703125, 0.0125732421875, -0.01153564453125, -0.0111083984375, -0.04638671875, -0.0054931640625, 0.010009765625, -0.00762939453125, 0.007293701171875, 0.00933837890625, 0.0115966796875, -...

[ 183447, 98, 3474, 1436, 28692, 40226, 1363, 23, 20625, 142508, 1556, 63923, 1884, 4527, 100, 18, 3714, 3642, 12301, 97595, 1507, 172895, 104577, 32562, 72694, 48242, 123309, 103391, 4034, 5256, 12096, 23468, 222530, 46876, 627, 707, 17198, 50...

[ 0.2152099609375, 0.061370849609375, 0.1444091796875, 0.2012939453125, 0.111572265625, 0.2578125, 0.060882568359375, 0.0589599609375, 0.158203125, 0.266845703125, 0.1383056640625, 0.1043701171875, 0.07928466796875, 0.12451171875, 0.05377197265625, 0.0206451416015625, 0.069091796875, ...

embed

40183084_c0

40183084

haskell

0

Title: Is it possible to express the "type of functions that receive 2 nats and return their sum"? Problem title: Is it possible to express the "type of functions that receive 2 nats and return their sum"? Tags: dependent-type, agda, haskell, idris, types Problem: Is it possible to express the "type...

Is it possible to express the "type of functions that receive 2 nats and return their sum"? Is it possible to express the "type of functions that receive 2 nats and return their sum"? dependent-type agda haskell idris types CNat Type a:Type Is it possible to express the "type of functions that recei...

[ 0.002838134765625, 0.00933837890625, -0.001678466796875, 0.0250244140625, -0.005096435546875, -0.00787353515625, 0.01519775390625, 0.0008697509765625, 0.01361083984375, -0.044921875, 0.00007677078247070312, -0.01409912109375, -0.00823974609375, 0.00186920166015625, 0.00897216796875, 0....

[ 2071, 7722, 36510, 50986, 32354, 53299, 116, 24, 933, 30646, 10554, 108750, 1377, 85, 1556, 142508, 3679, 52895, 61658, 257, 60457, 10, 196707, 442, 450, 136, 2363, 6626, 1022, 113, 15700, 18, 97, 15190, 69112 ]

[ 0.01031494140625, 0.1690673828125, 0.2044677734375, 0.1895751953125, 0.1912841796875, 0.1300048828125, 0.1829833984375, 0.1617431640625, 0.13623046875, 0.17724609375, 0.193115234375, 0.15478515625, 0.010528564453125, 0.062103271484375, 0.06024169921875, 0.2149658203125, 0.11962890625...

embed

40334968_c0

40334968

haskell

0

Title: Nested guards on Haskell Problem title: Nested guards on Haskell Tags: haskell Problem: Nested guards on Haskell Haskell disallows the following style of nested guards although they look aesthetically natural and concise: x | condition_1 | condition_1_1 | condition_1_1_1 = expression_1_1_1 | ... | ... | ... I go...

Nested guards on Haskell Nested guards on Haskell haskell Nested Haskell condition_1 condition_1_1 condition_1_1_1 expression_1_1_1 Nested guards on Haskell Haskell disallows the following style of nested guards although they look aesthetically natural and concise: I got a few pointers e.g. 1 and 2 , but still can't he...

[ -0.0225830078125, 0.013916015625, 0.01239013671875, -0.01129150390625, 0.0250244140625, 0.011474609375, -0.0272216796875, -0.00946044921875, 0.01043701171875, -0.000732421875, 0.01611328125, -0.0206298828125, 0.00148773193359375, 0.0238037109375, 0.0078125, -0.007354736328125, 0.0012...

[ 28701, 71, 56050, 7, 20625, 142508, 1556, 35431, 115187, 125195, 98, 6392, 41566, 25632, 20623, 8512, 6713, 525, 1448, 6083, 158, 318, 6275, 26458, 52889, 15044, 6044, 22024, 6002, 102, 49086, 101087, 208124, 65508, 63323, 4935, 240456, 53894...

[ 0.247314453125, 0.1019287109375, 0.25634765625, 0.0662841796875, 0.14501953125, 0.2210693359375, 0.1383056640625, 0.16357421875, 0.0111083984375, 0.16357421875, 0.0062255859375, 0.088134765625, 0.1044921875, 0.02001953125, 0.17041015625, 0.231201171875, 0.1090087890625, 0.070129394...

embed

50059974_c0

50059974

haskell

0

Title: cross sum operation in Haskell Problem title: cross sum operation in Haskell Tags: math, haskell, recursion Problem: cross sum operation in Haskell I need to determine a recursive function crosssum :: Int -> Int in Haskell to calculate the cross sum of positive numbers. I am not allowed to use any functions from...

cross sum operation in Haskell cross sum operation in Haskell math haskell recursion Haskell cross sum operation in Haskell I need to determine a recursive function crosssum :: Int -> Int in Haskell to calculate the cross sum of positive numbers. I am not allowed to use any functions from the hierarchical library besid...

[ -0.0240478515625, 0.035888671875, 0.023193359375, -0.01409912109375, 0.0067138671875, 0.0027313232421875, -0.0186767578125, -0.00011730194091796875, -0.001007080078125, -0.0162353515625, 0.00567626953125, -0.03076171875, -0.0023040771484375, 0.017822265625, 0.0081787109375, 0.010070800...

[ 41421, 10554, 41018, 23, 20625, 142508, 48909, 1556, 195625, 1830, 3871, 83324, 5844, 32354, 11832, 1984, 360, 18, 33079, 74481, 24491, 101935, 959, 107003, 4527, 1295, 1791, 54689, 35773, 30338, 12, 2740, 37223, 16093, 18221, 2811, 1230, 183...

[ 0.21337890625, 0.2548828125, 0.1785888671875, 0.07476806640625, 0.15625, 0.2459716796875, 0.093994140625, 0.1397705078125, 0.160888671875, 0.005462646484375, 0.0465087890625, 0.084228515625, 0.09906005859375, 0.152587890625, 0.25830078125, 0.05780029296875, 0.09796142578125, 0.1296...

embed

53788045_c0

53788045

haskell

0

Title: Using a lens over something that isn't a functor Problem title: Using a lens over something that isn't a functor Tags: haskell, haskell-lens Problem: Using a lens over something that isn't a functor I have a lens(') myLens' :: (Functor f) => (a -> f a) -> (s -> f s) And I need a function lensWithoutFun...

Using a lens over something that isn't a functor Using a lens over something that isn't a functor haskell haskell-lens Using Functor PopType Maybe Using a lens over something that isn't a functor I have a lens(') And I need a function (The particular type I'm interested in is which could be made into a Functo...

[ 0.001922607421875, 0.0020904541015625, -0.01336669921875, -0.00653076171875, 0.0078125, 0.00970458984375, -0.006744384765625, -0.024658203125, -0.009033203125, -0.033447265625, 0.0076904296875, 0.0037078857421875, -0.0172119140625, -0.0157470703125, 0.0162353515625, -0.0152587890625, ...

[ 345, 6953, 3098, 7, 645, 9844, 56112, 3768, 18, 7477, 18770, 10, 450, 1556, 142508, 1977, 28670, 11584, 196707, 83425, 765, 25, 3871, 32354, 17311, 10644, 60892, 5809, 7228, 3934, 2174, 36663, 11522, 3917, 54, 903, 3789, 28282, 197648, 35...

[ 0.1087646484375, 0.0556640625, 0.20849609375, 0.1180419921875, 0.142333984375, 0.0721435546875, 0.11767578125, 0.0655517578125, 0.11865234375, 0.1533203125, 0.2381591796875, 0.05694580078125, 0.01776123046875, 0.1201171875, 0.2249755859375, 0.183349609375, 0.1962890625, 0.191162109...

embed

27076491_c0

27076491

haskell

0

Title: Aeson: parse enumerated data types Problem title: Aeson: parse enumerated data types Tags: haskell, aeson, json Problem: Aeson: parse enumerated data types How can I declare an instance of FromJSON of the following data type: data Privacy = Everyone | AllFriends | FriendsOfFriends | Self So that the following st...

Aeson: parse enumerated data types Aeson: parse enumerated data types haskell aeson json Aeson Privacy Everyone AllFriends FriendsOfFriends ALL_FRIENDS FRIENDS_OF_FRIENDS Parsing Aeson: parse enumerated data types How can I declare an instance of FromJSON of the following data type: So that the following string to enum...

[ -0.005218505859375, 0.00830078125, -0.00933837890625, 0.043701171875, -0.0059814453125, 0.0033111572265625, -0.005706787109375, 0.0078125, -0.01080322265625, -0.004302978515625, 0.005462646484375, -0.0130615234375, 0.0086669921875, 0.01953125, -0.00830078125, 0.0179443359375, 0.01483...

[ 62, 90, 191, 12, 366, 184, 189085, 3674, 2053, 52895, 1556, 142508, 10, 1647, 1681, 104909, 191096, 3164, 919, 21347, 6468, 102517, 132887, 58837, 46290, 48057, 13526, 172837, 39015, 294, 82341, 2392, 6953, 831, 87, 159978, 142, 110527, 280...

[ 0.1219482421875, 0.1278076171875, 0.19287109375, 0.04083251953125, 0.158447265625, 0.06634521484375, 0.2235107421875, 0.09307861328125, 0.1412353515625, 0.2183837890625, 0.0924072265625, 0.2022705078125, 0.0703125, 0.0933837890625, 0.17919921875, 0.2034912109375, 0.161865234375, 0....

embed

61243217_c0

61243217

haskell

0

Title: Haskell: Typeclass vs passing a function Problem title: Haskell: Typeclass vs passing a function Tags: functional-programming, higher-order-functions, haskell Problem: Haskell: Typeclass vs passing a function To me it seems that you can always pass function arguments rather than using a typeclass. For example ra...

Haskell: Typeclass vs passing a function Haskell: Typeclass vs passing a function functional-programming higher-order-functions haskell Haskell Typeclass Bool Haskell: Typeclass vs passing a function To me it seems that you can always pass function arguments rather than using a typeclass. For example rather than defini...

[ 0.01080322265625, 0.0159912109375, 0.0010986328125, -0.00341796875, 0.005859375, 0.0125732421875, 0.00188446044921875, -0.0113525390625, -0.0213623046875, -0.03955078125, 0.00506591796875, -0.00689697265625, -0.01324462890625, -0.004913330078125, -0.0037841796875, -0.01458740234375, ...

[ 20625, 142508, 60457, 67413, 20209, 452, 32354, 6953, 123309, 28966, 77546, 80596, 137175, 1556, 2460, 929, 163, 37202, 831, 11343, 27875, 10750, 43257, 17368, 10644, 13204, 161789, 117414, 110527, 864, 4171, 61924, 88, 195, 15490, 12447 ]

[ 0.08929443359375, 0.224609375, 0.208251953125, 0.27685546875, 0.0980224609375, 0.10198974609375, 0.1815185546875, 0.0232391357421875, 0.107666015625, 0.003326416015625, 0.000701904296875, 0.05926513671875, 0.09375, 0.049285888671875, 0.012969970703125, 0.092041015625, 0.0110473632812...

embed

10087945_c0

10087945

haskell

0

Title: Piping data between two network sockets on Windows Problem title: Piping data between two network sockets on Windows Tags: haskell, network-programming, sockets, windows Problem: Piping data between two network sockets on Windows Given two network sockets, what is the most efficient way to pipe data from one to ...

Piping data between two network sockets on Windows Piping data between two network sockets on Windows haskell network-programming sockets windows Piping Windows Piping data between two network sockets on Windows Given two network sockets, what is the most efficient way to pipe data from one to the other without touchin...

[ -0.0035858154296875, 0.0306396484375, -0.0142822265625, 0.01470947265625, -0.00775146484375, 0.00098419189453125, -0.0205078125, -0.0257568359375, -0.0098876953125, -0.0128173828125, 0.009033203125, 0.0179443359375, 0.0218505859375, 0.005859375, 0.00970458984375, 0.0006256103515625, ...

[ 93128, 214, 2053, 17721, 6626, 33120, 221, 27853, 3773, 1556, 142508, 28966, 54825, 2684, 93766, 3917, 47, 137158, 1295, 1632, 3789, 15490, 23996, 10941, 2499, 16751, 11782, 61687, 111240, 188, 991, 2147, 10366, 77924, 583, 32628, 21373, 5213...

[ 0.2132568359375, 0.127685546875, 0.190673828125, 0.1434326171875, 0.1728515625, 0.135986328125, 0.121826171875, 0.212890625, 0.2100830078125, 0.1351318359375, 0.231201171875, 0.0828857421875, 0.1546630859375, 0.06256103515625, 0.17724609375, 0.06219482421875, 0.157470703125, 0.2595...

embed

34096394_c2

34096394

haskell

2

14, "optionValue": "14" } ] } ] } and here is my code so far: CODE {-# LANGUAGE OverloadedStrings #-} import Data.Aeson import Control.Applicative import qualified Data.ByteString.Lazy.Char8 as BS jsonFile :: FilePath jsonFile = "test.json" getJSON :: IO BS.ByteString getJSON = Code signals: Data.Aeson, Control.Applica...

[ 0.018798828125, 0.0130615234375, -0.00151824951171875, 0.0069580078125, -0.012939453125, 0.00787353515625, 0.0028533935546875, 0.00830078125, -0.0020751953125, 0.03466796875, 0.00153350830078125, 0.0089111328125, -0.009033203125, -0.0274658203125, 0.01214599609375, 0.0118408203125, 0...

[ 616, 109585, 856, 50770, 58, 2592, 136, 3688, 83, 759, 18151, 221, 2060, 12, 8244, 8399, 3358, 98064, 75930, 9578, 63033, 297, 71713, 5180, 24927, 11809, 5, 284, 90, 191, 27131, 39179, 11048, 4935, 217225, 75358, 67, 214, 2729, 3285, 84...

[ 0.1942138671875, 0.25830078125, 0.1256103515625, 0.1873779296875, 0.01300048828125, 0.1796875, 0.03204345703125, 0.119384765625, 0.0823974609375, 0.1265869140625, 0.251220703125, 0.056060791015625, 0.1470947265625, 0.011566162109375, 0.1982421875, 0.1370849609375, 0.05426025390625, ...

embed

35658802_c0

35658802

haskell

0

Title: How do I transform a pattern on booleans to an if condition? Problem title: How do I transform a pattern on booleans to an if condition? Tags: boolean, haskell, if-statement Problem: How do I transform a pattern on booleans to an if condition? I'm new to Haskell and I'm trying to transform the pattern matching b...

How do I transform a pattern on booleans to an if condition? How do I transform a pattern on booleans to an if condition? boolean haskell if-statement How Bool myOr2 Then How do I transform a pattern on booleans to an if condition? I'm new to Haskell and I'm trying to transform the pattern matching below to an if condi...

[ -0.005767822265625, 0.006561279296875, 0.0017547607421875, 0.0084228515625, 0.01611328125, 0.0164794921875, 0.00360107421875, -0.0023651123046875, -0.0034027099609375, 0.00811767578125, 0.006072998046875, -0.00001823902130126953, -0.0028228759765625, 0.004180908203125, 0.0172119140625, ...

[ 11249, 54, 87, 27198, 10, 103510, 98, 337, 16836, 10133, 47, 142, 2174, 35431, 31, 34677, 1556, 142508, 61340, 2460, 929, 759, 19060, 304, 47009, 3525, 20625, 31577, 14858, 35064, 1257, 678, 1284, 22027, 18, 3853, 9969, 1340, 5351, 20594,...

[ 0.0859375, 0.047119140625, 0.047088623046875, 0.219482421875, 0.044708251953125, 0.271728515625, 0.0767822265625, 0.08154296875, 0.1619873046875, 0.1566162109375, 0.09490966796875, 0.0775146484375, 0.261474609375, 0.25537109375, 0.081787109375, 0.12841796875, 0.12353515625, 0.22143...

embed

18220246_c0

18220246

haskell

0

Title: Type-Pathway in Defining Bind for the List Monad Problem title: Type-Pathway in Defining Bind for the List Monad Tags: haskell Problem: Type-Pathway in Defining Bind for the List Monad In the text Learn You A Haskell , the list monad is defined like so: instance Monad [] where return x = [x] xs >>= f = concat (m...

Type-Pathway in Defining Bind for the List Monad Type-Pathway in Defining Bind for the List Monad haskell Type-Pathway Defining Bind List Monad Type-Pathway in Defining Bind for the List Monad In the text Learn You A Haskell , the list monad is defined like so: Since the bind operator is supposed to convert list-values...

[ -0.014892578125, 0.0108642578125, 0.00408935546875, 0.018798828125, -0.000797271728515625, 0.003021240234375, -0.0034027099609375, 0.00102996826171875, 0.0133056640625, 0.00946044921875, -0.00007581710815429688, -0.04345703125, -0.003143310546875, 0.01202392578125, -0.0020751953125, 0....

[ 60457, 683, 10519, 7514, 88606, 16666, 71, 100, 32036, 60331, 23, 1556, 142508, 449, 7986, 134031, 2583, 20625, 70, 5303, 2667, 712, 61924, 1884, 221, 68557, 39933, 134598, 96760, 27494, 3934, 3059, 158, 4460, 85247, 135355, 7432, 80934, 10...

[ 0.213623046875, 0.054534912109375, 0.10552978515625, 0.1624755859375, 0.1514892578125, 0.218017578125, 0.1170654296875, 0.028167724609375, 0.1700439453125, 0.1910400390625, 0.000152587890625, 0.08441162109375, 0.2490234375, 0.016510009765625, 0.010772705078125, 0.05389404296875, 0.05...

embed

4988598_c0

4988598

haskell

0

Title: How can I run my haskell functions through Java Problem title: How can I run my haskell functions through Java Tags: java, haskell Problem: How can I run my haskell functions through Java Lets say I have a haskell function add in math.hs How can I run the add function through a Java program and store the output ...

How can I run my haskell functions through Java How can I run my haskell functions through Java java haskell file How Java math.hs How can I run my haskell functions through Java Lets say I have a haskell function add in math.hs How can I run the add function through a Java program and store the output as a variable? M...

[ 0.0086669921875, -0.0019378662109375, -0.00128936767578125, 0.00994873046875, 0.000823974609375, 0.029052734375, 0.00002467632293701172, 0.0093994140625, -0.00970458984375, -0.045166015625, 0.007354736328125, -0.00335693359375, -0.0155029296875, -0.007720947265625, 0.006103515625, -0.0...

[ 11249, 831, 11675, 759, 1556, 142508, 32354, 7, 8305, 41925, 87, 79, 330, 11435, 48909, 127, 15190, 5, 1528, 4343, 140992, 237, 10, 77336, 25632, 56065, 17203, 36746, 31, 29481, 56, 979, 71924, 5201, 46480 ]

[ 0.07733154296875, 0.1085205078125, 0.158935546875, 0.0838623046875, 0.1751708984375, 0.27880859375, 0.2142333984375, 0.0767822265625, 0.158203125, 0.255859375, 0.00994873046875, 0.1124267578125, 0.1746826171875, 0.10577392578125, 0.20947265625, 0.1470947265625, 0.1707763671875, 0.0...

embed

20908056_c0

20908056

haskell

0

Title: How to use IOArray in Haskell records? Problem title: How to use IOArray in Haskell records? Tags: arrays, haskell, record Problem: How to use IOArray in Haskell records? I'm trying to adapt the example code from haskell.org but cant seem to get it to work. http://www.haskell.org/haskellwiki/Arrays#Mutable_IO_ar...

How to use IOArray in Haskell records? How to use IOArray in Haskell records? arrays haskell record Data.Array.IO How IOArray Haskell SomeData Float How to use IOArray in Haskell records? I'm trying to adapt the example code from haskell.org but cant seem to get it to work. http://www.haskell.org/haskellwiki/Arrays#Mut...

[ -0.00823974609375, -0.008544921875, -0.0084228515625, 0.00640869140625, 0.00799560546875, 0.006988525390625, 0.002227783203125, 0.00009775161743164062, 0.0059814453125, 0.01397705078125, 0.0021820068359375, -0.018310546875, 0.00726318359375, -0.0167236328125, 0.0198974609375, -0.029418...

[ 11249, 47, 4527, 87, 44593, 42, 7092, 23, 20625, 142508, 115923, 32, 10298, 4778, 1556, 17164, 11809, 7614, 17780, 31384, 137989, 38699, 257, 39908, 27781, 18151, 1478, 45767, 48903, 4488, 10557, 13691, 10685, 22819, 19305, 3882, 83279, 4235 ...

[ 0.10040283203125, 0.0523681640625, 0.1424560546875, 0.144287109375, 0.166748046875, 0.111572265625, 0.28515625, 0.0625, 0.1474609375, 0.24462890625, 0.198486328125, 0.006866455078125, 0.131103515625, 0.06298828125, 0.124755859375, 0.16015625, 0.06146240234375, 0.104736328125, 0.1...

embed

43193602_c1

43193602

haskell

1

1))(A(2))) println(Instance.Instance.toStr(A(1))(A("bla"))) // this compiles, but it should not } How can I define override def toStr: A[_] =>A[_] => String = x => x=> "AA" such that println(Instance.Instance.toStr(A(1))(A("bla"))) does not compile ? As it ( putStrLn $ "bla " ++ (toStr (A 1) (A "String")) ) does not co...

[ -0.00433349609375, -0.0038909912109375, 0.00482177734375, 0.0198974609375, 0.0068359375, 0.00689697265625, 0.0113525390625, -0.00360107421875, 0.0162353515625, -0.005035400390625, -0.0269775390625, -0.02001953125, 0.01129150390625, 0.00286865234375, 0.00433349609375, -0.0224609375, 0...

[ 4879, 51421, 284, 40970, 28412, 19, 116071, 188, 71713, 27750, 7119, 903, 9969, 1340, 1284, 5608, 959, 61924, 645, 416, 112, 8, 420, 47, 62, 454, 23351, 214, 1022, 15467, 141, 14602, 3884, 3650, 37223, 20625, 142508, 18151, 81887, 618, ...

[ 0.06512451171875, 0.046478271484375, 0.1009521484375, 0.07037353515625, 0.118408203125, 0.065673828125, 0.1341552734375, 0.14794921875, 0.231201171875, 0.05072021484375, 0.17626953125, 0.006866455078125, 0.1580810546875, 0.1700439453125, 0.002105712890625, 0.07366943359375, 0.1145019...

embed

48488178_c0

48488178

haskell

0

Title: Can Nullable be used as a functor in C#? Problem title: Can Nullable be used as a functor in C#? Tags: haskell, functor, functional-programming, c%23, nullable Problem: Can Nullable be used as a functor in C#? Consider the following code in C#. public int Foo(int a) { // ... } // in some other method int? x = 0;...

Can Nullable be used as a functor in C#? Can Nullable be used as a functor in C#? haskell functor functional-programming c%23 nullable Can Nullable Foo Maybe Functor Can Nullable be used as a functor in C#? Consider the following code in C#. The last line will return a compilation error cannot convert from 'int?' to 'i...

[ 0.003662109375, 0.001068115234375, 0.02734375, -0.0033416748046875, 0.0106201171875, 0.0022735595703125, 0.004791259765625, -0.0107421875, 0.01544189453125, -0.0025634765625, -0.0185546875, -0.01446533203125, -0.0103759765625, 0.0201416015625, -0.0074462890625, -0.01434326171875, 0.0...

[ 4171, 27786, 2661, 11814, 237, 10, 7477, 18770, 23, 313, 4904, 1556, 142508, 123309, 28966, 501, 3742, 9229, 9572, 31, 83425, 28670, 186, 137399, 25632, 18151, 4568, 13315, 30646, 98352, 18499, 53418, 96760, 1295, 4288, 32, 44075, 20174, 20...

[ 0.09259033203125, 0.2396240234375, 0.280517578125, 0.1796875, 0.100341796875, 0.0924072265625, 0.2047119140625, 0.2181396484375, 0.08917236328125, 0.094482421875, 0.228271484375, 0.0760498046875, 0.20556640625, 0.142578125, 0.049041748046875, 0.035980224609375, 0.066162109375, 0.19...

embed

54645038_c0

54645038

haskell

0

Title: Haskell, traversable getting values from Maybe [list] Problem title: Haskell, traversable getting values from Maybe [list] Tags: list, option-type, pattern-matching, haskell Problem: Haskell, traversable getting values from Maybe [list] Found the need for using Traversable . It returned a list like this generate...

Haskell, traversable getting values from Maybe [list] Haskell, traversable getting values from Maybe [list] list option-type pattern-matching haskell Maybe Haskell Traversable Just Nothing Haskell, traversable getting values from Maybe [list] Found the need for using Traversable . It returned a list like this generates...

[ -0.0028076171875, -0.0027618408203125, -0.00811767578125, -0.00653076171875, 0.006683349609375, 0.000637054443359375, 0.00628662109375, 0.010009765625, 0.0174560546875, -0.010009765625, 0.0152587890625, 0.0015716552734375, 0.01025390625, -0.003082275390625, 0.0027008056640625, 0.012634...

[ 20625, 142508, 37317, 2886, 20949, 142424, 1295, 83425, 6562, 4, 5303, 35829, 50986, 103510, 98753, 1556, 4937, 7864, 9563, 182747, 215624, 3871, 17368, 176377, 10, 1884, 903, 139392, 1238, 4332, 2424, 154663, 2203, 304, 617, 3559, 3714, 3642...

[ 0.1451416015625, 0.2286376953125, 0.2255859375, 0.236328125, 0.1016845703125, 0.1719970703125, 0.096435546875, 0.33935546875, 0.224609375, 0.003509521484375, 0.1982421875, 0.1905517578125, 0.1207275390625, 0.2188720703125, 0.26513671875, 0.1441650390625, 0.1455078125, 0.20056152343...

embed

57489844_c0

57489844

haskell

0

Title: How does readIORef work: creates copy or it does not? Problem title: How does readIORef work: creates copy or it does not? Tags: ioref, do-notation, immutability, io-monad, haskell Problem: How does readIORef work: creates copy or it does not? What exactly does this code do? Is someMap a copy of the object (of :...

How does readIORef work: creates copy or it does not? How does readIORef work: creates copy or it does not? ioref do-notation immutability io-monad haskell How Data.Map.Strict.Map How does readIORef work: creates copy or it does not? What exactly does this code do? Is someMap a copy of the object (of ::Data.Map.Strict....

[ 0.000385284423828125, 0.0089111328125, 0.00469970703125, 0.00347900390625, -0.01409912109375, -0.00518798828125, 0.01251220703125, 0.010498046875, 0.0069580078125, -0.01708984375, 0.0247802734375, -0.0150146484375, 0.0162353515625, 0.00909423828125, 0.021240234375, -0.0026397705078125,...

[ 11249, 14602, 12301, 123435, 4240, 4488, 28282, 43658, 959, 22995, 29087, 54, 157, 22062, 14311, 41159, 3796, 712, 1556, 142508, 11809, 166179, 62233, 18, 707, 4865, 66161, 18151, 3060, 10, 36746, 137989, 15005, 759, 91067, 15549, 86997, 313,...

[ 0.04241943359375, 0.03594970703125, 0.1688232421875, 0.1259765625, 0.2379150390625, 0.1341552734375, 0.13232421875, 0.19921875, 0.0994873046875, 0.165771484375, 0.280029296875, 0.037261962890625, 0.0948486328125, 0.036407470703125, 0.1103515625, 0.015869140625, 0.034271240234375, 0...

embed

14109562_c0

14109562

haskell

0

Title: Parsing XML into records Problem title: Parsing XML into records Tags: xml, haskell Problem: Parsing XML into records I’d like to write a Haskell library to work with a web service API. I get an XML or JSON response from the server, say it looks like this: <foo> <bar>1</bar> <baz>moo</baz> </foo> I want to turn ...

Parsing XML into records Parsing XML into records xml haskell Parsing XML Foo Integer Parsing XML into records I’d like to write a Haskell library to work with a web service API. I get an XML or JSON response from the server, say it looks like this: I want to turn it into a record: How can I abstract this so that I don...

[ -0.0078125, 0.0185546875, 0.0093994140625, -0.004425048828125, 0.00909423828125, 0.0308837890625, -0.01519775390625, -0.007171630859375, -0.006988525390625, 0.000904083251953125, -0.01177978515625, -0.042724609375, -0.0111083984375, 0.00701904296875, 0.002166748046875, -0.0103149414062...

[ 2392, 6953, 92537, 3934, 115923, 131492, 1556, 142508, 9572, 31, 44401, 1884, 33022, 20625, 35773, 1294, 4488, 678, 1467, 4516, 61687, 2046, 707, 821, 58627, 57553, 10723, 33342, 903, 3444, 47, 15504, 10, 17164, 11249, 831, 164789, 23009, 3...

[ 0.17138671875, 0.09832763671875, 0.2939453125, 0.2127685546875, 0.270263671875, 0.2401123046875, 0.1334228515625, 0.224609375, 0.1578369140625, 0.1263427734375, 0.1981201171875, 0.097900390625, 0.0924072265625, 0.1258544921875, 0.15771484375, 0.0845947265625, 0.057220458984375, 0.0...

embed

14224904_c0

14224904

haskell

0

Title: Haskell Eq definition realizing a result Problem title: Haskell Eq definition realizing a result Tags: typeclass, haskell Problem: Haskell Eq definition realizing a result I was reading the definition for the Eq typeclass in the Data library, and I'm confused. At what point is it realized that two values are equ...

Haskell Eq definition realizing a result Haskell Eq definition realizing a result typeclass haskell Haskell Bool Haskell Eq definition realizing a result I was reading the definition for the Eq typeclass in the Data library, and I'm confused. At what point is it realized that two values are equal or not equal. From wha...

[ 0.0216064453125, 0.01177978515625, 0.01470947265625, 0.017822265625, 0.02587890625, 0.01324462890625, -0.00035858154296875, -0.011962890625, 0.0023040771484375, 0.0400390625, -0.00299072265625, -0.02490234375, 0.0021209716796875, 0.006256103515625, 0.0042724609375, 0.006866455078125, ...

[ 20625, 142508, 241, 864, 80934, 14823, 214, 10, 16750, 10644, 67413, 1556, 2460, 929, 16454, 11809, 35773, 55681, 6275, 442, 185171, 450, 6626, 142424, 621, 105950, 707, 959, 1884, 2806, 1660, 11782, 12638, 3789, 606, 54241, 316, 1650, 6192...

[ 0.1485595703125, 0.243408203125, 0.110595703125, 0.28466796875, 0.1689453125, 0.282958984375, 0.10565185546875, 0.054962158203125, 0.25048828125, 0.1541748046875, 0.2037353515625, 0.1163330078125, 0.1453857421875, 0.250244140625, 0.0218048095703125, 0.044158935546875, 0.065185546875,...

embed

23259718_c0

23259718

haskell

0

Title: Haskell, passing a function to filter in one line? Problem title: Haskell, passing a function to filter in one line? Tags: haskell Problem: Haskell, passing a function to filter in one line? I want to filter everything that is not divisible by 3 from a list in Haskell, this is technically what I want to do filte...

Haskell, passing a function to filter in one line? Haskell, passing a function to filter in one line? haskell Haskell Haskell, passing a function to filter in one line? I want to filter everything that is not divisible by 3 from a list in Haskell, this is technically what I want to do The problem is, mod x 3 won't retu...

[ -0.0098876953125, 0.0224609375, 0.006500244140625, -0.02880859375, 0.022216796875, 0.00543212890625, 0.006988525390625, -0.0185546875, 0.00848388671875, -0.03125, -0.00008440017700195312, -0.00150299072265625, 0.000762939453125, -0.003265380859375, -0.024658203125, -0.011474609375, 0...

[ 20625, 142508, 452, 6953, 32354, 47, 46312, 23, 1632, 13315, 1556, 3444, 26818, 83, 959, 45, 99017, 390, 138, 1295, 5303, 121392, 2967, 2811, 1022, 23742, 18, 30646, 337, 31, 34677, 34292, 3917, 168861, 9709, 46572, 9077, 7722, 11814, 691...

[ 0.1434326171875, 0.2425537109375, 0.07611083984375, 0.036376953125, 0.2137451171875, 0.0204620361328125, 0.25244140625, 0.058685302734375, 0.124755859375, 0.162841796875, 0.1259765625, 0.087646484375, 0.09149169921875, 0.011322021484375, 0.07763671875, 0.038330078125, 0.1522216796875...

embed

20027707_c0

20027707

haskell

0

Title: What is a Combinator in Haskell Problem title: What is a Combinator in Haskell Tags: combinators, haskell Problem: What is a Combinator in Haskell In Real World Haskell , they describe combinators like this: In Haskell, we refer to functions that take other functions as arguments and return new functions as comb...

What is a Combinator in Haskell What is a Combinator in Haskell combinators haskell What Combinator Haskell Maybe What is a Combinator in Haskell In Real World Haskell , they describe combinators like this: And then later they state that maybeIO function is a combinator and its type signature looks like this: But all I...

[ -0.0184326171875, -0.003082275390625, 0.01177978515625, 0.01104736328125, 0.0289306640625, 0.0272216796875, 0.00020313262939453125, -0.0004367828369140625, -0.0059814453125, -0.00885009765625, -0.02294921875, -0.0257568359375, 0.00701904296875, 0.0018463134765625, 0.005706787109375, -0...

[ 4865, 83, 10, 106935, 19, 4597, 23, 20625, 142508, 22321, 22230, 1556, 83425, 5120, 6661, 98363, 1884, 903, 7068, 14432, 11341, 51139, 17780, 32354, 1290, 10644, 138256, 33342, 756, 1957, 51776, 34292, 137565, 20051, 2667, 712, 30646, 3642, ...

[ 0.1207275390625, 0.118408203125, 0.1341552734375, 0.257568359375, 0.2275390625, 0.25732421875, 0.1214599609375, 0.1649169921875, 0.2724609375, 0.278076171875, 0.196533203125, 0.1502685546875, 0.2020263671875, 0.1146240234375, 0.0997314453125, 0.1092529296875, 0.08062744140625, 0.04...

embed

47068188_c0

47068188

haskell

0

Title: How do I use ReadFile with getContents in do? Problem title: How do I use ReadFile with getContents in do? Tags: haskell Problem: How do I use ReadFile with getContents in do? I've been trying to take a user input string and read a dictionary into my main loop but whenever I try to check if my string is in the d...

How do I use ReadFile with getContents in do? How do I use ReadFile with getContents in do? haskell How ReadFile How do I use ReadFile with getContents in do? I've been trying to take a user input string and read a dictionary into my main loop but whenever I try to check if my string is in the dictionary, I get a false...

[ 0.00628662109375, 0.005615234375, 0.0033721923828125, -0.001007080078125, -0.00958251953125, 0.0159912109375, 0.036865234375, -0.006591796875, -0.01031494140625, -0.0264892578125, 0.01495361328125, -0.01409912109375, -0.0238037109375, -0.01226806640625, 0.00921630859375, 0.004058837890...

[ 11249, 4527, 4764, 174350, 678, 2046, 11935, 25352, 7, 23, 54, 1556, 142508, 31577, 5646, 38937, 107730, 79315, 136, 12301, 45, 10763, 6635, 3934, 5201, 40956, 217684, 12765, 2174, 83, 98320, 30646, 77947, 48225, 11435, 5701, 1733 ]

[ 0.041595458984375, 0.09716796875, 0.22021484375, 0.269775390625, 0.1011962890625, 0.119140625, 0.08428955078125, 0.1729736328125, 0.03863525390625, 0.0556640625, 0.1405029296875, 0.1024169921875, 0.1832275390625, 0.025177001953125, 0.0450439453125, 0.1043701171875, 0.127197265625, ...

embed

56852668_c0

56852668

haskell

0

Title: Unable to create a type-level list with a single element Problem title: Unable to create a type-level list with a single element Tags: haskell, data-kinds Problem: Unable to create a type-level list with a single element I'm scratching my head with the following behaviour. Is there an obvious reason why this is ...

Unable to create a type-level list with a single element Unable to create a type-level list with a single element haskell data-kinds Unable Prelude XDataKinds Bool Expected Unable to create a type-level list with a single element I'm scratching my head with the following behaviour. Is there an obvious reason why this i...

[ 0.0059814453125, 0.00762939453125, -0.01141357421875, 0.000720977783203125, 0.004852294921875, -0.003814697265625, -0.0174560546875, 0.00014400482177734375, -0.0003261566162109375, -0.007415771484375, -0.00518798828125, -0.035888671875, 0.0024566650390625, -0.005706787109375, -0.01385498...

[ 992, 2886, 28282, 10644, 67919, 5303, 678, 11001, 12830, 1556, 142508, 2053, 68347, 1914, 822, 112, 1193, 137989, 605, 7250, 2460, 929, 60075, 13, 206597, 10336, 25632, 224833, 162520, 31635, 7225, 527, 73265, 3217, 158406, 54608 ]

[ 0.03961181640625, 0.1439208984375, 0.1572265625, 0.2052001953125, 0.231201171875, 0.1968994140625, 0.050384521484375, 0.138916015625, 0.181396484375, 0.111572265625, 0.2103271484375, 0.0875244140625, 0.1591796875, 0.044403076171875, 0.128173828125, 0.034942626953125, 0.062744140625, ...

embed

33720858_c0

33720858

haskell

0

Title: Position of elements Problem title: Position of elements Tags: haskell Problem: Position of elements the function should give me the position of the searched elements. e. : index 'b' "dfbhjbd" -> [3,6] I've got so far: index b (x:xs) = length ( takeWhile ( /= b) xs ) but takeWhile will immediately stop after fin...

Position of elements Position of elements haskell Position x:xs x:tak Position of elements the function should give me the position of the searched elements. e. : index 'b' "dfbhjbd" -> [3,6] I've got so far: index b (x:xs) = length ( takeWhile ( /= b) xs ) but takeWhile will immediately stop after finding the matching...

[ 0.01385498046875, 0.0196533203125, -0.002105712890625, -0.000125885009765625, -0.0201416015625, 0.029052734375, 0.01129150390625, 0.00213623046875, 0.0308837890625, -0.0205078125, 0.008056640625, -0.001129150390625, 0.00860595703125, 0.01611328125, -0.006011962890625, -0.00074768066406...

[ 99428, 111, 80854, 1556, 142508, 1022, 12, 425, 7, 1865, 32354, 5608, 8337, 163, 70, 19069, 33938, 297, 28, 63262, 275, 420, 5871, 170, 34145, 33079, 122101, 910, 2060, 876, 2203, 140909, 5646, 979, 133, 248, 1369, 1284, 1456, 109312, 7...

[ 0.2388916015625, 0.150146484375, 0.2144775390625, 0.15185546875, 0.2301025390625, 0.0732421875, 0.03564453125, 0.1156005859375, 0.081298828125, 0.17578125, 0.1844482421875, 0.09259033203125, 0.0758056640625, 0.0518798828125, 0.0253143310546875, 0.2164306640625, 0.1951904296875, 0.0...

embed

26394199_c0

26394199

haskell

0

Title: Using TemplateHaskell to list all names in a namespace Problem title: Using TemplateHaskell to list all names in a namespace Tags: haskell, template-haskell Problem: Using TemplateHaskell to list all names in a namespace I want a TemplateHaskell function variablesInScope :: Q [Name] that returns a list of the Na...

Using TemplateHaskell to list all names in a namespace Using TemplateHaskell to list all names in a namespace haskell template-haskell Using TemplateHaskell Name Info Maybe Using TemplateHaskell to list all names in a namespace I want a TemplateHaskell function variablesInScope :: Q [Name] that returns a list of the Na...

[ 0.0135498046875, -0.01123046875, 0.00811767578125, 0.02294921875, 0.0072021484375, 0.0068359375, 0.0002727508544921875, -0.00099945068359375, -0.01318359375, -0.0390625, 0.0089111328125, -0.0108642578125, 0.0030059814453125, -0.0057373046875, 0.019287109375, 0.02099609375, -0.0096435...

[ 345, 196631, 6495, 7, 142508, 5303, 756, 123055, 210716, 23, 1556, 110934, 10557, 15757, 14048, 83425, 3444, 32354, 77336, 4153, 61278, 61122, 1984, 2396, 163612, 30646, 111, 70820, 903, 4677, 19882, 29479, 456, 40383, 6713, 2037, 50770, 2335...

[ 0.0390625, 0.250732421875, 0.0797119140625, 0.051300048828125, 0.207275390625, 0.17822265625, 0.0992431640625, 0.199462890625, 0.230712890625, 0.0186767578125, 0.103271484375, 0.251708984375, 0.1102294921875, 0.156005859375, 0.1968994140625, 0.00250244140625, 0.098388671875, 0.1827...

embed

20499129_c0

20499129

haskell

0

Title: Explain this 'Merge' Function in Haskell Problem title: Explain this 'Merge' Function in Haskell Tags: mergesort, sorting, haskell Problem: Explain this 'Merge' Function in Haskell I am learning Haskell and I am having trouble understanding this function. I am implementing mergesort. I have t...

Explain this 'Merge' Function in Haskell Explain this 'Merge' Function in Haskell mergesort sorting haskell Explain Merge Haskell x:xt y:yt Explain this 'Merge' Function in Haskell I am learning Haskell and I am having trouble understanding this function. I am implementing mergesort. I have the merg...

[ 0.006622314453125, 0.0267333984375, 0.01397705078125, -0.01190185546875, 0.00927734375, -0.002655029296875, -0.0206298828125, -0.00970458984375, 0.0076904296875, 0.040283203125, 0.00982666015625, -0.0098876953125, 0.0166015625, -0.00159454345703125, 0.0037384033203125, -0.0167236328125...

[ 60075, 16442, 903, 3768, 30248, 429, 28670, 10763, 23, 20625, 142508, 42564, 62351, 12096, 214, 1556, 6035, 1022, 12, 29062, 113, 20191, 52080, 63134, 100094, 32354, 29479, 195625, 5844, 28219, 2367, 1991, 20594, 222530, 46876, 6002, 86531, 3...

[ 0.0789794921875, 0.1361083984375, 0.1087646484375, 0.0718994140625, 0.2152099609375, 0.2059326171875, 0.1734619140625, 0.08734130859375, 0.046417236328125, 0.141357421875, 0.238525390625, 0.255859375, 0.22900390625, 0.1868896484375, 0.010284423828125, 0.120361328125, 0.1944580078125,...

embed

70341841_c0

70341841

haskell

0

Title: How to use show to print character without single quotes? Problem title: How to use show to print character without single quotes? Tags: haskell Problem: How to use show to print character without single quotes? I'm defining an instance of the Show typeclass for a custom data type where in the single lettered ch...

How to use show to print character without single quotes? How to use show to print character without single quotes? haskell How How to use show to print character without single quotes? I'm defining an instance of the Show typeclass for a custom data type where in the single lettered character name is returned but it r...

[ 0.0054931640625, 0.006927490234375, 0.01171875, 0.013427734375, -0.00860595703125, 0.01104736328125, 0.00848388671875, -0.00701904296875, 0.0098876953125, 0.01104736328125, -0.0263671875, -0.042724609375, -0.009033203125, 0.01348876953125, -0.03564453125, 0.00872802734375, -0.0065307...

[ 11249, 47, 4527, 7639, 28412, 62816, 15490, 11001, 66747, 1556, 142508, 13204, 110527, 17367, 10644, 67413, 114122, 2053, 66185, 9351, 176377, 1284, 30646, 678, 137567, 11, 237, 130250, 3642, 76228, 6056, 7464, 17368, 85689, 21441, 1507, 5303, ...

[ 0.07135009765625, 0.033477783203125, 0.1015625, 0.298095703125, 0.1962890625, 0.193603515625, 0.133544921875, 0.1282958984375, 0.21044921875, 0.1121826171875, 0.1888427734375, 0.041473388671875, 0.05145263671875, 0.25244140625, 0.088134765625, 0.1103515625, 0.0469970703125, 0.06304...

embed

44000862_c0

44000862

haskell

0

Title: Convert Type with ByteString to Text? Problem title: Convert Type with ByteString to Text? Tags: haskell Problem: Convert Type with ByteString to Text? Using conduit , my private repo code fails to compile: Expected type: ConduitM Text Void (Control.Monad.Trans.Resource.Internal.ResourceT IO) () Actual type: Con...

Convert Type with ByteString to Text? Convert Type with ByteString to Text? haskell Convert Type ByteString Text Expected ConduitM Control.Monad.Trans.Resource.Internal.ResourceT Actual Helper Convert Type with ByteString to Text? Using conduit , my private repo code fails to compile: How can I define a function?

[ 0.01806640625, -0.0125732421875, 0.006317138671875, 0.0164794921875, -0.01214599609375, 0.022705078125, -0.0133056640625, -0.00860595703125, -0.00579833984375, 0.006072998046875, -0.01055908203125, -0.015380859375, 0.00689697265625, 0.0067138671875, 0.0029449462890625, -0.0035858154296...

[ 1657, 11549, 60457, 678, 3311, 67, 71713, 214, 47, 24129, 1556, 142508, 60075, 13, 89829, 112061, 594, 27131, 46674, 712, 62624, 60427, 44851, 618, 100582, 39527, 56, 345, 120565, 14375, 93392, 18151, 35782, 9969, 1340, 61924, 32354 ]

[ 0.072509765625, 0.157470703125, 0.27294921875, 0.102294921875, 0.1033935546875, 0.1317138671875, 0.198974609375, 0.085693359375, 0.0966796875, 0.2479248046875, 0.1124267578125, 0.211181640625, 0.0804443359375, 0.09613037109375, 0.03411865234375, 0.1424560546875, 0.076904296875, 0.1...

embed

70277534_c0

70277534

haskell

0

Title: Can we construct an infinite list that satisfies a given bit predicate? Problem title: Can we construct an infinite list that satisfies a given bit predicate? Tags: haskell, list, bitstring, predicate Problem: Can we construct an infinite list that satisfies a given bit predicate? If we have a given predicate p ...

Can we construct an infinite list that satisfies a given bit predicate? Can we construct an infinite list that satisfies a given bit predicate? haskell list bitstring predicate Can Bool Can we construct an infinite list that satisfies a given bit predicate? If we have a given predicate p :: [Bool] -> Bool that take an ...

[ 0.01263427734375, -0.006866455078125, -0.01226806640625, 0.009521484375, -0.0025634765625, 0.017822265625, 0.01220703125, 0.003082275390625, -0.0003070831298828125, -0.01495361328125, 0.01904296875, -0.022705078125, 0.00390625, 0.00103759765625, -0.0030517578125, 0.021728515625, 0.00...

[ 4171, 642, 64549, 54241, 13, 5303, 450, 40407, 3387, 34475, 4785, 1653, 2063, 67, 142, 1556, 142508, 91693, 2460, 929, 915, 12647, 33079, 5646, 171859, 30646, 87599, 707, 22225, 35509, 51, 69723, 27289, 110, 6528, 4488, 1810, 32354, 1238, ...

[ 0.10064697265625, 0.0701904296875, 0.205322265625, 0.184326171875, 0.115234375, 0.251708984375, 0.0098876953125, 0.18359375, 0.0633544921875, 0.0728759765625, 0.166259765625, 0.17236328125, 0.1832275390625, 0.055511474609375, 0.0244598388671875, 0.0987548828125, 0.2015380859375, 0....

embed

32980278_c0

32980278

haskell

0

Title: Confuse about flip function Problem title: Confuse about flip function Tags: haskell Problem: Confuse about flip function charIn :: Char -> String -> Bool charIn _ [] = False charIn x (y:ys) = x==y || charIn x ys isWord :: String -> Bool isWord = all $ flip charIn "abcdefghijklmnopqrstuvwxyz" -- isword "abc" (Re...

Confuse about flip function Confuse about flip function haskell Confuse Char Bool y:ys Result ab1 Confuse about flip function I'm confuse about the way flip function works. I know it flips first two arguments but how does it work in the above code? Does it just flip the string argument and charIn "abcdefghijklmnopqrstu...

[ 0.0155029296875, -0.00750732421875, 0.0069580078125, 0.01116943359375, 0.0003070831298828125, 0.038818359375, 0.02197265625, -0.01556396484375, -0.007598876953125, 0.017333984375, 0.0267333984375, 0.00958251953125, -0.01470947265625, 0.01611328125, -0.006988525390625, -0.00112152099609...

[ 106161, 4032, 1672, 147505, 32354, 1556, 142508, 21656, 2460, 929, 113, 4778, 126684, 1563, 418, 55681, 184, 3917, 43240, 3714, 442, 7, 5117, 6626, 10750, 3642, 14602, 4488, 36917, 18151, 101790, 1660, 79315, 136, 21441, 4153, 2055, 71574, ...

[ 0.149169921875, 0.139892578125, 0.056884765625, 0.285400390625, 0.22119140625, 0.10400390625, 0.23681640625, 0.1326904296875, 0.051300048828125, 0.1455078125, 0.0208740234375, 0.1016845703125, 0.1573486328125, 0.0999755859375, 0.040863037109375, 0.1160888671875, 0.08392333984375, 0...

embed

13706072_c0

13706072

haskell

0

Title: Apply a function to lists in a list Problem title: Apply a function to lists in a list Tags: haskell Problem: Apply a function to lists in a list I want a function that in each of the lists of a list ([[],[],[]]) makes the sum of the elements and if it is even add to that list a 0 and a 1, otherwise. I tried wit...

Apply a function to lists in a list Apply a function to lists in a list haskell Apply Matrix Matr x:xs Apply a function to lists in a list I want a function that in each of the lists of a list ([[],[],[]]) makes the sum of the elements and if it is even add to that list a 0 and a 1, otherwise. I tried with this, but it...

[ -0.017822265625, 0.0264892578125, 0.0179443359375, -0.0040283203125, 0.000476837158203125, 0.01708984375, 0.006927490234375, 0.01287841796875, 0.02197265625, 0.0164794921875, 0.011474609375, -0.01055908203125, 0.01031494140625, 0.01031494140625, -0.004364013671875, 0.0010833740234375, ...

[ 5659, 538, 10, 32354, 47, 5303, 7, 23, 1556, 142508, 194234, 7656, 42, 1022, 12, 425, 87, 3444, 450, 12638, 111, 86245, 30482, 10554, 80854, 2174, 3853, 15190, 757, 136, 106, 120262, 37842, 903, 26785, 100, 10336, 3714, 3249, 27060, 818...

[ 0.194580078125, 0.10162353515625, 0.0501708984375, 0.259765625, 0.17041015625, 0.254150390625, 0.109130859375, 0.10101318359375, 0.158935546875, 0.250244140625, 0.216796875, 0.131591796875, 0.10986328125, 0.0408935546875, 0.042694091796875, 0.07659912109375, 0.0357666015625, 0.1516...

embed

7185366_c1

7185366

haskell

1

type safety and include 'B4 (Either X Y)' and put in some nice runtime errors for when it has the wrong value. Maybe there's a better way to approach "almost the same" data types? Update: so I worked around by writing a pseudo-fmap: convert :: (a -> b) -> A a -> A b Which at least allows me to separate the conversion ...

[ -0.018798828125, -0.01177978515625, -0.01348876953125, -0.000904083251953125, -0.0211181640625, 0.035400390625, -0.0115966796875, 0.0037384033203125, 0.03369140625, -0.00128173828125, -0.0062255859375, 0.00677490234375, 0.004119873046875, 0.006011962890625, -0.01446533203125, -0.002182...

[ 10644, 81900, 26698, 571, 617, 9319, 1193, 990, 3884, 26267, 11675, 6032, 18499, 44691, 34292, 11522, 3917, 51515, 840, 18, 5701, 2053, 52895, 79786, 10932, 32562, 74189, 420, 62346, 96760, 1984, 11, 33079, 876, 19713, 114864, 84797, 142477, ...

[ 0.25146484375, 0.232666015625, 0.1148681640625, 0.058685302734375, 0.1531982421875, 0.07958984375, 0.0908203125, 0.12646484375, 0.016265869140625, 0.044464111328125, 0.02301025390625, 0.03729248046875, 0.1207275390625, 0.108642578125, 0.10498046875, 0.0335693359375, 0.038177490234375...

embed

8366093_c1

8366093

haskell

1

getting confused by monads (and the context that the trap me into!), and the do statement. I really want to write something like this, but I know it's wrong: firstLine <- contents.head (m,n) <- map read (words firstLine) because contents is not a list - but a monad. Any help on the next step would be great. So I've ju...

[ -0.0177001953125, 0.00439453125, -0.00112152099609375, 0.01214599609375, -0.004669189453125, 0.01141357421875, 0.0189208984375, 0.0062255859375, 0.013916015625, -0.038818359375, -0.01007080078125, 0.00885009765625, -0.006988525390625, -0.0059814453125, 0.020263671875, -0.00370788574218...

[ 20949, 55681, 5281, 2667, 712, 7, 43701, 63819, 3934, 54, 63805, 6183, 3444, 33022, 1884, 903, 3714, 44691, 5117, 93232, 10941, 5, 31251, 39, 19, 22288, 12301, 47416, 959, 5303, 4358, 29954, 134053, 831, 60520, 594, 124519, 174350, 2046, ...

[ 0.0219879150390625, 0.1295166015625, 0.0733642578125, 0.152099609375, 0.2142333984375, 0.1307373046875, 0.1195068359375, 0.18115234375, 0.004638671875, 0.1434326171875, 0.1822509765625, 0.09619140625, 0.06634521484375, 0.087890625, 0.039886474609375, 0.0153350830078125, 0.08215332031...

embed

8585192_c4

8585192

haskell

4

877c150b681896452f205f4, mime-mail-0.4.1.0-05d76f10c6f18f7178113a6d760f371a, monad-control-0.3.1-092d8fe82727181557b850f795f847bc, persistent-0.6.4.3-6e59b956a206ce4f4a9296367507c2b8, persistent-sqlite-0.6.2.1-d32462e51baa09b53b6fd83dae922fc7, shakespeare-css-0.10.4-f8e17e4528d3a37edee74b13441720de, shakespeare-js-0.10...

[ -0.00994873046875, 0.0111083984375, 0.0108642578125, 0.0172119140625, 0.007598876953125, 0.0072021484375, -0.036865234375, 0.00103759765625, 0.015869140625, 0.00848388671875, 0.005767822265625, -0.01373291015625, -0.0257568359375, -0.0023040771484375, 0.013671875, 0.018798828125, -0....

[ 6, 182055, 238, 19236, 275, 16028, 1819, 11648, 170265, 420, 143422, 617, 4, 324, 282, 9, 2065, 121254, 5, 102107, 87741, 71, 11835, 963, 910, 139305, 116597, 11, 110216, 118552, 2667, 712, 81988, 170179, 180033, 12231, 1019, 2242, 159595, ...

[ 0.1116943359375, 0.232177734375, 0.0994873046875, 0.1622314453125, 0.0902099609375, 0.155029296875, 0.10791015625, 0.1156005859375, 0.163818359375, 0.086181640625, 0.1748046875, 0.1566162109375, 0.1204833984375, 0.1802978515625, 0.25732421875, 0.097900390625, 0.2064208984375, 0.163...

embed

64851169_c0

64851169

haskell

0

Title: Haskell - Check if position is even/odd Problem title: Haskell - Check if position is even/odd Tags: haskell Problem: Haskell - Check if position is even/odd What I need to do is to apply alternately 2 functions in a list. For example: (*2) (-3) [4,5,6,7,8] would result in [8,2,12,4,16] , because 4*2 , 5-3 , 6*2...

Haskell - Check if position is even/odd Haskell - Check if position is even/odd haskell Haskell Check Haskell - Check if position is even/odd What I need to do is to apply alternately 2 functions in a list. For example: would result in [8,2,12,4,16] , because 4*2 , 5-3 , 6*2 , 7-3 , 8*2 ... What I was thinking was and ...

[ -0.005828857421875, 0.01287841796875, 0.005645751953125, 0.0034637451171875, -0.007476806640625, 0.0301513671875, 0.00299072265625, 0.01458740234375, 0.004974365234375, 0.0120849609375, 0.0185546875, -0.01068115234375, 0.018310546875, 0.005889892578125, -0.00823974609375, 0.00215148925...

[ 20625, 142508, 38679, 2174, 19069, 83, 3853, 64, 13606, 1556, 3871, 54, 59911, 75939, 21286, 116, 32354, 23, 5303, 2806, 16750, 1019, 304, 1530, 617, 2485, 6637, 149878, 190, 8316, 305, 382, 1639, 47644, 136, 420, 1022, 4426, 9, 7, 1238...

[ 0.152587890625, 0.260986328125, 0.207275390625, 0.1251220703125, 0.2374267578125, 0.1201171875, 0.22509765625, 0.093017578125, 0.237548828125, 0.1407470703125, 0.06439208984375, 0.008270263671875, 0.134521484375, 0.122802734375, 0.03717041015625, 0.1097412109375, 0.149658203125, 0....

embed

65653918_c0

65653918

haskell

0

Title: How to move all occurrences of the first element of the list to the end of the list in Haskell? Problem title: How to move all occurrences of the first element of the list to the end of the list in Haskell? Tags: haskell Problem: How to move all occurrences of the first element of the list to the end of the list...

How to move all occurrences of the first element of the list to the end of the list in Haskell? How to move all occurrences of the first element of the list to the end of the list in Haskell? haskell How Haskell x:xs How to move all occurrences of the first element of the list to the end of the list in Haskell? I want ...

[ -0.0003833770751953125, 0.00311279296875, 0.00067138671875, 0.01361083984375, -0.006195068359375, 0.00909423828125, 0.000946044921875, 0.0169677734375, 0.02099609375, -0.0169677734375, -0.006561279296875, 0.0196533203125, 0.0244140625, 0.00799560546875, -0.00119781494140625, -0.0013275...

[ 11249, 47, 25813, 756, 74918, 42, 69098, 5117, 12830, 5303, 3564, 111, 20625, 142508, 1556, 425, 23, 3444, 125663, 136, 1295, 3884, 5036, 107730, 122101, 617, 363, 758, 1019, 30646, 163, 163324, 92714, 96386, 36663, 64457 ]

[ 0.0955810546875, 0.1549072265625, 0.1962890625, 0.1351318359375, 0.1693115234375, 0.118408203125, 0.0849609375, 0.1602783203125, 0.176513671875, 0.1866455078125, 0.2215576171875, 0.0928955078125, 0.1492919921875, 0.2452392578125, 0.1053466796875, 0.0556640625, 0.06597900390625, 0.0...

embed

56942063_c1

56942063

haskell

1

| t == 2 = Type2 handleMessage Type1 msg = handleType1 msg handleMessage Type2 msg = handleType2 msg Again, we can push the switch around, but I'm not really seeing something elegant. I'm hoping for several things: Cohesion: code is bundled together well. Adding a new handle requires little boilerplate. None would be ...

[ 0.0103759765625, 0.0098876953125, -0.021728515625, 0.01470947265625, -0.01336669921875, 0.000301361083984375, -0.0137939453125, 0.0003108978271484375, 0.009033203125, -0.00921630859375, 0.007049560546875, 0.0024871826171875, 0.006256103515625, -0.004638671875, -0.0006561279296875, 0.00...

[ 808, 69112, 116, 2203, 60457, 304, 34831, 594, 6011, 429, 418, 68163, 177, 196707, 831, 25944, 70, 101089, 10932, 959, 86681, 9844, 27650, 156377, 100, 40368, 8966, 1311, 1106, 6889, 18151, 57134, 6259, 25842, 5299, 62, 59725, 3525, 144570,...

[ 0.1126708984375, 0.0926513671875, 0.1290283203125, 0.030914306640625, 0.21533203125, 0.1361083984375, 0.2442626953125, 0.039703369140625, 0.167724609375, 0.0318603515625, 0.05523681640625, 0.0595703125, 0.082275390625, 0.185546875, 0.0258941650390625, 0.1324462890625, 0.0071105957031...

embed

34175173_c0

34175173

haskell

0

Title: Haskell: Could not find module `Data.List.Split' Problem title: Haskell: Could not find module `Data.List.Split' Tags: haskell Problem: Haskell: Could not find module `Data.List.Split' I'm trying to split a list in Haskell. As to my knowledge, the easiest way to do this is with splitOn , but this funct...

Haskell: Could not find module `Data.List.Split' Haskell: Could not find module `Data.List.Split' haskell Data.List.Split Haskell Could Data.List Haskell: Could not find module `Data.List.Split' I'm trying to split a list in Haskell. As to my knowledge, the easiest way to do this is with splitOn , but this fu...

[ -0.0147705078125, 0.0150146484375, -0.0096435546875, -0.006866455078125, -0.01361083984375, 0.0279541015625, 0.024169921875, -0.00701904296875, 0.0035858154296875, -0.01055908203125, -0.017578125, -0.031005859375, 0.0026092529296875, 0.01519775390625, 0.0018768310546875, -0.00173187255...

[ 20625, 142508, 191147, 959, 7413, 88996, 137989, 154663, 31923, 4353, 3768, 1556, 11809, 5, 31577, 65450, 5303, 1544, 525, 678, 20320, 32354, 144570, 24927, 1914, 822, 18499, 4488, 86869, 23468, 88303, 30700 ]

[ 0.12890625, 0.2117919921875, 0.1024169921875, 0.11181640625, 0.1768798828125, 0.223876953125, 0.1512451171875, 0.2322998046875, 0.126953125, 0.23876953125, 0.06494140625, 0.1043701171875, 0.1370849609375, 0.0328369140625, 0.0277252197265625, 0.2374267578125, 0.20947265625, 0.061645...

embed

15784841_c0

15784841

haskell

0

Title: What actually $ function does in haskell? Problem title: What actually $ function does in haskell? Tags: dollar-sign, haskell-prelude, operators, syntax, haskell Problem: What actually $ function does in haskell? I know $ :: (a->b) -> a -> b f $ x = f x Intuitively it seems to me, like to say, 1. $ delays the ev...

What actually $ function does in haskell? What actually $ function does in haskell? dollar-sign haskell-prelude operators syntax haskell What What actually $ function does in haskell? I know Intuitively it seems to me, like to say, 1. $ delays the evaluation of the function to its left 2. evaluates whats to its right 3...

[ 0.01275634765625, -0.00020503997802734375, 0.0361328125, -0.003143310546875, -0.00799560546875, 0.01708984375, 0.01513671875, 0.00909423828125, 0.01324462890625, -0.0167236328125, -0.000545501708984375, -0.0037078857421875, -0.00732421875, 0.00677490234375, -0.020751953125, 0.003677368...

[ 4865, 20653, 3650, 32354, 14602, 23, 1556, 142508, 15437, 31304, 4692, 822, 112, 39933, 6002, 86531, 3714, 18425, 37202, 1884, 5154, 615, 8, 5259, 7, 219836, 47, 25737, 787, 151575, 2367, 7108, 1031, 61590, 16750, 15787, 10422, 28219, 15400...

[ 0.08111572265625, 0.209228515625, 0.25244140625, 0.240966796875, 0.1435546875, 0.0816650390625, 0.1329345703125, 0.239990234375, 0.1531982421875, 0.141845703125, 0.020904541015625, 0.1163330078125, 0.031707763671875, 0.167236328125, 0.02752685546875, 0.04071044921875, 0.001708984375,...

embed

17600168_c0

17600168

haskell

0

Title: Haskell newtype syntax Problem title: Haskell newtype syntax Tags: newtype, haskell Problem: Haskell newtype syntax Please help me to understand the following definition: newtype Writer w a = Writer { runWriter :: (a,w) } instance (Monoid w) => Monad (Writer w) where return a = Writer (a,mempty) (Writer (a,w)) >...

Haskell newtype syntax Haskell newtype syntax newtype haskell Haskell Writer Monoid Monad Haskell newtype syntax Please help me to understand the following definition: Why is runWriter is declared as when its actual type is: Once I tried with ghci I realized this must be some implicit argument since type "a" has to be ...

[ -0.0189208984375, 0.0107421875, 0.00787353515625, 0.00982666015625, -0.00323486328125, 0.0057373046875, -0.0177001953125, -0.0166015625, 0.00482177734375, 0.0191650390625, 0.00665283203125, 0.00439453125, -0.01007080078125, -0.019287109375, 0.001800537109375, -0.0155029296875, 0.0217...

[ 20625, 142508, 3525, 50986, 6002, 86531, 1556, 601, 2783, 56, 77879, 532, 60331, 71, 4358, 28219, 25632, 80934, 44084, 83, 11675, 1456, 159978, 237, 3229, 8561, 10644, 37842, 31380, 318, 185171, 165164, 10750, 11, 83324, 66161, 123087, 3688 ]

[ 0.110595703125, 0.2308349609375, 0.1077880859375, 0.27978515625, 0.1317138671875, 0.1484375, 0.0972900390625, 0.0726318359375, 0.2083740234375, 0.1707763671875, 0.1207275390625, 0.0966796875, 0.12060546875, 0.068359375, 0.02783203125, 0.07421875, 0.022003173828125, 0.13623046875, ...

embed

53585992_c0

53585992

haskell

0

Title: How to sort a massiv array along innermost dimension? Problem title: How to sort a massiv array along innermost dimension? Tags: sorting, multidimensional-array, massiv, arrays, haskell Problem: How to sort a massiv array along innermost dimension? I have an Array r Ix2 a such that (Manifest r Ix2 a, Ord a) . I'...

How to sort a massiv array along innermost dimension? How to sort a massiv array along innermost dimension? sorting multidimensional-array massiv arrays haskell How Array Ix2 Manifest Ord Vector How to sort a massiv array along innermost dimension? I have an Array r Ix2 a such that (Manifest r Ix2 a, Ord a) . I'd like ...

[ 0.003387451171875, 0.015869140625, -0.01513671875, 0.01300048828125, -0.006103515625, 0.0111083984375, 0.00726318359375, -0.0107421875, -0.0087890625, 0.000896453857421875, 0.00408935546875, -0.003265380859375, -0.0028533935546875, 0.007659912109375, -0.022216796875, -0.005157470703125...

[ 11249, 47, 12096, 127123, 10298, 53, 33233, 75414, 840, 18, 91403, 214, 6024, 157955, 19305, 4778, 1556, 142508, 69253, 87, 425, 304, 92669, 35379, 2609, 18770, 1690, 10, 6044, 14, 13576, 1884, 98, 12638, 15555, 70796, 36880, 29479, 21972, ...

[ 0.088623046875, 0.049591064453125, 0.236572265625, 0.247802734375, 0.148681640625, 0.123046875, 0.1097412109375, 0.1195068359375, 0.093505859375, 0.04376220703125, 0.1480712890625, 0.0294189453125, 0.0149078369140625, 0.0843505859375, 0.07305908203125, 0.02752685546875, 0.04663085937...

embed

41551942_c3

41551942

haskell

3

P32; Sp = Sp - 4; call GHC.Num.+_info() args: 20, res: 0, upd: 4; } } Code signals: Can, my_sum, my_sum_s24N_entry, info_tbl, c25x, block_c25x_info, rep:StackRep, c267, my_sum_s24N_info, rep:HeapRep, Fun, fun_type, ArgSpec, stack_info, arg_space, updfr_space, Just, _s24N::P32, _s24O::P32, P32, SpLim, c268, c269, HpLim,...

[ -0.0166015625, 0.0025177001953125, 0.02001953125, 0.00579833984375, -0.005828857421875, 0.023193359375, -0.00164794921875, 0.004119873046875, 0.0247802734375, -0.035400390625, 0.00830078125, -0.019775390625, -0.00054168701171875, 0.000659942626953125, 0.027099609375, -0.0103759765625, ...

[ 436, 6460, 74, 8019, 2203, 20, 201, 11782, 527, 73265, 839, 316, 1328, 7319, 79459, 387, 3332, 757, 4, 1257, 71, 51912, 28864, 26073, 7, 12, 4171, 759, 11832, 2357, 33, 15123, 3004, 9030, 501, 2588, 425, 46389, 454, 10958, 42378, 2594...

[ 0.1778564453125, 0.33935546875, 0.048614501953125, 0.1942138671875, 0.06268310546875, 0.072509765625, 0.1483154296875, 0.1903076171875, 0.1287841796875, 0.2349853515625, 0.0927734375, 0.1741943359375, 0.1182861328125, 0.228759765625, 0.2027587890625, 0.1151123046875, 0.1214599609375,...

embed

30590909_c0

30590909

haskell

0

Title: Haskell grouping list elements by fst Problem title: Haskell grouping list elements by fst Tags: list-comprehension, haskell Problem: Haskell grouping list elements by fst I'm trying to write a function group::[(Int, Int)]->[[(Int, Int)]] that would group elements of a list of tuples into subgroups dependant on ...

Haskell grouping list elements by fst Haskell grouping list elements by fst list-comprehension haskell Haskell Haskell grouping list elements by fst I'm trying to write a function that would group elements of a list of tuples into subgroups dependant on the first coordinate, ie: should result in I'd imagine list compre...

[ 0.00457763671875, 0.0034942626953125, -0.004302978515625, 0.00341796875, -0.0120849609375, 0.024658203125, -0.013671875, 0.0093994140625, 0.0133056640625, -0.0106201171875, 0.00001823902130126953, 0.005340576171875, -0.0025787353515625, 0.006683349609375, -0.017822265625, 0.00753784179...

[ 20625, 142508, 21115, 214, 5303, 80854, 390, 1238, 271, 277, 4692, 3220, 6889, 1556, 31577, 33022, 32354, 370, 99726, 3934, 1614, 51588, 56566, 1236, 5117, 176866, 13, 5608, 16750, 28987, 46683, 70, 3917, 4785, 179933, 67660, 166589, 5646, ...

[ 0.1356201171875, 0.234130859375, 0.2242431640625, 0.052734375, 0.1805419921875, 0.1993408203125, 0.08203125, 0.10546875, 0.184326171875, 0.08258056640625, 0.164306640625, 0.1666259765625, 0.03497314453125, 0.1357421875, 0.038665771484375, 0.0670166015625, 0.162353515625, 0.10339355...

embed

13954878_c0

13954878

haskell

0

Title: Why can data type not be serialized although it is member of the show class? Problem title: Why can data type not be serialized although it is member of the show class? Tags: haskell Problem: Why can data type not be serialized although it is member of the show class? data Mine = Firstname String | Lastname Stri...

Why can data type not be serialized although it is member of the show class? Why can data type not be serialized although it is member of the show class? haskell Why Mine Firstname Lastname Show Serialize Not Why can data type not be serialized although it is member of the show class? This does not compile and gives th...

[ 0.0050048828125, 0.0087890625, 0.00848388671875, -0.0029144287109375, -0.0244140625, -0.003326416015625, -0.0081787109375, 0.01397705078125, -0.00421142578125, 0.0005340576171875, -0.0087890625, -0.000644683837890625, 0.0257568359375, 0.03173828125, -0.004058837890625, -0.0034332275390...

[ 44084, 831, 2053, 10644, 959, 35686, 29367, 102971, 32786, 7639, 18507, 83, 111, 1556, 142508, 56713, 23972, 11627, 21672, 17367, 135188, 20650, 11205, 186, 9969, 1340, 18499, 903, 51592, 43032 ]

[ 0.1080322265625, 0.08056640625, 0.13427734375, 0.206298828125, 0.1473388671875, 0.21142578125, 0.0924072265625, 0.09088134765625, 0.13623046875, 0.1923828125, 0.1732177734375, 0.0205535888671875, 0.0386962890625, 0.0877685546875, 0.1865234375, 0.1236572265625, 0.060394287109375, 0....

embed

23241587_c0

23241587

haskell

0

Title: C/C++ wrapper for Haskell IO monad Problem title: C/C++ wrapper for Haskell IO monad Tags: haskell, c%2B%2B, linker, static-linking, monads Problem: C/C++ wrapper for Haskell IO monad I want to call a Haskell function from C/C++. I have already read a few tutorials related to that topic, but IO monad calls are n...

C/C++ wrapper for Haskell IO monad C/C++ wrapper for Haskell IO monad haskell c%2B%2B linker static-linking monads Haskell C/C++ wrapper for Haskell IO monad I want to call a Haskell function from C/C++. I have already read a few tutorials related to that topic, but IO monad calls are not covered in them. In particular...

[ 0.0034332275390625, 0.0013580322265625, 0.0047607421875, 0.00063323974609375, -0.01361083984375, 0.0030059814453125, 0.007415771484375, -0.0064697265625, -0.01806640625, -0.04150390625, 0.00299072265625, -0.048095703125, -0.010009765625, -0.0091552734375, 0.0213623046875, 0.00126647949...

[ 313, 64, 441, 37223, 137565, 1264, 100, 20625, 142508, 17780, 2667, 712, 1556, 501, 3126, 56, 201939, 10187, 214, 87, 3444, 11782, 32354, 1295, 21771, 12301, 57143, 28451, 621, 959, 127918, 17311, 2806, 1884, 4527, 78974, 1984, 71713, 33079...

[ 0.123291015625, 0.1484375, 0.066162109375, 0.2548828125, 0.209716796875, 0.189453125, 0.0645751953125, 0.169677734375, 0.2744140625, 0.2281494140625, 0.130126953125, 0.163330078125, 0.139404296875, 0.04443359375, 0.1407470703125, 0.1041259765625, 0.135009765625, 0.1439208984375, ...

embed

53140675_c0

53140675

haskell

0

Title: Convert a list of digits to a number HASKELL Problem title: Convert a list of digits to a number HASKELL Tags: ghci, haskell, winghci Problem: Convert a list of digits to a number HASKELL I want to make a function in haskell that given a list of single digits, i make the full number. I was thinking in using inte...

Convert a list of digits to a number HASKELL Convert a list of digits to a number HASKELL ghci haskell winghci Convert HASKELL funcion5 x:xs Convert a list of digits to a number HASKELL I want to make a function in haskell that given a list of single digits, i make the full number. I was thinking in using intensive lis...

[ -0.0185546875, -0.000232696533203125, 0.0021514892578125, -0.0003910064697265625, -0.01611328125, 0.0167236328125, -0.0072021484375, 0.024658203125, 0.0155029296875, -0.02734375, 0.003326416015625, -0.006805419921875, -0.009521484375, 0.016357421875, -0.01953125, -0.0087890625, 0.023...

[ 1657, 11549, 5303, 111, 153939, 7, 47, 10, 14012, 11666, 10762, 56051, 31380, 318, 1556, 142508, 14775, 127, 7477, 6447, 758, 1022, 12, 425, 3444, 3249, 32354, 23, 34475, 11001, 17, 4393, 47644, 17368, 40894, 32926, 18151, 28960, 581, 652...

[ 0.0662841796875, 0.1842041015625, 0.21484375, 0.0433349609375, 0.234130859375, 0.08251953125, 0.1341552734375, 0.114013671875, 0.2384033203125, 0.148681640625, 0.1317138671875, 0.193359375, 0.0416259765625, 0.08514404296875, 0.17236328125, 0.2467041015625, 0.10009765625, 0.02522277...

embed

29068636_c0

29068636

haskell

0

Title: Haskell nested where clauses Problem title: Haskell nested where clauses Tags: syntax-error, haskell Problem: Haskell nested where clauses I am a beginner coder in haskell, while doing an exercise from the first chapter of this amazing book: http://book.realworldhaskell.org/read/getting-started.html I came acros...

Haskell nested where clauses Haskell nested where clauses syntax-error haskell Haskell wonderbox:ch01 quux.txt WC.hs:5:9 Haskell nested where clauses I am a beginner coder in haskell, while doing an exercise from the first chapter of this amazing book: http://book.realworldhaskell.org/read/getting-started.html I came a...

[ -0.004302978515625, 0.0111083984375, -0.016357421875, -0.00946044921875, 0.001312255859375, 0.025390625, -0.01043701171875, -0.017822265625, 0.0033721923828125, -0.0234375, -0.01318359375, -0.038818359375, 0.0296630859375, 0.006622314453125, 0.0009918212890625, 0.00909423828125, 0.01...

[ 20625, 142508, 8512, 71, 7440, 70731, 90, 6002, 86531, 188800, 1556, 32195, 11728, 206, 6746, 1103, 6077, 124326, 127, 1126, 9842, 1679, 552, 820, 81979, 139539, 44613, 12877, 30544, 32554, 10557, 39116, 17137, 31089, 44084, 831, 87, 959, 9...

[ 0.119140625, 0.2152099609375, 0.2340087890625, 0.0909423828125, 0.225341796875, 0.2117919921875, 0.061553955078125, 0.0848388671875, 0.1595458984375, 0.1505126953125, 0.10107421875, 0.07489013671875, 0.1678466796875, 0.0074462890625, 0.0726318359375, 0.020294189453125, 0.136352539062...

embed

19081535_c0

19081535

haskell

0

Title: How can I replace generators if I need only one result? Problem title: How can I replace generators if I need only one result? Tags: generator, haskell Problem: How can I replace generators if I need only one result? I'm playing with Haskell for first time. I've created function that returns first precise enough...

How can I replace generators if I need only one result? How can I replace generators if I need only one result? generator haskell How Double How can I replace generators if I need only one result? I'm playing with Haskell for first time. I've created function that returns first precise enough result. It works as expect...

[ 0.0019378662109375, -0.0029754638671875, 0.005035400390625, -0.0025634765625, 0.000843048095703125, 0.0255126953125, 0.002685546875, -0.0167236328125, 0.0026092529296875, -0.05322265625, 0.0196533203125, 0.0294189453125, -0.012939453125, -0.00677490234375, 0.01220703125, 0.00927734375,...

[ 11249, 831, 87, 91995, 145823, 7, 2174, 3871, 4734, 1632, 16750, 1556, 142508, 107172, 75169, 20625, 5117, 1733, 75935, 32354, 30646, 134995, 20174, 43240, 84751, 17368, 66211 ]

[ 0.0654296875, 0.081298828125, 0.04498291015625, 0.2012939453125, 0.2900390625, 0.11328125, 0.06048583984375, 0.1328125, 0.1182861328125, 0.1468505859375, 0.18798828125, 0.122802734375, 0.2154541015625, 0.19287109375, 0.062347412109375, 0.108154296875, 0.0775146484375, 0.03059387207...

embed

30019802_c0

30019802

haskell

0

Title: Haskell function foldl (\x y -> x*2 + y*2) 0 behavior Problem title: Haskell function foldl (\x y -> x*2 + y*2) 0 behavior Tags: haskell, fold Problem: Haskell function foldl (\x y -> x*2 + y*2) 0 behavior I stuck with a problem. What's difference between these two functions: foldl (\x y -> x*2 + y*2) 0 [1...

Haskell function foldl (\x y -> x*2 + y*2) 0 behavior Haskell function foldl (\x y -> x*2 + y*2) 0 behavior haskell fold Haskell Haskell function foldl (\x y -> x*2 + y*2) 0 behavior I stuck with a problem. What's difference between these two functions: where f = \x y -> x*2 + y*2 . I understand result of foldl :...

[ -0.004791259765625, -0.003204345703125, 0.004058837890625, -0.0032958984375, -0.0067138671875, 0.0216064453125, -0.0002765655517578125, 0.00148773193359375, 0.0021514892578125, -0.0028533935546875, 0.00872802734375, -0.0218505859375, -0.010498046875, 0.005706787109375, 0.0042724609375, ...

[ 20625, 142508, 32354, 18344, 20469, 425, 113, 20, 1230, 5386, 1639, 304, 997, 10461, 757, 123166, 1022, 1556, 42822, 33079, 179933, 2967, 60212, 17721, 6097, 6626, 7440, 1238, 2203, 6, 5, 28219, 16750, 15400, 14602, 7569, 10554, 7103, 12638...

[ 0.12353515625, 0.241455078125, 0.189208984375, 0.1689453125, 0.248046875, 0.06268310546875, 0.163818359375, 0.0155487060546875, 0.00439453125, 0.1099853515625, 0.047149658203125, 0.16943359375, 0.132080078125, 0.164306640625, 0.155517578125, 0.1810302734375, 0.012298583984375, 0.12...

embed

56407905_c1

56407905

haskell

1

root </>))) entries ((root, map fst files) :) . concat <$> mapM (walk . (root </>) . fst) dirs In an equation for ‘walk’: walk root = do entries <- liftIO $ listDirectory root (files, dirs) <- partition snd <$> liftM2 (<$>) zip (mapM (liftIO . doesFileExist . (root </>))) entries ((root, map fst files) :) . concat <$> ...

[ 0.0126953125, 0.01171875, 0.004150390625, 0.00021839141845703125, -0.009765625, 0.00848388671875, -0.01556396484375, -0.0155029296875, 0.0062255859375, -0.044189453125, -0.005126953125, -0.0022430419921875, 0.01141357421875, 0.031494140625, 0.0064697265625, 0.00173187255859375, -0.00...

[ 74855, 42946, 2740, 32149, 112820, 90, 148920, 22288, 1238, 271, 102158, 158, 4460, 594, 94449, 5402, 28, 5490, 35691, 2203, 54, 60520, 17780, 3650, 5303, 184911, 30675, 29822, 2878, 2208, 304, 68330, 62346, 104501, 14602, 174350, 19279, 1419...

[ 0.291015625, 0.017059326171875, 0.10479736328125, 0.1456298828125, 0.21728515625, 0.04937744140625, 0.223876953125, 0.10986328125, 0.02978515625, 0.092529296875, 0.09619140625, 0.0906982421875, 0.19970703125, 0.132080078125, 0.243408203125, 0.0843505859375, 0.0390625, 0.21203613281...

embed

58415407_c0

58415407

haskell

0

Title: Count elements in list with list comprehension Problem title: Count elements in list with list comprehension Tags: list, haskell, function Problem: Count elements in list with list comprehension I'm new to Haskell and trying to write a simple function. I would like to get each element compressed by its upcoming ...

Count elements in list with list comprehension Count elements in list with list comprehension list haskell function Data.List Count Char x:xs Count elements in list with list comprehension I'm new to Haskell and trying to write a simple function. I would like to get each element compressed by its upcoming frequency. Fo...

[ -0.00122833251953125, -0.0026092529296875, 0.00189971923828125, 0.0172119140625, 0.021240234375, 0.023681640625, 0.0177001953125, -0.0026702880859375, 0.0164794921875, -0.01104736328125, -0.0079345703125, -0.00836181640625, 0.037109375, 0.0262451171875, -0.046630859375, 0.0027923583984...

[ 108210, 80854, 23, 5303, 678, 46683, 3220, 6889, 1556, 142508, 32354, 11809, 154663, 21656, 1022, 12, 425, 7, 3525, 20625, 31577, 33022, 8781, 1884, 2046, 12638, 12830, 375, 11856, 1257, 277, 12478, 944, 107730, 11, 10545, 11210, 16750, 181...

[ 0.2069091796875, 0.21826171875, 0.090087890625, 0.180419921875, 0.1282958984375, 0.1478271484375, 0.1500244140625, 0.0245819091796875, 0.103759765625, 0.1976318359375, 0.1246337890625, 0.08819580078125, 0.1591796875, 0.1478271484375, 0.050537109375, 0.0186309814453125, 0.077270507812...

embed

12354089_c0

12354089

haskell

0

Title: Ambigous type variable Problem title: Ambigous type variable Tags: type-constraints, haskell Problem: Ambigous type variable I wrote a little haskell program that just counts how many ones there are in a number (Int). When I try to execute it haskell complains about ambigous variable constraints. I know that it ...

Ambigous type variable Ambigous type variable type-constraints haskell Ambigous count_ones n-10 n_new Ambigous type variable I wrote a little haskell program that just counts how many ones there are in a number (Int). When I try to execute it haskell complains about ambigous variable constraints. I know that it comes f...

[ -0.0033416748046875, -0.0093994140625, -0.020263671875, 0.01080322265625, 0.023193359375, 0.0035552978515625, -0.0238037109375, 0.01300048828125, 0.0019378662109375, -0.037353515625, 0.004608154296875, -0.04345703125, 0.0142822265625, 0.019775390625, 0.000637054443359375, -0.0222167968...

[ 10250, 20828, 223, 10644, 77336, 2271, 2816, 4288, 1556, 142508, 54529, 25749, 653, 9193, 54936, 54397, 10176, 1528, 1660, 3642, 5941, 64333, 2685, 23, 14012, 4153, 18, 9790, 71924, 186992, 920, 158, 32497, 4527, 74912, 177261, 118664, 10932,...

[ 0.1812744140625, 0.1422119140625, 0.1500244140625, 0.1619873046875, 0.249267578125, 0.043853759765625, 0.171875, 0.1361083984375, 0.1468505859375, 0.2242431640625, 0.1488037109375, 0.174072265625, 0.01611328125, 0.1383056640625, 0.1180419921875, 0.04144287109375, 0.081298828125, 0....

embed

23724823_c0

23724823

haskell

0

Title: how do you annotate type in HList Problem title: how do you annotate type in HList Tags: hlist, haskell Problem: how do you annotate type in HList I'm trying to use HList and I need to annotate it but I can't figure out how to do it. If if type the following in ghci >:t "hello" .*. HNil I got the following type ...

how do you annotate type in HList how do you annotate type in HList hlist haskell HList HNil how do you annotate type in HList I'm trying to use HList and I need to annotate it but I can't figure out how to do it. If if type the following in ghci I got the following type signature : HList ((':) * [Char] ('[] *)) Which ...

[ 0.00897216796875, -0.004180908203125, -0.004486083984375, 0.007080078125, -0.0172119140625, -0.005126953125, -0.0025634765625, -0.0003070831298828125, 0.005035400390625, -0.01141357421875, -0.00040435791015625, -0.052490234375, 0.00347900390625, -0.0002803802490234375, -0.02685546875, ...

[ 3642, 8668, 19888, 10644, 23, 572, 154663, 1096, 6562, 1556, 142508, 79059, 379, 4527, 26366, 54, 25632, 31380, 318, 138256, 60494, 12, 84068, 1065, 661, 28219, 18499, 17368, 1639, 154453, 23351, 7413 ]

[ 0.05548095703125, 0.17529296875, 0.1849365234375, 0.2330322265625, 0.0689697265625, 0.148681640625, 0.25048828125, 0.10546875, 0.234375, 0.10205078125, 0.1727294921875, 0.0833740234375, 0.1502685546875, 0.03271484375, 0.008087158203125, 0.001708984375, 0.061279296875, 0.08038330078...

embed

5151858_c0

5151858

haskell

0

Title: Running a Haskell program on the Android OS Problem title: Running a Haskell program on the Android OS Tags: android, executable, haskell Problem: Running a Haskell program on the Android OS Forenote: This is an extension of the thread started on /r/haskell Lets start with the facts: Android is one awesome Opera...

Running a Haskell program on the Android OS Running a Haskell program on the Android OS android executable haskell Running Haskell Android Running a Haskell program on the Android OS Forenote: This is an extension of the thread started on /r/haskell Lets start with the facts: Android is one awesome Operating System Has...

[ 0.00799560546875, 0.018310546875, 0.006317138671875, 0.007720947265625, -0.00677490234375, 0.01348876953125, -0.0052490234375, -0.004180908203125, -0.0269775390625, -0.050048828125, 0.00189971923828125, -0.029296875, 0.00180816650390625, 0.0048828125, -0.00341796875, -0.005767822265625...

[ 28398, 592, 20625, 142508, 1528, 98, 70, 3952, 11787, 10, 54527, 71924, 2886, 1556, 52445, 111938, 86997, 26859, 10557, 4034, 15824, 83, 1632, 79929, 16556, 1916, 12353, 2965, 56037, 449, 46876, 23208, 123019, 375, 964, 2856, 2806, 3249, 34...

[ 0.1473388671875, 0.055908203125, 0.1748046875, 0.27685546875, 0.1861572265625, 0.0999755859375, 0.04443359375, 0.2509765625, 0.1690673828125, 0.044586181640625, 0.208251953125, 0.103515625, 0.087158203125, 0.16796875, 0.03106689453125, 0.04010009765625, 0.037078857421875, 0.0049743...

embed

32412743_c0

32412743

haskell

0

Title: I already have an add function how can I use it in multiplication function? Problem title: I already have an add function how can I use it in multiplication function? Tags: haskell Problem: I already have an add function how can I use it in multiplication function? So far I have the definitions for n-1 and n+1 w...

I already have an add function how can I use it in multiplication function? I already have an add function how can I use it in multiplication function? haskell I already have an add function how can I use it in multiplication function? So far I have the definitions for n-1 and n+1 with suc and inc respectively How can ...

[ -0.021484375, 0.021240234375, 0.0238037109375, 0.0164794921875, 0.0004711151123046875, 0.01708984375, -0.000743865966796875, -0.011962890625, 0.000370025634765625, -0.05859375, 0.0157470703125, -0.0279541015625, -0.023681640625, 0.00002193450927734375, 0.0225830078125, -0.023193359375,...

[ 87, 21771, 765, 142, 15190, 32354, 3642, 831, 4527, 442, 23, 127664, 1363, 1556, 142508, 2060, 80934, 653, 5759, 136, 21748, 678, 42593, 238, 903, 17368, 4734, 195625, 1830, 2174, 92733, 110, 997, 20, 3714, 16750, 1022, 661, 113, 105950, ...

[ 0.059814453125, 0.1993408203125, 0.148193359375, 0.0821533203125, 0.2147216796875, 0.25830078125, 0.0802001953125, 0.1201171875, 0.1778564453125, 0.0611572265625, 0.082763671875, 0.2115478515625, 0.101806640625, 0.132568359375, 0.203857421875, 0.020050048828125, 0.1373291015625, 0....

embed

27322591_c0

27322591

haskell

0

Title: Haskell Guards and SublimeText 3 Problem title: Haskell Guards and SublimeText 3 Tags: syntax, syntax-highlighting, sublimetext3, sublimetext, haskell Problem: Haskell Guards and SublimeText 3 I switched over to Sublime Text 3 but now that I was coding some Haskell in ST3 I noticed something quite odd, which is ...

Haskell Guards and SublimeText 3 Haskell Guards and SublimeText 3 syntax syntax-highlighting sublimetext3 sublimetext haskell Haskell Guards SublimeText sublimetext3 Haskell Guards and SublimeText 3 I switched over to Sublime Text 3 but now that I was coding some Haskell in ST3 I noticed something quite odd, which is t...

[ -0.00421142578125, 0.0174560546875, 0.01361083984375, -0.0274658203125, 0.01123046875, -0.000583648681640625, -0.029296875, 0.0218505859375, -0.002471923828125, 0.01513671875, 0.003509521484375, -0.0098876953125, -0.01220703125, 0.0003490447998046875, 0.013671875, -0.007415771484375, ...

[ 20625, 142508, 135440, 7, 136, 8273, 150, 282, 174379, 138, 6002, 86531, 84396, 177476, 117584, 13, 22829, 363, 1556, 101089, 645, 24129, 552, 16992, 156672, 70270, 127308, 214, 62775, 56050, 33022, 5117, 35011, 134855, 12921, 24092, 17664, 2...

[ 0.119384765625, 0.2137451171875, 0.2296142578125, 0.109130859375, 0.015716552734375, 0.090087890625, 0.10382080078125, 0.1136474609375, 0.1817626953125, 0.161865234375, 0.1075439453125, 0.213134765625, 0.1046142578125, 0.1719970703125, 0.167236328125, 0.02386474609375, 0.171142578125...

embed

30369954_c0

30369954

haskell

0

Title: How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? Problem title: How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? Tags: haskell, foldleft, recursion Problem: How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? I am l...

How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? haskell foldleft recursion How How does this foldl-based function work: "myreverse = foldl (flip (:)) []"? I am learning haskell and I tried to writ...

[ -0.01068115234375, 0.01177978515625, 0.0189208984375, 0.01708984375, -0.0189208984375, 0.011962890625, 0.0037994384765625, 0.000568389892578125, 0.000286102294921875, -0.019287109375, 0.0101318359375, -0.00567626953125, 0.010009765625, 0.007293701171875, 0.004974365234375, -0.024414062...

[ 11249, 14602, 903, 18344, 20469, 77007, 32354, 4488, 1176, 107, 37676, 2203, 420, 21392, 84142, 1556, 142508, 19298, 2480, 195625, 1830, 52080, 37842, 33022, 10002, 39531, 184, 15490, 17368, 29806, 31577, 28219, 96276, 20271, 219836, 831, 18, ...

[ 0.094970703125, 0.0833740234375, 0.1064453125, 0.183349609375, 0.236328125, 0.150146484375, 0.1929931640625, 0.1591796875, 0.1343994140625, 0.1448974609375, 0.31640625, 0.1070556640625, 0.1044921875, 0.2298583984375, 0.1044921875, 0.08709716796875, 0.19921875, 0.0802001953125, 0....

embed

12318985_c0

12318985

haskell

0

Title: Print NominalDiffTime in Haskell Problem title: Print NominalDiffTime in Haskell Tags: type-conversion, haskell Problem: Print NominalDiffTime in Haskell I have piece of code like this in my Haskell program: ... start <- getCurrentTime ... end <- getCurrentTime ... delta = end `diffUTCTime` start ... After this,...

Print NominalDiffTime in Haskell Print NominalDiffTime in Haskell type-conversion haskell Print NominalDiffTime Haskell Num PrintfArg Print NominalDiffTime in Haskell I have piece of code like this in my Haskell program: After this, delta has type NominalDiffTime . As written in the documentation, this type in inherite...

[ -0.0181884765625, 0.0091552734375, 0.0194091796875, 0.0033111572265625, -0.007476806640625, -0.004119873046875, 0.0096435546875, -0.00152587890625, -0.004486083984375, -0.010986328125, 0.004058837890625, -0.035400390625, -0.002227783203125, -0.0155029296875, -0.023193359375, 0.00331115...

[ 39754, 438, 1249, 289, 397, 32920, 70059, 20625, 142508, 23, 10644, 2271, 46354, 1556, 52782, 420, 7614, 177, 63847, 18151, 1884, 903, 1528, 24372, 40703, 59121, 209806, 86151, 3444, 28412, 442, 678, 138, 27781, 44677, 7103, 32380, 2749, 20...

[ 0.2066650390625, 0.104736328125, 0.1866455078125, 0.1025390625, 0.0965576171875, 0.1986083984375, 0.239013671875, 0.144775390625, 0.24462890625, 0.022247314453125, 0.1767578125, 0.03021240234375, 0.114501953125, 0.1097412109375, 0.1783447265625, 0.1510009765625, 0.0872802734375, 0....

embed

25352757_c0

25352757

haskell

0

Title: Installing mingwrt into the haskell-platform without mingw-get Problem title: Installing mingwrt into the haskell-platform without mingw-get Tags: haskell, mingw, windows, haskell-platform Problem: Installing mingwrt into the haskell-platform without mingw-get The haskell-platform (2014.2.0.0) ships MingGW, but ...

Installing mingwrt into the haskell-platform without mingw-get Installing mingwrt into the haskell-platform without mingw-get haskell mingw windows haskell-platform Installing Installing mingwrt into the haskell-platform without mingw-get The haskell-platform (2014.2.0.0) ships MingGW, but without mingw-get. However, t...

[ -0.005950927734375, -0.00112152099609375, 0.01446533203125, -0.0033721923828125, -0.003814697265625, -0.0010986328125, 0.00244140625, -0.014892578125, 0.0089111328125, -0.02490234375, 0.0101318359375, -0.007171630859375, -0.000919342041015625, -0.000377655029296875, 0.01458740234375, 0...

[ 107951, 881, 115899, 18, 3934, 1556, 142508, 172121, 15490, 46996, 434, 3794, 54825, 7360, 73011, 77495, 109923, 276, 214, 102550, 1284, 9969, 1340, 70, 5423, 98908, 128239, 3871, 29096, 5, 127, 2831, 115723, 59720, 4527, 20600, 959, 99201, ...

[ 0.158447265625, 0.1883544921875, 0.214111328125, 0.211669921875, 0.1236572265625, 0.135986328125, 0.2325439453125, 0.16162109375, 0.1285400390625, 0.19873046875, 0.1876220703125, 0.1868896484375, 0.1011962890625, 0.1591796875, 0.138916015625, 0.052001953125, 0.10400390625, 0.088378...

embed

26452874_c1

26452874

haskell

1

s', count <> onePut)) Side note, I am also stumped as to how I would get the "count" part of the state' out of the state' so I can write it on the screen Maybe it's more helpful to explain what run is supposed to do. For instance if you use a function label, that labels each node in a tree with an incrementing number ...

[ -0.000293731689453125, -0.007049560546875, -0.0128173828125, 0.0162353515625, 0.0194091796875, 0.0108642578125, -0.03466796875, -0.0260009765625, 0.0205078125, -0.027099609375, 0.0017852783203125, -0.000728607177734375, 0.00188446044921875, 0.00653076171875, 0.0111083984375, -0.0181884...

[ 91, 25, 54529, 1632, 27559, 18, 48708, 20051, 3642, 2046, 71013, 2831, 11341, 1810, 111, 831, 33022, 98, 49119, 98893, 73342, 11675, 83, 134598, 47, 54, 4527, 32354, 67967, 12638, 110, 112, 53201, 158661, 14012, 71924, 152526, 496, 3884, ...

[ 0.048980712890625, 0.1060791015625, 0.2294921875, 0.1385498046875, 0.14501953125, 0.0987548828125, 0.026763916015625, 0.032623291015625, 0.02252197265625, 0.051300048828125, 0.208984375, 0.0966796875, 0.16552734375, 0.087158203125, 0.0404052734375, 0.004302978515625, 0.1353759765625,...

embed

26964933_c0

26964933

haskell

0

Title: Folding over an ITree Problem title: Folding over an ITree Tags: haskell Problem: Folding over an ITree Given the following ITree , from Typeclassopedia : data ITree a = Leaf (Int -> a) | Node [ITree a] What's the proper signature for foldTree - fold over the entire tree? Here's my incorrect attempt that does no...

Folding over an ITree Folding over an ITree haskell Folding ITree Leaf Node Folding over an ITree Given the following ITree , from Typeclassopedia : data ITree a = Leaf (Int -> a) | Node [ITree a] What's the proper signature for foldTree - fold over the entire tree? Here's my incorrect attempt that does not compile: Ho...

[ -0.0026092529296875, -0.0042724609375, -0.0023345947265625, -0.0037841796875, -0.0037384033203125, 0.005096435546875, -0.0255126953125, -0.01556396484375, 0.0048828125, -0.0322265625, 0.0098876953125, -0.0322265625, -0.011474609375, 0.0086669921875, -0.01202392578125, -0.016357421875, ...

[ 30077, 6238, 645, 142, 107, 13, 1556, 142508, 636, 2407, 438, 112, 60457, 67413, 76994, 2053, 5959, 10, 18, 33079, 27798, 138256, 42822, 62731, 64194, 53201, 214552, 81887, 9969, 1340, 452, 201505, 5303, 1022, 7225, 70270, 17932, 103510, 14...

[ 0.2191162109375, 0.108642578125, 0.1756591796875, 0.0577392578125, 0.1983642578125, 0.1541748046875, 0.0970458984375, 0.192626953125, 0.06634521484375, 0.1744384765625, 0.115478515625, 0.1561279296875, 0.06134033203125, 0.0689697265625, 0.07562255859375, 0.103759765625, 0.00308227539...

embed

28888587_c0

28888587

haskell

0

Title: Can GHC warn about the uses of dangerous non-total functions? Problem title: Can GHC warn about the uses of dangerous non-total functions? Tags: ghc, crash, error-handling, haskell, compiler-warnings Problem: Can GHC warn about the uses of dangerous non-total functions? I have been writing quickly some code in H...

Can GHC warn about the uses of dangerous non-total functions? Can GHC warn about the uses of dangerous non-total functions? ghc crash error-handling haskell compiler-warnings Can GHC Can GHC warn about the uses of dangerous non-total functions? I have been writing quickly some code in Haskell, and used a dangerous non-...

[ 0.0022125244140625, 0.00537109375, 0.0135498046875, -0.00396728515625, -0.018798828125, 0.023681640625, -0.0074462890625, -0.004241943359375, -0.00775146484375, -0.033447265625, 0.0067138671875, -0.012451171875, 0.01239013671875, 0.00994873046875, 0.0233154296875, -0.000919342041015625...

[ 4171, 527, 73265, 1631, 19, 4527, 111, 169907, 351, 188, 1803, 32354, 7, 31380, 238, 150631, 18499, 54885, 1556, 142508, 9969, 34759, 4205, 1672, 32562, 69405, 18151, 20625, 11814, 1295, 127794, 136913, 41206, 34292, 107730, 20623, 4358, 3135...

[ 0.0723876953125, 0.1251220703125, 0.2431640625, 0.1358642578125, 0.061004638671875, 0.142333984375, 0.03619384765625, 0.2086181640625, 0.1795654296875, 0.1202392578125, 0.160888671875, 0.203125, 0.0227813720703125, 0.1094970703125, 0.117919921875, 0.161865234375, 0.12548828125, 0.1...

embed

20967408_c0

20967408

haskell

0

Title: Cabal - how to install specific version of package Problem title: Cabal - how to install specific version of package Tags: cabal, haskell Problem: Cabal - how to install specific version of package I need for example a minor version of a package, for example persistent-postgresql .. or hdbc-mysql or whatever. If...

Cabal - how to install specific version of package Cabal - how to install specific version of package cabal haskell Cabal Cabal - how to install specific version of package I need for example a minor version of a package, for example persistent-postgresql .. or hdbc-mysql or whatever. If I run it will install persisten...

[ 0.015625, 0.005950927734375, 0.021484375, 0.0028076171875, -0.000514984130859375, 0.006591796875, -0.0036163330078125, -0.0106201171875, -0.005584716796875, 0.041015625, 0.0091552734375, -0.0537109375, 0.005401611328125, 0.00408935546875, -0.006744384765625, 0.0028076171875, 0.004699...

[ 30438, 289, 3642, 47, 20600, 29458, 11389, 111, 98169, 109524, 1556, 142508, 3871, 43967, 70560, 2517, 4594, 17562, 99247, 26488, 65037, 74277, 89778, 11675, 41491, 18499, 19713, 25632, 42548, 117538, 132283, 977, 1369, 34635, 1230, 4426, 1884,...

[ 0.1796875, 0.1763916015625, 0.09698486328125, 0.05401611328125, 0.2113037109375, 0.2086181640625, 0.2181396484375, 0.04541015625, 0.2230224609375, 0.25634765625, 0.1173095703125, 0.2095947265625, 0.0672607421875, 0.082763671875, 0.140869140625, 0.0916748046875, 0.0965576171875, 0.1...

embed

43778866_c1

43778866

haskell

1

" = return $ Backend BackendB test :: String -> IO () test name = createBackend name >>= \case Backend imp -> withConn imp 10 100 func If i do not wrap the IBackend returned by createBackend in data Backend , the createBackend function won't compile. But now i have to use a case statement in test function to unbox IBac...

[ 0.00032806396484375, 0.01104736328125, -0.004547119140625, 0.0167236328125, 0.00787353515625, -0.003692626953125, 0.00469970703125, -0.02392578125, 0.021728515625, -0.01348876953125, 0.011962890625, -0.0072021484375, -0.0034637451171875, -0.0240478515625, 0.00286865234375, -0.001518249...

[ 44, 2203, 30646, 3650, 26828, 3611, 571, 3034, 23351, 17780, 9351, 28282, 152470, 58437, 21980, 678, 11935, 19, 209, 805, 7477, 959, 137565, 87, 176377, 23, 2053, 32354, 23742, 18, 9969, 1340, 7225, 63805, 51, 11728, 1295, 10176, 1452, 12...

[ 0.0269317626953125, 0.035888671875, 0.12939453125, 0.09112548828125, 0.1805419921875, 0.1951904296875, 0.1539306640625, 0.20947265625, 0.1182861328125, 0.16943359375, 0.044219970703125, 0.1646728515625, 0.1942138671875, 0.1436767578125, 0.119873046875, 0.110595703125, 0.0753173828125...

embed

48131758_c0

48131758

haskell

0

Title: Haskell: how to get the common words Problem title: Haskell: how to get the common words Tags: haskell Problem: Haskell: how to get the common words I am trying to do drop common words function, but I do not know how to get or find the common word list. Do I need to create a common words list? Thank you The ques...

Haskell: how to get the common words Haskell: how to get the common words haskell Haskell Takes English Returns Haskell: how to get the common words I am trying to do drop common words function, but I do not know how to get or find the common word list. Do I need to create a common words list? Thank you The question : ...

[ -0.010009765625, -0.008056640625, -0.020263671875, -0.01312255859375, 0.00015354156494140625, 0.012451171875, 0.0159912109375, -0.0196533203125, 0.00177001953125, -0.01336669921875, 0.0133056640625, -0.00093841552734375, 0.0220947265625, -0.01129150390625, -0.0162353515625, -0.00268554...

[ 20625, 142508, 3642, 47, 2046, 70, 39210, 34153, 1556, 2561, 90, 14941, 173340, 31577, 36069, 32354, 959, 3714, 7413, 2565, 5303, 3871, 28282, 9655, 16750, 1884, 3688, 759, 63049, 7, 18151 ]

[ 0.107666015625, 0.2303466796875, 0.041259765625, 0.0572509765625, 0.12890625, 0.0693359375, 0.18212890625, 0.2208251953125, 0.1146240234375, 0.08203125, 0.055633544921875, 0.1116943359375, 0.148681640625, 0.007904052734375, 0.1837158203125, 0.105224609375, 0.001922607421875, 0.0254...

embed

48884276_c0

48884276

haskell

0

Title: Why doesn't this function work if I use "[xs]" instead of "xs"? Problem title: Why doesn't this function work if I use "[xs]" instead of "xs"? Tags: haskell Problem: Why doesn't this function work if I use "[xs]" instead of "xs"? split :: [a] -> Int -> ([a], [a])...

Why doesn't this function work if I use "[xs]" instead of "xs"? Why doesn't this function work if I use "[xs]" instead of "xs"? haskell Why Why doesn't this function work if I use "[xs]" instead of "xs"? The same code works if I give the variable as xs instead of [xs] ,...

[ -0.0211181640625, 0.01190185546875, -0.00653076171875, -0.0224609375, -0.015869140625, 0.0054931640625, 0.007110595703125, -0.01202392578125, 0.0213623046875, -0.0072021484375, 0.0224609375, 0.000293731689453125, 0.0022125244140625, 0.0020294189453125, -0.006317138671875, 0.01348876953...

[ 44084, 22027, 3768, 18, 903, 32354, 4488, 2174, 4527, 41502, 1065, 425, 7, 64457, 1556, 142508, 268, 581, 5701, 18151, 43240, 8337, 77336, 237, 1022, 378, 138256, 15044, 345, 18499, 103510, 83, 351, 3355, 18391, 4935, 28219, 107730, 26038, ...

[ 0.0858154296875, 0.1136474609375, 0.077880859375, 0.12109375, 0.0950927734375, 0.1964111328125, 0.1446533203125, 0.049224853515625, 0.09149169921875, 0.06036376953125, 0.069091796875, 0.194091796875, 0.170166015625, 0.173583984375, 0.1292724609375, 0.2003173828125, 0.045074462890625,...

embed

15558577_c0

15558577

haskell

0

Title: finding the position of an element from a list of list Problem title: finding the position of an element from a list of list Tags: list, haskell Problem: finding the position of an element from a list of list I want to find the position of an element from a list of list. FOr example , in a given list [[1,2,3],[4...

finding the position of an element from a list of list finding the position of an element from a list of list list haskell a finding the position of an element from a list of list I want to find the position of an element from a list of list. FOr example , in a given list [[1,2,3],[4,5,6],[7,8,9]] I want to find the po...

[ 0.0072021484375, 0.0177001953125, 0.0006561279296875, 0.0011138916015625, -0.0262451171875, 0.0181884765625, -0.00092315673828125, 0.0021209716796875, -0.00518798828125, -0.007476806640625, 0.0218505859375, -0.01806640625, 0.005401611328125, -0.000621795654296875, -0.0306396484375, 0.0...

[ 90791, 70, 19069, 111, 142, 12830, 1295, 10, 5303, 1556, 142508, 87, 3444, 47, 7413, 27781, 23, 34475, 133063, 96386, 617, 104629, 966, 145180, 3217, 32354, 5608, 30646, 363, 90173, 50960, 15555, 136, 17932, 3365, 316, 185723, 442, 831, 9...

[ 0.1363525390625, 0.0670166015625, 0.2344970703125, 0.1370849609375, 0.0179595947265625, 0.227783203125, 0.1737060546875, 0.03460693359375, 0.213134765625, 0.145263671875, 0.2362060546875, 0.033660888671875, 0.087158203125, 0.04669189453125, 0.15234375, 0.08447265625, 0.0018310546875,...

embed

44174573_c0

44174573

haskell

0

Title: Changing Global Cabal Flags from the Command Line with Stack Problem title: Changing Global Cabal Flags from the Command Line with Stack Tags: cabal, haskell-stack, haskell Problem: Changing Global Cabal Flags from the Command Line with Stack From a project's cabal file: flag buildAll Description: Build all prog...

Changing Global Cabal Flags from the Command Line with Stack Changing Global Cabal Flags from the Command Line with Stack cabal haskell-stack haskell the Changing Global Cabal Flags Command Line Stack Description Build Default Changing Global Cabal Flags from the Command Line with Stack From a project's cabal file: I w...

[ 0.004669189453125, -0.00017261505126953125, -0.004364013671875, 0.006378173828125, 0.00823974609375, -0.019775390625, -0.019775390625, 0.013427734375, -0.006988525390625, 0.034912109375, 0.01055908203125, -0.0107421875, 0.003204345703125, 0.01263427734375, -0.00799560546875, 0.01269531...

[ 108193, 13453, 30438, 289, 125726, 7, 1295, 123573, 16777, 678, 6512, 2594, 109524, 1556, 142508, 590, 214, 70643, 121137, 262, 1021, 13452, 11435, 36663, 5423, 903, 29568, 177261, 45367, 46480, 1010, 22819, 80280, 4210, 190872, 43512, 4488, ...

[ 0.2144775390625, 0.1754150390625, 0.197998046875, 0.1514892578125, 0.25537109375, 0.09326171875, 0.053955078125, 0.20263671875, 0.1650390625, 0.0440673828125, 0.1593017578125, 0.126708984375, 0.2236328125, 0.088623046875, 0.1697998046875, 0.1199951171875, 0.021514892578125, 0.13256...

embed

832569_c0

832569

haskell

0

Title: List of Functional code snippets for Procedural Programmers? Problem title: List of Functional code snippets for Procedural Programmers? Tags: ocaml, haskell, code-snippets, functional-programming, f%23 Problem: List of Functional code snippets for Procedural Programmers? Sometimes I still get stuck trying to tr...

List of Functional code snippets for Procedural Programmers? List of Functional code snippets for Procedural Programmers? ocaml haskell code-snippets functional-programming f%23 List Functional Procedural Programmers List of Functional code snippets for Procedural Programmers? Sometimes I still get stuck trying to tran...

[ 0.02734375, -0.0015411376953125, 0.002471923828125, -0.0177001953125, 0.000186920166015625, 0.013427734375, -0.0130615234375, -0.0064697265625, -0.0040283203125, -0.022705078125, 0.00179290771484375, 0.00009059906005859375, -0.01806640625, 0.004364013671875, 0.013427734375, -0.00034332...

[ 32036, 111, 28670, 10763, 289, 18151, 91, 93, 58134, 7, 100, 170470, 27958, 1314, 36, 9779, 141, 1556, 142508, 123309, 28966, 1238, 3949, 3742, 160193, 7464, 179933, 31577, 3900, 19309, 59158, 3934, 5303, 13373, 28016, 291, 48398, 47, 9879,...

[ 0.0960693359375, 0.0207672119140625, 0.146728515625, 0.10693359375, 0.144775390625, 0.177734375, 0.0162506103515625, 0.1285400390625, 0.16162109375, 0.036224365234375, 0.060943603515625, 0.2154541015625, 0.166015625, 0.10595703125, 0.0521240234375, 0.0828857421875, 0.0950927734375, ...

embed