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
7681390_c1	7681390	haskell	1	was under the impression that I understood the preceding discussion and code until this point, but apparently I was mistaken. If someone could point out what's going awry - do I need a MonadPlus (ST a) instance or not? - it would be very helpful. [EDIT: Clarification] I should have pointed out that the authors appear ...	was under the impression that I understood the preceding discussion and code until this point, but apparently I was mistaken. If someone could point out what's going awry - do I need a MonadPlus (ST a) instance or not? - it would be very helpful. [EDIT: Clarification] I should have pointed out that the authors appear ...	[ -0.006103515625, 0.01055908203125, 0.017333984375, -0.0029754638671875, 0.01165771484375, -0.01385498046875, 0.0145263671875, -0.0218505859375, 0.01190185546875, -0.0185546875, 0.003936767578125, -0.005218505859375, -0.002197265625, -0.0002002716064453125, 0.0279541015625, 0.0028991699...	[ 49128, 217064, 35107, 18151, 198371, 121742, 5809, 6275, 1810, 2367, 7730, 5429, 53, 3871, 10, 60331, 71, 88225, 8545, 110527, 98893, 320, 42179, 108975, 63043, 347, 80510, 143834, 83, 70, 95307, 32354, 3714, 149016, 134598, 3249, 17368, 2678...	[ 0.02197265625, 0.0794677734375, 0.033905029296875, 0.1195068359375, 0.02056884765625, 0.06951904296875, 0.000579833984375, 0.058624267578125, 0.01312255859375, 0.0032958984375, 0.07177734375, 0.0784912109375, 0.078857421875, 0.086181640625, 0.1776123046875, 0.1915283203125, 0.1479492...	embed
79363980_c0	79363980	haskell	0	Title: How to rearrange type parameter in Haskell instance definition? Problem title: How to rearrange type parameter in Haskell instance definition? Tags: haskell Problem: How to rearrange type parameter in Haskell instance definition? Suppose I have this type in Haskell data T a b = T a b This type T already fixed, a...	How to rearrange type parameter in Haskell instance definition? How to rearrange type parameter in Haskell instance definition? haskell How Haskell Functor How to rearrange type parameter in Haskell instance definition? Suppose I have this type in Haskell This type T already fixed, and can't be changed. No other Functo...	[ -0.0059814453125, -0.006103515625, 0.028564453125, 0.0152587890625, -0.0087890625, -0.0126953125, 0.0004425048828125, -0.01263427734375, 0.0037384033203125, 0.01544189453125, -0.001129150390625, -0.0181884765625, 0.006561279296875, 0.011962890625, -0.0130615234375, -0.02294921875, 0....	[ 11249, 456, 147, 94250, 10644, 171859, 20625, 142508, 110527, 80934, 47, 1556, 28670, 18770, 23, 121691, 765, 903, 384, 21771, 188347, 831, 18, 98816, 82424, 29479, 23468, 28282, 22288, 876, 35064, 3444, 7477, 208124, 15490, 3525, 50986, 7722...	[ 0.093017578125, 0.1436767578125, 0.152099609375, 0.2032470703125, 0.2452392578125, 0.2255859375, 0.150146484375, 0.22216796875, 0.210205078125, 0.157470703125, 0.0404052734375, 0.125732421875, 0.1346435546875, 0.1512451171875, 0.0087890625, 0.0399169921875, 0.01287841796875, 0.0365...	embed
8901252_c1	8901252	haskell	1	,11),22),((2,12),24),((3,0),0),((3,1),3),((3,2),6),((3,3),9),((3,4),12),((3,5),15),((3,6),18),((3,7),21),((3,8),24),((3,9),27),((3,10),30),((3,11),33),((3,12),36),((4,0),0),((4,1),4),((4,2),8),((4,3),12),((4,4),16),((4,5),20),((4,6),24),((4,7),28),((4,8),32),((4,9),36),((4,10),40),((4,11),44),((4,12),48),((5,0),0),((5,...	,11),22),((2,12),24),((3,0),0),((3,1),3),((3,2),6),((3,3),9),((3,4),12),((3,5),15),((3,6),18),((3,7),21),((3,8),24),((3,9),27),((3,10),30),((3,11),33),((3,12),36),((4,0),0),((4,1),4),((4,2),8),((4,3),12),((4,4),16),((4,5),20),((4,6),24),((4,7),28),((4,8),32),((4,9),36),((4,10),40),((4,11),44),((4,12),48),((5,0),0),((5,...	[ -0.0211181640625, -0.0017242431640625, -0.00408935546875, -0.0147705078125, 0.0203857421875, 0.0029449462890625, -0.0177001953125, 0.0130615234375, 0.01129150390625, 0.046630859375, 0.01470947265625, 0.0009918212890625, 0.00010204315185546875, -0.01422119140625, 0.01251220703125, 0.003...	[ 6, 4, 48105, 89647, 132, 54753, 55102, 82839, 128188, 247, 77495, 86827, 17727, 21320, 10461, 59690, 1126, 82449, 92714, 62155, 56641, 36076, 69072, 50490, 125157, 80847, 50258, 62946, 119959, 101807, 105801, 29557, 124093, 60978, 80389, 73419, ...	[ 0.1287841796875, 0.1363525390625, 0.25830078125, 0.269775390625, 0.105224609375, 0.1661376953125, 0.21484375, 0.2490234375, 0.281494140625, 0.136474609375, 0.2469482421875, 0.1888427734375, 0.1561279296875, 0.1929931640625, 0.144287109375, 0.20703125, 0.18994140625, 0.2235107421875...	embed
67689333_c1	67689333	haskell	1	now much more awkward to actually use: makeMonoidDefault' $ do tParam <- pure . VarT <$> newName "a" sgcxt <- [t\| Semigroup $tParam \|] maybet <- [t\| Maybe $tParam \|] return ([sgcxt], maybet) or makeMonoidDefault' $ do tParam <- pure . VarT <$> newName "a" ((,) . (:[])) <$> [t\| Semigroup $tParam \|] <*> [t\| Maybe $tPara...	now much more awkward to actually use: makeMonoidDefault' $ do tParam <- pure . VarT <$> newName "a" sgcxt <- [t\| Semigroup $tParam \|] maybet <- [t\| Maybe $tParam \|] return ([sgcxt], maybet) or makeMonoidDefault' $ do tParam <- pure . VarT <$> newName "a" ((,) . (:[])) <$> [t\| Semigroup $tParam \|] <*> [t\| Maybe $tPara...	[ -0.00799560546875, 0.00823974609375, -0.0027313232421875, 0.005279541015625, 0.00124359130859375, -0.004852294921875, -0.007568359375, -0.036376953125, 0.0247802734375, -0.038330078125, 0.0022430419921875, -0.015869140625, 0.018310546875, 0.00933837890625, -0.01251220703125, -0.0112304...	[ 5045, 1286, 434, 92, 19364, 20653, 4527, 3249, 46674, 48899, 187423, 11, 7136, 3650, 54, 808, 55292, 39, 34166, 3323, 618, 3525, 163612, 93170, 29062, 84420, 51588, 51139, 18, 83425, 30646, 3917, 33022, 903, 143726, 41816, 4935, 22321, 2223...	[ 0.0067138671875, 0.0171356201171875, 0.0181427001953125, 0.02655029296875, 0.05401611328125, 0.017791748046875, 0.06890869140625, 0.122314453125, 0.1331787109375, 0.2493896484375, 0.164794921875, 0.18310546875, 0.162353515625, 0.099853515625, 0.0207366943359375, 0.03314208984375, 0.1...	embed
61559102_c0	61559102	haskell	0	Title: What is the type keyword in Haskell Problem title: What is the type keyword in Haskell Tags: haskell Problem: What is the type keyword in Haskell Stumbled on the type keyword in Haskell: type Item = String but not sure what it does, how to use it or how it is different from data . The online google search has be...	What is the type keyword in Haskell What is the type keyword in Haskell haskell System.IO What Haskell Item Hello What is the type keyword in Haskell Stumbled on the type keyword in Haskell: but not sure what it does, how to use it or how it is different from data . The online google search has been of no help. I tried...	[ 0.0021820068359375, 0.01263427734375, 0.0126953125, 0.033935546875, 0.00518798828125, 0.017333984375, -0.00311279296875, 0.0191650390625, -0.01611328125, 0.0037078857421875, 0.003814697265625, -0.03515625, -0.013916015625, 0.01068115234375, -0.006195068359375, 0.0101318359375, 0.0130...	[ 4865, 70, 10644, 166117, 23, 20625, 142508, 83, 1556, 12353, 17780, 78426, 35378, 26085, 40099, 9077, 2367, 14602, 3642, 4527, 442, 12921, 1295, 2053, 1118, 26484, 33938, 4358, 29479, 18151, 18499, 332, 13579, 11814 ]	[ 0.060791015625, 0.055816650390625, 0.262939453125, 0.26171875, 0.0693359375, 0.1243896484375, 0.217529296875, 0.06610107421875, 0.1094970703125, 0.0765380859375, 0.1513671875, 0.134765625, 0.041656494140625, 0.0028076171875, 0.015380859375, 0.027252197265625, 0.053802490234375, 0.0...	embed
35473853_c0	35473853	haskell	0	Title: How to exit the "Main" status after Prelude(Haskell) loaded a module? Problem title: How to exit the "Main" status after Prelude(Haskell) loaded a module? Tags: haskell, load, program-entry-point, haskell-prelude Problem: How to exit the "Main" status after Prelude(Haskell) loaded a module? I...	How to exit the "Main" status after Prelude(Haskell) loaded a module? How to exit the "Main" status after Prelude(Haskell) loaded a module? haskell load program-entry-point haskell-prelude How Main Prelude Haskell How to exit the "Main" status after Prelude(Haskell) loaded a module? In Haskell, afte...	[ 0.0272216796875, 0.01123046875, 0.01055908203125, 0.03271484375, -0.0252685546875, 0.003753662109375, 0.01007080078125, -0.0115966796875, -0.01373291015625, -0.01953125, -0.01422119140625, -0.01531982421875, -0.00811767578125, -0.0107421875, 0.004150390625, -0.00799560546875, 0.00314...	[ 11249, 47, 82230, 168793, 10778, 7103, 1914, 822, 112, 6495, 7, 142508, 72367, 297, 88996, 1556, 1528, 33, 15123, 38496, 4692, 12321, 20625, 70, 17368, 102158, 105876, 186, 306, 90, 3714, 32354, 1380, 1295, 61924, 5361, 75101, 13315, 65998,...	[ 0.07623291015625, 0.08154296875, 0.2298583984375, 0.21533203125, 0.17626953125, 0.1356201171875, 0.1297607421875, 0.2161865234375, 0.1761474609375, 0.0908203125, 0.06689453125, 0.248046875, 0.1722412109375, 0.08251953125, 0.170166015625, 0.095458984375, 0.0570068359375, 0.016677856...	embed
45458087_c0	45458087	haskell	0	Title: Confuse about pure in applicative functor Problem title: Confuse about pure in applicative functor Tags: haskell Problem: Confuse about pure in applicative functor I have following example with pure function: Prelude> :t pure ((+1) 1) pure ((+1) 1) :: (Num a, Applicative f) => f a What is above the concrete type...	Confuse about pure in applicative functor Confuse about pure in applicative functor haskell Confuse Prelude Num Applicative Maybe Just Confuse about pure in applicative functor I have following example with pure function: What is above the concrete type of f wrapped a ? For example, the f (structure) is here Maybe: and...	[ 0.0162353515625, 0.00714111328125, 0.0072021484375, 0.0140380859375, 0.0120849609375, 0.0194091796875, 0.01483154296875, -0.00628662109375, -0.001495361328125, 0.00006866455078125, 0.004852294921875, -0.0283203125, -0.01446533203125, 0.022705078125, 0.01043701171875, 0.0000863075256347...	[ 106161, 4032, 1672, 34166, 23, 41816, 4935, 7477, 18770, 1556, 142508, 1914, 822, 52782, 5659, 11048, 83425, 25632, 27781, 32354, 36917, 122776, 10644, 1238, 137565, 20051, 10, 137656, 83, 3688, 45646, 111, 44084, 527, 73265, 14, 7639, 186351...	[ 0.14599609375, 0.1080322265625, 0.031829833984375, 0.2666015625, 0.06365966796875, 0.172119140625, 0.1051025390625, 0.111083984375, 0.121826171875, 0.1273193359375, 0.212158203125, 0.052978515625, 0.1251220703125, 0.144775390625, 0.1053466796875, 0.1092529296875, 0.08819580078125, ...	embed
46042545_c0	46042545	haskell	0	Title: Learning Haskell syntax Problem title: Learning Haskell syntax Tags: haskell, syntax Problem: Learning Haskell syntax I learn Haskell, but got stuck on one thing: add 0 = id add x = add(x-1) . (+1) This function adds one argument to another by adding 1 to the first argument and subtracting 1 from the second argu...	Learning Haskell syntax Learning Haskell syntax haskell syntax Learning Haskell x-1 Main Learning Haskell syntax I learn Haskell, but got stuck on one thing: This function adds one argument to another by adding 1 to the first argument and subtracting 1 from the second argument. But, I do not really understand how does ...	[ -0.001800537109375, 0.0225830078125, -0.0024566650390625, 0.016357421875, 0.00592041015625, 0.0252685546875, 0.009033203125, -0.01519775390625, 0.004791259765625, -0.03759765625, 0.007720947265625, -0.0194091796875, -0.0208740234375, 0.00933837890625, 0.010498046875, -0.0205078125, 0...	[ 114344, 20625, 142508, 6002, 86531, 1556, 1022, 5759, 12321, 30698, 179933, 3293, 32354, 15190, 7, 1632, 10750, 15700, 154107, 106, 5117, 1614, 39989, 17932, 959, 28219, 3642, 14602, 442, 4488, 73342, 92559, 33022, 116, 101935, 7103, 11, 4028...	[ 0.1400146484375, 0.13916015625, 0.230712890625, 0.11376953125, 0.126953125, 0.1151123046875, 0.08349609375, 0.166015625, 0.06341552734375, 0.0673828125, 0.096435546875, 0.03900146484375, 0.1693115234375, 0.1700439453125, 0.001373291015625, 0.06915283203125, 0.235107421875, 0.141723...	embed
5876095_c0	5876095	haskell	0	Title: Removing additional quotes from strings in Haskell Problem title: Removing additional quotes from strings in Haskell Tags: haskell, io, file, string, list Problem: Removing additional quotes from strings in Haskell hey on my file i have a line like this "Dave", "Zoe", "Amy", "Bill", "Ian", "Kevin", "Emma", "Sam"...	Removing additional quotes from strings in Haskell Removing additional quotes from strings in Haskell haskell io file string list strings Removing Haskell Dave Zoe Amy Bill Ian Kevin Emma Sam Megan Removing additional quotes from strings in Haskell hey on my file i have a line like this when handling it and hgetline to...	[ 0.0037841796875, 0.01507568359375, -0.00958251953125, 0.018310546875, -0.003265380859375, 0.00946044921875, 0.0028076171875, 0.00543212890625, 0.00011539459228515625, 0.0089111328125, -0.036376953125, -0.04150390625, -0.00811767578125, 0.0125732421875, -0.0111083984375, 0.017333984375,...	[ 853, 432, 78301, 66747, 7, 1295, 79315, 20625, 142508, 23, 1556, 22995, 11435, 5303, 103383, 5880, 117277, 19893, 104870, 57501, 51627, 3362, 26842, 19, 28192, 13315, 1884, 903, 45064, 1096, 3794, 2256, 15549, 47, 113660, 738, 171259, 45767, ...	[ 0.001617431640625, 0.1361083984375, 0.157958984375, 0.2548828125, 0.024566650390625, 0.079345703125, 0.2265625, 0.145263671875, 0.2440185546875, 0.005889892578125, 0.1280517578125, 0.1688232421875, 0.1279296875, 0.0943603515625, 0.1422119140625, 0.07366943359375, 0.09033203125, 0.0...	embed
59455253_c0	59455253	haskell	0	Title: How do I prove type-level list properties in haskell? Problem title: How do I prove type-level list properties in haskell? Tags: haskell, proof, types, type-level-computation Problem: How do I prove type-level list properties in haskell? I have these type families: type family xs ++ ys where '[] ++ ys = ys (x : ...	How do I prove type-level list properties in haskell? How do I prove type-level list properties in haskell? haskell proof types type-level-computation How Drop Length How do I prove type-level list properties in haskell? I have these type families: At some point, GHC wants a proof that I've used to shove that into cont...	[ 0.01708984375, 0.002410888671875, -0.004547119140625, 0.005523681640625, -0.0091552734375, -0.0155029296875, 0.002777099609375, -0.01031494140625, 0.0203857421875, 0.002227783203125, -0.01513671875, -0.01361083984375, 0.00787353515625, 0.006317138671875, -0.00677490234375, 0.0256347656...	[ 11249, 23534, 10644, 67919, 5303, 183871, 1556, 142508, 54, 87, 23, 98869, 52895, 7077, 130403, 77554, 927, 6097, 87143, 527, 73265, 86171, 272, 11814, 15756, 43701, 64549, 748, 57266, 32813 ]	[ 0.0684814453125, 0.2149658203125, 0.2061767578125, 0.219482421875, 0.175537109375, 0.1943359375, 0.130615234375, 0.2177734375, 0.044891357421875, 0.037933349609375, 0.0172882080078125, 0.164794921875, 0.182861328125, 0.017303466796875, 0.178466796875, 0.10626220703125, 0.039276123046...	embed
6274959_c2	6274959	haskell	2	, Temp, cairo-0.12.0808, cairo-0.12.0, Gtk2HsSetup.hs:2, Setup.hs, Cabal, DCABAL_VERSION_MINOR, x.0, Compiling, Gtk2HsSetup, cairo-0, Gtk2HsSetup.hs, Gtk2HsSetup.o, Main, cairo-0.12.08, Main.o, Linking, setup.exe, Configuring, Preprocessing, Building, Graphics.Rendering.Cairo.Matrix, Graphics, Rende, Cairo, Matrix.hs, ...	, Temp, cairo-0.12.0808, cairo-0.12.0, Gtk2HsSetup.hs:2, Setup.hs, Cabal, DCABAL_VERSION_MINOR, x.0, Compiling, Gtk2HsSetup, cairo-0, Gtk2HsSetup.hs, Gtk2HsSetup.o, Main, cairo-0.12.08, Main.o, Linking, setup.exe, Configuring, Preprocessing, Building, Graphics.Rendering.Cairo.Matrix, Graphics, Rende, Cairo, Matrix.hs, ...	[ 0.005401611328125, 0.01007080078125, 0.0106201171875, -0.005615234375, 0.00750732421875, 0.007598876953125, -0.0159912109375, -0.00836181640625, -0.00153350830078125, 0.03857421875, -0.01226806640625, -0.021728515625, 0.0014495849609375, -0.007537841796875, -0.002227783203125, 0.029907...	[ 6, 4, 37446, 78968, 31, 9, 102014, 73011, 163736, 527, 31472, 304, 841, 7, 294, 126, 2037, 5, 127, 12, 19943, 30438, 289, 391, 13133, 94943, 33255, 118596, 84139, 24638, 1022, 2389, 15612, 49725, 23320, 12321, 15654, 8318, 12779, 214, 1...	[ 0.0858154296875, 0.09649658203125, 0.1971435546875, 0.2264404296875, 0.24658203125, 0.068115234375, 0.110107421875, 0.173828125, 0.191650390625, 0.013824462890625, 0.146728515625, 0.0965576171875, 0.09320068359375, 0.051910400390625, 0.008026123046875, 0.0960693359375, 0.109741210937...	embed
11551945_c1	11551945	haskell	1	Handler :: ResourceT IO Response notFoundHandler = return $ responseLBS status404 [("Content-Type", "text/plain")] "Not found" main :: IO () main = do BS.putStrLn $ "http://localhost:8080/" run 8080 $ app [Update: a working copy of this code is here: https://gist.github.com/3145317 ] Code signals: Network.Wai, Network....	Handler :: ResourceT IO Response notFoundHandler = return $ responseLBS status404 [("Content-Type", "text/plain")] "Not found" main :: IO () main = do BS.putStrLn $ "http://localhost:8080/" run 8080 $ app [Update: a working copy of this code is here: https://gist.github.com/3145317 ] Code signals: Network.Wai, Network....	[ -0.01422119140625, 0.020263671875, 0.01251220703125, -0.00836181640625, -0.00750732421875, -0.002685546875, 0.015869140625, -0.0224609375, 0.008544921875, -0.033203125, 0.0034027099609375, -0.00168609619140625, 0.00421142578125, -0.00147247314453125, 0.0213623046875, 0.00933837890625, ...	[ 10639, 603, 1984, 152055, 618, 17780, 92748, 959, 27591, 7030, 135679, 2203, 30646, 3650, 57553, 48097, 294, 10778, 2839, 617, 11935, 25352, 196707, 22829, 64, 7290, 122116, 14037, 5201, 54, 84145, 5, 7077, 71713, 866, 19, 5475, 98908, 4029...	[ 0.2457275390625, 0.251953125, 0.03619384765625, 0.260986328125, 0.2103271484375, 0.231689453125, 0.250732421875, 0.1864013671875, 0.182861328125, 0.162109375, 0.2471923828125, 0.0241851806640625, 0.14306640625, 0.113525390625, 0.20361328125, 0.09130859375, 0.0908203125, 0.174926757...	embed
40962891_c0	40962891	haskell	0	Title: Haskell - efficient equivalent for hash-based dictionary Problem title: Haskell - efficient equivalent for hash-based dictionary Tags: haskell, hashmap, dictionary Problem: Haskell - efficient equivalent for hash-based dictionary I would like to construct a couple of "dictionaries" in Haskell as part of a projec...	Haskell - efficient equivalent for hash-based dictionary Haskell - efficient equivalent for hash-based dictionary haskell hashmap dictionary Haskell Haskell - efficient equivalent for hash-based dictionary I would like to construct a couple of "dictionaries" in Haskell as part of a project I am working on. I was wonder...	[ -0.0036773681640625, 0.00408935546875, -0.00007343292236328125, 0.0019378662109375, 0.006683349609375, -0.004150390625, 0.005615234375, -0.0115966796875, -0.0096435546875, -0.0238037109375, 0.006805419921875, -0.0098876953125, 0.0062255859375, 0.00567626953125, 0.005401611328125, 0.011...	[ 20625, 142508, 93766, 183234, 1556, 127, 77007, 45, 10763, 256, 80425, 254, 6635, 2806, 1884, 64549, 24941, 61669, 32789, 10484, 23, 2831, 13452, 20697, 87, 149016, 2053, 45646, 4552, 24, 5844, 51515, 4527, 5303, 370, 99726, 92610, 32233, 2...	[ 0.157470703125, 0.266845703125, 0.2198486328125, 0.1739501953125, 0.169189453125, 0.1175537109375, 0.1324462890625, 0.08612060546875, 0.16552734375, 0.1259765625, 0.100830078125, 0.135009765625, 0.034149169921875, 0.0230560302734375, 0.0869140625, 0.1240234375, 0.0859375, 0.1262207...	embed
19249752_c0	19249752	haskell	0	Title: Haskell: Lazy download with Curl Problem title: Haskell: Lazy download with Curl Tags: curl, haskell, lazy-evaluation Problem: Haskell: Lazy download with Curl How to use laziness with this package or perhaps some other package and how to fix this code, so it won't download the whole file but just some first byt...	Haskell: Lazy download with Curl Haskell: Lazy download with Curl curl haskell lazy-evaluation qualified Network.Curl.Download.Lazy Haskell Lazy Curl Data.ByteString.Lazy Right www.haskell.org ghc-7.6.3-x86_64-unknown-linux.tar.bz2 B.take Haskell: Lazy download with Curl How to use laziness with this package or perhaps...	[ -0.01153564453125, 0.017578125, 0.0162353515625, 0.00799560546875, 0.01483154296875, -0.00323486328125, -0.0034942626953125, 0.0012054443359375, 0.0186767578125, -0.0267333984375, -0.0019073486328125, -0.0296630859375, -0.0014801025390625, 0.0203857421875, 0.00958251953125, -0.00698852...	[ 20625, 142508, 12, 239, 3285, 7026, 678, 17065, 141, 9709, 1556, 21, 159258, 217225, 28997, 25002, 144786, 2729, 11809, 75358, 67, 71713, 90911, 10557, 1478, 31380, 238, 16709, 200768, 15276, 13307, 309, 69723, 2397, 6077, 867, 169, 335, 78...	[ 0.1527099609375, 0.26611328125, 0.039642333984375, 0.1885986328125, 0.24072265625, 0.2021484375, 0.0960693359375, 0.1600341796875, 0.1722412109375, 0.12939453125, 0.120361328125, 0.1768798828125, 0.1617431640625, 0.159912109375, 0.0947265625, 0.171142578125, 0.149658203125, 0.16845...	embed
46397583_c0	46397583	haskell	0	Title: Haskell pattern matching on a function result Problem title: Haskell pattern matching on a function result Tags: haskell Problem: Haskell pattern matching on a function result I have an algebraic data type like: data Toll = Vok Int Bool \| Bok Int \| Cokd String Char and another function getVal :: Int -> Toll getV...	Haskell pattern matching on a function result Haskell pattern matching on a function result haskell Haskell Toll Vok Bool Bok Cokd Char Haskell pattern matching on a function result I have an algebraic data type like: and another function I want to call getVal in some function and extract the arguments of Cokd (if the ...	[ 0.00130462646484375, 0.001220703125, 0.0262451171875, 0.0024566650390625, 0.024658203125, -0.00921630859375, -0.01953125, 0.004669189453125, -0.002716064453125, -0.01312255859375, 0.0089111328125, -0.0279541015625, -0.0228271484375, -0.00469970703125, 0.0078125, -0.008544921875, 0.01...	[ 20625, 142508, 103510, 14858, 214, 98, 32354, 16750, 1556, 156105, 310, 685, 2460, 929, 27794, 1311, 92, 71, 21656, 429, 2844, 1771, 2053, 10644, 3444, 11782, 2046, 42272, 125663, 10750, 35166, 831, 1884, 53418, 4527, 2667, 712, 7 ]	[ 0.1328125, 0.2412109375, 0.2200927734375, 0.1953125, 0.080810546875, 0.073974609375, 0.1485595703125, 0.1580810546875, 0.1231689453125, 0.198486328125, 0.11669921875, 0.1412353515625, 0.0445556640625, 0.1180419921875, 0.1387939453125, 0.10302734375, 0.1103515625, 0.166015625, 0.1...	embed
49103372_c0	49103372	haskell	0	Title: Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] Problem title: Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] Tags: functor, functional-programming, haskell Problem: Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] I understan...	Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] functor functional-programming haskell Confused Just Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] I understand that the parens force a...	[ 0.0101318359375, 0.01190185546875, -0.005859375, 0.0135498046875, -0.0024871826171875, 0.0169677734375, 0.021484375, 0.01043701171875, -0.00005412101745605469, -0.0322265625, -0.007476806640625, -0.00811767578125, -0.0096435546875, 0.023193359375, 0.0169677734375, -0.0184326171875, 0...	[ 106161, 33740, 1672, 420, 62346, 140909, 9563, 68252, 418, 76172, 20209, 1238, 3650, 7477, 18770, 123309, 28966, 1556, 142508, 4, 28219, 366, 1755, 37772, 12921, 12989, 111, 41018, 18, 32233, 5117, 16750, 25632, 15787, 10422, 177691, 32354, 6...	[ 0.1201171875, 0.070556640625, 0.002777099609375, 0.1182861328125, 0.2205810546875, 0.211669921875, 0.28515625, 0.058441162109375, 0.05859375, 0.09930419921875, 0.1318359375, 0.12939453125, 0.010772705078125, 0.0777587890625, 0.0858154296875, 0.112548828125, 0.085205078125, 0.134399...	embed
9931410_c0	9931410	haskell	0	Title: Haskell: which SOAP client lib to use? Problem title: Haskell: which SOAP client lib to use? Tags: soap, haskell Problem: Haskell: which SOAP client lib to use? I'd like to write s simple Haskell program that connects to a SOAP service. Ideally I'd like to use the service's WSDL and get as straightforward access...	Haskell: which SOAP client lib to use? Haskell: which SOAP client lib to use? soap haskell Haskell SOAP Haskell: which SOAP client lib to use? I'd like to write s simple Haskell program that connects to a SOAP service. Ideally I'd like to use the service's WSDL and get as straightforward access to the request parameter...	[ 0.00079345703125, 0.01470947265625, 0.0205078125, 0.02001953125, 0.0133056640625, -0.004791259765625, -0.0264892578125, 0.0086669921875, -0.000362396240234375, 0.00836181640625, -0.000125885009765625, -0.01708984375, 0.00567626953125, -0.00823974609375, -0.0019683837890625, -0.02429199...	[ 20625, 142508, 3129, 15969, 15383, 23282, 25474, 47, 4527, 12, 221, 2631, 1556, 1884, 33022, 8781, 1528, 37067, 4516, 41143, 52143, 27502, 80560, 17203, 50336, 171859, 57553, 2053, 35773, 4734, 14037, 11666, 81699, 118066, 168698, 65942, 7108, ...	[ 0.13623046875, 0.2169189453125, 0.058807373046875, 0.17578125, 0.243408203125, 0.225341796875, 0.2283935546875, 0.038360595703125, 0.136474609375, 0.0086669921875, 0.1680908203125, 0.2105712890625, 0.104736328125, 0.05621337890625, 0.06903076171875, 0.0936279296875, 0.119384765625, ...	embed
25491037_c0	25491037	haskell	0	Title: Prelude.read: no parse for derived instance of Read Problem title: Prelude.read: no parse for derived instance of Read Tags: haskell Problem: Prelude.read: no parse for derived instance of Read I receive the error *** Exception: Prelude.read: no parse when I run read $ show $ Vector3 1 2 3 (Note that show Vector...	Prelude.read: no parse for derived instance of Read Prelude.read: no parse for derived instance of Read haskell Prelude.read Read Exception Vector3 v3x v3y v3z LANGUAGE StandaloneDeriving Prelude.read: no parse for derived instance of Read I receive the error when I run (Note that show Vector3 1 2 3 returns "Vector3 {v...	[ -0.00830078125, 0.0159912109375, -0.0022735595703125, 0.0111083984375, 0.018798828125, 0.0250244140625, 0.0194091796875, -0.0245361328125, -0.00038909912109375, -0.02490234375, 0.00457763671875, -0.01953125, -0.001373291015625, -0.0146484375, -0.013916015625, -0.028076171875, -0.0206...	[ 1914, 822, 112, 39116, 110, 366, 184, 100, 16406, 4126, 110527, 4764, 1556, 142508, 5443, 63928, 2609, 18770, 363, 81, 425, 53, 169, 98064, 32487, 51684, 47731, 14, 6496, 53299, 18499, 11675, 7639, 116, 138, 30646, 26455, 334, 53855, 1665...	[ 0.08953857421875, 0.171875, 0.1324462890625, 0.2568359375, 0.1119384765625, 0.205810546875, 0.1812744140625, 0.0634765625, 0.1575927734375, 0.110107421875, 0.2049560546875, 0.281982421875, 0.0843505859375, 0.1788330078125, 0.0130615234375, 0.0950927734375, 0.1767578125, 0.185302734...	embed
29127410_c0	29127410	haskell	0	Title: Test a function with different list of value with quickCheck Problem title: Test a function with different list of value with quickCheck Tags: quickcheck, haskell Problem: Test a function with different list of value with quickCheck I need to test a function with quickCheck with different range of values. my fun...	Test a function with different list of value with quickCheck Test a function with different list of value with quickCheck quickcheck haskell Test prop_test Test a function with different list of value with quickCheck I need to test a function with quickCheck with different range of values. my function is : and I would ...	[ -0.0103759765625, -0.0115966796875, 0.0081787109375, -0.01171875, -0.00141143798828125, -0.004852294921875, -0.003204345703125, -0.0137939453125, 0.0269775390625, 0.01031494140625, 0.0125732421875, 0.0206298828125, 0.0189208984375, -0.006500244140625, 0.003448486328125, 0.01318359375, ...	[ 8647, 32354, 678, 12921, 5303, 34292, 63773, 202567, 10, 111, 78292, 1556, 142508, 25793, 6954, 3871, 3034, 37457, 142424, 2806, 1884, 51339, 109921, 1022, 53, 169, 96759, 39958, 757, 47, 4382, 17, 170, 92, 209, 28568, 22483, 334, 188347, ...	[ 0.225341796875, 0.2293701171875, 0.0718994140625, 0.2022705078125, 0.1741943359375, 0.170166015625, 0.1572265625, 0.29345703125, 0.00848388671875, 0.04541015625, 0.235595703125, 0.098388671875, 0.1966552734375, 0.2005615234375, 0.2261962890625, 0.06243896484375, 0.2154541015625, 0....	embed
29423483_c0	29423483	haskell	0	Title: List lazy evaluation in Haskell Problem title: List lazy evaluation in Haskell Tags: haskell, lazy-evaluation Problem: List lazy evaluation in Haskell I made simple assumptions below to understand list lazy evaluation in Haskell, head [1, 2] -- expr1 head [1 .. 2] -- expr2 head [1 ..] -- expr3 head . (1 :) $ [] ...	List lazy evaluation in Haskell List lazy evaluation in Haskell haskell lazy-evaluation List Haskell expr1 expr2 expr3 eval1 eval2 List lazy evaluation in Haskell I made simple assumptions below to understand list lazy evaluation in Haskell, I suppose that expr3 would be lazily evaluated like eval1 , how about expr1 an...	[ -0.005828857421875, -0.005706787109375, 0.01068115234375, 0.003662109375, 0.00933837890625, 0.01141357421875, 0.000553131103515625, 0.0098876953125, 0.0157470703125, 0.0059814453125, -0.01153564453125, -0.0032501220703125, 0.0120849609375, 0.0185546875, -0.003265380859375, 0.0096435546...	[ 32036, 21, 3285, 219836, 20625, 142508, 1556, 159258, 14700, 42, 418, 304, 363, 28, 1405, 237259, 28219, 5303, 708, 151575, 1884, 61353, 15044, 9969, 1340, 11675, 1733, 2804, 4127, 227066, 1284, 7941, 31635, 32628, 27140, 1528, 62775 ]	[ 0.1995849609375, 0.1376953125, 0.208740234375, 0.2156982421875, 0.1214599609375, 0.226318359375, 0.09222412109375, 0.1810302734375, 0.0908203125, 0.10504150390625, 0.03863525390625, 0.08721923828125, 0.1512451171875, 0.015838623046875, 0.1689453125, 0.04254150390625, 0.0341796875, ...	embed
65616821_c1	65616821	haskell	1	of Left err -> fail $ show err Right parsed -> return $ parsed evalAndPrint :: Env -> String -> IO () evalAndPrint env expr = evalString env expr >>= putStrLn evalString :: Env -> String -> IO String evalString env expr = do x <- readStatement expr putStrLn $ show x map (\exprs -> runIOThrows $ liftM show $ evalStatem...	of Left err -> fail $ show err Right parsed -> return $ parsed evalAndPrint :: Env -> String -> IO () evalAndPrint env expr = evalString env expr >>= putStrLn evalString :: Env -> String -> IO String evalString env expr = do x <- readStatement expr putStrLn $ show x map (\exprs -> runIOThrows $ liftM show $ evalStatem...	[ -0.00958251953125, -0.004150390625, -0.005523681640625, 0.0186767578125, -0.00640869140625, 0.027099609375, -0.0040283203125, -0.007293701171875, 0.00897216796875, 0.004241943359375, -0.00775146484375, -0.015869140625, 0.003173828125, -0.00665283203125, 0.00933837890625, -0.00497436523...	[ 111, 636, 2480, 72, 42, 33079, 35782, 3650, 7639, 90911, 366, 5281, 30646, 28, 1405, 37839, 112079, 18, 1984, 357, 334, 23351, 17780, 16, 22, 14700, 2203, 71713, 1369, 3884, 866, 19, 54, 1022, 12301, 135206, 5911, 22288, 15, 83613, 4295...	[ 0.2279052734375, 0.104736328125, 0.1993408203125, 0.1279296875, 0.1727294921875, 0.07476806640625, 0.2142333984375, 0.1346435546875, 0.1064453125, 0.1728515625, 0.1815185546875, 0.140625, 0.1273193359375, 0.09698486328125, 0.259521484375, 0.1990966796875, 0.2166748046875, 0.0795288...	embed
27652463_c0	27652463	haskell	0	Title: 1 :: List[Nothing] in foldLeft Problem title: 1 :: List[Nothing] in foldLeft Tags: haskell, generics, scala Problem: 1 :: List[Nothing] in foldLeft If: scala> val l = List() // List() same as List[Nothing]() l: List[Nothing] = List() scala> 1 :: l res0: List[Int] = List(1) or: scala> 1 :: List[Nothing]() res6: L...	1 :: List[Nothing] in foldLeft 1 :: List[Nothing] in foldLeft haskell generics scala List Nothing res0 res6 res3 x:acc 1 :: List[Nothing] in foldLeft If: or: Why then this does not work out: So I have to type this explicitly List[Int]() : ? Though it does in Haskell, for example:	[ 0.01141357421875, 0.003204345703125, 0.0093994140625, -0.027099609375, -0.005615234375, -0.0037078857421875, -0.004150390625, -0.0098876953125, 0.007232666015625, -0.03466796875, 0.0048828125, -0.047607421875, 0.0017852783203125, 0.0047607421875, -0.012451171875, -0.0220947265625, -0...	[ 106, 1984, 32036, 1065, 5021, 64113, 23, 42822, 5267, 2480, 1556, 142508, 189534, 146232, 182747, 3332, 2389, 910, 363, 1022, 10060, 4263, 903, 959, 4488, 1810, 10644, 143726, 4153, 18, 152, 20625 ]	[ 0.032562255859375, 0.054351806640625, 0.2008056640625, 0.01165771484375, 0.0850830078125, 0.1551513671875, 0.041839599609375, 0.172607421875, 0.0751953125, 0.142822265625, 0.111328125, 0.202392578125, 0.167724609375, 0.14404296875, 0.1483154296875, 0.035308837890625, 0.04837036132812...	embed
28872396_c0	28872396	haskell	0	Title: Understanding filterM Problem title: Understanding filterM Tags: haskell, monads Problem: Understanding filterM Consider filterM (\x -> [True, False]) [1, 2, 3] I just cannot understand the magic that Haskell does with this filterM use case. The source code for this function is listed below: filterM :: (Monad m)...	Understanding filterM Understanding filterM haskell monads Understanding Monad Bool x:xs x:ys Understanding filterM Consider I just cannot understand the magic that Haskell does with this filterM use case. The source code for this function is listed below: With this use case, p should be the lambda function (\x -> [Tru...	[ -0.01544189453125, 0.0255126953125, -0.004364013671875, 0.01214599609375, 0.00823974609375, 0.01177978515625, 0.01611328125, 0.00116729736328125, 0.0240478515625, 0.0184326171875, 0.01275634765625, -0.01708984375, 0.000400543212890625, -0.002655029296875, 0.00921630859375, -0.000041007...	[ 9626, 144057, 46312, 594, 1556, 142508, 2667, 712, 60331, 71, 2460, 929, 1022, 425, 4778, 53418, 28219, 49846, 20625, 4527, 7225, 31344, 18151, 32354, 915, 5608, 21, 6492, 85, 41872, 33079, 882, 22225, 5117, 106, 12564, 177, 4426, 9, 3064...	[ 0.0606689453125, 0.04791259765625, 0.2464599609375, 0.1934814453125, 0.0908203125, 0.2445068359375, 0.05523681640625, 0.08502197265625, 0.13330078125, 0.08837890625, 0.082275390625, 0.1673583984375, 0.12890625, 0.08343505859375, 0.0909423828125, 0.0426025390625, 0.0926513671875, 0....	embed
71540156_c0	71540156	haskell	0	Title: iteration with the list monad Problem title: iteration with the list monad Tags: list, monads, haskell Problem: iteration with the list monad I'm having trouble understanding how the iterative behavior of the list monad can be derived from its definition . instance Monad [] where m >>= f = concatMap f m return x...	iteration with the list monad iteration with the list monad list monads haskell Monad iteration with the list monad I'm having trouble understanding how the iterative behavior of the list monad can be derived from its definition . Discussions I've read seem to pass over the question of how >>= creates a control structu...	[ -0.0157470703125, -0.005615234375, 0.0150146484375, 0.007568359375, 0.00482177734375, 0.019775390625, 0.01287841796875, 0.004180908203125, 0.01141357421875, -0.0113525390625, 0.01025390625, -0.031494140625, -0.0029296875, -0.008056640625, -0.00592041015625, 0.0072021484375, -0.009277...	[ 17, 720, 2320, 678, 5303, 2667, 712, 1556, 142508, 60331, 71, 63134, 100094, 3642, 45023, 123166, 831, 16406, 4126, 1295, 80934, 645, 6396, 1369, 28282, 7, 6226, 45646, 123019, 54, 110, 22062, 903, 88303, 23, 47, 20625, 41591, 17780, 1017...	[ 0.07470703125, 0.24951171875, 0.0408935546875, 0.139404296875, 0.190673828125, 0.1434326171875, 0.18408203125, 0.0985107421875, 0.232421875, 0.1849365234375, 0.12548828125, 0.05767822265625, 0.0556640625, 0.03955078125, 0.1141357421875, 0.1578369140625, 0.023468017578125, 0.0343017...	embed
73843021_c0	73843021	haskell	0	Title: Is there a way reverse associativity of function application in Haskell? Problem title: Is there a way reverse associativity of function application in Haskell? Tags: haskell Problem: Is there a way reverse associativity of function application in Haskell? So I'm looking for a way to force some operators which a...	Is there a way reverse associativity of function application in Haskell? Is there a way reverse associativity of function application in Haskell? haskell Haskell Is there a way reverse associativity of function application in Haskell? So I'm looking for a way to force some operators which are defined as right-associati...	[ 0.007049560546875, 0.0172119140625, 0.020263671875, 0.0118408203125, 0.00112152099609375, -0.000461578369140625, 0.006439208984375, 0.01318359375, 0.01434326171875, -0.03857421875, 0.0002880096435546875, 0.006378173828125, 0.00885009765625, 0.007659912109375, -0.004241943359375, 0.0008...	[ 2071, 2685, 3917, 39531, 184, 166027, 3760, 53, 32354, 38415, 23, 20625, 142508, 10, 1556, 111, 16487, 37772, 39933, 61924, 7108, 162, 45388, 45023, 190659, 25737, 144996, 3650, 65572, 107671, 17110, 959, 4989, 158, 4460, 33, 121293, 151575, ...	[ 0.0069580078125, 0.0283966064453125, 0.12109375, 0.22412109375, 0.1773681640625, 0.1949462890625, 0.12255859375, 0.06787109375, 0.169921875, 0.1998291015625, 0.06884765625, 0.143310546875, 0.24951171875, 0.010986328125, 0.09912109375, 0.04058837890625, 0.00689697265625, 0.156127929...	embed
75171829_c1	75171829	haskell	1	). But in the retrieveEntityById case this is not possible, as the object has yet to loaded from the DB. That's why I have to call the function with an extra TypeInfo parameter that I create from a sample entity. I would like to get rid of this extra parameter, to have a function signature like: retrieveEntityById :: f...	). But in the retrieveEntityById case this is not possible, as the object has yet to loaded from the DB. That's why I have to call the function with an extra TypeInfo parameter that I create from a sample entity. I would like to get rid of this extra parameter, to have a function signature like: retrieveEntityById :: f...	[ 0.01336669921875, 0.007293701171875, -0.006591796875, 0.0213623046875, -0.01129150390625, 0.011474609375, 0.0074462890625, 0.00099945068359375, 0.020263671875, -0.07421875, -0.019775390625, -0.0115966796875, -0.004791259765625, -0.022216796875, 0.00372314453125, -0.000240325927734375, ...	[ 194, 456, 3996, 3134, 7768, 18, 2481, 75358, 568, 71, 7225, 903, 959, 7722, 36746, 1556, 14373, 72367, 57976, 11782, 32354, 4173, 60457, 93147, 171859, 28282, 10, 121413, 77630, 939, 2806, 1884, 31351, 138256, 100, 5584, 158, 19, 3447, 13...	[ 0.004730224609375, 0.068115234375, 0.1461181640625, 0.123046875, 0.05767822265625, 0.111083984375, 0.0928955078125, 0.1336669921875, 0.10382080078125, 0.154296875, 0.0161590576171875, 0.00177001953125, 0.0716552734375, 0.1343994140625, 0.15966796875, 0.005950927734375, 0.092895507812...	embed
7641282_c1	7641282	haskell	1	-> Type idSubst :: Substitution idSubst x = TVar x update :: (String, Type) -> Substitution -> Substitution update (x,y) f = (\z -> if z == x then y else f z) -- vars collects all the variables occuring in a type expression vars :: Type -> [String] vars ty = nub (vars' ty) where vars' (TVar x) = [x] vars' (BinType op ...	-> Type idSubst :: Substitution idSubst x = TVar x update :: (String, Type) -> Substitution -> Substitution update (x,y) f = (\z -> if z == x then y else f z) -- vars collects all the variables occuring in a type expression vars :: Type -> [String] vars ty = nub (vars' ty) where vars' (TVar x) = [x] vars' (BinType op ...	[ 0.0145263671875, 0.01422119140625, 0.005828857421875, 0.0201416015625, 0.015869140625, -0.0018463134765625, -0.0272216796875, 0.017822265625, -0.0008697509765625, -0.0007781982421875, -0.01123046875, -0.005126953125, 0.00051116943359375, 0.00433349609375, -0.00482177734375, 0.008850097...	[ 33079, 60457, 3447, 96472, 271, 1984, 8273, 13480, 1363, 1022, 2203, 1910, 147, 28350, 71713, 214, 425, 4, 53, 1238, 169, 2174, 97, 69112, 113, 37076, 4210, 285, 7, 43799, 756, 77336, 74918, 23, 10644, 125195, 2281, 315, 275, 1961, 25, ...	[ 0.051605224609375, 0.195068359375, 0.199462890625, 0.274169921875, 0.2196044921875, 0.056640625, 0.1851806640625, 0.2236328125, 0.09991455078125, 0.147705078125, 0.07421875, 0.157958984375, 0.1807861328125, 0.2113037109375, 0.10107421875, 0.02972412109375, 0.07757568359375, 0.06100...	embed
4147659_c0	4147659	haskell	0	Title: Haskell "show is applied to too many type arguments" Problem title: Haskell "show is applied to too many type arguments" Tags: haskell Problem: Haskell "show is applied to too many type arguments" I am trying to replicate the UNIX program wc in haskell. To make this easier I have created a ty...	Haskell "show is applied to too many type arguments" Haskell "show is applied to too many type arguments" haskell Haskell WCResult Show wc.hs:9:15 Haskell "show is applied to too many type arguments" I am trying to replicate the UNIX program wc in haskell. To make this easier I have created a type: ...	[ 0.0042724609375, -0.01104736328125, 0.0019683837890625, 0.004974365234375, -0.00927734375, -0.0084228515625, -0.0140380859375, -0.0238037109375, 0.0203857421875, 0.0194091796875, -0.0198974609375, -0.0478515625, 0.0126953125, 0.0120849609375, -0.0205078125, -0.01397705078125, 0.00334...	[ 20625, 142508, 31374, 83, 190659, 47, 5792, 5941, 10644, 10750, 1556, 37808, 4332, 7, 7136, 17367, 92922, 127, 1126, 12221, 31577, 143126, 67, 67569, 1542, 1528, 23, 99156, 75935, 10, 14847, 9790, 11675, 903, 87, 2046, 35672, 3714, 15400 ]	[ 0.093994140625, 0.217529296875, 0.2313232421875, 0.07208251953125, 0.172119140625, 0.120849609375, 0.1702880859375, 0.1732177734375, 0.2083740234375, 0.2022705078125, 0.0911865234375, 0.1201171875, 0.041656494140625, 0.114990234375, 0.1610107421875, 0.18603515625, 0.1600341796875, ...	embed
32625625_c0	32625625	haskell	0	Title: Download resource with HTTP caching Problem title: Download resource with HTTP caching Tags: http, haskell, caching, server Problem: Download resource with HTTP caching To validate jwt tokens at server I'm using jwk ( Google ) certs (changing frequently) and, even exist many libraries to download that ( HTTP , c...	Download resource with HTTP caching Download resource with HTTP caching http haskell caching server Download HTTP Cache-Control Expires Download resource with HTTP caching To validate jwt tokens at server I'm using jwk ( Google ) certs (changing frequently) and, even exist many libraries to download that ( HTTP , curl ...	[ -0.0198974609375, 0.00787353515625, 0.0164794921875, 0.01904296875, 0.004241943359375, -0.0174560546875, -0.011962890625, 0.00116729736328125, 0.004180908203125, -0.035888671875, -0.0022125244140625, 0.01470947265625, 0.0157470703125, 0.0186767578125, -0.01226806640625, 0.021728515625,...	[ 4857, 177953, 678, 135913, 377, 59207, 1621, 1556, 142508, 10723, 2041, 1430, 175904, 60075, 50964, 44622, 1647, 434, 18, 47, 84694, 99, 17368, 92, 1815, 35649, 90965, 195409, 32316, 5941, 35773, 7026, 9709, 112061, 14037, 3917, 5423, 4000, ...	[ 0.1663818359375, 0.1722412109375, 0.09832763671875, 0.25732421875, 0.16162109375, 0.1976318359375, 0.1824951171875, 0.1114501953125, 0.2314453125, 0.1673583984375, 0.1119384765625, 0.1099853515625, 0.1905517578125, 0.1240234375, 0.0888671875, 0.1785888671875, 0.06396484375, 0.08276...	embed
12421085_c0	12421085	haskell	0	Title: Good introduction to free theorems Problem title: Good introduction to free theorems Tags: functional-programming, haskell Problem: Good introduction to free theorems I stumbled upon a nice idea of free theorems in functional language. However, the only resource I was able to find is Wadler's article " Theorems ...	Good introduction to free theorems Good introduction to free theorems functional-programming haskell Good Good introduction to free theorems I stumbled upon a nice idea of free theorems in functional language. However, the only resource I was able to find is Wadler's article " Theorems for Free ". It's quite good but i...	[ 0.0230712890625, 0.01513671875, 0.00897216796875, -0.007476806640625, -0.0018157958984375, -0.00872802734375, -0.00897216796875, -0.007354736328125, 0.004180908203125, -0.045654296875, 0.004302978515625, -0.005645751953125, -0.0137939453125, 0.037109375, 0.002349853515625, 0.0076293945...	[ 18621, 39864, 4092, 70, 58391, 47, 123309, 28966, 1556, 142508, 7, 18784, 40099, 26267, 6528, 46876, 4734, 177953, 92009, 603, 5582, 581, 100, 5153, 1650, 32233, 4127, 58621, 959, 57143, 7941, 2046, 8305, 217064, 23552, 56065, 47445, 5915, ...	[ 0.06195068359375, 0.08740234375, 0.1923828125, 0.05316162109375, 0.2098388671875, 0.010467529296875, 0.197021484375, 0.1214599609375, 0.1151123046875, 0.2154541015625, 0.07281494140625, 0.0186614990234375, 0.000091552734375, 0.038909912109375, 0.0606689453125, 0.123779296875, 0.01181...	embed
14887973_c0	14887973	haskell	0	Title: Haskell Cartesian Product Recursively Problem title: Haskell Cartesian Product Recursively Tags: haskell, cartesian-product Problem: Haskell Cartesian Product Recursively I know how to use list comprehension to do this, but how can I implement a function that will recursively compute the cartesian product given ...	Haskell Cartesian Product Recursively Haskell Cartesian Product Recursively haskell cartesian-product Haskell Cartesian Product Recursively Haskell Cartesian Product Recursively I know how to use list comprehension to do this, but how can I implement a function that will recursively compute the cartesian product given ...	[ 0.00323486328125, 0.0272216796875, 0.00653076171875, 0.00360107421875, 0.0002384185791015625, 0.022705078125, -0.0115966796875, -0.001220703125, -0.001312255859375, -0.01251220703125, 0.0057373046875, -0.015625, -0.005859375, 0.01007080078125, -0.0130615234375, -0.0068359375, 0.00190...	[ 20625, 142508, 106274, 39209, 73111, 853, 48650, 5844, 538, 1556, 129912, 3378, 57877, 3714, 3642, 4527, 5303, 46683, 3220, 6889, 54, 831, 29479, 32354, 1221, 195625, 9969, 6743, 70, 12996, 34475, 6626, 5423, 179933, 110, 3522, 140992, 903, ...	[ 0.148193359375, 0.2156982421875, 0.1661376953125, 0.156494140625, 0.25634765625, 0.0946044921875, 0.1737060546875, 0.2017822265625, 0.059326171875, 0.130859375, 0.1829833984375, 0.1524658203125, 0.2353515625, 0.05712890625, 0.05023193359375, 0.053436279296875, 0.1500244140625, 0.10...	embed
40351748_c0	40351748	haskell	0	Title: Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? Problem title: Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? Tags: haskell, type-inference, types, typeclass Problem: Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? When I enter :t 4 in ghci I get...	Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? haskell type-inference types typeclass Why Num Ord Prelude Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? When I enter :t 4 in ghci I get I understand why 4 ...	[ 0.005096435546875, -0.017333984375, 0.0233154296875, 0.00433349609375, 0.00125885009765625, 0.0018157958984375, -0.01123046875, 0.00933837890625, -0.000850677490234375, -0.01220703125, -0.0205078125, -0.055419921875, -0.007781982421875, 0.00750732421875, -0.0017242431640625, 0.00056457...	[ 44084, 31380, 318, 140992, 839, 316, 10, 5386, 18, 201, 959, 143045, 100, 1556, 142508, 10644, 73, 69988, 52895, 67413, 52782, 35379, 1914, 822, 112, 136, 30957, 28219, 15400, 360, 44401, 53498, 297, 103136, 1257, 127887, 808, 88949, 83, ...	[ 0.0802001953125, 0.127685546875, 0.1513671875, 0.1654052734375, 0.0323486328125, 0.1378173828125, 0.10467529296875, 0.072998046875, 0.0733642578125, 0.2158203125, 0.078857421875, 0.17431640625, 0.045166015625, 0.08685302734375, 0.1776123046875, 0.08026123046875, 0.0047607421875, 0....	embed
21644287_c0	21644287	haskell	0	Title: How to implement a Haskell extension? Problem title: How to implement a Haskell extension? Tags: ghci, haskell, ghc Problem: How to implement a Haskell extension? I have several ideas of extensions for Haskell, that can be implemented by translating extended language to normal one (the extensions will provide so...	How to implement a Haskell extension? How to implement a Haskell extension? ghci haskell ghc How Haskell Num How to implement a Haskell extension? I have several ideas of extensions for Haskell, that can be implemented by translating extended language to normal one (the extensions will provide some pragmas and keywords...	[ 0.02099609375, 0.00579833984375, 0.027099609375, 0.000370025634765625, 0.00677490234375, 0.0201416015625, -0.0184326171875, -0.0166015625, -0.00946044921875, -0.0301513671875, -0.01129150390625, -0.01055908203125, -0.019775390625, -0.007232666015625, 0.00579833984375, -0.00014019012451...	[ 11249, 47, 29479, 10, 20625, 142508, 111938, 32, 31380, 318, 1556, 238, 52782, 40368, 25647, 7, 831, 3900, 143, 65042, 46876, 3638, 1632, 1221, 22691, 3060, 58827, 1510, 136, 166117, 11522, 3917, 5608, 45367, 645, 527, 73265, 15190, 100, ...	[ 0.110595703125, 0.07568359375, 0.247802734375, 0.0804443359375, 0.17529296875, 0.281982421875, 0.254150390625, 0.00714111328125, 0.1029052734375, 0.1202392578125, 0.15673828125, 0.0810546875, 0.238525390625, 0.019866943359375, 0.06964111328125, 0.0260162353515625, 0.012725830078125, ...	embed
7165779_c0	7165779	haskell	0	Title: Haskell: Map function with tuples Problem title: Haskell: Map function with tuples Tags: tuples, map-function, haskell Problem: Haskell: Map function with tuples I have to write a Haskell program that does the following: Main> dotProduct [(1,3),(2,5),(3,3)] 2 [(2,3),(4,5),(6,3)] I have to do it both with and wit...	Haskell: Map function with tuples Haskell: Map function with tuples tuples map-function haskell Haskell Map Main Float Integer Haskell: Map function with tuples I have to write a Haskell program that does the following: I have to do it both with and without map function. I already did it without map , but I have no clu...	[ 0.00830078125, 0.017822265625, -0.009521484375, -0.000728607177734375, -0.03173828125, -0.0002803802490234375, -0.003692626953125, 0.005950927734375, 0.0014190673828125, -0.01446533203125, -0.01092529296875, -0.0191650390625, -0.003936767578125, -0.00119781494140625, -0.00823974609375, ...	[ 20625, 142508, 12, 42719, 32354, 678, 370, 99726, 22288, 137175, 1556, 12321, 38699, 257, 44401, 765, 47, 33022, 1528, 14602, 25632, 54, 15044, 15490, 21771, 6777, 110, 29786, 20633, 10752, 77193, 6183, 3871, 4358, 11389 ]	[ 0.1533203125, 0.2509765625, 0.04107666015625, 0.263427734375, 0.209716796875, 0.146728515625, 0.181396484375, 0.2486572265625, 0.2181396484375, 0.1822509765625, 0.1534423828125, 0.108154296875, 0.1551513671875, 0.054962158203125, 0.176025390625, 0.0555419921875, 0.012664794921875, ...	embed
47823293_c0	47823293	haskell	0	Title: How to install a package and save the setting? Problem title: How to install a package and save the setting? Tags: haskell-stack, haskell Problem: How to install a package and save the setting? I created a new project using stack . stack new myproj I want to install a package lens . If I use the following comman...	How to install a package and save the setting? How to install a package and save the setting? haskell-stack haskell How package.yml How to install a package and save the setting? I created a new project using stack . I want to install a package lens . If I use the following command, the package will be installed, but i...	[ -0.00457763671875, -0.006927490234375, 0.01226806640625, 0.006866455078125, -0.0003032684326171875, 0.0184326171875, -0.006072998046875, -0.006134033203125, 0.00141143798828125, 0.0079345703125, 0.00982666015625, -0.007232666015625, 0.000667572021484375, -0.006500244140625, 0.00147247314...	[ 11249, 47, 20600, 98169, 136, 30098, 53550, 10, 70, 1556, 142508, 590, 2594, 53, 7237, 75935, 13452, 17368, 177261, 3098, 7, 25632, 75101, 959, 49814, 2967, 6002, 18151, 174653, 37076, 110, 36294, 87344, 25037, 39, 108999, 191082, 15190 ]	[ 0.065673828125, 0.0191802978515625, 0.2200927734375, 0.259033203125, 0.1055908203125, 0.1668701171875, 0.18359375, 0.041839599609375, 0.0262603759765625, 0.1190185546875, 0.189453125, 0.07470703125, 0.087158203125, 0.0537109375, 0.1741943359375, 0.00274658203125, 0.07476806640625, ...	embed
66433321_c0	66433321	haskell	0	Title: Change specific bytes in Haskell ByteString Problem title: Change specific bytes in Haskell ByteString Tags: haskell Problem: Change specific bytes in Haskell ByteString Suppose I have a Data.ByteString and a list of desired changes [(Int, Word8)] where Int is an index and Word8 is a new byte value. How to apply...	Change specific bytes in Haskell ByteString Change specific bytes in Haskell ByteString haskell Change Haskell ByteString Data.ByteString Word8 Change specific bytes in Haskell ByteString Suppose I have a Data.ByteString and a list of desired changes [(Int, Word8)] where Int is an index and Word8 is a new byte value. H...	[ -0.010498046875, -0.0003223419189453125, 0.014404296875, 0.005615234375, -0.008544921875, 0.004241943359375, -0.02392578125, -0.00311279296875, 0.00360107421875, 0.058349609375, 0.0029754638671875, 0.0186767578125, 0.0205078125, 0.0218505859375, -0.00665283203125, -0.0078125, 0.01483...	[ 87377, 29458, 390, 1636, 20625, 142508, 3311, 67, 71713, 23, 1556, 11809, 75358, 22543, 1019, 214, 5303, 104851, 65572, 18, 50490, 360, 63262, 3525, 34292, 11249, 47, 59911, 2684, 93766, 313, 8781, 40956, 645, 15549, 8951, 23935, 199334, 37...	[ 0.19189453125, 0.197998046875, 0.1220703125, 0.156982421875, 0.154541015625, 0.2484130859375, 0.1134033203125, 0.12939453125, 0.1668701171875, 0.035491943359375, 0.145263671875, 0.07763671875, 0.07720947265625, 0.1307373046875, 0.2115478515625, 0.049560546875, 0.11328125, 0.1217041...	embed
66846992_c0	66846992	haskell	0	Title: Haskell perform function on list n number times Problem title: Haskell perform function on list n number times Tags: haskell Problem: Haskell perform function on list n number times I am learning functional programming using Haskell. I am trying to create a function that takes a function f , and executes the fun...	Haskell perform function on list n number times Haskell perform function on list n number times haskell Haskell Haskell perform function on list n number times I am learning functional programming using Haskell. I am trying to create a function that takes a function f , and executes the function on some input x , n num...	[ 0.0034637451171875, 0.01519775390625, -0.000720977783203125, -0.000881195068359375, -0.0029144287109375, -0.00167083740234375, -0.006561279296875, -0.0194091796875, 0.002532958984375, -0.04150390625, 0.0048828125, -0.0201416015625, -0.004852294921875, 0.0181884765625, -0.0002994537353515...	[ 20625, 142508, 51339, 32354, 98, 5303, 653, 14012, 20028, 1556, 87, 52080, 123309, 56037, 17368, 31577, 28282, 51776, 1238, 71924, 3060, 107730, 1022, 140992, 1884, 903, 2060, 2809, 19048, 1380, 1257, 678, 18822, 14602, 1284, 3714, 158, 2816,...	[ 0.1539306640625, 0.2283935546875, 0.22021484375, 0.2330322265625, 0.1251220703125, 0.216796875, 0.1490478515625, 0.170166015625, 0.248046875, 0.1595458984375, 0.000335693359375, 0.0950927734375, 0.1590576171875, 0.0926513671875, 0.0218658447265625, 0.0777587890625, 0.103515625, 0.1...	embed
26035489_c0	26035489	haskell	0	Title: Check memory usage in haskell Problem title: Check memory usage in haskell Tags: memory-management, memory, resources, caching, haskell Problem: Check memory usage in haskell I'm creating a program which implements some kind of cache. I need to use as much memory as possible and to do that I need to do two thing...	Check memory usage in haskell Check memory usage in haskell memory-management memory resources caching haskell Check Check memory usage in haskell I'm creating a program which implements some kind of cache. I need to use as much memory as possible and to do that I need to do two things: Check how much memory is still a...	[ -0.007476806640625, 0.01226806640625, 0.005401611328125, 0.0302734375, -0.003936767578125, 0.00927734375, -0.00689697265625, 0.00439453125, -0.0032501220703125, -0.044921875, 0.0186767578125, -0.0047607421875, 0.017822265625, 0.0235595703125, 0.01507568359375, 0.02783203125, 0.009338...	[ 38679, 98323, 127689, 23, 1556, 142508, 87140, 65514, 377, 59207, 105233, 1528, 29479, 82365, 3871, 4527, 237, 5045, 7722, 54, 6626, 8966, 7464, 19882, 5426, 35812, 4734, 61595, 15383, 4027, 21771, 17368, 13651, 41371, 29806, 150040, 3773, 12...	[ 0.1973876953125, 0.191162109375, 0.20947265625, 0.1004638671875, 0.14111328125, 0.2293701171875, 0.0928955078125, 0.0811767578125, 0.086669921875, 0.07440185546875, 0.05401611328125, 0.089599609375, 0.046966552734375, 0.1624755859375, 0.0552978515625, 0.13330078125, 0.00213623046875,...	embed
51800389_c1	51800389	haskell	1	and then wait for the next command. Until the end of time, or more seriously until the user issues the quit command. Likewise, instead of processing an infinite stream of user commands, process an infinite stream of data. Such as continuous queries on a database. Those cases are rather specific and might be treated by...	and then wait for the next command. Until the end of time, or more seriously until the user issues the quit command. Likewise, instead of processing an infinite stream of user commands, process an infinite stream of data. Such as continuous queries on a database. Those cases are rather specific and might be treated by...	[ 0.0024261474609375, 0.01300048828125, -0.0014495849609375, 0.01177978515625, 0.00909423828125, 0.000370025634765625, 0.003143310546875, 0.00012302398681640625, 0.0027923583984375, -0.039306640625, 0.002166748046875, -0.0224609375, -0.017333984375, 0.0125732421875, -0.0157470703125, 0.0...	[ 136, 7068, 40485, 100, 11737, 75101, 5, 992, 3675, 3564, 1733, 1286, 147115, 24189, 38937, 37348, 70, 569, 18, 90825, 64457, 9433, 214, 54241, 13, 75973, 2053, 62005, 41, 10484, 10, 63399, 50218, 29458, 13648, 191607, 46876, 128489, 20625, ...	[ 0.049407958984375, 0.07281494140625, 0.2269287109375, 0.0947265625, 0.129638671875, 0.27197265625, 0.065673828125, 0.04412841796875, 0.0634765625, 0.08935546875, 0.1075439453125, 0.025421142578125, 0.1002197265625, 0.0167694091796875, 0.1640625, 0.05755615234375, 0.048431396484375, ...	embed
29520631_c0	29520631	haskell	0	Title: Haskell: Parse error in an IO program Problem title: Haskell: Parse error in an IO program Tags: haskell, parse-error Problem: Haskell: Parse error in an IO program I am writing a program to help my younger brother learn addition. I am not experienced in writing IO programs, And I am stuck with this parse error:...	Haskell: Parse error in an IO program Haskell: Parse error in an IO program haskell parse-error Haskell Parse MyCode.hs:6:25 Possibly times-1 Haskell: Parse error in an IO program I am writing a program to help my younger brother learn addition. I am not experienced in writing IO programs, And I am stuck with this pars...	[ -0.004180908203125, 0.0208740234375, -0.00970458984375, 0.00823974609375, -0.0033721923828125, 0.03857421875, -0.010009765625, -0.0067138671875, 0.00775146484375, -0.0186767578125, 0.00141143798828125, -0.037109375, 0.001922607421875, 0.007781982421875, 0.002532958984375, -0.0057678222...	[ 20625, 142508, 12, 2392, 184, 18499, 23, 17780, 1528, 142, 1556, 366, 188800, 2646, 114211, 127, 7, 910, 21224, 115861, 38526, 20028, 5759, 32562, 10, 47, 4358, 759, 27150, 56, 82953, 30698, 66044, 959, 122446, 6, 103391, 179933, 678, 903...	[ 0.162353515625, 0.26318359375, 0.05145263671875, 0.156005859375, 0.1649169921875, 0.2244873046875, 0.1005859375, 0.24609375, 0.199462890625, 0.03887939453125, 0.15283203125, 0.1265869140625, 0.1822509765625, 0.1650390625, 0.21630859375, 0.080810546875, 0.034332275390625, 0.10052490...	embed
55672079_c0	55672079	haskell	0	Title: foldr with 4 arguments? Problem title: foldr with 4 arguments? Tags: haskell Problem: foldr with 4 arguments? I am struggling to understand why this code taken from the haskell.org exercise page typechecks (and works as a list reversal function): myReverse :: [a] -> [a] myReverse xs = foldr (\x fId empty -> fId ...	foldr with 4 arguments? foldr with 4 arguments? haskell Foldable foldr with 4 arguments? I am struggling to understand why this code taken from the haskell.org exercise page typechecks (and works as a list reversal function): My first point of confusion is that foldr accepts 3 arguments, not 4 : so I am guessing that m...	[ -0.0179443359375, -0.001129150390625, -0.00020313262939453125, 0.000873565673828125, -0.00726318359375, 0.021240234375, 0.017822265625, 0.004058837890625, 0.00335693359375, -0.000789642333984375, 0.003204345703125, -0.0244140625, -0.01385498046875, -0.00836181640625, -0.0062255859375, ...	[ 18344, 7569, 678, 201, 10750, 7, 32, 1556, 142508, 30077, 71, 2886, 237875, 28219, 15400, 18151, 1478, 81979, 10644, 78292, 43240, 237, 5303, 39531, 2317, 32354, 6275, 169463, 26946, 138, 959, 57767, 759, 4332, 37676, 183234, 4488, 21, 6492...	[ 0.1685791015625, 0.25927734375, 0.0904541015625, 0.1937255859375, 0.25, 0.10491943359375, 0.00152587890625, 0.126220703125, 0.211181640625, 0.1451416015625, 0.0736083984375, 0.1263427734375, 0.03472900390625, 0.05877685546875, 0.0299835205078125, 0.1199951171875, 0.037628173828125, ...	embed
18469063_c0	18469063	haskell	0	Title: How to go to a new line in GHCi? Problem title: How to go to a new line in GHCi? Tags: haskell Problem: How to go to a new line in GHCi? I want to write a function, something like this double :: Int -> Int double x = x + x The problem is that after I write the first line: Prelude> double :: Int -> Int I try to g...	How to go to a new line in GHCi? How to go to a new line in GHCi? haskell How GHCi Prelude Not How to go to a new line in GHCi? I want to write a function, something like this The problem is that after I write the first line: I try to go to the next line pressing the enter key, but when I do I get: It seems that the pr...	[ -0.014892578125, -0.0087890625, 0.00104522705078125, 0.0341796875, -0.00173187255859375, 0.0244140625, 0.0028076171875, 0.0045166015625, -0.010009765625, -0.03271484375, -0.015869140625, -0.0189208984375, -0.016357421875, 0.00146484375, 0.007659912109375, 0.00445556640625, 0.00364685...	[ 11249, 47, 738, 3525, 13315, 23, 527, 73265, 14, 10, 1556, 142508, 1914, 822, 112, 11205, 3444, 33022, 32354, 2967, 7103, 5117, 9790, 11737, 24234, 30957, 22799, 1528, 71924, 13319, 17932, 9969, 1340, 3642, 831, 20625, 124090, 4727, 11787 ]	[ 0.08428955078125, 0.1978759765625, 0.14306640625, 0.1419677734375, 0.1951904296875, 0.0953369140625, 0.0924072265625, 0.1163330078125, 0.2003173828125, 0.0175323486328125, 0.09869384765625, 0.239013671875, 0.039306640625, 0.12548828125, 0.0823974609375, 0.035430908203125, 0.025939941...	embed
18864080_c0	18864080	haskell	0	Title: Haskell: use Maybe but print an actual number rather than "Just ... " Problem title: Haskell: use Maybe but print an actual number rather than "Just ... " Tags: haskell, max Problem: Haskell: use Maybe but print an actual number rather than "Just ... " So here is my program. I want to impleme...	Haskell: use Maybe but print an actual number rather than "Just ... " Haskell: use Maybe but print an actual number rather than "Just ... " haskell max Haskell Maybe Just Ord Nothing x:y:xs y:xs x:xs Haskell: use Maybe but print an actual number rather than "Just ... " So here is my program. I want ...	[ -0.008544921875, -0.005340576171875, 0.031982421875, -0.00372314453125, 0.02392578125, 0.045166015625, 0.0228271484375, -0.003204345703125, 0.0283203125, 0.002838134765625, 0.008056640625, -0.02001953125, 0.00101470947265625, -0.0177001953125, 0.018798828125, -0.004058837890625, -0.0...	[ 20625, 142508, 4527, 83425, 1284, 28412, 8561, 14012, 43257, 3501, 127794, 153, 41502, 1556, 18389, 9563, 35379, 182747, 1022, 53, 425, 113, 12, 3688, 759, 1528, 3444, 29479, 38132, 32354, 10002, 100, 95486, 2967, 163, 37202, 179459, 678, 2...	[ 0.15625, 0.253662109375, 0.120361328125, 0.306640625, 0.1383056640625, 0.2305908203125, 0.182373046875, 0.1900634765625, 0.1087646484375, 0.048583984375, 0.27294921875, 0.085205078125, 0.0187225341796875, 0.1514892578125, 0.1824951171875, 0.1905517578125, 0.1942138671875, 0.1530761...	embed
26310956_c0	26310956	haskell	0	Title: Haskell usage of null Problem title: Haskell usage of null Tags: keyword, null, haskell Problem: Haskell usage of null I'm reading through Real World Haskell and in my copy, on page 59, it states: In Haskell we don't have the equivalent of null. We could use Maybe... Instead we've decided to use a no-argument Em...	Haskell usage of null Haskell usage of null keyword null haskell Haskell Real World Haskell usage of null I'm reading through Real World Haskell and in my copy, on page 59, it states: Then, in the next section, on Errors, there is the Haskell function: Now, I don't understand what the "null" in this function definition...	[ 0.0078125, -0.002471923828125, 0.0230712890625, 0.0037384033203125, 0.00726318359375, 0.03564453125, 0.00787353515625, -0.016357421875, 0.0123291015625, 0.0093994140625, 0.00823974609375, -0.033203125, -0.0164794921875, 0.000751495361328125, 0.0157470703125, -0.0166015625, 0.00402832...	[ 20625, 142508, 127689, 111, 56574, 166117, 1556, 5120, 6661, 11156, 98, 212059, 7, 32354, 28219, 139550, 23, 903, 80934, 15005, 110, 183234, 156202, 4358 ]	[ 0.1378173828125, 0.2646484375, 0.158447265625, 0.0212554931640625, 0.2578125, 0.19189453125, 0.1195068359375, 0.1207275390625, 0.1351318359375, 0.057342529296875, 0.007843017578125, 0.169921875, 0.003662109375, 0.1875, 0.08642578125, 0.280029296875, 0.0165557861328125, 0.0645751953...	embed
21283991_c2	21283991	haskell	2	, pem-0.2.1, certificate-1.3.9, publicsuffixlist-0.1, regex-base-0.93.2, regex-posix-0.95.2, regex-compat-0.95.1, socks-0.5.4, crypto-numbers-0.2.3, crypto-pubkey-0.2.4, tls-1.1.5, cipher-rc4-0.1.4, tls-extra-0.6.6, http-conduit-1.9.6, hslogger-1.2.3, MissingH-1.2.0.2, ConfigFile-1.1.1, Compiling, FP.API.Run, API, Run....	, pem-0.2.1, certificate-1.3.9, publicsuffixlist-0.1, regex-base-0.93.2, regex-posix-0.95.2, regex-compat-0.95.1, socks-0.5.4, crypto-numbers-0.2.3, crypto-pubkey-0.2.4, tls-1.1.5, cipher-rc4-0.1.4, tls-extra-0.6.6, http-conduit-1.9.6, hslogger-1.2.3, MissingH-1.2.0.2, ConfigFile-1.1.1, Compiling, FP.API.Run, API, Run....	[ -0.0047607421875, -0.00909423828125, 0.00555419921875, 0.00579833984375, 0.005126953125, 0.01446533203125, -0.006317138671875, -0.000762939453125, -0.0012664794921875, 0.0174560546875, -0.00154876708984375, -0.001678466796875, 0.00098419189453125, -0.0164794921875, -0.005523681640625, ...	[ 6, 4, 32490, 23320, 5, 68107, 163769, 5759, 156611, 3835, 77745, 55923, 6562, 9, 102014, 6835, 3355, 37382, 143161, 107033, 67890, 425, 158296, 277, 4453, 156627, 221, 22824, 93645, 617, 215637, 2606, 1297, 120883, 111596, 19770, 116591, 7513...	[ 0.1229248046875, 0.1558837890625, 0.20263671875, 0.1280517578125, 0.10235595703125, 0.195556640625, 0.2462158203125, 0.08428955078125, 0.17236328125, 0.11279296875, 0.0703125, 0.140380859375, 0.1517333984375, 0.06536865234375, 0.1728515625, 0.11767578125, 0.1685791015625, 0.1289062...	embed
41648122_c0	41648122	haskell	0	Title: Haskell parse error on input '=' for quadratic formula Problem title: Haskell parse error on input '=' for quadratic formula Tags: haskell Problem: Haskell parse error on input '=' for quadratic formula I am trying to write a haskell function which will calculate the two roots of the quadrati...	Haskell parse error on input '=' for quadratic formula Haskell parse error on input '=' for quadratic formula haskell Data.List System.IO Haskell Double Haskell parse error on input '=' for quadratic formula I am trying to write a haskell function which will calculate the two roots of the quadratic ...	[ 0.009033203125, 0.0179443359375, 0.002899169921875, -0.0096435546875, 0.007598876953125, 0.02099609375, 0.00457763671875, -0.00921630859375, -0.0108642578125, -0.01446533203125, -0.0021514892578125, -0.024169921875, 0.0167236328125, -0.015625, -0.005615234375, -0.014892578125, -0.020...	[ 20625, 142508, 366, 184, 18499, 98, 107730, 3768, 1369, 68587, 9523, 26168, 100, 1556, 11809, 154663, 12353, 17780, 107172, 31577, 33022, 32354, 74481, 6626, 74855, 13695, 70, 2500, 53333, 1264, 29860, 3871, 1974, 23, 246, 81409 ]	[ 0.16162109375, 0.257080078125, 0.1654052734375, 0.1650390625, 0.2352294921875, 0.114990234375, 0.212158203125, 0.150634765625, 0.216552734375, 0.230224609375, 0.11376953125, 0.1771240234375, 0.033355712890625, 0.1368408203125, 0.0210113525390625, 0.0863037109375, 0.06982421875, 0.1...	embed
31138658_c0	31138658	haskell	0	Title: How to get all subnumbers of a number in haskell Problem title: How to get all subnumbers of a number in haskell Tags: haskell Problem: How to get all subnumbers of a number in haskell I would like to get all sub numbers of a number from a particular side. In the case of the number 1234, the sub numbers from the...	How to get all subnumbers of a number in haskell How to get all subnumbers of a number in haskell haskell How Exception Prelude.read How to get all subnumbers of a number in haskell I would like to get all sub numbers of a number from a particular side. In the case of the number 1234, the sub numbers from the left side...	[ -0.013916015625, -0.00634765625, 0.01300048828125, 0.006683349609375, -0.013916015625, 0.0213623046875, 0.01104736328125, -0.025390625, 0.00531005859375, -0.039794921875, 0.0035247802734375, -0.02392578125, 0.0159912109375, 0.0361328125, 0.003997802734375, -0.0030364990234375, 0.0107...	[ 11249, 47, 2046, 756, 1614, 2606, 1297, 7, 111, 14012, 23, 1556, 142508, 5443, 63928, 1914, 822, 112, 39116, 1884, 101935, 1295, 17311, 5609, 190875, 25737, 29479, 678, 70, 84068, 9384, 96760, 44401, 25632, 18499, 20594, 44691 ]	[ 0.0428466796875, 0.03094482421875, 0.145751953125, 0.1788330078125, 0.25732421875, 0.20458984375, 0.18017578125, 0.10467529296875, 0.03717041015625, 0.171630859375, 0.05706787109375, 0.1513671875, 0.2225341796875, 0.0182647705078125, 0.1300048828125, 0.009613037109375, 0.0810546875, ...	embed
61960515_c1	61960515	haskell	1	tedious when using multiple sentences which will then have the 4 options for each sentence. My Code --First Version import Data.List import System.IO main :: IO() sentences = do putStrLn "The Cat is ______ from ______ the city \n" putStrLn "Here are your options:" putStrLn "A. big, nearby" putStrLn "B. Nearby, in" put...	tedious when using multiple sentences which will then have the 4 options for each sentence. My Code --First Version import Data.List import System.IO main :: IO() sentences = do putStrLn "The Cat is ______ from ______ the city \n" putStrLn "Here are your options:" putStrLn "A. big, nearby" putStrLn "B. Nearby, in" put...	[ 0.000896453857421875, 0.00139617919921875, -0.0123291015625, 0.0196533203125, 0.0106201171875, -0.01202392578125, 0.0162353515625, 0.0096435546875, 0.00811767578125, -0.01025390625, -0.006744384765625, -0.02197265625, -0.0012054443359375, 0.0223388671875, -0.000637054443359375, 0.03027...	[ 120, 5670, 223, 17368, 48716, 149357, 7, 765, 201, 50717, 100, 12638, 2646, 28864, 207263, 40647, 24927, 11809, 154663, 12353, 17780, 5201, 54, 3884, 71713, 866, 19, 3957, 18826, 83, 167726, 1295, 26349, 25178, 935, 6957, 43573, 1272, 147, ...	[ 0.07373046875, 0.0916748046875, 0.05645751953125, 0.077392578125, 0.1431884765625, 0.2109375, 0.06109619140625, 0.03436279296875, 0.1478271484375, 0.251953125, 0.0200653076171875, 0.0192108154296875, 0.0760498046875, 0.206298828125, 0.09661865234375, 0.2044677734375, 0.15234375, 0....	embed
35818996_c0	35818996	haskell	0	Title: Recursive lambda in Haskell Problem title: Recursive lambda in Haskell Tags: haskell, lambda Problem: Recursive lambda in Haskell Let's see analyse code for factorial in Haskell using lambda function: y f x = f (y f) x factorial = y (\t n -> if n == 1 then 1 else n * t(n-1)) And I cannot understand how does it w...	Recursive lambda in Haskell Recursive lambda in Haskell haskell lambda Recursive Haskell n-1 Recursive lambda in Haskell Let's see analyse code for factorial in Haskell using lambda function: And I cannot understand how does it works. I know that it is connected with lambda calculus but nowadays I am not familiar with ...	[ -0.002166748046875, 0.007476806640625, 0.0133056640625, 0.0172119140625, 0.0291748046875, -0.0177001953125, 0.022705078125, 0.019287109375, -0.01446533203125, -0.02001953125, 0.00750732421875, -0.03125, -0.01275634765625, -0.005126953125, 0.00872802734375, 0.00116729736328125, -0.007...	[ 853, 48650, 5844, 21, 6492, 85, 20625, 142508, 23, 1556, 653, 5759, 1957, 51422, 18151, 31461, 15403, 17368, 32354, 53418, 28219, 3642, 14602, 442, 43240, 162711, 44805, 223, 5636, 16031, 20187, 51359, 92814, 4865, 83, 1238, 80934, 29459, 9...	[ 0.07537841796875, 0.211181640625, 0.113037109375, 0.07305908203125, 0.2135009765625, 0.1290283203125, 0.1429443359375, 0.251220703125, 0.046142578125, 0.111572265625, 0.06396484375, 0.13818359375, 0.0142974853515625, 0.17138671875, 0.1207275390625, 0.2225341796875, 0.235595703125, ...	embed
16887023_c0	16887023	haskell	0	Title: Is it possible to hide specific functions from appearing in the documentation using haddock? Problem title: Is it possible to hide specific functions from appearing in the documentation using haddock? Tags: haddock, haskell Problem: Is it possible to hide specific functions from appearing in the documentation us...	Is it possible to hide specific functions from appearing in the documentation using haddock? Is it possible to hide specific functions from appearing in the documentation using haddock? haddock haskell appearing haddock Is it possible to hide specific functions from appearing in the documentation using haddock? I use h...	[ -0.006744384765625, 0.017822265625, -0.0037384033203125, 0.0084228515625, -0.000934600830078125, 0.0174560546875, 0.00347900390625, -0.0076904296875, -0.01055908203125, 0.015869140625, -0.00775146484375, 0.0021820068359375, -0.0012054443359375, 0.01434326171875, 0.0106201171875, 0.0177...	[ 2071, 7722, 1274, 112, 29458, 32354, 7, 1295, 108975, 23, 209806, 17368, 1902, 138414, 1556, 142508, 214, 442, 47, 4527, 2301, 18, 3444, 756, 31255, 44116, 14037, 25230, 86, 150380, 13, 10557, 1478, 8408, 29713, 7693, 83279, 191145, 8668, ...	[ 0.046539306640625, 0.1578369140625, 0.2183837890625, 0.2037353515625, 0.2120361328125, 0.2322998046875, 0.0804443359375, 0.1102294921875, 0.131591796875, 0.053436279296875, 0.240234375, 0.098388671875, 0.177490234375, 0.271728515625, 0.1260986328125, 0.23388671875, 0.042449951171875,...	embed
23620257_c0	23620257	haskell	0	Title: Haskell- composing three functions in weird way Problem title: Haskell- composing three functions in weird way Tags: composition, haskell Problem: Haskell- composing three functions in weird way I have three functions x y z and a function called functionComposer. I want functionComposer to have as arguments the ...	Haskell- composing three functions in weird way Haskell- composing three functions in weird way composition haskell Haskell x.y.z Haskell- composing three functions in weird way I have three functions x y z and a function called functionComposer. I want functionComposer to have as arguments the functions x y z and to r...	[ -0.00445556640625, -0.00439453125, 0.007110595703125, 0.01458740234375, 0.0205078125, 0.01263427734375, 0.0026397705078125, 0.00921630859375, -0.01153564453125, -0.020751953125, 0.0037384033203125, 0.0205078125, 0.01434326171875, -0.01507568359375, -0.006072998046875, -0.00267028808593...	[ 20625, 142508, 9, 9969, 232, 214, 17262, 32354, 7, 23, 179459, 3917, 166577, 1556, 1022, 53, 169, 87, 765, 113, 97, 136, 35839, 10770, 100587, 3444, 237, 10750, 30646, 163, 4527, 16750, 111, 3934, 4027, 25720, 5, 140363, 70760, 110, 220...	[ 0.1650390625, 0.252197265625, 0.0270843505859375, 0.1513671875, 0.12353515625, 0.025787353515625, 0.2061767578125, 0.2156982421875, 0.04351806640625, 0.062042236328125, 0.1982421875, 0.1197509765625, 0.2105712890625, 0.151123046875, 0.06976318359375, 0.079345703125, 0.0889892578125, ...	embed
26360306_c0	26360306	haskell	0	Title: Is it possible to take a value from evaluation context? Problem title: Is it possible to take a value from evaluation context? Tags: haskell Problem: Is it possible to take a value from evaluation context? I have the following sample program in Haskell: fun 1 = "result1" fun 2 = "result2" wrap = (\ x -> (\ _ -> ...	Is it possible to take a value from evaluation context? Is it possible to take a value from evaluation context? haskell evaluation result1 result2 test.wrap._ lambda1._ lambda2 Is it possible to take a value from evaluation context? I have the following sample program in Haskell: which yields to a result. Is it possibl...	[ -0.00933837890625, 0.018798828125, 0.01348876953125, 0.0216064453125, -0.0024261474609375, -0.00347900390625, -0.00872802734375, -0.00183868408203125, 0.0025177001953125, -0.046142578125, -0.0142822265625, 0.015869140625, -0.0008392333984375, -0.01611328125, 0.01458740234375, 0.0009155...	[ 2071, 442, 7722, 5646, 34292, 1295, 219836, 43701, 47, 10, 1556, 142508, 16750, 418, 304, 3034, 13631, 6492, 85, 121413, 1528, 20625, 11180, 19388, 2046, 77336, 106, 4958, 57, 4126, 64457, 3082, 84797, 23550, 28966, 49846, 56065 ]	[ 0.050445556640625, 0.0723876953125, 0.18994140625, 0.17236328125, 0.21875, 0.158935546875, 0.22216796875, 0.27734375, 0.045318603515625, 0.0240325927734375, 0.114990234375, 0.24072265625, 0.1361083984375, 0.00189208984375, 0.039306640625, 0.1109619140625, 0.1341552734375, 0.1115722...	embed
3995323_c0	3995323	haskell	0	Title: Any Sparse Linear Algebra package in Haskell? Problem title: Any Sparse Linear Algebra package in Haskell? Tags: haskell, sparse-matrix, linear-algebra Problem: Any Sparse Linear Algebra package in Haskell? Is there any package to perform Sparse Linear Algebra computations, maybe based on fast and efficient C li...	Any Sparse Linear Algebra package in Haskell? Any Sparse Linear Algebra package in Haskell? haskell sparse-matrix linear-algebra Any Sparse Linear Algebra Haskell Any Sparse Linear Algebra package in Haskell? Is there any package to perform Sparse Linear Algebra computations, maybe based on fast and efficient C librari...	[ 0.00341796875, 0.03564453125, 0.01495361328125, 0.0033721923828125, -0.0011138916015625, 0.005859375, 0.00982666015625, 0.01043701171875, -0.01348876953125, -0.00225830078125, 0.007171630859375, -0.0128173828125, -0.01092529296875, 0.005157470703125, -0.00775146484375, 0.01385498046875...	[ 28541, 37456, 184, 16777, 147, 884, 429, 2844, 98169, 23, 20625, 142508, 1556, 27148, 192, 87427, 192617, 289, 2499, 47, 51339, 181135, 35509, 4271, 93766, 313, 35773, 33938, 52922, 4588, 28601, 1096, 4527, 527, 30508, 46705, 3358, 98701, 6...	[ 0.10888671875, 0.2054443359375, 0.1556396484375, 0.162353515625, 0.0950927734375, 0.05841064453125, 0.100341796875, 0.1312255859375, 0.22607421875, 0.06640625, 0.1378173828125, 0.25439453125, 0.10711669921875, 0.1943359375, 0.02587890625, 0.1513671875, 0.193359375, 0.02899169921875...	embed
21889005_c0	21889005	haskell	0	Title: Difference of lists with unknown datatype Problem title: Difference of lists with unknown datatype Tags: haskell, list, polymorphism Problem: Difference of lists with unknown datatype I'm trying to get the difference between two lists like this: [(Char, Char, a)] -> [(Char, Char, a)] -> [(Char, Char, a)] where a...	Difference of lists with unknown datatype Difference of lists with unknown datatype haskell list polymorphism Difference Char Ord Difference of lists with unknown datatype I'm trying to get the difference between two lists like this: where a can be any datatype. The problem with doing \\ is that a is not an instance of...	[ 0.00457763671875, 0.01397705078125, 0.0078125, 0.0284423828125, -0.00634765625, 0.01153564453125, 0.0115966796875, -0.0118408203125, 0.011962890625, 0.009765625, 0.000293731689453125, -0.0186767578125, 0.0037689208984375, 0.0299072265625, -0.0361328125, 0.000537872314453125, 0.018432...	[ 803, 18234, 6620, 5303, 7, 678, 51, 69723, 2053, 50986, 1556, 142508, 35874, 178851, 21656, 35379, 111, 19, 31577, 2046, 60212, 17721, 6626, 1884, 903, 7440, 10, 831, 186, 2499, 2967, 20594, 18991, 83, 959, 110527, 18775, 29806, 96704, 41...	[ 0.1090087890625, 0.2135009765625, 0.0634765625, 0.22314453125, 0.055572509765625, 0.09637451171875, 0.0853271484375, 0.2166748046875, 0.113525390625, 0.240234375, 0.1097412109375, 0.2242431640625, 0.09088134765625, 0.1644287109375, 0.1282958984375, 0.208740234375, 0.008453369140625, ...	embed
21997609_c0	21997609	haskell	0	Title: Getting average of calculated list haskell Problem title: Getting average of calculated list haskell Tags: fold, haskell Problem: Getting average of calculated list haskell I have avgRatingsForDirector :: String -> [Film] -> [Int] avgRatingsForDirector _ [] = [] avgRatingsForDirector requestedDirector ((Film _ d...	Getting average of calculated list haskell Getting average of calculated list haskell fold haskell Getting Film Getting average of calculated list haskell I have This outputs a list of numbers, I want to have the result be the average of these numbers. is is possible to use the foldr function on the result somehow?	[ 0.007415771484375, -0.0194091796875, 0.00897216796875, -0.00848388671875, -0.031005859375, 0.01251220703125, 0.0146484375, 0.0113525390625, 0.0096435546875, -0.016357421875, 0.006011962890625, -0.005889892578125, -0.004119873046875, 0.003814697265625, -0.0269775390625, 0.00799560546875...	[ 210732, 83080, 111, 74481, 3674, 5303, 1556, 142508, 42822, 3847, 765, 3293, 140992, 101935, 3444, 16750, 186, 7722, 4527, 18344, 7569, 32354, 209303 ]	[ 0.1077880859375, 0.246826171875, 0.05767822265625, 0.146240234375, 0.063232421875, 0.20654296875, 0.108642578125, 0.230224609375, 0.178955078125, 0.1802978515625, 0.020263671875, 0.00835418701171875, 0.11346435546875, 0.078369140625, 0.0775146484375, 0.11175537109375, 0.0077514648437...	embed
22538113_c2	22538113	haskell	2	<> (manyTill anyChar (string "END PER:") >> space >> count 10 anyChar) <> (manyTill anyChar (string "BATCH:") >> space >> count 9 anyChar) <> (space >> string "CONTRIB:" >> space >> count 9 anyChar) <> (manyTill anyChar (string "QUOTE BACK:") >> space >> count 10 anyChar <* skipMany1 headers) <*> (manyTill line (t...	<> (manyTill anyChar (string "END PER:") >> space >> count 10 anyChar) <> (manyTill anyChar (string "BATCH:") >> space >> count 9 anyChar) <> (space >> string "CONTRIB:" >> space >> count 9 anyChar) <> (manyTill anyChar (string "QUOTE BACK:") >> space >> count 10 anyChar <* skipMany1 headers) <*> (manyTill line (t...	[ 0.000255584716796875, 0.01300048828125, 0.005706787109375, 0.048095703125, -0.027587890625, 0.01025390625, -0.0164794921875, -0.00994873046875, 0.01080322265625, -0.009765625, -0.020263671875, 0.00009775161743164062, 0.00008344650268554688, -0.0098876953125, -0.019287109375, 0.00503540...	[ 1639, 669, 53, 618, 5713, 2499, 84068, 91693, 39015, 8168, 12, 6396, 32628, 54529, 209, 75999, 16999, 483, 65421, 79315, 108369, 16625, 571, 232856, 8678, 20572, 21658, 12662, 418, 10336, 1314, 13315, 55547, 46568, 93232, 57616, 13416, 28864,...	[ 0.05804443359375, 0.112548828125, 0.1175537109375, 0.09228515625, 0.228271484375, 0.1435546875, 0.2030029296875, 0.1453857421875, 0.181640625, 0.216796875, 0.062255859375, 0.01995849609375, 0.1968994140625, 0.204345703125, 0.1669921875, 0.1339111328125, 0.0936279296875, 0.153442382...	embed
70681196_c0	70681196	haskell	0	Title: Deriving via ReaderT Problem title: Deriving via ReaderT Tags: deriving, derivingvia, haskell Problem: Deriving via ReaderT I'm writing the Monad instance for this type using ReaderT and deriving via newtype HIO a = HIO {runHIO :: Set HiPermission -> IO a} I've tried to do it this way newtype HIO a = HIO {runHIO...	Deriving via ReaderT Deriving via ReaderT deriving derivingvia haskell the Deriving ReaderT HIO Set HiPermission Functor Applicative Monad Couldn Deriving via ReaderT I'm writing the Monad instance for this type using ReaderT and deriving via I've tried to do it this way but got error: What am I doing wrong?	[ -0.0007476806640625, 0.00836181640625, 0.00131988525390625, 0.005035400390625, 0.0201416015625, -0.0283203125, -0.00140380859375, 0.004150390625, -0.00982666015625, -0.040771484375, -0.000827789306640625, -0.00140380859375, 0.0086669921875, 0.0064697265625, -0.0155029296875, -0.0263671...	[ 1310, 14, 6496, 1829, 122636, 618, 16406, 3459, 1556, 142508, 572, 17780, 19943, 2673, 15277, 21150, 28670, 18770, 5659, 11048, 60331, 71, 191147, 19, 32562, 110527, 10644, 17368, 37842, 903, 18499, 444, 87, 20594, 44691 ]	[ 0.09906005859375, 0.0684814453125, 0.11767578125, 0.156494140625, 0.254150390625, 0.2196044921875, 0.1522216796875, 0.1090087890625, 0.1177978515625, 0.2232666015625, 0.0933837890625, 0.16552734375, 0.1246337890625, 0.102783203125, 0.106201171875, 0.14453125, 0.078125, 0.0732421875...	embed
41536705_c0	41536705	haskell	0	Title: seq stops as soon as it reaches a constructor Problem title: seq stops as soon as it reaches a constructor Tags: haskell Problem: seq stops as soon as it reaches a constructor RWH explains that seq stops as soon as it reaches a constructor. case1 = 1:repeat undefined `seq` "OK" case2 = (undefined,undefined) `seq...	seq stops as soon as it reaches a constructor seq stops as soon as it reaches a constructor haskell case1 case2 seq stops as soon as it reaches a constructor RWH explains that seq stops as soon as it reaches a constructor. We have I understood why case1 function return "OK". But why the case2 function return "OK" too ?...	[ 0.01092529296875, 0.01129150390625, -0.016845703125, 0.0245361328125, 0.009521484375, 0.00653076171875, -0.0011749267578125, 0.017822265625, 0.01202392578125, -0.0235595703125, 0.0035552978515625, -0.0159912109375, 0.021728515625, 0.02197265625, 0.01202392578125, 0.00787353515625, 0....	[ 40, 864, 7279, 33662, 237, 58359, 64549, 748, 1556, 142508, 7225, 418, 304, 78691, 841, 73342, 7, 90, 217064, 15400, 32354, 30646, 9092, 19273, 31353, 297, 59437, 5983, 151575, 9232, 17932 ]	[ 0.156005859375, 0.2396240234375, 0.191162109375, 0.0943603515625, 0.008056640625, 0.178955078125, 0.1558837890625, 0.12841796875, 0.112060546875, 0.2044677734375, 0.1827392578125, 0.059112548828125, 0.1512451171875, 0.00341796875, 0.0237274169921875, 0.0010986328125, 0.05764770507812...	embed
54672381_c0	54672381	haskell	0	Title: How can I import an image in haskell? Problem title: How can I import an image in haskell? Tags: gloss, haskell, import, image Problem: How can I import an image in haskell? I'm a beginner in haskell and trying to make a game. Currently learning Gloss graphics. I wonder how I can import an BMP (JPG or PNG) image...	How can I import an image in haskell? How can I import an image in haskell? gloss haskell import image an image How FilePath Picture fish.bmp How can I import an image in haskell? I'm a beginner in haskell and trying to make a game. Currently learning Gloss graphics. I wonder how I can import an BMP (JPG or PNG) image ...	[ -0.002532958984375, -0.004150390625, 0.0002613067626953125, 0.03369140625, 0.0140380859375, 0.0308837890625, 0.01055908203125, -0.025146484375, 0.0014801025390625, -0.033447265625, 0.013916015625, -0.01556396484375, 0.000858306884765625, 0.0027313232421875, -0.00494384765625, 0.0009727...	[ 11249, 831, 24927, 142, 29569, 23, 1556, 142508, 87, 207244, 42724, 683, 10519, 158656, 67155, 275, 2676, 9842, 1679, 31577, 6712, 52080, 46173, 7, 48461, 32195, 3642, 335, 9088, 124906, 8066, 19659, 62816, 76615, 3444, 127887, 76896, 17780, ...	[ 0.0836181640625, 0.0772705078125, 0.277099609375, 0.0958251953125, 0.256103515625, 0.08905029296875, 0.17138671875, 0.25146484375, 0.01641845703125, 0.213623046875, 0.115234375, 0.045379638671875, 0.1231689453125, 0.166015625, 0.2236328125, 0.0161285400390625, 0.1800537109375, 0.03...	embed
62018158_c0	62018158	haskell	0	Title: String concatenation via ++ or <> Problem title: String concatenation via ++ or <> Tags: haskell Problem: String concatenation via ++ or <> I'm wondering whether there is a reason to use one over the other for string concatenation: λ> "foo" ++ "bar" "foobar" λ> "foo" <> "bar" "foobar" Operator ++ is ...	String concatenation via ++ or <> String concatenation via ++ or <> haskell GHC.Base Semigroup Text String concatenation via ++ or <> I'm wondering whether there is a reason to use one over the other for string concatenation: Operator ++ is defined as list concatenation while <> is an associative binary ope...	[ 0.0076904296875, -0.00921630859375, 0.0169677734375, 0.019775390625, -0.015380859375, 0.0113525390625, -0.006927490234375, 0.001739501953125, 0.000823974609375, -0.0023040771484375, 0.006988525390625, -0.0203857421875, 0.02197265625, 0.004241943359375, -0.003265380859375, -0.0039978027...	[ 23351, 214, 158, 4460, 33, 2320, 1829, 37223, 707, 5386, 1556, 142508, 527, 73265, 63473, 84420, 51588, 24129, 4426, 2740, 149016, 31635, 4527, 1632, 645, 3789, 79315, 150922, 61924, 5303, 166027, 2394, 6635, 39933, 36137, 5701, 502, 64, 22...	[ 0.189453125, 0.0863037109375, 0.0909423828125, 0.1385498046875, 0.1104736328125, 0.0235443115234375, 0.0849609375, 0.263427734375, 0.0059814453125, 0.0180206298828125, 0.07586669921875, 0.1982421875, 0.0673828125, 0.177734375, 0.109130859375, 0.1146240234375, 0.15771484375, 0.18359...	embed
6429047_c0	6429047	haskell	0	Title: How can Haskell read S-expressions from files? Problem title: How can Haskell read S-expressions from files? Tags: haskell Problem: How can Haskell read S-expressions from files? There are some source files, which are in S-expressions. Can Haskell read those s-expressions? I need those s-expressions as patterns ...	How can Haskell read S-expressions from files? How can Haskell read S-expressions from files? haskell files How Haskell S-expressions ArithBiOp Plus AInt oprand1 operand2 How can Haskell read S-expressions from files? There are some source files, which are in S-expressions. Can Haskell read those s-expressions? I need ...	[ 0.0003948211669921875, 0.0029754638671875, -0.009521484375, 0.00726318359375, -0.01611328125, 0.02001953125, -0.00653076171875, 0.013671875, -0.00421142578125, -0.0277099609375, 0.0196533203125, -0.0189208984375, -0.01007080078125, -0.01806640625, 0.0286865234375, -0.003997802734375, ...	[ 11249, 831, 20625, 142508, 12301, 159, 204629, 7, 1295, 102158, 1556, 9, 1172, 8962, 16882, 39029, 8183, 660, 233, 37214, 6264, 2208, 304, 31344, 4171, 91, 3871, 103510, 14858, 71924, 103391, 9384, 1528, 2053, 52895, 11435, 21162, 13315, 21...	[ 0.052764892578125, 0.0836181640625, 0.1307373046875, 0.2171630859375, 0.1793212890625, 0.1639404296875, 0.2249755859375, 0.0050048828125, 0.09991455078125, 0.1962890625, 0.097412109375, 0.01995849609375, 0.029022216796875, 0.07861328125, 0.12255859375, 0.1585693359375, 0.145141601562...	embed
14379185_c0	14379185	haskell	0	Title: Function privacy and unit testing Haskell Problem title: Function privacy and unit testing Haskell Tags: haskell, private-methods, unit-testing Problem: Function privacy and unit testing Haskell How do you deal with function visibility and unit testing in Haskell? If you export every function in a module so that...	Function privacy and unit testing Haskell Function privacy and unit testing Haskell haskell private-methods unit-testing Haskell LANGUAGE CPP SomeModule TESTING export1 export2 Function privacy and unit testing Haskell How do you deal with function visibility and unit testing in Haskell? If you export every function in...	[ 0.0126953125, 0.01397705078125, 0.0240478515625, -0.0030670166015625, 0.01055908203125, -0.018798828125, 0.01043701171875, -0.00762939453125, -0.0027923583984375, 0.0244140625, -0.011474609375, -0.01251220703125, -0.01177978515625, 0.0250244140625, -0.007080078125, 0.00933837890625, ...	[ 28670, 57137, 25072, 134234, 20625, 142508, 1556, 14375, 1928, 7352, 6954, 98064, 17487, 31384, 91616, 8782, 31273, 31255, 35142, 678, 32354, 108625, 939, 136, 11907, 88996, 109921, 17203, 10512, 159029, 5608, 959, 3835, 61687, 17569, 4904, 335...	[ 0.1004638671875, 0.184814453125, 0.18115234375, 0.2578125, 0.15234375, 0.2445068359375, 0.119140625, 0.1263427734375, 0.016998291015625, 0.069580078125, 0.185546875, 0.1285400390625, 0.198974609375, 0.05120849609375, 0.05908203125, 0.06072998046875, 0.183837890625, 0.2147216796875,...	embed
41133260_c0	41133260	haskell	0	Title: why can't pattern matching share where clauses? Problem title: why can't pattern matching share where clauses? Tags: haskell, pattern-matching, scope, syntax Problem: why can't pattern matching share where clauses? I wrote this and it does not compile import Data.Maybe func Nothing Nothing = func2 "hel...	why can't pattern matching share where clauses? why can't pattern matching share where clauses? haskell pattern-matching scope syntax Data.Maybe Nothing func2 test.hs:2:24 Variable Char Perhaps why can't pattern matching share where clauses? I wrote this and it does not compile I rewrote it by using guards an...	[ -0.00787353515625, 0.0146484375, -0.0057373046875, -0.0108642578125, -0.005645751953125, -0.00159454345703125, -0.01513671875, 0.01007080078125, 0.01068115234375, 0.000782012939453125, -0.0020751953125, -0.0003108978271484375, 0.00567626953125, -0.0120849609375, 0.029296875, 0.01416015...	[ 15400, 831, 3768, 18, 103510, 14858, 214, 12008, 7440, 70731, 90, 1556, 142508, 98753, 70820, 6002, 86531, 11809, 82419, 372, 182747, 7477, 304, 3034, 127, 25732, 84572, 21656, 181799, 14602, 959, 9969, 56050, 1884 ]	[ 0.12744140625, 0.13232421875, 0.04425048828125, 0.0958251953125, 0.24658203125, 0.2191162109375, 0.108154296875, 0.1729736328125, 0.173583984375, 0.199951171875, 0.0869140625, 0.11181640625, 0.177734375, 0.20947265625, 0.1278076171875, 0.008941650390625, 0.012359619140625, 0.044616...	embed
53562893_c0	53562893	haskell	0	Title: Unknown parse error from Haskell code for formating Text Problem title: Unknown parse error from Haskell code for formating Text Tags: haskell Problem: Unknown parse error from Haskell code for formating Text I want to use Haskell to format Text with giving Strings and length of the line. But keep getting a same...	Unknown parse error from Haskell code for formating Text Unknown parse error from Haskell code for formating Text haskell Haskell Unknown Text Format Flushleft Justify Flushright Help-function s:ls fi:se:ls se:ls Format.hs:13:14 Unknown parse error from Haskell code for formating Text I want to use Haskell to format Te...	[ 0.00274658203125, -0.01263427734375, 0.01458740234375, 0.00885009765625, -0.01177978515625, 0.0103759765625, 0.0211181640625, -0.0145263671875, -0.005401611328125, -0.007537841796875, -0.01025390625, -0.00994873046875, 0.0096435546875, -0.01165771484375, 0.01318359375, -0.0121459960937...	[ 992, 69723, 366, 184, 18499, 1295, 20625, 142508, 18151, 9384, 214, 24129, 1556, 60972, 36157, 7057, 2480, 9563, 40383, 1495, 54969, 39527, 137175, 91, 12, 8080, 809, 40, 127, 22618, 22635, 19, 3444, 4527, 68772, 23351, 5180, 140909, 13315,...	[ 0.03631591796875, 0.197021484375, 0.139404296875, 0.1151123046875, 0.19921875, 0.0296630859375, 0.1256103515625, 0.2274169921875, 0.147705078125, 0.186767578125, 0.0281219482421875, 0.17724609375, 0.09844970703125, 0.204345703125, 0.1572265625, 0.10064697265625, 0.14013671875, 0.11...	embed
28452203_c0	28452203	haskell	0	Title: Why Haskell list comprehension is faster than loop Problem title: Why Haskell list comprehension is faster than loop Tags: haskell Problem: Why Haskell list comprehension is faster than loop I'm a Haskell noob. And while experimenting with loops and list comprehensions I have discovered that list comprehension i...	Why Haskell list comprehension is faster than loop Why Haskell list comprehension is faster than loop haskell Why Haskell Why Haskell list comprehension is faster than loop I'm a Haskell noob. And while experimenting with loops and list comprehensions I have discovered that list comprehension is faster than a loop. Lis...	[ 0.000148773193359375, 0.01019287109375, 0.00005626678466796875, 0.0026397705078125, 0.01214599609375, 0.0198974609375, 0.000377655029296875, 0.010986328125, 0.027587890625, -0.01708984375, 0.01904296875, -0.01544189453125, 0.0018310546875, 0.01202392578125, 0.001434326171875, -0.001762...	[ 44084, 20625, 142508, 5303, 46683, 3220, 6889, 83, 4271, 56, 3501, 40956, 1556, 110, 3522, 28007, 134053, 1261, 7008, 4527, 78643, 21616, 7464 ]	[ 0.1060791015625, 0.14501953125, 0.2403564453125, 0.217529296875, 0.1754150390625, 0.18359375, 0.0654296875, 0.02801513671875, 0.1475830078125, 0.1219482421875, 0.0684814453125, 0.197509765625, 0.1319580078125, 0.000640869140625, 0.08447265625, 0.0782470703125, 0.060943603515625, 0....	embed
22504808_c0	22504808	haskell	0	Title: Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? Problem title: Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? Tags: unification, types, type-inference, haskell, functional-programming Problem: Why has "map (filter fst)" th...	Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? unification types type-inference haskell functional-programming Why Bool Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool...	[ 0.0189208984375, 0.004302978515625, -0.0020599365234375, 0.0167236328125, -0.00567626953125, 0.010498046875, 0.006988525390625, 0.000152587890625, 0.007476806640625, -0.0166015625, -0.00848388671875, -0.00946044921875, -0.0194091796875, 0.004608154296875, -0.01348876953125, 0.000410079...	[ 44084, 1556, 62346, 120337, 1238, 271, 10644, 12647, 929, 10, 5386, 110558, 51, 41274, 52895, 69988, 142508, 123309, 28966, 2460, 1065, 4, 33079, 31577, 28219, 15400, 32354, 11249, 831, 4488, 46312, 8110, 53299, 30646, 196707, 5117, 12830, 37...	[ 0.1461181640625, 0.07574462890625, 0.2030029296875, 0.211669921875, 0.0885009765625, 0.1292724609375, 0.1864013671875, 0.099853515625, 0.212890625, 0.129150390625, 0.0966796875, 0.019989013671875, 0.0716552734375, 0.07916259765625, 0.1212158203125, 0.07464599609375, 0.19384765625, ...	embed
42058823_c0	42058823	haskell	0	Title: Haskell Recursion Subsets Problem title: Haskell Recursion Subsets Tags: recursion, haskell Problem: Haskell Recursion Subsets i am new to Haskell. i am find it hard to understand the below subset program with recursion.what is the way it evaluates? subset :: [a] -> [[a]] subset [] = [[]] subset (x:xs) = [zs \| y...	Haskell Recursion Subsets Haskell Recursion Subsets recursion haskell Haskell Recursion Subsets x:xs x:ys Haskell Recursion Subsets i am new to Haskell. i am find it hard to understand the below subset program with recursion.what is the way it evaluates? output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]] When i manuall...	[ -0.01007080078125, 0.019775390625, 0.0185546875, 0.0137939453125, -0.0093994140625, 0.0076904296875, 0.0034637451171875, 0.00579833984375, 0.0263671875, 0.03515625, 0.0015869140625, -0.00872802734375, 0.01611328125, -0.00897216796875, -0.0028533935546875, -0.01397705078125, 0.0159912...	[ 20625, 142508, 165428, 42, 6889, 8273, 3509, 195625, 1830, 1556, 1022, 12, 425, 7, 4778, 3525, 7413, 7941, 28219, 35064, 1614, 1528, 678, 3917, 151575, 90, 140992, 110558, 25256, 39556, 133063, 54968, 96386, 155761, 23009, 166, 58838, 1257, ...	[ 0.135986328125, 0.206298828125, 0.1494140625, 0.15576171875, 0.09130859375, 0.1646728515625, 0.19140625, 0.2344970703125, 0.1385498046875, 0.1251220703125, 0.039276123046875, 0.003082275390625, 0.04681396484375, 0.0185699462890625, 0.089111328125, 0.054229736328125, 0.005706787109375...	embed
30251118_c0	30251118	haskell	0	Title: Haskell function that accepts function or value, then calls function or returns value Problem title: Haskell function that accepts function or value, then calls function or returns value Tags: functional-programming, haskell Problem: Haskell function that accepts function or value, then calls function or returns...	Haskell function that accepts function or value, then calls function or returns value Haskell function that accepts function or value, then calls function or returns value functional-programming haskell Haskell Haskell function that accepts function or value, then calls function or returns value How can I write a type ...	[ 0.00738525390625, 0.0012664794921875, -0.01153564453125, -0.000598907470703125, 0.00811767578125, 0.01348876953125, -0.0126953125, -0.021728515625, -0.00726318359375, -0.0145263671875, -0.0012664794921875, -0.0036468505859375, -0.02490234375, 0.006500244140625, 0.0133056640625, -0.0017...	[ 20625, 142508, 32354, 450, 26946, 7, 707, 34292, 7068, 11782, 30646, 123309, 28966, 1556, 11249, 831, 87, 33022, 10644, 21635, 136, 23, 51776, 40101, 86673, 68034, 110, 10750, 10, 34475, 14847, 86869, 2967, 11724, 1238, 420, 132, 19, 69112,...	[ 0.1561279296875, 0.24169921875, 0.214111328125, 0.0374755859375, 0.209716796875, 0.06591796875, 0.0811767578125, 0.1881103515625, 0.078857421875, 0.1845703125, 0.1851806640625, 0.1328125, 0.039764404296875, 0.103271484375, 0.01458740234375, 0.039031982421875, 0.009368896484375, 0.1...	embed
31052290_c0	31052290	haskell	0	Title: Remove HTML Tags in Haskell Problem title: Remove HTML Tags in Haskell Tags: haskell, html Problem: Remove HTML Tags in Haskell I have a string such as <b>Vitamin A</b><br>Chloe Braided Halter Swim Top, Using Text.HTML.TagSoup I am attempting to remove all html and just have "Vitamin Chloe ...	Remove HTML Tags in Haskell Remove HTML Tags in Haskell haskell html qualified Remove HTML Tags Haskell Vitamin Chloe Braided Halter Swim Top Text.HTML.TagSoup TS.parseTags TagText Remove HTML Tags in Haskell I have a string such as Using Text.HTML.TagSoup I am attempting to remove all html and just have using How can ...	[ 0.006561279296875, 0.021484375, 0.0025634765625, 0.0107421875, 0.00830078125, 0.01031494140625, 0.00125885009765625, -0.01708984375, -0.01275634765625, -0.030517578125, 0.00130462646484375, -0.01239013671875, -0.01953125, 0.0031890869140625, 0.005889892578125, 0.0062255859375, 0.0164...	[ 181139, 19097, 12298, 23, 20625, 142508, 1556, 7693, 217225, 37388, 226839, 6163, 532, 297, 4772, 720, 105432, 39, 4792, 24129, 127068, 66448, 8912, 2037, 53800, 2500, 4837, 174379, 79315, 81887, 87388, 756, 6, 17368, 831, 43613, 69141 ]	[ 0.1417236328125, 0.2481689453125, 0.2271728515625, 0.06597900390625, 0.1507568359375, 0.234130859375, 0.138427734375, 0.194091796875, 0.1881103515625, 0.18359375, 0.17236328125, 0.072021484375, 0.0228118896484375, 0.000579833984375, 0.1322021484375, 0.081298828125, 0.084716796875, ...	embed
35785176_c0	35785176	haskell	0	Title: Check whether a type is an instance of Show in Haskell at runtime? Problem title: Check whether a type is an instance of Show in Haskell at runtime? Tags: haskell Problem: Check whether a type is an instance of Show in Haskell at runtime? Suppose I have a simple data type in Haskell for storing a value: data V a...	Check whether a type is an instance of Show in Haskell at runtime? Check whether a type is an instance of Show in Haskell at runtime? haskell Check Show Haskell Some Error Check whether a type is an instance of Show in Haskell at runtime? Suppose I have a simple data type in Haskell for storing a value: I want to make ...	[ -0.010498046875, -0.005828857421875, 0.01025390625, 0.0098876953125, 0.0017547607421875, 0.01080322265625, -0.003204345703125, -0.01177978515625, 0.00067138671875, 0.00823974609375, -0.01318359375, -0.0272216796875, 0.00506591796875, 0.0120849609375, -0.00665283203125, 0.00479125976562...	[ 38679, 36766, 10644, 83, 110527, 17367, 23, 20625, 142508, 99, 11675, 6032, 142, 111, 1556, 31384, 212059, 10, 8781, 2053, 3082, 34292, 3444, 3249, 310, 211460, 7639, 856, 5608, 30646, 120262, 18499, 26008, 176377, 184, 11547, 6495, 7, 5809...	[ 0.1649169921875, 0.1053466796875, 0.23876953125, 0.0777587890625, 0.2451171875, 0.2958984375, 0.0784912109375, 0.1260986328125, 0.2236328125, 0.0704345703125, 0.0848388671875, 0.12451171875, 0.015533447265625, 0.034393310546875, 0.0989990234375, 0.0169677734375, 0.164794921875, 0.1...	embed
51971113_c0	51971113	haskell	0	Title: succ not getting removed on pred Problem title: succ not getting removed on pred Tags: prolog, replicate, successor-arithmetics, haskell, list Problem: succ not getting removed on pred /* Define a Prolog predicate replicate/3 which corresponds to * the Haskell function of the same name, except that the numeric *...	succ not getting removed on pred succ not getting removed on pred prolog replicate successor-arithmetics haskell list Define Prolog Haskell succ not getting removed on pred So far I've come to this solution: but the problem is that the s(s(s(0))) is not getting reduced by the pred function. it results into p(p(p(s(s(s(...	[ 0.0027313232421875, 0.0245361328125, -0.01019287109375, 0.04248046875, -0.02001953125, 0.0130615234375, -0.01446533203125, 0.00103759765625, 0.00982666015625, -0.03515625, 0.00909423828125, -0.00457763671875, -0.003082275390625, -0.00872802734375, 0.01251220703125, -0.0031585693359375,...	[ 166, 10060, 959, 20949, 184750, 98, 1653, 502, 4867, 143126, 39457, 42, 8962, 1556, 142508, 5303, 64552, 1250, 20625, 2060, 29806, 2967, 91, 132, 7, 177609, 34390, 32354, 50339, 915, 254, 2389, 167089, 5809, 51484, 4358 ]	[ 0.1904296875, 0.269287109375, 0.111083984375, 0.08709716796875, 0.1595458984375, 0.0828857421875, 0.2281494140625, 0.1148681640625, 0.21484375, 0.1390380859375, 0.1337890625, 0.037628173828125, 0.0458984375, 0.0943603515625, 0.2010498046875, 0.1224365234375, 0.09130859375, 0.126586...	embed
42596675_c0	42596675	haskell	0	Title: How do I declare new type with type constraints in Haskell? Problem title: How do I declare new type with type constraints in Haskell? Tags: haskell Problem: How do I declare new type with type constraints in Haskell? I’m tring to declare a new type Value as below: data Value m = Wrong \| Num Int \| Fun (Value -> ...	How do I declare new type with type constraints in Haskell? How do I declare new type with type constraints in Haskell? haskell How Haskell Value Wrong Num Fun Expecting Expected How do I declare new type with type constraints in Haskell? I’m tring to declare a new type Value as below: And GHCI complains: PS: I'm tryin...	[ -0.0120849609375, 0.0035858154296875, -0.0019683837890625, 0.01031494140625, -0.006561279296875, 0.00567626953125, -0.008056640625, -0.000019550323486328125, 0.000110626220703125, -0.001953125, -0.0035400390625, -0.056884765625, -0.00628662109375, -0.0140380859375, 0.0118408203125, 0.0...	[ 11249, 54, 87, 159978, 3525, 10644, 678, 158, 2816, 4288, 7, 20625, 142508, 23, 1556, 190060, 35133, 52782, 28670, 60075, 24762, 13, 1927, 449, 237, 35064, 41877, 17304, 186992, 29479, 18151, 3533, 3956, 123309, 56037 ]	[ 0.0496826171875, 0.037200927734375, 0.03375244140625, 0.20849609375, 0.1446533203125, 0.228515625, 0.1175537109375, 0.0982666015625, 0.1707763671875, 0.1348876953125, 0.0153656005859375, 0.1514892578125, 0.23974609375, 0.03594970703125, 0.11865234375, 0.16748046875, 0.1029052734375, ...	embed
48056655_c0	48056655	haskell	0	Title: Haskell: How is Num held? Problem title: Haskell: How is Num held? Tags: types, typeclass, haskell Problem: Haskell: How is Num held? In the following example: > let sum::Num a=> a->a->a; sum a b = a +b > let partialSum = sum 1 > partialSum 2.0 3.0 In step let partialSum = sum 1 it would appear that a is interpr...	Haskell: How is Num held? Haskell: How is Num held? types typeclass haskell Haskell How Num sum::Num Haskell: How is Num held? In the following example: In step let partialSum = sum 1 it would appear that a is interpreted as Integer but I suppose Haskell delays this until it can figure out the type (and consequently wh...	[ -0.00982666015625, -0.0140380859375, 0.0238037109375, 0.00994873046875, 0.003753662109375, 0.0264892578125, 0.017578125, -0.009033203125, 0.01226806640625, -0.0030975341796875, -0.0147705078125, -0.029541015625, 0.000644683837890625, -0.022705078125, 0.00225830078125, -0.0045166015625,...	[ 20625, 142508, 11249, 83, 52782, 34658, 52895, 10644, 67413, 1556, 10554, 839, 316, 12, 27781, 29954, 2633, 2878, 289, 294, 106, 108975, 10, 29481, 237, 44401, 8, 5259, 26366, 110527, 4527, 28271, 125195, 88303, 831, 20654, 16750, 7868, 107...	[ 0.136962890625, 0.2320556640625, 0.1400146484375, 0.09393310546875, 0.248046875, 0.21337890625, 0.1519775390625, 0.13623046875, 0.151611328125, 0.112548828125, 0.236083984375, 0.1011962890625, 0.1961669921875, 0.0242919921875, 0.0701904296875, 0.1094970703125, 0.120849609375, 0.114...	embed
30269097_c0	30269097	haskell	0	Title: defining an instance vs using class constraints Problem title: defining an instance vs using class constraints Tags: haskell Problem: defining an instance vs using class constraints I'm going through Learn You a Haskell and am on the chapter that discusses typeclasses. There is this snippet: class (Eq a) => Num ...	defining an instance vs using class constraints defining an instance vs using class constraints haskell class Num defining an instance vs using class constraints I'm going through Learn You a Haskell and am on the chapter that discusses typeclasses. There is this snippet: I understood this as a class constraint being i...	[ -0.0052490234375, 0.0028839111328125, 0.0179443359375, 0.0108642578125, 0.0145263671875, 0.0252685546875, -0.01177978515625, -0.013427734375, 0.00131988525390625, 0.01519775390625, -0.037841796875, -0.031494140625, 0.007537841796875, -0.01483154296875, -0.00372314453125, -0.00582885742...	[ 13204, 449, 142, 110527, 20209, 17368, 18507, 158, 2816, 4288, 1556, 142508, 52782, 134031, 2583, 20625, 10644, 67413, 217064, 903, 566, 144429, 100, 27992, 237, 28, 90065, 2886, 9655, 15400, 58954, 18, 29479, 297, 241, 864, 88606, 37202, 1...	[ 0.22802734375, 0.0865478515625, 0.089599609375, 0.30908203125, 0.148193359375, 0.1513671875, 0.2113037109375, 0.11572265625, 0.1851806640625, 0.16015625, 0.105712890625, 0.2010498046875, 0.279052734375, 0.0474853515625, 0.0194091796875, 0.0869140625, 0.1268310546875, 0.155639648437...	embed
18409900_c0	18409900	haskell	0	Title: output a value in Haskell, with a default in case its type is not an instance of Show Problem title: output a value in Haskell, with a default in case its type is not an instance of Show Tags: haskell, debugging Problem: output a value in Haskell, with a default in case its type is not an instance of Show I trie...	output a value in Haskell, with a default in case its type is not an instance of Show output a value in Haskell, with a default in case its type is not an instance of Show haskell debugging Haskell Show output a value in Haskell, with a default in case its type is not an instance of Show I tried to debug some Arrows an...	[ -0.00860595703125, 0.0047607421875, 0.017578125, 0.0159912109375, 0.007080078125, -0.005126953125, -0.019287109375, -0.028076171875, -0.001190185546875, 0.02685546875, -0.0157470703125, -0.019775390625, 0.02587890625, 0.006256103515625, -0.0018768310546875, 0.0036773681640625, -0.037...	[ 140992, 34292, 23, 20625, 142508, 678, 114977, 7225, 10644, 959, 110527, 17367, 10, 83, 1556, 8, 978, 37842, 85779, 1172, 15555, 7, 6183, 7941, 47593, 144851, 86171, 10750, 17475, 4527, 3917, 7639, 2174, 111, 36659, 109954 ]	[ 0.2005615234375, 0.1798095703125, 0.04046630859375, 0.1207275390625, 0.2379150390625, 0.007965087890625, 0.235107421875, 0.0595703125, 0.1661376953125, 0.1165771484375, 0.170166015625, 0.23486328125, 0.0233612060546875, 0.0238800048828125, 0.08953857421875, 0.0845947265625, 0.1394042...	embed
74068521_c0	74068521	haskell	0	Title: Unpacking tuples using "Either" in Haskell Problem title: Unpacking tuples using "Either" in Haskell Tags: haskell Problem: Unpacking tuples using "Either" in Haskell I'm trying to get a grip on how tuples work in Haskell. I came across this type constructor leftRight :: (Either a b -> c) -> ...	Unpacking tuples using "Either" in Haskell Unpacking tuples using "Either" in Haskell haskell Unpacking Either Haskell Unpacking tuples using "Either" in Haskell I'm trying to get a grip on how tuples work in Haskell. I came across this type constructor leftRight :: (Either a b -> c) -> (a -> c, b -...	[ 0.031005859375, 0.00125885009765625, 0.0036163330078125, 0.0098876953125, -0.0028228759765625, 0.01153564453125, -0.0179443359375, -0.0140380859375, 0.004638671875, -0.01483154296875, -0.01165771484375, -0.0244140625, -0.0028839111328125, 0.0205078125, -0.006256103515625, -0.0049743652...	[ 992, 29102, 370, 99726, 17368, 647, 14, 9319, 20625, 142508, 23, 1556, 4565, 40158, 4488, 10644, 64549, 748, 25737, 1052, 22553, 1984, 876, 33079, 501, 237875, 14602, 10, 26950, 40101, 190659, 47, 707, 140992, 83, 8705, 29459, 65450, 32354,...	[ 0.06927490234375, 0.1790771484375, 0.137939453125, 0.2401123046875, 0.0159759521484375, 0.032073974609375, 0.09332275390625, 0.23681640625, 0.112060546875, 0.2139892578125, 0.04315185546875, 0.057159423828125, 0.051422119140625, 0.0322265625, 0.0789794921875, 0.09075927734375, 0.125,...	embed
31888795_c0	31888795	haskell	0	Title: Haskell Top Level Functions Problem title: Haskell Top Level Functions Tags: haskell Problem: Haskell Top Level Functions I have a Haskell file open on the left side of my screen and ghci on the other half. I want to add functions to the file, save, and experiment with them in ghci. The problem is that I'm not t...	Haskell Top Level Functions Haskell Top Level Functions haskell Haskell Top Level Functions Haskell Top Level Functions I have a Haskell file open on the left side of my screen and ghci on the other half. I want to add functions to the file, save, and experiment with them in ghci. The problem is that I'm not totally su...	[ 0.027099609375, -0.01446533203125, 0.005462646484375, -0.01068115234375, -0.016357421875, 0.007354736328125, 0.01446533203125, 0.0011138916015625, 0.004425048828125, -0.03271484375, 0.0026092529296875, -0.034423828125, -0.018798828125, 0.0185546875, 0.00823974609375, -0.001861572265625...	[ 20625, 142508, 4792, 84136, 28670, 10763, 1556, 11435, 9803, 25737, 5609, 49119, 31380, 318, 23552, 3444, 15190, 32354, 30098, 28007, 2967, 112668, 9077, 3642, 159978, 2663, 17366, 3714, 2367, 621, 167375, 70820, 163504, 3917, 34759, 92558, 181...	[ 0.126708984375, 0.24609375, 0.1949462890625, 0.259765625, 0.2105712890625, 0.0882568359375, 0.129150390625, 0.15966796875, 0.1004638671875, 0.058624267578125, 0.049102783203125, 0.0643310546875, 0.10498046875, 0.14404296875, 0.0693359375, 0.060272216796875, 0.1571044921875, 0.25073...	embed
18232391_c0	18232391	haskell	0	Title: Customize errors handling in uu-parsinglib in Haskell Problem title: Customize errors handling in uu-parsinglib in Haskell Tags: parsing, uu-parsinglib, haskell, error-handling Problem: Customize errors handling in uu-parsinglib in Haskell Is it possible to: throw custom parser errors using uu-parsinglib in Hask...	Customize errors handling in uu-parsinglib in Haskell Customize errors handling in uu-parsinglib in Haskell parsing uu-parsinglib haskell error-handling Customize Haskell Customize errors handling in uu-parsinglib in Haskell Is it possible to: throw custom parser errors using uu-parsinglib in Haskell? (I want especiall...	[ 0.00133514404296875, 0.0216064453125, 0.0201416015625, 0.0019989013671875, -0.005279541015625, 0.023681640625, -0.005035400390625, -0.014404296875, -0.00457763671875, 0.0184326171875, 0.000629425048828125, -0.0220947265625, 0.0301513671875, 0.003204345703125, 0.01153564453125, -0.00191...	[ 130664, 20650, 18499, 7, 45064, 2051, 2500, 6953, 5612, 23, 20625, 142508, 366, 1556, 54885, 2071, 442, 7722, 47, 104250, 114122, 2189, 17368, 9, 3444, 41866, 28412, 26008, 19069, 4677, 178036, 13, 3917, 44116, 38937, 209303, 6226, 7440, 10...	[ 0.210205078125, 0.103759765625, 0.24560546875, 0.0379638671875, 0.1832275390625, 0.21826171875, 0.150146484375, 0.0894775390625, 0.1856689453125, 0.07550048828125, 0.1505126953125, 0.2498779296875, 0.1326904296875, 0.139892578125, 0.17333984375, 0.009246826171875, 0.01324462890625, ...	embed
40120940_c0	40120940	haskell	0	Title: Iterating through list in reverse Problem title: Iterating through list in reverse Tags: haskell Problem: Iterating through list in reverse Assume the following (non-functioning) code, that takes a predicate such as (==2) and a list of integers, and drops only the last element of the list that satisfies the pred...	Iterating through list in reverse Iterating through list in reverse haskell Iterating Bool as:a Iterating through list in reverse Assume the following (non-functioning) code, that takes a predicate such as (==2) and a list of integers, and drops only the last element of the list that satisfies the predicate: This code ...	[ -0.002716064453125, 0.018798828125, 0.00775146484375, 0.0045166015625, -0.0002002716064453125, 0.0302734375, 0.00909423828125, -0.007049560546875, 0.025390625, -0.0130615234375, -0.0005950927734375, 0.00970458984375, -0.0038604736328125, -0.028564453125, 0.007781982421875, 0.0004997253...	[ 87, 67, 98767, 8305, 5303, 23, 39531, 184, 1556, 142508, 2460, 929, 237, 66596, 25632, 6431, 137175, 214, 18151, 51776, 1653, 2063, 69112, 10461, 892, 26255, 36069, 4734, 4568, 12830, 40407, 14602, 959, 4488, 123019, 7, 53418, 17, 720, 27...	[ 0.109375, 0.21142578125, 0.2166748046875, 0.1982421875, 0.228759765625, 0.11767578125, 0.26318359375, 0.195068359375, 0.1575927734375, 0.2186279296875, 0.16455078125, 0.244384765625, 0.0975341796875, 0.0467529296875, 0.04010009765625, 0.0926513671875, 0.1142578125, 0.03097534179687...	embed
66622074_c0	66622074	haskell	0	Title: Restrict autocompletion with HLS and vscode Problem title: Restrict autocompletion with HLS and vscode Tags: haskell-language-server, visual-studio-code, haskell Problem: Restrict autocompletion with HLS and vscode Autocompletion in the Haskell Language Server (with VScode) gives suggestions before a single char...	Restrict autocompletion with HLS and vscode Restrict autocompletion with HLS and vscode haskell-language-server visual-studio-code haskell Restrict HLS Restrict autocompletion with HLS and vscode Autocompletion in the Haskell Language Server (with VScode) gives suggestions before a single character in the next word is ...	[ -0.0081787109375, -0.007659912109375, 0.003692626953125, 0.0022430419921875, -0.0029296875, 0.00176239013671875, 0.004486083984375, 0.00347900390625, -0.00086212158203125, 0.01300048828125, -0.006866455078125, 0.0029449462890625, 0.01470947265625, 0.00933837890625, -0.001373291015625, ...	[ 853, 144225, 1809, 277, 8705, 678, 572, 19759, 136, 20209, 40899, 1556, 142508, 196651, 39642, 21176, 52629, 4396, 20625, 83658, 22687, 44160, 76199, 157666, 8108, 11001, 62816, 11737, 2565, 10644, 17137, 6506, 15190, 27983, 351, 100033, 7986, ...	[ 0.041290283203125, 0.20849609375, 0.20556640625, 0.126708984375, 0.2122802734375, 0.05322265625, 0.1207275390625, 0.214111328125, 0.031463623046875, 0.13671875, 0.22021484375, 0.1343994140625, 0.212890625, 0.0965576171875, 0.09014892578125, 0.1441650390625, 0.1298828125, 0.17883300...	embed
6939043_c0	6939043	haskell	0	Title: Is it possible to place inequality constraints on haskell type variables? Problem title: Is it possible to place inequality constraints on haskell type variables? Tags: type-systems, type-inference, haskell Problem: Is it possible to place inequality constraints on haskell type variables? Is it possible to place...	Is it possible to place inequality constraints on haskell type variables? Is it possible to place inequality constraints on haskell type variables? type-systems type-inference haskell Is it possible to place inequality constraints on haskell type variables? Is it possible to place an inequality constraint on the typeva...	[ 0.0191650390625, -0.006561279296875, -0.00244140625, -0.009765625, -0.01153564453125, -0.01092529296875, -0.01806640625, -0.0142822265625, -0.0130615234375, 0, 0.0022430419921875, -0.011962890625, 0.00811767578125, -0.00098419189453125, 0.01611328125, 0.0093994140625, -0.0107421875, ...	[ 7722, 3687, 23, 13, 161789, 158, 2816, 4288, 98, 1556, 142508, 10644, 77336, 16751, 69988, 442, 7, 2071, 21690, 19736, 32354, 253, 21, 5775, 31, 1984, 6780, 876, 44357, 33079, 527, 73265, 14449, 54, 144681, 8951, 3917, 31380, 238, 5303, ...	[ 0.1566162109375, 0.116455078125, 0.10467529296875, 0.1136474609375, 0.2215576171875, 0.09344482421875, 0.192626953125, 0.155517578125, 0.053924560546875, 0.133544921875, 0.2196044921875, 0.1668701171875, 0.1951904296875, 0.06829833984375, 0.088134765625, 0.006988525390625, 0.05798339...	embed
58827023_c1	58827023	haskell	1	0, 0, 0,-20,-20]] adder::[[Int]] -> [[Int]] adder ((xa:xb:xc:xd:xe):(ya:yb:yc:yd:ye)) \| xc >= 10 = adder ((xb:xc:(xd+1):xe):((yb+1):(yc+1):(yd+1):ye)) \| otherwise = adder ((xb:xc:xd:xe):(yb:yc:yd:ye)) I also dont know how to apply xa : adder ... which we could do fairly easily if it was a single list. Any ideas how to ...	0, 0, 0,-20,-20]] adder::[[Int]] -> [[Int]] adder ((xa:xb:xc:xd:xe):(ya:yb:yc:yd:ye)) \| xc >= 10 = adder ((xb:xc:(xd+1):xe):((yb+1):(yc+1):(yd+1):ye)) \| otherwise = adder ((xb:xc:xd:xe):(yb:yc:yd:ye)) I also dont know how to apply xa : adder ... which we could do fairly easily if it was a single list. Any ideas how to ...	[ -0.0036163330078125, 0.005584716796875, -0.00579833984375, 0.01068115234375, -0.0302734375, 0.00167083740234375, -0.005157470703125, -0.00299072265625, 0.01239013671875, 0.0079345703125, 0.0264892578125, 0.0115966796875, 0.017578125, -0.01068115234375, -0.004913330078125, -0.0244140625...	[ 757, 11033, 86245, 606, 820, 12, 4153, 18, 33079, 60494, 3798, 425, 275, 238, 71, 4878, 395, 23811, 53, 11073, 1033, 1022, 977, 209, 2203, 21748, 120262, 13319, 3714, 3642, 59911, 2459, 152, 72546, 11001, 5303, 25647, 30022, 903, 18151, ...	[ 0.1236572265625, 0.173095703125, 0.06414794921875, 0.1497802734375, 0.2470703125, 0.0240325927734375, 0.0863037109375, 0.1087646484375, 0.0521240234375, 0.00048828125, 0.147216796875, 0.05914306640625, 0.06719970703125, 0.104736328125, 0.00665283203125, 0.1148681640625, 0.11340332031...	embed
10395761_c0	10395761	haskell	0	Title: Absolute value of negative zero - bug, or a part of the floating point standard? Problem title: Absolute value of negative zero - bug, or a part of the floating point standard? Tags: floating-point, haskell Problem: Absolute value of negative zero - bug, or a part of the floating point standard? I know that sign...	Absolute value of negative zero - bug, or a part of the floating point standard? Absolute value of negative zero - bug, or a part of the floating point standard? floating-point haskell Absolute Prelude Absolute value of negative zero - bug, or a part of the floating point standard? I know that signed zeros are used to ...	[ 0.0179443359375, -0.018798828125, 0.004547119140625, -0.0111083984375, -0.00677490234375, 0.0013427734375, 0.0284423828125, 0.007293701171875, -0.011474609375, 0.03173828125, -0.00518798828125, -0.010009765625, -0.00958251953125, 0.0052490234375, 0.0002956390380859375, -0.013916015625,...	[ 101397, 13, 34292, 111, 40907, 45234, 54608, 2831, 21917, 26518, 6275, 5570, 20, 38496, 1556, 142508, 1914, 822, 112, 707, 181141, 7, 11814, 157167, 1379, 118664, 1295, 24491, 101935, 41965, 54700, 18425, 12319, 89931, 99929, 5608, 186, 89678...	[ 0.1947021484375, 0.099365234375, 0.25390625, 0.07757568359375, 0.2578125, 0.286376953125, 0.257568359375, 0.122314453125, 0.160888671875, 0.0819091796875, 0.1209716796875, 0.18603515625, 0.05487060546875, 0.085205078125, 0.10650634765625, 0.2379150390625, 0.0899658203125, 0.1877441...	embed
34688983_c0	34688983	haskell	0	Title: More Descriptive Error Messages From GHC Problem title: More Descriptive Error Messages From GHC Tags: error-handling, ghci, haskell, indexing Problem: More Descriptive Error Messages From GHC I ran some code through GHCI, and got this error: *** Exception: Prelude.!!: index too large After a while I went on to ...	More Descriptive Error Messages From GHC More Descriptive Error Messages From GHC error-handling ghci haskell indexing More Descriptive Error Messages GHC Exception Prelude More Descriptive Error Messages From GHC I ran some code through GHCI, and got this error: After a while I went on to fix the bug (which was caused...	[ 0.0130615234375, 0.01214599609375, 0.005218505859375, 0.007568359375, 0.01263427734375, 0.0133056640625, -0.017333984375, -0.000835418701171875, -0.00225830078125, -0.01806640625, 0.01513671875, -0.046875, 0.0177001953125, 0.01495361328125, 0.02001953125, 0.0005340576171875, 0.029418...	[ 5455, 262, 32032, 5844, 212059, 48205, 28090, 527, 73265, 18499, 54885, 31380, 318, 1556, 142508, 63262, 63928, 1914, 822, 13028, 18151, 8305, 41877, 17304, 903, 12960, 30022, 54608, 143434, 13648, 28987, 390, 142, 450, 509, 5792, 21334, 3259...	[ 0.087646484375, 0.0721435546875, 0.160888671875, 0.0706787109375, 0.1326904296875, 0.05743408203125, 0.056304931640625, 0.091796875, 0.2117919921875, 0.1778564453125, 0.10211181640625, 0.125732421875, 0.1583251953125, 0.104736328125, 0.2110595703125, 0.235107421875, 0.09912109375, ...	embed
38167924_c0	38167924	haskell	0	Title: How to make LLVM-3.7 default on Raspberry Pi? Problem title: How to make LLVM-3.7 default on Raspberry Pi? Tags: haskell, raspbian, raspberry-pi, llvm Problem: How to make LLVM-3.7 default on Raspberry Pi? I'm on the default Raspbian OS and sudo apt-get install llvm seems to install llvm-3.5 with a bunch of soft...	How to make LLVM-3.7 default on Raspberry Pi? How to make LLVM-3.7 default on Raspberry Pi? haskell raspbian raspberry-pi llvm How LLVM-3.7 Raspberry llvm-3.5 llvm-link-3.5 How to make LLVM-3.7 default on Raspberry Pi? I'm on the default Raspbian OS and sudo apt-get install llvm seems to install llvm-3.5 with a bunch o...	[ 0.000244140625, 0.0162353515625, 0.01397705078125, 0.004150390625, -0.006317138671875, -0.0269775390625, -0.004608154296875, -0.02197265625, -0.0015716552734375, 0.013916015625, -0.00083160400390625, 0.0029296875, 0.00860595703125, 0.01953125, 0.006011962890625, 0.0032806396484375, 0...	[ 11249, 47, 3249, 99954, 47599, 9, 109981, 114977, 98, 225291, 3065, 1556, 142508, 61375, 62806, 53623, 1434, 96, 3723, 39, 72516, 10187, 22071, 254, 11787, 166, 246, 1747, 18, 3794, 20600, 10, 147306, 111, 32977, 22317, 5062, 6275, 214, 4...	[ 0.108642578125, 0.059814453125, 0.139404296875, 0.1636962890625, 0.312744140625, 0.061279296875, 0.313720703125, 0.288330078125, 0.09039306640625, 0.229248046875, 0.2308349609375, 0.088623046875, 0.2159423828125, 0.08551025390625, 0.181396484375, 0.1558837890625, 0.162841796875, 0....	embed
20765979_c0	20765979	haskell	0	Title: C++ equivalent of algebraic datatype? Problem title: C++ equivalent of algebraic datatype? Tags: haskell, c%2B%2B, algebraic-data-types Problem: C++ equivalent of algebraic datatype? Let's say I have this Haskell code: data RigidBody = RigidBody Vector3 Vector3 Float Shape -- position, velocity, mass and shape d...	C++ equivalent of algebraic datatype? C++ equivalent of algebraic datatype? haskell c%2B%2B algebraic-data-types RigidBody Vector3 Float Shape Ball ConvexPolygon Triangle Rigid_body glm::vec3 C++ equivalent of algebraic datatype? Let's say I have this Haskell code: What would be the best way to express this in C++? The...	[ 0.019287109375, 0.0277099609375, -0.0101318359375, 0.0311279296875, -0.00164794921875, 0.0263671875, -0.00628662109375, 0.004150390625, 0.00160980224609375, -0.0120849609375, 0.00537109375, -0.028076171875, -0.0032501220703125, 0.01470947265625, 0, 0.01141357421875, 0.0162353515625, ...	[ 313, 37223, 183234, 111, 144, 429, 2844, 1771, 2053, 50986, 1556, 142508, 501, 10135, 129956, 532, 12647, 1459, 2609, 18770, 363, 38699, 257, 7224, 1081, 21786, 1657, 272, 538, 6126, 4699, 109217, 37873, 39575, 39, 35259, 20625, 18151, 2965...	[ 0.0902099609375, 0.2919921875, 0.1812744140625, 0.0550537109375, 0.03692626953125, 0.0989990234375, 0.154296875, 0.068359375, 0.1322021484375, 0.2481689453125, 0.1221923828125, 0.2353515625, 0.0537109375, 0.126220703125, 0.1279296875, 0.128173828125, 0.1126708984375, 0.029113769531...	embed
71110804_c0	71110804	haskell	0	Title: Removed item from a list comes back Problem title: Removed item from a list comes back Tags: haskell, io, loops, monads Problem: Removed item from a list comes back I want to remove an item from a list, but it comes back. main = do let y = ["aa","bb","cc","dd","ee","ff"] let n = length y replicateM_ (n-1) (delet...	Removed item from a list comes back Removed item from a list comes back haskell io loops monads a Removed replicateM_ n-1 Write new_y Main Removed item from a list comes back I want to remove an item from a list, but it comes back. Output: I want that the "aa" and "bb" stay removed and not come back into the list.	[ -0.024658203125, 0.0164794921875, -0.010498046875, 0.0233154296875, -0.0031890869140625, 0.01226806640625, 0.0234375, 0.007415771484375, 0.0106201171875, -0.0113525390625, 0.0220947265625, -0.0074462890625, -0.00173187255859375, 0.00469970703125, 0.007659912109375, 0.003082275390625, ...	[ 181139, 71, 35735, 1295, 10, 5303, 32497, 4420, 1556, 142508, 22995, 40956, 2667, 712, 143126, 67, 594, 454, 653, 5759, 18781, 3525, 53, 12321, 3444, 47, 87388, 1284, 442, 13538, 7077, 87, 450, 70, 11, 136, 5125, 24765, 184750, 959, 138...	[ 0.224365234375, 0.1151123046875, 0.1986083984375, 0.1563720703125, 0.059295654296875, 0.2117919921875, 0.162841796875, 0.255126953125, 0.1358642578125, 0.2137451171875, 0.1903076171875, 0.167724609375, 0.09271240234375, 0.10302734375, 0.2012939453125, 0.04083251953125, 0.067077636718...	embed
8163247_c0	8163247	haskell	0	Title: How can I use other fonts in Glut - Fungen - Haskell Problem title: How can I use other fonts in Glut - Fungen - Haskell Tags: haskell, glut, bitmap-fonts Problem: How can I use other fonts in Glut - Fungen - Haskell I'm using the Fungen framework for Haskell and there is a function that uses BitmapFonts. The th...	How can I use other fonts in Glut - Fungen - Haskell How can I use other fonts in Glut - Fungen - Haskell haskell glut bitmap-fonts How Glut Fungen Haskell How can I use other fonts in Glut - Fungen - Haskell I'm using the Fungen framework for Haskell and there is a function that uses BitmapFonts. The thing is, that th...	[ 0, 0.006072998046875, -0.030517578125, -0.004669189453125, 0.007659912109375, -0.01708984375, 0.00024318695068359375, -0.0142822265625, -0.003570556640625, 0.00579833984375, -0.002838134765625, -0.041259765625, 0.01104736328125, -0.0036773681640625, 0.003326416015625, -0.0205078125, ...	[ 11249, 831, 4527, 3789, 12401, 7, 23, 80488, 18, 563, 7462, 20625, 142508, 20, 1556, 167994, 4785, 62346, 75635, 170846, 32354, 27774, 27591, 16037, 4734, 143662, 2053, 919, 7934, 96746, 1019, 75358, 2681, 1126, 1837, 19114, 158271, 963, 23...	[ 0.036468505859375, 0.06671142578125, 0.1448974609375, 0.132080078125, 0.2152099609375, 0.033203125, 0.0355224609375, 0.18701171875, 0.138671875, 0.037322998046875, 0.1788330078125, 0.123291015625, 0.2374267578125, 0.002532958984375, 0.092529296875, 0.191650390625, 0.03851318359375, ...	embed
37120423_c0	37120423	haskell	0	Title: read::Int not working in Haskell in example Problem title: read::Int not working in Haskell in example Tags: haskell Problem: read::Int not working in Haskell in example Here is the problem. It looks simple yet main = do s <- getContents let list = map (read::Int) (words s) print list Couldn't match expected typ...	read::Int not working in Haskell in example read::Int not working in Haskell in example haskell read::Int Haskell Couldn Probable read::Int not working in Haskell in example Here is the problem. It looks simple yet The problem was that I thought :: is like casting and I have to put the return type. The solution was to ...	[ -0.0169677734375, -0.0078125, 0.0034027099609375, 0.004180908203125, -0.0213623046875, 0.01446533203125, 0.00006246566772460938, -0.0205078125, -0.00994873046875, -0.006591796875, 0.01397705078125, -0.05615234375, 0.0027618408203125, 0.0019378662109375, 0.0135498046875, -0.030517578125...	[ 12301, 12, 4153, 18, 959, 20697, 23, 20625, 142508, 27781, 1556, 191147, 1250, 275, 2967, 33342, 8781, 14373, 17569, 1984, 1884, 176050, 30646, 10644, 29806, 15190, 4393, 36663, 58745, 137175, 138256, 5967 ]	[ 0.219970703125, 0.03936767578125, 0.14453125, 0.1756591796875, 0.08837890625, 0.1475830078125, 0.0404052734375, 0.137939453125, 0.2161865234375, 0.2020263671875, 0.1107177734375, 0.0212554931640625, 0.040618896484375, 0.1019287109375, 0.0635986328125, 0.04119873046875, 0.006530761718...	embed
47170429_c0	47170429	haskell	0	Title: Adding corresponding values of Tuple in a list in Haskell Problem title: Adding corresponding values of Tuple in a list in Haskell Tags: tuples, list, haskell Problem: Adding corresponding values of Tuple in a list in Haskell I have a list for example: [(1,2),(3,4),(5,6)] and the function should return me the su...	Adding corresponding values of Tuple in a list in Haskell Adding corresponding values of Tuple in a list in Haskell tuples list haskell Adding Tuple Haskell Adding corresponding values of Tuple in a list in Haskell I have a list for example: [(1,2),(3,4),(5,6)] and the function should return me the sum of the correspon...	[ 0.004608154296875, 0.0028533935546875, 0.0123291015625, 0.021728515625, -0.0108642578125, 0.011474609375, -0.0262451171875, -0.00421142578125, 0.015869140625, -0.01202392578125, -0.00130462646484375, -0.00872802734375, 0.00238037109375, 0.0208740234375, -0.005859375, 0.01129150390625, ...	[ 62, 59725, 42518, 214, 142424, 1371, 8705, 5303, 20625, 142508, 23, 370, 99726, 1556, 87, 765, 27781, 133063, 82449, 104629, 32354, 5608, 30646, 163, 10554, 903, 23817, 55102, 3714, 3642, 3249, 15190, 1257, 11651, 19441, 63134, 20594, 2856, ...	[ 0.10986328125, 0.094482421875, 0.22021484375, 0.06982421875, 0.1910400390625, 0.1837158203125, 0.25634765625, 0.21826171875, 0.147216796875, 0.237548828125, 0.0537109375, 0.17626953125, 0.25830078125, 0.1397705078125, 0.006500244140625, 0.03253173828125, 0.0660400390625, 0.10632324...	embed
61189188_c0	61189188	haskell	0	Title: Reassignment in ghci Problem title: Reassignment in ghci Tags: haskell, ghci Problem: Reassignment in ghci Is it possible to reassign the same variable in ghci ? Of course this isn't possible in normal Haskell (at least without something like an IORef), but I was curious because the it variable in ghci that you ...	Reassignment in ghci Reassignment in ghci haskell ghci Reassignment Num Reassignment in ghci Is it possible to reassign the same variable in ghci ? Of course this isn't possible in normal Haskell (at least without something like an IORef), but I was curious because the it variable in ghci that you get by enabling the :...	[ -0.0162353515625, -0.004913330078125, 0.007781982421875, 0.0130615234375, 0.01202392578125, 0.0057373046875, -0.01544189453125, 0.016357421875, 0.01116943359375, -0.01251220703125, 0.0018157958984375, -0.0250244140625, -0.00007295608520507812, 0.006500244140625, 0.0179443359375, 0.0108...	[ 853, 162, 31304, 674, 31380, 318, 23, 1556, 142508, 52782, 442, 7722, 47, 456, 5701, 77336, 3638, 20625, 123435, 4240, 11, 79298, 152, 39, 35829, 225081, 16981, 191984, 2886, 959, 128239, 11737, 125195, 3917, 92154, 21543, 61799, 24, 4806, ...	[ 0.129638671875, 0.1346435546875, 0.239501953125, 0.0062255859375, 0.1361083984375, 0.2098388671875, 0.06597900390625, 0.1072998046875, 0.2249755859375, 0.154296875, 0.1300048828125, 0.14404296875, 0.036865234375, 0.1563720703125, 0.1302490234375, 0.252197265625, 0.0209808349609375, ...	embed
6322232_c0	6322232	haskell	0	Title: `Ord a =>` or `Num a =>` Problem title: `Ord a =>` or `Num a =>` Tags: types, haskell, function, list, type-signature Problem: `Ord a =>` or `Num a =>` I have the following functions: which (x:xs) = worker x xs worker x [] = x worker x (y:ys) \| x > y = worker y ys \| otherwise = worker x ys and am won...	`Ord a =>` or `Num a =>` `Ord a =>` or `Num a =>` types haskell function list type-signature Ord Num x:xs y:ys `Ord a =>` or `Num a =>` I have the following functions: and am wondering how I should define the types signatures of these above functions which and worker ? For Example, which of the following wa...	[ 0.006103515625, -0.0023345947265625, -0.0040283203125, -0.019775390625, -0.0068359375, 0.0086669921875, -0.00750732421875, -0.00008296966552734375, 0.017333984375, -0.00677490234375, -0.002655029296875, -0.03955078125, 0.007781982421875, -0.00726318359375, -0.0108642578125, -0.01367187...	[ 143045, 10, 2203, 5386, 707, 839, 316, 52895, 1556, 142508, 32354, 5303, 10644, 137432, 35379, 52782, 1022, 425, 113, 4778, 44357, 25632, 149016, 5608, 61924, 138256, 7, 36917, 3129, 136, 4488, 56, 48322, 2806, 186, 2965, 237, 100, 1984, ...	[ 0.2119140625, 0.181884765625, 0.0193023681640625, 0.1033935546875, 0.04248046875, 0.0772705078125, 0.1895751953125, 0.23583984375, 0.133544921875, 0.2059326171875, 0.17626953125, 0.1044921875, 0.240478515625, 0.1666259765625, 0.2198486328125, 0.2125244140625, 0.03704833984375, 0.04...	embed
10619678_c1	10619678	haskell	1	't figure out how to write the function bind so that it modifies the environment. My second thought was to use local : evalIf :: [LispVal] -> EvalM LispVal evalIf [test, consequent, alternate] = do result <- eval test local (bind "it" result) $ case (truthVal result) of True -> eval consequent False -> eval alternate B...	't figure out how to write the function bind so that it modifies the environment. My second thought was to use local : evalIf :: [LispVal] -> EvalM LispVal evalIf [test, consequent, alternate] = do result <- eval test local (bind "it" result) $ case (truthVal result) of True -> eval consequent False -> eval alternate B...	[ -0.03271484375, 0.01123046875, -0.005279541015625, -0.00007104873657226562, -0.004486083984375, -0.0017242431640625, 0.00518798828125, -0.00787353515625, 0.0098876953125, -0.01043701171875, -0.0028533935546875, 0.0225830078125, 0.0103759765625, 0.0126953125, 0.022705078125, 0.011840820...	[ 26366, 3642, 33022, 32354, 68557, 73197, 90, 65998, 17932, 17569, 4527, 4000, 28, 1405, 91306, 9506, 7008, 42272, 594, 1261, 6954, 210435, 75939, 54, 16750, 3034, 89817, 217, 3650, 7225, 75481, 87599, 22225, 3688, 27117, 10644, 357, 334, 12...	[ 0.05633544921875, 0.034759521484375, 0.1597900390625, 0.1978759765625, 0.28857421875, 0.227294921875, 0.09466552734375, 0.2203369140625, 0.0069580078125, 0.064453125, 0.0550537109375, 0.1220703125, 0.0264739990234375, 0.2071533203125, 0.161865234375, 0.073486328125, 0.082763671875, ...	embed
12187825_c0	12187825	haskell	0	Title: How to export function from haskell containing data types through FFI Problem title: How to export function from haskell containing data types through FFI Tags: ffi, haskell Problem: How to export function from haskell containing data types through FFI I am able to export simple haskell functions through FFI con...	How to export function from haskell containing data types through FFI How to export function from haskell containing data types through FFI ffi haskell haskell How FFI SomeType SomeOtherType How to export function from haskell containing data types through FFI I am able to export simple haskell functions through FFI co...	[ 0.025634765625, -0.002593994140625, -0.0106201171875, 0.0054931640625, -0.01123046875, 0.00201416015625, 0.0128173828125, 0.0023956298828125, 0.0023040771484375, -0.016845703125, 0.00787353515625, -0.04248046875, -0.0003223419189453125, 0.00897216796875, 0.0172119140625, -0.00601196289...	[ 11249, 47, 31255, 32354, 1295, 1556, 142508, 70541, 2053, 52895, 8305, 563, 22724, 24500, 31384, 196707, 9319, 19048, 8781, 5570, 3714, 3642, 51776, 10644, 3789, 3501, 831, 54, 8912, 282, 64113, 144573, 60525, 27781 ]	[ 0.0574951171875, 0.038330078125, 0.256591796875, 0.22900390625, 0.115966796875, 0.144287109375, 0.2379150390625, 0.1044921875, 0.10064697265625, 0.195068359375, 0.0626220703125, 0.123046875, 0.2509765625, 0.2021484375, 0.03515625, 0.19677734375, 0.02880859375, 0.019683837890625, ...	embed
40585781_c0	40585781	haskell	0	Title: How do I get the terminal size? Problem title: How do I get the terminal size? Tags: terminal, haskell, environment-variables Problem: How do I get the terminal size? In bash there are two environmental variables: COLUMNS and LINES that store the number of columns and rows for the terminal. I have been trying to...	How do I get the terminal size? How do I get the terminal size? terminal haskell environment-variables How COLUMNS LINES How do I get the terminal size? In bash there are two environmental variables: COLUMNS and LINES that store the number of columns and rows for the terminal. I have been trying to obtain that informat...	[ 0.0152587890625, -0.00787353515625, -0.005584716796875, 0.01348876953125, -0.0002651214599609375, -0.005157470703125, 0.01904296875, -0.007781982421875, -0.008056640625, -0.0126953125, 0.006439208984375, -0.00201416015625, -0.0181884765625, 0.006805419921875, -0.002349853515625, 0.0191...	[ 11249, 2046, 70, 33949, 13267, 87, 1556, 142508, 65998, 21690, 19736, 8244, 80134, 22479, 130028, 294, 54, 360, 87109, 6626, 156444, 77336, 136, 4343, 14012, 3365, 316, 15555, 100, 113054, 4677, 20625, 21922, 53, 11675, 6032, 74481, 114977, ...	[ 0.0682373046875, 0.14599609375, 0.1092529296875, 0.2998046875, 0.253173828125, 0.02398681640625, 0.135009765625, 0.2412109375, 0.134033203125, 0.0999755859375, 0.014007568359375, 0.046295166015625, 0.1656494140625, 0.1002197265625, 0.19775390625, 0.0253143310546875, 0.03167724609375,...	embed
26435042_c0	26435042	haskell	0	Title: Haskell - How do filter and head work in combination with where? Problem title: Haskell - How do filter and head work in combination with where? Tags: haskell Problem: Haskell - How do filter and head work in combination with where? Here's the code. largestDivisible :: (Integral a) => a largestDivisible = head (...	Haskell - How do filter and head work in combination with where? Haskell - How do filter and head work in combination with where? haskell Haskell How Integral Haskell - How do filter and head work in combination with where? Here's the code. I am little bit confused. What is p in this case? Also, I do not understand the...	[ 0.00274658203125, 0.016357421875, -0.019287109375, -0.0096435546875, 0.01806640625, 0.0228271484375, 0.000621795654296875, -0.014892578125, 0.01025390625, -0.006988525390625, 0.02001953125, -0.0091552734375, 0.00921630859375, -0.01080322265625, -0.0054931640625, -0.01171875, 0.018798...	[ 20625, 142508, 11249, 46312, 136, 10336, 4488, 23, 162515, 678, 7440, 54, 1556, 204681, 18151, 10176, 55681, 4865, 83, 915, 7225, 959, 28219, 125195, 27781, 6626, 1022, 25737, 5609, 1632, 143420, 20653, 337, 31, 34677, 77947, 73342, 36917 ]	[ 0.14208984375, 0.24609375, 0.109619140625, 0.25341796875, 0.11376953125, 0.232666015625, 0.1429443359375, 0.040069580078125, 0.1806640625, 0.080810546875, 0.195556640625, 0.0230865478515625, 0.11865234375, 0.205810546875, 0.1005859375, 0.0213623046875, 0.05438232421875, 0.042541503...	embed
20622390_c0	20622390	haskell	0	Title: Is haskellmode-vim dead? Problem title: Is haskellmode-vim dead? Tags: haskell, haskell-mode, vim Problem: Is haskellmode-vim dead? I just disabled haskellmode-vim from my plugin configurations. Basically this was for three reasons: I prefer neocomplcache for my auto completion needs. Apparently it wasn't update...	Is haskellmode-vim dead? Is haskellmode-vim dead? haskell haskell-mode vim Is haskellmode-vim dead? I just disabled haskellmode-vim from my plugin configurations. Basically this was for three reasons: I prefer neocomplcache for my auto completion needs. Apparently it wasn't updated since 2010. It doesn't seem to be com...	[ 0.00167083740234375, 0.005218505859375, 0.0174560546875, -0.0029296875, -0.0006103515625, 0.0291748046875, -0.0174560546875, -0.00054168701171875, -0.004180908203125, -0.033447265625, -0.00189971923828125, -0.0108642578125, 0.0012054443359375, -0.005157470703125, -0.008056640625, -0.02...	[ 2071, 1556, 142508, 61170, 9, 29671, 103494, 32, 119916, 238335, 1295, 69993, 180346, 17262, 89397, 12601, 16169, 58875, 66218, 1430, 1809, 21721, 27117, 58954, 18, 150011, 16792, 15431, 146731, 678, 109524, 15673, 88203, 13380, 1239, 153837, 2...	[ 0.079833984375, 0.172607421875, 0.259033203125, 0.2435302734375, 0.0625, 0.28173828125, 0.20849609375, 0.0328369140625, 0.283203125, 0.1744384765625, 0.0243377685546875, 0.1983642578125, 0.16552734375, 0.0771484375, 0.011566162109375, 0.10986328125, 0.1671142578125, 0.1593017578125...	embed
72479926_c0	72479926	haskell	0	Title: Download file from URL with Haskell Problem title: Download file from URL with Haskell Tags: haskell Problem: Download file from URL with Haskell I want to download a file/zip archiv. (for example the new ubuntu iso, oe...) I came across following answer from daydaynatation in this: question downloadFile :: Stri...	Download file from URL with Haskell Download file from URL with Haskell haskell URL Download Haskell Download file from URL with Haskell I want to download a file/zip archiv. (for example the new ubuntu iso, oe...) I came across following answer from daydaynatation in this: question but sadly this downloads only the th...	[ -0.0244140625, 0.019775390625, 0.007354736328125, 0.021484375, 0.00775146484375, -0.004486083984375, -0.0174560546875, -0.00927734375, -0.01409912109375, -0.0252685546875, 0.004913330078125, -0.0341796875, -0.017578125, 0.0234375, -0.005035400390625, 0.00933837890625, 0.0024261474609...	[ 4857, 11435, 1295, 31862, 678, 20625, 142508, 1556, 3444, 47, 7026, 10, 64, 50836, 43878, 27781, 3525, 198996, 13882, 36, 13, 12399, 35166, 76, 22062, 9655, 17110, 903, 4734, 1764, 41, 1181, 40899, 959, 56136, 107013, 25002, 31842, 44126, ...	[ 0.1544189453125, 0.1483154296875, 0.1318359375, 0.2120361328125, 0.13330078125, 0.1676025390625, 0.26220703125, 0.1490478515625, 0.08203125, 0.029510498046875, 0.1685791015625, 0.004547119140625, 0.0271148681640625, 0.1458740234375, 0.189453125, 0.009918212890625, 0.03240966796875, ...	embed
55213250_c0	55213250	haskell	0	Title: Checking divisibility for Bool always results in false Problem title: Checking divisibility for Bool always results in false Tags: haskell Problem: Checking divisibility for Bool always results in false I'm trying to check for leap years, which are "years either divisible by 400 or divisible by 4 but not divisib...	Checking divisibility for Bool always results in false Checking divisibility for Bool always results in false haskell Checking Bool Checking divisibility for Bool always results in false I'm trying to check for leap years, which are "years either divisible by 400 or divisible by 4 but not divisible by 100." Removing on...	[ -0.012451171875, 0.005218505859375, -0.002349853515625, 0.0084228515625, 0.0181884765625, 0.00299072265625, -0.006805419921875, -0.0216064453125, 0.00457763671875, 0.033935546875, -0.006256103515625, 0.00064849853515625, 0.006683349609375, -0.005035400390625, -0.004791259765625, 0.0170...	[ 38679, 45, 37712, 83259, 100, 2460, 929, 11343, 50339, 98320, 1556, 142508, 23, 31577, 12765, 95, 2631, 5369, 46799, 99017, 390, 4082, 201, 1284, 959, 805, 432, 27289, 7464, 18, 30646, 29568, 8561, 70, 97, 34292, 370, 8705, 54529, 154732,...	[ 0.1539306640625, 0.10009765625, 0.1785888671875, 0.10693359375, 0.043182373046875, 0.1005859375, 0.2037353515625, 0.1265869140625, 0.076416015625, 0.216552734375, 0.106201171875, 0.194580078125, 0.006134033203125, 0.01849365234375, 0.1551513671875, 0.06298828125, 0.1168212890625, 0...	embed
11792586_c2	11792586	haskell	2	3] Compiling Scion.PersistentHoogle ( src\Scion\PersistentHoogle.hs, dist\build\scion-browser\scion-browser-tmp\Scion\PersistentHoogle.o )<br/> [21 of 23] Compiling Paths_scion_browser ( dist\build\autogen\Paths_scion_browser.hs, Code signals: MonadException, a, Error, Windows, Compiling, Scion.PersistentBrowser, Scion...	3] Compiling Scion.PersistentHoogle ( src\Scion\PersistentHoogle.hs, dist\build\scion-browser\scion-browser-tmp\Scion\PersistentHoogle.o )<br/> [21 of 23] Compiling Paths_scion_browser ( dist\build\autogen\Paths_scion_browser.hs, Code signals: MonadException, a, Error, Windows, Compiling, Scion.PersistentBrowser, Scion...	[ -0.00060272216796875, 0.0283203125, -0.00701904296875, -0.002960205078125, -0.0022735595703125, 0.028076171875, -0.004852294921875, -0.0087890625, -0.020263671875, 0.004669189453125, -0.005889892578125, 0.000499725341796875, 0.01409912109375, 0.0004024505615234375, 0.0029296875, -0.016...	[ 138, 268, 15612, 49725, 159, 6447, 5, 15277, 7, 6892, 18, 11193, 1663, 133, 19437, 294, 127, 271, 177149, 215725, 2676, 31, 3267, 3117, 1105, 108421, 45, 8913, 1409, 10519, 28864, 26073, 60331, 71, 19279, 63928, 10, 212059, 3773, 15555, ...	[ 0.107177734375, 0.015716552734375, 0.174072265625, 0.2120361328125, 0.0931396484375, 0.200439453125, 0.0176239013671875, 0.06549072265625, 0.1365966796875, 0.1783447265625, 0.09930419921875, 0.0975341796875, 0.1905517578125, 0.2122802734375, 0.0911865234375, 0.0399169921875, 0.130615...	embed

7681390_c1

7681390

haskell

1

was under the impression that I understood the preceding discussion and code until this point, but apparently I was mistaken. If someone could point out what's going awry - do I need a MonadPlus (ST a) instance or not? - it would be very helpful. [EDIT: Clarification] I should have pointed out that the authors appear ...

[ -0.006103515625, 0.01055908203125, 0.017333984375, -0.0029754638671875, 0.01165771484375, -0.01385498046875, 0.0145263671875, -0.0218505859375, 0.01190185546875, -0.0185546875, 0.003936767578125, -0.005218505859375, -0.002197265625, -0.0002002716064453125, 0.0279541015625, 0.0028991699...

[ 49128, 217064, 35107, 18151, 198371, 121742, 5809, 6275, 1810, 2367, 7730, 5429, 53, 3871, 10, 60331, 71, 88225, 8545, 110527, 98893, 320, 42179, 108975, 63043, 347, 80510, 143834, 83, 70, 95307, 32354, 3714, 149016, 134598, 3249, 17368, 2678...

[ 0.02197265625, 0.0794677734375, 0.033905029296875, 0.1195068359375, 0.02056884765625, 0.06951904296875, 0.000579833984375, 0.058624267578125, 0.01312255859375, 0.0032958984375, 0.07177734375, 0.0784912109375, 0.078857421875, 0.086181640625, 0.1776123046875, 0.1915283203125, 0.1479492...

embed

79363980_c0

79363980

haskell

0

Title: How to rearrange type parameter in Haskell instance definition? Problem title: How to rearrange type parameter in Haskell instance definition? Tags: haskell Problem: How to rearrange type parameter in Haskell instance definition? Suppose I have this type in Haskell data T a b = T a b This type T already fixed, a...

How to rearrange type parameter in Haskell instance definition? How to rearrange type parameter in Haskell instance definition? haskell How Haskell Functor How to rearrange type parameter in Haskell instance definition? Suppose I have this type in Haskell This type T already fixed, and can't be changed. No other Functo...

[ -0.0059814453125, -0.006103515625, 0.028564453125, 0.0152587890625, -0.0087890625, -0.0126953125, 0.0004425048828125, -0.01263427734375, 0.0037384033203125, 0.01544189453125, -0.001129150390625, -0.0181884765625, 0.006561279296875, 0.011962890625, -0.0130615234375, -0.02294921875, 0....

[ 11249, 456, 147, 94250, 10644, 171859, 20625, 142508, 110527, 80934, 47, 1556, 28670, 18770, 23, 121691, 765, 903, 384, 21771, 188347, 831, 18, 98816, 82424, 29479, 23468, 28282, 22288, 876, 35064, 3444, 7477, 208124, 15490, 3525, 50986, 7722...

[ 0.093017578125, 0.1436767578125, 0.152099609375, 0.2032470703125, 0.2452392578125, 0.2255859375, 0.150146484375, 0.22216796875, 0.210205078125, 0.157470703125, 0.0404052734375, 0.125732421875, 0.1346435546875, 0.1512451171875, 0.0087890625, 0.0399169921875, 0.01287841796875, 0.0365...

embed

8901252_c1

8901252

haskell

1

,11),22),((2,12),24),((3,0),0),((3,1),3),((3,2),6),((3,3),9),((3,4),12),((3,5),15),((3,6),18),((3,7),21),((3,8),24),((3,9),27),((3,10),30),((3,11),33),((3,12),36),((4,0),0),((4,1),4),((4,2),8),((4,3),12),((4,4),16),((4,5),20),((4,6),24),((4,7),28),((4,8),32),((4,9),36),((4,10),40),((4,11),44),((4,12),48),((5,0),0),((5,...

[ -0.0211181640625, -0.0017242431640625, -0.00408935546875, -0.0147705078125, 0.0203857421875, 0.0029449462890625, -0.0177001953125, 0.0130615234375, 0.01129150390625, 0.046630859375, 0.01470947265625, 0.0009918212890625, 0.00010204315185546875, -0.01422119140625, 0.01251220703125, 0.003...

[ 6, 4, 48105, 89647, 132, 54753, 55102, 82839, 128188, 247, 77495, 86827, 17727, 21320, 10461, 59690, 1126, 82449, 92714, 62155, 56641, 36076, 69072, 50490, 125157, 80847, 50258, 62946, 119959, 101807, 105801, 29557, 124093, 60978, 80389, 73419, ...

[ 0.1287841796875, 0.1363525390625, 0.25830078125, 0.269775390625, 0.105224609375, 0.1661376953125, 0.21484375, 0.2490234375, 0.281494140625, 0.136474609375, 0.2469482421875, 0.1888427734375, 0.1561279296875, 0.1929931640625, 0.144287109375, 0.20703125, 0.18994140625, 0.2235107421875...

embed

67689333_c1

67689333

haskell

1

[ -0.00799560546875, 0.00823974609375, -0.0027313232421875, 0.005279541015625, 0.00124359130859375, -0.004852294921875, -0.007568359375, -0.036376953125, 0.0247802734375, -0.038330078125, 0.0022430419921875, -0.015869140625, 0.018310546875, 0.00933837890625, -0.01251220703125, -0.0112304...

[ 5045, 1286, 434, 92, 19364, 20653, 4527, 3249, 46674, 48899, 187423, 11, 7136, 3650, 54, 808, 55292, 39, 34166, 3323, 618, 3525, 163612, 93170, 29062, 84420, 51588, 51139, 18, 83425, 30646, 3917, 33022, 903, 143726, 41816, 4935, 22321, 2223...

[ 0.0067138671875, 0.0171356201171875, 0.0181427001953125, 0.02655029296875, 0.05401611328125, 0.017791748046875, 0.06890869140625, 0.122314453125, 0.1331787109375, 0.2493896484375, 0.164794921875, 0.18310546875, 0.162353515625, 0.099853515625, 0.0207366943359375, 0.03314208984375, 0.1...

embed

61559102_c0

61559102

haskell

0

Title: What is the type keyword in Haskell Problem title: What is the type keyword in Haskell Tags: haskell Problem: What is the type keyword in Haskell Stumbled on the type keyword in Haskell: type Item = String but not sure what it does, how to use it or how it is different from data . The online google search has be...

What is the type keyword in Haskell What is the type keyword in Haskell haskell System.IO What Haskell Item Hello What is the type keyword in Haskell Stumbled on the type keyword in Haskell: but not sure what it does, how to use it or how it is different from data . The online google search has been of no help. I tried...

[ 0.0021820068359375, 0.01263427734375, 0.0126953125, 0.033935546875, 0.00518798828125, 0.017333984375, -0.00311279296875, 0.0191650390625, -0.01611328125, 0.0037078857421875, 0.003814697265625, -0.03515625, -0.013916015625, 0.01068115234375, -0.006195068359375, 0.0101318359375, 0.0130...

[ 4865, 70, 10644, 166117, 23, 20625, 142508, 83, 1556, 12353, 17780, 78426, 35378, 26085, 40099, 9077, 2367, 14602, 3642, 4527, 442, 12921, 1295, 2053, 1118, 26484, 33938, 4358, 29479, 18151, 18499, 332, 13579, 11814 ]

[ 0.060791015625, 0.055816650390625, 0.262939453125, 0.26171875, 0.0693359375, 0.1243896484375, 0.217529296875, 0.06610107421875, 0.1094970703125, 0.0765380859375, 0.1513671875, 0.134765625, 0.041656494140625, 0.0028076171875, 0.015380859375, 0.027252197265625, 0.053802490234375, 0.0...

embed

35473853_c0

35473853

haskell

0

Title: How to exit the "Main" status after Prelude(Haskell) loaded a module? Problem title: How to exit the "Main" status after Prelude(Haskell) loaded a module? Tags: haskell, load, program-entry-point, haskell-prelude Problem: How to exit the "Main" status after Prelude(Haskell) loaded a module? I...

How to exit the "Main" status after Prelude(Haskell) loaded a module? How to exit the "Main" status after Prelude(Haskell) loaded a module? haskell load program-entry-point haskell-prelude How Main Prelude Haskell How to exit the "Main" status after Prelude(Haskell) loaded a module? In Haskell, afte...

[ 0.0272216796875, 0.01123046875, 0.01055908203125, 0.03271484375, -0.0252685546875, 0.003753662109375, 0.01007080078125, -0.0115966796875, -0.01373291015625, -0.01953125, -0.01422119140625, -0.01531982421875, -0.00811767578125, -0.0107421875, 0.004150390625, -0.00799560546875, 0.00314...

[ 11249, 47, 82230, 168793, 10778, 7103, 1914, 822, 112, 6495, 7, 142508, 72367, 297, 88996, 1556, 1528, 33, 15123, 38496, 4692, 12321, 20625, 70, 17368, 102158, 105876, 186, 306, 90, 3714, 32354, 1380, 1295, 61924, 5361, 75101, 13315, 65998,...

[ 0.07623291015625, 0.08154296875, 0.2298583984375, 0.21533203125, 0.17626953125, 0.1356201171875, 0.1297607421875, 0.2161865234375, 0.1761474609375, 0.0908203125, 0.06689453125, 0.248046875, 0.1722412109375, 0.08251953125, 0.170166015625, 0.095458984375, 0.0570068359375, 0.016677856...

embed

45458087_c0

45458087

haskell

0

Title: Confuse about pure in applicative functor Problem title: Confuse about pure in applicative functor Tags: haskell Problem: Confuse about pure in applicative functor I have following example with pure function: Prelude> :t pure ((+1) 1) pure ((+1) 1) :: (Num a, Applicative f) => f a What is above the concrete type...

Confuse about pure in applicative functor Confuse about pure in applicative functor haskell Confuse Prelude Num Applicative Maybe Just Confuse about pure in applicative functor I have following example with pure function: What is above the concrete type of f wrapped a ? For example, the f (structure) is here Maybe: and...

[ 0.0162353515625, 0.00714111328125, 0.0072021484375, 0.0140380859375, 0.0120849609375, 0.0194091796875, 0.01483154296875, -0.00628662109375, -0.001495361328125, 0.00006866455078125, 0.004852294921875, -0.0283203125, -0.01446533203125, 0.022705078125, 0.01043701171875, 0.0000863075256347...

[ 106161, 4032, 1672, 34166, 23, 41816, 4935, 7477, 18770, 1556, 142508, 1914, 822, 52782, 5659, 11048, 83425, 25632, 27781, 32354, 36917, 122776, 10644, 1238, 137565, 20051, 10, 137656, 83, 3688, 45646, 111, 44084, 527, 73265, 14, 7639, 186351...

[ 0.14599609375, 0.1080322265625, 0.031829833984375, 0.2666015625, 0.06365966796875, 0.172119140625, 0.1051025390625, 0.111083984375, 0.121826171875, 0.1273193359375, 0.212158203125, 0.052978515625, 0.1251220703125, 0.144775390625, 0.1053466796875, 0.1092529296875, 0.08819580078125, ...

embed

46042545_c0

46042545

haskell

0

Title: Learning Haskell syntax Problem title: Learning Haskell syntax Tags: haskell, syntax Problem: Learning Haskell syntax I learn Haskell, but got stuck on one thing: add 0 = id add x = add(x-1) . (+1) This function adds one argument to another by adding 1 to the first argument and subtracting 1 from the second argu...

Learning Haskell syntax Learning Haskell syntax haskell syntax Learning Haskell x-1 Main Learning Haskell syntax I learn Haskell, but got stuck on one thing: This function adds one argument to another by adding 1 to the first argument and subtracting 1 from the second argument. But, I do not really understand how does ...

[ -0.001800537109375, 0.0225830078125, -0.0024566650390625, 0.016357421875, 0.00592041015625, 0.0252685546875, 0.009033203125, -0.01519775390625, 0.004791259765625, -0.03759765625, 0.007720947265625, -0.0194091796875, -0.0208740234375, 0.00933837890625, 0.010498046875, -0.0205078125, 0...

[ 114344, 20625, 142508, 6002, 86531, 1556, 1022, 5759, 12321, 30698, 179933, 3293, 32354, 15190, 7, 1632, 10750, 15700, 154107, 106, 5117, 1614, 39989, 17932, 959, 28219, 3642, 14602, 442, 4488, 73342, 92559, 33022, 116, 101935, 7103, 11, 4028...

[ 0.1400146484375, 0.13916015625, 0.230712890625, 0.11376953125, 0.126953125, 0.1151123046875, 0.08349609375, 0.166015625, 0.06341552734375, 0.0673828125, 0.096435546875, 0.03900146484375, 0.1693115234375, 0.1700439453125, 0.001373291015625, 0.06915283203125, 0.235107421875, 0.141723...

embed

5876095_c0

5876095

haskell

0

Title: Removing additional quotes from strings in Haskell Problem title: Removing additional quotes from strings in Haskell Tags: haskell, io, file, string, list Problem: Removing additional quotes from strings in Haskell hey on my file i have a line like this "Dave", "Zoe", "Amy", "Bill", "Ian", "Kevin", "Emma", "Sam"...

Removing additional quotes from strings in Haskell Removing additional quotes from strings in Haskell haskell io file string list strings Removing Haskell Dave Zoe Amy Bill Ian Kevin Emma Sam Megan Removing additional quotes from strings in Haskell hey on my file i have a line like this when handling it and hgetline to...

[ 0.0037841796875, 0.01507568359375, -0.00958251953125, 0.018310546875, -0.003265380859375, 0.00946044921875, 0.0028076171875, 0.00543212890625, 0.00011539459228515625, 0.0089111328125, -0.036376953125, -0.04150390625, -0.00811767578125, 0.0125732421875, -0.0111083984375, 0.017333984375,...

[ 853, 432, 78301, 66747, 7, 1295, 79315, 20625, 142508, 23, 1556, 22995, 11435, 5303, 103383, 5880, 117277, 19893, 104870, 57501, 51627, 3362, 26842, 19, 28192, 13315, 1884, 903, 45064, 1096, 3794, 2256, 15549, 47, 113660, 738, 171259, 45767, ...

[ 0.001617431640625, 0.1361083984375, 0.157958984375, 0.2548828125, 0.024566650390625, 0.079345703125, 0.2265625, 0.145263671875, 0.2440185546875, 0.005889892578125, 0.1280517578125, 0.1688232421875, 0.1279296875, 0.0943603515625, 0.1422119140625, 0.07366943359375, 0.09033203125, 0.0...

embed

59455253_c0

59455253

haskell

0

Title: How do I prove type-level list properties in haskell? Problem title: How do I prove type-level list properties in haskell? Tags: haskell, proof, types, type-level-computation Problem: How do I prove type-level list properties in haskell? I have these type families: type family xs ++ ys where '[] ++ ys = ys (x : ...

How do I prove type-level list properties in haskell? How do I prove type-level list properties in haskell? haskell proof types type-level-computation How Drop Length How do I prove type-level list properties in haskell? I have these type families: At some point, GHC wants a proof that I've used to shove that into cont...

[ 0.01708984375, 0.002410888671875, -0.004547119140625, 0.005523681640625, -0.0091552734375, -0.0155029296875, 0.002777099609375, -0.01031494140625, 0.0203857421875, 0.002227783203125, -0.01513671875, -0.01361083984375, 0.00787353515625, 0.006317138671875, -0.00677490234375, 0.0256347656...

[ 11249, 23534, 10644, 67919, 5303, 183871, 1556, 142508, 54, 87, 23, 98869, 52895, 7077, 130403, 77554, 927, 6097, 87143, 527, 73265, 86171, 272, 11814, 15756, 43701, 64549, 748, 57266, 32813 ]

[ 0.0684814453125, 0.2149658203125, 0.2061767578125, 0.219482421875, 0.175537109375, 0.1943359375, 0.130615234375, 0.2177734375, 0.044891357421875, 0.037933349609375, 0.0172882080078125, 0.164794921875, 0.182861328125, 0.017303466796875, 0.178466796875, 0.10626220703125, 0.039276123046...

embed

6274959_c2

6274959

haskell

2

, Temp, cairo-0.12.0808, cairo-0.12.0, Gtk2HsSetup.hs:2, Setup.hs, Cabal, DCABAL_VERSION_MINOR, x.0, Compiling, Gtk2HsSetup, cairo-0, Gtk2HsSetup.hs, Gtk2HsSetup.o, Main, cairo-0.12.08, Main.o, Linking, setup.exe, Configuring, Preprocessing, Building, Graphics.Rendering.Cairo.Matrix, Graphics, Rende, Cairo, Matrix.hs, ...

[ 0.005401611328125, 0.01007080078125, 0.0106201171875, -0.005615234375, 0.00750732421875, 0.007598876953125, -0.0159912109375, -0.00836181640625, -0.00153350830078125, 0.03857421875, -0.01226806640625, -0.021728515625, 0.0014495849609375, -0.007537841796875, -0.002227783203125, 0.029907...

[ 6, 4, 37446, 78968, 31, 9, 102014, 73011, 163736, 527, 31472, 304, 841, 7, 294, 126, 2037, 5, 127, 12, 19943, 30438, 289, 391, 13133, 94943, 33255, 118596, 84139, 24638, 1022, 2389, 15612, 49725, 23320, 12321, 15654, 8318, 12779, 214, 1...

[ 0.0858154296875, 0.09649658203125, 0.1971435546875, 0.2264404296875, 0.24658203125, 0.068115234375, 0.110107421875, 0.173828125, 0.191650390625, 0.013824462890625, 0.146728515625, 0.0965576171875, 0.09320068359375, 0.051910400390625, 0.008026123046875, 0.0960693359375, 0.109741210937...

embed

11551945_c1

11551945

haskell

1

Handler :: ResourceT IO Response notFoundHandler = return $ responseLBS status404 [("Content-Type", "text/plain")] "Not found" main :: IO () main = do BS.putStrLn $ "http://localhost:8080/" run 8080 $ app [Update: a working copy of this code is here: https://gist.github.com/3145317 ] Code signals: Network.Wai, Network....

[ -0.01422119140625, 0.020263671875, 0.01251220703125, -0.00836181640625, -0.00750732421875, -0.002685546875, 0.015869140625, -0.0224609375, 0.008544921875, -0.033203125, 0.0034027099609375, -0.00168609619140625, 0.00421142578125, -0.00147247314453125, 0.0213623046875, 0.00933837890625, ...

[ 10639, 603, 1984, 152055, 618, 17780, 92748, 959, 27591, 7030, 135679, 2203, 30646, 3650, 57553, 48097, 294, 10778, 2839, 617, 11935, 25352, 196707, 22829, 64, 7290, 122116, 14037, 5201, 54, 84145, 5, 7077, 71713, 866, 19, 5475, 98908, 4029...

[ 0.2457275390625, 0.251953125, 0.03619384765625, 0.260986328125, 0.2103271484375, 0.231689453125, 0.250732421875, 0.1864013671875, 0.182861328125, 0.162109375, 0.2471923828125, 0.0241851806640625, 0.14306640625, 0.113525390625, 0.20361328125, 0.09130859375, 0.0908203125, 0.174926757...

embed

40962891_c0

40962891

haskell

0

Title: Haskell - efficient equivalent for hash-based dictionary Problem title: Haskell - efficient equivalent for hash-based dictionary Tags: haskell, hashmap, dictionary Problem: Haskell - efficient equivalent for hash-based dictionary I would like to construct a couple of "dictionaries" in Haskell as part of a projec...

Haskell - efficient equivalent for hash-based dictionary Haskell - efficient equivalent for hash-based dictionary haskell hashmap dictionary Haskell Haskell - efficient equivalent for hash-based dictionary I would like to construct a couple of "dictionaries" in Haskell as part of a project I am working on. I was wonder...

[ -0.0036773681640625, 0.00408935546875, -0.00007343292236328125, 0.0019378662109375, 0.006683349609375, -0.004150390625, 0.005615234375, -0.0115966796875, -0.0096435546875, -0.0238037109375, 0.006805419921875, -0.0098876953125, 0.0062255859375, 0.00567626953125, 0.005401611328125, 0.011...

[ 20625, 142508, 93766, 183234, 1556, 127, 77007, 45, 10763, 256, 80425, 254, 6635, 2806, 1884, 64549, 24941, 61669, 32789, 10484, 23, 2831, 13452, 20697, 87, 149016, 2053, 45646, 4552, 24, 5844, 51515, 4527, 5303, 370, 99726, 92610, 32233, 2...

[ 0.157470703125, 0.266845703125, 0.2198486328125, 0.1739501953125, 0.169189453125, 0.1175537109375, 0.1324462890625, 0.08612060546875, 0.16552734375, 0.1259765625, 0.100830078125, 0.135009765625, 0.034149169921875, 0.0230560302734375, 0.0869140625, 0.1240234375, 0.0859375, 0.1262207...

embed

19249752_c0

19249752

haskell

0

Title: Haskell: Lazy download with Curl Problem title: Haskell: Lazy download with Curl Tags: curl, haskell, lazy-evaluation Problem: Haskell: Lazy download with Curl How to use laziness with this package or perhaps some other package and how to fix this code, so it won't download the whole file but just some first byt...

Haskell: Lazy download with Curl Haskell: Lazy download with Curl curl haskell lazy-evaluation qualified Network.Curl.Download.Lazy Haskell Lazy Curl Data.ByteString.Lazy Right www.haskell.org ghc-7.6.3-x86_64-unknown-linux.tar.bz2 B.take Haskell: Lazy download with Curl How to use laziness with this package or perhaps...

[ -0.01153564453125, 0.017578125, 0.0162353515625, 0.00799560546875, 0.01483154296875, -0.00323486328125, -0.0034942626953125, 0.0012054443359375, 0.0186767578125, -0.0267333984375, -0.0019073486328125, -0.0296630859375, -0.0014801025390625, 0.0203857421875, 0.00958251953125, -0.00698852...

[ 20625, 142508, 12, 239, 3285, 7026, 678, 17065, 141, 9709, 1556, 21, 159258, 217225, 28997, 25002, 144786, 2729, 11809, 75358, 67, 71713, 90911, 10557, 1478, 31380, 238, 16709, 200768, 15276, 13307, 309, 69723, 2397, 6077, 867, 169, 335, 78...

[ 0.1527099609375, 0.26611328125, 0.039642333984375, 0.1885986328125, 0.24072265625, 0.2021484375, 0.0960693359375, 0.1600341796875, 0.1722412109375, 0.12939453125, 0.120361328125, 0.1768798828125, 0.1617431640625, 0.159912109375, 0.0947265625, 0.171142578125, 0.149658203125, 0.16845...

embed

46397583_c0

46397583

haskell

0

Title: Haskell pattern matching on a function result Problem title: Haskell pattern matching on a function result Tags: haskell Problem: Haskell pattern matching on a function result I have an algebraic data type like: data Toll = Vok Int Bool | Bok Int | Cokd String Char and another function getVal :: Int -> Toll getV...

Haskell pattern matching on a function result Haskell pattern matching on a function result haskell Haskell Toll Vok Bool Bok Cokd Char Haskell pattern matching on a function result I have an algebraic data type like: and another function I want to call getVal in some function and extract the arguments of Cokd (if the ...

[ 0.00130462646484375, 0.001220703125, 0.0262451171875, 0.0024566650390625, 0.024658203125, -0.00921630859375, -0.01953125, 0.004669189453125, -0.002716064453125, -0.01312255859375, 0.0089111328125, -0.0279541015625, -0.0228271484375, -0.00469970703125, 0.0078125, -0.008544921875, 0.01...

[ 20625, 142508, 103510, 14858, 214, 98, 32354, 16750, 1556, 156105, 310, 685, 2460, 929, 27794, 1311, 92, 71, 21656, 429, 2844, 1771, 2053, 10644, 3444, 11782, 2046, 42272, 125663, 10750, 35166, 831, 1884, 53418, 4527, 2667, 712, 7 ]

[ 0.1328125, 0.2412109375, 0.2200927734375, 0.1953125, 0.080810546875, 0.073974609375, 0.1485595703125, 0.1580810546875, 0.1231689453125, 0.198486328125, 0.11669921875, 0.1412353515625, 0.0445556640625, 0.1180419921875, 0.1387939453125, 0.10302734375, 0.1103515625, 0.166015625, 0.1...

embed

49103372_c0

49103372

haskell

0

Title: Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] Problem title: Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] Tags: functor, functional-programming, haskell Problem: Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] I understan...

Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] functor functional-programming haskell Confused Just Confused about (fmap length Just) [1,1,1,1] vs. fmap length $ Just [1,1,1,1] I understand that the parens force a...

[ 0.0101318359375, 0.01190185546875, -0.005859375, 0.0135498046875, -0.0024871826171875, 0.0169677734375, 0.021484375, 0.01043701171875, -0.00005412101745605469, -0.0322265625, -0.007476806640625, -0.00811767578125, -0.0096435546875, 0.023193359375, 0.0169677734375, -0.0184326171875, 0...

[ 106161, 33740, 1672, 420, 62346, 140909, 9563, 68252, 418, 76172, 20209, 1238, 3650, 7477, 18770, 123309, 28966, 1556, 142508, 4, 28219, 366, 1755, 37772, 12921, 12989, 111, 41018, 18, 32233, 5117, 16750, 25632, 15787, 10422, 177691, 32354, 6...

[ 0.1201171875, 0.070556640625, 0.002777099609375, 0.1182861328125, 0.2205810546875, 0.211669921875, 0.28515625, 0.058441162109375, 0.05859375, 0.09930419921875, 0.1318359375, 0.12939453125, 0.010772705078125, 0.0777587890625, 0.0858154296875, 0.112548828125, 0.085205078125, 0.134399...

embed

9931410_c0

9931410

haskell

0

Title: Haskell: which SOAP client lib to use? Problem title: Haskell: which SOAP client lib to use? Tags: soap, haskell Problem: Haskell: which SOAP client lib to use? I'd like to write s simple Haskell program that connects to a SOAP service. Ideally I'd like to use the service's WSDL and get as straightforward access...

Haskell: which SOAP client lib to use? Haskell: which SOAP client lib to use? soap haskell Haskell SOAP Haskell: which SOAP client lib to use? I'd like to write s simple Haskell program that connects to a SOAP service. Ideally I'd like to use the service's WSDL and get as straightforward access to the request parameter...

[ 0.00079345703125, 0.01470947265625, 0.0205078125, 0.02001953125, 0.0133056640625, -0.004791259765625, -0.0264892578125, 0.0086669921875, -0.000362396240234375, 0.00836181640625, -0.000125885009765625, -0.01708984375, 0.00567626953125, -0.00823974609375, -0.0019683837890625, -0.02429199...

[ 20625, 142508, 3129, 15969, 15383, 23282, 25474, 47, 4527, 12, 221, 2631, 1556, 1884, 33022, 8781, 1528, 37067, 4516, 41143, 52143, 27502, 80560, 17203, 50336, 171859, 57553, 2053, 35773, 4734, 14037, 11666, 81699, 118066, 168698, 65942, 7108, ...

[ 0.13623046875, 0.2169189453125, 0.058807373046875, 0.17578125, 0.243408203125, 0.225341796875, 0.2283935546875, 0.038360595703125, 0.136474609375, 0.0086669921875, 0.1680908203125, 0.2105712890625, 0.104736328125, 0.05621337890625, 0.06903076171875, 0.0936279296875, 0.119384765625, ...

embed

25491037_c0

25491037

haskell

0

Title: Prelude.read: no parse for derived instance of Read Problem title: Prelude.read: no parse for derived instance of Read Tags: haskell Problem: Prelude.read: no parse for derived instance of Read I receive the error *** Exception: Prelude.read: no parse when I run read $ show $ Vector3 1 2 3 (Note that show Vector...

Prelude.read: no parse for derived instance of Read Prelude.read: no parse for derived instance of Read haskell Prelude.read Read Exception Vector3 v3x v3y v3z LANGUAGE StandaloneDeriving Prelude.read: no parse for derived instance of Read I receive the error when I run (Note that show Vector3 1 2 3 returns "Vector3 {v...

[ -0.00830078125, 0.0159912109375, -0.0022735595703125, 0.0111083984375, 0.018798828125, 0.0250244140625, 0.0194091796875, -0.0245361328125, -0.00038909912109375, -0.02490234375, 0.00457763671875, -0.01953125, -0.001373291015625, -0.0146484375, -0.013916015625, -0.028076171875, -0.0206...

[ 1914, 822, 112, 39116, 110, 366, 184, 100, 16406, 4126, 110527, 4764, 1556, 142508, 5443, 63928, 2609, 18770, 363, 81, 425, 53, 169, 98064, 32487, 51684, 47731, 14, 6496, 53299, 18499, 11675, 7639, 116, 138, 30646, 26455, 334, 53855, 1665...

[ 0.08953857421875, 0.171875, 0.1324462890625, 0.2568359375, 0.1119384765625, 0.205810546875, 0.1812744140625, 0.0634765625, 0.1575927734375, 0.110107421875, 0.2049560546875, 0.281982421875, 0.0843505859375, 0.1788330078125, 0.0130615234375, 0.0950927734375, 0.1767578125, 0.185302734...

embed

29127410_c0

29127410

haskell

0

Title: Test a function with different list of value with quickCheck Problem title: Test a function with different list of value with quickCheck Tags: quickcheck, haskell Problem: Test a function with different list of value with quickCheck I need to test a function with quickCheck with different range of values. my fun...

Test a function with different list of value with quickCheck Test a function with different list of value with quickCheck quickcheck haskell Test prop_test Test a function with different list of value with quickCheck I need to test a function with quickCheck with different range of values. my function is : and I would ...

[ -0.0103759765625, -0.0115966796875, 0.0081787109375, -0.01171875, -0.00141143798828125, -0.004852294921875, -0.003204345703125, -0.0137939453125, 0.0269775390625, 0.01031494140625, 0.0125732421875, 0.0206298828125, 0.0189208984375, -0.006500244140625, 0.003448486328125, 0.01318359375, ...

[ 8647, 32354, 678, 12921, 5303, 34292, 63773, 202567, 10, 111, 78292, 1556, 142508, 25793, 6954, 3871, 3034, 37457, 142424, 2806, 1884, 51339, 109921, 1022, 53, 169, 96759, 39958, 757, 47, 4382, 17, 170, 92, 209, 28568, 22483, 334, 188347, ...

[ 0.225341796875, 0.2293701171875, 0.0718994140625, 0.2022705078125, 0.1741943359375, 0.170166015625, 0.1572265625, 0.29345703125, 0.00848388671875, 0.04541015625, 0.235595703125, 0.098388671875, 0.1966552734375, 0.2005615234375, 0.2261962890625, 0.06243896484375, 0.2154541015625, 0....

embed

29423483_c0

29423483

haskell

0

Title: List lazy evaluation in Haskell Problem title: List lazy evaluation in Haskell Tags: haskell, lazy-evaluation Problem: List lazy evaluation in Haskell I made simple assumptions below to understand list lazy evaluation in Haskell, head [1, 2] -- expr1 head [1 .. 2] -- expr2 head [1 ..] -- expr3 head . (1 :) $ [] ...

List lazy evaluation in Haskell List lazy evaluation in Haskell haskell lazy-evaluation List Haskell expr1 expr2 expr3 eval1 eval2 List lazy evaluation in Haskell I made simple assumptions below to understand list lazy evaluation in Haskell, I suppose that expr3 would be lazily evaluated like eval1 , how about expr1 an...

[ -0.005828857421875, -0.005706787109375, 0.01068115234375, 0.003662109375, 0.00933837890625, 0.01141357421875, 0.000553131103515625, 0.0098876953125, 0.0157470703125, 0.0059814453125, -0.01153564453125, -0.0032501220703125, 0.0120849609375, 0.0185546875, -0.003265380859375, 0.0096435546...

[ 32036, 21, 3285, 219836, 20625, 142508, 1556, 159258, 14700, 42, 418, 304, 363, 28, 1405, 237259, 28219, 5303, 708, 151575, 1884, 61353, 15044, 9969, 1340, 11675, 1733, 2804, 4127, 227066, 1284, 7941, 31635, 32628, 27140, 1528, 62775 ]

[ 0.1995849609375, 0.1376953125, 0.208740234375, 0.2156982421875, 0.1214599609375, 0.226318359375, 0.09222412109375, 0.1810302734375, 0.0908203125, 0.10504150390625, 0.03863525390625, 0.08721923828125, 0.1512451171875, 0.015838623046875, 0.1689453125, 0.04254150390625, 0.0341796875, ...

embed

65616821_c1

65616821

haskell

1

of Left err -> fail $ show err Right parsed -> return $ parsed evalAndPrint :: Env -> String -> IO () evalAndPrint env expr = evalString env expr >>= putStrLn evalString :: Env -> String -> IO String evalString env expr = do x <- readStatement expr putStrLn $ show x map (\exprs -> runIOThrows $ liftM show $ evalStatem...

[ -0.00958251953125, -0.004150390625, -0.005523681640625, 0.0186767578125, -0.00640869140625, 0.027099609375, -0.0040283203125, -0.007293701171875, 0.00897216796875, 0.004241943359375, -0.00775146484375, -0.015869140625, 0.003173828125, -0.00665283203125, 0.00933837890625, -0.00497436523...

[ 111, 636, 2480, 72, 42, 33079, 35782, 3650, 7639, 90911, 366, 5281, 30646, 28, 1405, 37839, 112079, 18, 1984, 357, 334, 23351, 17780, 16, 22, 14700, 2203, 71713, 1369, 3884, 866, 19, 54, 1022, 12301, 135206, 5911, 22288, 15, 83613, 4295...

[ 0.2279052734375, 0.104736328125, 0.1993408203125, 0.1279296875, 0.1727294921875, 0.07476806640625, 0.2142333984375, 0.1346435546875, 0.1064453125, 0.1728515625, 0.1815185546875, 0.140625, 0.1273193359375, 0.09698486328125, 0.259521484375, 0.1990966796875, 0.2166748046875, 0.0795288...

embed

27652463_c0

27652463

haskell

0

Title: 1 :: List[Nothing] in foldLeft Problem title: 1 :: List[Nothing] in foldLeft Tags: haskell, generics, scala Problem: 1 :: List[Nothing] in foldLeft If: scala> val l = List() // List() same as List[Nothing]() l: List[Nothing] = List() scala> 1 :: l res0: List[Int] = List(1) or: scala> 1 :: List[Nothing]() res6: L...

1 :: List[Nothing] in foldLeft 1 :: List[Nothing] in foldLeft haskell generics scala List Nothing res0 res6 res3 x:acc 1 :: List[Nothing] in foldLeft If: or: Why then this does not work out: So I have to type this explicitly List[Int]() : ? Though it does in Haskell, for example:

[ 0.01141357421875, 0.003204345703125, 0.0093994140625, -0.027099609375, -0.005615234375, -0.0037078857421875, -0.004150390625, -0.0098876953125, 0.007232666015625, -0.03466796875, 0.0048828125, -0.047607421875, 0.0017852783203125, 0.0047607421875, -0.012451171875, -0.0220947265625, -0...

[ 106, 1984, 32036, 1065, 5021, 64113, 23, 42822, 5267, 2480, 1556, 142508, 189534, 146232, 182747, 3332, 2389, 910, 363, 1022, 10060, 4263, 903, 959, 4488, 1810, 10644, 143726, 4153, 18, 152, 20625 ]

[ 0.032562255859375, 0.054351806640625, 0.2008056640625, 0.01165771484375, 0.0850830078125, 0.1551513671875, 0.041839599609375, 0.172607421875, 0.0751953125, 0.142822265625, 0.111328125, 0.202392578125, 0.167724609375, 0.14404296875, 0.1483154296875, 0.035308837890625, 0.04837036132812...

embed

28872396_c0

28872396

haskell

0

Title: Understanding filterM Problem title: Understanding filterM Tags: haskell, monads Problem: Understanding filterM Consider filterM (\x -> [True, False]) [1, 2, 3] I just cannot understand the magic that Haskell does with this filterM use case. The source code for this function is listed below: filterM :: (Monad m)...

Understanding filterM Understanding filterM haskell monads Understanding Monad Bool x:xs x:ys Understanding filterM Consider I just cannot understand the magic that Haskell does with this filterM use case. The source code for this function is listed below: With this use case, p should be the lambda function (\x -> [Tru...

[ -0.01544189453125, 0.0255126953125, -0.004364013671875, 0.01214599609375, 0.00823974609375, 0.01177978515625, 0.01611328125, 0.00116729736328125, 0.0240478515625, 0.0184326171875, 0.01275634765625, -0.01708984375, 0.000400543212890625, -0.002655029296875, 0.00921630859375, -0.000041007...

[ 9626, 144057, 46312, 594, 1556, 142508, 2667, 712, 60331, 71, 2460, 929, 1022, 425, 4778, 53418, 28219, 49846, 20625, 4527, 7225, 31344, 18151, 32354, 915, 5608, 21, 6492, 85, 41872, 33079, 882, 22225, 5117, 106, 12564, 177, 4426, 9, 3064...

[ 0.0606689453125, 0.04791259765625, 0.2464599609375, 0.1934814453125, 0.0908203125, 0.2445068359375, 0.05523681640625, 0.08502197265625, 0.13330078125, 0.08837890625, 0.082275390625, 0.1673583984375, 0.12890625, 0.08343505859375, 0.0909423828125, 0.0426025390625, 0.0926513671875, 0....

embed

71540156_c0

71540156

haskell

0

Title: iteration with the list monad Problem title: iteration with the list monad Tags: list, monads, haskell Problem: iteration with the list monad I'm having trouble understanding how the iterative behavior of the list monad can be derived from its definition . instance Monad [] where m >>= f = concatMap f m return x...

iteration with the list monad iteration with the list monad list monads haskell Monad iteration with the list monad I'm having trouble understanding how the iterative behavior of the list monad can be derived from its definition . Discussions I've read seem to pass over the question of how >>= creates a control structu...

[ -0.0157470703125, -0.005615234375, 0.0150146484375, 0.007568359375, 0.00482177734375, 0.019775390625, 0.01287841796875, 0.004180908203125, 0.01141357421875, -0.0113525390625, 0.01025390625, -0.031494140625, -0.0029296875, -0.008056640625, -0.00592041015625, 0.0072021484375, -0.009277...

[ 17, 720, 2320, 678, 5303, 2667, 712, 1556, 142508, 60331, 71, 63134, 100094, 3642, 45023, 123166, 831, 16406, 4126, 1295, 80934, 645, 6396, 1369, 28282, 7, 6226, 45646, 123019, 54, 110, 22062, 903, 88303, 23, 47, 20625, 41591, 17780, 1017...

[ 0.07470703125, 0.24951171875, 0.0408935546875, 0.139404296875, 0.190673828125, 0.1434326171875, 0.18408203125, 0.0985107421875, 0.232421875, 0.1849365234375, 0.12548828125, 0.05767822265625, 0.0556640625, 0.03955078125, 0.1141357421875, 0.1578369140625, 0.023468017578125, 0.0343017...

embed

73843021_c0

73843021

haskell

0

Title: Is there a way reverse associativity of function application in Haskell? Problem title: Is there a way reverse associativity of function application in Haskell? Tags: haskell Problem: Is there a way reverse associativity of function application in Haskell? So I'm looking for a way to force some operators which a...

Is there a way reverse associativity of function application in Haskell? Is there a way reverse associativity of function application in Haskell? haskell Haskell Is there a way reverse associativity of function application in Haskell? So I'm looking for a way to force some operators which are defined as right-associati...

[ 0.007049560546875, 0.0172119140625, 0.020263671875, 0.0118408203125, 0.00112152099609375, -0.000461578369140625, 0.006439208984375, 0.01318359375, 0.01434326171875, -0.03857421875, 0.0002880096435546875, 0.006378173828125, 0.00885009765625, 0.007659912109375, -0.004241943359375, 0.0008...

[ 2071, 2685, 3917, 39531, 184, 166027, 3760, 53, 32354, 38415, 23, 20625, 142508, 10, 1556, 111, 16487, 37772, 39933, 61924, 7108, 162, 45388, 45023, 190659, 25737, 144996, 3650, 65572, 107671, 17110, 959, 4989, 158, 4460, 33, 121293, 151575, ...

[ 0.0069580078125, 0.0283966064453125, 0.12109375, 0.22412109375, 0.1773681640625, 0.1949462890625, 0.12255859375, 0.06787109375, 0.169921875, 0.1998291015625, 0.06884765625, 0.143310546875, 0.24951171875, 0.010986328125, 0.09912109375, 0.04058837890625, 0.00689697265625, 0.156127929...

embed

75171829_c1

75171829

haskell

1

). But in the retrieveEntityById case this is not possible, as the object has yet to loaded from the DB. That's why I have to call the function with an extra TypeInfo parameter that I create from a sample entity. I would like to get rid of this extra parameter, to have a function signature like: retrieveEntityById :: f...

[ 0.01336669921875, 0.007293701171875, -0.006591796875, 0.0213623046875, -0.01129150390625, 0.011474609375, 0.0074462890625, 0.00099945068359375, 0.020263671875, -0.07421875, -0.019775390625, -0.0115966796875, -0.004791259765625, -0.022216796875, 0.00372314453125, -0.000240325927734375, ...

[ 194, 456, 3996, 3134, 7768, 18, 2481, 75358, 568, 71, 7225, 903, 959, 7722, 36746, 1556, 14373, 72367, 57976, 11782, 32354, 4173, 60457, 93147, 171859, 28282, 10, 121413, 77630, 939, 2806, 1884, 31351, 138256, 100, 5584, 158, 19, 3447, 13...

[ 0.004730224609375, 0.068115234375, 0.1461181640625, 0.123046875, 0.05767822265625, 0.111083984375, 0.0928955078125, 0.1336669921875, 0.10382080078125, 0.154296875, 0.0161590576171875, 0.00177001953125, 0.0716552734375, 0.1343994140625, 0.15966796875, 0.005950927734375, 0.092895507812...

embed

7641282_c1

7641282

haskell

1

-> Type idSubst :: Substitution idSubst x = TVar x update :: (String, Type) -> Substitution -> Substitution update (x,y) f = (\z -> if z == x then y else f z) -- vars collects all the variables occuring in a type expression vars :: Type -> [String] vars ty = nub (vars' ty) where vars' (TVar x) = [x] vars' (BinType op ...

[ 0.0145263671875, 0.01422119140625, 0.005828857421875, 0.0201416015625, 0.015869140625, -0.0018463134765625, -0.0272216796875, 0.017822265625, -0.0008697509765625, -0.0007781982421875, -0.01123046875, -0.005126953125, 0.00051116943359375, 0.00433349609375, -0.00482177734375, 0.008850097...

[ 33079, 60457, 3447, 96472, 271, 1984, 8273, 13480, 1363, 1022, 2203, 1910, 147, 28350, 71713, 214, 425, 4, 53, 1238, 169, 2174, 97, 69112, 113, 37076, 4210, 285, 7, 43799, 756, 77336, 74918, 23, 10644, 125195, 2281, 315, 275, 1961, 25, ...

[ 0.051605224609375, 0.195068359375, 0.199462890625, 0.274169921875, 0.2196044921875, 0.056640625, 0.1851806640625, 0.2236328125, 0.09991455078125, 0.147705078125, 0.07421875, 0.157958984375, 0.1807861328125, 0.2113037109375, 0.10107421875, 0.02972412109375, 0.07757568359375, 0.06100...

embed

4147659_c0

4147659

haskell

0

Title: Haskell "show is applied to too many type arguments" Problem title: Haskell "show is applied to too many type arguments" Tags: haskell Problem: Haskell "show is applied to too many type arguments" I am trying to replicate the UNIX program wc in haskell. To make this easier I have created a ty...

Haskell "show is applied to too many type arguments" Haskell "show is applied to too many type arguments" haskell Haskell WCResult Show wc.hs:9:15 Haskell "show is applied to too many type arguments" I am trying to replicate the UNIX program wc in haskell. To make this easier I have created a type: ...

[ 0.0042724609375, -0.01104736328125, 0.0019683837890625, 0.004974365234375, -0.00927734375, -0.0084228515625, -0.0140380859375, -0.0238037109375, 0.0203857421875, 0.0194091796875, -0.0198974609375, -0.0478515625, 0.0126953125, 0.0120849609375, -0.0205078125, -0.01397705078125, 0.00334...

[ 20625, 142508, 31374, 83, 190659, 47, 5792, 5941, 10644, 10750, 1556, 37808, 4332, 7, 7136, 17367, 92922, 127, 1126, 12221, 31577, 143126, 67, 67569, 1542, 1528, 23, 99156, 75935, 10, 14847, 9790, 11675, 903, 87, 2046, 35672, 3714, 15400 ]

[ 0.093994140625, 0.217529296875, 0.2313232421875, 0.07208251953125, 0.172119140625, 0.120849609375, 0.1702880859375, 0.1732177734375, 0.2083740234375, 0.2022705078125, 0.0911865234375, 0.1201171875, 0.041656494140625, 0.114990234375, 0.1610107421875, 0.18603515625, 0.1600341796875, ...

embed

32625625_c0

32625625

haskell

0

Title: Download resource with HTTP caching Problem title: Download resource with HTTP caching Tags: http, haskell, caching, server Problem: Download resource with HTTP caching To validate jwt tokens at server I'm using jwk ( Google ) certs (changing frequently) and, even exist many libraries to download that ( HTTP , c...

Download resource with HTTP caching Download resource with HTTP caching http haskell caching server Download HTTP Cache-Control Expires Download resource with HTTP caching To validate jwt tokens at server I'm using jwk ( Google ) certs (changing frequently) and, even exist many libraries to download that ( HTTP , curl ...

[ -0.0198974609375, 0.00787353515625, 0.0164794921875, 0.01904296875, 0.004241943359375, -0.0174560546875, -0.011962890625, 0.00116729736328125, 0.004180908203125, -0.035888671875, -0.0022125244140625, 0.01470947265625, 0.0157470703125, 0.0186767578125, -0.01226806640625, 0.021728515625,...

[ 4857, 177953, 678, 135913, 377, 59207, 1621, 1556, 142508, 10723, 2041, 1430, 175904, 60075, 50964, 44622, 1647, 434, 18, 47, 84694, 99, 17368, 92, 1815, 35649, 90965, 195409, 32316, 5941, 35773, 7026, 9709, 112061, 14037, 3917, 5423, 4000, ...

[ 0.1663818359375, 0.1722412109375, 0.09832763671875, 0.25732421875, 0.16162109375, 0.1976318359375, 0.1824951171875, 0.1114501953125, 0.2314453125, 0.1673583984375, 0.1119384765625, 0.1099853515625, 0.1905517578125, 0.1240234375, 0.0888671875, 0.1785888671875, 0.06396484375, 0.08276...

embed

12421085_c0

12421085

haskell

0

Title: Good introduction to free theorems Problem title: Good introduction to free theorems Tags: functional-programming, haskell Problem: Good introduction to free theorems I stumbled upon a nice idea of free theorems in functional language. However, the only resource I was able to find is Wadler's article " Theorems ...

Good introduction to free theorems Good introduction to free theorems functional-programming haskell Good Good introduction to free theorems I stumbled upon a nice idea of free theorems in functional language. However, the only resource I was able to find is Wadler's article " Theorems for Free ". It's quite good but i...

[ 0.0230712890625, 0.01513671875, 0.00897216796875, -0.007476806640625, -0.0018157958984375, -0.00872802734375, -0.00897216796875, -0.007354736328125, 0.004180908203125, -0.045654296875, 0.004302978515625, -0.005645751953125, -0.0137939453125, 0.037109375, 0.002349853515625, 0.0076293945...

[ 18621, 39864, 4092, 70, 58391, 47, 123309, 28966, 1556, 142508, 7, 18784, 40099, 26267, 6528, 46876, 4734, 177953, 92009, 603, 5582, 581, 100, 5153, 1650, 32233, 4127, 58621, 959, 57143, 7941, 2046, 8305, 217064, 23552, 56065, 47445, 5915, ...

[ 0.06195068359375, 0.08740234375, 0.1923828125, 0.05316162109375, 0.2098388671875, 0.010467529296875, 0.197021484375, 0.1214599609375, 0.1151123046875, 0.2154541015625, 0.07281494140625, 0.0186614990234375, 0.000091552734375, 0.038909912109375, 0.0606689453125, 0.123779296875, 0.01181...

embed

14887973_c0

14887973

haskell

0

Title: Haskell Cartesian Product Recursively Problem title: Haskell Cartesian Product Recursively Tags: haskell, cartesian-product Problem: Haskell Cartesian Product Recursively I know how to use list comprehension to do this, but how can I implement a function that will recursively compute the cartesian product given ...

Haskell Cartesian Product Recursively Haskell Cartesian Product Recursively haskell cartesian-product Haskell Cartesian Product Recursively Haskell Cartesian Product Recursively I know how to use list comprehension to do this, but how can I implement a function that will recursively compute the cartesian product given ...

[ 0.00323486328125, 0.0272216796875, 0.00653076171875, 0.00360107421875, 0.0002384185791015625, 0.022705078125, -0.0115966796875, -0.001220703125, -0.001312255859375, -0.01251220703125, 0.0057373046875, -0.015625, -0.005859375, 0.01007080078125, -0.0130615234375, -0.0068359375, 0.00190...

[ 20625, 142508, 106274, 39209, 73111, 853, 48650, 5844, 538, 1556, 129912, 3378, 57877, 3714, 3642, 4527, 5303, 46683, 3220, 6889, 54, 831, 29479, 32354, 1221, 195625, 9969, 6743, 70, 12996, 34475, 6626, 5423, 179933, 110, 3522, 140992, 903, ...

[ 0.148193359375, 0.2156982421875, 0.1661376953125, 0.156494140625, 0.25634765625, 0.0946044921875, 0.1737060546875, 0.2017822265625, 0.059326171875, 0.130859375, 0.1829833984375, 0.1524658203125, 0.2353515625, 0.05712890625, 0.05023193359375, 0.053436279296875, 0.1500244140625, 0.10...

embed

40351748_c0

40351748

haskell

0

Title: Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? Problem title: Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? Tags: haskell, type-inference, types, typeclass Problem: Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? When I enter :t 4 in ghci I get...

Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? haskell type-inference types typeclass Why Num Ord Prelude Why does ghci outputs (Num a) => a for :t 4 and not (Ord a) => a? When I enter :t 4 in ghci I get I understand why 4 ...

[ 0.005096435546875, -0.017333984375, 0.0233154296875, 0.00433349609375, 0.00125885009765625, 0.0018157958984375, -0.01123046875, 0.00933837890625, -0.000850677490234375, -0.01220703125, -0.0205078125, -0.055419921875, -0.007781982421875, 0.00750732421875, -0.0017242431640625, 0.00056457...

[ 44084, 31380, 318, 140992, 839, 316, 10, 5386, 18, 201, 959, 143045, 100, 1556, 142508, 10644, 73, 69988, 52895, 67413, 52782, 35379, 1914, 822, 112, 136, 30957, 28219, 15400, 360, 44401, 53498, 297, 103136, 1257, 127887, 808, 88949, 83, ...

[ 0.0802001953125, 0.127685546875, 0.1513671875, 0.1654052734375, 0.0323486328125, 0.1378173828125, 0.10467529296875, 0.072998046875, 0.0733642578125, 0.2158203125, 0.078857421875, 0.17431640625, 0.045166015625, 0.08685302734375, 0.1776123046875, 0.08026123046875, 0.0047607421875, 0....

embed

21644287_c0

21644287

haskell

0

Title: How to implement a Haskell extension? Problem title: How to implement a Haskell extension? Tags: ghci, haskell, ghc Problem: How to implement a Haskell extension? I have several ideas of extensions for Haskell, that can be implemented by translating extended language to normal one (the extensions will provide so...

How to implement a Haskell extension? How to implement a Haskell extension? ghci haskell ghc How Haskell Num How to implement a Haskell extension? I have several ideas of extensions for Haskell, that can be implemented by translating extended language to normal one (the extensions will provide some pragmas and keywords...

[ 0.02099609375, 0.00579833984375, 0.027099609375, 0.000370025634765625, 0.00677490234375, 0.0201416015625, -0.0184326171875, -0.0166015625, -0.00946044921875, -0.0301513671875, -0.01129150390625, -0.01055908203125, -0.019775390625, -0.007232666015625, 0.00579833984375, -0.00014019012451...

[ 11249, 47, 29479, 10, 20625, 142508, 111938, 32, 31380, 318, 1556, 238, 52782, 40368, 25647, 7, 831, 3900, 143, 65042, 46876, 3638, 1632, 1221, 22691, 3060, 58827, 1510, 136, 166117, 11522, 3917, 5608, 45367, 645, 527, 73265, 15190, 100, ...

[ 0.110595703125, 0.07568359375, 0.247802734375, 0.0804443359375, 0.17529296875, 0.281982421875, 0.254150390625, 0.00714111328125, 0.1029052734375, 0.1202392578125, 0.15673828125, 0.0810546875, 0.238525390625, 0.019866943359375, 0.06964111328125, 0.0260162353515625, 0.012725830078125, ...

embed

7165779_c0

7165779

haskell

0

Title: Haskell: Map function with tuples Problem title: Haskell: Map function with tuples Tags: tuples, map-function, haskell Problem: Haskell: Map function with tuples I have to write a Haskell program that does the following: Main> dotProduct [(1,3),(2,5),(3,3)] 2 [(2,3),(4,5),(6,3)] I have to do it both with and wit...

Haskell: Map function with tuples Haskell: Map function with tuples tuples map-function haskell Haskell Map Main Float Integer Haskell: Map function with tuples I have to write a Haskell program that does the following: I have to do it both with and without map function. I already did it without map , but I have no clu...

[ 0.00830078125, 0.017822265625, -0.009521484375, -0.000728607177734375, -0.03173828125, -0.0002803802490234375, -0.003692626953125, 0.005950927734375, 0.0014190673828125, -0.01446533203125, -0.01092529296875, -0.0191650390625, -0.003936767578125, -0.00119781494140625, -0.00823974609375, ...

[ 20625, 142508, 12, 42719, 32354, 678, 370, 99726, 22288, 137175, 1556, 12321, 38699, 257, 44401, 765, 47, 33022, 1528, 14602, 25632, 54, 15044, 15490, 21771, 6777, 110, 29786, 20633, 10752, 77193, 6183, 3871, 4358, 11389 ]

[ 0.1533203125, 0.2509765625, 0.04107666015625, 0.263427734375, 0.209716796875, 0.146728515625, 0.181396484375, 0.2486572265625, 0.2181396484375, 0.1822509765625, 0.1534423828125, 0.108154296875, 0.1551513671875, 0.054962158203125, 0.176025390625, 0.0555419921875, 0.012664794921875, ...

embed

47823293_c0

47823293

haskell

0

Title: How to install a package and save the setting? Problem title: How to install a package and save the setting? Tags: haskell-stack, haskell Problem: How to install a package and save the setting? I created a new project using stack . stack new myproj I want to install a package lens . If I use the following comman...

How to install a package and save the setting? How to install a package and save the setting? haskell-stack haskell How package.yml How to install a package and save the setting? I created a new project using stack . I want to install a package lens . If I use the following command, the package will be installed, but i...

[ -0.00457763671875, -0.006927490234375, 0.01226806640625, 0.006866455078125, -0.0003032684326171875, 0.0184326171875, -0.006072998046875, -0.006134033203125, 0.00141143798828125, 0.0079345703125, 0.00982666015625, -0.007232666015625, 0.000667572021484375, -0.006500244140625, 0.00147247314...

[ 11249, 47, 20600, 98169, 136, 30098, 53550, 10, 70, 1556, 142508, 590, 2594, 53, 7237, 75935, 13452, 17368, 177261, 3098, 7, 25632, 75101, 959, 49814, 2967, 6002, 18151, 174653, 37076, 110, 36294, 87344, 25037, 39, 108999, 191082, 15190 ]

[ 0.065673828125, 0.0191802978515625, 0.2200927734375, 0.259033203125, 0.1055908203125, 0.1668701171875, 0.18359375, 0.041839599609375, 0.0262603759765625, 0.1190185546875, 0.189453125, 0.07470703125, 0.087158203125, 0.0537109375, 0.1741943359375, 0.00274658203125, 0.07476806640625, ...

embed

66433321_c0

66433321

haskell

0

Title: Change specific bytes in Haskell ByteString Problem title: Change specific bytes in Haskell ByteString Tags: haskell Problem: Change specific bytes in Haskell ByteString Suppose I have a Data.ByteString and a list of desired changes [(Int, Word8)] where Int is an index and Word8 is a new byte value. How to apply...

Change specific bytes in Haskell ByteString Change specific bytes in Haskell ByteString haskell Change Haskell ByteString Data.ByteString Word8 Change specific bytes in Haskell ByteString Suppose I have a Data.ByteString and a list of desired changes [(Int, Word8)] where Int is an index and Word8 is a new byte value. H...

[ -0.010498046875, -0.0003223419189453125, 0.014404296875, 0.005615234375, -0.008544921875, 0.004241943359375, -0.02392578125, -0.00311279296875, 0.00360107421875, 0.058349609375, 0.0029754638671875, 0.0186767578125, 0.0205078125, 0.0218505859375, -0.00665283203125, -0.0078125, 0.01483...

[ 87377, 29458, 390, 1636, 20625, 142508, 3311, 67, 71713, 23, 1556, 11809, 75358, 22543, 1019, 214, 5303, 104851, 65572, 18, 50490, 360, 63262, 3525, 34292, 11249, 47, 59911, 2684, 93766, 313, 8781, 40956, 645, 15549, 8951, 23935, 199334, 37...

[ 0.19189453125, 0.197998046875, 0.1220703125, 0.156982421875, 0.154541015625, 0.2484130859375, 0.1134033203125, 0.12939453125, 0.1668701171875, 0.035491943359375, 0.145263671875, 0.07763671875, 0.07720947265625, 0.1307373046875, 0.2115478515625, 0.049560546875, 0.11328125, 0.1217041...

embed

66846992_c0

66846992

haskell

0

Title: Haskell perform function on list n number times Problem title: Haskell perform function on list n number times Tags: haskell Problem: Haskell perform function on list n number times I am learning functional programming using Haskell. I am trying to create a function that takes a function f , and executes the fun...

Haskell perform function on list n number times Haskell perform function on list n number times haskell Haskell Haskell perform function on list n number times I am learning functional programming using Haskell. I am trying to create a function that takes a function f , and executes the function on some input x , n num...

[ 0.0034637451171875, 0.01519775390625, -0.000720977783203125, -0.000881195068359375, -0.0029144287109375, -0.00167083740234375, -0.006561279296875, -0.0194091796875, 0.002532958984375, -0.04150390625, 0.0048828125, -0.0201416015625, -0.004852294921875, 0.0181884765625, -0.0002994537353515...

[ 20625, 142508, 51339, 32354, 98, 5303, 653, 14012, 20028, 1556, 87, 52080, 123309, 56037, 17368, 31577, 28282, 51776, 1238, 71924, 3060, 107730, 1022, 140992, 1884, 903, 2060, 2809, 19048, 1380, 1257, 678, 18822, 14602, 1284, 3714, 158, 2816,...

[ 0.1539306640625, 0.2283935546875, 0.22021484375, 0.2330322265625, 0.1251220703125, 0.216796875, 0.1490478515625, 0.170166015625, 0.248046875, 0.1595458984375, 0.000335693359375, 0.0950927734375, 0.1590576171875, 0.0926513671875, 0.0218658447265625, 0.0777587890625, 0.103515625, 0.1...

embed

26035489_c0

26035489

haskell

0

Title: Check memory usage in haskell Problem title: Check memory usage in haskell Tags: memory-management, memory, resources, caching, haskell Problem: Check memory usage in haskell I'm creating a program which implements some kind of cache. I need to use as much memory as possible and to do that I need to do two thing...

Check memory usage in haskell Check memory usage in haskell memory-management memory resources caching haskell Check Check memory usage in haskell I'm creating a program which implements some kind of cache. I need to use as much memory as possible and to do that I need to do two things: Check how much memory is still a...

[ -0.007476806640625, 0.01226806640625, 0.005401611328125, 0.0302734375, -0.003936767578125, 0.00927734375, -0.00689697265625, 0.00439453125, -0.0032501220703125, -0.044921875, 0.0186767578125, -0.0047607421875, 0.017822265625, 0.0235595703125, 0.01507568359375, 0.02783203125, 0.009338...

[ 38679, 98323, 127689, 23, 1556, 142508, 87140, 65514, 377, 59207, 105233, 1528, 29479, 82365, 3871, 4527, 237, 5045, 7722, 54, 6626, 8966, 7464, 19882, 5426, 35812, 4734, 61595, 15383, 4027, 21771, 17368, 13651, 41371, 29806, 150040, 3773, 12...

[ 0.1973876953125, 0.191162109375, 0.20947265625, 0.1004638671875, 0.14111328125, 0.2293701171875, 0.0928955078125, 0.0811767578125, 0.086669921875, 0.07440185546875, 0.05401611328125, 0.089599609375, 0.046966552734375, 0.1624755859375, 0.0552978515625, 0.13330078125, 0.00213623046875,...

embed

51800389_c1

51800389

haskell

1

and then wait for the next command. Until the end of time, or more seriously until the user issues the quit command. Likewise, instead of processing an infinite stream of user commands, process an infinite stream of data. Such as continuous queries on a database. Those cases are rather specific and might be treated by...

[ 0.0024261474609375, 0.01300048828125, -0.0014495849609375, 0.01177978515625, 0.00909423828125, 0.000370025634765625, 0.003143310546875, 0.00012302398681640625, 0.0027923583984375, -0.039306640625, 0.002166748046875, -0.0224609375, -0.017333984375, 0.0125732421875, -0.0157470703125, 0.0...

[ 136, 7068, 40485, 100, 11737, 75101, 5, 992, 3675, 3564, 1733, 1286, 147115, 24189, 38937, 37348, 70, 569, 18, 90825, 64457, 9433, 214, 54241, 13, 75973, 2053, 62005, 41, 10484, 10, 63399, 50218, 29458, 13648, 191607, 46876, 128489, 20625, ...

[ 0.049407958984375, 0.07281494140625, 0.2269287109375, 0.0947265625, 0.129638671875, 0.27197265625, 0.065673828125, 0.04412841796875, 0.0634765625, 0.08935546875, 0.1075439453125, 0.025421142578125, 0.1002197265625, 0.0167694091796875, 0.1640625, 0.05755615234375, 0.048431396484375, ...

embed

29520631_c0

29520631

haskell

0

Title: Haskell: Parse error in an IO program Problem title: Haskell: Parse error in an IO program Tags: haskell, parse-error Problem: Haskell: Parse error in an IO program I am writing a program to help my younger brother learn addition. I am not experienced in writing IO programs, And I am stuck with this parse error:...

Haskell: Parse error in an IO program Haskell: Parse error in an IO program haskell parse-error Haskell Parse MyCode.hs:6:25 Possibly times-1 Haskell: Parse error in an IO program I am writing a program to help my younger brother learn addition. I am not experienced in writing IO programs, And I am stuck with this pars...

[ -0.004180908203125, 0.0208740234375, -0.00970458984375, 0.00823974609375, -0.0033721923828125, 0.03857421875, -0.010009765625, -0.0067138671875, 0.00775146484375, -0.0186767578125, 0.00141143798828125, -0.037109375, 0.001922607421875, 0.007781982421875, 0.002532958984375, -0.0057678222...

[ 20625, 142508, 12, 2392, 184, 18499, 23, 17780, 1528, 142, 1556, 366, 188800, 2646, 114211, 127, 7, 910, 21224, 115861, 38526, 20028, 5759, 32562, 10, 47, 4358, 759, 27150, 56, 82953, 30698, 66044, 959, 122446, 6, 103391, 179933, 678, 903...

[ 0.162353515625, 0.26318359375, 0.05145263671875, 0.156005859375, 0.1649169921875, 0.2244873046875, 0.1005859375, 0.24609375, 0.199462890625, 0.03887939453125, 0.15283203125, 0.1265869140625, 0.1822509765625, 0.1650390625, 0.21630859375, 0.080810546875, 0.034332275390625, 0.10052490...

embed

55672079_c0

55672079

haskell

0

Title: foldr with 4 arguments? Problem title: foldr with 4 arguments? Tags: haskell Problem: foldr with 4 arguments? I am struggling to understand why this code taken from the haskell.org exercise page typechecks (and works as a list reversal function): myReverse :: [a] -> [a] myReverse xs = foldr (\x fId empty -> fId ...

foldr with 4 arguments? foldr with 4 arguments? haskell Foldable foldr with 4 arguments? I am struggling to understand why this code taken from the haskell.org exercise page typechecks (and works as a list reversal function): My first point of confusion is that foldr accepts 3 arguments, not 4 : so I am guessing that m...

[ -0.0179443359375, -0.001129150390625, -0.00020313262939453125, 0.000873565673828125, -0.00726318359375, 0.021240234375, 0.017822265625, 0.004058837890625, 0.00335693359375, -0.000789642333984375, 0.003204345703125, -0.0244140625, -0.01385498046875, -0.00836181640625, -0.0062255859375, ...

[ 18344, 7569, 678, 201, 10750, 7, 32, 1556, 142508, 30077, 71, 2886, 237875, 28219, 15400, 18151, 1478, 81979, 10644, 78292, 43240, 237, 5303, 39531, 2317, 32354, 6275, 169463, 26946, 138, 959, 57767, 759, 4332, 37676, 183234, 4488, 21, 6492...

[ 0.1685791015625, 0.25927734375, 0.0904541015625, 0.1937255859375, 0.25, 0.10491943359375, 0.00152587890625, 0.126220703125, 0.211181640625, 0.1451416015625, 0.0736083984375, 0.1263427734375, 0.03472900390625, 0.05877685546875, 0.0299835205078125, 0.1199951171875, 0.037628173828125, ...

embed

18469063_c0

18469063

haskell

0

Title: How to go to a new line in GHCi? Problem title: How to go to a new line in GHCi? Tags: haskell Problem: How to go to a new line in GHCi? I want to write a function, something like this double :: Int -> Int double x = x + x The problem is that after I write the first line: Prelude> double :: Int -> Int I try to g...

How to go to a new line in GHCi? How to go to a new line in GHCi? haskell How GHCi Prelude Not How to go to a new line in GHCi? I want to write a function, something like this The problem is that after I write the first line: I try to go to the next line pressing the enter key, but when I do I get: It seems that the pr...

[ -0.014892578125, -0.0087890625, 0.00104522705078125, 0.0341796875, -0.00173187255859375, 0.0244140625, 0.0028076171875, 0.0045166015625, -0.010009765625, -0.03271484375, -0.015869140625, -0.0189208984375, -0.016357421875, 0.00146484375, 0.007659912109375, 0.00445556640625, 0.00364685...

[ 11249, 47, 738, 3525, 13315, 23, 527, 73265, 14, 10, 1556, 142508, 1914, 822, 112, 11205, 3444, 33022, 32354, 2967, 7103, 5117, 9790, 11737, 24234, 30957, 22799, 1528, 71924, 13319, 17932, 9969, 1340, 3642, 831, 20625, 124090, 4727, 11787 ]

[ 0.08428955078125, 0.1978759765625, 0.14306640625, 0.1419677734375, 0.1951904296875, 0.0953369140625, 0.0924072265625, 0.1163330078125, 0.2003173828125, 0.0175323486328125, 0.09869384765625, 0.239013671875, 0.039306640625, 0.12548828125, 0.0823974609375, 0.035430908203125, 0.025939941...

embed

18864080_c0

18864080

haskell

0

Title: Haskell: use Maybe but print an actual number rather than "Just ... " Problem title: Haskell: use Maybe but print an actual number rather than "Just ... " Tags: haskell, max Problem: Haskell: use Maybe but print an actual number rather than "Just ... " So here is my program. I want to impleme...

Haskell: use Maybe but print an actual number rather than "Just ... " Haskell: use Maybe but print an actual number rather than "Just ... " haskell max Haskell Maybe Just Ord Nothing x:y:xs y:xs x:xs Haskell: use Maybe but print an actual number rather than "Just ... " So here is my program. I want ...

[ -0.008544921875, -0.005340576171875, 0.031982421875, -0.00372314453125, 0.02392578125, 0.045166015625, 0.0228271484375, -0.003204345703125, 0.0283203125, 0.002838134765625, 0.008056640625, -0.02001953125, 0.00101470947265625, -0.0177001953125, 0.018798828125, -0.004058837890625, -0.0...

[ 20625, 142508, 4527, 83425, 1284, 28412, 8561, 14012, 43257, 3501, 127794, 153, 41502, 1556, 18389, 9563, 35379, 182747, 1022, 53, 425, 113, 12, 3688, 759, 1528, 3444, 29479, 38132, 32354, 10002, 100, 95486, 2967, 163, 37202, 179459, 678, 2...

[ 0.15625, 0.253662109375, 0.120361328125, 0.306640625, 0.1383056640625, 0.2305908203125, 0.182373046875, 0.1900634765625, 0.1087646484375, 0.048583984375, 0.27294921875, 0.085205078125, 0.0187225341796875, 0.1514892578125, 0.1824951171875, 0.1905517578125, 0.1942138671875, 0.1530761...

embed

26310956_c0

26310956

haskell

0

Title: Haskell usage of null Problem title: Haskell usage of null Tags: keyword, null, haskell Problem: Haskell usage of null I'm reading through Real World Haskell and in my copy, on page 59, it states: In Haskell we don't have the equivalent of null. We could use Maybe... Instead we've decided to use a no-argument Em...

Haskell usage of null Haskell usage of null keyword null haskell Haskell Real World Haskell usage of null I'm reading through Real World Haskell and in my copy, on page 59, it states: Then, in the next section, on Errors, there is the Haskell function: Now, I don't understand what the "null" in this function definition...

[ 0.0078125, -0.002471923828125, 0.0230712890625, 0.0037384033203125, 0.00726318359375, 0.03564453125, 0.00787353515625, -0.016357421875, 0.0123291015625, 0.0093994140625, 0.00823974609375, -0.033203125, -0.0164794921875, 0.000751495361328125, 0.0157470703125, -0.0166015625, 0.00402832...

[ 20625, 142508, 127689, 111, 56574, 166117, 1556, 5120, 6661, 11156, 98, 212059, 7, 32354, 28219, 139550, 23, 903, 80934, 15005, 110, 183234, 156202, 4358 ]

[ 0.1378173828125, 0.2646484375, 0.158447265625, 0.0212554931640625, 0.2578125, 0.19189453125, 0.1195068359375, 0.1207275390625, 0.1351318359375, 0.057342529296875, 0.007843017578125, 0.169921875, 0.003662109375, 0.1875, 0.08642578125, 0.280029296875, 0.0165557861328125, 0.0645751953...

embed

21283991_c2

21283991

haskell

2

, pem-0.2.1, certificate-1.3.9, publicsuffixlist-0.1, regex-base-0.93.2, regex-posix-0.95.2, regex-compat-0.95.1, socks-0.5.4, crypto-numbers-0.2.3, crypto-pubkey-0.2.4, tls-1.1.5, cipher-rc4-0.1.4, tls-extra-0.6.6, http-conduit-1.9.6, hslogger-1.2.3, MissingH-1.2.0.2, ConfigFile-1.1.1, Compiling, FP.API.Run, API, Run....

[ -0.0047607421875, -0.00909423828125, 0.00555419921875, 0.00579833984375, 0.005126953125, 0.01446533203125, -0.006317138671875, -0.000762939453125, -0.0012664794921875, 0.0174560546875, -0.00154876708984375, -0.001678466796875, 0.00098419189453125, -0.0164794921875, -0.005523681640625, ...

[ 6, 4, 32490, 23320, 5, 68107, 163769, 5759, 156611, 3835, 77745, 55923, 6562, 9, 102014, 6835, 3355, 37382, 143161, 107033, 67890, 425, 158296, 277, 4453, 156627, 221, 22824, 93645, 617, 215637, 2606, 1297, 120883, 111596, 19770, 116591, 7513...

[ 0.1229248046875, 0.1558837890625, 0.20263671875, 0.1280517578125, 0.10235595703125, 0.195556640625, 0.2462158203125, 0.08428955078125, 0.17236328125, 0.11279296875, 0.0703125, 0.140380859375, 0.1517333984375, 0.06536865234375, 0.1728515625, 0.11767578125, 0.1685791015625, 0.1289062...

embed

41648122_c0

41648122

haskell

0

Title: Haskell parse error on input '=' for quadratic formula Problem title: Haskell parse error on input '=' for quadratic formula Tags: haskell Problem: Haskell parse error on input '=' for quadratic formula I am trying to write a haskell function which will calculate the two roots of the quadrati...

Haskell parse error on input '=' for quadratic formula Haskell parse error on input '=' for quadratic formula haskell Data.List System.IO Haskell Double Haskell parse error on input '=' for quadratic formula I am trying to write a haskell function which will calculate the two roots of the quadratic ...

[ 0.009033203125, 0.0179443359375, 0.002899169921875, -0.0096435546875, 0.007598876953125, 0.02099609375, 0.00457763671875, -0.00921630859375, -0.0108642578125, -0.01446533203125, -0.0021514892578125, -0.024169921875, 0.0167236328125, -0.015625, -0.005615234375, -0.014892578125, -0.020...

[ 20625, 142508, 366, 184, 18499, 98, 107730, 3768, 1369, 68587, 9523, 26168, 100, 1556, 11809, 154663, 12353, 17780, 107172, 31577, 33022, 32354, 74481, 6626, 74855, 13695, 70, 2500, 53333, 1264, 29860, 3871, 1974, 23, 246, 81409 ]

[ 0.16162109375, 0.257080078125, 0.1654052734375, 0.1650390625, 0.2352294921875, 0.114990234375, 0.212158203125, 0.150634765625, 0.216552734375, 0.230224609375, 0.11376953125, 0.1771240234375, 0.033355712890625, 0.1368408203125, 0.0210113525390625, 0.0863037109375, 0.06982421875, 0.1...

embed

31138658_c0

31138658

haskell

0

Title: How to get all subnumbers of a number in haskell Problem title: How to get all subnumbers of a number in haskell Tags: haskell Problem: How to get all subnumbers of a number in haskell I would like to get all sub numbers of a number from a particular side. In the case of the number 1234, the sub numbers from the...

How to get all subnumbers of a number in haskell How to get all subnumbers of a number in haskell haskell How Exception Prelude.read How to get all subnumbers of a number in haskell I would like to get all sub numbers of a number from a particular side. In the case of the number 1234, the sub numbers from the left side...

[ -0.013916015625, -0.00634765625, 0.01300048828125, 0.006683349609375, -0.013916015625, 0.0213623046875, 0.01104736328125, -0.025390625, 0.00531005859375, -0.039794921875, 0.0035247802734375, -0.02392578125, 0.0159912109375, 0.0361328125, 0.003997802734375, -0.0030364990234375, 0.0107...

[ 11249, 47, 2046, 756, 1614, 2606, 1297, 7, 111, 14012, 23, 1556, 142508, 5443, 63928, 1914, 822, 112, 39116, 1884, 101935, 1295, 17311, 5609, 190875, 25737, 29479, 678, 70, 84068, 9384, 96760, 44401, 25632, 18499, 20594, 44691 ]

[ 0.0428466796875, 0.03094482421875, 0.145751953125, 0.1788330078125, 0.25732421875, 0.20458984375, 0.18017578125, 0.10467529296875, 0.03717041015625, 0.171630859375, 0.05706787109375, 0.1513671875, 0.2225341796875, 0.0182647705078125, 0.1300048828125, 0.009613037109375, 0.0810546875, ...

embed

61960515_c1

61960515

haskell

1

tedious when using multiple sentences which will then have the 4 options for each sentence. My Code --First Version import Data.List import System.IO main :: IO() sentences = do putStrLn "The Cat is ______ from ______ the city \n" putStrLn "Here are your options:" putStrLn "A. big, nearby" putStrLn "B. Nearby, in" put...

[ 0.000896453857421875, 0.00139617919921875, -0.0123291015625, 0.0196533203125, 0.0106201171875, -0.01202392578125, 0.0162353515625, 0.0096435546875, 0.00811767578125, -0.01025390625, -0.006744384765625, -0.02197265625, -0.0012054443359375, 0.0223388671875, -0.000637054443359375, 0.03027...

[ 120, 5670, 223, 17368, 48716, 149357, 7, 765, 201, 50717, 100, 12638, 2646, 28864, 207263, 40647, 24927, 11809, 154663, 12353, 17780, 5201, 54, 3884, 71713, 866, 19, 3957, 18826, 83, 167726, 1295, 26349, 25178, 935, 6957, 43573, 1272, 147, ...

[ 0.07373046875, 0.0916748046875, 0.05645751953125, 0.077392578125, 0.1431884765625, 0.2109375, 0.06109619140625, 0.03436279296875, 0.1478271484375, 0.251953125, 0.0200653076171875, 0.0192108154296875, 0.0760498046875, 0.206298828125, 0.09661865234375, 0.2044677734375, 0.15234375, 0....

embed

35818996_c0

35818996

haskell

0

Title: Recursive lambda in Haskell Problem title: Recursive lambda in Haskell Tags: haskell, lambda Problem: Recursive lambda in Haskell Let's see analyse code for factorial in Haskell using lambda function: y f x = f (y f) x factorial = y (\t n -> if n == 1 then 1 else n * t(n-1)) And I cannot understand how does it w...

Recursive lambda in Haskell Recursive lambda in Haskell haskell lambda Recursive Haskell n-1 Recursive lambda in Haskell Let's see analyse code for factorial in Haskell using lambda function: And I cannot understand how does it works. I know that it is connected with lambda calculus but nowadays I am not familiar with ...

[ -0.002166748046875, 0.007476806640625, 0.0133056640625, 0.0172119140625, 0.0291748046875, -0.0177001953125, 0.022705078125, 0.019287109375, -0.01446533203125, -0.02001953125, 0.00750732421875, -0.03125, -0.01275634765625, -0.005126953125, 0.00872802734375, 0.00116729736328125, -0.007...

[ 853, 48650, 5844, 21, 6492, 85, 20625, 142508, 23, 1556, 653, 5759, 1957, 51422, 18151, 31461, 15403, 17368, 32354, 53418, 28219, 3642, 14602, 442, 43240, 162711, 44805, 223, 5636, 16031, 20187, 51359, 92814, 4865, 83, 1238, 80934, 29459, 9...

[ 0.07537841796875, 0.211181640625, 0.113037109375, 0.07305908203125, 0.2135009765625, 0.1290283203125, 0.1429443359375, 0.251220703125, 0.046142578125, 0.111572265625, 0.06396484375, 0.13818359375, 0.0142974853515625, 0.17138671875, 0.1207275390625, 0.2225341796875, 0.235595703125, ...

embed

16887023_c0

16887023

haskell

0

Title: Is it possible to hide specific functions from appearing in the documentation using haddock? Problem title: Is it possible to hide specific functions from appearing in the documentation using haddock? Tags: haddock, haskell Problem: Is it possible to hide specific functions from appearing in the documentation us...

Is it possible to hide specific functions from appearing in the documentation using haddock? Is it possible to hide specific functions from appearing in the documentation using haddock? haddock haskell appearing haddock Is it possible to hide specific functions from appearing in the documentation using haddock? I use h...

[ -0.006744384765625, 0.017822265625, -0.0037384033203125, 0.0084228515625, -0.000934600830078125, 0.0174560546875, 0.00347900390625, -0.0076904296875, -0.01055908203125, 0.015869140625, -0.00775146484375, 0.0021820068359375, -0.0012054443359375, 0.01434326171875, 0.0106201171875, 0.0177...

[ 2071, 7722, 1274, 112, 29458, 32354, 7, 1295, 108975, 23, 209806, 17368, 1902, 138414, 1556, 142508, 214, 442, 47, 4527, 2301, 18, 3444, 756, 31255, 44116, 14037, 25230, 86, 150380, 13, 10557, 1478, 8408, 29713, 7693, 83279, 191145, 8668, ...

[ 0.046539306640625, 0.1578369140625, 0.2183837890625, 0.2037353515625, 0.2120361328125, 0.2322998046875, 0.0804443359375, 0.1102294921875, 0.131591796875, 0.053436279296875, 0.240234375, 0.098388671875, 0.177490234375, 0.271728515625, 0.1260986328125, 0.23388671875, 0.042449951171875,...

embed

23620257_c0

23620257

haskell

0

Title: Haskell- composing three functions in weird way Problem title: Haskell- composing three functions in weird way Tags: composition, haskell Problem: Haskell- composing three functions in weird way I have three functions x y z and a function called functionComposer. I want functionComposer to have as arguments the ...

Haskell- composing three functions in weird way Haskell- composing three functions in weird way composition haskell Haskell x.y.z Haskell- composing three functions in weird way I have three functions x y z and a function called functionComposer. I want functionComposer to have as arguments the functions x y z and to r...

[ -0.00445556640625, -0.00439453125, 0.007110595703125, 0.01458740234375, 0.0205078125, 0.01263427734375, 0.0026397705078125, 0.00921630859375, -0.01153564453125, -0.020751953125, 0.0037384033203125, 0.0205078125, 0.01434326171875, -0.01507568359375, -0.006072998046875, -0.00267028808593...

[ 20625, 142508, 9, 9969, 232, 214, 17262, 32354, 7, 23, 179459, 3917, 166577, 1556, 1022, 53, 169, 87, 765, 113, 97, 136, 35839, 10770, 100587, 3444, 237, 10750, 30646, 163, 4527, 16750, 111, 3934, 4027, 25720, 5, 140363, 70760, 110, 220...

[ 0.1650390625, 0.252197265625, 0.0270843505859375, 0.1513671875, 0.12353515625, 0.025787353515625, 0.2061767578125, 0.2156982421875, 0.04351806640625, 0.062042236328125, 0.1982421875, 0.1197509765625, 0.2105712890625, 0.151123046875, 0.06976318359375, 0.079345703125, 0.0889892578125, ...

embed

26360306_c0

26360306

haskell

0

Title: Is it possible to take a value from evaluation context? Problem title: Is it possible to take a value from evaluation context? Tags: haskell Problem: Is it possible to take a value from evaluation context? I have the following sample program in Haskell: fun 1 = "result1" fun 2 = "result2" wrap = (\ x -> (\ _ -> ...

Is it possible to take a value from evaluation context? Is it possible to take a value from evaluation context? haskell evaluation result1 result2 test.wrap._ lambda1._ lambda2 Is it possible to take a value from evaluation context? I have the following sample program in Haskell: which yields to a result. Is it possibl...

[ -0.00933837890625, 0.018798828125, 0.01348876953125, 0.0216064453125, -0.0024261474609375, -0.00347900390625, -0.00872802734375, -0.00183868408203125, 0.0025177001953125, -0.046142578125, -0.0142822265625, 0.015869140625, -0.0008392333984375, -0.01611328125, 0.01458740234375, 0.0009155...

[ 2071, 442, 7722, 5646, 34292, 1295, 219836, 43701, 47, 10, 1556, 142508, 16750, 418, 304, 3034, 13631, 6492, 85, 121413, 1528, 20625, 11180, 19388, 2046, 77336, 106, 4958, 57, 4126, 64457, 3082, 84797, 23550, 28966, 49846, 56065 ]

[ 0.050445556640625, 0.0723876953125, 0.18994140625, 0.17236328125, 0.21875, 0.158935546875, 0.22216796875, 0.27734375, 0.045318603515625, 0.0240325927734375, 0.114990234375, 0.24072265625, 0.1361083984375, 0.00189208984375, 0.039306640625, 0.1109619140625, 0.1341552734375, 0.1115722...

embed

3995323_c0

3995323

haskell

0

Title: Any Sparse Linear Algebra package in Haskell? Problem title: Any Sparse Linear Algebra package in Haskell? Tags: haskell, sparse-matrix, linear-algebra Problem: Any Sparse Linear Algebra package in Haskell? Is there any package to perform Sparse Linear Algebra computations, maybe based on fast and efficient C li...

Any Sparse Linear Algebra package in Haskell? Any Sparse Linear Algebra package in Haskell? haskell sparse-matrix linear-algebra Any Sparse Linear Algebra Haskell Any Sparse Linear Algebra package in Haskell? Is there any package to perform Sparse Linear Algebra computations, maybe based on fast and efficient C librari...

[ 0.00341796875, 0.03564453125, 0.01495361328125, 0.0033721923828125, -0.0011138916015625, 0.005859375, 0.00982666015625, 0.01043701171875, -0.01348876953125, -0.00225830078125, 0.007171630859375, -0.0128173828125, -0.01092529296875, 0.005157470703125, -0.00775146484375, 0.01385498046875...

[ 28541, 37456, 184, 16777, 147, 884, 429, 2844, 98169, 23, 20625, 142508, 1556, 27148, 192, 87427, 192617, 289, 2499, 47, 51339, 181135, 35509, 4271, 93766, 313, 35773, 33938, 52922, 4588, 28601, 1096, 4527, 527, 30508, 46705, 3358, 98701, 6...

[ 0.10888671875, 0.2054443359375, 0.1556396484375, 0.162353515625, 0.0950927734375, 0.05841064453125, 0.100341796875, 0.1312255859375, 0.22607421875, 0.06640625, 0.1378173828125, 0.25439453125, 0.10711669921875, 0.1943359375, 0.02587890625, 0.1513671875, 0.193359375, 0.02899169921875...

embed

21889005_c0

21889005

haskell

0

Title: Difference of lists with unknown datatype Problem title: Difference of lists with unknown datatype Tags: haskell, list, polymorphism Problem: Difference of lists with unknown datatype I'm trying to get the difference between two lists like this: [(Char, Char, a)] -> [(Char, Char, a)] -> [(Char, Char, a)] where a...

Difference of lists with unknown datatype Difference of lists with unknown datatype haskell list polymorphism Difference Char Ord Difference of lists with unknown datatype I'm trying to get the difference between two lists like this: where a can be any datatype. The problem with doing \\ is that a is not an instance of...

[ 0.00457763671875, 0.01397705078125, 0.0078125, 0.0284423828125, -0.00634765625, 0.01153564453125, 0.0115966796875, -0.0118408203125, 0.011962890625, 0.009765625, 0.000293731689453125, -0.0186767578125, 0.0037689208984375, 0.0299072265625, -0.0361328125, 0.000537872314453125, 0.018432...

[ 803, 18234, 6620, 5303, 7, 678, 51, 69723, 2053, 50986, 1556, 142508, 35874, 178851, 21656, 35379, 111, 19, 31577, 2046, 60212, 17721, 6626, 1884, 903, 7440, 10, 831, 186, 2499, 2967, 20594, 18991, 83, 959, 110527, 18775, 29806, 96704, 41...

[ 0.1090087890625, 0.2135009765625, 0.0634765625, 0.22314453125, 0.055572509765625, 0.09637451171875, 0.0853271484375, 0.2166748046875, 0.113525390625, 0.240234375, 0.1097412109375, 0.2242431640625, 0.09088134765625, 0.1644287109375, 0.1282958984375, 0.208740234375, 0.008453369140625, ...

embed

21997609_c0

21997609

haskell

0

Title: Getting average of calculated list haskell Problem title: Getting average of calculated list haskell Tags: fold, haskell Problem: Getting average of calculated list haskell I have avgRatingsForDirector :: String -> [Film] -> [Int] avgRatingsForDirector _ [] = [] avgRatingsForDirector requestedDirector ((Film _ d...

Getting average of calculated list haskell Getting average of calculated list haskell fold haskell Getting Film Getting average of calculated list haskell I have This outputs a list of numbers, I want to have the result be the average of these numbers. is is possible to use the foldr function on the result somehow?

[ 0.007415771484375, -0.0194091796875, 0.00897216796875, -0.00848388671875, -0.031005859375, 0.01251220703125, 0.0146484375, 0.0113525390625, 0.0096435546875, -0.016357421875, 0.006011962890625, -0.005889892578125, -0.004119873046875, 0.003814697265625, -0.0269775390625, 0.00799560546875...

[ 210732, 83080, 111, 74481, 3674, 5303, 1556, 142508, 42822, 3847, 765, 3293, 140992, 101935, 3444, 16750, 186, 7722, 4527, 18344, 7569, 32354, 209303 ]

[ 0.1077880859375, 0.246826171875, 0.05767822265625, 0.146240234375, 0.063232421875, 0.20654296875, 0.108642578125, 0.230224609375, 0.178955078125, 0.1802978515625, 0.020263671875, 0.00835418701171875, 0.11346435546875, 0.078369140625, 0.0775146484375, 0.11175537109375, 0.0077514648437...

embed

22538113_c2

22538113

haskell

2

<*> (manyTill anyChar (string "END PER:") >> space >> count 10 anyChar) <*> (manyTill anyChar (string "BATCH:") >> space >> count 9 anyChar) <*> (space >> string "CONTRIB:" >> space >> count 9 anyChar) <*> (manyTill anyChar (string "QUOTE BACK:") >> space >> count 10 anyChar <* skipMany1 headers) <*> (manyTill line (t...

[ 0.000255584716796875, 0.01300048828125, 0.005706787109375, 0.048095703125, -0.027587890625, 0.01025390625, -0.0164794921875, -0.00994873046875, 0.01080322265625, -0.009765625, -0.020263671875, 0.00009775161743164062, 0.00008344650268554688, -0.0098876953125, -0.019287109375, 0.00503540...

[ 1639, 669, 53, 618, 5713, 2499, 84068, 91693, 39015, 8168, 12, 6396, 32628, 54529, 209, 75999, 16999, 483, 65421, 79315, 108369, 16625, 571, 232856, 8678, 20572, 21658, 12662, 418, 10336, 1314, 13315, 55547, 46568, 93232, 57616, 13416, 28864,...

[ 0.05804443359375, 0.112548828125, 0.1175537109375, 0.09228515625, 0.228271484375, 0.1435546875, 0.2030029296875, 0.1453857421875, 0.181640625, 0.216796875, 0.062255859375, 0.01995849609375, 0.1968994140625, 0.204345703125, 0.1669921875, 0.1339111328125, 0.0936279296875, 0.153442382...

embed

70681196_c0

70681196

haskell

0

Title: Deriving via ReaderT Problem title: Deriving via ReaderT Tags: deriving, derivingvia, haskell Problem: Deriving via ReaderT I'm writing the Monad instance for this type using ReaderT and deriving via newtype HIO a = HIO {runHIO :: Set HiPermission -> IO a} I've tried to do it this way newtype HIO a = HIO {runHIO...

Deriving via ReaderT Deriving via ReaderT deriving derivingvia haskell the Deriving ReaderT HIO Set HiPermission Functor Applicative Monad Couldn Deriving via ReaderT I'm writing the Monad instance for this type using ReaderT and deriving via I've tried to do it this way but got error: What am I doing wrong?

[ -0.0007476806640625, 0.00836181640625, 0.00131988525390625, 0.005035400390625, 0.0201416015625, -0.0283203125, -0.00140380859375, 0.004150390625, -0.00982666015625, -0.040771484375, -0.000827789306640625, -0.00140380859375, 0.0086669921875, 0.0064697265625, -0.0155029296875, -0.0263671...

[ 1310, 14, 6496, 1829, 122636, 618, 16406, 3459, 1556, 142508, 572, 17780, 19943, 2673, 15277, 21150, 28670, 18770, 5659, 11048, 60331, 71, 191147, 19, 32562, 110527, 10644, 17368, 37842, 903, 18499, 444, 87, 20594, 44691 ]

[ 0.09906005859375, 0.0684814453125, 0.11767578125, 0.156494140625, 0.254150390625, 0.2196044921875, 0.1522216796875, 0.1090087890625, 0.1177978515625, 0.2232666015625, 0.0933837890625, 0.16552734375, 0.1246337890625, 0.102783203125, 0.106201171875, 0.14453125, 0.078125, 0.0732421875...

embed

41536705_c0

41536705

haskell

0

Title: seq stops as soon as it reaches a constructor Problem title: seq stops as soon as it reaches a constructor Tags: haskell Problem: seq stops as soon as it reaches a constructor RWH explains that seq stops as soon as it reaches a constructor. case1 = 1:repeat undefined `seq` "OK" case2 = (undefined,undefined) `seq...

seq stops as soon as it reaches a constructor seq stops as soon as it reaches a constructor haskell case1 case2 seq stops as soon as it reaches a constructor RWH explains that seq stops as soon as it reaches a constructor. We have I understood why case1 function return "OK". But why the case2 function return "OK" too ?...

[ 0.01092529296875, 0.01129150390625, -0.016845703125, 0.0245361328125, 0.009521484375, 0.00653076171875, -0.0011749267578125, 0.017822265625, 0.01202392578125, -0.0235595703125, 0.0035552978515625, -0.0159912109375, 0.021728515625, 0.02197265625, 0.01202392578125, 0.00787353515625, 0....

[ 40, 864, 7279, 33662, 237, 58359, 64549, 748, 1556, 142508, 7225, 418, 304, 78691, 841, 73342, 7, 90, 217064, 15400, 32354, 30646, 9092, 19273, 31353, 297, 59437, 5983, 151575, 9232, 17932 ]

[ 0.156005859375, 0.2396240234375, 0.191162109375, 0.0943603515625, 0.008056640625, 0.178955078125, 0.1558837890625, 0.12841796875, 0.112060546875, 0.2044677734375, 0.1827392578125, 0.059112548828125, 0.1512451171875, 0.00341796875, 0.0237274169921875, 0.0010986328125, 0.05764770507812...

embed

54672381_c0

54672381

haskell

0

Title: How can I import an image in haskell? Problem title: How can I import an image in haskell? Tags: gloss, haskell, import, image Problem: How can I import an image in haskell? I'm a beginner in haskell and trying to make a game. Currently learning Gloss graphics. I wonder how I can import an BMP (JPG or PNG) image...

How can I import an image in haskell? How can I import an image in haskell? gloss haskell import image an image How FilePath Picture fish.bmp How can I import an image in haskell? I'm a beginner in haskell and trying to make a game. Currently learning Gloss graphics. I wonder how I can import an BMP (JPG or PNG) image ...

[ -0.002532958984375, -0.004150390625, 0.0002613067626953125, 0.03369140625, 0.0140380859375, 0.0308837890625, 0.01055908203125, -0.025146484375, 0.0014801025390625, -0.033447265625, 0.013916015625, -0.01556396484375, 0.000858306884765625, 0.0027313232421875, -0.00494384765625, 0.0009727...

[ 11249, 831, 24927, 142, 29569, 23, 1556, 142508, 87, 207244, 42724, 683, 10519, 158656, 67155, 275, 2676, 9842, 1679, 31577, 6712, 52080, 46173, 7, 48461, 32195, 3642, 335, 9088, 124906, 8066, 19659, 62816, 76615, 3444, 127887, 76896, 17780, ...

[ 0.0836181640625, 0.0772705078125, 0.277099609375, 0.0958251953125, 0.256103515625, 0.08905029296875, 0.17138671875, 0.25146484375, 0.01641845703125, 0.213623046875, 0.115234375, 0.045379638671875, 0.1231689453125, 0.166015625, 0.2236328125, 0.0161285400390625, 0.1800537109375, 0.03...

embed

62018158_c0

62018158

haskell

0

Title: String concatenation via ++ or <> Problem title: String concatenation via ++ or <> Tags: haskell Problem: String concatenation via ++ or <> I'm wondering whether there is a reason to use one over the other for string concatenation: λ> "foo" ++ "bar" "foobar" λ> "foo" <> "bar" "foobar" Operator ++ is ...

String concatenation via ++ or <> String concatenation via ++ or <> haskell GHC.Base Semigroup Text String concatenation via ++ or <> I'm wondering whether there is a reason to use one over the other for string concatenation: Operator ++ is defined as list concatenation while <> is an associative binary ope...

[ 0.0076904296875, -0.00921630859375, 0.0169677734375, 0.019775390625, -0.015380859375, 0.0113525390625, -0.006927490234375, 0.001739501953125, 0.000823974609375, -0.0023040771484375, 0.006988525390625, -0.0203857421875, 0.02197265625, 0.004241943359375, -0.003265380859375, -0.0039978027...

[ 23351, 214, 158, 4460, 33, 2320, 1829, 37223, 707, 5386, 1556, 142508, 527, 73265, 63473, 84420, 51588, 24129, 4426, 2740, 149016, 31635, 4527, 1632, 645, 3789, 79315, 150922, 61924, 5303, 166027, 2394, 6635, 39933, 36137, 5701, 502, 64, 22...

[ 0.189453125, 0.0863037109375, 0.0909423828125, 0.1385498046875, 0.1104736328125, 0.0235443115234375, 0.0849609375, 0.263427734375, 0.0059814453125, 0.0180206298828125, 0.07586669921875, 0.1982421875, 0.0673828125, 0.177734375, 0.109130859375, 0.1146240234375, 0.15771484375, 0.18359...

embed

6429047_c0

6429047

haskell

0

Title: How can Haskell read S-expressions from files? Problem title: How can Haskell read S-expressions from files? Tags: haskell Problem: How can Haskell read S-expressions from files? There are some source files, which are in S-expressions. Can Haskell read those s-expressions? I need those s-expressions as patterns ...

How can Haskell read S-expressions from files? How can Haskell read S-expressions from files? haskell files How Haskell S-expressions ArithBiOp Plus AInt oprand1 operand2 How can Haskell read S-expressions from files? There are some source files, which are in S-expressions. Can Haskell read those s-expressions? I need ...

[ 0.0003948211669921875, 0.0029754638671875, -0.009521484375, 0.00726318359375, -0.01611328125, 0.02001953125, -0.00653076171875, 0.013671875, -0.00421142578125, -0.0277099609375, 0.0196533203125, -0.0189208984375, -0.01007080078125, -0.01806640625, 0.0286865234375, -0.003997802734375, ...

[ 11249, 831, 20625, 142508, 12301, 159, 204629, 7, 1295, 102158, 1556, 9, 1172, 8962, 16882, 39029, 8183, 660, 233, 37214, 6264, 2208, 304, 31344, 4171, 91, 3871, 103510, 14858, 71924, 103391, 9384, 1528, 2053, 52895, 11435, 21162, 13315, 21...

[ 0.052764892578125, 0.0836181640625, 0.1307373046875, 0.2171630859375, 0.1793212890625, 0.1639404296875, 0.2249755859375, 0.0050048828125, 0.09991455078125, 0.1962890625, 0.097412109375, 0.01995849609375, 0.029022216796875, 0.07861328125, 0.12255859375, 0.1585693359375, 0.145141601562...

embed

14379185_c0

14379185

haskell

0

Title: Function privacy and unit testing Haskell Problem title: Function privacy and unit testing Haskell Tags: haskell, private-methods, unit-testing Problem: Function privacy and unit testing Haskell How do you deal with function visibility and unit testing in Haskell? If you export every function in a module so that...

Function privacy and unit testing Haskell Function privacy and unit testing Haskell haskell private-methods unit-testing Haskell LANGUAGE CPP SomeModule TESTING export1 export2 Function privacy and unit testing Haskell How do you deal with function visibility and unit testing in Haskell? If you export every function in...

[ 0.0126953125, 0.01397705078125, 0.0240478515625, -0.0030670166015625, 0.01055908203125, -0.018798828125, 0.01043701171875, -0.00762939453125, -0.0027923583984375, 0.0244140625, -0.011474609375, -0.01251220703125, -0.01177978515625, 0.0250244140625, -0.007080078125, 0.00933837890625, ...

[ 28670, 57137, 25072, 134234, 20625, 142508, 1556, 14375, 1928, 7352, 6954, 98064, 17487, 31384, 91616, 8782, 31273, 31255, 35142, 678, 32354, 108625, 939, 136, 11907, 88996, 109921, 17203, 10512, 159029, 5608, 959, 3835, 61687, 17569, 4904, 335...

[ 0.1004638671875, 0.184814453125, 0.18115234375, 0.2578125, 0.15234375, 0.2445068359375, 0.119140625, 0.1263427734375, 0.016998291015625, 0.069580078125, 0.185546875, 0.1285400390625, 0.198974609375, 0.05120849609375, 0.05908203125, 0.06072998046875, 0.183837890625, 0.2147216796875,...

embed

41133260_c0

41133260

haskell

0

Title: why can't pattern matching share where clauses? Problem title: why can't pattern matching share where clauses? Tags: haskell, pattern-matching, scope, syntax Problem: why can't pattern matching share where clauses? I wrote this and it does not compile import Data.Maybe func Nothing Nothing = func2 "hel...

why can't pattern matching share where clauses? why can't pattern matching share where clauses? haskell pattern-matching scope syntax Data.Maybe Nothing func2 test.hs:2:24 Variable Char Perhaps why can't pattern matching share where clauses? I wrote this and it does not compile I rewrote it by using guards an...

[ -0.00787353515625, 0.0146484375, -0.0057373046875, -0.0108642578125, -0.005645751953125, -0.00159454345703125, -0.01513671875, 0.01007080078125, 0.01068115234375, 0.000782012939453125, -0.0020751953125, -0.0003108978271484375, 0.00567626953125, -0.0120849609375, 0.029296875, 0.01416015...

[ 15400, 831, 3768, 18, 103510, 14858, 214, 12008, 7440, 70731, 90, 1556, 142508, 98753, 70820, 6002, 86531, 11809, 82419, 372, 182747, 7477, 304, 3034, 127, 25732, 84572, 21656, 181799, 14602, 959, 9969, 56050, 1884 ]

[ 0.12744140625, 0.13232421875, 0.04425048828125, 0.0958251953125, 0.24658203125, 0.2191162109375, 0.108154296875, 0.1729736328125, 0.173583984375, 0.199951171875, 0.0869140625, 0.11181640625, 0.177734375, 0.20947265625, 0.1278076171875, 0.008941650390625, 0.012359619140625, 0.044616...

embed

53562893_c0

53562893

haskell

0

Title: Unknown parse error from Haskell code for formating Text Problem title: Unknown parse error from Haskell code for formating Text Tags: haskell Problem: Unknown parse error from Haskell code for formating Text I want to use Haskell to format Text with giving Strings and length of the line. But keep getting a same...

Unknown parse error from Haskell code for formating Text Unknown parse error from Haskell code for formating Text haskell Haskell Unknown Text Format Flushleft Justify Flushright Help-function s:ls fi:se:ls se:ls Format.hs:13:14 Unknown parse error from Haskell code for formating Text I want to use Haskell to format Te...

[ 0.00274658203125, -0.01263427734375, 0.01458740234375, 0.00885009765625, -0.01177978515625, 0.0103759765625, 0.0211181640625, -0.0145263671875, -0.005401611328125, -0.007537841796875, -0.01025390625, -0.00994873046875, 0.0096435546875, -0.01165771484375, 0.01318359375, -0.0121459960937...

[ 992, 69723, 366, 184, 18499, 1295, 20625, 142508, 18151, 9384, 214, 24129, 1556, 60972, 36157, 7057, 2480, 9563, 40383, 1495, 54969, 39527, 137175, 91, 12, 8080, 809, 40, 127, 22618, 22635, 19, 3444, 4527, 68772, 23351, 5180, 140909, 13315,...

[ 0.03631591796875, 0.197021484375, 0.139404296875, 0.1151123046875, 0.19921875, 0.0296630859375, 0.1256103515625, 0.2274169921875, 0.147705078125, 0.186767578125, 0.0281219482421875, 0.17724609375, 0.09844970703125, 0.204345703125, 0.1572265625, 0.10064697265625, 0.14013671875, 0.11...

embed

28452203_c0

28452203

haskell

0

Title: Why Haskell list comprehension is faster than loop Problem title: Why Haskell list comprehension is faster than loop Tags: haskell Problem: Why Haskell list comprehension is faster than loop I'm a Haskell noob. And while experimenting with loops and list comprehensions I have discovered that list comprehension i...

Why Haskell list comprehension is faster than loop Why Haskell list comprehension is faster than loop haskell Why Haskell Why Haskell list comprehension is faster than loop I'm a Haskell noob. And while experimenting with loops and list comprehensions I have discovered that list comprehension is faster than a loop. Lis...

[ 0.000148773193359375, 0.01019287109375, 0.00005626678466796875, 0.0026397705078125, 0.01214599609375, 0.0198974609375, 0.000377655029296875, 0.010986328125, 0.027587890625, -0.01708984375, 0.01904296875, -0.01544189453125, 0.0018310546875, 0.01202392578125, 0.001434326171875, -0.001762...

[ 44084, 20625, 142508, 5303, 46683, 3220, 6889, 83, 4271, 56, 3501, 40956, 1556, 110, 3522, 28007, 134053, 1261, 7008, 4527, 78643, 21616, 7464 ]

[ 0.1060791015625, 0.14501953125, 0.2403564453125, 0.217529296875, 0.1754150390625, 0.18359375, 0.0654296875, 0.02801513671875, 0.1475830078125, 0.1219482421875, 0.0684814453125, 0.197509765625, 0.1319580078125, 0.000640869140625, 0.08447265625, 0.0782470703125, 0.060943603515625, 0....

embed

22504808_c0

22504808

haskell

0

Title: Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? Problem title: Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? Tags: unification, types, type-inference, haskell, functional-programming Problem: Why has "map (filter fst)" th...

Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool, a)]]"? unification types type-inference haskell functional-programming Why Bool Why has "map (filter fst)" the type "[[(Bool, a)]] -> [[(Bool...

[ 0.0189208984375, 0.004302978515625, -0.0020599365234375, 0.0167236328125, -0.00567626953125, 0.010498046875, 0.006988525390625, 0.000152587890625, 0.007476806640625, -0.0166015625, -0.00848388671875, -0.00946044921875, -0.0194091796875, 0.004608154296875, -0.01348876953125, 0.000410079...

[ 44084, 1556, 62346, 120337, 1238, 271, 10644, 12647, 929, 10, 5386, 110558, 51, 41274, 52895, 69988, 142508, 123309, 28966, 2460, 1065, 4, 33079, 31577, 28219, 15400, 32354, 11249, 831, 4488, 46312, 8110, 53299, 30646, 196707, 5117, 12830, 37...

[ 0.1461181640625, 0.07574462890625, 0.2030029296875, 0.211669921875, 0.0885009765625, 0.1292724609375, 0.1864013671875, 0.099853515625, 0.212890625, 0.129150390625, 0.0966796875, 0.019989013671875, 0.0716552734375, 0.07916259765625, 0.1212158203125, 0.07464599609375, 0.19384765625, ...

embed

42058823_c0

42058823

haskell

0

Title: Haskell Recursion Subsets Problem title: Haskell Recursion Subsets Tags: recursion, haskell Problem: Haskell Recursion Subsets i am new to Haskell. i am find it hard to understand the below subset program with recursion.what is the way it evaluates? subset :: [a] -> [[a]] subset [] = [[]] subset (x:xs) = [zs | y...

Haskell Recursion Subsets Haskell Recursion Subsets recursion haskell Haskell Recursion Subsets x:xs x:ys Haskell Recursion Subsets i am new to Haskell. i am find it hard to understand the below subset program with recursion.what is the way it evaluates? output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]] When i manuall...

[ -0.01007080078125, 0.019775390625, 0.0185546875, 0.0137939453125, -0.0093994140625, 0.0076904296875, 0.0034637451171875, 0.00579833984375, 0.0263671875, 0.03515625, 0.0015869140625, -0.00872802734375, 0.01611328125, -0.00897216796875, -0.0028533935546875, -0.01397705078125, 0.0159912...

[ 20625, 142508, 165428, 42, 6889, 8273, 3509, 195625, 1830, 1556, 1022, 12, 425, 7, 4778, 3525, 7413, 7941, 28219, 35064, 1614, 1528, 678, 3917, 151575, 90, 140992, 110558, 25256, 39556, 133063, 54968, 96386, 155761, 23009, 166, 58838, 1257, ...

[ 0.135986328125, 0.206298828125, 0.1494140625, 0.15576171875, 0.09130859375, 0.1646728515625, 0.19140625, 0.2344970703125, 0.1385498046875, 0.1251220703125, 0.039276123046875, 0.003082275390625, 0.04681396484375, 0.0185699462890625, 0.089111328125, 0.054229736328125, 0.005706787109375...

embed

30251118_c0

30251118

haskell

0

Title: Haskell function that accepts function or value, then calls function or returns value Problem title: Haskell function that accepts function or value, then calls function or returns value Tags: functional-programming, haskell Problem: Haskell function that accepts function or value, then calls function or returns...

Haskell function that accepts function or value, then calls function or returns value Haskell function that accepts function or value, then calls function or returns value functional-programming haskell Haskell Haskell function that accepts function or value, then calls function or returns value How can I write a type ...

[ 0.00738525390625, 0.0012664794921875, -0.01153564453125, -0.000598907470703125, 0.00811767578125, 0.01348876953125, -0.0126953125, -0.021728515625, -0.00726318359375, -0.0145263671875, -0.0012664794921875, -0.0036468505859375, -0.02490234375, 0.006500244140625, 0.0133056640625, -0.0017...

[ 20625, 142508, 32354, 450, 26946, 7, 707, 34292, 7068, 11782, 30646, 123309, 28966, 1556, 11249, 831, 87, 33022, 10644, 21635, 136, 23, 51776, 40101, 86673, 68034, 110, 10750, 10, 34475, 14847, 86869, 2967, 11724, 1238, 420, 132, 19, 69112,...

[ 0.1561279296875, 0.24169921875, 0.214111328125, 0.0374755859375, 0.209716796875, 0.06591796875, 0.0811767578125, 0.1881103515625, 0.078857421875, 0.1845703125, 0.1851806640625, 0.1328125, 0.039764404296875, 0.103271484375, 0.01458740234375, 0.039031982421875, 0.009368896484375, 0.1...

embed

31052290_c0

31052290

haskell

0

Title: Remove HTML Tags in Haskell Problem title: Remove HTML Tags in Haskell Tags: haskell, html Problem: Remove HTML Tags in Haskell I have a string such as <b>Vitamin A</b><br>Chloe Braided Halter Swim Top, Using Text.HTML.TagSoup I am attempting to remove all html and just have "Vitamin Chloe ...

Remove HTML Tags in Haskell Remove HTML Tags in Haskell haskell html qualified Remove HTML Tags Haskell Vitamin Chloe Braided Halter Swim Top Text.HTML.TagSoup TS.parseTags TagText Remove HTML Tags in Haskell I have a string such as Using Text.HTML.TagSoup I am attempting to remove all html and just have using How can ...

[ 0.006561279296875, 0.021484375, 0.0025634765625, 0.0107421875, 0.00830078125, 0.01031494140625, 0.00125885009765625, -0.01708984375, -0.01275634765625, -0.030517578125, 0.00130462646484375, -0.01239013671875, -0.01953125, 0.0031890869140625, 0.005889892578125, 0.0062255859375, 0.0164...

[ 181139, 19097, 12298, 23, 20625, 142508, 1556, 7693, 217225, 37388, 226839, 6163, 532, 297, 4772, 720, 105432, 39, 4792, 24129, 127068, 66448, 8912, 2037, 53800, 2500, 4837, 174379, 79315, 81887, 87388, 756, 6, 17368, 831, 43613, 69141 ]

[ 0.1417236328125, 0.2481689453125, 0.2271728515625, 0.06597900390625, 0.1507568359375, 0.234130859375, 0.138427734375, 0.194091796875, 0.1881103515625, 0.18359375, 0.17236328125, 0.072021484375, 0.0228118896484375, 0.000579833984375, 0.1322021484375, 0.081298828125, 0.084716796875, ...

embed

35785176_c0

35785176

haskell

0

Title: Check whether a type is an instance of Show in Haskell at runtime? Problem title: Check whether a type is an instance of Show in Haskell at runtime? Tags: haskell Problem: Check whether a type is an instance of Show in Haskell at runtime? Suppose I have a simple data type in Haskell for storing a value: data V a...

Check whether a type is an instance of Show in Haskell at runtime? Check whether a type is an instance of Show in Haskell at runtime? haskell Check Show Haskell Some Error Check whether a type is an instance of Show in Haskell at runtime? Suppose I have a simple data type in Haskell for storing a value: I want to make ...

[ -0.010498046875, -0.005828857421875, 0.01025390625, 0.0098876953125, 0.0017547607421875, 0.01080322265625, -0.003204345703125, -0.01177978515625, 0.00067138671875, 0.00823974609375, -0.01318359375, -0.0272216796875, 0.00506591796875, 0.0120849609375, -0.00665283203125, 0.00479125976562...

[ 38679, 36766, 10644, 83, 110527, 17367, 23, 20625, 142508, 99, 11675, 6032, 142, 111, 1556, 31384, 212059, 10, 8781, 2053, 3082, 34292, 3444, 3249, 310, 211460, 7639, 856, 5608, 30646, 120262, 18499, 26008, 176377, 184, 11547, 6495, 7, 5809...

[ 0.1649169921875, 0.1053466796875, 0.23876953125, 0.0777587890625, 0.2451171875, 0.2958984375, 0.0784912109375, 0.1260986328125, 0.2236328125, 0.0704345703125, 0.0848388671875, 0.12451171875, 0.015533447265625, 0.034393310546875, 0.0989990234375, 0.0169677734375, 0.164794921875, 0.1...

embed

51971113_c0

51971113

haskell

0

Title: succ not getting removed on pred Problem title: succ not getting removed on pred Tags: prolog, replicate, successor-arithmetics, haskell, list Problem: succ not getting removed on pred /* Define a Prolog predicate replicate/3 which corresponds to * the Haskell function of the same name, except that the numeric *...

succ not getting removed on pred succ not getting removed on pred prolog replicate successor-arithmetics haskell list Define Prolog Haskell succ not getting removed on pred So far I've come to this solution: but the problem is that the s(s(s(0))) is not getting reduced by the pred function. it results into p(p(p(s(s(s(...

[ 0.0027313232421875, 0.0245361328125, -0.01019287109375, 0.04248046875, -0.02001953125, 0.0130615234375, -0.01446533203125, 0.00103759765625, 0.00982666015625, -0.03515625, 0.00909423828125, -0.00457763671875, -0.003082275390625, -0.00872802734375, 0.01251220703125, -0.0031585693359375,...

[ 166, 10060, 959, 20949, 184750, 98, 1653, 502, 4867, 143126, 39457, 42, 8962, 1556, 142508, 5303, 64552, 1250, 20625, 2060, 29806, 2967, 91, 132, 7, 177609, 34390, 32354, 50339, 915, 254, 2389, 167089, 5809, 51484, 4358 ]

[ 0.1904296875, 0.269287109375, 0.111083984375, 0.08709716796875, 0.1595458984375, 0.0828857421875, 0.2281494140625, 0.1148681640625, 0.21484375, 0.1390380859375, 0.1337890625, 0.037628173828125, 0.0458984375, 0.0943603515625, 0.2010498046875, 0.1224365234375, 0.09130859375, 0.126586...

embed

42596675_c0

42596675

haskell

0

Title: How do I declare new type with type constraints in Haskell? Problem title: How do I declare new type with type constraints in Haskell? Tags: haskell Problem: How do I declare new type with type constraints in Haskell? I’m tring to declare a new type Value as below: data Value m = Wrong | Num Int | Fun (Value -> ...

How do I declare new type with type constraints in Haskell? How do I declare new type with type constraints in Haskell? haskell How Haskell Value Wrong Num Fun Expecting Expected How do I declare new type with type constraints in Haskell? I’m tring to declare a new type Value as below: And GHCI complains: PS: I'm tryin...

[ -0.0120849609375, 0.0035858154296875, -0.0019683837890625, 0.01031494140625, -0.006561279296875, 0.00567626953125, -0.008056640625, -0.000019550323486328125, 0.000110626220703125, -0.001953125, -0.0035400390625, -0.056884765625, -0.00628662109375, -0.0140380859375, 0.0118408203125, 0.0...

[ 11249, 54, 87, 159978, 3525, 10644, 678, 158, 2816, 4288, 7, 20625, 142508, 23, 1556, 190060, 35133, 52782, 28670, 60075, 24762, 13, 1927, 449, 237, 35064, 41877, 17304, 186992, 29479, 18151, 3533, 3956, 123309, 56037 ]

[ 0.0496826171875, 0.037200927734375, 0.03375244140625, 0.20849609375, 0.1446533203125, 0.228515625, 0.1175537109375, 0.0982666015625, 0.1707763671875, 0.1348876953125, 0.0153656005859375, 0.1514892578125, 0.23974609375, 0.03594970703125, 0.11865234375, 0.16748046875, 0.1029052734375, ...

embed

48056655_c0

48056655

haskell

0

Title: Haskell: How is Num held? Problem title: Haskell: How is Num held? Tags: types, typeclass, haskell Problem: Haskell: How is Num held? In the following example: > let sum::Num a=> a->a->a; sum a b = a +b > let partialSum = sum 1 > partialSum 2.0 3.0 In step let partialSum = sum 1 it would appear that a is interpr...

Haskell: How is Num held? Haskell: How is Num held? types typeclass haskell Haskell How Num sum::Num Haskell: How is Num held? In the following example: In step let partialSum = sum 1 it would appear that a is interpreted as Integer but I suppose Haskell delays this until it can figure out the type (and consequently wh...

[ -0.00982666015625, -0.0140380859375, 0.0238037109375, 0.00994873046875, 0.003753662109375, 0.0264892578125, 0.017578125, -0.009033203125, 0.01226806640625, -0.0030975341796875, -0.0147705078125, -0.029541015625, 0.000644683837890625, -0.022705078125, 0.00225830078125, -0.0045166015625,...

[ 20625, 142508, 11249, 83, 52782, 34658, 52895, 10644, 67413, 1556, 10554, 839, 316, 12, 27781, 29954, 2633, 2878, 289, 294, 106, 108975, 10, 29481, 237, 44401, 8, 5259, 26366, 110527, 4527, 28271, 125195, 88303, 831, 20654, 16750, 7868, 107...

[ 0.136962890625, 0.2320556640625, 0.1400146484375, 0.09393310546875, 0.248046875, 0.21337890625, 0.1519775390625, 0.13623046875, 0.151611328125, 0.112548828125, 0.236083984375, 0.1011962890625, 0.1961669921875, 0.0242919921875, 0.0701904296875, 0.1094970703125, 0.120849609375, 0.114...

embed

30269097_c0

30269097

haskell

0

Title: defining an instance vs using class constraints Problem title: defining an instance vs using class constraints Tags: haskell Problem: defining an instance vs using class constraints I'm going through Learn You a Haskell and am on the chapter that discusses typeclasses. There is this snippet: class (Eq a) => Num ...

defining an instance vs using class constraints defining an instance vs using class constraints haskell class Num defining an instance vs using class constraints I'm going through Learn You a Haskell and am on the chapter that discusses typeclasses. There is this snippet: I understood this as a class constraint being i...

[ -0.0052490234375, 0.0028839111328125, 0.0179443359375, 0.0108642578125, 0.0145263671875, 0.0252685546875, -0.01177978515625, -0.013427734375, 0.00131988525390625, 0.01519775390625, -0.037841796875, -0.031494140625, 0.007537841796875, -0.01483154296875, -0.00372314453125, -0.00582885742...

[ 13204, 449, 142, 110527, 20209, 17368, 18507, 158, 2816, 4288, 1556, 142508, 52782, 134031, 2583, 20625, 10644, 67413, 217064, 903, 566, 144429, 100, 27992, 237, 28, 90065, 2886, 9655, 15400, 58954, 18, 29479, 297, 241, 864, 88606, 37202, 1...

[ 0.22802734375, 0.0865478515625, 0.089599609375, 0.30908203125, 0.148193359375, 0.1513671875, 0.2113037109375, 0.11572265625, 0.1851806640625, 0.16015625, 0.105712890625, 0.2010498046875, 0.279052734375, 0.0474853515625, 0.0194091796875, 0.0869140625, 0.1268310546875, 0.155639648437...

embed

18409900_c0

18409900

haskell

0

Title: output a value in Haskell, with a default in case its type is not an instance of Show Problem title: output a value in Haskell, with a default in case its type is not an instance of Show Tags: haskell, debugging Problem: output a value in Haskell, with a default in case its type is not an instance of Show I trie...

output a value in Haskell, with a default in case its type is not an instance of Show output a value in Haskell, with a default in case its type is not an instance of Show haskell debugging Haskell Show output a value in Haskell, with a default in case its type is not an instance of Show I tried to debug some Arrows an...

[ -0.00860595703125, 0.0047607421875, 0.017578125, 0.0159912109375, 0.007080078125, -0.005126953125, -0.019287109375, -0.028076171875, -0.001190185546875, 0.02685546875, -0.0157470703125, -0.019775390625, 0.02587890625, 0.006256103515625, -0.0018768310546875, 0.0036773681640625, -0.037...

[ 140992, 34292, 23, 20625, 142508, 678, 114977, 7225, 10644, 959, 110527, 17367, 10, 83, 1556, 8, 978, 37842, 85779, 1172, 15555, 7, 6183, 7941, 47593, 144851, 86171, 10750, 17475, 4527, 3917, 7639, 2174, 111, 36659, 109954 ]

[ 0.2005615234375, 0.1798095703125, 0.04046630859375, 0.1207275390625, 0.2379150390625, 0.007965087890625, 0.235107421875, 0.0595703125, 0.1661376953125, 0.1165771484375, 0.170166015625, 0.23486328125, 0.0233612060546875, 0.0238800048828125, 0.08953857421875, 0.0845947265625, 0.1394042...

embed

74068521_c0

74068521

haskell

0

Title: Unpacking tuples using "Either" in Haskell Problem title: Unpacking tuples using "Either" in Haskell Tags: haskell Problem: Unpacking tuples using "Either" in Haskell I'm trying to get a grip on how tuples work in Haskell. I came across this type constructor leftRight :: (Either a b -> c) -> ...

Unpacking tuples using "Either" in Haskell Unpacking tuples using "Either" in Haskell haskell Unpacking Either Haskell Unpacking tuples using "Either" in Haskell I'm trying to get a grip on how tuples work in Haskell. I came across this type constructor leftRight :: (Either a b -> c) -> (a -> c, b -...

[ 0.031005859375, 0.00125885009765625, 0.0036163330078125, 0.0098876953125, -0.0028228759765625, 0.01153564453125, -0.0179443359375, -0.0140380859375, 0.004638671875, -0.01483154296875, -0.01165771484375, -0.0244140625, -0.0028839111328125, 0.0205078125, -0.006256103515625, -0.0049743652...

[ 992, 29102, 370, 99726, 17368, 647, 14, 9319, 20625, 142508, 23, 1556, 4565, 40158, 4488, 10644, 64549, 748, 25737, 1052, 22553, 1984, 876, 33079, 501, 237875, 14602, 10, 26950, 40101, 190659, 47, 707, 140992, 83, 8705, 29459, 65450, 32354,...

[ 0.06927490234375, 0.1790771484375, 0.137939453125, 0.2401123046875, 0.0159759521484375, 0.032073974609375, 0.09332275390625, 0.23681640625, 0.112060546875, 0.2139892578125, 0.04315185546875, 0.057159423828125, 0.051422119140625, 0.0322265625, 0.0789794921875, 0.09075927734375, 0.125,...

embed

31888795_c0

31888795

haskell

0

Title: Haskell Top Level Functions Problem title: Haskell Top Level Functions Tags: haskell Problem: Haskell Top Level Functions I have a Haskell file open on the left side of my screen and ghci on the other half. I want to add functions to the file, save, and experiment with them in ghci. The problem is that I'm not t...

Haskell Top Level Functions Haskell Top Level Functions haskell Haskell Top Level Functions Haskell Top Level Functions I have a Haskell file open on the left side of my screen and ghci on the other half. I want to add functions to the file, save, and experiment with them in ghci. The problem is that I'm not totally su...

[ 0.027099609375, -0.01446533203125, 0.005462646484375, -0.01068115234375, -0.016357421875, 0.007354736328125, 0.01446533203125, 0.0011138916015625, 0.004425048828125, -0.03271484375, 0.0026092529296875, -0.034423828125, -0.018798828125, 0.0185546875, 0.00823974609375, -0.001861572265625...

[ 20625, 142508, 4792, 84136, 28670, 10763, 1556, 11435, 9803, 25737, 5609, 49119, 31380, 318, 23552, 3444, 15190, 32354, 30098, 28007, 2967, 112668, 9077, 3642, 159978, 2663, 17366, 3714, 2367, 621, 167375, 70820, 163504, 3917, 34759, 92558, 181...

[ 0.126708984375, 0.24609375, 0.1949462890625, 0.259765625, 0.2105712890625, 0.0882568359375, 0.129150390625, 0.15966796875, 0.1004638671875, 0.058624267578125, 0.049102783203125, 0.0643310546875, 0.10498046875, 0.14404296875, 0.0693359375, 0.060272216796875, 0.1571044921875, 0.25073...

embed

18232391_c0

18232391

haskell

0

Title: Customize errors handling in uu-parsinglib in Haskell Problem title: Customize errors handling in uu-parsinglib in Haskell Tags: parsing, uu-parsinglib, haskell, error-handling Problem: Customize errors handling in uu-parsinglib in Haskell Is it possible to: throw custom parser errors using uu-parsinglib in Hask...

Customize errors handling in uu-parsinglib in Haskell Customize errors handling in uu-parsinglib in Haskell parsing uu-parsinglib haskell error-handling Customize Haskell Customize errors handling in uu-parsinglib in Haskell Is it possible to: throw custom parser errors using uu-parsinglib in Haskell? (I want especiall...

[ 0.00133514404296875, 0.0216064453125, 0.0201416015625, 0.0019989013671875, -0.005279541015625, 0.023681640625, -0.005035400390625, -0.014404296875, -0.00457763671875, 0.0184326171875, 0.000629425048828125, -0.0220947265625, 0.0301513671875, 0.003204345703125, 0.01153564453125, -0.00191...

[ 130664, 20650, 18499, 7, 45064, 2051, 2500, 6953, 5612, 23, 20625, 142508, 366, 1556, 54885, 2071, 442, 7722, 47, 104250, 114122, 2189, 17368, 9, 3444, 41866, 28412, 26008, 19069, 4677, 178036, 13, 3917, 44116, 38937, 209303, 6226, 7440, 10...

[ 0.210205078125, 0.103759765625, 0.24560546875, 0.0379638671875, 0.1832275390625, 0.21826171875, 0.150146484375, 0.0894775390625, 0.1856689453125, 0.07550048828125, 0.1505126953125, 0.2498779296875, 0.1326904296875, 0.139892578125, 0.17333984375, 0.009246826171875, 0.01324462890625, ...

embed

40120940_c0

40120940

haskell

0

Title: Iterating through list in reverse Problem title: Iterating through list in reverse Tags: haskell Problem: Iterating through list in reverse Assume the following (non-functioning) code, that takes a predicate such as (==2) and a list of integers, and drops only the last element of the list that satisfies the pred...

Iterating through list in reverse Iterating through list in reverse haskell Iterating Bool as:a Iterating through list in reverse Assume the following (non-functioning) code, that takes a predicate such as (==2) and a list of integers, and drops only the last element of the list that satisfies the predicate: This code ...

[ -0.002716064453125, 0.018798828125, 0.00775146484375, 0.0045166015625, -0.0002002716064453125, 0.0302734375, 0.00909423828125, -0.007049560546875, 0.025390625, -0.0130615234375, -0.0005950927734375, 0.00970458984375, -0.0038604736328125, -0.028564453125, 0.007781982421875, 0.0004997253...

[ 87, 67, 98767, 8305, 5303, 23, 39531, 184, 1556, 142508, 2460, 929, 237, 66596, 25632, 6431, 137175, 214, 18151, 51776, 1653, 2063, 69112, 10461, 892, 26255, 36069, 4734, 4568, 12830, 40407, 14602, 959, 4488, 123019, 7, 53418, 17, 720, 27...

[ 0.109375, 0.21142578125, 0.2166748046875, 0.1982421875, 0.228759765625, 0.11767578125, 0.26318359375, 0.195068359375, 0.1575927734375, 0.2186279296875, 0.16455078125, 0.244384765625, 0.0975341796875, 0.0467529296875, 0.04010009765625, 0.0926513671875, 0.1142578125, 0.03097534179687...

embed

66622074_c0

66622074

haskell

0

Title: Restrict autocompletion with HLS and vscode Problem title: Restrict autocompletion with HLS and vscode Tags: haskell-language-server, visual-studio-code, haskell Problem: Restrict autocompletion with HLS and vscode Autocompletion in the Haskell Language Server (with VScode) gives suggestions before a single char...

Restrict autocompletion with HLS and vscode Restrict autocompletion with HLS and vscode haskell-language-server visual-studio-code haskell Restrict HLS Restrict autocompletion with HLS and vscode Autocompletion in the Haskell Language Server (with VScode) gives suggestions before a single character in the next word is ...

[ -0.0081787109375, -0.007659912109375, 0.003692626953125, 0.0022430419921875, -0.0029296875, 0.00176239013671875, 0.004486083984375, 0.00347900390625, -0.00086212158203125, 0.01300048828125, -0.006866455078125, 0.0029449462890625, 0.01470947265625, 0.00933837890625, -0.001373291015625, ...

[ 853, 144225, 1809, 277, 8705, 678, 572, 19759, 136, 20209, 40899, 1556, 142508, 196651, 39642, 21176, 52629, 4396, 20625, 83658, 22687, 44160, 76199, 157666, 8108, 11001, 62816, 11737, 2565, 10644, 17137, 6506, 15190, 27983, 351, 100033, 7986, ...

[ 0.041290283203125, 0.20849609375, 0.20556640625, 0.126708984375, 0.2122802734375, 0.05322265625, 0.1207275390625, 0.214111328125, 0.031463623046875, 0.13671875, 0.22021484375, 0.1343994140625, 0.212890625, 0.0965576171875, 0.09014892578125, 0.1441650390625, 0.1298828125, 0.17883300...

embed

6939043_c0

6939043

haskell

0

Title: Is it possible to place inequality constraints on haskell type variables? Problem title: Is it possible to place inequality constraints on haskell type variables? Tags: type-systems, type-inference, haskell Problem: Is it possible to place inequality constraints on haskell type variables? Is it possible to place...

Is it possible to place inequality constraints on haskell type variables? Is it possible to place inequality constraints on haskell type variables? type-systems type-inference haskell Is it possible to place inequality constraints on haskell type variables? Is it possible to place an inequality constraint on the typeva...

[ 0.0191650390625, -0.006561279296875, -0.00244140625, -0.009765625, -0.01153564453125, -0.01092529296875, -0.01806640625, -0.0142822265625, -0.0130615234375, 0, 0.0022430419921875, -0.011962890625, 0.00811767578125, -0.00098419189453125, 0.01611328125, 0.0093994140625, -0.0107421875, ...

[ 7722, 3687, 23, 13, 161789, 158, 2816, 4288, 98, 1556, 142508, 10644, 77336, 16751, 69988, 442, 7, 2071, 21690, 19736, 32354, 253, 21, 5775, 31, 1984, 6780, 876, 44357, 33079, 527, 73265, 14449, 54, 144681, 8951, 3917, 31380, 238, 5303, ...

[ 0.1566162109375, 0.116455078125, 0.10467529296875, 0.1136474609375, 0.2215576171875, 0.09344482421875, 0.192626953125, 0.155517578125, 0.053924560546875, 0.133544921875, 0.2196044921875, 0.1668701171875, 0.1951904296875, 0.06829833984375, 0.088134765625, 0.006988525390625, 0.05798339...

embed

58827023_c1

58827023

haskell

1

0, 0, 0,-20,-20]] adder::[[Int]] -> [[Int]] adder ((xa:xb:xc:xd:xe):(ya:yb:yc:yd:ye)) | xc >= 10 = adder ((xb:xc:(xd+1):xe):((yb+1):(yc+1):(yd+1):ye)) | otherwise = adder ((xb:xc:xd:xe):(yb:yc:yd:ye)) I also dont know how to apply xa : adder ... which we could do fairly easily if it was a single list. Any ideas how to ...

[ -0.0036163330078125, 0.005584716796875, -0.00579833984375, 0.01068115234375, -0.0302734375, 0.00167083740234375, -0.005157470703125, -0.00299072265625, 0.01239013671875, 0.0079345703125, 0.0264892578125, 0.0115966796875, 0.017578125, -0.01068115234375, -0.004913330078125, -0.0244140625...

[ 757, 11033, 86245, 606, 820, 12, 4153, 18, 33079, 60494, 3798, 425, 275, 238, 71, 4878, 395, 23811, 53, 11073, 1033, 1022, 977, 209, 2203, 21748, 120262, 13319, 3714, 3642, 59911, 2459, 152, 72546, 11001, 5303, 25647, 30022, 903, 18151, ...

[ 0.1236572265625, 0.173095703125, 0.06414794921875, 0.1497802734375, 0.2470703125, 0.0240325927734375, 0.0863037109375, 0.1087646484375, 0.0521240234375, 0.00048828125, 0.147216796875, 0.05914306640625, 0.06719970703125, 0.104736328125, 0.00665283203125, 0.1148681640625, 0.11340332031...

embed

10395761_c0

10395761

haskell

0

Title: Absolute value of negative zero - bug, or a part of the floating point standard? Problem title: Absolute value of negative zero - bug, or a part of the floating point standard? Tags: floating-point, haskell Problem: Absolute value of negative zero - bug, or a part of the floating point standard? I know that sign...

Absolute value of negative zero - bug, or a part of the floating point standard? Absolute value of negative zero - bug, or a part of the floating point standard? floating-point haskell Absolute Prelude Absolute value of negative zero - bug, or a part of the floating point standard? I know that signed zeros are used to ...

[ 0.0179443359375, -0.018798828125, 0.004547119140625, -0.0111083984375, -0.00677490234375, 0.0013427734375, 0.0284423828125, 0.007293701171875, -0.011474609375, 0.03173828125, -0.00518798828125, -0.010009765625, -0.00958251953125, 0.0052490234375, 0.0002956390380859375, -0.013916015625,...

[ 101397, 13, 34292, 111, 40907, 45234, 54608, 2831, 21917, 26518, 6275, 5570, 20, 38496, 1556, 142508, 1914, 822, 112, 707, 181141, 7, 11814, 157167, 1379, 118664, 1295, 24491, 101935, 41965, 54700, 18425, 12319, 89931, 99929, 5608, 186, 89678...

[ 0.1947021484375, 0.099365234375, 0.25390625, 0.07757568359375, 0.2578125, 0.286376953125, 0.257568359375, 0.122314453125, 0.160888671875, 0.0819091796875, 0.1209716796875, 0.18603515625, 0.05487060546875, 0.085205078125, 0.10650634765625, 0.2379150390625, 0.0899658203125, 0.1877441...

embed

34688983_c0

34688983

haskell

0

Title: More Descriptive Error Messages From GHC Problem title: More Descriptive Error Messages From GHC Tags: error-handling, ghci, haskell, indexing Problem: More Descriptive Error Messages From GHC I ran some code through GHCI, and got this error: *** Exception: Prelude.!!: index too large After a while I went on to ...

More Descriptive Error Messages From GHC More Descriptive Error Messages From GHC error-handling ghci haskell indexing More Descriptive Error Messages GHC Exception Prelude More Descriptive Error Messages From GHC I ran some code through GHCI, and got this error: After a while I went on to fix the bug (which was caused...

[ 0.0130615234375, 0.01214599609375, 0.005218505859375, 0.007568359375, 0.01263427734375, 0.0133056640625, -0.017333984375, -0.000835418701171875, -0.00225830078125, -0.01806640625, 0.01513671875, -0.046875, 0.0177001953125, 0.01495361328125, 0.02001953125, 0.0005340576171875, 0.029418...

[ 5455, 262, 32032, 5844, 212059, 48205, 28090, 527, 73265, 18499, 54885, 31380, 318, 1556, 142508, 63262, 63928, 1914, 822, 13028, 18151, 8305, 41877, 17304, 903, 12960, 30022, 54608, 143434, 13648, 28987, 390, 142, 450, 509, 5792, 21334, 3259...

[ 0.087646484375, 0.0721435546875, 0.160888671875, 0.0706787109375, 0.1326904296875, 0.05743408203125, 0.056304931640625, 0.091796875, 0.2117919921875, 0.1778564453125, 0.10211181640625, 0.125732421875, 0.1583251953125, 0.104736328125, 0.2110595703125, 0.235107421875, 0.09912109375, ...

embed

38167924_c0

38167924

haskell

0

Title: How to make LLVM-3.7 default on Raspberry Pi? Problem title: How to make LLVM-3.7 default on Raspberry Pi? Tags: haskell, raspbian, raspberry-pi, llvm Problem: How to make LLVM-3.7 default on Raspberry Pi? I'm on the default Raspbian OS and sudo apt-get install llvm seems to install llvm-3.5 with a bunch of soft...

How to make LLVM-3.7 default on Raspberry Pi? How to make LLVM-3.7 default on Raspberry Pi? haskell raspbian raspberry-pi llvm How LLVM-3.7 Raspberry llvm-3.5 llvm-link-3.5 How to make LLVM-3.7 default on Raspberry Pi? I'm on the default Raspbian OS and sudo apt-get install llvm seems to install llvm-3.5 with a bunch o...

[ 0.000244140625, 0.0162353515625, 0.01397705078125, 0.004150390625, -0.006317138671875, -0.0269775390625, -0.004608154296875, -0.02197265625, -0.0015716552734375, 0.013916015625, -0.00083160400390625, 0.0029296875, 0.00860595703125, 0.01953125, 0.006011962890625, 0.0032806396484375, 0...

[ 11249, 47, 3249, 99954, 47599, 9, 109981, 114977, 98, 225291, 3065, 1556, 142508, 61375, 62806, 53623, 1434, 96, 3723, 39, 72516, 10187, 22071, 254, 11787, 166, 246, 1747, 18, 3794, 20600, 10, 147306, 111, 32977, 22317, 5062, 6275, 214, 4...

[ 0.108642578125, 0.059814453125, 0.139404296875, 0.1636962890625, 0.312744140625, 0.061279296875, 0.313720703125, 0.288330078125, 0.09039306640625, 0.229248046875, 0.2308349609375, 0.088623046875, 0.2159423828125, 0.08551025390625, 0.181396484375, 0.1558837890625, 0.162841796875, 0....

embed

20765979_c0

20765979

haskell

0

Title: C++ equivalent of algebraic datatype? Problem title: C++ equivalent of algebraic datatype? Tags: haskell, c%2B%2B, algebraic-data-types Problem: C++ equivalent of algebraic datatype? Let's say I have this Haskell code: data RigidBody = RigidBody Vector3 Vector3 Float Shape -- position, velocity, mass and shape d...

C++ equivalent of algebraic datatype? C++ equivalent of algebraic datatype? haskell c%2B%2B algebraic-data-types RigidBody Vector3 Float Shape Ball ConvexPolygon Triangle Rigid_body glm::vec3 C++ equivalent of algebraic datatype? Let's say I have this Haskell code: What would be the best way to express this in C++? The...

[ 0.019287109375, 0.0277099609375, -0.0101318359375, 0.0311279296875, -0.00164794921875, 0.0263671875, -0.00628662109375, 0.004150390625, 0.00160980224609375, -0.0120849609375, 0.00537109375, -0.028076171875, -0.0032501220703125, 0.01470947265625, 0, 0.01141357421875, 0.0162353515625, ...

[ 313, 37223, 183234, 111, 144, 429, 2844, 1771, 2053, 50986, 1556, 142508, 501, 10135, 129956, 532, 12647, 1459, 2609, 18770, 363, 38699, 257, 7224, 1081, 21786, 1657, 272, 538, 6126, 4699, 109217, 37873, 39575, 39, 35259, 20625, 18151, 2965...

[ 0.0902099609375, 0.2919921875, 0.1812744140625, 0.0550537109375, 0.03692626953125, 0.0989990234375, 0.154296875, 0.068359375, 0.1322021484375, 0.2481689453125, 0.1221923828125, 0.2353515625, 0.0537109375, 0.126220703125, 0.1279296875, 0.128173828125, 0.1126708984375, 0.029113769531...

embed

71110804_c0

71110804

haskell

0

Title: Removed item from a list comes back Problem title: Removed item from a list comes back Tags: haskell, io, loops, monads Problem: Removed item from a list comes back I want to remove an item from a list, but it comes back. main = do let y = ["aa","bb","cc","dd","ee","ff"] let n = length y replicateM_ (n-1) (delet...

Removed item from a list comes back Removed item from a list comes back haskell io loops monads a Removed replicateM_ n-1 Write new_y Main Removed item from a list comes back I want to remove an item from a list, but it comes back. Output: I want that the "aa" and "bb" stay removed and not come back into the list.

[ -0.024658203125, 0.0164794921875, -0.010498046875, 0.0233154296875, -0.0031890869140625, 0.01226806640625, 0.0234375, 0.007415771484375, 0.0106201171875, -0.0113525390625, 0.0220947265625, -0.0074462890625, -0.00173187255859375, 0.00469970703125, 0.007659912109375, 0.003082275390625, ...

[ 181139, 71, 35735, 1295, 10, 5303, 32497, 4420, 1556, 142508, 22995, 40956, 2667, 712, 143126, 67, 594, 454, 653, 5759, 18781, 3525, 53, 12321, 3444, 47, 87388, 1284, 442, 13538, 7077, 87, 450, 70, 11, 136, 5125, 24765, 184750, 959, 138...

[ 0.224365234375, 0.1151123046875, 0.1986083984375, 0.1563720703125, 0.059295654296875, 0.2117919921875, 0.162841796875, 0.255126953125, 0.1358642578125, 0.2137451171875, 0.1903076171875, 0.167724609375, 0.09271240234375, 0.10302734375, 0.2012939453125, 0.04083251953125, 0.067077636718...

embed

8163247_c0

8163247

haskell

0

Title: How can I use other fonts in Glut - Fungen - Haskell Problem title: How can I use other fonts in Glut - Fungen - Haskell Tags: haskell, glut, bitmap-fonts Problem: How can I use other fonts in Glut - Fungen - Haskell I'm using the Fungen framework for Haskell and there is a function that uses BitmapFonts. The th...

How can I use other fonts in Glut - Fungen - Haskell How can I use other fonts in Glut - Fungen - Haskell haskell glut bitmap-fonts How Glut Fungen Haskell How can I use other fonts in Glut - Fungen - Haskell I'm using the Fungen framework for Haskell and there is a function that uses BitmapFonts. The thing is, that th...

[ 0, 0.006072998046875, -0.030517578125, -0.004669189453125, 0.007659912109375, -0.01708984375, 0.00024318695068359375, -0.0142822265625, -0.003570556640625, 0.00579833984375, -0.002838134765625, -0.041259765625, 0.01104736328125, -0.0036773681640625, 0.003326416015625, -0.0205078125, ...

[ 11249, 831, 4527, 3789, 12401, 7, 23, 80488, 18, 563, 7462, 20625, 142508, 20, 1556, 167994, 4785, 62346, 75635, 170846, 32354, 27774, 27591, 16037, 4734, 143662, 2053, 919, 7934, 96746, 1019, 75358, 2681, 1126, 1837, 19114, 158271, 963, 23...

[ 0.036468505859375, 0.06671142578125, 0.1448974609375, 0.132080078125, 0.2152099609375, 0.033203125, 0.0355224609375, 0.18701171875, 0.138671875, 0.037322998046875, 0.1788330078125, 0.123291015625, 0.2374267578125, 0.002532958984375, 0.092529296875, 0.191650390625, 0.03851318359375, ...

embed

37120423_c0

37120423

haskell

0

Title: read::Int not working in Haskell in example Problem title: read::Int not working in Haskell in example Tags: haskell Problem: read::Int not working in Haskell in example Here is the problem. It looks simple yet main = do s <- getContents let list = map (read::Int) (words s) print list Couldn't match expected typ...

read::Int not working in Haskell in example read::Int not working in Haskell in example haskell read::Int Haskell Couldn Probable read::Int not working in Haskell in example Here is the problem. It looks simple yet The problem was that I thought :: is like casting and I have to put the return type. The solution was to ...

[ -0.0169677734375, -0.0078125, 0.0034027099609375, 0.004180908203125, -0.0213623046875, 0.01446533203125, 0.00006246566772460938, -0.0205078125, -0.00994873046875, -0.006591796875, 0.01397705078125, -0.05615234375, 0.0027618408203125, 0.0019378662109375, 0.0135498046875, -0.030517578125...

[ 12301, 12, 4153, 18, 959, 20697, 23, 20625, 142508, 27781, 1556, 191147, 1250, 275, 2967, 33342, 8781, 14373, 17569, 1984, 1884, 176050, 30646, 10644, 29806, 15190, 4393, 36663, 58745, 137175, 138256, 5967 ]

[ 0.219970703125, 0.03936767578125, 0.14453125, 0.1756591796875, 0.08837890625, 0.1475830078125, 0.0404052734375, 0.137939453125, 0.2161865234375, 0.2020263671875, 0.1107177734375, 0.0212554931640625, 0.040618896484375, 0.1019287109375, 0.0635986328125, 0.04119873046875, 0.006530761718...

embed

47170429_c0

47170429

haskell

0

Title: Adding corresponding values of Tuple in a list in Haskell Problem title: Adding corresponding values of Tuple in a list in Haskell Tags: tuples, list, haskell Problem: Adding corresponding values of Tuple in a list in Haskell I have a list for example: [(1,2),(3,4),(5,6)] and the function should return me the su...

Adding corresponding values of Tuple in a list in Haskell Adding corresponding values of Tuple in a list in Haskell tuples list haskell Adding Tuple Haskell Adding corresponding values of Tuple in a list in Haskell I have a list for example: [(1,2),(3,4),(5,6)] and the function should return me the sum of the correspon...

[ 0.004608154296875, 0.0028533935546875, 0.0123291015625, 0.021728515625, -0.0108642578125, 0.011474609375, -0.0262451171875, -0.00421142578125, 0.015869140625, -0.01202392578125, -0.00130462646484375, -0.00872802734375, 0.00238037109375, 0.0208740234375, -0.005859375, 0.01129150390625, ...

[ 62, 59725, 42518, 214, 142424, 1371, 8705, 5303, 20625, 142508, 23, 370, 99726, 1556, 87, 765, 27781, 133063, 82449, 104629, 32354, 5608, 30646, 163, 10554, 903, 23817, 55102, 3714, 3642, 3249, 15190, 1257, 11651, 19441, 63134, 20594, 2856, ...

[ 0.10986328125, 0.094482421875, 0.22021484375, 0.06982421875, 0.1910400390625, 0.1837158203125, 0.25634765625, 0.21826171875, 0.147216796875, 0.237548828125, 0.0537109375, 0.17626953125, 0.25830078125, 0.1397705078125, 0.006500244140625, 0.03253173828125, 0.0660400390625, 0.10632324...

embed

61189188_c0

61189188

haskell

0

Title: Reassignment in ghci Problem title: Reassignment in ghci Tags: haskell, ghci Problem: Reassignment in ghci Is it possible to reassign the same variable in ghci ? Of course this isn't possible in normal Haskell (at least without something like an IORef), but I was curious because the it variable in ghci that you ...

Reassignment in ghci Reassignment in ghci haskell ghci Reassignment Num Reassignment in ghci Is it possible to reassign the same variable in ghci ? Of course this isn't possible in normal Haskell (at least without something like an IORef), but I was curious because the it variable in ghci that you get by enabling the :...

[ -0.0162353515625, -0.004913330078125, 0.007781982421875, 0.0130615234375, 0.01202392578125, 0.0057373046875, -0.01544189453125, 0.016357421875, 0.01116943359375, -0.01251220703125, 0.0018157958984375, -0.0250244140625, -0.00007295608520507812, 0.006500244140625, 0.0179443359375, 0.0108...

[ 853, 162, 31304, 674, 31380, 318, 23, 1556, 142508, 52782, 442, 7722, 47, 456, 5701, 77336, 3638, 20625, 123435, 4240, 11, 79298, 152, 39, 35829, 225081, 16981, 191984, 2886, 959, 128239, 11737, 125195, 3917, 92154, 21543, 61799, 24, 4806, ...

[ 0.129638671875, 0.1346435546875, 0.239501953125, 0.0062255859375, 0.1361083984375, 0.2098388671875, 0.06597900390625, 0.1072998046875, 0.2249755859375, 0.154296875, 0.1300048828125, 0.14404296875, 0.036865234375, 0.1563720703125, 0.1302490234375, 0.252197265625, 0.0209808349609375, ...

embed

6322232_c0

6322232

haskell

0

Title: `Ord a =>` or `Num a =>` Problem title: `Ord a =>` or `Num a =>` Tags: types, haskell, function, list, type-signature Problem: `Ord a =>` or `Num a =>` I have the following functions: which (x:xs) = worker x xs worker x [] = x worker x (y:ys) | x > y = worker y ys | otherwise = worker x ys and am won...

`Ord a =>` or `Num a =>` `Ord a =>` or `Num a =>` types haskell function list type-signature Ord Num x:xs y:ys `Ord a =>` or `Num a =>` I have the following functions: and am wondering how I should define the types signatures of these above functions which and worker ? For Example, which of the following wa...

[ 0.006103515625, -0.0023345947265625, -0.0040283203125, -0.019775390625, -0.0068359375, 0.0086669921875, -0.00750732421875, -0.00008296966552734375, 0.017333984375, -0.00677490234375, -0.002655029296875, -0.03955078125, 0.007781982421875, -0.00726318359375, -0.0108642578125, -0.01367187...

[ 143045, 10, 2203, 5386, 707, 839, 316, 52895, 1556, 142508, 32354, 5303, 10644, 137432, 35379, 52782, 1022, 425, 113, 4778, 44357, 25632, 149016, 5608, 61924, 138256, 7, 36917, 3129, 136, 4488, 56, 48322, 2806, 186, 2965, 237, 100, 1984, ...

[ 0.2119140625, 0.181884765625, 0.0193023681640625, 0.1033935546875, 0.04248046875, 0.0772705078125, 0.1895751953125, 0.23583984375, 0.133544921875, 0.2059326171875, 0.17626953125, 0.1044921875, 0.240478515625, 0.1666259765625, 0.2198486328125, 0.2125244140625, 0.03704833984375, 0.04...

embed

10619678_c1

10619678

haskell

1

't figure out how to write the function bind so that it modifies the environment. My second thought was to use local : evalIf :: [LispVal] -> EvalM LispVal evalIf [test, consequent, alternate] = do result <- eval test local (bind "it" result) $ case (truthVal result) of True -> eval consequent False -> eval alternate B...

[ -0.03271484375, 0.01123046875, -0.005279541015625, -0.00007104873657226562, -0.004486083984375, -0.0017242431640625, 0.00518798828125, -0.00787353515625, 0.0098876953125, -0.01043701171875, -0.0028533935546875, 0.0225830078125, 0.0103759765625, 0.0126953125, 0.022705078125, 0.011840820...

[ 26366, 3642, 33022, 32354, 68557, 73197, 90, 65998, 17932, 17569, 4527, 4000, 28, 1405, 91306, 9506, 7008, 42272, 594, 1261, 6954, 210435, 75939, 54, 16750, 3034, 89817, 217, 3650, 7225, 75481, 87599, 22225, 3688, 27117, 10644, 357, 334, 12...

[ 0.05633544921875, 0.034759521484375, 0.1597900390625, 0.1978759765625, 0.28857421875, 0.227294921875, 0.09466552734375, 0.2203369140625, 0.0069580078125, 0.064453125, 0.0550537109375, 0.1220703125, 0.0264739990234375, 0.2071533203125, 0.161865234375, 0.073486328125, 0.082763671875, ...

embed

12187825_c0

12187825

haskell

0

Title: How to export function from haskell containing data types through FFI Problem title: How to export function from haskell containing data types through FFI Tags: ffi, haskell Problem: How to export function from haskell containing data types through FFI I am able to export simple haskell functions through FFI con...

How to export function from haskell containing data types through FFI How to export function from haskell containing data types through FFI ffi haskell haskell How FFI SomeType SomeOtherType How to export function from haskell containing data types through FFI I am able to export simple haskell functions through FFI co...

[ 0.025634765625, -0.002593994140625, -0.0106201171875, 0.0054931640625, -0.01123046875, 0.00201416015625, 0.0128173828125, 0.0023956298828125, 0.0023040771484375, -0.016845703125, 0.00787353515625, -0.04248046875, -0.0003223419189453125, 0.00897216796875, 0.0172119140625, -0.00601196289...

[ 11249, 47, 31255, 32354, 1295, 1556, 142508, 70541, 2053, 52895, 8305, 563, 22724, 24500, 31384, 196707, 9319, 19048, 8781, 5570, 3714, 3642, 51776, 10644, 3789, 3501, 831, 54, 8912, 282, 64113, 144573, 60525, 27781 ]

[ 0.0574951171875, 0.038330078125, 0.256591796875, 0.22900390625, 0.115966796875, 0.144287109375, 0.2379150390625, 0.1044921875, 0.10064697265625, 0.195068359375, 0.0626220703125, 0.123046875, 0.2509765625, 0.2021484375, 0.03515625, 0.19677734375, 0.02880859375, 0.019683837890625, ...

embed

40585781_c0

40585781

haskell

0

Title: How do I get the terminal size? Problem title: How do I get the terminal size? Tags: terminal, haskell, environment-variables Problem: How do I get the terminal size? In bash there are two environmental variables: COLUMNS and LINES that store the number of columns and rows for the terminal. I have been trying to...

How do I get the terminal size? How do I get the terminal size? terminal haskell environment-variables How COLUMNS LINES How do I get the terminal size? In bash there are two environmental variables: COLUMNS and LINES that store the number of columns and rows for the terminal. I have been trying to obtain that informat...

[ 0.0152587890625, -0.00787353515625, -0.005584716796875, 0.01348876953125, -0.0002651214599609375, -0.005157470703125, 0.01904296875, -0.007781982421875, -0.008056640625, -0.0126953125, 0.006439208984375, -0.00201416015625, -0.0181884765625, 0.006805419921875, -0.002349853515625, 0.0191...

[ 11249, 2046, 70, 33949, 13267, 87, 1556, 142508, 65998, 21690, 19736, 8244, 80134, 22479, 130028, 294, 54, 360, 87109, 6626, 156444, 77336, 136, 4343, 14012, 3365, 316, 15555, 100, 113054, 4677, 20625, 21922, 53, 11675, 6032, 74481, 114977, ...

[ 0.0682373046875, 0.14599609375, 0.1092529296875, 0.2998046875, 0.253173828125, 0.02398681640625, 0.135009765625, 0.2412109375, 0.134033203125, 0.0999755859375, 0.014007568359375, 0.046295166015625, 0.1656494140625, 0.1002197265625, 0.19775390625, 0.0253143310546875, 0.03167724609375,...

embed

26435042_c0

26435042

haskell

0

Title: Haskell - How do filter and head work in combination with where? Problem title: Haskell - How do filter and head work in combination with where? Tags: haskell Problem: Haskell - How do filter and head work in combination with where? Here's the code. largestDivisible :: (Integral a) => a largestDivisible = head (...

Haskell - How do filter and head work in combination with where? Haskell - How do filter and head work in combination with where? haskell Haskell How Integral Haskell - How do filter and head work in combination with where? Here's the code. I am little bit confused. What is p in this case? Also, I do not understand the...

[ 0.00274658203125, 0.016357421875, -0.019287109375, -0.0096435546875, 0.01806640625, 0.0228271484375, 0.000621795654296875, -0.014892578125, 0.01025390625, -0.006988525390625, 0.02001953125, -0.0091552734375, 0.00921630859375, -0.01080322265625, -0.0054931640625, -0.01171875, 0.018798...

[ 20625, 142508, 11249, 46312, 136, 10336, 4488, 23, 162515, 678, 7440, 54, 1556, 204681, 18151, 10176, 55681, 4865, 83, 915, 7225, 959, 28219, 125195, 27781, 6626, 1022, 25737, 5609, 1632, 143420, 20653, 337, 31, 34677, 77947, 73342, 36917 ]

[ 0.14208984375, 0.24609375, 0.109619140625, 0.25341796875, 0.11376953125, 0.232666015625, 0.1429443359375, 0.040069580078125, 0.1806640625, 0.080810546875, 0.195556640625, 0.0230865478515625, 0.11865234375, 0.205810546875, 0.1005859375, 0.0213623046875, 0.05438232421875, 0.042541503...

embed

20622390_c0

20622390

haskell

0

Title: Is haskellmode-vim dead? Problem title: Is haskellmode-vim dead? Tags: haskell, haskell-mode, vim Problem: Is haskellmode-vim dead? I just disabled haskellmode-vim from my plugin configurations. Basically this was for three reasons: I prefer neocomplcache for my auto completion needs. Apparently it wasn't update...

Is haskellmode-vim dead? Is haskellmode-vim dead? haskell haskell-mode vim Is haskellmode-vim dead? I just disabled haskellmode-vim from my plugin configurations. Basically this was for three reasons: I prefer neocomplcache for my auto completion needs. Apparently it wasn't updated since 2010. It doesn't seem to be com...

[ 0.00167083740234375, 0.005218505859375, 0.0174560546875, -0.0029296875, -0.0006103515625, 0.0291748046875, -0.0174560546875, -0.00054168701171875, -0.004180908203125, -0.033447265625, -0.00189971923828125, -0.0108642578125, 0.0012054443359375, -0.005157470703125, -0.008056640625, -0.02...

[ 2071, 1556, 142508, 61170, 9, 29671, 103494, 32, 119916, 238335, 1295, 69993, 180346, 17262, 89397, 12601, 16169, 58875, 66218, 1430, 1809, 21721, 27117, 58954, 18, 150011, 16792, 15431, 146731, 678, 109524, 15673, 88203, 13380, 1239, 153837, 2...

[ 0.079833984375, 0.172607421875, 0.259033203125, 0.2435302734375, 0.0625, 0.28173828125, 0.20849609375, 0.0328369140625, 0.283203125, 0.1744384765625, 0.0243377685546875, 0.1983642578125, 0.16552734375, 0.0771484375, 0.011566162109375, 0.10986328125, 0.1671142578125, 0.1593017578125...

embed

72479926_c0

72479926

haskell

0

Title: Download file from URL with Haskell Problem title: Download file from URL with Haskell Tags: haskell Problem: Download file from URL with Haskell I want to download a file/zip archiv. (for example the new ubuntu iso, oe...) I came across following answer from daydaynatation in this: question downloadFile :: Stri...

Download file from URL with Haskell Download file from URL with Haskell haskell URL Download Haskell Download file from URL with Haskell I want to download a file/zip archiv. (for example the new ubuntu iso, oe...) I came across following answer from daydaynatation in this: question but sadly this downloads only the th...

[ -0.0244140625, 0.019775390625, 0.007354736328125, 0.021484375, 0.00775146484375, -0.004486083984375, -0.0174560546875, -0.00927734375, -0.01409912109375, -0.0252685546875, 0.004913330078125, -0.0341796875, -0.017578125, 0.0234375, -0.005035400390625, 0.00933837890625, 0.0024261474609...

[ 4857, 11435, 1295, 31862, 678, 20625, 142508, 1556, 3444, 47, 7026, 10, 64, 50836, 43878, 27781, 3525, 198996, 13882, 36, 13, 12399, 35166, 76, 22062, 9655, 17110, 903, 4734, 1764, 41, 1181, 40899, 959, 56136, 107013, 25002, 31842, 44126, ...

[ 0.1544189453125, 0.1483154296875, 0.1318359375, 0.2120361328125, 0.13330078125, 0.1676025390625, 0.26220703125, 0.1490478515625, 0.08203125, 0.029510498046875, 0.1685791015625, 0.004547119140625, 0.0271148681640625, 0.1458740234375, 0.189453125, 0.009918212890625, 0.03240966796875, ...

embed

55213250_c0

55213250

haskell

0

Title: Checking divisibility for Bool always results in false Problem title: Checking divisibility for Bool always results in false Tags: haskell Problem: Checking divisibility for Bool always results in false I'm trying to check for leap years, which are "years either divisible by 400 or divisible by 4 but not divisib...

Checking divisibility for Bool always results in false Checking divisibility for Bool always results in false haskell Checking Bool Checking divisibility for Bool always results in false I'm trying to check for leap years, which are "years either divisible by 400 or divisible by 4 but not divisible by 100." Removing on...

[ -0.012451171875, 0.005218505859375, -0.002349853515625, 0.0084228515625, 0.0181884765625, 0.00299072265625, -0.006805419921875, -0.0216064453125, 0.00457763671875, 0.033935546875, -0.006256103515625, 0.00064849853515625, 0.006683349609375, -0.005035400390625, -0.004791259765625, 0.0170...

[ 38679, 45, 37712, 83259, 100, 2460, 929, 11343, 50339, 98320, 1556, 142508, 23, 31577, 12765, 95, 2631, 5369, 46799, 99017, 390, 4082, 201, 1284, 959, 805, 432, 27289, 7464, 18, 30646, 29568, 8561, 70, 97, 34292, 370, 8705, 54529, 154732,...

[ 0.1539306640625, 0.10009765625, 0.1785888671875, 0.10693359375, 0.043182373046875, 0.1005859375, 0.2037353515625, 0.1265869140625, 0.076416015625, 0.216552734375, 0.106201171875, 0.194580078125, 0.006134033203125, 0.01849365234375, 0.1551513671875, 0.06298828125, 0.1168212890625, 0...

embed

11792586_c2

11792586

haskell

2

3] Compiling Scion.PersistentHoogle ( src\Scion\PersistentHoogle.hs, dist\build\scion-browser\scion-browser-tmp\Scion\PersistentHoogle.o )<br/> [21 of 23] Compiling Paths_scion_browser ( dist\build\autogen\Paths_scion_browser.hs, Code signals: MonadException, a, Error, Windows, Compiling, Scion.PersistentBrowser, Scion...

[ -0.00060272216796875, 0.0283203125, -0.00701904296875, -0.002960205078125, -0.0022735595703125, 0.028076171875, -0.004852294921875, -0.0087890625, -0.020263671875, 0.004669189453125, -0.005889892578125, 0.000499725341796875, 0.01409912109375, 0.0004024505615234375, 0.0029296875, -0.016...

[ 138, 268, 15612, 49725, 159, 6447, 5, 15277, 7, 6892, 18, 11193, 1663, 133, 19437, 294, 127, 271, 177149, 215725, 2676, 31, 3267, 3117, 1105, 108421, 45, 8913, 1409, 10519, 28864, 26073, 60331, 71, 19279, 63928, 10, 212059, 3773, 15555, ...

[ 0.107177734375, 0.015716552734375, 0.174072265625, 0.2120361328125, 0.0931396484375, 0.200439453125, 0.0176239013671875, 0.06549072265625, 0.1365966796875, 0.1783447265625, 0.09930419921875, 0.0975341796875, 0.1905517578125, 0.2122802734375, 0.0911865234375, 0.0399169921875, 0.130615...

embed