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
8807539_c0	8807539	haskell	0	Title: Does the term "monadic" in J have anything to do with its Haskell use? Problem title: Does the term "monadic" in J have anything to do with its Haskell use? Tags: monads, haskell, terminology, j Problem: Does the term "monadic" in J have anything to do with its Haskell use? (Sorry, I'm stupid...	Does the term "monadic" in J have anything to do with its Haskell use? Does the term "monadic" in J have anything to do with its Haskell use? monads haskell terminology j Does Haskell Does the term "monadic" in J have anything to do with its Haskell use? (Sorry, I'm stupid and uneducated, so this is...	[ -0.0098876953125, 0.0123291015625, 0.007720947265625, 0.01239013671875, -0.00616455078125, 0.01220703125, -0.00118255615234375, 0.0225830078125, -0.004974365234375, -0.031982421875, -0.00421142578125, -0.019775390625, 0.006072998046875, -0.006134033203125, -0.013427734375, 0.0070800781...	[ 13579, 87039, 18403, 23, 821, 23937, 54, 20625, 142508, 4527, 47, 2667, 712, 7, 1556, 18614, 25443, 1647, 101790, 765, 678, 110833, 108343, 31895, 236873, 9655, 69407, 136, 1459, 11, 37202, 220, 1294, 2394, 6635, 39933, 44084, 33444, 3687, ...	[ 0.15869140625, 0.1741943359375, 0.1978759765625, 0.058746337890625, 0.1982421875, 0.05828857421875, 0.097900390625, 0.121826171875, 0.2359619140625, 0.07049560546875, 0.0280914306640625, 0.1102294921875, 0.1375732421875, 0.03558349609375, 0.08544921875, 0.045623779296875, 0.009765625...	embed
67879145_c0	67879145	haskell	0	Title: Adding elements of two lists in haskell Problem title: Adding elements of two lists in haskell Tags: haskell Problem: Adding elements of two lists in haskell add_lists list1 list2: returns the sum of the elements in the same position in each list as a new list. If one list is shorter than the other, assume that ...	Adding elements of two lists in haskell Adding elements of two lists in haskell haskell Adding add_lists list1 list2 length.list1 length.list2 length.list2-length.list1 Adding elements of two lists in haskell add_lists list1 list2: returns the sum of the elements in the same position in each list as a new list. If one ...	[ -0.00811767578125, 0.0260009765625, -0.00946044921875, 0.00994873046875, -0.00921630859375, 0.0286865234375, -0.00098419189453125, 0.00738525390625, 0.010498046875, -0.0155029296875, 0.028564453125, -0.022705078125, 0.0081787109375, 0.029296875, 0.0167236328125, -0.018798828125, 0.01...	[ 62, 59725, 80854, 111, 6626, 5303, 7, 1556, 142508, 23, 15190, 6562, 418, 304, 140909, 18504, 30646, 10554, 5701, 19069, 12638, 237, 3525, 1632, 16610, 56, 3789, 41591, 45234, 45188, 214, 44677, 792, 18151, 13695, 20949, 18499 ]	[ 0.117919921875, 0.139892578125, 0.20556640625, 0.06048583984375, 0.17724609375, 0.232421875, 0.0843505859375, 0.1607666015625, 0.228271484375, 0.00811767578125, 0.1798095703125, 0.22265625, 0.04632568359375, 0.1441650390625, 0.09271240234375, 0.07080078125, 0.1365966796875, 0.16442...	embed
13692984_c0	13692984	haskell	0	Title: How will issues with MonadCatchIO affect apps build with the Snap framework in the future? Problem title: How will issues with MonadCatchIO affect apps build with the Snap framework in the future? Tags: haskell-snap-framework, haskell Problem: How will issues with MonadCatchIO affect apps build with the Snap fra...	How will issues with MonadCatchIO affect apps build with the Snap framework in the future? How will issues with MonadCatchIO affect apps build with the Snap framework in the future? haskell-snap-framework haskell How MonadCatchIO Snap How will issues with MonadCatchIO affect apps build with the Snap framework in the fu...	[ -0.009521484375, 0.0213623046875, -0.00433349609375, 0.010986328125, -0.017578125, 0.0137939453125, -0.01300048828125, 0.01220703125, 0.007080078125, 0.0024566650390625, -0.0035552978515625, -0.05712890625, -0.0169677734375, -0.016845703125, 0.0194091796875, -0.00860595703125, -0.005...	[ 11249, 1221, 37348, 678, 60331, 71, 76775, 206, 17780, 52490, 49966, 45367, 121190, 170846, 22690, 1556, 142508, 10957, 160328, 18244, 78684, 24124, 1631, 18507, 3688, 110527, 903, 149016, 3642, 2499, 47041, 158839, 31089, 1467, 9007, 43581, 11...	[ 0.09515380859375, 0.0650634765625, 0.1824951171875, 0.05230712890625, 0.155029296875, 0.1522216796875, 0.1446533203125, 0.1082763671875, 0.2322998046875, 0.1531982421875, 0.1849365234375, 0.152587890625, 0.25732421875, 0.2047119140625, 0.1329345703125, 0.07958984375, 0.194580078125, ...	embed
22792598_c0	22792598	haskell	0	Title: Defining a Boolean function on Haskell that determines if an element occurs once in a list Problem title: Defining a Boolean function on Haskell that determines if an element occurs once in a list Tags: haskell Problem: Defining a Boolean function on Haskell that determines if an element occurs once in a list So...	Defining a Boolean function on Haskell that determines if an element occurs once in a list Defining a Boolean function on Haskell that determines if an element occurs once in a list haskell Defining Boolean Haskell Defining a Boolean function on Haskell that determines if an element occurs once in a list So I'm trying ...	[ -0.00872802734375, 0.0142822265625, 0.004669189453125, -0.014892578125, 0.01318359375, 0.010009765625, 0.006622314453125, -0.009765625, -0.006134033203125, -0.0126953125, -0.024658203125, -0.005401611328125, -0.00946044921875, 0.0244140625, -0.00860595703125, 0.0185546875, 0.02575683...	[ 88606, 73783, 34677, 32354, 98, 20625, 142508, 83324, 2174, 12830, 74918, 7, 24145, 23, 5303, 1556, 31577, 61924, 450, 34475, 892, 1505, 26255, 1221, 8337, 9774, 707, 8710, 36766, 4734, 959, 2060, 4163, 38246, 122799, 32562, 18151, 14373, 4...	[ 0.166748046875, 0.1622314453125, 0.2705078125, 0.22412109375, 0.055145263671875, 0.1348876953125, 0.2432861328125, 0.157958984375, 0.0938720703125, 0.181396484375, 0.2039794921875, 0.056884765625, 0.220703125, 0.083251953125, 0.2030029296875, 0.114990234375, 0.048675537109375, 0.15...	embed
51597106_c0	51597106	haskell	0	Title: Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? Problem title: Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? Tags: haskell Problem: Why is join standalone, instead of part of the minimal implementation of the Monad type...	Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? haskell Why Monad MINIMAL Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? I would pref...	[ -0.005950927734375, -0.0023345947265625, 0.0194091796875, 0.00384521484375, -0.007415771484375, 0.0164794921875, -0.004608154296875, 0.00933837890625, 0.026123046875, -0.002044677734375, -0.0023651123046875, -0.027587890625, -0.022216796875, -0.0225830078125, 0.01446533203125, 0.002288...	[ 44084, 33284, 103723, 51684, 64457, 20187, 208124, 60331, 71, 10644, 67413, 1556, 142508, 86240, 114626, 83, 2831, 12601, 13204, 110527, 32354, 6396, 1369, 224743, 61924, 4734, 678, 765, 84751, 30813, 2663, 17366, 959 ]	[ 0.10577392578125, 0.25244140625, 0.129638671875, 0.156005859375, 0.0556640625, 0.2047119140625, 0.1046142578125, 0.1973876953125, 0.180908203125, 0.111328125, 0.1390380859375, 0.0985107421875, 0.1944580078125, 0.189453125, 0.1380615234375, 0.0220184326171875, 0.0278778076171875, 0....	embed
51993746_c0	51993746	haskell	0	Title: Discovering more typeclass instances Problem title: Discovering more typeclass instances Tags: template-haskell, haskell Problem: Discovering more typeclass instances When I was new to Haskell I had very hard time finding instances for various types. Motivated by this, much later I noticed reifyInstances . While...	Discovering more typeclass instances Discovering more typeclass instances template-haskell haskell Discovering Functor Discovering more typeclass instances When I was new to Haskell I had very hard time finding instances for various types. Motivated by this, much later I noticed reifyInstances . While I know little abo...	[ 0.0086669921875, -0.0269775390625, 0.003997802734375, 0.0208740234375, -0.00579833984375, 0.01513671875, 0.01129150390625, -0.025390625, 0.01519775390625, -0.006927490234375, -0.009521484375, -0.04052734375, 0.0166015625, 0.00408935546875, -0.00677490234375, 0.010986328125, 0.0094604...	[ 53092, 5465, 1286, 10644, 67413, 110527, 110934, 10557, 142508, 1556, 28670, 18770, 3525, 20625, 4552, 7941, 1733, 90791, 67842, 52895, 48120, 156672, 456, 40383, 4153, 116071, 3714, 10176, 196631, 831, 103882, 3501, 115723, 152, 7319, 22691, 1...	[ 0.07830810546875, 0.134521484375, 0.18896484375, 0.1900634765625, 0.2529296875, 0.26953125, 0.2091064453125, 0.0673828125, 0.212890625, 0.09765625, 0.1156005859375, 0.1763916015625, 0.041961669921875, 0.1016845703125, 0.03887939453125, 0.0711669921875, 0.048583984375, 0.11071777343...	embed
42373923_c1	42373923	haskell	1	=> target => x => f => { const destructiveSet = y => (x = f(x) (y), x), handler = event => destructiveSet(event); target.addEventListener(type, handler, true); return g => g(x); }; const comp = f => g => x => f(g(x)); const K = x => y => x; const I = x => x; const get = I; const defer = n => f => x => setTimeout(f, n,...	=> target => x => f => { const destructiveSet = y => (x = f(x) (y), x), handler = event => destructiveSet(event); target.addEventListener(type, handler, true); return g => g(x); }; const comp = f => g => x => f(g(x)); const K = x => y => x; const I = x => x; const get = I; const defer = n => f => x => setTimeout(f, n,...	[ -0.006103515625, 0.016845703125, 0.006195068359375, -0.0093994140625, -0.005340576171875, 0.02734375, 0.0089111328125, 0.00823974609375, 0.0042724609375, -0.05419921875, 0.0081787109375, -0.002410888671875, 0.00970458984375, 0.036376953125, 0.024169921875, -0.015625, -0.0037384033203...	[ 44357, 30388, 1022, 1238, 10666, 158, 271, 8, 36716, 5844, 294, 126, 2203, 113, 425, 53, 35863, 19732, 90141, 3142, 4028, 192134, 154663, 39060, 50986, 29568, 30646, 706, 9969, 341, 87, 2046, 2875, 5423, 70059, 6056, 420, 12684, 183114, 1...	[ 0.1181640625, 0.29150390625, 0.122802734375, 0.14404296875, 0.05035400390625, 0.126953125, 0.154541015625, 0.1488037109375, 0.205078125, 0.1099853515625, 0.1326904296875, 0.1695556640625, 0.0472412109375, 0.10504150390625, 0.062469482421875, 0.06549072265625, 0.2144775390625, 0.142...	embed
65077086_c0	65077086	haskell	0	Title: Applying isAlpha to a recursive function Problem title: Applying isAlpha to a recursive function Tags: haskell Problem: Applying isAlpha to a recursive function I've created the function filter that finds the smallest item in a list and filters out any strings that contain characters that are not alphabetical. F...	Applying isAlpha to a recursive function Applying isAlpha to a recursive function haskell Applying Empty x:y:xs x:xs y:xs Applying isAlpha to a recursive function I've created the function filter that finds the smallest item in a list and filters out any strings that contain characters that are not alphabetical. For ex...	[ -0.00634765625, 0.0002574920654296875, 0.01019287109375, 0.0024261474609375, 0.0078125, 0.00390625, 0.0211181640625, -0.00141143798828125, 0.0157470703125, 0.03369140625, 0.021240234375, -0.0224609375, -0.01385498046875, 0.006988525390625, -0.0042724609375, 0.00057220458984375, 0.012...	[ 5659, 538, 83, 6210, 14612, 47, 195625, 5844, 32354, 214, 1556, 142508, 31678, 939, 1022, 12, 53, 425, 7, 113, 75935, 46312, 7413, 19336, 525, 35735, 23, 5303, 1810, 79315, 70541, 124850, 959, 229231, 21533, 18, 20697, 27781, 25442, 11, ...	[ 0.10406494140625, 0.0870361328125, 0.178955078125, 0.1597900390625, 0.239013671875, 0.068603515625, 0.217041015625, 0.1197509765625, 0.1741943359375, 0.003265380859375, 0.124267578125, 0.2071533203125, 0.1290283203125, 0.1162109375, 0.068603515625, 0.003173828125, 0.041473388671875, ...	embed
31280410_c0	31280410	haskell	0	Title: cabal install --disable-prof not working? Problem title: cabal install --disable-prof not working? Tags: cabal-install, haskell Problem: cabal install --disable-prof not working? To save time, I am trying to build a package (in a sandbox) with --disable-doc --disable-prof , but it's failing: when compiling some ...	cabal install --disable-prof not working? cabal install --disable-prof not working? cabal-install haskell Could System.Entropy Perhaps entropy-0.3.7 entro_GdlGosmsZhO5QKbUBFjD3f cabal install --disable-prof not working? To save time, I am trying to build a package (in a sandbox) with --disable-doc --disable-prof , but ...	[ -0.006317138671875, -0.0017242431640625, 0.0078125, -0.0169677734375, -0.0201416015625, 0.014892578125, -0.00787353515625, -0.0189208984375, -0.00213623046875, 0.01531982421875, 0.01129150390625, 0.01348876953125, 0.0150146484375, 0.01324462890625, -0.0079345703125, 0.007659912109375, ...	[ 109524, 20600, 4210, 3827, 2886, 3454, 420, 959, 20697, 80383, 1556, 142508, 191147, 12353, 7768, 29813, 53, 181799, 49478, 6493, 23320, 109981, 30098, 1733, 31577, 45367, 98169, 19096, 11728, 678, 29713, 35782, 214, 9969, 49725, 42548, 27771, ...	[ 0.282470703125, 0.190673828125, 0.060302734375, 0.1016845703125, 0.2010498046875, 0.1099853515625, 0.1490478515625, 0.128173828125, 0.15380859375, 0.17138671875, 0.1278076171875, 0.2276611328125, 0.057159423828125, 0.09661865234375, 0.00885009765625, 0.1368408203125, 0.0843505859375,...	embed
32933776_c0	32933776	haskell	0	Title: Haskell types and signatures Problem title: Haskell types and signatures Tags: types, integer, haskell, functional-programming Problem: Haskell types and signatures I'm studying for an exam about Haskell. I don't understand how I determine the type of a function. The function is: func [] f = 16 func (h : t) f = ...	Haskell types and signatures Haskell types and signatures types integer haskell functional-programming Haskell Num Haskell types and signatures I'm studying for an exam about Haskell. I don't understand how I determine the type of a function. The function is: My guess is that the first line has this types: empty list -...	[ 0.002777099609375, -0.0216064453125, -0.004791259765625, 0.0125732421875, -0.004302978515625, 0.01348876953125, -0.0002269744873046875, 0.0076904296875, 0.00372314453125, -0.0089111328125, -0.028076171875, -0.040283203125, -0.01092529296875, -0.006439208984375, -0.01007080078125, -0.01...	[ 20625, 142508, 52895, 136, 138256, 892, 1505, 1556, 123309, 28966, 52782, 35187, 42276, 2301, 18, 28219, 3642, 83324, 10644, 111, 32354, 57767, 5117, 13315, 903, 201505, 5303, 33079, 10, 54744, 110, 22062, 44357, 17932, 103607, 30646, 83425, ...	[ 0.139404296875, 0.237060546875, 0.240966796875, 0.10174560546875, 0.20751953125, 0.11572265625, 0.0635986328125, 0.1231689453125, 0.13525390625, 0.06634521484375, 0.1717529296875, 0.01300048828125, 0.07080078125, 0.003570556640625, 0.0009765625, 0.08636474609375, 0.014892578125, 0....	embed
58917739_c1	58917739	haskell	1	<- [2 .. n]]) In an equation for ‘a’: a = array (0, n) ([(0, 0), (1, 1), (2, 1)] ++ [(i, fastFibo (a i)) \| i <- [2 .. n]]) In an equation for ‘fibos’: fibos n = a where a = array (0, n) ([(0, 0), ....] ++ [(i, fastFibo (a i)) \| i <- [2 .. n]]) • Relevant bindings include a :: i1 -> Array Int Int (bound at /mnt/data/Do...	<- [2 .. n]]) In an equation for ‘a’: a = array (0, n) ([(0, 0), (1, 1), (2, 1)] ++ [(i, fastFibo (a i)) \| i <- [2 .. n]]) In an equation for ‘fibos’: fibos n = a where a = array (0, n) ([(0, 0), ....] ++ [(i, fastFibo (a i)) \| i <- [2 .. n]]) • Relevant bindings include a :: i1 -> Array Int Int (bound at /mnt/data/Do...	[ -0.00482177734375, 0.02001953125, -0.00958251953125, 0.0059814453125, -0.009765625, -0.0223388671875, -0.00390625, 0.00970458984375, 0.01300048828125, -0.005523681640625, -0.00994873046875, 0.006103515625, 0.006866455078125, 0.0162353515625, 0.0126953125, -0.019775390625, -0.00668334...	[ 4426, 9, 304, 1468, 653, 86245, 360, 142, 28, 5490, 2320, 100, 204, 11, 12, 10, 2203, 10298, 53, 22085, 2389, 757, 4879, 4700, 37223, 14, 4271, 6159, 837, 17, 1029, 16091, 809, 7440, 133, 30624, 128239, 418, 69253, 18, 99091, 660, 1...	[ 0.09112548828125, 0.1417236328125, 0.1822509765625, 0.1217041015625, 0.1356201171875, 0.0171051025390625, 0.142578125, 0.08721923828125, 0.1156005859375, 0.269775390625, 0.193359375, 0.1544189453125, 0.009429931640625, 0.2144775390625, 0.0389404296875, 0.18115234375, 0.09814453125, ...	embed
23478941_c0	23478941	haskell	0	Title: How to find index in a zipped list by condition of the elements of tuples (Haskell) Problem title: How to find index in a zipped list by condition of the elements of tuples (Haskell) Tags: list, haskell, zip Problem: How to find index in a zipped list by condition of the elements of tuples (Haskell) I am new an ...	How to find index in a zipped list by condition of the elements of tuples (Haskell) How to find index in a zipped list by condition of the elements of tuples (Haskell) list haskell zip How Haskell Bool How to find index in a zipped list by condition of the elements of tuples (Haskell) I am new an familiarizing myself t...	[ -0.006378173828125, 0.000396728515625, 0.00836181640625, 0.025390625, -0.0296630859375, 0.0159912109375, 0.01519775390625, -0.006927490234375, 0.0191650390625, -0.0004711151123046875, 0.0018310546875, 0.0027313232421875, -0.00885009765625, 0.0179443359375, 0.0033416748046875, 0.0104370...	[ 11249, 7413, 63262, 23, 3546, 48398, 5303, 390, 35431, 80854, 370, 99726, 6495, 7, 142508, 47, 1556, 68330, 20625, 2460, 929, 10, 3525, 4488, 10932, 44402, 360, 18, 12647, 3173, 3630, 12830, 142424, 87599, 5117, 9222, 24105, 94131, 17932, ...	[ 0.064697265625, 0.14404296875, 0.25341796875, 0.0875244140625, 0.1597900390625, 0.1656494140625, 0.2003173828125, 0.0889892578125, 0.2149658203125, 0.1324462890625, 0.115478515625, 0.186767578125, 0.06829833984375, 0.050537109375, 0.221435546875, 0.00140380859375, 0.08685302734375, ...	embed
52730463_c1	52730463	haskell	1	TypeError feature to improve on this message, however, a naive solution gobbles the error: import GHC.TypeLits type family MemberB (x :: k) (l :: [k]) where MemberB _ '[] = TypeError ('Text "not a member") MemberB a (a : xs) = 'True MemberB a (b : xs) = MemberB a xs It seems that, maybe, TypeError behaves as any type,...	TypeError feature to improve on this message, however, a naive solution gobbles the error: import GHC.TypeLits type family MemberB (x :: k) (l :: [k]) where MemberB _ '[] = TypeError ('Text "not a member") MemberB a (a : xs) = 'True MemberB a (b : xs) = MemberB a xs It seems that, maybe, TypeError behaves as any type,...	[ -0.00537109375, -0.004302978515625, 0.00421142578125, 0.004119873046875, -0.0096435546875, -0.009033203125, -0.00872802734375, -0.0010223388671875, -0.022705078125, 0.011962890625, 0.007110595703125, 0.000518798828125, 0.0255126953125, -0.003204345703125, 0.007659912109375, 0.003143310...	[ 60457, 18468, 31611, 60213, 52295, 26008, 24, 5844, 29806, 73163, 18499, 24927, 527, 73265, 196707, 9506, 933, 10644, 14449, 74057, 571, 425, 1984, 472, 141, 92, 174379, 10869, 10, 32786, 1022, 882, 68991, 237, 2499, 51, 27430, 256, 7520, ...	[ 0.241943359375, 0.18994140625, 0.1798095703125, 0.10235595703125, 0.1229248046875, 0.007720947265625, 0.014068603515625, 0.0699462890625, 0.07196044921875, 0.144287109375, 0.214599609375, 0.156982421875, 0.020294189453125, 0.150146484375, 0.197021484375, 0.1422119140625, 0.0841064453...	embed
20939720_c0	20939720	haskell	0	Title: How to make the transition from Haskell type variables to C# generics Problem title: How to make the transition from Haskell type variables to C# generics Tags: generics, haskell, c%23, .net Problem: How to make the transition from Haskell type variables to C# generics Currently I'm in migration from Haskell to ...	How to make the transition from Haskell type variables to C# generics How to make the transition from Haskell type variables to C# generics generics haskell c%23 .net Haskell How MyFun List Map How to make the transition from Haskell type variables to C# generics Currently I'm in migration from Haskell to C# . There ar...	[ -0.01104736328125, 0.007415771484375, 0.0145263671875, -0.004486083984375, -0.0145263671875, -0.0012969970703125, -0.021484375, -0.01513671875, 0.00982666015625, -0.01165771484375, -0.00750732421875, -0.031005859375, -0.007354736328125, 0.003326416015625, -0.0057373046875, 0.0010604858...	[ 11249, 47, 3249, 149307, 1295, 20625, 142508, 10644, 77336, 313, 4904, 189534, 7, 1556, 3742, 1179, 2646, 97249, 32036, 42719, 70, 212416, 66139, 831, 159978, 32354, 678, 21373, 4677, 25842 ]	[ 0.075439453125, 0.085205078125, 0.08282470703125, 0.2012939453125, 0.10321044921875, 0.155517578125, 0.2470703125, 0.1993408203125, 0.22802734375, 0.07379150390625, 0.2127685546875, 0.257080078125, 0.0804443359375, 0.140625, 0.0819091796875, 0.0997314453125, 0.140625, 0.2177734375,...	embed
72251572_c0	72251572	haskell	0	Title: Haskell: Type Error Trying when using generics Problem title: Haskell: Type Error Trying when using generics Tags: haskell Problem: Haskell: Type Error Trying when using generics I am a Haskell beginner, and when I compile the Haskell source code, when trying to make a function to implement an lazy at least as l...	Haskell: Type Error Trying when using generics Haskell: Type Error Trying when using generics haskell generics Data.Maybe new_acc xs acc Haskell Type Error Trying Main Maybe Just x:xs gh.hs:15:19 Couldn gh.hs:14:9-26 gh.hs:7:1-56 Expected Actual Relevant gh.hs:15:9 gh.hs:8:12 gh.hs:8:1 gh.hs:15:21 gh.hs:10:5-29 gh.hs:1...	[ -0.002105712890625, 0.01214599609375, -0.002593994140625, -0.00726318359375, 0.021240234375, 0.00848388671875, -0.003326416015625, -0.0021514892578125, 0.00848388671875, -0.005950927734375, -0.0010528564453125, -0.0208740234375, 0.0111083984375, -0.0012664794921875, 0.0084228515625, 0....	[ 20625, 142508, 60457, 212059, 40858, 17368, 189534, 7, 12, 3229, 1556, 11809, 82419, 3525, 10060, 1022, 50015, 12321, 83425, 9563, 425, 31380, 127, 12221, 23988, 191147, 22635, 1126, 51372, 966, 19721, 13683, 60075, 100582, 133, 1019, 20927, ...	[ 0.1165771484375, 0.205322265625, 0.26123046875, 0.201171875, 0.150634765625, 0.0916748046875, 0.2445068359375, 0.0704345703125, 0.012969970703125, 0.0059814453125, 0.1162109375, 0.0848388671875, 0.033660888671875, 0.09033203125, 0.115478515625, 0.06060791015625, 0.0877685546875, 0....	embed
74011274_c1	74011274	haskell	1	borders red. I don't know wether gaps or screen borders are outmost, here I put gaps (green) closest to the edge: Experimenting a bit more, it seems like gaps, screen borders, and window borders don't interact. For example, this code -- `False` produces the same outcome as `True` with the parameter to the left set to ...	borders red. I don't know wether gaps or screen borders are outmost, here I put gaps (green) closest to the edge: Experimenting a bit more, it seems like gaps, screen borders, and window borders don't interact. For example, this code -- `False` produces the same outcome as `True` with the parameter to the left set to ...	[ 0.00927734375, 0.037353515625, -0.00848388671875, 0.004058837890625, 0.004150390625, 0.004547119140625, 0.02001953125, -0.0169677734375, 0.0027008056640625, 0.037109375, 0.0235595703125, 0.005401611328125, -0.01220703125, -0.0026702880859375, -0.004913330078125, 0.0133056640625, -0.0...	[ 132988, 7, 4842, 3714, 43599, 49119, 1810, 840, 3688, 3884, 99433, 20903, 271, 47, 121303, 146797, 37202, 76896, 2301, 18, 78974, 18151, 17647, 11971, 27489, 5701, 184345, 882, 13, 171859, 25737, 5423, 757, 3034, 141012, 5623, 21896, 12248, ...	[ 0.283203125, 0.0870361328125, 0.201171875, 0.03619384765625, 0.250732421875, 0.1395263671875, 0.127685546875, 0.075439453125, 0.006103515625, 0.041473388671875, 0.143310546875, 0.083251953125, 0.024810791015625, 0.05120849609375, 0.1480712890625, 0.0916748046875, 0.03155517578125, ...	embed
65763827_c0	65763827	haskell	0	Title: All combinations of elements of N lists in Haskell Problem title: All combinations of elements of N lists in Haskell Tags: functional-programming, combinatorics, haskell, list-comprehension, list Problem: All combinations of elements of N lists in Haskell In order to combine 2 lists the following code could be u...	All combinations of elements of N lists in Haskell All combinations of elements of N lists in Haskell functional-programming combinatorics haskell list-comprehension list All Haskell All combinations of elements of N lists in Haskell In order to combine 2 lists the following code could be used. [(x,y) \| x <- [1, 2, 3],...	[ -0.0205078125, 0.0189208984375, -0.01129150390625, 0.0159912109375, 0.0067138671875, 0.0255126953125, -0.011474609375, -0.01092529296875, -0.0025787353515625, -0.0267333984375, -0.00830078125, -0.0267333984375, 0.022705078125, 0.01904296875, -0.041259765625, -0.0079345703125, 0.01782...	[ 3164, 162515, 7, 80854, 541, 5303, 23, 20625, 142508, 123309, 28966, 22321, 3826, 1556, 277, 4692, 3220, 6889, 12989, 70163, 116, 25632, 18151, 5809, 11814, 425, 4, 53, 58745, 1022, 68252, 138, 113, 190, 305, 3347, 4369, 155761, 617, 1046...	[ 0.1182861328125, 0.2568359375, 0.0489501953125, 0.2193603515625, 0.1658935546875, 0.274169921875, 0.07733154296875, 0.172607421875, 0.26806640625, 0.1123046875, 0.0755615234375, 0.1614990234375, 0.05108642578125, 0.146484375, 0.0159759521484375, 0.10479736328125, 0.132568359375, 0....	embed
67710566_c0	67710566	haskell	0	Title: How to use Maybe in higher order function haskell? Problem title: How to use Maybe in higher order function haskell? Tags: higher-order-functions, haskell Problem: How to use Maybe in higher order function haskell? I wanted to solve the below problem where f returns Nothing, then the first element is removed. If...	How to use Maybe in higher order function haskell? How to use Maybe in higher order function haskell? higher-order-functions haskell How Maybe x:xs How to use Maybe in higher order function haskell? I wanted to solve the below problem where f returns Nothing, then the first element is removed. If f returns Just x, the ...	[ -0.011474609375, -0.015625, -0.00054931640625, -0.00579833984375, 0.014404296875, 0.0216064453125, 0.01214599609375, 0.003875732421875, 0.021728515625, 0.01385498046875, 0.00093841552734375, 0.0264892578125, -0.005218505859375, 0.000736236572265625, 0.0106201171875, -0.03076171875, -...	[ 11249, 47, 4527, 83425, 23, 77546, 12989, 32354, 1556, 142508, 80596, 137175, 1022, 12, 425, 7, 36663, 86869, 35064, 2967, 1238, 30646, 182747, 5117, 12830, 83, 184750, 4263, 9563, 70, 98816, 678, 43240, 26785, 28219, 3642, 99710, 2182, 461...	[ 0.1507568359375, 0.0828857421875, 0.1939697265625, 0.341796875, 0.1136474609375, 0.165771484375, 0.2010498046875, 0.206298828125, 0.159423828125, 0.256103515625, 0.176025390625, 0.159423828125, 0.1031494140625, 0.04656982421875, 0.11279296875, 0.016845703125, 0.00469970703125, 0.07...	embed
3455822_c0	3455822	haskell	0	Title: Is Concurrent Haskell still restricted to a single OS thread? Problem title: Is Concurrent Haskell still restricted to a single OS thread? Tags: multithreading, multicore, haskell, concurrency Problem: Is Concurrent Haskell still restricted to a single OS thread? In a 2005 research paper it said Concurrent Haske...	Is Concurrent Haskell still restricted to a single OS thread? Is Concurrent Haskell still restricted to a single OS thread? multithreading multicore haskell concurrency Concurrent Haskell Is Concurrent Haskell still restricted to a single OS thread? In a 2005 research paper it said Has this changed or is Concurrent Has...	[ 0.00543212890625, 0.003631591796875, -0.007537841796875, 0.025634765625, -0.0005645751953125, 0.00390625, -0.00701904296875, 0.00150299072265625, -0.01416015625, -0.049560546875, -0.01336669921875, -0.026123046875, -0.01171875, -0.0059814453125, -0.01300048828125, 0.0098876953125, 0....	[ 1657, 163812, 20625, 142508, 7464, 173072, 297, 11001, 11787, 86997, 47, 3869, 65847, 11, 6024, 30854, 1556, 108636, 982, 2071, 4078, 25188, 15122, 98816 ]	[ 0.07257080078125, 0.2239990234375, 0.1429443359375, 0.25634765625, 0.07470703125, 0.14697265625, 0.0423583984375, 0.14111328125, 0.1439208984375, 0.1988525390625, 0.037628173828125, 0.03948974609375, 0.12255859375, 0.005645751953125, 0.03851318359375, 0.138427734375, 0.1259765625, ...	embed
18395816_c0	18395816	haskell	0	Title: How do I make lenses from a record in GHCi Problem title: How do I make lenses from a record in GHCi Tags: template-haskell, haskell, haskell-lens, ghci Problem: How do I make lenses from a record in GHCi I want to play around with the Lens library a bit. I've loaded it into GHCi and created a record data type w...	How do I make lenses from a record in GHCi How do I make lenses from a record in GHCi template-haskell haskell haskell-lens ghci a How GHCi Lens Foo _arg1 _arg2 How do I make lenses from a record in GHCi I want to play around with the Lens library a bit. I've loaded it into GHCi and created a record data type with the ...	[ -0.015380859375, -0.007476806640625, -0.0185546875, 0.00726318359375, -0.0017547607421875, 0.0260009765625, -0.0050048828125, 0.00115203857421875, 0.0023345947265625, -0.038818359375, -0.00165557861328125, -0.0247802734375, 0.01348876953125, -0.00927734375, 0.004638671875, -0.009704589...	[ 11249, 54, 87, 3249, 96, 47754, 1295, 17164, 23, 527, 73265, 14, 10, 110934, 10557, 142508, 1556, 1977, 31380, 318, 18226, 7, 9572, 31, 61477, 304, 3444, 11301, 35773, 1294, 4785, 72367, 75935, 2053, 10644, 95307, 1379, 12064, 1884, 100, ...	[ 0.047821044921875, 0.0204010009765625, 0.00927734375, 0.1292724609375, 0.17822265625, 0.2286376953125, 0.14208984375, 0.228515625, 0.0633544921875, 0.0902099609375, 0.14208984375, 0.197021484375, 0.0318603515625, 0.1732177734375, 0.064697265625, 0.1630859375, 0.0887451171875, 0.162...	embed
50149270_c0	50149270	haskell	0	Title: Explanation on the type of Concat method Problem title: Explanation on the type of Concat method Tags: haskell, concatenation Problem: Explanation on the type of Concat method Can someone please explain to me why the type of the source list in my implementation of concat does not work ? conc::[[a]]->[a] conc xs@...	Explanation on the type of Concat method Explanation on the type of Concat method haskell concatenation Explanation Concat x1:xs Couldn Explanation on the type of Concat method Can someone please explain to me why the type of the source list in my implementation of concat does not work ? Why should the source list be [...	[ 0.0042724609375, 0.007598876953125, 0.005615234375, 0.01434326171875, 0.005157470703125, -0.002960205078125, -0.01373291015625, 0.0155029296875, 0.013671875, -0.0242919921875, -0.0098876953125, -0.042236328125, 0.004180908203125, -0.0115966796875, -0.01434326171875, -0.007537841796875,...	[ 5868, 10644, 1657, 4460, 55300, 1556, 142508, 158, 33, 1022, 82825, 425, 191147, 73342, 15400, 31344, 5303, 208124, 14602, 959, 4488, 44084, 5608, 11, 3444, 133063, 82449, 12830, 25632, 18499 ]	[ 0.1181640625, 0.17333984375, 0.15869140625, 0.255859375, 0.1182861328125, 0.08740234375, 0.1749267578125, 0.1640625, 0.055419921875, 0.0190582275390625, 0.0250701904296875, 0.0347900390625, 0.025604248046875, 0.10693359375, 0.08721923828125, 0.1527099609375, 0.13818359375, 0.104492...	embed
53583073_c0	53583073	haskell	0	Title: Haskell list creation and concatenation performance Problem title: Haskell list creation and concatenation performance Tags: performance, haskell, list Problem: Haskell list creation and concatenation performance In the process of playing with haskell and finding solution for project euler n°40 i found that this...	Haskell list creation and concatenation performance Haskell list creation and concatenation performance performance haskell list Haskell foldl1 Haskell list creation and concatenation performance In the process of playing with haskell and finding solution for project euler n°40 i found that this code is very fast: but ...	[ -0.005035400390625, -0.0123291015625, -0.004302978515625, -0.00130462646484375, -0.0050048828125, -0.0098876953125, -0.006561279296875, -0.003997802734375, 0.0164794921875, -0.0277099609375, 0.011962890625, -0.0205078125, 0.0054931640625, -0.003143310546875, -0.0159912109375, -0.015014...	[ 20625, 142508, 5303, 166635, 136, 158, 4460, 33, 23718, 1556, 18344, 20469, 418, 75169, 29806, 13452, 1175, 603, 2839, 14037, 903, 18151, 83, 4552, 4271, 1284, 21870, 72803, 1884, 43077, 1733, 56, 831, 73342, 15400 ]	[ 0.1204833984375, 0.2017822265625, 0.196044921875, 0.153564453125, 0.03509521484375, 0.0631103515625, 0.101318359375, 0.09613037109375, 0.181396484375, 0.1138916015625, 0.0704345703125, 0.124755859375, 0.0684814453125, 0.0303192138671875, 0.0789794921875, 0.061431884765625, 0.05337524...	embed
27576627_c0	27576627	haskell	0	Title: Haskell Leksah and GHCI Problem title: Haskell Leksah and GHCI Tags: ghci, leksah, haskell Problem: Haskell Leksah and GHCI In Leksah, I get the following error whenever trying to debug anything. First it says: "GHCi debugger is not running." So I click "Start GHCi" Then I get the following in the console: GHCi,...	Haskell Leksah and GHCI Haskell Leksah and GHCI ghci leksah haskell Haskell Leksah GHCI www.haskell.org Usage Haskell Leksah and GHCI In Leksah, I get the following error whenever trying to debug anything. First it says: "GHCi debugger is not running." So I click "Start GHCi" Then I get the following in the console: GH...	[ 0.003662109375, -0.000377655029296875, -0.01129150390625, 0.0076904296875, -0.007537841796875, 0.0233154296875, -0.00799560546875, -0.0029296875, 0.00067901611328125, -0.0306396484375, 0.024169921875, -0.0390625, -0.006072998046875, 0.006622314453125, 0.0179443359375, 0.00982666015625,...	[ 20625, 142508, 53273, 23474, 136, 41877, 17304, 31380, 318, 17143, 1556, 10557, 1478, 70166, 25632, 18499, 217684, 31577, 8, 85779, 23937, 40658, 978, 21407, 83, 959, 51042, 18158, 126597, 527, 73265, 14, 130250, 11389, 361, 52196, 363, 9486,...	[ 0.1400146484375, 0.270263671875, 0.1285400390625, 0.2320556640625, 0.057525634765625, 0.172119140625, 0.1641845703125, 0.1119384765625, 0.1314697265625, 0.0726318359375, 0.0911865234375, 0.10272216796875, 0.0810546875, 0.08343505859375, 0.07879638671875, 0.1663818359375, 0.0711059570...	embed
21371196_c0	21371196	haskell	0	Title: How to install a 32-bit binary using Cabal Problem title: How to install a 32-bit binary using Cabal Tags: cabal, haskell, i386, 32-bit Problem: How to install a 32-bit binary using Cabal I'm running Ubuntu Precise with an amd64 kernel and amd64 userland. I've just installed Haskell using sudo apt-get install ha...	How to install a 32-bit binary using Cabal How to install a 32-bit binary using Cabal cabal haskell i386 32-bit Cabal How m32 i386 How to install a 32-bit binary using Cabal I'm running Ubuntu Precise with an amd64 kernel and amd64 userland. I've just installed Haskell using sudo apt-get install haskell-platform . Now ...	[ 0.00518798828125, 0.00958251953125, 0.02294921875, 0.01446533203125, -0.01263427734375, -0.000804901123046875, -0.0032501220703125, -0.0177001953125, 0.0093994140625, -0.004669189453125, 0.0028228759765625, -0.048828125, -0.00970458984375, 0.0038909912109375, -0.01409912109375, -0.0007...	[ 11249, 47, 20600, 2789, 3137, 2394, 6635, 17368, 30438, 289, 10, 109524, 1556, 142508, 17, 105742, 347, 6460, 51042, 116890, 70464, 13, 678, 444, 71, 13307, 77924, 38937, 1760, 20625, 166, 246, 1747, 3794, 172121, 1884, 139392, 7722, 3249, ...	[ 0.0810546875, 0.044891357421875, 0.1993408203125, 0.25732421875, 0.147705078125, 0.1927490234375, 0.1959228515625, 0.1131591796875, 0.2041015625, 0.2017822265625, 0.012115478515625, 0.2476806640625, 0.13671875, 0.237060546875, 0.07403564453125, 0.267822265625, 0.06689453125, 0.2463...	embed
22520200_c0	22520200	haskell	0	Title: printf a list of strings Problem title: printf a list of strings Tags: haskell, string-formatting, pointfree Problem: printf a list of strings I have the following code that is supposed to format a telephone number. ( printf is from Text.Printf, splitPlaces is from Data.List.Split). prettyPrint :: String -> Stri...	printf a list of strings printf a list of strings haskell string-formatting pointfree part1 part2 part3 printf a list of strings I have the following code that is supposed to format a telephone number. ( printf is from Text.Printf, splitPlaces is from Data.List.Split). What I'm looking for is an operator that allows th...	[ -0.0040283203125, -0.00665283203125, 0.0196533203125, 0.0086669921875, -0.0242919921875, 0.00183868408203125, 0.01324462890625, 0.00457763671875, 0.0201416015625, -0.002105712890625, 0.01507568359375, -0.020263671875, 0.01312255859375, -0.01202392578125, -0.0211181640625, 0.01281738281...	[ 28412, 420, 10, 5303, 111, 79315, 7, 1556, 142508, 51727, 1916, 6275, 32087, 2831, 363, 765, 25632, 18151, 134598, 9384, 203599, 14012, 1295, 24129, 112079, 18, 65450, 683, 143, 5170, 11809, 154663, 31923, 4353, 16487, 100, 39933, 114864, 3...	[ 0.22900390625, 0.21240234375, 0.0269775390625, 0.1861572265625, 0.0310211181640625, 0.2261962890625, 0.011505126953125, 0.09326171875, 0.205810546875, 0.153076171875, 0.024200439453125, 0.107177734375, 0.196533203125, 0.041595458984375, 0.026214599609375, 0.00177001953125, 0.11877441...	embed
7534715_c0	7534715	haskell	0	Title: How to print comma-separated list with hamlet? Problem title: How to print comma-separated list with hamlet? Tags: haskell, templates, yesod, hamlet Problem: How to print comma-separated list with hamlet? With the hamlet templating language that comes with yesod, what is the best way of printing a comma-separate...	How to print comma-separated list with hamlet? How to print comma-separated list with hamlet? haskell templates yesod hamlet How How to print comma-separated list with hamlet? With the hamlet templating language that comes with yesod, what is the best way of printing a comma-separated list? E.g. assume this code which ...	[ -0.00347900390625, -0.018310546875, -0.00162506103515625, 0.0015411376953125, -0.0203857421875, 0.0137939453125, 0.000865936279296875, 0.0024566650390625, -0.000056743621826171875, -0.03076171875, -0.01544189453125, -0.0458984375, 0.0264892578125, 0.00799560546875, -0.0035400390625, -0...	[ 11249, 28412, 96117, 184, 6276, 3674, 5303, 678, 2057, 1974, 1556, 142508, 110934, 2422, 23722, 9, 127446, 26518, 46876, 32497, 2965, 3917, 2448, 1916, 41591, 18151, 1632, 42805, 7103, 15700, 3642, 183540, 375, 1510, 17721, 80854, 15190, 2940...	[ 0.0599365234375, 0.180908203125, 0.24609375, 0.0760498046875, 0.1751708984375, 0.072509765625, 0.197998046875, 0.12353515625, 0.15673828125, 0.2213134765625, 0.064453125, 0.1693115234375, 0.1568603515625, 0.12060546875, 0.197998046875, 0.005523681640625, 0.12646484375, 0.0740966796...	embed
8046306_c0	8046306	haskell	0	Title: Having a hard time understanding how to use nubBy Problem title: Having a hard time understanding how to use nubBy Tags: haskell Problem: Having a hard time understanding how to use nubBy I have a problem where i have to manipulate a list of a list of floats. [[Float]]. these list of floats are of length 4. I wa...	Having a hard time understanding how to use nubBy Having a hard time understanding how to use nubBy haskell Having Float Having a hard time understanding how to use nubBy I have a problem where i have to manipulate a list of a list of floats. [[Float]]. these list of floats are of length 4. I want to remove duplicates ...	[ 0.00213623046875, 0.0245361328125, 0.004150390625, 0.0004596710205078125, 0.005706787109375, 0.004638671875, 0.021240234375, -0.01416015625, 0.00445556640625, -0.0093994140625, -0.0341796875, -0.000621795654296875, 0.029541015625, -0.01611328125, -0.0205078125, -0.0093994140625, -0.0...	[ 171855, 7941, 1733, 100094, 3642, 4527, 315, 275, 75358, 1556, 142508, 38699, 257, 2967, 45258, 5303, 21917, 9821, 919, 365, 6097, 140909, 1398, 3444, 87388, 171763, 1636, 5117, 138, 80854, 3034, 1284, 124962, 201, 927, 4568, 2831, 6024, 11...	[ 0.1151123046875, 0.0997314453125, 0.0928955078125, 0.1297607421875, 0.0280609130859375, 0.1324462890625, 0.1810302734375, 0.1612548828125, 0.251953125, 0.14453125, 0.2396240234375, 0.1788330078125, 0.09136962890625, 0.0882568359375, 0.1400146484375, 0.1177978515625, 0.1790771484375, ...	embed
8058039_c0	8058039	haskell	0	Title: Bit of confusion regarding a functor? Problem title: Bit of confusion regarding a functor? Tags: haskell Problem: Bit of confusion regarding a functor? Im trying to understand what a functor is, i found this tutorial/example: http://en.wikibooks.org/wiki/Haskell/Solutions/Applicative_Functors data Tree a = Node ...	Bit of confusion regarding a functor? Bit of confusion regarding a functor? haskell Bit Tree Node Functor Bit of confusion regarding a functor? Im trying to understand what a functor is, i found this tutorial/example: http://en.wikibooks.org/wiki/Haskell/Solutions/Applicative_Functors The functor for the above type bei...	[ 0.0145263671875, -0.005859375, 0.000583648681640625, 0.00518798828125, 0.0125732421875, 0.0089111328125, -0.00153350830078125, -0.01904296875, 0.01220703125, -0.022216796875, -0.0113525390625, -0.040283203125, 0, 0.0123291015625, -0.0130615234375, -0.01507568359375, 0.00836181640625,...	[ 27774, 111, 169463, 118861, 10, 7477, 18770, 32, 1556, 142508, 101344, 438, 112, 28670, 3370, 31577, 28219, 2367, 83, 57143, 81415, 13691, 6495, 7, 102588, 34, 39179, 11048, 4935, 97249, 581, 36917, 10644, 8035, 73342, 66161, 16940, 15400, ...	[ 0.1668701171875, 0.0948486328125, 0.15966796875, 0.053466796875, 0.090087890625, 0.2420654296875, 0.29541015625, 0.0089111328125, 0.1148681640625, 0.224609375, 0.1832275390625, 0.1148681640625, 0.103271484375, 0.2017822265625, 0.0079345703125, 0.00830078125, 0.07379150390625, 0.037...	embed
61331886_c0	61331886	haskell	0	Title: What does "f (a -> b)" type signature mean in Haskell? Problem title: What does "f (a -> b)" type signature mean in Haskell? Tags: haskell, applicative Problem: What does "f (a -> b)" type signature mean in Haskell? I'm trying to understand applicatives in Haskell. Can't figure out what...	What does "f (a -> b)" type signature mean in Haskell? What does "f (a -> b)" type signature mean in Haskell? haskell applicative What Haskell Num Maybe Just What does "f (a -> b)" type signature mean in Haskell? I'm trying to understand applicatives in Haskell. Can't figure out what does foll...	[ 0.012451171875, -0.0054931640625, -0.0093994140625, 0.0150146484375, -0.007080078125, 0.01806640625, 0.00970458984375, 0.0125732421875, -0.004150390625, -0.00173187255859375, -0.0084228515625, -0.033935546875, -0.010986328125, 0.0076904296875, -0.0152587890625, -0.0198974609375, 0.00...	[ 4865, 14602, 420, 11, 20, 1230, 5386, 876, 41502, 10644, 138256, 29459, 23, 20625, 142508, 1556, 41816, 4935, 52782, 83425, 9563, 15, 33079, 28219, 42991, 26366, 2367, 25632, 91084, 111, 10, 442, 32354, 52895, 10750, 107003, 123309, 56037, ...	[ 0.0660400390625, 0.039581298828125, 0.1907958984375, 0.1376953125, 0.116943359375, 0.06109619140625, 0.14306640625, 0.1917724609375, 0.0223388671875, 0.197265625, 0.23779296875, 0.1478271484375, 0.06341552734375, 0.1324462890625, 0.2279052734375, 0.0843505859375, 0.131591796875, 0....	embed
10161009_c0	10161009	haskell	0	Title: Input checks in Haskell data constructors Problem title: Input checks in Haskell data constructors Tags: constructor, haskell, validation Problem: Input checks in Haskell data constructors How can I add input checks to Haskell data constructors? Let's say I have import Data.Time.Calendar data SchedulePeriod = Sc...	Input checks in Haskell data constructors Input checks in Haskell data constructors constructor haskell validation Data.Time.Calendar Input Haskell SchedulePeriod Day Double Show Input checks in Haskell data constructors How can I add input checks to Haskell data constructors? Let's say I have and I want to impose a co...	[ 0.003814697265625, 0.0206298828125, -0.0128173828125, 0.03369140625, -0.0166015625, 0.00506591796875, -0.0140380859375, -0.0078125, -0.01318359375, 0.00079345703125, 0.01007080078125, -0.0220947265625, 0.02783203125, 0.0126953125, -0.0206298828125, -0.0013275146484375, 0.013061523437...	[ 360, 7077, 12765, 7, 23, 20625, 142508, 2053, 64549, 25251, 748, 1556, 44622, 11809, 70059, 33, 1506, 230074, 14, 10013, 107172, 17367, 831, 15190, 107730, 47, 765, 3444, 178451, 158, 2816, 4288, 4034, 86291, 4426, 3564, 15490, 164789, 1064...	[ 0.119140625, 0.18701171875, 0.26708984375, 0.0654296875, 0.0164337158203125, 0.1407470703125, 0.20068359375, 0.1156005859375, 0.175048828125, 0.115234375, 0.015289306640625, 0.13134765625, 0.1259765625, 0.089599609375, 0.08306884765625, 0.0328369140625, 0.07470703125, 0.13842773437...	embed
44754977_c0	44754977	haskell	0	Title: Haskell: How to use type class with generic datatype? Problem title: Haskell: How to use type class with generic datatype? Tags: haskell, typeclass, generics Problem: Haskell: How to use type class with generic datatype? Suppose that I have defined a list like this: data List a = Nil \| Cons a (List a) Now I want...	Haskell: How to use type class with generic datatype? Haskell: How to use type class with generic datatype? haskell typeclass generics Haskell How List Nil Cons Ord Haskell: How to use type class with generic datatype? Suppose that I have defined a list like this: Now I want to make sure a List is only instantiated wit...	[ -0.0155029296875, 0.0234375, 0.00994873046875, -0.0164794921875, 0.01434326171875, 0.01318359375, 0.00384521484375, -0.00104522705078125, 0.007171630859375, -0.01507568359375, -0.0174560546875, -0.052734375, 0.0037078857421875, -0.010986328125, -0.02587890625, -0.0012664794921875, 0....	[ 20625, 142508, 11249, 4527, 10644, 18507, 678, 189534, 2053, 50986, 12, 1556, 67413, 32036, 77175, 39215, 35379, 121691, 61924, 5303, 1884, 903, 3444, 3249, 9077, 4734, 34648, 19911, 29458, 7722, 158, 2816, 4288, 32354, 110527, 68034 ]	[ 0.1019287109375, 0.2027587890625, 0.06085205078125, 0.100341796875, 0.265625, 0.26416015625, 0.1055908203125, 0.2303466796875, 0.07489013671875, 0.23095703125, 0.0081787109375, 0.0870361328125, 0.19287109375, 0.15576171875, 0.136962890625, 0.1370849609375, 0.1712646484375, 0.000396...	embed
64800257_c0	64800257	haskell	0	Title: building own function to remove duplicate elements from list in Haskell Problem title: building own function to remove duplicate elements from list in Haskell Tags: haskell Problem: building own function to remove duplicate elements from list in Haskell I'm trying to build a function which will remove all duplic...	building own function to remove duplicate elements from list in Haskell building own function to remove duplicate elements from list in Haskell haskell list Haskell x:xs building own function to remove duplicate elements from list in Haskell I'm trying to build a function which will remove all duplicates from a list. S...	[ -0.015380859375, 0.0299072265625, 0.001953125, -0.0108642578125, 0.003143310546875, -0.001800537109375, -0.0027618408203125, 0.0208740234375, 0.0069580078125, -0.017333984375, -0.004547119140625, -0.009521484375, 0.02197265625, 0.00531005859375, -0.01031494140625, 0.01953125, 0.02294...	[ 33976, 10002, 32354, 47, 87388, 171763, 67, 80854, 1295, 5303, 20625, 142508, 1556, 425, 23, 31577, 45367, 756, 1636, 121691, 4034, 68252, 116, 106, 138, 201, 4734, 3444, 2046, 82449, 15490, 119140, 456, 434, 18781, 25632, 18151, 17368, 88,...	[ 0.166259765625, 0.193115234375, 0.2249755859375, 0.03570556640625, 0.1956787109375, 0.26318359375, 0.141845703125, 0.19775390625, 0.121826171875, 0.187255859375, 0.1435546875, 0.2235107421875, 0.1329345703125, 0.055084228515625, 0.032958984375, 0.041412353515625, 0.1220703125, 0.06...	embed
17258711_c0	17258711	haskell	0	Title: can I make StateP from Control.Proxy an instance of MonadState? Problem title: can I make StateP from Control.Proxy an instance of MonadState? Tags: monads, haskell-pipes, haskell Problem: can I make StateP from Control.Proxy an instance of MonadState? I am changing some code that used to run inside a StateT mon...	can I make StateP from Control.Proxy an instance of MonadState? can I make StateP from Control.Proxy an instance of MonadState? monads haskell-pipes haskell Control.Proxy StateP MonadState StateT Control.Lens can I make StateP from Control.Proxy an instance of MonadState? I am changing some code that used to run inside...	[ -0.0244140625, 0.01708984375, -0.01019287109375, 0.00482177734375, -0.00885009765625, 0.006622314453125, -0.025390625, -0.0194091796875, -0.0240478515625, -0.04345703125, 0.0018310546875, 0.0361328125, 0.01055908203125, 0.0125732421875, -0.00848388671875, 0.0123291015625, -0.01391601...	[ 831, 3249, 22836, 683, 1295, 27131, 10752, 50878, 110527, 60331, 71, 135206, 13, 5, 2667, 712, 1556, 142508, 1434, 13569, 618, 866, 1755, 151134, 18151, 11675, 46132, 1745, 39933, 144570, 46002, 32399, 15190, 26785, 34831, 35773 ]	[ 0.074462890625, 0.05572509765625, 0.146728515625, 0.2056884765625, 0.0723876953125, 0.2056884765625, 0.1287841796875, 0.221923828125, 0.2147216796875, 0.147216796875, 0.112060546875, 0.2012939453125, 0.08502197265625, 0.0150604248046875, 0.07958984375, 0.1207275390625, 0.034332275390...	embed
18175405_c0	18175405	haskell	0	Title: Why haskell use a type of ReadS a to represent a function? Problem title: Why haskell use a type of ReadS a to represent a function? Tags: haskell, function Problem: Why haskell use a type of ReadS a to represent a function? I am reading the source code of reads . reads is defined as reads :: Read a => ReadS a S...	Why haskell use a type of ReadS a to represent a function? Why haskell use a type of ReadS a to represent a function? haskell function Why ReadS Read Why haskell use a type of ReadS a to represent a function? I am reading the source code of reads . reads is defined as reads :: Read a => ReadS a So it simply returns Rea...	[ 0.0152587890625, -0.0026397705078125, 0.015625, 0.0179443359375, -0.01446533203125, 0.00518798828125, 0.007659912109375, -0.00970458984375, -0.0020599365234375, 0.00518798828125, 0.0267333984375, -0.032470703125, -0.0272216796875, -0.00191497802734375, 0.0177001953125, -0.0147094726562...	[ 44084, 1556, 142508, 4527, 10644, 4764, 294, 10, 33636, 32354, 47, 111, 16454, 31344, 18151, 12301, 7, 61924, 237, 42856, 30646, 12960, 110527, 23351, 33079, 11, 214, 13580, 176377, 1295, 4734, 5646, 79315, 10298, 370, 8705, 15400, 15490, 1...	[ 0.1163330078125, 0.137939453125, 0.2225341796875, 0.09326171875, 0.1722412109375, 0.2496337890625, 0.160400390625, 0.1734619140625, 0.21142578125, 0.1680908203125, 0.0249481201171875, 0.017181396484375, 0.033203125, 0.09814453125, 0.0498046875, 0.24365234375, 0.1629638671875, 0.149...	embed
43308131_c0	43308131	haskell	0	Title: How to print a mult-line string with `putStrLn`? Problem title: How to print a mult-line string with `putStrLn`? Tags: haskell Problem: How to print a mult-line string with `putStrLn`? I am writing a very simple program in Haskell that asks the user for a name and then displays some text based on that name. I ca...	How to print a mult-line string with `putStrLn`? How to print a mult-line string with `putStrLn`? haskell How How to print a mult-line string with `putStrLn`? I am writing a very simple program in Haskell that asks the user for a name and then displays some text based on that name. I can get the program to work, but I ...	[ -0.00095367431640625, -0.00933837890625, -0.01141357421875, 0.037109375, 0.00079345703125, 0.01483154296875, 0.003692626953125, -0.0048828125, -0.008544921875, 0.00604248046875, 0.0030364990234375, -0.0162353515625, -0.00787353515625, 0.0172119140625, -0.01361083984375, 0.0117797851562...	[ 11249, 47, 28412, 3869, 9, 2256, 79315, 678, 7077, 71713, 866, 19, 1556, 142508, 32562, 4552, 8781, 1528, 20625, 26458, 38937, 9351, 44116, 7986, 35509, 4488, 1884, 125429, 10001, 49726, 111, 10, 7515, 3229, 107730, 759, 25, 1974, 1660, 1...	[ 0.0830078125, 0.0215911865234375, 0.206787109375, 0.253173828125, 0.040283203125, 0.1900634765625, 0.2374267578125, 0.07513427734375, 0.1932373046875, 0.211181640625, 0.13525390625, 0.1544189453125, 0.09814453125, 0.222412109375, 0.07421875, 0.00677490234375, 0.064697265625, 0.1033...	embed
43850946_c0	43850946	haskell	0	Title: haskell error parse error on input '\|' Problem title: haskell error parse error on input '\|' Tags: haskell, parsing, input, greatest-common-divisor Problem: haskell error parse error on input '\|' I'm trying to write a Greatest Common Divisor function in haskell. This is what I have so far: gc...	haskell error parse error on input '\|' haskell error parse error on input '\|' haskell parsing input greatest-common-divisor gcd1 haskell error parse error on input '\|' I'm trying to write a Greatest Common Divisor function in haskell. This is what I have so far: When I try to compile, I get that err...	[ -0.01025390625, 0.01611328125, -0.01409912109375, -0.0093994140625, 0.0006103515625, 0.000644683837890625, -0.00775146484375, -0.02783203125, -0.006103515625, -0.027587890625, 0.00579833984375, -0.0003509521484375, 0.004302978515625, -0.010009765625, 0.00982666015625, -0.00640869140625...	[ 1556, 142508, 18499, 366, 184, 98, 107730, 3768, 158036, 277, 3796, 428, 51858, 22109, 71, 418, 58745, 87, 31577, 33022, 32774, 525, 151301, 803, 32354, 23, 2060, 14847, 9790, 9969, 1340, 2046, 450, 12301, 4527, 35011, 32628, 83324, 7440, ...	[ 0.168701171875, 0.261962890625, 0.242919921875, 0.173828125, 0.116943359375, 0.09320068359375, 0.212158203125, 0.102294921875, 0.16748046875, 0.055999755859375, 0.14697265625, 0.133544921875, 0.266357421875, 0.09344482421875, 0.10565185546875, 0.100830078125, 0.00347900390625, 0.00...	embed
4703576_c0	4703576	haskell	0	Title: Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Problem title: Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Tags: haskell, functional-programming Problem: Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Why does map (^2) [1..10] work and also map ...	Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Why do both map (^2) xs and map (2^) xs work as expected in Haskell? haskell functional-programming Why Haskell Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Why does work and also work? I'd expect it only to work with one of th...	[ 0.00823974609375, 0.0014801025390625, 0.003387451171875, -0.010009765625, 0.00885009765625, 0.01904296875, -0.0019073486328125, 0.00775146484375, 0.006195068359375, -0.005859375, 0.00860595703125, -0.0087890625, -0.0002956390380859375, -0.0024261474609375, -0.01123046875, -0.0206298828...	[ 44084, 15044, 22288, 8353, 10461, 1022, 7, 136, 4700, 4488, 237, 84751, 20625, 142508, 1556, 123309, 28966, 54, 23, 14602, 2843, 71, 41206, 4734, 678, 1632, 2856, 959, 100, 17569, 2806, 8560, 645, 756, 80854, 68252, 5, 963, 11180, 19388, ...	[ 0.11083984375, 0.111572265625, 0.23095703125, 0.16845703125, 0.213623046875, 0.1649169921875, 0.1348876953125, 0.0479736328125, 0.11669921875, 0.1451416015625, 0.0810546875, 0.1624755859375, 0.153076171875, 0.263671875, 0.0997314453125, 0.0921630859375, 0.02532958984375, 0.00558471...	embed
33580535_c0	33580535	haskell	0	Title: trying to learn while solving some basic haskell problems Problem title: trying to learn while solving some basic haskell problems Tags: haskell Problem: trying to learn while solving some basic haskell problems I am new to haskell and trying out some exercise.While trying to load the below code i am getting a b...	trying to learn while solving some basic haskell problems trying to learn while solving some basic haskell problems haskell howmanyequal::Int trying to learn while solving some basic haskell problems I am new to haskell and trying out some exercise.While trying to load the below code i am getting a binding error howman...	[ -0.010986328125, 0.0179443359375, -0.01104736328125, 0.004364013671875, -0.00347900390625, 0.015869140625, -0.0036163330078125, -0.0220947265625, -0.011962890625, -0.00171661376953125, -0.0093994140625, -0.028076171875, 0.034423828125, 0.0067138671875, 0.004852294921875, -0.00946044921...	[ 31577, 30698, 12960, 3115, 62822, 1556, 142508, 44402, 3642, 669, 1033, 71723, 4153, 18, 3060, 3525, 81979, 72367, 35064, 18151, 128239, 18499, 53, 55547, 13, 32354, 54694, 22936, 14192, 121742, 16940 ]	[ 0.1302490234375, 0.11376953125, 0.07928466796875, 0.0736083984375, 0.0975341796875, 0.128173828125, 0.1890869140625, 0.0882568359375, 0.1585693359375, 0.131591796875, 0.0928955078125, 0.2373046875, 0.01531982421875, 0.0909423828125, 0.00048828125, 0.06951904296875, 0.0389404296875, ...	embed
39557158_c1	39557158	haskell	1	.1, cabal 1.24, llvm-3.8.1 . I installed llvm-general by cloning the llvm-3.8 branch and running cabal install with -fshared-llvm. I assure you I have ncurses installed, also libcurses.so file is a symlink to /usr/lib/libncurses.so , I also have /usr/lib/libncursesw.so (which is also a symlink to /usr/lib/libncursesw.s...	.1, cabal 1.24, llvm-3.8.1 . I installed llvm-general by cloning the llvm-3.8 branch and running cabal install with -fshared-llvm. I assure you I have ncurses installed, also libcurses.so file is a symlink to /usr/lib/libncurses.so , I also have /usr/lib/libncursesw.so (which is also a symlink to /usr/lib/libncursesw.s...	[ 0.002410888671875, 0.01116943359375, -0.00286865234375, 0.01470947265625, 0.00384521484375, -0.0079345703125, 0.0103759765625, -0.0174560546875, -0.00897216796875, -0.016845703125, -0.00135040283203125, -0.0294189453125, 0.002288818359375, -0.01055908203125, -0.0084228515625, -0.013244...	[ 5, 418, 109524, 2357, 96, 3723, 39, 8316, 206730, 87, 20600, 180300, 20450, 135527, 32845, 51042, 678, 420, 67886, 1181, 334, 92784, 765, 653, 48650, 90, 297, 25474, 991, 11435, 954, 10187, 5612, 434, 910, 21672, 11787, 83, 63590, 29908, ...	[ 0.046783447265625, 0.05133056640625, 0.24560546875, 0.135009765625, 0.027191162109375, 0.159912109375, 0.1514892578125, 0.05126953125, 0.157958984375, 0.01922607421875, 0.1322021484375, 0.1822509765625, 0.095947265625, 0.166015625, 0.05267333984375, 0.00921630859375, 0.01425170898437...	embed
40448260_c0	40448260	haskell	0	Title: Moving average in Haskell Problem title: Moving average in Haskell Tags: weighted-average, arrays, haskell, moving-average Problem: Moving average in Haskell Given a list of weights: let weights = [0.1, 0.2, 0.4, 0.2, 0.1] and an array of measurements, I want to implement the weighted average. This is how I woul...	Moving average in Haskell Moving average in Haskell weighted-average arrays haskell moving-average Moving Haskell n-3 n-2 n-1 Moving average in Haskell Given a list of weights: and an array of measurements, I want to implement the weighted average. This is how I would do it in Python: I know Haskell doesn't have arrays...	[ -0.0038909912109375, 0.021484375, -0.020263671875, -0.007537841796875, -0.00787353515625, 0.0064697265625, -0.006378173828125, 0.01202392578125, 0.021484375, -0.0150146484375, 0.0001010894775390625, -0.0220947265625, -0.00048065185546875, -0.01116943359375, -0.024658203125, 0.005157470...	[ 2501, 6496, 83080, 23, 20625, 142508, 57888, 297, 8216, 29838, 10298, 4778, 1556, 98567, 8316, 5428, 5759, 5303, 72350, 9035, 3444, 29479, 3642, 2806, 145581, 22027, 18, 765, 31577, 69307, 27226, 13409, 120337, 61924, 23009 ]	[ 0.1085205078125, 0.088623046875, 0.2393798828125, 0.04730224609375, 0.16015625, 0.2783203125, 0.2203369140625, 0.1119384765625, 0.1844482421875, 0.1474609375, 0.128173828125, 0.1002197265625, 0.1583251953125, 0.177978515625, 0.1524658203125, 0.1048583984375, 0.08837890625, 0.117553...	embed
46633608_c0	46633608	haskell	0	Title: How do I add a CPP defininition within cabal / stack? Problem title: How do I add a CPP defininition within cabal / stack? Tags: haskell, haskell-stack, cabal Problem: How do I add a CPP defininition within cabal / stack? I'm looking at the following module: https://hackage.haskell.org/package/boxes-0.1.4/docs/s...	How do I add a CPP defininition within cabal / stack? How do I add a CPP defininition within cabal / stack? haskell haskell-stack cabal How CPP Text.PrettyPrint.Boxes Constructing TESTING Box How do I add a CPP defininition within cabal / stack? I'm looking at the following module: https://hackage.haskell.org/package/b...	[ 0.0142822265625, -0.0002994537353515625, 0.00946044921875, 0.00946044921875, 0.012451171875, -0.00335693359375, 0.01177978515625, 0.00396728515625, 0.0032806396484375, 0.01019287109375, 0.006011962890625, -0.03857421875, 0.0032501220703125, -0.0029449462890625, -0.000919342041015625, 0...	[ 11249, 15190, 10, 313, 17487, 13204, 93, 1363, 28032, 109524, 248, 177261, 1556, 142508, 590, 2594, 24129, 19273, 15145, 112079, 72295, 90, 36716, 31273, 68151, 27271, 16487, 88996, 139509, 4588, 10557, 29102, 11728, 102014, 174379, 18, 10941, ...	[ 0.06695556640625, 0.16259765625, 0.050079345703125, 0.106689453125, 0.337158203125, 0.2054443359375, 0.1080322265625, 0.0628662109375, 0.13671875, 0.2376708984375, 0.0504150390625, 0.20263671875, 0.08056640625, 0.186279296875, 0.058868408203125, 0.06494140625, 0.133544921875, 0.074...	embed
9963050_c0	9963050	haskell	0	Title: Standard way of joining two Data.Texts without `mappend` Problem title: Standard way of joining two Data.Texts without `mappend` Tags: haskell Problem: Standard way of joining two Data.Texts without `mappend` I hear that Data.Text is going to replace String s in future Haskell versions. One issue I have with thi...	Standard way of joining two Data.Texts without `mappend` Standard way of joining two Data.Texts without `mappend` haskell Standard Data.Texts Data.Text Text text1 text2 Standard way of joining two Data.Texts without `mappend` I hear that Data.Text is going to replace String s in future Haskell versions. One issue I hav...	[ 0.01434326171875, -0.00634765625, 0.003509521484375, 0.0224609375, 0.0034332275390625, 0.0010986328125, -0.0003414154052734375, 0.01953125, 0.023193359375, -0.034423828125, 0.0223388671875, -0.01165771484375, -0.00023555755615234375, -0.019287109375, 0.007476806640625, -0.0023651123046...	[ 20744, 3917, 33284, 214, 6626, 11809, 174379, 15490, 192, 9858, 71, 1556, 142508, 24129, 7986, 418, 304, 36802, 5, 91995, 23351, 91, 22690, 20625, 11389, 31089, 37223, 61924, 100, 5303, 4734, 158, 33478, 76, 67, 4527, 130078, 62163, 57823, ...	[ 0.2091064453125, 0.1016845703125, 0.20263671875, 0.083251953125, 0.1781005859375, 0.1513671875, 0.26123046875, 0.127197265625, 0.1270751953125, 0.1343994140625, 0.1119384765625, 0.12646484375, 0.218994140625, 0.21142578125, 0.1341552734375, 0.031005859375, 0.1202392578125, 0.019683...	embed
6557808_c0	6557808	haskell	0	Title: Understanding type Problem title: Understanding type Tags: haskell Problem: Understanding type A few questions about the Haskell programming language: What's the difference between these two code statements? I'm convinced they should be the same: type T = [Char] type CurrentValue = Char My concern is that, in th...	Understanding type Understanding type haskell Understanding Char CurrentValue Maybe Understanding type A few questions about the Haskell programming language: What's the difference between these two code statements? I'm convinced they should be the same: My concern is that, in the second one, there are no brackets. Any...	[ 0.01007080078125, -0.0169677734375, 0.0025787353515625, 0.034912109375, 0.00689697265625, 0.01348876953125, -0.012451171875, -0.005157470703125, 0.0037384033203125, 0.00762939453125, 0.002166748046875, -0.0263671875, -0.00250244140625, 0.003143310546875, -0.0166015625, 0.013916015625, ...	[ 9626, 144057, 10644, 1556, 142508, 21656, 114063, 856, 50770, 83425, 10846, 17582, 20625, 56037, 46876, 60212, 17721, 6626, 18151, 63805, 5701, 50509, 17932, 110, 1620, 27853, 21635, 5256, 83, 23351, 214, 436, 84068, 32354, 10750, 391, 82419, ...	[ 0.1356201171875, 0.1600341796875, 0.2685546875, 0.1302490234375, 0.2498779296875, 0.2225341796875, 0.1739501953125, 0.1131591796875, 0.1141357421875, 0.2261962890625, 0.0399169921875, 0.0531005859375, 0.1351318359375, 0.0726318359375, 0.1158447265625, 0.14697265625, 0.07318115234375,...	embed
68749693_c0	68749693	haskell	0	Title: Haskell Character in String function Problem title: Haskell Character in String function Tags: string, haskell, character, list Problem: Haskell Character in String function Hey I'm a pretty new beginner to Haskell and I am having a small problem. I want to write a function which checks if a given character is i...	Haskell Character in String function Haskell Character in String function string haskell character list Haskell Character Char Bool x:xs Parse Haskell Character in String function Hey I'm a pretty new beginner to Haskell and I am having a small problem. I want to write a function which checks if a given character is in...	[ -0.007476806640625, 0.01104736328125, -0.0023651123046875, 0.028076171875, -0.0024566650390625, 0.023681640625, 0.01287841796875, -0.007110595703125, -0.003875732421875, -0.0016632080078125, 0.02294921875, -0.038818359375, -0.00531005859375, 0.0135498046875, -0.0218505859375, 0.0161132...	[ 20625, 142508, 21656, 2263, 720, 23, 23351, 214, 32354, 79315, 1556, 62816, 5303, 2460, 929, 1022, 12, 425, 2392, 184, 28240, 28875, 3525, 9842, 1679, 19441, 19336, 2967, 3444, 33022, 12765, 2174, 34475, 83, 11853, 759, 18151, 15787, 10422,...	[ 0.15234375, 0.2431640625, 0.1636962890625, 0.160888671875, 0.10498046875, 0.1888427734375, 0.2196044921875, 0.166015625, 0.1815185546875, 0.240966796875, 0.129638671875, 0.227783203125, 0.1336669921875, 0.078857421875, 0.1688232421875, 0.058502197265625, 0.00897216796875, 0.0930175...	embed
63970480_c0	63970480	haskell	0	Title: How does Haskell runtime represent lazy values? Problem title: How does Haskell runtime represent lazy values? Tags: internal-representation, lazy-evaluation, pointers, haskell Problem: How does Haskell runtime represent lazy values? I don't even know how to express this question. A assume there's a pointer to a...	How does Haskell runtime represent lazy values? How does Haskell runtime represent lazy values? internal-representation lazy-evaluation pointers haskell How Haskell How does Haskell runtime represent lazy values? I don't even know how to express this question. A assume there's a pointer to a non evaluated expression. I...	[ -0.003509521484375, 0.00775146484375, 0.021728515625, 0.01141357421875, -0.006866455078125, 0.025390625, -0.00188446044921875, 0.002777099609375, 0.001983642578125, 0.006591796875, -0.003936767578125, -0.0089111328125, 0.003814697265625, 0.00775146484375, 0.005401611328125, 0.023925781...	[ 11249, 20625, 142508, 11675, 6032, 33636, 21, 3285, 142424, 70796, 205913, 159258, 6275, 1314, 1556, 14602, 3714, 36510, 41591, 56, 47, 351, 151575, 125195, 50336, 81113, 32354, 552, 34292, 91995, 44691, 11907, 49938, 13254, 2809, 959, 219836, ...	[ 0.060302734375, 0.135498046875, 0.26220703125, 0.1055908203125, 0.15478515625, 0.205322265625, 0.1448974609375, 0.226806640625, 0.21533203125, 0.096435546875, 0.151123046875, 0.1431884765625, 0.160888671875, 0.07830810546875, 0.118408203125, 0.043365478515625, 0.0186614990234375, 0...	embed
12278716_c0	12278716	haskell	0	Title: Haskell triangle microbenchmark Problem title: Haskell triangle microbenchmark Tags: haskell, ghc Problem: Haskell triangle microbenchmark int main(void) { int a,b,c, N=1000; int cnt = 0; for (a=1;a<=N;a++) for (b=1;b<=N;b++) for (c=1;c<=N;c++) if (aa+bb==c*c) cnt++; printf("%d\n", cnt); } Compilation: Haskell...	Haskell triangle microbenchmark Haskell triangle microbenchmark haskell ghc Haskell stdio.h triangle.hs triangle.c Haskell triangle microbenchmark Consider this simple "benchmark": and appropriate C version: Compilation: Haskell version is compiled as: ghc -O2 triangle.hs (ghc 7.4.1) C version is compiled as: gcc -O2 -...	[ -0.00531005859375, -0.0107421875, 0.01373291015625, -0.0013275146484375, 0.004486083984375, -0.002655029296875, -0.00799560546875, -0.013916015625, -0.004608154296875, -0.0400390625, -0.01458740234375, -0.016357421875, 0.0032806396484375, -0.010986328125, -0.0225830078125, -0.000328063...	[ 20625, 142508, 1927, 109217, 11948, 776, 206, 10015, 1556, 31380, 238, 6138, 5670, 127, 137399, 8781, 95307, 313, 11389, 15612, 14, 57860, 375, 5974, 237, 20, 670, 304, 15, 9486, 2861, 120518, 22109, 177, 10060, 1398, 200768, 28398, 20028, ...	[ 0.2042236328125, 0.279296875, 0.19189453125, 0.20654296875, 0.1497802734375, 0.1671142578125, 0.1632080078125, 0.1695556640625, 0.1158447265625, 0.1351318359375, 0.102294921875, 0.052001953125, 0.1409912109375, 0.111572265625, 0.0220184326171875, 0.099853515625, 0.0882568359375, 0....	embed
26735523_c1	26735523	haskell	1	d = c : shuffle g' d' where (c, g') = oneRandomCard g d d' = d\\[c] oneRandomCard :: StdGen -> [Card] -> (Card, StdGen) oneRandomCard g d =((last $ take n d), g1 ) where (n,g1) = randomR (1, length d) g I see that in a first look this question seems trivial, but given the way that haskell treats randomness I thought i...	d = c : shuffle g' d' where (c, g') = oneRandomCard g d d' = d\\[c] oneRandomCard :: StdGen -> [Card] -> (Card, StdGen) oneRandomCard g d =((last $ take n d), g1 ) where (n,g1) = randomR (1, length d) g I see that in a first look this question seems trivial, but given the way that haskell treats randomness I thought i...	[ 0.00299072265625, 0.0162353515625, 0.006072998046875, -0.00167083740234375, 0.0208740234375, -0.005950927734375, -0.00021076202392578125, -0.01123046875, 0.0009002685546875, -0.046630859375, 0.005828857421875, 0.0439453125, -0.02783203125, 0.00927734375, -0.0087890625, 0.0074462890625,...	[ 104, 2203, 501, 152, 170052, 706, 25, 7440, 238, 1632, 126525, 3815, 156119, 1984, 2907, 71, 105376, 19777, 3650, 5646, 653, 418, 19, 177, 17727, 96759, 1052, 2858, 140909, 5117, 6713, 9655, 37202, 686, 1556, 142508, 85689, 7432, 17569, 4...	[ 0.2008056640625, 0.10186767578125, 0.07293701171875, 0.029876708984375, 0.304443359375, 0.108154296875, 0.121826171875, 0.0277557373046875, 0.0272216796875, 0.14697265625, 0.1575927734375, 0.1939697265625, 0.2354736328125, 0.0205535888671875, 0.12158203125, 0.121337890625, 0.17150878...	embed
74100154_c0	74100154	haskell	0	Title: Haskell list of pairs to pairs of lists Problem title: Haskell list of pairs to pairs of lists Tags: tuples, recursion, list, haskell Problem: Haskell list of pairs to pairs of lists I have seen here, that there are several approaches to solve it, but I am struggling to solve it with recursion. Example: [("a",1)...	Haskell list of pairs to pairs of lists Haskell list of pairs to pairs of lists tuples recursion list haskell Haskell Haskell list of pairs to pairs of lists I have seen here, that there are several approaches to solve it, but I am struggling to solve it with recursion. Example: [("a",1), ("b",2)] to (["a","b"] ,[1,2])...	[ -0.00848388671875, 0.0076904296875, 0.00144195556640625, 0.020751953125, -0.0028533935546875, 0.031494140625, -0.00830078125, -0.0230712890625, 0.006072998046875, -0.01202392578125, 0.0123291015625, -0.01904296875, 0.006500244140625, 0.01068115234375, -0.005462646484375, 0.001518249511...	[ 20625, 142508, 5303, 111, 80836, 7, 47, 370, 99726, 195625, 1830, 1556, 51515, 86869, 237875, 678, 89536, 378, 11, 830, 17727, 275, 10461, 133063, 2060, 37842, 132887, 8335, 481, 132, 4, 1022, 2203, 997, 171259, 22027, 18, 4488, 6528 ]	[ 0.1531982421875, 0.1910400390625, 0.2232666015625, 0.1080322265625, 0.258056640625, 0.093994140625, 0.1688232421875, 0.08251953125, 0.115478515625, 0.1925048828125, 0.08172607421875, 0.139404296875, 0.07122802734375, 0.10400390625, 0.078125, 0.013671875, 0.0638427734375, 0.00701904...	embed
44505728_c0	44505728	haskell	0	Title: How to read stdin in a Haskell program with command-line arguments? Problem title: How to read stdin in a Haskell program with command-line arguments? Tags: stdin, haskell, command-line-arguments Problem: How to read stdin in a Haskell program with command-line arguments? I know I can use interact :: (String -> ...	How to read stdin in a Haskell program with command-line arguments? How to read stdin in a Haskell program with command-line arguments? stdin haskell command-line-arguments How Haskell How to read stdin in a Haskell program with command-line arguments? I know I can use interact :: (String -> String) -> IO () to conveni...	[ -0.00970458984375, -0.005218505859375, 0.005615234375, 0.008056640625, -0.002197265625, 0.0079345703125, 0.02001953125, -0.01531982421875, -0.0091552734375, -0.0390625, 0.0035858154296875, -0.0174560546875, -0.010986328125, -0.0072021484375, 0, -0.0157470703125, 0.00439453125, -0.0...	[ 11249, 47, 12301, 6138, 3035, 23, 20625, 142508, 1528, 678, 75101, 2256, 10750, 1556, 155937, 9, 3714, 831, 4527, 78974, 1984, 71713, 33079, 23351, 17780, 142267, 1295, 33022, 246, 1003, 8781, 796, 7232, 7, 73, 7077, 2940, 6056, 15190, 32...	[ 0.0806884765625, 0.0777587890625, 0.2281494140625, 0.1925048828125, 0.24462890625, 0.06573486328125, 0.1478271484375, 0.2412109375, 0.1676025390625, 0.066650390625, 0.1949462890625, 0.168701171875, 0.22119140625, 0.1217041015625, 0.1854248046875, 0.031158447265625, 0.004150390625, ...	embed
47325859_c0	47325859	haskell	0	Title: how to see the implemented code of a function of a module in haskell? Problem title: how to see the implemented code of a function of a module in haskell? Tags: functional-programming, module, haskell Problem: how to see the implemented code of a function of a module in haskell? I am a newbie to Haskell and I kn...	how to see the implemented code of a function of a module in haskell? how to see the implemented code of a function of a module in haskell? functional-programming module haskell how to see the implemented code of a function of a module in haskell? I am a newbie to Haskell and I know The Haskell standard library is spli...	[ 0.0150146484375, -0.002410888671875, 0.00665283203125, 0.0269775390625, 0.0205078125, 0.0196533203125, 0.009765625, -0.01446533203125, -0.007568359375, -0.029052734375, 0.0052490234375, -0.04150390625, 0.0113525390625, -0.01611328125, 0.00360107421875, -0.0125732421875, -0.0005035400...	[ 3642, 47, 1957, 70, 29479, 18151, 111, 32354, 88996, 23, 1556, 142508, 123309, 28966, 3525, 9014, 20625, 5570, 35773, 1294, 65450, 3934, 70541, 52895, 62548, 39210, 60042, 1884, 208124, 40899, 136913, 831, 75101, 31380, 318, 65514 ]	[ 0.08038330078125, 0.09625244140625, 0.1829833984375, 0.052093505859375, 0.253662109375, 0.24658203125, 0.0596923828125, 0.1748046875, 0.218017578125, 0.0660400390625, 0.13916015625, 0.2344970703125, 0.1229248046875, 0.05218505859375, 0.00811767578125, 0.07818603515625, 0.128662109375...	embed
8443035_c0	8443035	haskell	0	Title: Multi-line commands in GHCi Problem title: Multi-line commands in GHCi Tags: haskell, multiline-repl-definition, ghci Problem: Multi-line commands in GHCi I am having problem in entering multi-line commands in ghci. The following 2-line code works from a file: addTwo :: Int -> Int -> Int addTwo x y = x + y But w...	Multi-line commands in GHCi Multi-line commands in GHCi haskell multiline-repl-definition ghci Multi-line GHCi Variable Multi-line commands in GHCi I am having problem in entering multi-line commands in ghci. The following 2-line code works from a file: But when I enter in ghci, I get an error: I also tried putting the...	[ -0.0093994140625, 0.005096435546875, -0.000972747802734375, 0.031494140625, 0.00128936767578125, 0.0133056640625, 0.0020599365234375, 0.0011444091796875, 0.0037841796875, -0.0189208984375, -0.005615234375, -0.0194091796875, -0.01495361328125, 0.01904296875, 0.0068359375, 0.002182006835...	[ 19335, 2256, 75101, 527, 73265, 14, 23, 1556, 142508, 6024, 107, 2424, 49919, 31380, 318, 84572, 2967, 22, 33558, 25632, 4720, 18151, 43240, 1295, 11435, 30957, 18499, 46132, 153, 959, 20697, 27781, 96819, 124519, 3934, 1632, 13315, 17686, ...	[ 0.2060546875, 0.2237548828125, 0.243896484375, 0.0887451171875, 0.13134765625, 0.224853515625, 0.0592041015625, 0.0806884765625, 0.1842041015625, 0.186767578125, 0.03826904296875, 0.133056640625, 0.09722900390625, 0.144287109375, 0.21337890625, 0.1138916015625, 0.08660888671875, 0....	embed
58905982_c0	58905982	haskell	0	Title: Having "parse error on input ‘->’" in a case of Problem title: Having "parse error on input ‘->’" in a case of Tags: haskell Problem: Having "parse error on input ‘->’" in a case of I'm having a weird error in this simple haskell code. I confirm I'm using spaces everywhere and I don't s...	Having "parse error on input ‘->’" in a case of Having "parse error on input ‘->’" in a case of haskell Having Maybe Just There Nothing Having "parse error on input ‘->’" in a case of I'm having a weird error in this simple haskell code. I confirm I'm using spaces everywhere and I don't see an...	[ -0.0076904296875, 0.00482177734375, -0.0186767578125, -0.004913330078125, 0.00469970703125, 0.01361083984375, -0.000278472900390625, -0.0069580078125, 0.01300048828125, -0.029052734375, 0.00086212158203125, 0.01129150390625, -0.004730224609375, -0.01190185546875, 0.0050048828125, -0.01...	[ 171855, 2500, 184, 18499, 98, 107730, 9, 1230, 5386, 7225, 41502, 26, 1556, 142508, 83425, 9563, 8622, 182747, 103607, 111, 19441, 179459, 23, 903, 8781, 18151, 39563, 17368, 32628, 7, 219743, 2967, 18597, 22062, 132283, 6002, 86531 ]	[ 0.0833740234375, 0.147216796875, 0.1578369140625, 0.2138671875, 0.05206298828125, 0.169677734375, 0.10467529296875, 0.0251922607421875, 0.1666259765625, 0.07196044921875, 0.0185089111328125, 0.009857177734375, 0.1529541015625, 0.2379150390625, 0.152099609375, 0.06939697265625, 0.1131...	embed
60941240_c0	60941240	haskell	0	Title: "Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell Problem title: "Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell Tags: cabal, haskell Problem: "C...	"Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell "Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell cabal haskell Control.Exception runhaskell Test.Hspec ...	[ -0.012939453125, -0.0206298828125, -0.006927490234375, 0.003326416015625, -0.0000762939453125, 0.016845703125, 0.00836181640625, -0.00433349609375, -0.017822265625, -0.02587890625, -0.0030670166015625, -0.00634765625, -0.01165771484375, -0.004974365234375, 0.00445556640625, -0.00103759...	[ 52366, 959, 72367, 88996, 175904, 46674, 712, 135206, 32786, 204105, 98169, 39, 18, 141, 5428, 70147, 18499, 11675, 10557, 142508, 109524, 1556, 27131, 8647, 16711, 202567, 167599, 137989, 56359, 11809, 166179, 217225, 191147, 347, 5337, 47107, ...	[ 0.07177734375, 0.0833740234375, 0.2122802734375, 0.2244873046875, 0.231689453125, 0.07501220703125, 0.1168212890625, 0.1739501953125, 0.1864013671875, 0.20947265625, 0.2127685546875, 0.06414794921875, 0.1561279296875, 0.1973876953125, 0.118896484375, 0.2291259765625, 0.1165771484375,...	embed
12878651_c1	12878651	haskell	1	in some format. Why? Here's the application. A is "Download a file from an FTP server." B is "convert from flac to mp3". A contains username, password, port, etc. information. B contains file path information. There could be MANY As and Bs. Hundreds. As many as people are willing to compile into the program. Two was j...	in some format. Why? Here's the application. A is "Download a file from an FTP server." B is "convert from flac to mp3". A contains username, password, port, etc. information. B contains file path information. There could be MANY As and Bs. Hundreds. As many as people are willing to compile into the program. Two was j...	[ 0.009765625, -0.01904296875, 0.0067138671875, 0.003387451171875, -0.0189208984375, 0.01434326171875, -0.004730224609375, -0.00019359588623046875, 0.0289306640625, 0.0263671875, 0.0062255859375, -0.0123291015625, 0.006439208984375, 0.017578125, -0.0296630859375, -0.01239013671875, 0.0...	[ 23, 3060, 9384, 44084, 11853, 38415, 62, 83, 144786, 11435, 162379, 10723, 335, 2271, 11549, 174911, 47, 9607, 363, 70541, 38937, 11627, 78506, 11469, 4677, 60875, 5809, 186, 276, 93333, 1301, 136, 49083, 5941, 3395, 109269, 9969, 1340, 393...	[ 0.1082763671875, 0.07000732421875, 0.2164306640625, 0.0966796875, 0.0267333984375, 0.1773681640625, 0.0723876953125, 0.030792236328125, 0.1134033203125, 0.091552734375, 0.15966796875, 0.07708740234375, 0.07452392578125, 0.0089111328125, 0.096435546875, 0.1483154296875, 0.025588989257...	embed
35161616_c0	35161616	haskell	0	Title: Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? Problem title: Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? Tags: haskell, haskell-pipes Problem: Why does Haskell Pipes...	Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? haskell haskell-pipes Why Haskell Pipes Why does Haskell Pipes "use () to close un...	[ -0.00162506103515625, 0.02197265625, 0.007080078125, -0.0027618408203125, -0.03173828125, 0.01025390625, -0.016845703125, -0.013671875, -0.007659912109375, 0.0245361328125, -0.0072021484375, -0.0299072265625, 0.01544189453125, 0.0186767578125, 0.009521484375, -0.003265380859375, 0.00...	[ 44084, 20625, 142508, 93128, 90, 41502, 4032, 15, 20903, 51, 33740, 107730, 136, 1193, 73, 54815, 10644, 47, 140992, 14602, 1556, 1434, 13569, 183447, 1884, 28219, 15400, 621, 11814, 3917, 1836, 959, 707, 16, 100, 15044 ]	[ 0.1446533203125, 0.142578125, 0.246337890625, 0.2022705078125, 0.16357421875, 0.005889892578125, 0.1492919921875, 0.09814453125, 0.174560546875, 0.05743408203125, 0.16845703125, 0.2017822265625, 0.1436767578125, 0.213134765625, 0.029571533203125, 0.12841796875, 0.1419677734375, 0.0...	embed
29414360_c0	29414360	haskell	0	Title: Can I automatically implement classes? Problem title: Can I automatically implement classes? Tags: scalaz, haskell Problem: Can I automatically implement classes? In Scalaz every Monad instance is automatically an instance of Applicative . implicit val listInstance = new Monad[List] { def point[A](a: => A) = Lis...	Can I automatically implement classes? Can I automatically implement classes? scalaz haskell Can Monad Applicative List Works Arrow Profunctor Can I automatically implement classes? In Scalaz every Monad instance is automatically an instance of Applicative . Another example: Arrow is automatically a Profunctor . Howeve...	[ -0.003692626953125, 0.0162353515625, 0.002044677734375, 0.020263671875, -0.015869140625, 0.033447265625, -0.00099945068359375, 0.00958251953125, 0.01043701171875, -0.0086669921875, 0.004180908203125, -0.0220947265625, -0.01519775390625, 0.010009765625, -0.01220703125, -0.00982666015625...	[ 4171, 87, 191082, 29479, 61112, 146232, 169, 1556, 142508, 60331, 71, 5659, 11048, 4935, 32036, 27985, 1172, 15555, 11739, 309, 18770, 152653, 1828, 11907, 110527, 83, 27781, 10, 33306, 23, 20625, 8110, 22691, 13438, 7722, 71864, 57346, 12447...	[ 0.115478515625, 0.0794677734375, 0.26025390625, 0.239501953125, 0.2457275390625, 0.1622314453125, 0.1490478515625, 0.095458984375, 0.262939453125, 0.1666259765625, 0.1309814453125, 0.1192626953125, 0.1666259765625, 0.172607421875, 0.158203125, 0.095703125, 0.07269287109375, 0.20336...	embed
72958489_c0	72958489	haskell	0	Title: Understanding Haskell realToFrac function Problem title: Understanding Haskell realToFrac function Tags: haskell, kotlin Problem: Understanding Haskell realToFrac function I meed to migrate some Haskell code to Kotlin and I have some confusion trying yo understand the next code: floor ((realToFrac minutes :: Dou...	Understanding Haskell realToFrac function Understanding Haskell realToFrac function haskell kotlin Understanding Haskell Double Understanding Haskell realToFrac function I meed to migrate some Haskell code to Kotlin and I have some confusion trying yo understand the next code: minutes is a integer value, my Kotlin code...	[ -0.00089263916015625, 0.0004711151123046875, 0.0004367828369140625, -0.01611328125, 0.01116943359375, -0.01361083984375, -0.0234375, 0.0059814453125, -0.01513671875, -0.00103759765625, 0.007415771484375, -0.00250244140625, -0.005645751953125, 0.00109100341796875, 0.0220947265625, -0.00...	[ 9626, 144057, 20625, 142508, 2773, 7763, 919, 20251, 32354, 1556, 1975, 2397, 107172, 163, 39666, 18151, 47, 19856, 169463, 31577, 28219, 11737, 14633, 83, 10, 892, 1505, 34292, 759, 33342, 1884, 903, 959, 20949, 84751, 50339, 5351, 132283, ...	[ 0.1097412109375, 0.07501220703125, 0.1446533203125, 0.2646484375, 0.197021484375, 0.21484375, 0.0831298828125, 0.239501953125, 0.174560546875, 0.1177978515625, 0.0760498046875, 0.25146484375, 0.126953125, 0.0184326171875, 0.1065673828125, 0.1639404296875, 0.04498291015625, 0.140258...	embed
67178663_c0	67178663	haskell	0	Title: decimal integer to Base4 string Haskell Problem title: decimal integer to Base4 string Haskell Tags: haskell, radix Problem: decimal integer to Base4 string Haskell I'm trying to convert an integer from decimal integer to a string based on base 4, but my unfoldr doesn't work and I'm not sure why or how to replac...	decimal integer to Base4 string Haskell decimal integer to Base4 string Haskell haskell radix Base4 Haskell dec2Base4 i2c Nothing Just decimal integer to Base4 string Haskell I'm trying to convert an integer from decimal integer to a string based on base 4, but my unfoldr doesn't work and I'm not sure why or how to rep...	[ -0.0272216796875, -0.00457763671875, 0.013916015625, 0.0103759765625, -0.00142669677734375, 0.0166015625, -0.0106201171875, -0.0133056640625, 0.00238037109375, 0.00921630859375, -0.0264892578125, -0.0179443359375, -0.00714111328125, 0.0228271484375, -0.004486083984375, 0.01080322265625...	[ 32380, 2749, 892, 1505, 47, 44978, 617, 79315, 20625, 142508, 1556, 4567, 57865, 304, 63473, 182747, 31577, 96760, 1295, 10, 35509, 3647, 201, 759, 51, 42822, 42, 22027, 18, 4488, 9077, 15400, 91995, 442, 831, 4527, 24927, 7, 4358, 30022,...	[ 0.1661376953125, 0.14501953125, 0.140625, 0.1422119140625, 0.1142578125, 0.2293701171875, 0.2071533203125, 0.236572265625, 0.1328125, 0.2039794921875, 0.109619140625, 0.080078125, 0.1549072265625, 0.09130859375, 0.142333984375, 0.014862060546875, 0.061920166015625, 0.1383056640625,...	embed
34826018_c1	34826018	haskell	1	0.0... In-place registering Alphabet-0.1.0.0... Preprocessing test suite 'alphabet-test' for Alphabet-0.1.0.0... [1 of 1] Compiling Main ( tests/AlphabetSpec.hs, dist/build/alphabet-test/alphabet-test-tmp/AlphabetSpec.o ) tests/AlphabetSpec.hs:4:27: Module ‘Alphabet’ does not export ‘alphabet’ Why is my CPP not working...	0.0... In-place registering Alphabet-0.1.0.0... Preprocessing test suite 'alphabet-test' for Alphabet-0.1.0.0... [1 of 1] Compiling Main ( tests/AlphabetSpec.hs, dist/build/alphabet-test/alphabet-test-tmp/AlphabetSpec.o ) tests/AlphabetSpec.hs:4:27: Module ‘Alphabet’ does not export ‘alphabet’ Why is my CPP not working...	[ -0.0089111328125, 0.002838134765625, -0.00494384765625, 0.01806640625, -0.0038909912109375, -0.01397705078125, 0.027587890625, 0.00732421875, -0.007720947265625, 0.0262451171875, -0.011962890625, -0.0084228515625, 0.00360107421875, 0.01373291015625, -0.005157470703125, 0.00037193298339...	[ 89678, 360, 23935, 68067, 76569, 4626, 102014, 99929, 1914, 63923, 3034, 14947, 229231, 6954, 15612, 49725, 12321, 109921, 6210, 14612, 47107, 127, 271, 177149, 2676, 31, 27592, 63014, 14602, 959, 31255, 44084, 759, 313, 17487, 20697, 237, 84...	[ 0.2232666015625, 0.046417236328125, 0.14892578125, 0.1944580078125, 0.159912109375, 0.1895751953125, 0.1917724609375, 0.2130126953125, 0.108642578125, 0.1353759765625, 0.1871337890625, 0.169189453125, 0.2340087890625, 0.2135009765625, 0.0859375, 0.114501953125, 0.1002197265625, 0.1...	embed
35541009_c0	35541009	haskell	0	Title: tuple or data for loading file haskell Problem title: tuple or data for loading file haskell Tags: file, tuples, haskell Problem: tuple or data for loading file haskell I have to load a database of the format: "Blade Runner" "Ridley Scott" 1982 ("Amy",5), ("Bill",8), ("Ian",7), ("Kevin",9), ("Emma",4), ("Sam",7)...	tuple or data for loading file haskell tuple or data for loading file haskell file tuples haskell Blade Runner Ridley Scott Amy Bill Ian Kevin Emma Sam Megan Rating Film Read Show tuple or data for loading file haskell I have to load a database of the format: into Would it better to leave Rating as a tuple or change to...	[ 0.04248046875, -0.00103759765625, -0.003631591796875, 0.01513671875, -0.00958251953125, 0.007568359375, 0.00714111328125, 0.002410888671875, 0.00433349609375, -0.024658203125, 0.0021514892578125, -0.017822265625, -0.013671875, -0.01483154296875, -0.0213623046875, 0.0081787109375, -0....	[ 370, 8705, 707, 2053, 100, 72367, 214, 11435, 1556, 142508, 99726, 140852, 208545, 41231, 4293, 50695, 117277, 19893, 104870, 57501, 51627, 3362, 26842, 19, 66350, 3847, 4764, 17367, 765, 63399, 9384, 3934, 11522, 31358, 237, 15549, 10644, 30...	[ 0.177978515625, 0.2646484375, 0.0821533203125, 0.1949462890625, 0.049713134765625, 0.156005859375, 0.057769775390625, 0.1517333984375, 0.17578125, 0.2442626953125, 0.220947265625, 0.1416015625, 0.1695556640625, 0.07080078125, 0.0865478515625, 0.1334228515625, 0.1285400390625, 0.131...	embed
16864800_c0	16864800	haskell	0	Title: Make haskell where clause whitespace insensitive? Problem title: Make haskell where clause whitespace insensitive? Tags: whitespace, haskell, where-clause Problem: Make haskell where clause whitespace insensitive? I've variously been told you can make Haskell whitespace insensitive with the right use of { ... ; ...	Make haskell where clause whitespace insensitive? Make haskell where clause whitespace insensitive? whitespace haskell where-clause Make Make haskell where clause whitespace insensitive? I've variously been told you can make Haskell whitespace insensitive with the right use of { ... ; ... ;} Thus far I've been able to ...	[ -0.0018463134765625, 0.018798828125, -0.01165771484375, -0.00860595703125, -0.0208740234375, 0.0106201171875, -0.01171875, -0.0162353515625, 0.021728515625, 0.00014495849609375, -0.0021820068359375, 0.015869140625, 0.0047607421875, -0.0147705078125, -0.004058837890625, 0.00656127929687...	[ 26176, 1556, 142508, 7440, 70731, 13, 35011, 65421, 23, 176302, 18347, 4032, 3249, 20625, 7108, 4527, 10666, 153, 2819, 90, 18151, 43240, 366, 184, 18499, 4034 ]	[ 0.069091796875, 0.14453125, 0.2283935546875, 0.1829833984375, 0.18896484375, 0.0931396484375, 0.1595458984375, 0.21875, 0.07440185546875, 0.171875, 0.1195068359375, 0.082275390625, 0.0528564453125, 0.1260986328125, 0.0254364013671875, 0.01556396484375, 0.006256103515625, 0.03048706...	embed
40364831_c0	40364831	haskell	0	Title: list of brackets, Haskell Problem title: list of brackets, Haskell Tags: haskell, list Problem: list of brackets, Haskell The task is describe infinite list (called brackets) of strings Example of such list: ["[]", "[[]]", "[[[]]]", "[[[[]]]]"...] If I'll write take 4 brackets the result should be ["[]","[[]]","...	list of brackets, Haskell list of brackets, Haskell haskell list Haskell Unresolved Binding Outstanding Num Char list of brackets, Haskell The task is describe infinite list (called brackets) of strings Example of such list: ["[]", "[[]]", "[[[]]]", "[[[[]]]]"...] If I'll write take 4 brackets the result should be ["[]...	[ -0.0177001953125, 0.006683349609375, -0.01373291015625, -0.0135498046875, 0.0208740234375, 0.006866455078125, 0.0021209716796875, -0.00567626953125, 0.0087890625, -0.0108642578125, -0.000614166259765625, -0.0517578125, 0.020263671875, -0.00182342529296875, -0.0179443359375, -0.01422119...	[ 5303, 111, 1620, 27853, 20625, 142508, 1556, 992, 107, 86918, 1843, 33770, 13538, 144057, 52782, 21656, 66211, 98363, 54241, 13, 79315, 89536, 6044, 1065, 33022, 5646, 201, 16750, 5608, 4527, 88308, 939, 214, 70, 472, 10869, 29806, 1284, 18...	[ 0.2071533203125, 0.048736572265625, 0.185791015625, 0.227783203125, 0.1103515625, 0.199462890625, 0.09869384765625, 0.0249481201171875, 0.032501220703125, 0.129150390625, 0.0599365234375, 0.0640869140625, 0.01470947265625, 0.0650634765625, 0.1163330078125, 0.1378173828125, 0.18469238...	embed
72474469_c0	72474469	haskell	0	Title: Cabal says tests pass but in fact they fail? Problem title: Cabal says tests pass but in fact they fail? Tags: haskell, cabal Problem: Cabal says tests pass but in fact they fail? When I run the test suite using cabal test , I got the following message: Running 1 test suites... Test suite tests: RUNNING... Test ...	Cabal says tests pass but in fact they fail? Cabal says tests pass but in fact they fail? haskell cabal Cabal Running Test PASS my-lib-tests.log Failed Falsified Cabal says tests pass but in fact they fail? When I run the test suite using cabal test , I got the following message: But when I looked at the log file, the ...	[ 0.037353515625, 0.006134033203125, -0.005401611328125, 0.00640869140625, -0.00396728515625, 0.006591796875, 0.0098876953125, -0.00021457672119140625, -0.0091552734375, 0.03369140625, 0.007171630859375, -0.00244140625, -0.007598876953125, 0.02392578125, 0.003143310546875, -0.00601196289...	[ 30438, 289, 17378, 109921, 27875, 1284, 15824, 35782, 1836, 1556, 142508, 109524, 28398, 8647, 8436, 759, 5612, 6954, 7, 4867, 190355, 22225, 47314, 11675, 3034, 14947, 25632, 26008, 12684, 11435, 10941, 44084, 3229, 123019, 165523 ]	[ 0.1787109375, 0.1688232421875, 0.042572021484375, 0.22216796875, 0.1651611328125, 0.08740234375, 0.1202392578125, 0.2169189453125, 0.0156402587890625, 0.07720947265625, 0.1607666015625, 0.236328125, 0.065673828125, 0.1939697265625, 0.13525390625, 0.031982421875, 0.0960693359375, 0....	embed
8600692_c0	8600692	haskell	0	Title: Datatype promotion for dependently challenged Problem title: Datatype promotion for dependently challenged Tags: types, language-design, haskell, dependent-type Problem: Datatype promotion for dependently challenged After reading through the ghc 7.4. pre-release notes and the Giving Haskell a Promotion paper, I'...	Datatype promotion for dependently challenged Datatype promotion for dependently challenged types language-design haskell dependent-type Datatype Nat List Nil Cons Pair Sum Datatype promotion for dependently challenged After reading through the ghc 7.4. pre-release notes and the Giving Haskell a Promotion paper, I'm st...	[ 0.0089111328125, 0.0196533203125, 0.01104736328125, 0.01263427734375, 0.01214599609375, 0.03125, -0.0106201171875, 0.0079345703125, 0.00010919570922851562, 0.0157470703125, 0.009033203125, -0.0498046875, -0.00848388671875, -0.00811767578125, -0.01123046875, -0.00872802734375, 0.02294...	[ 11809, 50986, 82641, 108750, 66801, 71, 52895, 46876, 34198, 1556, 142508, 68875, 32036, 77175, 39215, 1342, 36335, 538, 31380, 238, 361, 29485, 479, 73048, 5174, 20625, 170369, 15122, 55681, 2367, 20653, 54, 678, 125568, 527, 73265, 23009, 2...	[ 0.126708984375, 0.26220703125, 0.2078857421875, 0.1298828125, 0.1455078125, 0.059967041015625, 0.2235107421875, 0.09820556640625, 0.1461181640625, 0.096435546875, 0.210693359375, 0.0906982421875, 0.109619140625, 0.1124267578125, 0.10595703125, 0.072021484375, 0.128662109375, 0.0042...	embed
30236937_c1	30236937	haskell	1	the hood sf `addToContext` ctx And here's the question: is it possible to make GHCJS auto-generate e.g. var Engine = famous.core.Engine and var Surface = famous.core.Surface imports in the outputted JavaScript whenever an FFI binding gets used that depends on it? Or are my only options to either always use fully quali...	the hood sf `addToContext` ctx And here's the question: is it possible to make GHCJS auto-generate e.g. var Engine = famous.core.Engine and var Surface = famous.core.Surface imports in the outputted JavaScript whenever an FFI binding gets used that depends on it? Or are my only options to either always use fully quali...	[ -0.00092315673828125, -0.000865936279296875, -0.005645751953125, -0.009033203125, -0.01953125, 0.001251220703125, 0.00018310546875, 0.0135498046875, 0.004302978515625, -0.0390625, 0.0030364990234375, -0.007659912109375, 0.004119873046875, 0.024169921875, -0.005035400390625, -0.00072860...	[ 70, 44462, 52253, 11, 4028, 7763, 11935, 22829, 108963, 425, 9655, 83, 7722, 3249, 527, 73265, 64977, 1809, 48281, 67, 285, 90125, 2203, 170277, 30854, 91384, 1212, 136, 179794, 5, 84041, 40404, 24927, 23, 140992, 17925, 217684, 563, 22724,...	[ 0.061279296875, 0.231201171875, 0.187744140625, 0.00299072265625, 0.121337890625, 0.132568359375, 0.08416748046875, 0.2154541015625, 0.0460205078125, 0.119873046875, 0.0146484375, 0.03155517578125, 0.12939453125, 0.056427001953125, 0.1221923828125, 0.175048828125, 0.2139892578125, ...	embed
33246310_c0	33246310	haskell	0	Title: Including extra directories with Keter Problem title: Including extra directories with Keter Tags: yesod, keter, haskell Problem: Including extra directories with Keter I have a Yesod site and have created a handler for handling downloads and enforcing constraints. My Yesod project directory has a subdirectory c...	Including extra directories with Keter Including extra directories with Keter yesod keter haskell Including Keter Including extra directories with Keter I have a Yesod site and have created a handler for handling downloads and enforcing constraints. My Yesod project directory has a subdirectory called downloads , and i...	[ -0.01019287109375, 0.0299072265625, 0.009765625, -0.0010223388671875, -0.011962890625, 0.00167083740234375, -0.03271484375, 0.00811767578125, -0.0029296875, -0.00927734375, -0.015380859375, -0.0054931640625, -0.010986328125, 0.03564453125, 0.00970458984375, 0.00188446044921875, -0.01...	[ 8942, 822, 4173, 14364, 3387, 678, 1345, 720, 6238, 2422, 23722, 311, 1556, 142508, 32635, 2199, 1764, 75935, 35863, 45064, 7026, 2472, 2816, 13452, 53, 1614, 80581, 30675, 35839, 70541, 102158, 3444, 38937, 19048, 73088, 43240, 6782, 34754, ...	[ 0.08203125, 0.1282958984375, 0.187744140625, 0.164306640625, 0.0919189453125, 0.0997314453125, 0.1959228515625, 0.2822265625, 0.00244140625, 0.091796875, 0.1612548828125, 0.1495361328125, 0.10760498046875, 0.201416015625, 0.136474609375, 0.20068359375, 0.0469970703125, 0.0043640136...	embed
3378433_c0	3378433	haskell	0	Title: Haskell: nonobvious examples of functional dependencies Problem title: Haskell: nonobvious examples of functional dependencies Tags: haskell, functional-dependencies Problem: Haskell: nonobvious examples of functional dependencies The examples of functional dependencies I've seen boil down to mapping container -...	Haskell: nonobvious examples of functional dependencies Haskell: nonobvious examples of functional dependencies haskell functional-dependencies Haskell Mult Matrix Vector Haskell: nonobvious examples of functional dependencies The examples of functional dependencies I've seen boil down to mapping container -> element ,...	[ 0.01116943359375, 0.01055908203125, -0.01165771484375, 0.003814697265625, 0.0023193359375, 0.005035400390625, -0.0157470703125, -0.019775390625, -0.003997802734375, 0.000263214111328125, -0.0157470703125, -0.0218505859375, -0.002716064453125, 0.0240478515625, -0.0164794921875, -0.00182...	[ 20625, 142508, 351, 3522, 10023, 27781, 123309, 42548, 117538, 1556, 105254, 13, 81212, 194234, 2609, 18770, 51592, 7565, 291, 26783, 116419, 33079, 12830, 10750, 16750, 11522, 36510, 10644, 32354, 63399, 154453, 1286, 27140, 151618, 959, 3173, ...	[ 0.1234130859375, 0.2374267578125, 0.06494140625, 0.014801025390625, 0.0640869140625, 0.166259765625, 0.208251953125, 0.2056884765625, 0.1153564453125, 0.119384765625, 0.1407470703125, 0.03314208984375, 0.1546630859375, 0.1031494140625, 0.140869140625, 0.09912109375, 0.014892578125, ...	embed
37133345_c0	37133345	haskell	0	Title: Check if tuple list is in increasing consecutive order in Haskell Problem title: Check if tuple list is in increasing consecutive order in Haskell Tags: tuples, haskell, list Problem: Check if tuple list is in increasing consecutive order in Haskell So I have a problem where I need to see if a list of positions ...	Check if tuple list is in increasing consecutive order in Haskell Check if tuple list is in increasing consecutive order in Haskell tuples haskell list Check Haskell is_in_order Position Bool Check if tuple list is in increasing consecutive order in Haskell So I have a problem where I need to see if a list of positions...	[ 0.0015411376953125, -0.0052490234375, -0.00433349609375, 0.0242919921875, 0.00238037109375, 0.02001953125, -0.0081787109375, -0.01324462890625, 0.0093994140625, 0.02490234375, 0.008056640625, 0.01495361328125, 0.0087890625, 0.0002422332763671875, -0.02490234375, 0.007415771484375, -0...	[ 38679, 2174, 370, 8705, 5303, 23, 118055, 148390, 12989, 20625, 142508, 13, 99726, 1556, 83, 73, 80596, 99428, 2460, 929, 2967, 1957, 19069, 3173, 53, 27781, 131148 ]	[ 0.1502685546875, 0.0687255859375, 0.1141357421875, 0.204833984375, 0.1839599609375, 0.0926513671875, 0.189697265625, 0.17333984375, 0.1739501953125, 0.129638671875, 0.2398681640625, 0.03326416015625, 0.172607421875, 0.11767578125, 0.06317138671875, 0.11474609375, 0.1878662109375, 0...	embed
23595173_c0	23595173	haskell	0	Title: "invalid preprocessing directive" when installing memoize Problem title: "invalid preprocessing directive" when installing memoize Tags: memoization, haskell, ghc, cabal Problem: "invalid preprocessing directive" when installing memoize I try running: cabal install memoize in the Terminal but...	"invalid preprocessing directive" when installing memoize "invalid preprocessing directive" when installing memoize memoization haskell ghc cabal Failed memoize-0.6 Error ExitFailure Data Memoize TH.hs:5:6 "invalid preprocessing directive" when installing memoize I try running: in the Terminal but a...	[ 0.00015735626220703125, 0.0015411376953125, 0.00848388671875, 0.00457763671875, -0.004364013671875, 0.01611328125, 0.00665283203125, 0.00897216796875, 0.0028228759765625, -0.00122833251953125, 0.01226806640625, -0.01019287109375, 0.01165771484375, 0.0089111328125, 0.0018463134765625, 0...	[ 7013, 479, 63923, 214, 8951, 5844, 20600, 163, 432, 20650, 47691, 1556, 142508, 31380, 109524, 190355, 122887, 212059, 5443, 217, 17647, 379, 11809, 17443, 31, 12232, 127, 758, 910, 73, 9790, 51042, 124090, 106, 18499 ]	[ 0.1529541015625, 0.1436767578125, 0.14501953125, 0.0601806640625, 0.1187744140625, 0.143310546875, 0.133056640625, 0.1248779296875, 0.135986328125, 0.2003173828125, 0.09130859375, 0.059661865234375, 0.164794921875, 0.03338623046875, 0.159423828125, 0.1268310546875, 0.1795654296875, ...	embed
75712337_c1	75712337	haskell	1	atypeInfo (Code a) Removes type level information, because Code a , being a type level list of lists, no longer has the information about whether a has named record fields or not. Is there something else I can do using generics-sop to retain that information. I quite like generic-sop , in particular not having to deal ...	atypeInfo (Code a) Removes type level information, because Code a , being a type level list of lists, no longer has the information about whether a has named record fields or not. Is there something else I can do using generics-sop to retain that information. I quite like generic-sop , in particular not having to deal ...	[ -0.0002880096435546875, 0.01104736328125, 0.00179290771484375, 0.035400390625, -0.0020599365234375, -0.004638671875, 0.0086669921875, -0.006988525390625, 0.000774383544921875, 0.02001953125, -0.0089111328125, -0.00113677978515625, -0.0203857421875, 0.01226806640625, -0.003082275390625, ...	[ 10, 50986, 93147, 114211, 181139, 10644, 17366, 4677, 28864, 5303, 110, 51713, 1556, 36766, 24, 4806, 17164, 44457, 959, 9844, 37076, 831, 17368, 189534, 7, 9, 2146, 112033, 73, 32233, 1884, 2394, 6635, 1360, 10554, 57877, 162515, 184017, 2...	[ 0.1700439453125, 0.2171630859375, 0.2230224609375, 0.14404296875, 0.1634521484375, 0.216064453125, 0.2027587890625, 0.18896484375, 0.206787109375, 0.1483154296875, 0.011077880859375, 0.0665283203125, 0.01385498046875, 0.0174560546875, 0.082763671875, 0.1376953125, 0.178466796875, 0...	embed
41592717_c0	41592717	haskell	0	Title: how to detect circles of symbolic links in haskell Problem title: how to detect circles of symbolic links in haskell Tags: haskell, filesystems Problem: how to detect circles of symbolic links in haskell i understand that i can find circles in symbolic links with the find . -follow -printf "" command (and other ...	how to detect circles of symbolic links in haskell how to detect circles of symbolic links in haskell haskell filesystems how to detect circles of symbolic links in haskell i understand that i can find circles in symbolic links with the command (and other similar methods on the command line as previously previously sug...	[ 0.002685546875, -0.01708984375, 0.01171875, 0.0380859375, 0.0067138671875, -0.004730224609375, -0.005828857421875, 0.004638671875, -0.0021514892578125, -0.026123046875, -0.0089111328125, 0.0086669921875, 0.005706787109375, 0.0224609375, -0.002685546875, 0.0164794921875, -0.0115966796...	[ 3642, 96391, 130370, 111, 128201, 238, 22317, 23, 1556, 142508, 11435, 16751, 28219, 7413, 75101, 150624, 13315, 53418, 69307, 41018, 12353, 184911, 456, 11627, 30646, 118704, 20880, 18499, 11787, 11508, 6077, 12765, 128405, 42154, 133 ]	[ 0.0139617919921875, 0.2152099609375, 0.22802734375, 0.07305908203125, 0.2154541015625, 0.0908203125, 0.199951171875, 0.07421875, 0.134033203125, 0.2174072265625, 0.0882568359375, 0.13916015625, 0.033966064453125, 0.1373291015625, 0.1702880859375, 0.00555419921875, 0.000091552734375, ...	embed
11094242_c0	11094242	haskell	0	Title: Are Haskell thunks mutable concerning evaluation? Problem title: Are Haskell thunks mutable concerning evaluation? Tags: seq, lazy-evaluation, haskell Problem: Are Haskell thunks mutable concerning evaluation? While looking into parallel programming, and subsequently evaluation strategies, the question whether t...	Are Haskell thunks mutable concerning evaluation? Are Haskell thunks mutable concerning evaluation? seq lazy-evaluation haskell Haskell Thunk Evaluates Are Haskell thunks mutable concerning evaluation? While looking into parallel programming, and subsequently evaluation strategies, the question whether thunks are mutab...	[ -0.0057373046875, 0.0306396484375, 0.0155029296875, 0.0242919921875, 0.014404296875, -0.00927734375, -0.0091552734375, 0.0084228515625, -0.001495361328125, 0.003936767578125, 0.006134033203125, 0.0269775390625, -0.00421142578125, 0.0211181640625, -0.00115203857421875, -0.00503540039062...	[ 15901, 20625, 142508, 4911, 19, 1224, 842, 22819, 50509, 219836, 40, 864, 21, 3285, 159258, 1556, 6003, 3678, 151228, 1636, 95103, 56037, 50531, 621, 27781, 18151, 26265, 151575, 1909, 5775, 31, 68772, 3638, 3173, 34292, 138, 52490, 7464, 5...	[ 0.003692626953125, 0.1136474609375, 0.2275390625, 0.11669921875, 0.1016845703125, 0.17333984375, 0.16015625, 0.1947021484375, 0.01226806640625, 0.1971435546875, 0.09161376953125, 0.14111328125, 0.006378173828125, 0.1060791015625, 0.1463623046875, 0.08447265625, 0.058563232421875, 0...	embed
1150866_c0	1150866	haskell	0	Title: Graphs (Nodes and Edges) Problem title: Graphs (Nodes and Edges) Tags: haskell, graph-theory Problem: Graphs (Nodes and Edges) I am using HASKELL for graph games. I am willing to get a suitable method for reach ability from a node to a particular node in the graph apart from using bfs or trees etc. As I asked fo...	Graphs (Nodes and Edges) Graphs (Nodes and Edges) haskell graph-theory Graphs Nodes Edges Graphs (Nodes and Edges) I am using HASKELL for graph games. I am willing to get a suitable method for reach ability from a node to a particular node in the graph apart from using bfs or trees etc. As I asked for code in haskell f...	[ -0.0068359375, 0.02294921875, -0.003936767578125, 0.004852294921875, -0.01019287109375, -0.0079345703125, -0.013427734375, -0.017822265625, 0.006072998046875, -0.017822265625, -0.001434326171875, -0.044677734375, 0.01129150390625, 0.0155029296875, -0.011474609375, 0.00262451171875, 0...	[ 6524, 11727, 5021, 988, 136, 69030, 7, 1556, 142508, 41382, 2347, 30675, 438, 17368, 11666, 10762, 56051, 100, 27528, 109269, 202319, 55300, 58359, 81273, 1295, 110, 17311, 34955, 876, 17447, 1360, 18151, 23, 1632, 47, 112668, 3525, 16454, ...	[ 0.197021484375, 0.215087890625, 0.1580810546875, 0.1270751953125, 0.0986328125, 0.194091796875, 0.0406494140625, 0.14208984375, 0.2308349609375, 0.24072265625, 0.06610107421875, 0.0238037109375, 0.13916015625, 0.09393310546875, 0.1083984375, 0.1136474609375, 0.1697998046875, 0.0392...	embed
34184201_c0	34184201	haskell	0	Title: Is there a simpler type system with the practical utilities of CoC? Problem title: Is there a simpler type system with the practical utilities of CoC? Tags: haskell, type-systems, functional-programming, types Problem: Is there a simpler type system with the practical utilities of CoC? The Calculus of Constructi...	Is there a simpler type system with the practical utilities of CoC? Is there a simpler type system with the practical utilities of CoC? haskell type-systems functional-programming types CoC Is there a simpler type system with the practical utilities of CoC? The Calculus of Constructions, as presented on the Simpler, Ea...	[ 0.01025390625, 0.0089111328125, -0.0038299560546875, 0.0191650390625, 0.020751953125, -0.031982421875, -0.005615234375, -0.000004500150680541992, -0.0050048828125, -0.01385498046875, -0.00811767578125, 0.00439453125, 0.01177978515625, -0.005828857421875, 0.01275634765625, -0.0106811523...	[ 8781, 42, 10644, 5426, 678, 138155, 19537, 2449, 1311, 441, 2685, 1556, 142508, 16751, 123309, 28966, 52895, 212467, 223, 111, 195769, 60552, 241, 1544, 56, 4552, 831, 11814, 56037, 46876, 756, 4127, 183871, 41206, 175199, 26785, 7432, 98869,...	[ 0.155029296875, 0.1185302734375, 0.2144775390625, 0.16845703125, 0.0640869140625, 0.1964111328125, 0.1346435546875, 0.06671142578125, 0.12451171875, 0.1793212890625, 0.0091552734375, 0.0880126953125, 0.2020263671875, 0.12646484375, 0.0908203125, 0.06689453125, 0.1632080078125, 0.16...	embed
15368658_c0	15368658	haskell	0	Title: What is the equivalent Haskell type for C99 bool when using FFI? Problem title: What is the equivalent Haskell type for C99 bool when using FFI? Tags: c99, ffi, haskell Problem: What is the equivalent Haskell type for C99 bool when using FFI? I have a library which uses C99 bool data type and I would like to cal...	What is the equivalent Haskell type for C99 bool when using FFI? What is the equivalent Haskell type for C99 bool when using FFI? c99 ffi haskell FFI What Haskell C99 What is the equivalent Haskell type for C99 bool when using FFI? I have a library which uses C99 bool data type and I would like to call it via FFI. What...	[ 0.0079345703125, 0.017578125, -0.0009765625, 0.00830078125, 0.006805419921875, 0.007476806640625, 0.0123291015625, -0.00946044921875, 0.002838134765625, 0.0069580078125, -0.01434326171875, -0.0380859375, -0.0024871826171875, 0.00897216796875, 0.00347900390625, 0.01068115234375, -0.00...	[ 183234, 20625, 142508, 10644, 313, 5046, 142484, 563, 22724, 501, 24500, 1556, 4865, 35773, 2053, 11782, 1829, 42518, 184293, 50986, 660, 5922, 110, 43386, 32399, 46002, 30700, 115081, 32354, 41206, 51515, 2811, 1294 ]	[ 0.1402587890625, 0.115234375, 0.2178955078125, 0.1844482421875, 0.08209228515625, 0.291748046875, 0.157470703125, 0.0760498046875, 0.2080078125, 0.041534423828125, 0.175048828125, 0.10406494140625, 0.0338134765625, 0.1361083984375, 0.05157470703125, 0.0160064697265625, 0.015243530273...	embed
39667785_c0	39667785	haskell	0	Title: Different Maybe Types When Inspecting in GHCI Problem title: Different Maybe Types When Inspecting in GHCI Tags: types, polymorphism, haskell, option-type Problem: Different Maybe Types When Inspecting in GHCI I'm new to Haskell and trying to teach myself the ropes, so forgive me if this is a basic question. If ...	Different Maybe Types When Inspecting in GHCI Different Maybe Types When Inspecting in GHCI types polymorphism haskell option-type Different Maybe Types When Inspecting GHCI Just Num Stack Char Different Maybe Types When Inspecting in GHCI I'm new to Haskell and trying to teach myself the ropes, so forgive me if this i...	[ 0.009521484375, -0.00616455078125, 0.0185546875, 0.0093994140625, 0.0027008056640625, 0.0274658203125, 0.01116943359375, -0.01025390625, 0.00250244140625, 0.0213623046875, -0.00421142578125, -0.0498046875, -0.00106048583984375, -0.00897216796875, 0.0057373046875, 0.0084228515625, 0.0...	[ 242520, 83425, 60457, 14847, 360, 16711, 1916, 41877, 17304, 23, 52895, 35874, 178851, 1556, 142508, 35829, 50986, 9563, 52782, 6512, 2594, 21656, 20625, 87850, 90, 96259, 62822, 9803, 1257, 29481, 56, 9486, 318, 15400, 2046, 12921, 237, 3506...	[ 0.1934814453125, 0.31982421875, 0.260009765625, 0.0166778564453125, 0.0750732421875, 0.1932373046875, 0.0255889892578125, 0.147705078125, 0.1756591796875, 0.017120361328125, 0.254150390625, 0.0836181640625, 0.1612548828125, 0.1175537109375, 0.2308349609375, 0.1883544921875, 0.1885986...	embed
4235348_c0	4235348	haskell	0	Title: Converting IO Int to Int Problem title: Converting IO Int to Int Tags: syntax, monads, io, haskell Problem: Converting IO Int to Int I've created a combobox from converting a xmlWidget to a comboBox with the function castTocomboBox and now I want to get the text or the index of the active item. The problem is th...	Converting IO Int to Int Converting IO Int to Int syntax monads io haskell Converting Glade gtk2hs Converting IO Int to Int I've created a combobox from converting a xmlWidget to a comboBox with the function castTocomboBox and now I want to get the text or the index of the active item. The problem is that if I use the ...	[ -0.00872802734375, 0.0025634765625, -0.00433349609375, 0.003387451171875, 0.0125732421875, 0.017333984375, -0.01068115234375, 0.00250244140625, 0.007781982421875, -0.0419921875, 0.0279541015625, -0.04248046875, -0.0137939453125, 0.04736328125, 0.010498046875, -0.0191650390625, 0.0001...	[ 1657, 814, 1916, 17780, 360, 18, 47, 6002, 86531, 2667, 712, 22995, 1556, 142508, 90040, 13, 31472, 304, 127, 75935, 375, 837, 11728, 1295, 96760, 131492, 1456, 532, 3794, 72295, 32354, 37702, 7763, 277, 3444, 2046, 7986, 707, 63262, 3645...	[ 0.036590576171875, 0.126953125, 0.0643310546875, 0.253173828125, 0.1990966796875, 0.2054443359375, 0.1146240234375, 0.0257568359375, 0.042572021484375, 0.10614013671875, 0.1651611328125, 0.172119140625, 0.048583984375, 0.1712646484375, 0.15771484375, 0.1497802734375, 0.1312255859375,...	embed
49086884_c0	49086884	haskell	0	Title: Generate all changes of signs Problem title: Generate all changes of signs Tags: combinations, haskell, transform Problem: Generate all changes of signs I have many lists. Say for short [[1,2],[3,4]] . I need to generate all changes of signs of each element. Thus, for the short example, the result would be [[1,2...	Generate all changes of signs Generate all changes of signs combinations haskell transform Generate Generate all changes of signs I have many lists. Say for short [[1,2],[3,4]] . I need to generate all changes of signs of each element. Thus, for the short example, the result would be Is there a package to perform such ...	[ -0.009765625, 0.0125732421875, -0.027587890625, -0.002655029296875, 0.0025482177734375, 0.004486083984375, -0.000705718994140625, -0.00004744529724121094, 0.0017242431640625, 0.01214599609375, -0.01239013671875, -0.0032958984375, 0.0220947265625, 0.03173828125, -0.009765625, 0.01135253...	[ 155370, 67, 756, 65572, 111, 24092, 7, 162515, 1556, 142508, 27198, 765, 5941, 5303, 16610, 133063, 82449, 3871, 47, 139392, 12638, 12830, 27781, 16750, 98169, 51339, 6044, 41018, 234873, 4527, 17569, 5915, 4358, 5701, 140909, 42079, 117434, ...	[ 0.211669921875, 0.0838623046875, 0.1773681640625, 0.25390625, 0.1064453125, 0.2374267578125, 0.10528564453125, 0.1937255859375, 0.144287109375, 0.2257080078125, 0.25, 0.033905029296875, 0.0885009765625, 0.198486328125, 0.121337890625, 0.07122802734375, 0.1358642578125, 0.0645751953...	embed
10049377_c1	10049377	haskell	1	a different parameter meow , then GHC produces code that invokes numerators a million times, each with an identical implicit parameters necklaces . It's nevertheless obvious that numerators only needs to be invoked once though, the first time ?necklaces gets assigned, meaning GHC could potentially notice this optimiza...	a different parameter meow , then GHC produces code that invokes numerators a million times, each with an identical implicit parameters necklaces . It's nevertheless obvious that numerators only needs to be invoked once though, the first time ?necklaces gets assigned, meaning GHC could potentially notice this optimiza...	[ -0.03515625, 0.007110595703125, -0.0078125, -0.0036773681640625, 0.0038909912109375, 0.03466796875, -0.023681640625, -0.0130615234375, 0.004150390625, -0.028564453125, -0.01080322265625, -0.01806640625, -0.0072021484375, 0.00897216796875, 0.00616455078125, -0.020263671875, -0.0234375...	[ 12921, 171859, 163, 8770, 527, 73265, 27489, 18151, 23, 23253, 90, 100762, 22230, 10, 19879, 20028, 12638, 31943, 165164, 4272, 4704, 5170, 162520, 4734, 27117, 24145, 21208, 5117, 1733, 705, 21986, 95486, 5809, 38516, 60322, 903, 87235, 1363...	[ 0.1634521484375, 0.273193359375, 0.1480712890625, 0.25146484375, 0.11474609375, 0.2275390625, 0.10137939453125, 0.19287109375, 0.03643798828125, 0.1680908203125, 0.006866455078125, 0.26220703125, 0.2030029296875, 0.011566162109375, 0.149658203125, 0.158203125, 0.0161590576171875, 0...	embed
14838480_c0	14838480	haskell	0	Title: Finding the max of a list using tail recursion Problem title: Finding the max of a list using tail recursion Tags: haskell Problem: Finding the max of a list using tail recursion I am trying to understand how to write functions using tail recursion in Haskell. In my example below, the function takes in a list an...	Finding the max of a list using tail recursion Finding the max of a list using tail recursion haskell tail Finding x:xs Finding the max of a list using tail recursion I am trying to understand how to write functions using tail recursion in Haskell. In my example below, the function takes in a list and outputs the maxim...	[ 0.00830078125, 0.0147705078125, 0.03125, 0.00848388671875, 0.01446533203125, 0.0247802734375, 0.005767822265625, -0.005615234375, 0.017822265625, -0.0286865234375, 0.003936767578125, -0.0299072265625, 0.014892578125, -0.0079345703125, 0.030029296875, -0.00592041015625, -0.01684570312...	[ 26040, 18389, 111, 5303, 17368, 46741, 195625, 1830, 70, 1556, 142508, 1022, 12, 425, 28219, 33022, 32354, 20625, 27781, 35064, 51776, 23, 140992, 38132, 34292, 91177, 4527, 501, 77336, 4343, 43581, 73342, 4488, 110527 ]	[ 0.1148681640625, 0.23388671875, 0.0640869140625, 0.1873779296875, 0.059173583984375, 0.246826171875, 0.2091064453125, 0.0877685546875, 0.036224365234375, 0.1199951171875, 0.2039794921875, 0.0677490234375, 0.0213165283203125, 0.07659912109375, 0.010009765625, 0.0570068359375, 0.144775...	embed
22822926_c0	22822926	haskell	0	Title: What is the point of using Monad in a program? Problem title: What is the point of using Monad in a program? Tags: haskell Problem: What is the point of using Monad in a program? Say i'm creating an image processing library with Haskell. I've defined a few of my own data types. When should i declare some of my d...	What is the point of using Monad in a program? What is the point of using Monad in a program? haskell Monad What What is the point of using Monad in a program? Say i'm creating an image processing library with Haskell. I've defined a few of my own data types. When should i declare some of my data types to be Monad(or f...	[ -0.00066375732421875, 0.00390625, 0.0033721923828125, 0.013427734375, 0.000591278076171875, 0.01068115234375, 0.007080078125, 0.003448486328125, -0.01177978515625, -0.01055908203125, -0.0081787109375, -0.053955078125, -0.01007080078125, -0.00787353515625, -0.019287109375, -0.0152587890...	[ 4865, 6275, 111, 17368, 60331, 71, 23, 1528, 1556, 142508, 83, 70, 105233, 29569, 9433, 35773, 678, 20625, 272, 61924, 10846, 10002, 2053, 52895, 14847, 5608, 159978, 186, 7477, 18770, 41816, 68073, 28219, 831, 192, 48398, 645, 110527, 1364...	[ 0.0364990234375, 0.158935546875, 0.00726318359375, 0.1466064453125, 0.251953125, 0.23681640625, 0.06024169921875, 0.1724853515625, 0.1129150390625, 0.2333984375, 0.00677490234375, 0.0191802978515625, 0.06134033203125, 0.1094970703125, 0.05682373046875, 0.116455078125, 0.0474853515625...	embed
39259502_c0	39259502	haskell	0	Title: Printing very big numbers Problem title: Printing very big numbers Tags: haskell Problem: Printing very big numbers I begin to learn Haskell and I don't understand what happens : I have a very simple code : import System.IO import Control.Monad fact n = product [1..n] main :: IO () main = do input_line <- getLin...	Printing very big numbers Printing very big numbers haskell System.IO Control.Monad Printing input_line Main fact.hs Compiling Printing very big numbers I begin to learn Haskell and I don't understand what happens : I have a very simple code : In ghci, when I try but What am I missing ? Thank you for any explanation.	[ -0.00677490234375, 0.0096435546875, 0.00640869140625, 0.0169677734375, 0.002899169921875, 0.0019989013671875, 0.0191650390625, -0.004638671875, -0.0035858154296875, -0.0279541015625, 0.00115203857421875, -0.024658203125, -0.01123046875, -0.01336669921875, -0.00701904296875, -0.00260925...	[ 39754, 214, 4552, 6957, 101935, 1556, 142508, 12353, 17780, 27131, 46674, 712, 107730, 2256, 12321, 15824, 5, 127, 7, 15612, 49725, 9842, 30698, 20625, 2301, 18, 28219, 96276, 765, 8781, 18151, 360, 31380, 318, 3229, 9790, 1284, 4865, 444, ...	[ 0.1983642578125, 0.07293701171875, 0.1473388671875, 0.138671875, 0.1912841796875, 0.146240234375, 0.2449951171875, 0.07098388671875, 0.15576171875, 0.1348876953125, 0.0755615234375, 0.1138916015625, 0.1094970703125, 0.125, 0.09521484375, 0.18798828125, 0.002349853515625, 0.12719726...	embed
27002489_c0	27002489	haskell	0	Title: Use Yesod widgets to build HTML pages Problem title: Use Yesod widgets to build HTML pages Tags: haskell, yesod Problem: Use Yesod widgets to build HTML pages I am working on a static blog generator as a side project, and I'd like to use Yesod's widgets as the templating engine. My question boils down to whether...	Use Yesod widgets to build HTML pages Use Yesod widgets to build HTML pages haskell yesod Text.Blaze.Html.Renderer.String Yesod Use HTML Hello World Use Yesod widgets to build HTML pages I am working on a static blog generator as a side project, and I'd like to use Yesod's widgets as the templating engine. My question ...	[ 0.001190185546875, 0.01904296875, 0.0201416015625, -0.00439453125, -0.017578125, 0.0185546875, -0.01409912109375, -0.022216796875, -0.005950927734375, -0.048583984375, -0.0087890625, -0.041748046875, -0.0169677734375, -0.0184326171875, 0.0040283203125, -0.0133056640625, 0.00494384765...	[ 36836, 32635, 2199, 148631, 7, 47, 45367, 19097, 37967, 1556, 142508, 2422, 23722, 24129, 94901, 841, 18, 7237, 23894, 56, 71713, 35378, 6661, 20697, 201939, 1415, 145823, 5609, 13452, 1884, 4527, 237, 127446, 26518, 87907, 36766, 7722, 83, ...	[ 0.0833740234375, 0.17822265625, 0.2548828125, 0.27734375, 0.10211181640625, 0.041656494140625, 0.1580810546875, 0.2457275390625, 0.1494140625, 0.1015625, 0.1929931640625, 0.12548828125, 0.1947021484375, 0.1207275390625, 0.169189453125, 0.032958984375, 0.0941162109375, 0.1064453125,...	embed
42004616_c0	42004616	haskell	0	Title: Haskell function which acts differently depending on the monad type Problem title: Haskell function which acts differently depending on the monad type Tags: alternative-functor, monads, monadplus, haskell Problem: Haskell function which acts differently depending on the monad type I'm trying to implement a funct...	Haskell function which acts differently depending on the monad type Haskell function which acts differently depending on the monad type alternative-functor monads monadplus haskell Haskell MonadPlus s:sx Maybe Just Haskell function which acts differently depending on the monad type I'm trying to implement a function wh...	[ 0.0004634857177734375, 0.006927490234375, -0.0003910064697265625, 0.01043701171875, 0.02001953125, 0.0009002685546875, -0.003509521484375, 0.0002460479736328125, -0.00099945068359375, -0.03759765625, 0.01220703125, -0.0023651123046875, -0.00885009765625, -0.0003337860107421875, 0.0099487...	[ 20625, 142508, 32354, 3129, 27992, 12921, 538, 96819, 2667, 712, 10644, 30700, 16498, 18770, 32108, 1556, 60331, 71, 88225, 91, 12, 425, 8, 98, 31577, 29479, 56104, 3884, 5117, 12830, 5303, 2174, 83, 30646, 28271, 151117, 9563, 106, 5608, ...	[ 0.1343994140625, 0.26708984375, 0.17578125, 0.029327392578125, 0.1328125, 0.1717529296875, 0.049896240234375, 0.11572265625, 0.1231689453125, 0.1759033203125, 0.1568603515625, 0.1356201171875, 0.07879638671875, 0.05389404296875, 0.146728515625, 0.1246337890625, 0.1337890625, 0.0422...	embed
48808945_c0	48808945	haskell	0	Title: GHC Haskell duplicate symbols for architecture x86_64 Problem title: GHC Haskell duplicate symbols for architecture x86_64 Tags: ghc, haskell Problem: GHC Haskell duplicate symbols for architecture x86_64 If I follow an example in Real World Haskell (JSON example) and I first omit the mistake of the brackets in ...	GHC Haskell duplicate symbols for architecture x86_64 GHC Haskell duplicate symbols for architecture x86_64 ghc haskell GHC Haskell x86_64 GHC Haskell duplicate symbols for architecture x86_64 If I follow an example in Real World Haskell (JSON example) and I first omit the mistake of the brackets in the module, when I ...	[ -0.007415771484375, 0.005584716796875, -0.01300048828125, -0.0038604736328125, -0.0052490234375, -0.00225830078125, -0.005584716796875, 0.0034027099609375, -0.01495361328125, -0.0303955078125, -0.020751953125, -0.02783203125, 0.0289306640625, 0.000522613525390625, 0.0034637451171875, 0...	[ 527, 73265, 20625, 142508, 171763, 67, 26582, 159958, 15276, 13307, 31380, 238, 1556, 28960, 27781, 5120, 6661, 1375, 58627, 5117, 171, 217, 121742, 1620, 27853, 88996, 3229, 9969, 1340, 7464, 225, 25632, 18499, 6528, 103608, 2967, 12956 ]	[ 0.0806884765625, 0.196044921875, 0.15234375, 0.2242431640625, 0.197021484375, 0.03765869140625, 0.18701171875, 0.1158447265625, 0.186767578125, 0.142822265625, 0.083251953125, 0.057647705078125, 0.0615234375, 0.0860595703125, 0.1162109375, 0.1143798828125, 0.1114501953125, 0.114624...	embed
37037446_c0	37037446	haskell	0	Title: Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? Problem title: Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? Tags: haskell Problem: Can someone show me how to populate a list of lists in haskell from a textfile or a csv...	Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? haskell a Can Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? I am new to haskell and ...	[ 0.00885009765625, -0.00164794921875, 0.0179443359375, 0.01104736328125, -0.005615234375, 0.007171630859375, 0.01007080078125, 0.01220703125, -0.0064697265625, -0.005950927734375, -0.025146484375, -0.043212890625, 0.0016937255859375, -0.0103759765625, -0.0250244140625, -0.00326538085937...	[ 4171, 22008, 7639, 163, 3642, 47, 27623, 67, 5303, 111, 7, 23, 1556, 142508, 1295, 7986, 29822, 20763, 334, 11435, 707, 10, 3525, 51339, 50944, 425, 127664, 3444, 136, 70541, 22936, 124962, 44237, 124519, 17721, 15555, 186, 133063, 96386, ...	[ 0.0540771484375, 0.03271484375, 0.108642578125, 0.0406494140625, 0.0723876953125, 0.01177978515625, 0.19580078125, 0.0662841796875, 0.258056640625, 0.08544921875, 0.07281494140625, 0.059417724609375, 0.1588134765625, 0.239990234375, 0.115966796875, 0.1500244140625, 0.2119140625, 0....	embed
38915534_c3	38915534	haskell	3	0.14.2, gtk-0.13.9, gtk-0.13.8.1, gtk-0.13.8, gtk-0.13.7, gtk-0.13.6, gtk-0.13.4, gtk-0.13.3, gtk-0.13.2, gtk-0.13.1, gtk-0.13.0.3, gtk-0.13.0.2, gtk-0.13.0.1, gtk-0.13.0.0, gtk-0.12.5.7, gtk-0.12.5.6, gtk-0.12.5.5, gtk-0.12.5.4, gtk-0.12.5.3, gtk-0.12.5.2, gtk-0.12.5.1, gtk-0.12.5.0, gtk-0.12.4, gtk-0.12.3.1, gtk-0.12...	0.14.2, gtk-0.13.9, gtk-0.13.8.1, gtk-0.13.8, gtk-0.13.7, gtk-0.13.6, gtk-0.13.4, gtk-0.13.3, gtk-0.13.2, gtk-0.13.1, gtk-0.13.0.3, gtk-0.13.0.2, gtk-0.13.0.1, gtk-0.13.0.0, gtk-0.12.5.7, gtk-0.12.5.6, gtk-0.12.5.5, gtk-0.12.5.4, gtk-0.12.5.3, gtk-0.12.5.2, gtk-0.12.5.1, gtk-0.12.5.0, gtk-0.12.4, gtk-0.12.3.1, gtk-0.12...	[ -0.014892578125, 0.0289306640625, 0.0038909912109375, -0.004058837890625, 0.0311279296875, -0.015380859375, -0.0189208984375, -0.000736236572265625, 0.0030975341796875, 0.041259765625, -0.004058837890625, -0.06396484375, -0.027587890625, -0.0103759765625, -0.00372314453125, 0.003860473...	[ 107754, 117904, 4, 706, 31472, 9, 102014, 156611, 23320, 5, 2681, 206730, 135527, 109981, 102738, 172508, 134693, 107033, 97109, 170179, 133684, 99929, 15654, 160355, 124525, 148462, 48413, 617, 363, 158296, 156627, 187461, 116591, 120883, 70147, ...	[ 0.2210693359375, 0.258544921875, 0.133056640625, 0.1556396484375, 0.267822265625, 0.1016845703125, 0.1943359375, 0.256591796875, 0.1492919921875, 0.0909423828125, 0.2325439453125, 0.18701171875, 0.1981201171875, 0.171630859375, 0.1839599609375, 0.2109375, 0.1912841796875, 0.1978759...	embed
27219660_c0	27219660	haskell	0	Title: Open Type Level Proofs in Haskell/Idris Problem title: Open Type Level Proofs in Haskell/Idris Tags: proof, category-theory, correctness, haskell, idris Problem: Open Type Level Proofs in Haskell/Idris In Idris/Haskell, one can prove properties of data by annotating the types and using GADT constructors, such as...	Open Type Level Proofs in Haskell/Idris Open Type Level Proofs in Haskell/Idris proof category-theory correctness haskell idris Open Type Level Proofs Haskell Idris Open Type Level Proofs in Haskell/Idris In Idris/Haskell, one can prove properties of data by annotating the types and using GADT constructors, such as wit...	[ 0.020263671875, -0.009033203125, -0.0015869140625, 0.0047607421875, 0.0111083984375, -0.01031494140625, -0.017333984375, -0.0027008056640625, -0.01025390625, -0.042236328125, -0.0133056640625, -0.01275634765625, 0.003082275390625, -0.012939453125, -0.004852294921875, 0.0272216796875, ...	[ 13527, 60457, 84136, 1250, 4390, 20625, 142508, 64, 568, 14152, 7, 23, 98869, 95487, 2347, 30675, 26785, 1556, 3679, 181545, 6495, 831, 23534, 183871, 2053, 8668, 52895, 23749, 41072, 64549, 678, 52884, 18, 144570, 7941, 587, 57266, 10644, ...	[ 0.182861328125, 0.2425537109375, 0.1856689453125, 0.1146240234375, 0.130859375, 0.1138916015625, 0.2052001953125, 0.0247955322265625, 0.0238494873046875, 0.1175537109375, 0.04974365234375, 0.014007568359375, 0.130126953125, 0.1278076171875, 0.043426513671875, 0.003509521484375, 0.078...	embed
46873964_c0	46873964	haskell	0	Title: 20 intermediate haskell exercise - Exercise 9 Problem title: 20 intermediate haskell exercise - Exercise 9 Tags: haskell Problem: 20 intermediate haskell exercise - Exercise 9 I was working on 20 intermediate haskell exercise. And Exercise 9 is: class Misty m where banana :: (a -> m b) -> m a -> m b unicorn :: a...	20 intermediate haskell exercise - Exercise 9 20 intermediate haskell exercise - Exercise 9 haskell Exercise Misty 20 intermediate haskell exercise - Exercise 9 I was working on 20 intermediate haskell exercise. And Exercise 9 is: And the solution offered here is If I replace m with ((->) t) in banana's type signature,...	[ 0.017578125, 0.0040283203125, 0.00628662109375, 0.007720947265625, 0.016357421875, 0.0267333984375, 0.004364013671875, 0.0120849609375, 0.0218505859375, 0.000507354736328125, -0.0216064453125, -0.0089111328125, 0.01507568359375, 0.00555419921875, -0.0155029296875, 0.0069580078125, 0....	[ 387, 81814, 1556, 142508, 81979, 155534, 483, 2182, 7950, 939, 20697, 184, 70, 29806, 122399, 91995, 347, 678, 103607, 808, 16, 134399, 10644, 138256, 1650, 37202, 128239, 32354, 100, 60494, 15400, 27117, 17262, 10750, 35166, 83, 425, 3650, ...	[ 0.14306640625, 0.107666015625, 0.10986328125, 0.1800537109375, 0.1431884765625, 0.119873046875, 0.1934814453125, 0.0103759765625, 0.0692138671875, 0.1243896484375, 0.0160064697265625, 0.00457763671875, 0.0511474609375, 0.1131591796875, 0.0207977294921875, 0.1580810546875, 0.172241210...	embed
60764963_c1	60764963	haskell	1	>>= (`shouldBe` val) it "should throw error if it gets a Nothing" $ do (run extract $ do I.mustEvalExpr badExpr ) `shouldThrow` anyException Question Is this the best I can do? I feel like run extract $ do is fine, and I think it's good to be explicit when things are complicated. But I was wondering if there was a way...	>>= (`shouldBe` val) it "should throw error if it gets a Nothing" $ do (run extract $ do I.mustEvalExpr badExpr ) `shouldThrow` anyException Question Is this the best I can do? I feel like run extract $ do is fine, and I think it's good to be explicit when things are complicated. But I was wondering if there was a way...	[ -0.00872802734375, 0, 0.0167236328125, -0.021484375, 0.0167236328125, 0.02392578125, 0.009765625, -0.021240234375, 0.00836181640625, -0.03857421875, -0.004608154296875, -0.004486083984375, -0.01312255859375, 0.006683349609375, 0.01214599609375, 0.00811767578125, 0.00531005859375, 0...	[ 6396, 1369, 11412, 52366, 6766, 3502, 442, 104250, 18499, 2174, 62163, 10, 182747, 3650, 54, 16428, 125663, 2647, 18, 647, 1405, 19279, 10287, 6494, 20800, 15555, 2499, 63928, 903, 70, 2965, 831, 12319, 11675, 5885, 4127, 143726, 621, 96704...	[ 0.07501220703125, 0.146484375, 0.124267578125, 0.1873779296875, 0.2054443359375, 0.233154296875, 0.049407958984375, 0.1768798828125, 0.23193359375, 0.08447265625, 0.108642578125, 0.000579833984375, 0.22509765625, 0.1829833984375, 0.138916015625, 0.147705078125, 0.273681640625, 0.07...	embed
34134058_c0	34134058	haskell	0	Title: Syntax in Haskell/Elm Problem title: Syntax in Haskell/Elm Tags: elm, haskell Problem: Syntax in Haskell/Elm Can't find anything about this syntax in Haskel/Elm: bar day yOffset = rect [ x <\| toString <\| (day.xOffset * (barWidth + barMargin)), y <\| toString <\| if day.amount <= 0 then yOffset else yOffset - day.a...	Syntax in Haskell/Elm Syntax in Haskell/Elm elm haskell Syntax Haskell Elm day.xOffset day.amount Svg.title day.day List.map x.words List.minimum Maybe.withDefault Syntax in Haskell/Elm Can't find anything about this syntax in Haskel/Elm: What does mean <\| and \|> ?	[ 0.01422119140625, 0.005584716796875, 0.0035247802734375, 0.010498046875, -0.011474609375, 0.01446533203125, -0.007171630859375, 0.014404296875, 0.000804901123046875, -0.00457763671875, -0.0069580078125, 0.01123046875, -0.0069580078125, -0.003662109375, -0.00093841552734375, -0.03784179...	[ 19010, 86531, 20625, 142508, 64, 7623, 39, 23, 88, 1556, 540, 5155, 425, 150369, 3509, 121147, 33214, 177, 5440, 5636, 32036, 62346, 47416, 9222, 24105, 83425, 76228, 187423, 11, 7136, 903, 6002, 2590, 4865, 14602, 29459, 58745, 136, 2740 ]	[ 0.1451416015625, 0.1910400390625, 0.1143798828125, 0.228271484375, 0.04595947265625, 0.158935546875, 0.1663818359375, 0.02569580078125, 0.11279296875, 0.10076904296875, 0.153564453125, 0.138671875, 0.037750244140625, 0.1246337890625, 0.1297607421875, 0.1512451171875, 0.05670166015625...	embed
55348906_c0	55348906	haskell	0	Title: How would I find the distance between two elements in a list? Problem title: How would I find the distance between two elements in a list? Tags: haskell Problem: How would I find the distance between two elements in a list? I have to find the distance between first appearance of two elements in a list. The progr...	How would I find the distance between two elements in a list? How would I find the distance between two elements in a list? haskell How Maybe Just Nothing How would I find the distance between two elements in a list? I have to find the distance between first appearance of two elements in a list. The program we are usin...	[ 0.01153564453125, 0.01361083984375, 0.0028533935546875, 0.0005645751953125, 0.004425048828125, 0.04345703125, 0.018310546875, 0.0225830078125, 0.00970458984375, 0.0084228515625, 0.006072998046875, -0.023193359375, -0.01153564453125, 0.00159454345703125, -0.00836181640625, 0.001953125, ...	[ 11249, 2806, 87, 7413, 70, 62488, 17721, 6626, 80854, 23, 5303, 1556, 142508, 83425, 9563, 182747, 10, 765, 5117, 170894, 1528, 17368, 20625, 1118, 21997, 112045, 4358, 4034, 48225, 86869, 30607, 3642, 13204, 449, 442, 43599, 1984, 864, 330...	[ 0.08160400390625, 0.09954833984375, 0.042327880859375, 0.166748046875, 0.1318359375, 0.291748046875, 0.1953125, 0.1573486328125, 0.202392578125, 0.072998046875, 0.229248046875, 0.1224365234375, 0.243896484375, 0.1903076171875, 0.09051513671875, 0.201904296875, 0.08782958984375, 0.0...	embed
63042751_c5	63042751	haskell	5	638xm37wl94la8dxlbjaq-zlib-1.2.11-dev, in9vak3zphkx9c635iz639iabgrib2fl-postgresql-11.8, qsarmp3rsyvhb7m22xl0fdpsnaf3lv6b-pcre-8.44-dev, pkg-config-wrapper-0.29.2, v1v3flnwxs3n5lhfrfrs16rcygjzzhmy-zookeeper-3.4.13, grng8b5wmrppx2rmcsqkmjyq23bj1j38-zookeeper_mt-3.4.13, qqra09ff0q8vwqicjs20fn1rvn00k6fy-ghc-8.8.3, pj43dfd...	638xm37wl94la8dxlbjaq-zlib-1.2.11-dev, in9vak3zphkx9c635iz639iabgrib2fl-postgresql-11.8, qsarmp3rsyvhb7m22xl0fdpsnaf3lv6b-pcre-8.44-dev, pkg-config-wrapper-0.29.2, v1v3flnwxs3n5lhfrfrs16rcygjzzhmy-zookeeper-3.4.13, grng8b5wmrppx2rmcsqkmjyq23bj1j38-zookeeper_mt-3.4.13, qqra09ff0q8vwqicjs20fn1rvn00k6fy-ghc-8.8.3, pj43dfd...	[ -0.007568359375, -0.0079345703125, -0.0027313232421875, 0.01055908203125, -0.000919342041015625, 0.00433349609375, -0.0211181640625, -0.020751953125, -0.006561279296875, 0.014892578125, 0.0164794921875, -0.010986328125, 0.0024261474609375, -0.000537872314453125, -0.00909423828125, 0.02...	[ 6, 190076, 10945, 27751, 14889, 864, 9, 169, 5612, 48400, 5, 1662, 18548, 4, 1126, 30987, 166000, 163709, 11049, 15991, 4594, 17562, 99247, 5759, 119044, 7612, 163883, 35748, 8517, 153837, 5429, 11, 8079, 133684, 151309, 2485, 1176, 1158, 3...	[ 0.0599365234375, 0.18896484375, 0.0693359375, 0.034912109375, 0.08837890625, 0.0606689453125, 0.0684814453125, 0.09417724609375, 0.28955078125, 0.2083740234375, 0.09893798828125, 0.1964111328125, 0.233154296875, 0.08056640625, 0.0203094482421875, 0.07763671875, 0.031951904296875, 0...	embed
11178572_c0	11178572	haskell	0	Title: Deriving PathInfo class in web routes? Problem title: Deriving PathInfo class in web routes? Tags: happstack, haskell Problem: Deriving PathInfo class in web routes? I am reading the web-routes tutorial in Happstack, and I have no idea what this is doing: $(derivePathInfo ''Sitemap) class PathInfo a where toPath...	Deriving PathInfo class in web routes? Deriving PathInfo class in web routes? happstack haskell Deriving PathInfo Sitemap URLParser Deriving PathInfo class in web routes? I am reading the web-routes tutorial in Happstack, and I have no idea what this is doing: The doc simply says: but where does it "store" it? I though...	[ 0.025390625, 0.0186767578125, 0, 0.01373291015625, -0.0048828125, 0.0081787109375, -0.00439453125, -0.01104736328125, 0.0031280517578125, -0.04296875, -0.01263427734375, -0.021728515625, -0.00872802734375, 0.003509521484375, -0.0218505859375, 0.017822265625, -0.0016937255859375, 0....	[ 1310, 14, 6496, 108421, 93147, 18507, 23, 1467, 36439, 7, 32, 256, 6366, 590, 2594, 1556, 142508, 200033, 31862, 28636, 2189, 16454, 133261, 57143, 208612, 110, 6528, 2367, 903, 20594, 51584, 42856, 17378, 1284, 7440, 14602, 442, 45804, 175...	[ 0.1160888671875, 0.1080322265625, 0.1142578125, 0.2354736328125, 0.320068359375, 0.2186279296875, 0.07659912109375, 0.1484375, 0.2010498046875, 0.0855712890625, 0.007598876953125, 0.0997314453125, 0.1085205078125, 0.1265869140625, 0.1474609375, 0.150390625, 0.2442626953125, 0.25048...	embed
20509739_c0	20509739	haskell	0	Title: Record syntax for QuasiQuoter constructor Problem title: Record syntax for QuasiQuoter constructor Tags: haskell, template-haskell Problem: Record syntax for QuasiQuoter constructor The documentation for template Haskell says that QuasiQuoter is defined as data QuasiQuoter = QuasiQuoter { quoteExp :: String -> Q...	Record syntax for QuasiQuoter constructor Record syntax for QuasiQuoter constructor haskell template-haskell Record QuasiQuoter Exp Pat Type Dec Record syntax for QuasiQuoter constructor The documentation for template Haskell says that QuasiQuoter is defined as I have encountered examples such as silly shown below. How...	[ -0.01239013671875, 0.003662109375, -0.0017852783203125, -0.00139617919921875, -0.004852294921875, 0.00119781494140625, 0.0002288818359375, 0.001922607421875, 0.00506591796875, 0.006591796875, 0.007354736328125, -0.0235595703125, 0.0194091796875, -0.01324462890625, -0.0084228515625, -0....	[ 54877, 6002, 86531, 19559, 172, 31583, 31, 720, 64549, 748, 1556, 142508, 110934, 10557, 60075, 9876, 60457, 25755, 209806, 20625, 61924, 190647, 27781, 78, 12097, 127887, 35064, 4488, 18, 26292, 23, 66747, 683, 257, 196707, 120152, 44457 ]	[ 0.2113037109375, 0.1251220703125, 0.15478515625, 0.1495361328125, 0.126708984375, 0.1558837890625, 0.094970703125, 0.1875, 0.1610107421875, 0.053009033203125, 0.0770263671875, 0.193603515625, 0.173583984375, 0.0609130859375, 0.11572265625, 0.119140625, 0.1351318359375, 0.1580810546...	embed
20669295_c0	20669295	haskell	0	Title: Haskell - sum a list of lists using foldr/foldl Problem title: Haskell - sum a list of lists using foldr/foldl Tags: haskell, list Problem: Haskell - sum a list of lists using foldr/foldl I'm trying to write functions to sum a list of lists (type Integer ). I have already done it using map : summat :: [[Integer]...	Haskell - sum a list of lists using foldr/foldl Haskell - sum a list of lists using foldr/foldl haskell list foldr/foldl Haskell Integer x:xs summat2 Haskell - sum a list of lists using foldr/foldl I'm trying to write functions to sum a list of lists (type Integer ). I have already done it using map : but can't figure ...	[ -0.0020751953125, -0.01080322265625, -0.00167083740234375, -0.0078125, -0.021484375, 0.006622314453125, -0.0101318359375, 0.01239013671875, 0.00775146484375, -0.04052734375, 0.0016937255859375, -0.048095703125, 0.006805419921875, -0.006195068359375, -0.0126953125, -0.0166015625, -0.0...	[ 20625, 142508, 10554, 5303, 111, 7, 17368, 18344, 7569, 64, 42822, 141, 10, 1556, 44401, 1022, 425, 29334, 18, 304, 31577, 33022, 32354, 50986, 16940, 22288, 831, 26366, 4488, 248, 20469, 37842, 1884, 27489, 5941, 18499, 5122, 158, 4460 ]	[ 0.12255859375, 0.238037109375, 0.2357177734375, 0.2236328125, 0.0946044921875, 0.06695556640625, 0.086669921875, 0.1517333984375, 0.2255859375, 0.047515869140625, 0.166259765625, 0.1695556640625, 0.0235595703125, 0.1224365234375, 0.1710205078125, 0.0469970703125, 0.048675537109375, ...	embed
74697521_c1	74697521	haskell	1	data Exp = Let String Exp Exp \| Expl Expl deriving Show data Expl = Plus Expl Term \| Minus Expl Term \| Term Term deriving Show ... data Token = TokenInt Int \| TokenFloat Float \| TokenNum Float \| TokenPlus ... lexer (c:cs) \| isSpace c = lexer cs \| isDigit c = lexNum (c:cs) lexer ('=':cs) = TokenEq : lexer cs ... lexNum...	data Exp = Let String Exp Exp \| Expl Expl deriving Show data Expl = Plus Expl Term \| Minus Expl Term \| Term Term deriving Show ... data Token = TokenInt Int \| TokenFloat Float \| TokenNum Float \| TokenPlus ... lexer (c:cs) \| isSpace c = lexer cs \| isDigit c = lexNum (c:cs) lexer ('=':cs) = TokenEq : lexer cs ... lexNum...	[ 0.01007080078125, 0.004058837890625, -0.01513671875, 0.028564453125, 0.009521484375, 0.003204345703125, 0.0302734375, 0.000583648681640625, 0.00946044921875, -0.000431060791015625, 0.003662109375, 0.006866455078125, -0.0062255859375, 0.00128936767578125, -0.01251220703125, 0.0125122070...	[ 2053, 60075, 2203, 10842, 23351, 214, 141, 16406, 6496, 17367, 8183, 2994, 24169, 7, 153, 717, 1098, 4153, 18, 360, 365, 257, 38699, 316, 88225, 95, 34058, 4439, 83, 141012, 20763, 14055, 15769, 75675, 839, 238, 864, 39116, 13269, 10588, ...	[ 0.2310791015625, 0.2391357421875, 0.070556640625, 0.175537109375, 0.2125244140625, 0.08416748046875, 0.1939697265625, 0.1361083984375, 0.0966796875, 0.227783203125, 0.1580810546875, 0.09320068359375, 0.1759033203125, 0.0635986328125, 0.0176849365234375, 0.1458740234375, 0.24060058593...	embed
4302900_c1	4302900	haskell	1	, Nothing,Just 4, Just 7, Nothing,Nothing] , [Nothing,Nothing,Nothing,Nothing,Just 1, Just 3, Nothing,Just 2, Just 8] , [Just 4, Nothing,Nothing,Just 5, Nothing,Just 2, Nothing,Nothing,Just 9] , [Just 2, Just 7, Nothing,Just 4, Just 6, Nothing,Nothing,Nothing,Nothing] , [Nothing,Nothing,Just 5, Just 3, Nothing,Just 8, ...	, Nothing,Just 4, Just 7, Nothing,Nothing] , [Nothing,Nothing,Nothing,Nothing,Just 1, Just 3, Nothing,Just 2, Just 8] , [Just 4, Nothing,Nothing,Just 5, Nothing,Just 2, Nothing,Nothing,Just 9] , [Just 2, Just 7, Nothing,Just 4, Just 6, Nothing,Nothing,Nothing,Nothing] , [Nothing,Nothing,Just 5, Just 3, Nothing,Just 8, ...	[ -0.004974365234375, 0.0184326171875, 0.025390625, 0.000762939453125, -0.008056640625, 0.0091552734375, 0.01141357421875, -0.0120849609375, -0.00156402587890625, 0.0235595703125, -0.0048828125, -0.01202392578125, -0.025146484375, 0.021728515625, -0.029541015625, 0.031005859375, -0.019...	[ 4, 182747, 127794, 201, 9563, 361, 5021, 64113, 268, 378, 106, 138, 116, 382, 190, 483, 305, 11853, 3642, 8932, 38067, 83, 61924, 71, 2053, 15334, 2203, 10666, 15555, 1984, 82419, 372, 360, 18, 16406, 6496, 17367, 864, 28864, 26073, 12,...	[ 0.0819091796875, 0.248046875, 0.1793212890625, 0.233642578125, 0.1859130859375, 0.1824951171875, 0.06903076171875, 0.186279296875, 0.02398681640625, 0.00848388671875, 0.08740234375, 0.1400146484375, 0.0697021484375, 0.13818359375, 0.0921630859375, 0.1778564453125, 0.1077880859375, ...	embed
49491461_c0	49491461	haskell	0	Title: What does split in Haskell do? Problem title: What does split in Haskell do? Tags: haskell, split, reverse, functional-programming Problem: What does split in Haskell do? I'm new to Haskell and I came into the code below and don't actually understand what it does. I know that the toDigits function is declared to...	What does split in Haskell do? What does split in Haskell do? haskell split reverse functional-programming What Haskell Integer What does split in Haskell do? I'm new to Haskell and I came into the code below and don't actually understand what it does. I know that the toDigits function is declared to take an Integer an...	[ -0.021240234375, 0.01519775390625, -0.00153350830078125, -0.00634765625, -0.038818359375, 0.031494140625, 0.0142822265625, 0.01177978515625, 0.0059814453125, 0.004241943359375, 0.01611328125, -0.0078125, -0.02490234375, -0.00032806396484375, -0.00030517578125, -0.00592041015625, 0.00...	[ 4865, 14602, 65450, 23, 20625, 142508, 54, 1556, 39531, 184, 123309, 28966, 44401, 3525, 47, 18151, 35064, 2301, 18, 28219, 2367, 442, 3714, 14055, 15769, 7, 32354, 83, 159978, 5646, 136, 30646, 10298, 91, 4263, 10750, 653, 105950, 757, 7...	[ 0.1156005859375, 0.106201171875, 0.283447265625, 0.1126708984375, 0.154296875, 0.264404296875, 0.11865234375, 0.1224365234375, 0.1607666015625, 0.0828857421875, 0.11376953125, 0.0673828125, 0.2158203125, 0.027099609375, 0.1729736328125, 0.047943115234375, 0.04400634765625, 0.018310...	embed
49614566_c1	49614566	haskell	1	1.0.1, libdrm_nouveau.so.2.0.0, libdrm_intel.so.1.0.0, libz.so.1.2.8, i965_dri.so, libXi.so.6.1.0, libglut.so.3.9.0, libXdmcp.so.6.0.0, libXau.so.6.0.0, libpthread-2.23.so, libdrm.so.2.4.0, libXxf86vm.so.1.0.0, libxcb.so.1.1.0, libxcb-dri2.so.0.0.0, libxcb-glx.so.0.0.0, libX11.so.6.3.0, libX11-xcb.so.1.0.0, libXfixes.s...	0.3.0 libdl-2.23.so libutil-2.23.so librt-2.23.so libGL.so.1.2.0 libGLU.so.1.3.1 libm-2.23.so ld-2.23.so ffffffffff600000-ffffffffff601000 Abandon Cannot use Haskell OpenGL on Linux Edit: My package opengl-examples works very well, so this is an issue with the FFI. I wanted to try my opengl-implicit package on another ...	[ -0.02685546875, -0.02685546875, -0.0067138671875, 0.00125885009765625, -0.000469207763671875, 0.0185546875, 0.006866455078125, -0.000965118408203125, 0.004302978515625, 0.0125732421875, 0.01409912109375, -0.016845703125, 0.0125732421875, 0.0062255859375, -0.00830078125, -0.026489257812...	[ 757, 132265, 25474, 20469, 5428, 3742, 991, 400, 8789, 379, 3198, 78703, 5, 73011, 22335, 22892, 97109, 39, 10715, 4598, 14105, 8262, 191, 4171, 10869, 4527, 20625, 142508, 13527, 98, 29908, 98169, 9803, 11016, 3355, 302, 99726, 43240, 4552...	[ 0.07525634765625, 0.14501953125, 0.102783203125, 0.148681640625, 0.023895263671875, 0.1268310546875, 0.123779296875, 0.0239715576171875, 0.0311279296875, 0.086669921875, 0.064453125, 0.25537109375, 0.0169219970703125, 0.048828125, 0.1328125, 0.00006103515625, 0.0849609375, 0.038085...	embed

8807539_c0

8807539

haskell

0

Title: Does the term "monadic" in J have anything to do with its Haskell use? Problem title: Does the term "monadic" in J have anything to do with its Haskell use? Tags: monads, haskell, terminology, j Problem: Does the term "monadic" in J have anything to do with its Haskell use? (Sorry, I'm stupid...

Does the term "monadic" in J have anything to do with its Haskell use? Does the term "monadic" in J have anything to do with its Haskell use? monads haskell terminology j Does Haskell Does the term "monadic" in J have anything to do with its Haskell use? (Sorry, I'm stupid and uneducated, so this is...

[ -0.0098876953125, 0.0123291015625, 0.007720947265625, 0.01239013671875, -0.00616455078125, 0.01220703125, -0.00118255615234375, 0.0225830078125, -0.004974365234375, -0.031982421875, -0.00421142578125, -0.019775390625, 0.006072998046875, -0.006134033203125, -0.013427734375, 0.0070800781...

[ 13579, 87039, 18403, 23, 821, 23937, 54, 20625, 142508, 4527, 47, 2667, 712, 7, 1556, 18614, 25443, 1647, 101790, 765, 678, 110833, 108343, 31895, 236873, 9655, 69407, 136, 1459, 11, 37202, 220, 1294, 2394, 6635, 39933, 44084, 33444, 3687, ...

[ 0.15869140625, 0.1741943359375, 0.1978759765625, 0.058746337890625, 0.1982421875, 0.05828857421875, 0.097900390625, 0.121826171875, 0.2359619140625, 0.07049560546875, 0.0280914306640625, 0.1102294921875, 0.1375732421875, 0.03558349609375, 0.08544921875, 0.045623779296875, 0.009765625...

embed

67879145_c0

67879145

haskell

0

Title: Adding elements of two lists in haskell Problem title: Adding elements of two lists in haskell Tags: haskell Problem: Adding elements of two lists in haskell add_lists list1 list2: returns the sum of the elements in the same position in each list as a new list. If one list is shorter than the other, assume that ...

Adding elements of two lists in haskell Adding elements of two lists in haskell haskell Adding add_lists list1 list2 length.list1 length.list2 length.list2-length.list1 Adding elements of two lists in haskell add_lists list1 list2: returns the sum of the elements in the same position in each list as a new list. If one ...

[ -0.00811767578125, 0.0260009765625, -0.00946044921875, 0.00994873046875, -0.00921630859375, 0.0286865234375, -0.00098419189453125, 0.00738525390625, 0.010498046875, -0.0155029296875, 0.028564453125, -0.022705078125, 0.0081787109375, 0.029296875, 0.0167236328125, -0.018798828125, 0.01...

[ 62, 59725, 80854, 111, 6626, 5303, 7, 1556, 142508, 23, 15190, 6562, 418, 304, 140909, 18504, 30646, 10554, 5701, 19069, 12638, 237, 3525, 1632, 16610, 56, 3789, 41591, 45234, 45188, 214, 44677, 792, 18151, 13695, 20949, 18499 ]

[ 0.117919921875, 0.139892578125, 0.20556640625, 0.06048583984375, 0.17724609375, 0.232421875, 0.0843505859375, 0.1607666015625, 0.228271484375, 0.00811767578125, 0.1798095703125, 0.22265625, 0.04632568359375, 0.1441650390625, 0.09271240234375, 0.07080078125, 0.1365966796875, 0.16442...

embed

13692984_c0

13692984

haskell

0

Title: How will issues with MonadCatchIO affect apps build with the Snap framework in the future? Problem title: How will issues with MonadCatchIO affect apps build with the Snap framework in the future? Tags: haskell-snap-framework, haskell Problem: How will issues with MonadCatchIO affect apps build with the Snap fra...

How will issues with MonadCatchIO affect apps build with the Snap framework in the future? How will issues with MonadCatchIO affect apps build with the Snap framework in the future? haskell-snap-framework haskell How MonadCatchIO Snap How will issues with MonadCatchIO affect apps build with the Snap framework in the fu...

[ -0.009521484375, 0.0213623046875, -0.00433349609375, 0.010986328125, -0.017578125, 0.0137939453125, -0.01300048828125, 0.01220703125, 0.007080078125, 0.0024566650390625, -0.0035552978515625, -0.05712890625, -0.0169677734375, -0.016845703125, 0.0194091796875, -0.00860595703125, -0.005...

[ 11249, 1221, 37348, 678, 60331, 71, 76775, 206, 17780, 52490, 49966, 45367, 121190, 170846, 22690, 1556, 142508, 10957, 160328, 18244, 78684, 24124, 1631, 18507, 3688, 110527, 903, 149016, 3642, 2499, 47041, 158839, 31089, 1467, 9007, 43581, 11...

[ 0.09515380859375, 0.0650634765625, 0.1824951171875, 0.05230712890625, 0.155029296875, 0.1522216796875, 0.1446533203125, 0.1082763671875, 0.2322998046875, 0.1531982421875, 0.1849365234375, 0.152587890625, 0.25732421875, 0.2047119140625, 0.1329345703125, 0.07958984375, 0.194580078125, ...

embed

22792598_c0

22792598

haskell

0

Title: Defining a Boolean function on Haskell that determines if an element occurs once in a list Problem title: Defining a Boolean function on Haskell that determines if an element occurs once in a list Tags: haskell Problem: Defining a Boolean function on Haskell that determines if an element occurs once in a list So...

Defining a Boolean function on Haskell that determines if an element occurs once in a list Defining a Boolean function on Haskell that determines if an element occurs once in a list haskell Defining Boolean Haskell Defining a Boolean function on Haskell that determines if an element occurs once in a list So I'm trying ...

[ -0.00872802734375, 0.0142822265625, 0.004669189453125, -0.014892578125, 0.01318359375, 0.010009765625, 0.006622314453125, -0.009765625, -0.006134033203125, -0.0126953125, -0.024658203125, -0.005401611328125, -0.00946044921875, 0.0244140625, -0.00860595703125, 0.0185546875, 0.02575683...

[ 88606, 73783, 34677, 32354, 98, 20625, 142508, 83324, 2174, 12830, 74918, 7, 24145, 23, 5303, 1556, 31577, 61924, 450, 34475, 892, 1505, 26255, 1221, 8337, 9774, 707, 8710, 36766, 4734, 959, 2060, 4163, 38246, 122799, 32562, 18151, 14373, 4...

[ 0.166748046875, 0.1622314453125, 0.2705078125, 0.22412109375, 0.055145263671875, 0.1348876953125, 0.2432861328125, 0.157958984375, 0.0938720703125, 0.181396484375, 0.2039794921875, 0.056884765625, 0.220703125, 0.083251953125, 0.2030029296875, 0.114990234375, 0.048675537109375, 0.15...

embed

51597106_c0

51597106

haskell

0

Title: Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? Problem title: Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? Tags: haskell Problem: Why is join standalone, instead of part of the minimal implementation of the Monad type...

Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? haskell Why Monad MINIMAL Why is join standalone, instead of part of the minimal implementation of the Monad typeclass? I would pref...

[ -0.005950927734375, -0.0023345947265625, 0.0194091796875, 0.00384521484375, -0.007415771484375, 0.0164794921875, -0.004608154296875, 0.00933837890625, 0.026123046875, -0.002044677734375, -0.0023651123046875, -0.027587890625, -0.022216796875, -0.0225830078125, 0.01446533203125, 0.002288...

[ 44084, 33284, 103723, 51684, 64457, 20187, 208124, 60331, 71, 10644, 67413, 1556, 142508, 86240, 114626, 83, 2831, 12601, 13204, 110527, 32354, 6396, 1369, 224743, 61924, 4734, 678, 765, 84751, 30813, 2663, 17366, 959 ]

[ 0.10577392578125, 0.25244140625, 0.129638671875, 0.156005859375, 0.0556640625, 0.2047119140625, 0.1046142578125, 0.1973876953125, 0.180908203125, 0.111328125, 0.1390380859375, 0.0985107421875, 0.1944580078125, 0.189453125, 0.1380615234375, 0.0220184326171875, 0.0278778076171875, 0....

embed

51993746_c0

51993746

haskell

0

Title: Discovering more typeclass instances Problem title: Discovering more typeclass instances Tags: template-haskell, haskell Problem: Discovering more typeclass instances When I was new to Haskell I had very hard time finding instances for various types. Motivated by this, much later I noticed reifyInstances . While...

Discovering more typeclass instances Discovering more typeclass instances template-haskell haskell Discovering Functor Discovering more typeclass instances When I was new to Haskell I had very hard time finding instances for various types. Motivated by this, much later I noticed reifyInstances . While I know little abo...

[ 0.0086669921875, -0.0269775390625, 0.003997802734375, 0.0208740234375, -0.00579833984375, 0.01513671875, 0.01129150390625, -0.025390625, 0.01519775390625, -0.006927490234375, -0.009521484375, -0.04052734375, 0.0166015625, 0.00408935546875, -0.00677490234375, 0.010986328125, 0.0094604...

[ 53092, 5465, 1286, 10644, 67413, 110527, 110934, 10557, 142508, 1556, 28670, 18770, 3525, 20625, 4552, 7941, 1733, 90791, 67842, 52895, 48120, 156672, 456, 40383, 4153, 116071, 3714, 10176, 196631, 831, 103882, 3501, 115723, 152, 7319, 22691, 1...

[ 0.07830810546875, 0.134521484375, 0.18896484375, 0.1900634765625, 0.2529296875, 0.26953125, 0.2091064453125, 0.0673828125, 0.212890625, 0.09765625, 0.1156005859375, 0.1763916015625, 0.041961669921875, 0.1016845703125, 0.03887939453125, 0.0711669921875, 0.048583984375, 0.11071777343...

embed

42373923_c1

42373923

haskell

1

=> target => x => f => { const destructiveSet = y => (x = f(x) (y), x), handler = event => destructiveSet(event); target.addEventListener(type, handler, true); return g => g(x); }; const comp = f => g => x => f(g(x)); const K = x => y => x; const I = x => x; const get = I; const defer = n => f => x => setTimeout(f, n,...

[ -0.006103515625, 0.016845703125, 0.006195068359375, -0.0093994140625, -0.005340576171875, 0.02734375, 0.0089111328125, 0.00823974609375, 0.0042724609375, -0.05419921875, 0.0081787109375, -0.002410888671875, 0.00970458984375, 0.036376953125, 0.024169921875, -0.015625, -0.0037384033203...

[ 44357, 30388, 1022, 1238, 10666, 158, 271, 8, 36716, 5844, 294, 126, 2203, 113, 425, 53, 35863, 19732, 90141, 3142, 4028, 192134, 154663, 39060, 50986, 29568, 30646, 706, 9969, 341, 87, 2046, 2875, 5423, 70059, 6056, 420, 12684, 183114, 1...

[ 0.1181640625, 0.29150390625, 0.122802734375, 0.14404296875, 0.05035400390625, 0.126953125, 0.154541015625, 0.1488037109375, 0.205078125, 0.1099853515625, 0.1326904296875, 0.1695556640625, 0.0472412109375, 0.10504150390625, 0.062469482421875, 0.06549072265625, 0.2144775390625, 0.142...

embed

65077086_c0

65077086

haskell

0

Title: Applying isAlpha to a recursive function Problem title: Applying isAlpha to a recursive function Tags: haskell Problem: Applying isAlpha to a recursive function I've created the function filter that finds the smallest item in a list and filters out any strings that contain characters that are not alphabetical. F...

Applying isAlpha to a recursive function Applying isAlpha to a recursive function haskell Applying Empty x:y:xs x:xs y:xs Applying isAlpha to a recursive function I've created the function filter that finds the smallest item in a list and filters out any strings that contain characters that are not alphabetical. For ex...

[ -0.00634765625, 0.0002574920654296875, 0.01019287109375, 0.0024261474609375, 0.0078125, 0.00390625, 0.0211181640625, -0.00141143798828125, 0.0157470703125, 0.03369140625, 0.021240234375, -0.0224609375, -0.01385498046875, 0.006988525390625, -0.0042724609375, 0.00057220458984375, 0.012...

[ 5659, 538, 83, 6210, 14612, 47, 195625, 5844, 32354, 214, 1556, 142508, 31678, 939, 1022, 12, 53, 425, 7, 113, 75935, 46312, 7413, 19336, 525, 35735, 23, 5303, 1810, 79315, 70541, 124850, 959, 229231, 21533, 18, 20697, 27781, 25442, 11, ...

[ 0.10406494140625, 0.0870361328125, 0.178955078125, 0.1597900390625, 0.239013671875, 0.068603515625, 0.217041015625, 0.1197509765625, 0.1741943359375, 0.003265380859375, 0.124267578125, 0.2071533203125, 0.1290283203125, 0.1162109375, 0.068603515625, 0.003173828125, 0.041473388671875, ...

embed

31280410_c0

31280410

haskell

0

Title: cabal install --disable-prof not working? Problem title: cabal install --disable-prof not working? Tags: cabal-install, haskell Problem: cabal install --disable-prof not working? To save time, I am trying to build a package (in a sandbox) with --disable-doc --disable-prof , but it's failing: when compiling some ...

cabal install --disable-prof not working? cabal install --disable-prof not working? cabal-install haskell Could System.Entropy Perhaps entropy-0.3.7 entro_GdlGosmsZhO5QKbUBFjD3f cabal install --disable-prof not working? To save time, I am trying to build a package (in a sandbox) with --disable-doc --disable-prof , but ...

[ -0.006317138671875, -0.0017242431640625, 0.0078125, -0.0169677734375, -0.0201416015625, 0.014892578125, -0.00787353515625, -0.0189208984375, -0.00213623046875, 0.01531982421875, 0.01129150390625, 0.01348876953125, 0.0150146484375, 0.01324462890625, -0.0079345703125, 0.007659912109375, ...

[ 109524, 20600, 4210, 3827, 2886, 3454, 420, 959, 20697, 80383, 1556, 142508, 191147, 12353, 7768, 29813, 53, 181799, 49478, 6493, 23320, 109981, 30098, 1733, 31577, 45367, 98169, 19096, 11728, 678, 29713, 35782, 214, 9969, 49725, 42548, 27771, ...

[ 0.282470703125, 0.190673828125, 0.060302734375, 0.1016845703125, 0.2010498046875, 0.1099853515625, 0.1490478515625, 0.128173828125, 0.15380859375, 0.17138671875, 0.1278076171875, 0.2276611328125, 0.057159423828125, 0.09661865234375, 0.00885009765625, 0.1368408203125, 0.0843505859375,...

embed

32933776_c0

32933776

haskell

0

Title: Haskell types and signatures Problem title: Haskell types and signatures Tags: types, integer, haskell, functional-programming Problem: Haskell types and signatures I'm studying for an exam about Haskell. I don't understand how I determine the type of a function. The function is: func [] f = 16 func (h : t) f = ...

Haskell types and signatures Haskell types and signatures types integer haskell functional-programming Haskell Num Haskell types and signatures I'm studying for an exam about Haskell. I don't understand how I determine the type of a function. The function is: My guess is that the first line has this types: empty list -...

[ 0.002777099609375, -0.0216064453125, -0.004791259765625, 0.0125732421875, -0.004302978515625, 0.01348876953125, -0.0002269744873046875, 0.0076904296875, 0.00372314453125, -0.0089111328125, -0.028076171875, -0.040283203125, -0.01092529296875, -0.006439208984375, -0.01007080078125, -0.01...

[ 20625, 142508, 52895, 136, 138256, 892, 1505, 1556, 123309, 28966, 52782, 35187, 42276, 2301, 18, 28219, 3642, 83324, 10644, 111, 32354, 57767, 5117, 13315, 903, 201505, 5303, 33079, 10, 54744, 110, 22062, 44357, 17932, 103607, 30646, 83425, ...

[ 0.139404296875, 0.237060546875, 0.240966796875, 0.10174560546875, 0.20751953125, 0.11572265625, 0.0635986328125, 0.1231689453125, 0.13525390625, 0.06634521484375, 0.1717529296875, 0.01300048828125, 0.07080078125, 0.003570556640625, 0.0009765625, 0.08636474609375, 0.014892578125, 0....

embed

58917739_c1

58917739

haskell

1

<- [2 .. n]]) In an equation for ‘a’: a = array (0, n) ([(0, 0), (1, 1), (2, 1)] ++ [(i, fastFibo (a i)) | i <- [2 .. n]]) In an equation for ‘fibos’: fibos n = a where a = array (0, n) ([(0, 0), ....] ++ [(i, fastFibo (a i)) | i <- [2 .. n]]) • Relevant bindings include a :: i1 -> Array Int Int (bound at /mnt/data/Do...

[ -0.00482177734375, 0.02001953125, -0.00958251953125, 0.0059814453125, -0.009765625, -0.0223388671875, -0.00390625, 0.00970458984375, 0.01300048828125, -0.005523681640625, -0.00994873046875, 0.006103515625, 0.006866455078125, 0.0162353515625, 0.0126953125, -0.019775390625, -0.00668334...

[ 4426, 9, 304, 1468, 653, 86245, 360, 142, 28, 5490, 2320, 100, 204, 11, 12, 10, 2203, 10298, 53, 22085, 2389, 757, 4879, 4700, 37223, 14, 4271, 6159, 837, 17, 1029, 16091, 809, 7440, 133, 30624, 128239, 418, 69253, 18, 99091, 660, 1...

[ 0.09112548828125, 0.1417236328125, 0.1822509765625, 0.1217041015625, 0.1356201171875, 0.0171051025390625, 0.142578125, 0.08721923828125, 0.1156005859375, 0.269775390625, 0.193359375, 0.1544189453125, 0.009429931640625, 0.2144775390625, 0.0389404296875, 0.18115234375, 0.09814453125, ...

embed

23478941_c0

23478941

haskell

0

Title: How to find index in a zipped list by condition of the elements of tuples (Haskell) Problem title: How to find index in a zipped list by condition of the elements of tuples (Haskell) Tags: list, haskell, zip Problem: How to find index in a zipped list by condition of the elements of tuples (Haskell) I am new an ...

How to find index in a zipped list by condition of the elements of tuples (Haskell) How to find index in a zipped list by condition of the elements of tuples (Haskell) list haskell zip How Haskell Bool How to find index in a zipped list by condition of the elements of tuples (Haskell) I am new an familiarizing myself t...

[ -0.006378173828125, 0.000396728515625, 0.00836181640625, 0.025390625, -0.0296630859375, 0.0159912109375, 0.01519775390625, -0.006927490234375, 0.0191650390625, -0.0004711151123046875, 0.0018310546875, 0.0027313232421875, -0.00885009765625, 0.0179443359375, 0.0033416748046875, 0.0104370...

[ 11249, 7413, 63262, 23, 3546, 48398, 5303, 390, 35431, 80854, 370, 99726, 6495, 7, 142508, 47, 1556, 68330, 20625, 2460, 929, 10, 3525, 4488, 10932, 44402, 360, 18, 12647, 3173, 3630, 12830, 142424, 87599, 5117, 9222, 24105, 94131, 17932, ...

[ 0.064697265625, 0.14404296875, 0.25341796875, 0.0875244140625, 0.1597900390625, 0.1656494140625, 0.2003173828125, 0.0889892578125, 0.2149658203125, 0.1324462890625, 0.115478515625, 0.186767578125, 0.06829833984375, 0.050537109375, 0.221435546875, 0.00140380859375, 0.08685302734375, ...

embed

52730463_c1

52730463

haskell

1

TypeError feature to improve on this message, however, a naive solution gobbles the error: import GHC.TypeLits type family MemberB (x :: k) (l :: [k]) where MemberB _ '[] = TypeError ('Text "not a member") MemberB a (a : xs) = 'True MemberB a (b : xs) = MemberB a xs It seems that, maybe, TypeError behaves as any type,...

[ -0.00537109375, -0.004302978515625, 0.00421142578125, 0.004119873046875, -0.0096435546875, -0.009033203125, -0.00872802734375, -0.0010223388671875, -0.022705078125, 0.011962890625, 0.007110595703125, 0.000518798828125, 0.0255126953125, -0.003204345703125, 0.007659912109375, 0.003143310...

[ 60457, 18468, 31611, 60213, 52295, 26008, 24, 5844, 29806, 73163, 18499, 24927, 527, 73265, 196707, 9506, 933, 10644, 14449, 74057, 571, 425, 1984, 472, 141, 92, 174379, 10869, 10, 32786, 1022, 882, 68991, 237, 2499, 51, 27430, 256, 7520, ...

[ 0.241943359375, 0.18994140625, 0.1798095703125, 0.10235595703125, 0.1229248046875, 0.007720947265625, 0.014068603515625, 0.0699462890625, 0.07196044921875, 0.144287109375, 0.214599609375, 0.156982421875, 0.020294189453125, 0.150146484375, 0.197021484375, 0.1422119140625, 0.0841064453...

embed

20939720_c0

20939720

haskell

0

Title: How to make the transition from Haskell type variables to C# generics Problem title: How to make the transition from Haskell type variables to C# generics Tags: generics, haskell, c%23, .net Problem: How to make the transition from Haskell type variables to C# generics Currently I'm in migration from Haskell to ...

How to make the transition from Haskell type variables to C# generics How to make the transition from Haskell type variables to C# generics generics haskell c%23 .net Haskell How MyFun List Map How to make the transition from Haskell type variables to C# generics Currently I'm in migration from Haskell to C# . There ar...

[ -0.01104736328125, 0.007415771484375, 0.0145263671875, -0.004486083984375, -0.0145263671875, -0.0012969970703125, -0.021484375, -0.01513671875, 0.00982666015625, -0.01165771484375, -0.00750732421875, -0.031005859375, -0.007354736328125, 0.003326416015625, -0.0057373046875, 0.0010604858...

[ 11249, 47, 3249, 149307, 1295, 20625, 142508, 10644, 77336, 313, 4904, 189534, 7, 1556, 3742, 1179, 2646, 97249, 32036, 42719, 70, 212416, 66139, 831, 159978, 32354, 678, 21373, 4677, 25842 ]

[ 0.075439453125, 0.085205078125, 0.08282470703125, 0.2012939453125, 0.10321044921875, 0.155517578125, 0.2470703125, 0.1993408203125, 0.22802734375, 0.07379150390625, 0.2127685546875, 0.257080078125, 0.0804443359375, 0.140625, 0.0819091796875, 0.0997314453125, 0.140625, 0.2177734375,...

embed

72251572_c0

72251572

haskell

0

Title: Haskell: Type Error Trying when using generics Problem title: Haskell: Type Error Trying when using generics Tags: haskell Problem: Haskell: Type Error Trying when using generics I am a Haskell beginner, and when I compile the Haskell source code, when trying to make a function to implement an lazy at least as l...

Haskell: Type Error Trying when using generics Haskell: Type Error Trying when using generics haskell generics Data.Maybe new_acc xs acc Haskell Type Error Trying Main Maybe Just x:xs gh.hs:15:19 Couldn gh.hs:14:9-26 gh.hs:7:1-56 Expected Actual Relevant gh.hs:15:9 gh.hs:8:12 gh.hs:8:1 gh.hs:15:21 gh.hs:10:5-29 gh.hs:1...

[ -0.002105712890625, 0.01214599609375, -0.002593994140625, -0.00726318359375, 0.021240234375, 0.00848388671875, -0.003326416015625, -0.0021514892578125, 0.00848388671875, -0.005950927734375, -0.0010528564453125, -0.0208740234375, 0.0111083984375, -0.0012664794921875, 0.0084228515625, 0....

[ 20625, 142508, 60457, 212059, 40858, 17368, 189534, 7, 12, 3229, 1556, 11809, 82419, 3525, 10060, 1022, 50015, 12321, 83425, 9563, 425, 31380, 127, 12221, 23988, 191147, 22635, 1126, 51372, 966, 19721, 13683, 60075, 100582, 133, 1019, 20927, ...

[ 0.1165771484375, 0.205322265625, 0.26123046875, 0.201171875, 0.150634765625, 0.0916748046875, 0.2445068359375, 0.0704345703125, 0.012969970703125, 0.0059814453125, 0.1162109375, 0.0848388671875, 0.033660888671875, 0.09033203125, 0.115478515625, 0.06060791015625, 0.0877685546875, 0....

embed

74011274_c1

74011274

haskell

1

borders red. I don't know wether gaps or screen borders are outmost, here I put gaps (green) closest to the edge: Experimenting a bit more, it seems like gaps, screen borders, and window borders don't interact. For example, this code -- `False` produces the same outcome as `True` with the parameter to the left set to ...

[ 0.00927734375, 0.037353515625, -0.00848388671875, 0.004058837890625, 0.004150390625, 0.004547119140625, 0.02001953125, -0.0169677734375, 0.0027008056640625, 0.037109375, 0.0235595703125, 0.005401611328125, -0.01220703125, -0.0026702880859375, -0.004913330078125, 0.0133056640625, -0.0...

[ 132988, 7, 4842, 3714, 43599, 49119, 1810, 840, 3688, 3884, 99433, 20903, 271, 47, 121303, 146797, 37202, 76896, 2301, 18, 78974, 18151, 17647, 11971, 27489, 5701, 184345, 882, 13, 171859, 25737, 5423, 757, 3034, 141012, 5623, 21896, 12248, ...

[ 0.283203125, 0.0870361328125, 0.201171875, 0.03619384765625, 0.250732421875, 0.1395263671875, 0.127685546875, 0.075439453125, 0.006103515625, 0.041473388671875, 0.143310546875, 0.083251953125, 0.024810791015625, 0.05120849609375, 0.1480712890625, 0.0916748046875, 0.03155517578125, ...

embed

65763827_c0

65763827

haskell

0

Title: All combinations of elements of N lists in Haskell Problem title: All combinations of elements of N lists in Haskell Tags: functional-programming, combinatorics, haskell, list-comprehension, list Problem: All combinations of elements of N lists in Haskell In order to combine 2 lists the following code could be u...

All combinations of elements of N lists in Haskell All combinations of elements of N lists in Haskell functional-programming combinatorics haskell list-comprehension list All Haskell All combinations of elements of N lists in Haskell In order to combine 2 lists the following code could be used. [(x,y) | x <- [1, 2, 3],...

[ -0.0205078125, 0.0189208984375, -0.01129150390625, 0.0159912109375, 0.0067138671875, 0.0255126953125, -0.011474609375, -0.01092529296875, -0.0025787353515625, -0.0267333984375, -0.00830078125, -0.0267333984375, 0.022705078125, 0.01904296875, -0.041259765625, -0.0079345703125, 0.01782...

[ 3164, 162515, 7, 80854, 541, 5303, 23, 20625, 142508, 123309, 28966, 22321, 3826, 1556, 277, 4692, 3220, 6889, 12989, 70163, 116, 25632, 18151, 5809, 11814, 425, 4, 53, 58745, 1022, 68252, 138, 113, 190, 305, 3347, 4369, 155761, 617, 1046...

[ 0.1182861328125, 0.2568359375, 0.0489501953125, 0.2193603515625, 0.1658935546875, 0.274169921875, 0.07733154296875, 0.172607421875, 0.26806640625, 0.1123046875, 0.0755615234375, 0.1614990234375, 0.05108642578125, 0.146484375, 0.0159759521484375, 0.10479736328125, 0.132568359375, 0....

embed

67710566_c0

67710566

haskell

0

Title: How to use Maybe in higher order function haskell? Problem title: How to use Maybe in higher order function haskell? Tags: higher-order-functions, haskell Problem: How to use Maybe in higher order function haskell? I wanted to solve the below problem where f returns Nothing, then the first element is removed. If...

How to use Maybe in higher order function haskell? How to use Maybe in higher order function haskell? higher-order-functions haskell How Maybe x:xs How to use Maybe in higher order function haskell? I wanted to solve the below problem where f returns Nothing, then the first element is removed. If f returns Just x, the ...

[ -0.011474609375, -0.015625, -0.00054931640625, -0.00579833984375, 0.014404296875, 0.0216064453125, 0.01214599609375, 0.003875732421875, 0.021728515625, 0.01385498046875, 0.00093841552734375, 0.0264892578125, -0.005218505859375, 0.000736236572265625, 0.0106201171875, -0.03076171875, -...

[ 11249, 47, 4527, 83425, 23, 77546, 12989, 32354, 1556, 142508, 80596, 137175, 1022, 12, 425, 7, 36663, 86869, 35064, 2967, 1238, 30646, 182747, 5117, 12830, 83, 184750, 4263, 9563, 70, 98816, 678, 43240, 26785, 28219, 3642, 99710, 2182, 461...

[ 0.1507568359375, 0.0828857421875, 0.1939697265625, 0.341796875, 0.1136474609375, 0.165771484375, 0.2010498046875, 0.206298828125, 0.159423828125, 0.256103515625, 0.176025390625, 0.159423828125, 0.1031494140625, 0.04656982421875, 0.11279296875, 0.016845703125, 0.00469970703125, 0.07...

embed

3455822_c0

3455822

haskell

0

Title: Is Concurrent Haskell still restricted to a single OS thread? Problem title: Is Concurrent Haskell still restricted to a single OS thread? Tags: multithreading, multicore, haskell, concurrency Problem: Is Concurrent Haskell still restricted to a single OS thread? In a 2005 research paper it said Concurrent Haske...

Is Concurrent Haskell still restricted to a single OS thread? Is Concurrent Haskell still restricted to a single OS thread? multithreading multicore haskell concurrency Concurrent Haskell Is Concurrent Haskell still restricted to a single OS thread? In a 2005 research paper it said Has this changed or is Concurrent Has...

[ 0.00543212890625, 0.003631591796875, -0.007537841796875, 0.025634765625, -0.0005645751953125, 0.00390625, -0.00701904296875, 0.00150299072265625, -0.01416015625, -0.049560546875, -0.01336669921875, -0.026123046875, -0.01171875, -0.0059814453125, -0.01300048828125, 0.0098876953125, 0....

[ 1657, 163812, 20625, 142508, 7464, 173072, 297, 11001, 11787, 86997, 47, 3869, 65847, 11, 6024, 30854, 1556, 108636, 982, 2071, 4078, 25188, 15122, 98816 ]

[ 0.07257080078125, 0.2239990234375, 0.1429443359375, 0.25634765625, 0.07470703125, 0.14697265625, 0.0423583984375, 0.14111328125, 0.1439208984375, 0.1988525390625, 0.037628173828125, 0.03948974609375, 0.12255859375, 0.005645751953125, 0.03851318359375, 0.138427734375, 0.1259765625, ...

embed

18395816_c0

18395816

haskell

0

Title: How do I make lenses from a record in GHCi Problem title: How do I make lenses from a record in GHCi Tags: template-haskell, haskell, haskell-lens, ghci Problem: How do I make lenses from a record in GHCi I want to play around with the Lens library a bit. I've loaded it into GHCi and created a record data type w...

How do I make lenses from a record in GHCi How do I make lenses from a record in GHCi template-haskell haskell haskell-lens ghci a How GHCi Lens Foo _arg1 _arg2 How do I make lenses from a record in GHCi I want to play around with the Lens library a bit. I've loaded it into GHCi and created a record data type with the ...

[ -0.015380859375, -0.007476806640625, -0.0185546875, 0.00726318359375, -0.0017547607421875, 0.0260009765625, -0.0050048828125, 0.00115203857421875, 0.0023345947265625, -0.038818359375, -0.00165557861328125, -0.0247802734375, 0.01348876953125, -0.00927734375, 0.004638671875, -0.009704589...

[ 11249, 54, 87, 3249, 96, 47754, 1295, 17164, 23, 527, 73265, 14, 10, 110934, 10557, 142508, 1556, 1977, 31380, 318, 18226, 7, 9572, 31, 61477, 304, 3444, 11301, 35773, 1294, 4785, 72367, 75935, 2053, 10644, 95307, 1379, 12064, 1884, 100, ...

[ 0.047821044921875, 0.0204010009765625, 0.00927734375, 0.1292724609375, 0.17822265625, 0.2286376953125, 0.14208984375, 0.228515625, 0.0633544921875, 0.0902099609375, 0.14208984375, 0.197021484375, 0.0318603515625, 0.1732177734375, 0.064697265625, 0.1630859375, 0.0887451171875, 0.162...

embed

50149270_c0

50149270

haskell

0

Title: Explanation on the type of Concat method Problem title: Explanation on the type of Concat method Tags: haskell, concatenation Problem: Explanation on the type of Concat method Can someone please explain to me why the type of the source list in my implementation of concat does not work ? conc::[[a]]->[a] conc xs@...

Explanation on the type of Concat method Explanation on the type of Concat method haskell concatenation Explanation Concat x1:xs Couldn Explanation on the type of Concat method Can someone please explain to me why the type of the source list in my implementation of concat does not work ? Why should the source list be [...

[ 0.0042724609375, 0.007598876953125, 0.005615234375, 0.01434326171875, 0.005157470703125, -0.002960205078125, -0.01373291015625, 0.0155029296875, 0.013671875, -0.0242919921875, -0.0098876953125, -0.042236328125, 0.004180908203125, -0.0115966796875, -0.01434326171875, -0.007537841796875,...

[ 5868, 10644, 1657, 4460, 55300, 1556, 142508, 158, 33, 1022, 82825, 425, 191147, 73342, 15400, 31344, 5303, 208124, 14602, 959, 4488, 44084, 5608, 11, 3444, 133063, 82449, 12830, 25632, 18499 ]

[ 0.1181640625, 0.17333984375, 0.15869140625, 0.255859375, 0.1182861328125, 0.08740234375, 0.1749267578125, 0.1640625, 0.055419921875, 0.0190582275390625, 0.0250701904296875, 0.0347900390625, 0.025604248046875, 0.10693359375, 0.08721923828125, 0.1527099609375, 0.13818359375, 0.104492...

embed

53583073_c0

53583073

haskell

0

Title: Haskell list creation and concatenation performance Problem title: Haskell list creation and concatenation performance Tags: performance, haskell, list Problem: Haskell list creation and concatenation performance In the process of playing with haskell and finding solution for project euler n°40 i found that this...

Haskell list creation and concatenation performance Haskell list creation and concatenation performance performance haskell list Haskell foldl1 Haskell list creation and concatenation performance In the process of playing with haskell and finding solution for project euler n°40 i found that this code is very fast: but ...

[ -0.005035400390625, -0.0123291015625, -0.004302978515625, -0.00130462646484375, -0.0050048828125, -0.0098876953125, -0.006561279296875, -0.003997802734375, 0.0164794921875, -0.0277099609375, 0.011962890625, -0.0205078125, 0.0054931640625, -0.003143310546875, -0.0159912109375, -0.015014...

[ 20625, 142508, 5303, 166635, 136, 158, 4460, 33, 23718, 1556, 18344, 20469, 418, 75169, 29806, 13452, 1175, 603, 2839, 14037, 903, 18151, 83, 4552, 4271, 1284, 21870, 72803, 1884, 43077, 1733, 56, 831, 73342, 15400 ]

[ 0.1204833984375, 0.2017822265625, 0.196044921875, 0.153564453125, 0.03509521484375, 0.0631103515625, 0.101318359375, 0.09613037109375, 0.181396484375, 0.1138916015625, 0.0704345703125, 0.124755859375, 0.0684814453125, 0.0303192138671875, 0.0789794921875, 0.061431884765625, 0.05337524...

embed

27576627_c0

27576627

haskell

0

Title: Haskell Leksah and GHCI Problem title: Haskell Leksah and GHCI Tags: ghci, leksah, haskell Problem: Haskell Leksah and GHCI In Leksah, I get the following error whenever trying to debug anything. First it says: "GHCi debugger is not running." So I click "Start GHCi" Then I get the following in the console: GHCi,...

Haskell Leksah and GHCI Haskell Leksah and GHCI ghci leksah haskell Haskell Leksah GHCI www.haskell.org Usage Haskell Leksah and GHCI In Leksah, I get the following error whenever trying to debug anything. First it says: "GHCi debugger is not running." So I click "Start GHCi" Then I get the following in the console: GH...

[ 0.003662109375, -0.000377655029296875, -0.01129150390625, 0.0076904296875, -0.007537841796875, 0.0233154296875, -0.00799560546875, -0.0029296875, 0.00067901611328125, -0.0306396484375, 0.024169921875, -0.0390625, -0.006072998046875, 0.006622314453125, 0.0179443359375, 0.00982666015625,...

[ 20625, 142508, 53273, 23474, 136, 41877, 17304, 31380, 318, 17143, 1556, 10557, 1478, 70166, 25632, 18499, 217684, 31577, 8, 85779, 23937, 40658, 978, 21407, 83, 959, 51042, 18158, 126597, 527, 73265, 14, 130250, 11389, 361, 52196, 363, 9486,...

[ 0.1400146484375, 0.270263671875, 0.1285400390625, 0.2320556640625, 0.057525634765625, 0.172119140625, 0.1641845703125, 0.1119384765625, 0.1314697265625, 0.0726318359375, 0.0911865234375, 0.10272216796875, 0.0810546875, 0.08343505859375, 0.07879638671875, 0.1663818359375, 0.0711059570...

embed

21371196_c0

21371196

haskell

0

Title: How to install a 32-bit binary using Cabal Problem title: How to install a 32-bit binary using Cabal Tags: cabal, haskell, i386, 32-bit Problem: How to install a 32-bit binary using Cabal I'm running Ubuntu Precise with an amd64 kernel and amd64 userland. I've just installed Haskell using sudo apt-get install ha...

How to install a 32-bit binary using Cabal How to install a 32-bit binary using Cabal cabal haskell i386 32-bit Cabal How m32 i386 How to install a 32-bit binary using Cabal I'm running Ubuntu Precise with an amd64 kernel and amd64 userland. I've just installed Haskell using sudo apt-get install haskell-platform . Now ...

[ 0.00518798828125, 0.00958251953125, 0.02294921875, 0.01446533203125, -0.01263427734375, -0.000804901123046875, -0.0032501220703125, -0.0177001953125, 0.0093994140625, -0.004669189453125, 0.0028228759765625, -0.048828125, -0.00970458984375, 0.0038909912109375, -0.01409912109375, -0.0007...

[ 11249, 47, 20600, 2789, 3137, 2394, 6635, 17368, 30438, 289, 10, 109524, 1556, 142508, 17, 105742, 347, 6460, 51042, 116890, 70464, 13, 678, 444, 71, 13307, 77924, 38937, 1760, 20625, 166, 246, 1747, 3794, 172121, 1884, 139392, 7722, 3249, ...

[ 0.0810546875, 0.044891357421875, 0.1993408203125, 0.25732421875, 0.147705078125, 0.1927490234375, 0.1959228515625, 0.1131591796875, 0.2041015625, 0.2017822265625, 0.012115478515625, 0.2476806640625, 0.13671875, 0.237060546875, 0.07403564453125, 0.267822265625, 0.06689453125, 0.2463...

embed

22520200_c0

22520200

haskell

0

Title: printf a list of strings Problem title: printf a list of strings Tags: haskell, string-formatting, pointfree Problem: printf a list of strings I have the following code that is supposed to format a telephone number. ( printf is from Text.Printf, splitPlaces is from Data.List.Split). prettyPrint :: String -> Stri...

printf a list of strings printf a list of strings haskell string-formatting pointfree part1 part2 part3 printf a list of strings I have the following code that is supposed to format a telephone number. ( printf is from Text.Printf, splitPlaces is from Data.List.Split). What I'm looking for is an operator that allows th...

[ -0.0040283203125, -0.00665283203125, 0.0196533203125, 0.0086669921875, -0.0242919921875, 0.00183868408203125, 0.01324462890625, 0.00457763671875, 0.0201416015625, -0.002105712890625, 0.01507568359375, -0.020263671875, 0.01312255859375, -0.01202392578125, -0.0211181640625, 0.01281738281...

[ 28412, 420, 10, 5303, 111, 79315, 7, 1556, 142508, 51727, 1916, 6275, 32087, 2831, 363, 765, 25632, 18151, 134598, 9384, 203599, 14012, 1295, 24129, 112079, 18, 65450, 683, 143, 5170, 11809, 154663, 31923, 4353, 16487, 100, 39933, 114864, 3...

[ 0.22900390625, 0.21240234375, 0.0269775390625, 0.1861572265625, 0.0310211181640625, 0.2261962890625, 0.011505126953125, 0.09326171875, 0.205810546875, 0.153076171875, 0.024200439453125, 0.107177734375, 0.196533203125, 0.041595458984375, 0.026214599609375, 0.00177001953125, 0.11877441...

embed

7534715_c0

7534715

haskell

0

Title: How to print comma-separated list with hamlet? Problem title: How to print comma-separated list with hamlet? Tags: haskell, templates, yesod, hamlet Problem: How to print comma-separated list with hamlet? With the hamlet templating language that comes with yesod, what is the best way of printing a comma-separate...

How to print comma-separated list with hamlet? How to print comma-separated list with hamlet? haskell templates yesod hamlet How How to print comma-separated list with hamlet? With the hamlet templating language that comes with yesod, what is the best way of printing a comma-separated list? E.g. assume this code which ...

[ -0.00347900390625, -0.018310546875, -0.00162506103515625, 0.0015411376953125, -0.0203857421875, 0.0137939453125, 0.000865936279296875, 0.0024566650390625, -0.000056743621826171875, -0.03076171875, -0.01544189453125, -0.0458984375, 0.0264892578125, 0.00799560546875, -0.0035400390625, -0...

[ 11249, 28412, 96117, 184, 6276, 3674, 5303, 678, 2057, 1974, 1556, 142508, 110934, 2422, 23722, 9, 127446, 26518, 46876, 32497, 2965, 3917, 2448, 1916, 41591, 18151, 1632, 42805, 7103, 15700, 3642, 183540, 375, 1510, 17721, 80854, 15190, 2940...

[ 0.0599365234375, 0.180908203125, 0.24609375, 0.0760498046875, 0.1751708984375, 0.072509765625, 0.197998046875, 0.12353515625, 0.15673828125, 0.2213134765625, 0.064453125, 0.1693115234375, 0.1568603515625, 0.12060546875, 0.197998046875, 0.005523681640625, 0.12646484375, 0.0740966796...

embed

8046306_c0

8046306

haskell

0

Title: Having a hard time understanding how to use nubBy Problem title: Having a hard time understanding how to use nubBy Tags: haskell Problem: Having a hard time understanding how to use nubBy I have a problem where i have to manipulate a list of a list of floats. [[Float]]. these list of floats are of length 4. I wa...

Having a hard time understanding how to use nubBy Having a hard time understanding how to use nubBy haskell Having Float Having a hard time understanding how to use nubBy I have a problem where i have to manipulate a list of a list of floats. [[Float]]. these list of floats are of length 4. I want to remove duplicates ...

[ 0.00213623046875, 0.0245361328125, 0.004150390625, 0.0004596710205078125, 0.005706787109375, 0.004638671875, 0.021240234375, -0.01416015625, 0.00445556640625, -0.0093994140625, -0.0341796875, -0.000621795654296875, 0.029541015625, -0.01611328125, -0.0205078125, -0.0093994140625, -0.0...

[ 171855, 7941, 1733, 100094, 3642, 4527, 315, 275, 75358, 1556, 142508, 38699, 257, 2967, 45258, 5303, 21917, 9821, 919, 365, 6097, 140909, 1398, 3444, 87388, 171763, 1636, 5117, 138, 80854, 3034, 1284, 124962, 201, 927, 4568, 2831, 6024, 11...

[ 0.1151123046875, 0.0997314453125, 0.0928955078125, 0.1297607421875, 0.0280609130859375, 0.1324462890625, 0.1810302734375, 0.1612548828125, 0.251953125, 0.14453125, 0.2396240234375, 0.1788330078125, 0.09136962890625, 0.0882568359375, 0.1400146484375, 0.1177978515625, 0.1790771484375, ...

embed

8058039_c0

8058039

haskell

0

Title: Bit of confusion regarding a functor? Problem title: Bit of confusion regarding a functor? Tags: haskell Problem: Bit of confusion regarding a functor? Im trying to understand what a functor is, i found this tutorial/example: http://en.wikibooks.org/wiki/Haskell/Solutions/Applicative_Functors data Tree a = Node ...

Bit of confusion regarding a functor? Bit of confusion regarding a functor? haskell Bit Tree Node Functor Bit of confusion regarding a functor? Im trying to understand what a functor is, i found this tutorial/example: http://en.wikibooks.org/wiki/Haskell/Solutions/Applicative_Functors The functor for the above type bei...

[ 0.0145263671875, -0.005859375, 0.000583648681640625, 0.00518798828125, 0.0125732421875, 0.0089111328125, -0.00153350830078125, -0.01904296875, 0.01220703125, -0.022216796875, -0.0113525390625, -0.040283203125, 0, 0.0123291015625, -0.0130615234375, -0.01507568359375, 0.00836181640625,...

[ 27774, 111, 169463, 118861, 10, 7477, 18770, 32, 1556, 142508, 101344, 438, 112, 28670, 3370, 31577, 28219, 2367, 83, 57143, 81415, 13691, 6495, 7, 102588, 34, 39179, 11048, 4935, 97249, 581, 36917, 10644, 8035, 73342, 66161, 16940, 15400, ...

[ 0.1668701171875, 0.0948486328125, 0.15966796875, 0.053466796875, 0.090087890625, 0.2420654296875, 0.29541015625, 0.0089111328125, 0.1148681640625, 0.224609375, 0.1832275390625, 0.1148681640625, 0.103271484375, 0.2017822265625, 0.0079345703125, 0.00830078125, 0.07379150390625, 0.037...

embed

61331886_c0

61331886

haskell

0

Title: What does "f (a -> b)" type signature mean in Haskell? Problem title: What does "f (a -> b)" type signature mean in Haskell? Tags: haskell, applicative Problem: What does "f (a -> b)" type signature mean in Haskell? I'm trying to understand applicatives in Haskell. Can't figure out what...

What does "f (a -> b)" type signature mean in Haskell? What does "f (a -> b)" type signature mean in Haskell? haskell applicative What Haskell Num Maybe Just What does "f (a -> b)" type signature mean in Haskell? I'm trying to understand applicatives in Haskell. Can't figure out what does foll...

[ 0.012451171875, -0.0054931640625, -0.0093994140625, 0.0150146484375, -0.007080078125, 0.01806640625, 0.00970458984375, 0.0125732421875, -0.004150390625, -0.00173187255859375, -0.0084228515625, -0.033935546875, -0.010986328125, 0.0076904296875, -0.0152587890625, -0.0198974609375, 0.00...

[ 4865, 14602, 420, 11, 20, 1230, 5386, 876, 41502, 10644, 138256, 29459, 23, 20625, 142508, 1556, 41816, 4935, 52782, 83425, 9563, 15, 33079, 28219, 42991, 26366, 2367, 25632, 91084, 111, 10, 442, 32354, 52895, 10750, 107003, 123309, 56037, ...

[ 0.0660400390625, 0.039581298828125, 0.1907958984375, 0.1376953125, 0.116943359375, 0.06109619140625, 0.14306640625, 0.1917724609375, 0.0223388671875, 0.197265625, 0.23779296875, 0.1478271484375, 0.06341552734375, 0.1324462890625, 0.2279052734375, 0.0843505859375, 0.131591796875, 0....

embed

10161009_c0

10161009

haskell

0

Title: Input checks in Haskell data constructors Problem title: Input checks in Haskell data constructors Tags: constructor, haskell, validation Problem: Input checks in Haskell data constructors How can I add input checks to Haskell data constructors? Let's say I have import Data.Time.Calendar data SchedulePeriod = Sc...

Input checks in Haskell data constructors Input checks in Haskell data constructors constructor haskell validation Data.Time.Calendar Input Haskell SchedulePeriod Day Double Show Input checks in Haskell data constructors How can I add input checks to Haskell data constructors? Let's say I have and I want to impose a co...

[ 0.003814697265625, 0.0206298828125, -0.0128173828125, 0.03369140625, -0.0166015625, 0.00506591796875, -0.0140380859375, -0.0078125, -0.01318359375, 0.00079345703125, 0.01007080078125, -0.0220947265625, 0.02783203125, 0.0126953125, -0.0206298828125, -0.0013275146484375, 0.013061523437...

[ 360, 7077, 12765, 7, 23, 20625, 142508, 2053, 64549, 25251, 748, 1556, 44622, 11809, 70059, 33, 1506, 230074, 14, 10013, 107172, 17367, 831, 15190, 107730, 47, 765, 3444, 178451, 158, 2816, 4288, 4034, 86291, 4426, 3564, 15490, 164789, 1064...

[ 0.119140625, 0.18701171875, 0.26708984375, 0.0654296875, 0.0164337158203125, 0.1407470703125, 0.20068359375, 0.1156005859375, 0.175048828125, 0.115234375, 0.015289306640625, 0.13134765625, 0.1259765625, 0.089599609375, 0.08306884765625, 0.0328369140625, 0.07470703125, 0.13842773437...

embed

44754977_c0

44754977

haskell

0

Title: Haskell: How to use type class with generic datatype? Problem title: Haskell: How to use type class with generic datatype? Tags: haskell, typeclass, generics Problem: Haskell: How to use type class with generic datatype? Suppose that I have defined a list like this: data List a = Nil | Cons a (List a) Now I want...

Haskell: How to use type class with generic datatype? Haskell: How to use type class with generic datatype? haskell typeclass generics Haskell How List Nil Cons Ord Haskell: How to use type class with generic datatype? Suppose that I have defined a list like this: Now I want to make sure a List is only instantiated wit...

[ -0.0155029296875, 0.0234375, 0.00994873046875, -0.0164794921875, 0.01434326171875, 0.01318359375, 0.00384521484375, -0.00104522705078125, 0.007171630859375, -0.01507568359375, -0.0174560546875, -0.052734375, 0.0037078857421875, -0.010986328125, -0.02587890625, -0.0012664794921875, 0....

[ 20625, 142508, 11249, 4527, 10644, 18507, 678, 189534, 2053, 50986, 12, 1556, 67413, 32036, 77175, 39215, 35379, 121691, 61924, 5303, 1884, 903, 3444, 3249, 9077, 4734, 34648, 19911, 29458, 7722, 158, 2816, 4288, 32354, 110527, 68034 ]

[ 0.1019287109375, 0.2027587890625, 0.06085205078125, 0.100341796875, 0.265625, 0.26416015625, 0.1055908203125, 0.2303466796875, 0.07489013671875, 0.23095703125, 0.0081787109375, 0.0870361328125, 0.19287109375, 0.15576171875, 0.136962890625, 0.1370849609375, 0.1712646484375, 0.000396...

embed

64800257_c0

64800257

haskell

0

Title: building own function to remove duplicate elements from list in Haskell Problem title: building own function to remove duplicate elements from list in Haskell Tags: haskell Problem: building own function to remove duplicate elements from list in Haskell I'm trying to build a function which will remove all duplic...

building own function to remove duplicate elements from list in Haskell building own function to remove duplicate elements from list in Haskell haskell list Haskell x:xs building own function to remove duplicate elements from list in Haskell I'm trying to build a function which will remove all duplicates from a list. S...

[ -0.015380859375, 0.0299072265625, 0.001953125, -0.0108642578125, 0.003143310546875, -0.001800537109375, -0.0027618408203125, 0.0208740234375, 0.0069580078125, -0.017333984375, -0.004547119140625, -0.009521484375, 0.02197265625, 0.00531005859375, -0.01031494140625, 0.01953125, 0.02294...

[ 33976, 10002, 32354, 47, 87388, 171763, 67, 80854, 1295, 5303, 20625, 142508, 1556, 425, 23, 31577, 45367, 756, 1636, 121691, 4034, 68252, 116, 106, 138, 201, 4734, 3444, 2046, 82449, 15490, 119140, 456, 434, 18781, 25632, 18151, 17368, 88,...

[ 0.166259765625, 0.193115234375, 0.2249755859375, 0.03570556640625, 0.1956787109375, 0.26318359375, 0.141845703125, 0.19775390625, 0.121826171875, 0.187255859375, 0.1435546875, 0.2235107421875, 0.1329345703125, 0.055084228515625, 0.032958984375, 0.041412353515625, 0.1220703125, 0.06...

embed

17258711_c0

17258711

haskell

0

Title: can I make StateP from Control.Proxy an instance of MonadState? Problem title: can I make StateP from Control.Proxy an instance of MonadState? Tags: monads, haskell-pipes, haskell Problem: can I make StateP from Control.Proxy an instance of MonadState? I am changing some code that used to run inside a StateT mon...

can I make StateP from Control.Proxy an instance of MonadState? can I make StateP from Control.Proxy an instance of MonadState? monads haskell-pipes haskell Control.Proxy StateP MonadState StateT Control.Lens can I make StateP from Control.Proxy an instance of MonadState? I am changing some code that used to run inside...

[ -0.0244140625, 0.01708984375, -0.01019287109375, 0.00482177734375, -0.00885009765625, 0.006622314453125, -0.025390625, -0.0194091796875, -0.0240478515625, -0.04345703125, 0.0018310546875, 0.0361328125, 0.01055908203125, 0.0125732421875, -0.00848388671875, 0.0123291015625, -0.01391601...

[ 831, 3249, 22836, 683, 1295, 27131, 10752, 50878, 110527, 60331, 71, 135206, 13, 5, 2667, 712, 1556, 142508, 1434, 13569, 618, 866, 1755, 151134, 18151, 11675, 46132, 1745, 39933, 144570, 46002, 32399, 15190, 26785, 34831, 35773 ]

[ 0.074462890625, 0.05572509765625, 0.146728515625, 0.2056884765625, 0.0723876953125, 0.2056884765625, 0.1287841796875, 0.221923828125, 0.2147216796875, 0.147216796875, 0.112060546875, 0.2012939453125, 0.08502197265625, 0.0150604248046875, 0.07958984375, 0.1207275390625, 0.034332275390...

embed

18175405_c0

18175405

haskell

0

Title: Why haskell use a type of ReadS a to represent a function? Problem title: Why haskell use a type of ReadS a to represent a function? Tags: haskell, function Problem: Why haskell use a type of ReadS a to represent a function? I am reading the source code of reads . reads is defined as reads :: Read a => ReadS a S...

Why haskell use a type of ReadS a to represent a function? Why haskell use a type of ReadS a to represent a function? haskell function Why ReadS Read Why haskell use a type of ReadS a to represent a function? I am reading the source code of reads . reads is defined as reads :: Read a => ReadS a So it simply returns Rea...

[ 0.0152587890625, -0.0026397705078125, 0.015625, 0.0179443359375, -0.01446533203125, 0.00518798828125, 0.007659912109375, -0.00970458984375, -0.0020599365234375, 0.00518798828125, 0.0267333984375, -0.032470703125, -0.0272216796875, -0.00191497802734375, 0.0177001953125, -0.0147094726562...

[ 44084, 1556, 142508, 4527, 10644, 4764, 294, 10, 33636, 32354, 47, 111, 16454, 31344, 18151, 12301, 7, 61924, 237, 42856, 30646, 12960, 110527, 23351, 33079, 11, 214, 13580, 176377, 1295, 4734, 5646, 79315, 10298, 370, 8705, 15400, 15490, 1...

[ 0.1163330078125, 0.137939453125, 0.2225341796875, 0.09326171875, 0.1722412109375, 0.2496337890625, 0.160400390625, 0.1734619140625, 0.21142578125, 0.1680908203125, 0.0249481201171875, 0.017181396484375, 0.033203125, 0.09814453125, 0.0498046875, 0.24365234375, 0.1629638671875, 0.149...

embed

43308131_c0

43308131

haskell

0

Title: How to print a mult-line string with `putStrLn`? Problem title: How to print a mult-line string with `putStrLn`? Tags: haskell Problem: How to print a mult-line string with `putStrLn`? I am writing a very simple program in Haskell that asks the user for a name and then displays some text based on that name. I ca...

How to print a mult-line string with `putStrLn`? How to print a mult-line string with `putStrLn`? haskell How How to print a mult-line string with `putStrLn`? I am writing a very simple program in Haskell that asks the user for a name and then displays some text based on that name. I can get the program to work, but I ...

[ -0.00095367431640625, -0.00933837890625, -0.01141357421875, 0.037109375, 0.00079345703125, 0.01483154296875, 0.003692626953125, -0.0048828125, -0.008544921875, 0.00604248046875, 0.0030364990234375, -0.0162353515625, -0.00787353515625, 0.0172119140625, -0.01361083984375, 0.0117797851562...

[ 11249, 47, 28412, 3869, 9, 2256, 79315, 678, 7077, 71713, 866, 19, 1556, 142508, 32562, 4552, 8781, 1528, 20625, 26458, 38937, 9351, 44116, 7986, 35509, 4488, 1884, 125429, 10001, 49726, 111, 10, 7515, 3229, 107730, 759, 25, 1974, 1660, 1...

[ 0.0830078125, 0.0215911865234375, 0.206787109375, 0.253173828125, 0.040283203125, 0.1900634765625, 0.2374267578125, 0.07513427734375, 0.1932373046875, 0.211181640625, 0.13525390625, 0.1544189453125, 0.09814453125, 0.222412109375, 0.07421875, 0.00677490234375, 0.064697265625, 0.1033...

embed

43850946_c0

43850946

haskell

0

Title: haskell error parse error on input '|' Problem title: haskell error parse error on input '|' Tags: haskell, parsing, input, greatest-common-divisor Problem: haskell error parse error on input '|' I'm trying to write a Greatest Common Divisor function in haskell. This is what I have so far: gc...

haskell error parse error on input '|' haskell error parse error on input '|' haskell parsing input greatest-common-divisor gcd1 haskell error parse error on input '|' I'm trying to write a Greatest Common Divisor function in haskell. This is what I have so far: When I try to compile, I get that err...

[ -0.01025390625, 0.01611328125, -0.01409912109375, -0.0093994140625, 0.0006103515625, 0.000644683837890625, -0.00775146484375, -0.02783203125, -0.006103515625, -0.027587890625, 0.00579833984375, -0.0003509521484375, 0.004302978515625, -0.010009765625, 0.00982666015625, -0.00640869140625...

[ 1556, 142508, 18499, 366, 184, 98, 107730, 3768, 158036, 277, 3796, 428, 51858, 22109, 71, 418, 58745, 87, 31577, 33022, 32774, 525, 151301, 803, 32354, 23, 2060, 14847, 9790, 9969, 1340, 2046, 450, 12301, 4527, 35011, 32628, 83324, 7440, ...

[ 0.168701171875, 0.261962890625, 0.242919921875, 0.173828125, 0.116943359375, 0.09320068359375, 0.212158203125, 0.102294921875, 0.16748046875, 0.055999755859375, 0.14697265625, 0.133544921875, 0.266357421875, 0.09344482421875, 0.10565185546875, 0.100830078125, 0.00347900390625, 0.00...

embed

4703576_c0

4703576

haskell

0

Title: Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Problem title: Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Tags: haskell, functional-programming Problem: Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Why does map (^2) [1..10] work and also map ...

Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Why do both map (^2) xs and map (2^) xs work as expected in Haskell? haskell functional-programming Why Haskell Why do both map (^2) xs and map (2^) xs work as expected in Haskell? Why does work and also work? I'd expect it only to work with one of th...

[ 0.00823974609375, 0.0014801025390625, 0.003387451171875, -0.010009765625, 0.00885009765625, 0.01904296875, -0.0019073486328125, 0.00775146484375, 0.006195068359375, -0.005859375, 0.00860595703125, -0.0087890625, -0.0002956390380859375, -0.0024261474609375, -0.01123046875, -0.0206298828...

[ 44084, 15044, 22288, 8353, 10461, 1022, 7, 136, 4700, 4488, 237, 84751, 20625, 142508, 1556, 123309, 28966, 54, 23, 14602, 2843, 71, 41206, 4734, 678, 1632, 2856, 959, 100, 17569, 2806, 8560, 645, 756, 80854, 68252, 5, 963, 11180, 19388, ...

[ 0.11083984375, 0.111572265625, 0.23095703125, 0.16845703125, 0.213623046875, 0.1649169921875, 0.1348876953125, 0.0479736328125, 0.11669921875, 0.1451416015625, 0.0810546875, 0.1624755859375, 0.153076171875, 0.263671875, 0.0997314453125, 0.0921630859375, 0.02532958984375, 0.00558471...

embed

33580535_c0

33580535

haskell

0

Title: trying to learn while solving some basic haskell problems Problem title: trying to learn while solving some basic haskell problems Tags: haskell Problem: trying to learn while solving some basic haskell problems I am new to haskell and trying out some exercise.While trying to load the below code i am getting a b...

trying to learn while solving some basic haskell problems trying to learn while solving some basic haskell problems haskell howmanyequal::Int trying to learn while solving some basic haskell problems I am new to haskell and trying out some exercise.While trying to load the below code i am getting a binding error howman...

[ -0.010986328125, 0.0179443359375, -0.01104736328125, 0.004364013671875, -0.00347900390625, 0.015869140625, -0.0036163330078125, -0.0220947265625, -0.011962890625, -0.00171661376953125, -0.0093994140625, -0.028076171875, 0.034423828125, 0.0067138671875, 0.004852294921875, -0.00946044921...

[ 31577, 30698, 12960, 3115, 62822, 1556, 142508, 44402, 3642, 669, 1033, 71723, 4153, 18, 3060, 3525, 81979, 72367, 35064, 18151, 128239, 18499, 53, 55547, 13, 32354, 54694, 22936, 14192, 121742, 16940 ]

[ 0.1302490234375, 0.11376953125, 0.07928466796875, 0.0736083984375, 0.0975341796875, 0.128173828125, 0.1890869140625, 0.0882568359375, 0.1585693359375, 0.131591796875, 0.0928955078125, 0.2373046875, 0.01531982421875, 0.0909423828125, 0.00048828125, 0.06951904296875, 0.0389404296875, ...

embed

39557158_c1

39557158

haskell

1

.1, cabal 1.24, llvm-3.8.1 . I installed llvm-general by cloning the llvm-3.8 branch and running cabal install with -fshared-llvm. I assure you I have ncurses installed, also libcurses.so file is a symlink to /usr/lib/libncurses.so , I also have /usr/lib/libncursesw.so (which is also a symlink to /usr/lib/libncursesw.s...

[ 0.002410888671875, 0.01116943359375, -0.00286865234375, 0.01470947265625, 0.00384521484375, -0.0079345703125, 0.0103759765625, -0.0174560546875, -0.00897216796875, -0.016845703125, -0.00135040283203125, -0.0294189453125, 0.002288818359375, -0.01055908203125, -0.0084228515625, -0.013244...

[ 5, 418, 109524, 2357, 96, 3723, 39, 8316, 206730, 87, 20600, 180300, 20450, 135527, 32845, 51042, 678, 420, 67886, 1181, 334, 92784, 765, 653, 48650, 90, 297, 25474, 991, 11435, 954, 10187, 5612, 434, 910, 21672, 11787, 83, 63590, 29908, ...

[ 0.046783447265625, 0.05133056640625, 0.24560546875, 0.135009765625, 0.027191162109375, 0.159912109375, 0.1514892578125, 0.05126953125, 0.157958984375, 0.01922607421875, 0.1322021484375, 0.1822509765625, 0.095947265625, 0.166015625, 0.05267333984375, 0.00921630859375, 0.01425170898437...

embed

40448260_c0

40448260

haskell

0

Title: Moving average in Haskell Problem title: Moving average in Haskell Tags: weighted-average, arrays, haskell, moving-average Problem: Moving average in Haskell Given a list of weights: let weights = [0.1, 0.2, 0.4, 0.2, 0.1] and an array of measurements, I want to implement the weighted average. This is how I woul...

Moving average in Haskell Moving average in Haskell weighted-average arrays haskell moving-average Moving Haskell n-3 n-2 n-1 Moving average in Haskell Given a list of weights: and an array of measurements, I want to implement the weighted average. This is how I would do it in Python: I know Haskell doesn't have arrays...

[ -0.0038909912109375, 0.021484375, -0.020263671875, -0.007537841796875, -0.00787353515625, 0.0064697265625, -0.006378173828125, 0.01202392578125, 0.021484375, -0.0150146484375, 0.0001010894775390625, -0.0220947265625, -0.00048065185546875, -0.01116943359375, -0.024658203125, 0.005157470...

[ 2501, 6496, 83080, 23, 20625, 142508, 57888, 297, 8216, 29838, 10298, 4778, 1556, 98567, 8316, 5428, 5759, 5303, 72350, 9035, 3444, 29479, 3642, 2806, 145581, 22027, 18, 765, 31577, 69307, 27226, 13409, 120337, 61924, 23009 ]

[ 0.1085205078125, 0.088623046875, 0.2393798828125, 0.04730224609375, 0.16015625, 0.2783203125, 0.2203369140625, 0.1119384765625, 0.1844482421875, 0.1474609375, 0.128173828125, 0.1002197265625, 0.1583251953125, 0.177978515625, 0.1524658203125, 0.1048583984375, 0.08837890625, 0.117553...

embed

46633608_c0

46633608

haskell

0

Title: How do I add a CPP defininition within cabal / stack? Problem title: How do I add a CPP defininition within cabal / stack? Tags: haskell, haskell-stack, cabal Problem: How do I add a CPP defininition within cabal / stack? I'm looking at the following module: https://hackage.haskell.org/package/boxes-0.1.4/docs/s...

How do I add a CPP defininition within cabal / stack? How do I add a CPP defininition within cabal / stack? haskell haskell-stack cabal How CPP Text.PrettyPrint.Boxes Constructing TESTING Box How do I add a CPP defininition within cabal / stack? I'm looking at the following module: https://hackage.haskell.org/package/b...

[ 0.0142822265625, -0.0002994537353515625, 0.00946044921875, 0.00946044921875, 0.012451171875, -0.00335693359375, 0.01177978515625, 0.00396728515625, 0.0032806396484375, 0.01019287109375, 0.006011962890625, -0.03857421875, 0.0032501220703125, -0.0029449462890625, -0.000919342041015625, 0...

[ 11249, 15190, 10, 313, 17487, 13204, 93, 1363, 28032, 109524, 248, 177261, 1556, 142508, 590, 2594, 24129, 19273, 15145, 112079, 72295, 90, 36716, 31273, 68151, 27271, 16487, 88996, 139509, 4588, 10557, 29102, 11728, 102014, 174379, 18, 10941, ...

[ 0.06695556640625, 0.16259765625, 0.050079345703125, 0.106689453125, 0.337158203125, 0.2054443359375, 0.1080322265625, 0.0628662109375, 0.13671875, 0.2376708984375, 0.0504150390625, 0.20263671875, 0.08056640625, 0.186279296875, 0.058868408203125, 0.06494140625, 0.133544921875, 0.074...

embed

9963050_c0

9963050

haskell

0

Title: Standard way of joining two Data.Texts without `mappend` Problem title: Standard way of joining two Data.Texts without `mappend` Tags: haskell Problem: Standard way of joining two Data.Texts without `mappend` I hear that Data.Text is going to replace String s in future Haskell versions. One issue I have with thi...

Standard way of joining two Data.Texts without `mappend` Standard way of joining two Data.Texts without `mappend` haskell Standard Data.Texts Data.Text Text text1 text2 Standard way of joining two Data.Texts without `mappend` I hear that Data.Text is going to replace String s in future Haskell versions. One issue I hav...

[ 0.01434326171875, -0.00634765625, 0.003509521484375, 0.0224609375, 0.0034332275390625, 0.0010986328125, -0.0003414154052734375, 0.01953125, 0.023193359375, -0.034423828125, 0.0223388671875, -0.01165771484375, -0.00023555755615234375, -0.019287109375, 0.007476806640625, -0.0023651123046...

[ 20744, 3917, 33284, 214, 6626, 11809, 174379, 15490, 192, 9858, 71, 1556, 142508, 24129, 7986, 418, 304, 36802, 5, 91995, 23351, 91, 22690, 20625, 11389, 31089, 37223, 61924, 100, 5303, 4734, 158, 33478, 76, 67, 4527, 130078, 62163, 57823, ...

[ 0.2091064453125, 0.1016845703125, 0.20263671875, 0.083251953125, 0.1781005859375, 0.1513671875, 0.26123046875, 0.127197265625, 0.1270751953125, 0.1343994140625, 0.1119384765625, 0.12646484375, 0.218994140625, 0.21142578125, 0.1341552734375, 0.031005859375, 0.1202392578125, 0.019683...

embed

6557808_c0

6557808

haskell

0

Title: Understanding type Problem title: Understanding type Tags: haskell Problem: Understanding type A few questions about the Haskell programming language: What's the difference between these two code statements? I'm convinced they should be the same: type T = [Char] type CurrentValue = Char My concern is that, in th...

Understanding type Understanding type haskell Understanding Char CurrentValue Maybe Understanding type A few questions about the Haskell programming language: What's the difference between these two code statements? I'm convinced they should be the same: My concern is that, in the second one, there are no brackets. Any...

[ 0.01007080078125, -0.0169677734375, 0.0025787353515625, 0.034912109375, 0.00689697265625, 0.01348876953125, -0.012451171875, -0.005157470703125, 0.0037384033203125, 0.00762939453125, 0.002166748046875, -0.0263671875, -0.00250244140625, 0.003143310546875, -0.0166015625, 0.013916015625, ...

[ 9626, 144057, 10644, 1556, 142508, 21656, 114063, 856, 50770, 83425, 10846, 17582, 20625, 56037, 46876, 60212, 17721, 6626, 18151, 63805, 5701, 50509, 17932, 110, 1620, 27853, 21635, 5256, 83, 23351, 214, 436, 84068, 32354, 10750, 391, 82419, ...

[ 0.1356201171875, 0.1600341796875, 0.2685546875, 0.1302490234375, 0.2498779296875, 0.2225341796875, 0.1739501953125, 0.1131591796875, 0.1141357421875, 0.2261962890625, 0.0399169921875, 0.0531005859375, 0.1351318359375, 0.0726318359375, 0.1158447265625, 0.14697265625, 0.07318115234375,...

embed

68749693_c0

68749693

haskell

0

Title: Haskell Character in String function Problem title: Haskell Character in String function Tags: string, haskell, character, list Problem: Haskell Character in String function Hey I'm a pretty new beginner to Haskell and I am having a small problem. I want to write a function which checks if a given character is i...

Haskell Character in String function Haskell Character in String function string haskell character list Haskell Character Char Bool x:xs Parse Haskell Character in String function Hey I'm a pretty new beginner to Haskell and I am having a small problem. I want to write a function which checks if a given character is in...

[ -0.007476806640625, 0.01104736328125, -0.0023651123046875, 0.028076171875, -0.0024566650390625, 0.023681640625, 0.01287841796875, -0.007110595703125, -0.003875732421875, -0.0016632080078125, 0.02294921875, -0.038818359375, -0.00531005859375, 0.0135498046875, -0.0218505859375, 0.0161132...

[ 20625, 142508, 21656, 2263, 720, 23, 23351, 214, 32354, 79315, 1556, 62816, 5303, 2460, 929, 1022, 12, 425, 2392, 184, 28240, 28875, 3525, 9842, 1679, 19441, 19336, 2967, 3444, 33022, 12765, 2174, 34475, 83, 11853, 759, 18151, 15787, 10422,...

[ 0.15234375, 0.2431640625, 0.1636962890625, 0.160888671875, 0.10498046875, 0.1888427734375, 0.2196044921875, 0.166015625, 0.1815185546875, 0.240966796875, 0.129638671875, 0.227783203125, 0.1336669921875, 0.078857421875, 0.1688232421875, 0.058502197265625, 0.00897216796875, 0.0930175...

embed

63970480_c0

63970480

haskell

0

Title: How does Haskell runtime represent lazy values? Problem title: How does Haskell runtime represent lazy values? Tags: internal-representation, lazy-evaluation, pointers, haskell Problem: How does Haskell runtime represent lazy values? I don't even know how to express this question. A assume there's a pointer to a...

How does Haskell runtime represent lazy values? How does Haskell runtime represent lazy values? internal-representation lazy-evaluation pointers haskell How Haskell How does Haskell runtime represent lazy values? I don't even know how to express this question. A assume there's a pointer to a non evaluated expression. I...

[ -0.003509521484375, 0.00775146484375, 0.021728515625, 0.01141357421875, -0.006866455078125, 0.025390625, -0.00188446044921875, 0.002777099609375, 0.001983642578125, 0.006591796875, -0.003936767578125, -0.0089111328125, 0.003814697265625, 0.00775146484375, 0.005401611328125, 0.023925781...

[ 11249, 20625, 142508, 11675, 6032, 33636, 21, 3285, 142424, 70796, 205913, 159258, 6275, 1314, 1556, 14602, 3714, 36510, 41591, 56, 47, 351, 151575, 125195, 50336, 81113, 32354, 552, 34292, 91995, 44691, 11907, 49938, 13254, 2809, 959, 219836, ...

[ 0.060302734375, 0.135498046875, 0.26220703125, 0.1055908203125, 0.15478515625, 0.205322265625, 0.1448974609375, 0.226806640625, 0.21533203125, 0.096435546875, 0.151123046875, 0.1431884765625, 0.160888671875, 0.07830810546875, 0.118408203125, 0.043365478515625, 0.0186614990234375, 0...

embed

12278716_c0

12278716

haskell

0

Title: Haskell triangle microbenchmark Problem title: Haskell triangle microbenchmark Tags: haskell, ghc Problem: Haskell triangle microbenchmark int main(void) { int a,b,c, N=1000; int cnt = 0; for (a=1;a<=N;a++) for (b=1;b<=N;b++) for (c=1;c<=N;c++) if (a*a+b*b==c*c) cnt++; printf("%d\n", cnt); } Compilation: Haskell...

Haskell triangle microbenchmark Haskell triangle microbenchmark haskell ghc Haskell stdio.h triangle.hs triangle.c Haskell triangle microbenchmark Consider this simple "benchmark": and appropriate C version: Compilation: Haskell version is compiled as: ghc -O2 triangle.hs (ghc 7.4.1) C version is compiled as: gcc -O2 -...

[ -0.00531005859375, -0.0107421875, 0.01373291015625, -0.0013275146484375, 0.004486083984375, -0.002655029296875, -0.00799560546875, -0.013916015625, -0.004608154296875, -0.0400390625, -0.01458740234375, -0.016357421875, 0.0032806396484375, -0.010986328125, -0.0225830078125, -0.000328063...

[ 20625, 142508, 1927, 109217, 11948, 776, 206, 10015, 1556, 31380, 238, 6138, 5670, 127, 137399, 8781, 95307, 313, 11389, 15612, 14, 57860, 375, 5974, 237, 20, 670, 304, 15, 9486, 2861, 120518, 22109, 177, 10060, 1398, 200768, 28398, 20028, ...

[ 0.2042236328125, 0.279296875, 0.19189453125, 0.20654296875, 0.1497802734375, 0.1671142578125, 0.1632080078125, 0.1695556640625, 0.1158447265625, 0.1351318359375, 0.102294921875, 0.052001953125, 0.1409912109375, 0.111572265625, 0.0220184326171875, 0.099853515625, 0.0882568359375, 0....

embed

26735523_c1

26735523

haskell

1

d = c : shuffle g' d' where (c, g') = oneRandomCard g d d' = d\\[c] oneRandomCard :: StdGen -> [Card] -> (Card, StdGen) oneRandomCard g d =((last $ take n d), g1 ) where (n,g1) = randomR (1, length d) g I see that in a first look this question seems trivial, but given the way that haskell treats randomness I thought i...

[ 0.00299072265625, 0.0162353515625, 0.006072998046875, -0.00167083740234375, 0.0208740234375, -0.005950927734375, -0.00021076202392578125, -0.01123046875, 0.0009002685546875, -0.046630859375, 0.005828857421875, 0.0439453125, -0.02783203125, 0.00927734375, -0.0087890625, 0.0074462890625,...

[ 104, 2203, 501, 152, 170052, 706, 25, 7440, 238, 1632, 126525, 3815, 156119, 1984, 2907, 71, 105376, 19777, 3650, 5646, 653, 418, 19, 177, 17727, 96759, 1052, 2858, 140909, 5117, 6713, 9655, 37202, 686, 1556, 142508, 85689, 7432, 17569, 4...

[ 0.2008056640625, 0.10186767578125, 0.07293701171875, 0.029876708984375, 0.304443359375, 0.108154296875, 0.121826171875, 0.0277557373046875, 0.0272216796875, 0.14697265625, 0.1575927734375, 0.1939697265625, 0.2354736328125, 0.0205535888671875, 0.12158203125, 0.121337890625, 0.17150878...

embed

74100154_c0

74100154

haskell

0

Title: Haskell list of pairs to pairs of lists Problem title: Haskell list of pairs to pairs of lists Tags: tuples, recursion, list, haskell Problem: Haskell list of pairs to pairs of lists I have seen here, that there are several approaches to solve it, but I am struggling to solve it with recursion. Example: [("a",1)...

Haskell list of pairs to pairs of lists Haskell list of pairs to pairs of lists tuples recursion list haskell Haskell Haskell list of pairs to pairs of lists I have seen here, that there are several approaches to solve it, but I am struggling to solve it with recursion. Example: [("a",1), ("b",2)] to (["a","b"] ,[1,2])...

[ -0.00848388671875, 0.0076904296875, 0.00144195556640625, 0.020751953125, -0.0028533935546875, 0.031494140625, -0.00830078125, -0.0230712890625, 0.006072998046875, -0.01202392578125, 0.0123291015625, -0.01904296875, 0.006500244140625, 0.01068115234375, -0.005462646484375, 0.001518249511...

[ 20625, 142508, 5303, 111, 80836, 7, 47, 370, 99726, 195625, 1830, 1556, 51515, 86869, 237875, 678, 89536, 378, 11, 830, 17727, 275, 10461, 133063, 2060, 37842, 132887, 8335, 481, 132, 4, 1022, 2203, 997, 171259, 22027, 18, 4488, 6528 ]

[ 0.1531982421875, 0.1910400390625, 0.2232666015625, 0.1080322265625, 0.258056640625, 0.093994140625, 0.1688232421875, 0.08251953125, 0.115478515625, 0.1925048828125, 0.08172607421875, 0.139404296875, 0.07122802734375, 0.10400390625, 0.078125, 0.013671875, 0.0638427734375, 0.00701904...

embed

44505728_c0

44505728

haskell

0

Title: How to read stdin in a Haskell program with command-line arguments? Problem title: How to read stdin in a Haskell program with command-line arguments? Tags: stdin, haskell, command-line-arguments Problem: How to read stdin in a Haskell program with command-line arguments? I know I can use interact :: (String -> ...

How to read stdin in a Haskell program with command-line arguments? How to read stdin in a Haskell program with command-line arguments? stdin haskell command-line-arguments How Haskell How to read stdin in a Haskell program with command-line arguments? I know I can use interact :: (String -> String) -> IO () to conveni...

[ -0.00970458984375, -0.005218505859375, 0.005615234375, 0.008056640625, -0.002197265625, 0.0079345703125, 0.02001953125, -0.01531982421875, -0.0091552734375, -0.0390625, 0.0035858154296875, -0.0174560546875, -0.010986328125, -0.0072021484375, 0, -0.0157470703125, 0.00439453125, -0.0...

[ 11249, 47, 12301, 6138, 3035, 23, 20625, 142508, 1528, 678, 75101, 2256, 10750, 1556, 155937, 9, 3714, 831, 4527, 78974, 1984, 71713, 33079, 23351, 17780, 142267, 1295, 33022, 246, 1003, 8781, 796, 7232, 7, 73, 7077, 2940, 6056, 15190, 32...

[ 0.0806884765625, 0.0777587890625, 0.2281494140625, 0.1925048828125, 0.24462890625, 0.06573486328125, 0.1478271484375, 0.2412109375, 0.1676025390625, 0.066650390625, 0.1949462890625, 0.168701171875, 0.22119140625, 0.1217041015625, 0.1854248046875, 0.031158447265625, 0.004150390625, ...

embed

47325859_c0

47325859

haskell

0

Title: how to see the implemented code of a function of a module in haskell? Problem title: how to see the implemented code of a function of a module in haskell? Tags: functional-programming, module, haskell Problem: how to see the implemented code of a function of a module in haskell? I am a newbie to Haskell and I kn...

how to see the implemented code of a function of a module in haskell? how to see the implemented code of a function of a module in haskell? functional-programming module haskell how to see the implemented code of a function of a module in haskell? I am a newbie to Haskell and I know The Haskell standard library is spli...

[ 0.0150146484375, -0.002410888671875, 0.00665283203125, 0.0269775390625, 0.0205078125, 0.0196533203125, 0.009765625, -0.01446533203125, -0.007568359375, -0.029052734375, 0.0052490234375, -0.04150390625, 0.0113525390625, -0.01611328125, 0.00360107421875, -0.0125732421875, -0.0005035400...

[ 3642, 47, 1957, 70, 29479, 18151, 111, 32354, 88996, 23, 1556, 142508, 123309, 28966, 3525, 9014, 20625, 5570, 35773, 1294, 65450, 3934, 70541, 52895, 62548, 39210, 60042, 1884, 208124, 40899, 136913, 831, 75101, 31380, 318, 65514 ]

[ 0.08038330078125, 0.09625244140625, 0.1829833984375, 0.052093505859375, 0.253662109375, 0.24658203125, 0.0596923828125, 0.1748046875, 0.218017578125, 0.0660400390625, 0.13916015625, 0.2344970703125, 0.1229248046875, 0.05218505859375, 0.00811767578125, 0.07818603515625, 0.128662109375...

embed

8443035_c0

8443035

haskell

0

Title: Multi-line commands in GHCi Problem title: Multi-line commands in GHCi Tags: haskell, multiline-repl-definition, ghci Problem: Multi-line commands in GHCi I am having problem in entering multi-line commands in ghci. The following 2-line code works from a file: addTwo :: Int -> Int -> Int addTwo x y = x + y But w...

Multi-line commands in GHCi Multi-line commands in GHCi haskell multiline-repl-definition ghci Multi-line GHCi Variable Multi-line commands in GHCi I am having problem in entering multi-line commands in ghci. The following 2-line code works from a file: But when I enter in ghci, I get an error: I also tried putting the...

[ -0.0093994140625, 0.005096435546875, -0.000972747802734375, 0.031494140625, 0.00128936767578125, 0.0133056640625, 0.0020599365234375, 0.0011444091796875, 0.0037841796875, -0.0189208984375, -0.005615234375, -0.0194091796875, -0.01495361328125, 0.01904296875, 0.0068359375, 0.002182006835...

[ 19335, 2256, 75101, 527, 73265, 14, 23, 1556, 142508, 6024, 107, 2424, 49919, 31380, 318, 84572, 2967, 22, 33558, 25632, 4720, 18151, 43240, 1295, 11435, 30957, 18499, 46132, 153, 959, 20697, 27781, 96819, 124519, 3934, 1632, 13315, 17686, ...

[ 0.2060546875, 0.2237548828125, 0.243896484375, 0.0887451171875, 0.13134765625, 0.224853515625, 0.0592041015625, 0.0806884765625, 0.1842041015625, 0.186767578125, 0.03826904296875, 0.133056640625, 0.09722900390625, 0.144287109375, 0.21337890625, 0.1138916015625, 0.08660888671875, 0....

embed

58905982_c0

58905982

haskell

0

Title: Having "parse error on input ‘->’" in a case of Problem title: Having "parse error on input ‘->’" in a case of Tags: haskell Problem: Having "parse error on input ‘->’" in a case of I'm having a weird error in this simple haskell code. I confirm I'm using spaces everywhere and I don't s...

Having "parse error on input ‘->’" in a case of Having "parse error on input ‘->’" in a case of haskell Having Maybe Just There Nothing Having "parse error on input ‘->’" in a case of I'm having a weird error in this simple haskell code. I confirm I'm using spaces everywhere and I don't see an...

[ -0.0076904296875, 0.00482177734375, -0.0186767578125, -0.004913330078125, 0.00469970703125, 0.01361083984375, -0.000278472900390625, -0.0069580078125, 0.01300048828125, -0.029052734375, 0.00086212158203125, 0.01129150390625, -0.004730224609375, -0.01190185546875, 0.0050048828125, -0.01...

[ 171855, 2500, 184, 18499, 98, 107730, 9, 1230, 5386, 7225, 41502, 26, 1556, 142508, 83425, 9563, 8622, 182747, 103607, 111, 19441, 179459, 23, 903, 8781, 18151, 39563, 17368, 32628, 7, 219743, 2967, 18597, 22062, 132283, 6002, 86531 ]

[ 0.0833740234375, 0.147216796875, 0.1578369140625, 0.2138671875, 0.05206298828125, 0.169677734375, 0.10467529296875, 0.0251922607421875, 0.1666259765625, 0.07196044921875, 0.0185089111328125, 0.009857177734375, 0.1529541015625, 0.2379150390625, 0.152099609375, 0.06939697265625, 0.1131...

embed

60941240_c0

60941240

haskell

0

Title: "Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell Problem title: "Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell Tags: cabal, haskell Problem: "C...

"Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell "Could not load module ‘Control.Monad.State’ It is a member of the hidden package ‘mtl-2.2.2’" error upon using runhaskell cabal haskell Control.Exception runhaskell Test.Hspec ...

[ -0.012939453125, -0.0206298828125, -0.006927490234375, 0.003326416015625, -0.0000762939453125, 0.016845703125, 0.00836181640625, -0.00433349609375, -0.017822265625, -0.02587890625, -0.0030670166015625, -0.00634765625, -0.01165771484375, -0.004974365234375, 0.00445556640625, -0.00103759...

[ 52366, 959, 72367, 88996, 175904, 46674, 712, 135206, 32786, 204105, 98169, 39, 18, 141, 5428, 70147, 18499, 11675, 10557, 142508, 109524, 1556, 27131, 8647, 16711, 202567, 167599, 137989, 56359, 11809, 166179, 217225, 191147, 347, 5337, 47107, ...

[ 0.07177734375, 0.0833740234375, 0.2122802734375, 0.2244873046875, 0.231689453125, 0.07501220703125, 0.1168212890625, 0.1739501953125, 0.1864013671875, 0.20947265625, 0.2127685546875, 0.06414794921875, 0.1561279296875, 0.1973876953125, 0.118896484375, 0.2291259765625, 0.1165771484375,...

embed

12878651_c1

12878651

haskell

1

in some format. Why? Here's the application. A is "Download a file from an FTP server." B is "convert from flac to mp3". A contains username, password, port, etc. information. B contains file path information. There could be MANY As and Bs. Hundreds. As many as people are willing to compile into the program. Two was j...

[ 0.009765625, -0.01904296875, 0.0067138671875, 0.003387451171875, -0.0189208984375, 0.01434326171875, -0.004730224609375, -0.00019359588623046875, 0.0289306640625, 0.0263671875, 0.0062255859375, -0.0123291015625, 0.006439208984375, 0.017578125, -0.0296630859375, -0.01239013671875, 0.0...

[ 23, 3060, 9384, 44084, 11853, 38415, 62, 83, 144786, 11435, 162379, 10723, 335, 2271, 11549, 174911, 47, 9607, 363, 70541, 38937, 11627, 78506, 11469, 4677, 60875, 5809, 186, 276, 93333, 1301, 136, 49083, 5941, 3395, 109269, 9969, 1340, 393...

[ 0.1082763671875, 0.07000732421875, 0.2164306640625, 0.0966796875, 0.0267333984375, 0.1773681640625, 0.0723876953125, 0.030792236328125, 0.1134033203125, 0.091552734375, 0.15966796875, 0.07708740234375, 0.07452392578125, 0.0089111328125, 0.096435546875, 0.1483154296875, 0.025588989257...

embed

35161616_c0

35161616

haskell

0

Title: Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? Problem title: Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? Tags: haskell, haskell-pipes Problem: Why does Haskell Pipes...

Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? Why does Haskell Pipes "use () to close unused inputs and X (the uninhabited type) to close unused outputs"? haskell haskell-pipes Why Haskell Pipes Why does Haskell Pipes "use () to close un...

[ -0.00162506103515625, 0.02197265625, 0.007080078125, -0.0027618408203125, -0.03173828125, 0.01025390625, -0.016845703125, -0.013671875, -0.007659912109375, 0.0245361328125, -0.0072021484375, -0.0299072265625, 0.01544189453125, 0.0186767578125, 0.009521484375, -0.003265380859375, 0.00...

[ 44084, 20625, 142508, 93128, 90, 41502, 4032, 15, 20903, 51, 33740, 107730, 136, 1193, 73, 54815, 10644, 47, 140992, 14602, 1556, 1434, 13569, 183447, 1884, 28219, 15400, 621, 11814, 3917, 1836, 959, 707, 16, 100, 15044 ]

[ 0.1446533203125, 0.142578125, 0.246337890625, 0.2022705078125, 0.16357421875, 0.005889892578125, 0.1492919921875, 0.09814453125, 0.174560546875, 0.05743408203125, 0.16845703125, 0.2017822265625, 0.1436767578125, 0.213134765625, 0.029571533203125, 0.12841796875, 0.1419677734375, 0.0...

embed

29414360_c0

29414360

haskell

0

Title: Can I automatically implement classes? Problem title: Can I automatically implement classes? Tags: scalaz, haskell Problem: Can I automatically implement classes? In Scalaz every Monad instance is automatically an instance of Applicative . implicit val listInstance = new Monad[List] { def point[A](a: => A) = Lis...

Can I automatically implement classes? Can I automatically implement classes? scalaz haskell Can Monad Applicative List Works Arrow Profunctor Can I automatically implement classes? In Scalaz every Monad instance is automatically an instance of Applicative . Another example: Arrow is automatically a Profunctor . Howeve...

[ -0.003692626953125, 0.0162353515625, 0.002044677734375, 0.020263671875, -0.015869140625, 0.033447265625, -0.00099945068359375, 0.00958251953125, 0.01043701171875, -0.0086669921875, 0.004180908203125, -0.0220947265625, -0.01519775390625, 0.010009765625, -0.01220703125, -0.00982666015625...

[ 4171, 87, 191082, 29479, 61112, 146232, 169, 1556, 142508, 60331, 71, 5659, 11048, 4935, 32036, 27985, 1172, 15555, 11739, 309, 18770, 152653, 1828, 11907, 110527, 83, 27781, 10, 33306, 23, 20625, 8110, 22691, 13438, 7722, 71864, 57346, 12447...

[ 0.115478515625, 0.0794677734375, 0.26025390625, 0.239501953125, 0.2457275390625, 0.1622314453125, 0.1490478515625, 0.095458984375, 0.262939453125, 0.1666259765625, 0.1309814453125, 0.1192626953125, 0.1666259765625, 0.172607421875, 0.158203125, 0.095703125, 0.07269287109375, 0.20336...

embed

72958489_c0

72958489

haskell

0

Title: Understanding Haskell realToFrac function Problem title: Understanding Haskell realToFrac function Tags: haskell, kotlin Problem: Understanding Haskell realToFrac function I meed to migrate some Haskell code to Kotlin and I have some confusion trying yo understand the next code: floor ((realToFrac minutes :: Dou...

Understanding Haskell realToFrac function Understanding Haskell realToFrac function haskell kotlin Understanding Haskell Double Understanding Haskell realToFrac function I meed to migrate some Haskell code to Kotlin and I have some confusion trying yo understand the next code: minutes is a integer value, my Kotlin code...

[ -0.00089263916015625, 0.0004711151123046875, 0.0004367828369140625, -0.01611328125, 0.01116943359375, -0.01361083984375, -0.0234375, 0.0059814453125, -0.01513671875, -0.00103759765625, 0.007415771484375, -0.00250244140625, -0.005645751953125, 0.00109100341796875, 0.0220947265625, -0.00...

[ 9626, 144057, 20625, 142508, 2773, 7763, 919, 20251, 32354, 1556, 1975, 2397, 107172, 163, 39666, 18151, 47, 19856, 169463, 31577, 28219, 11737, 14633, 83, 10, 892, 1505, 34292, 759, 33342, 1884, 903, 959, 20949, 84751, 50339, 5351, 132283, ...

[ 0.1097412109375, 0.07501220703125, 0.1446533203125, 0.2646484375, 0.197021484375, 0.21484375, 0.0831298828125, 0.239501953125, 0.174560546875, 0.1177978515625, 0.0760498046875, 0.25146484375, 0.126953125, 0.0184326171875, 0.1065673828125, 0.1639404296875, 0.04498291015625, 0.140258...

embed

67178663_c0

67178663

haskell

0

Title: decimal integer to Base4 string Haskell Problem title: decimal integer to Base4 string Haskell Tags: haskell, radix Problem: decimal integer to Base4 string Haskell I'm trying to convert an integer from decimal integer to a string based on base 4, but my unfoldr doesn't work and I'm not sure why or how to replac...

decimal integer to Base4 string Haskell decimal integer to Base4 string Haskell haskell radix Base4 Haskell dec2Base4 i2c Nothing Just decimal integer to Base4 string Haskell I'm trying to convert an integer from decimal integer to a string based on base 4, but my unfoldr doesn't work and I'm not sure why or how to rep...

[ -0.0272216796875, -0.00457763671875, 0.013916015625, 0.0103759765625, -0.00142669677734375, 0.0166015625, -0.0106201171875, -0.0133056640625, 0.00238037109375, 0.00921630859375, -0.0264892578125, -0.0179443359375, -0.00714111328125, 0.0228271484375, -0.004486083984375, 0.01080322265625...

[ 32380, 2749, 892, 1505, 47, 44978, 617, 79315, 20625, 142508, 1556, 4567, 57865, 304, 63473, 182747, 31577, 96760, 1295, 10, 35509, 3647, 201, 759, 51, 42822, 42, 22027, 18, 4488, 9077, 15400, 91995, 442, 831, 4527, 24927, 7, 4358, 30022,...

[ 0.1661376953125, 0.14501953125, 0.140625, 0.1422119140625, 0.1142578125, 0.2293701171875, 0.2071533203125, 0.236572265625, 0.1328125, 0.2039794921875, 0.109619140625, 0.080078125, 0.1549072265625, 0.09130859375, 0.142333984375, 0.014862060546875, 0.061920166015625, 0.1383056640625,...

embed

34826018_c1

34826018

haskell

1

0.0... In-place registering Alphabet-0.1.0.0... Preprocessing test suite 'alphabet-test' for Alphabet-0.1.0.0... [1 of 1] Compiling Main ( tests/AlphabetSpec.hs, dist/build/alphabet-test/alphabet-test-tmp/AlphabetSpec.o ) tests/AlphabetSpec.hs:4:27: Module ‘Alphabet’ does not export ‘alphabet’ Why is my CPP not working...

[ -0.0089111328125, 0.002838134765625, -0.00494384765625, 0.01806640625, -0.0038909912109375, -0.01397705078125, 0.027587890625, 0.00732421875, -0.007720947265625, 0.0262451171875, -0.011962890625, -0.0084228515625, 0.00360107421875, 0.01373291015625, -0.005157470703125, 0.00037193298339...

[ 89678, 360, 23935, 68067, 76569, 4626, 102014, 99929, 1914, 63923, 3034, 14947, 229231, 6954, 15612, 49725, 12321, 109921, 6210, 14612, 47107, 127, 271, 177149, 2676, 31, 27592, 63014, 14602, 959, 31255, 44084, 759, 313, 17487, 20697, 237, 84...

[ 0.2232666015625, 0.046417236328125, 0.14892578125, 0.1944580078125, 0.159912109375, 0.1895751953125, 0.1917724609375, 0.2130126953125, 0.108642578125, 0.1353759765625, 0.1871337890625, 0.169189453125, 0.2340087890625, 0.2135009765625, 0.0859375, 0.114501953125, 0.1002197265625, 0.1...

embed

35541009_c0

35541009

haskell

0

Title: tuple or data for loading file haskell Problem title: tuple or data for loading file haskell Tags: file, tuples, haskell Problem: tuple or data for loading file haskell I have to load a database of the format: "Blade Runner" "Ridley Scott" 1982 ("Amy",5), ("Bill",8), ("Ian",7), ("Kevin",9), ("Emma",4), ("Sam",7)...

tuple or data for loading file haskell tuple or data for loading file haskell file tuples haskell Blade Runner Ridley Scott Amy Bill Ian Kevin Emma Sam Megan Rating Film Read Show tuple or data for loading file haskell I have to load a database of the format: into Would it better to leave Rating as a tuple or change to...

[ 0.04248046875, -0.00103759765625, -0.003631591796875, 0.01513671875, -0.00958251953125, 0.007568359375, 0.00714111328125, 0.002410888671875, 0.00433349609375, -0.024658203125, 0.0021514892578125, -0.017822265625, -0.013671875, -0.01483154296875, -0.0213623046875, 0.0081787109375, -0....

[ 370, 8705, 707, 2053, 100, 72367, 214, 11435, 1556, 142508, 99726, 140852, 208545, 41231, 4293, 50695, 117277, 19893, 104870, 57501, 51627, 3362, 26842, 19, 66350, 3847, 4764, 17367, 765, 63399, 9384, 3934, 11522, 31358, 237, 15549, 10644, 30...

[ 0.177978515625, 0.2646484375, 0.0821533203125, 0.1949462890625, 0.049713134765625, 0.156005859375, 0.057769775390625, 0.1517333984375, 0.17578125, 0.2442626953125, 0.220947265625, 0.1416015625, 0.1695556640625, 0.07080078125, 0.0865478515625, 0.1334228515625, 0.1285400390625, 0.131...

embed

16864800_c0

16864800

haskell

0

Title: Make haskell where clause whitespace insensitive? Problem title: Make haskell where clause whitespace insensitive? Tags: whitespace, haskell, where-clause Problem: Make haskell where clause whitespace insensitive? I've variously been told you can make Haskell whitespace insensitive with the right use of { ... ; ...

Make haskell where clause whitespace insensitive? Make haskell where clause whitespace insensitive? whitespace haskell where-clause Make Make haskell where clause whitespace insensitive? I've variously been told you can make Haskell whitespace insensitive with the right use of { ... ; ... ;} Thus far I've been able to ...

[ -0.0018463134765625, 0.018798828125, -0.01165771484375, -0.00860595703125, -0.0208740234375, 0.0106201171875, -0.01171875, -0.0162353515625, 0.021728515625, 0.00014495849609375, -0.0021820068359375, 0.015869140625, 0.0047607421875, -0.0147705078125, -0.004058837890625, 0.00656127929687...

[ 26176, 1556, 142508, 7440, 70731, 13, 35011, 65421, 23, 176302, 18347, 4032, 3249, 20625, 7108, 4527, 10666, 153, 2819, 90, 18151, 43240, 366, 184, 18499, 4034 ]

[ 0.069091796875, 0.14453125, 0.2283935546875, 0.1829833984375, 0.18896484375, 0.0931396484375, 0.1595458984375, 0.21875, 0.07440185546875, 0.171875, 0.1195068359375, 0.082275390625, 0.0528564453125, 0.1260986328125, 0.0254364013671875, 0.01556396484375, 0.006256103515625, 0.03048706...

embed

40364831_c0

40364831

haskell

0

Title: list of brackets, Haskell Problem title: list of brackets, Haskell Tags: haskell, list Problem: list of brackets, Haskell The task is describe infinite list (called brackets) of strings Example of such list: ["[]", "[[]]", "[[[]]]", "[[[[]]]]"...] If I'll write take 4 brackets the result should be ["[]","[[]]","...

list of brackets, Haskell list of brackets, Haskell haskell list Haskell Unresolved Binding Outstanding Num Char list of brackets, Haskell The task is describe infinite list (called brackets) of strings Example of such list: ["[]", "[[]]", "[[[]]]", "[[[[]]]]"...] If I'll write take 4 brackets the result should be ["[]...

[ -0.0177001953125, 0.006683349609375, -0.01373291015625, -0.0135498046875, 0.0208740234375, 0.006866455078125, 0.0021209716796875, -0.00567626953125, 0.0087890625, -0.0108642578125, -0.000614166259765625, -0.0517578125, 0.020263671875, -0.00182342529296875, -0.0179443359375, -0.01422119...

[ 5303, 111, 1620, 27853, 20625, 142508, 1556, 992, 107, 86918, 1843, 33770, 13538, 144057, 52782, 21656, 66211, 98363, 54241, 13, 79315, 89536, 6044, 1065, 33022, 5646, 201, 16750, 5608, 4527, 88308, 939, 214, 70, 472, 10869, 29806, 1284, 18...

[ 0.2071533203125, 0.048736572265625, 0.185791015625, 0.227783203125, 0.1103515625, 0.199462890625, 0.09869384765625, 0.0249481201171875, 0.032501220703125, 0.129150390625, 0.0599365234375, 0.0640869140625, 0.01470947265625, 0.0650634765625, 0.1163330078125, 0.1378173828125, 0.18469238...

embed

72474469_c0

72474469

haskell

0

Title: Cabal says tests pass but in fact they fail? Problem title: Cabal says tests pass but in fact they fail? Tags: haskell, cabal Problem: Cabal says tests pass but in fact they fail? When I run the test suite using cabal test , I got the following message: Running 1 test suites... Test suite tests: RUNNING... Test ...

Cabal says tests pass but in fact they fail? Cabal says tests pass but in fact they fail? haskell cabal Cabal Running Test PASS my-lib-tests.log Failed Falsified Cabal says tests pass but in fact they fail? When I run the test suite using cabal test , I got the following message: But when I looked at the log file, the ...

[ 0.037353515625, 0.006134033203125, -0.005401611328125, 0.00640869140625, -0.00396728515625, 0.006591796875, 0.0098876953125, -0.00021457672119140625, -0.0091552734375, 0.03369140625, 0.007171630859375, -0.00244140625, -0.007598876953125, 0.02392578125, 0.003143310546875, -0.00601196289...

[ 30438, 289, 17378, 109921, 27875, 1284, 15824, 35782, 1836, 1556, 142508, 109524, 28398, 8647, 8436, 759, 5612, 6954, 7, 4867, 190355, 22225, 47314, 11675, 3034, 14947, 25632, 26008, 12684, 11435, 10941, 44084, 3229, 123019, 165523 ]

[ 0.1787109375, 0.1688232421875, 0.042572021484375, 0.22216796875, 0.1651611328125, 0.08740234375, 0.1202392578125, 0.2169189453125, 0.0156402587890625, 0.07720947265625, 0.1607666015625, 0.236328125, 0.065673828125, 0.1939697265625, 0.13525390625, 0.031982421875, 0.0960693359375, 0....

embed

8600692_c0

8600692

haskell

0

Title: Datatype promotion for dependently challenged Problem title: Datatype promotion for dependently challenged Tags: types, language-design, haskell, dependent-type Problem: Datatype promotion for dependently challenged After reading through the ghc 7.4. pre-release notes and the Giving Haskell a Promotion paper, I'...

Datatype promotion for dependently challenged Datatype promotion for dependently challenged types language-design haskell dependent-type Datatype Nat List Nil Cons Pair Sum Datatype promotion for dependently challenged After reading through the ghc 7.4. pre-release notes and the Giving Haskell a Promotion paper, I'm st...

[ 0.0089111328125, 0.0196533203125, 0.01104736328125, 0.01263427734375, 0.01214599609375, 0.03125, -0.0106201171875, 0.0079345703125, 0.00010919570922851562, 0.0157470703125, 0.009033203125, -0.0498046875, -0.00848388671875, -0.00811767578125, -0.01123046875, -0.00872802734375, 0.02294...

[ 11809, 50986, 82641, 108750, 66801, 71, 52895, 46876, 34198, 1556, 142508, 68875, 32036, 77175, 39215, 1342, 36335, 538, 31380, 238, 361, 29485, 479, 73048, 5174, 20625, 170369, 15122, 55681, 2367, 20653, 54, 678, 125568, 527, 73265, 23009, 2...

[ 0.126708984375, 0.26220703125, 0.2078857421875, 0.1298828125, 0.1455078125, 0.059967041015625, 0.2235107421875, 0.09820556640625, 0.1461181640625, 0.096435546875, 0.210693359375, 0.0906982421875, 0.109619140625, 0.1124267578125, 0.10595703125, 0.072021484375, 0.128662109375, 0.0042...

embed

30236937_c1

30236937

haskell

1

the hood sf `addToContext` ctx And here's the question: is it possible to make GHCJS auto-generate e.g. var Engine = famous.core.Engine and var Surface = famous.core.Surface imports in the outputted JavaScript whenever an FFI binding gets used that depends on it? Or are my only options to either always use fully quali...

[ -0.00092315673828125, -0.000865936279296875, -0.005645751953125, -0.009033203125, -0.01953125, 0.001251220703125, 0.00018310546875, 0.0135498046875, 0.004302978515625, -0.0390625, 0.0030364990234375, -0.007659912109375, 0.004119873046875, 0.024169921875, -0.005035400390625, -0.00072860...

[ 70, 44462, 52253, 11, 4028, 7763, 11935, 22829, 108963, 425, 9655, 83, 7722, 3249, 527, 73265, 64977, 1809, 48281, 67, 285, 90125, 2203, 170277, 30854, 91384, 1212, 136, 179794, 5, 84041, 40404, 24927, 23, 140992, 17925, 217684, 563, 22724,...

[ 0.061279296875, 0.231201171875, 0.187744140625, 0.00299072265625, 0.121337890625, 0.132568359375, 0.08416748046875, 0.2154541015625, 0.0460205078125, 0.119873046875, 0.0146484375, 0.03155517578125, 0.12939453125, 0.056427001953125, 0.1221923828125, 0.175048828125, 0.2139892578125, ...

embed

33246310_c0

33246310

haskell

0

Title: Including extra directories with Keter Problem title: Including extra directories with Keter Tags: yesod, keter, haskell Problem: Including extra directories with Keter I have a Yesod site and have created a handler for handling downloads and enforcing constraints. My Yesod project directory has a subdirectory c...

Including extra directories with Keter Including extra directories with Keter yesod keter haskell Including Keter Including extra directories with Keter I have a Yesod site and have created a handler for handling downloads and enforcing constraints. My Yesod project directory has a subdirectory called downloads , and i...

[ -0.01019287109375, 0.0299072265625, 0.009765625, -0.0010223388671875, -0.011962890625, 0.00167083740234375, -0.03271484375, 0.00811767578125, -0.0029296875, -0.00927734375, -0.015380859375, -0.0054931640625, -0.010986328125, 0.03564453125, 0.00970458984375, 0.00188446044921875, -0.01...

[ 8942, 822, 4173, 14364, 3387, 678, 1345, 720, 6238, 2422, 23722, 311, 1556, 142508, 32635, 2199, 1764, 75935, 35863, 45064, 7026, 2472, 2816, 13452, 53, 1614, 80581, 30675, 35839, 70541, 102158, 3444, 38937, 19048, 73088, 43240, 6782, 34754, ...

[ 0.08203125, 0.1282958984375, 0.187744140625, 0.164306640625, 0.0919189453125, 0.0997314453125, 0.1959228515625, 0.2822265625, 0.00244140625, 0.091796875, 0.1612548828125, 0.1495361328125, 0.10760498046875, 0.201416015625, 0.136474609375, 0.20068359375, 0.0469970703125, 0.0043640136...

embed

3378433_c0

3378433

haskell

0

Title: Haskell: nonobvious examples of functional dependencies Problem title: Haskell: nonobvious examples of functional dependencies Tags: haskell, functional-dependencies Problem: Haskell: nonobvious examples of functional dependencies The examples of functional dependencies I've seen boil down to mapping container -...

Haskell: nonobvious examples of functional dependencies Haskell: nonobvious examples of functional dependencies haskell functional-dependencies Haskell Mult Matrix Vector Haskell: nonobvious examples of functional dependencies The examples of functional dependencies I've seen boil down to mapping container -> element ,...

[ 0.01116943359375, 0.01055908203125, -0.01165771484375, 0.003814697265625, 0.0023193359375, 0.005035400390625, -0.0157470703125, -0.019775390625, -0.003997802734375, 0.000263214111328125, -0.0157470703125, -0.0218505859375, -0.002716064453125, 0.0240478515625, -0.0164794921875, -0.00182...

[ 20625, 142508, 351, 3522, 10023, 27781, 123309, 42548, 117538, 1556, 105254, 13, 81212, 194234, 2609, 18770, 51592, 7565, 291, 26783, 116419, 33079, 12830, 10750, 16750, 11522, 36510, 10644, 32354, 63399, 154453, 1286, 27140, 151618, 959, 3173, ...

[ 0.1234130859375, 0.2374267578125, 0.06494140625, 0.014801025390625, 0.0640869140625, 0.166259765625, 0.208251953125, 0.2056884765625, 0.1153564453125, 0.119384765625, 0.1407470703125, 0.03314208984375, 0.1546630859375, 0.1031494140625, 0.140869140625, 0.09912109375, 0.014892578125, ...

embed

37133345_c0

37133345

haskell

0

Title: Check if tuple list is in increasing consecutive order in Haskell Problem title: Check if tuple list is in increasing consecutive order in Haskell Tags: tuples, haskell, list Problem: Check if tuple list is in increasing consecutive order in Haskell So I have a problem where I need to see if a list of positions ...

Check if tuple list is in increasing consecutive order in Haskell Check if tuple list is in increasing consecutive order in Haskell tuples haskell list Check Haskell is_in_order Position Bool Check if tuple list is in increasing consecutive order in Haskell So I have a problem where I need to see if a list of positions...

[ 0.0015411376953125, -0.0052490234375, -0.00433349609375, 0.0242919921875, 0.00238037109375, 0.02001953125, -0.0081787109375, -0.01324462890625, 0.0093994140625, 0.02490234375, 0.008056640625, 0.01495361328125, 0.0087890625, 0.0002422332763671875, -0.02490234375, 0.007415771484375, -0...

[ 38679, 2174, 370, 8705, 5303, 23, 118055, 148390, 12989, 20625, 142508, 13, 99726, 1556, 83, 73, 80596, 99428, 2460, 929, 2967, 1957, 19069, 3173, 53, 27781, 131148 ]

[ 0.1502685546875, 0.0687255859375, 0.1141357421875, 0.204833984375, 0.1839599609375, 0.0926513671875, 0.189697265625, 0.17333984375, 0.1739501953125, 0.129638671875, 0.2398681640625, 0.03326416015625, 0.172607421875, 0.11767578125, 0.06317138671875, 0.11474609375, 0.1878662109375, 0...

embed

23595173_c0

23595173

haskell

0

Title: "invalid preprocessing directive" when installing memoize Problem title: "invalid preprocessing directive" when installing memoize Tags: memoization, haskell, ghc, cabal Problem: "invalid preprocessing directive" when installing memoize I try running: cabal install memoize in the Terminal but...

"invalid preprocessing directive" when installing memoize "invalid preprocessing directive" when installing memoize memoization haskell ghc cabal Failed memoize-0.6 Error ExitFailure Data Memoize TH.hs:5:6 "invalid preprocessing directive" when installing memoize I try running: in the Terminal but a...

[ 0.00015735626220703125, 0.0015411376953125, 0.00848388671875, 0.00457763671875, -0.004364013671875, 0.01611328125, 0.00665283203125, 0.00897216796875, 0.0028228759765625, -0.00122833251953125, 0.01226806640625, -0.01019287109375, 0.01165771484375, 0.0089111328125, 0.0018463134765625, 0...

[ 7013, 479, 63923, 214, 8951, 5844, 20600, 163, 432, 20650, 47691, 1556, 142508, 31380, 109524, 190355, 122887, 212059, 5443, 217, 17647, 379, 11809, 17443, 31, 12232, 127, 758, 910, 73, 9790, 51042, 124090, 106, 18499 ]

[ 0.1529541015625, 0.1436767578125, 0.14501953125, 0.0601806640625, 0.1187744140625, 0.143310546875, 0.133056640625, 0.1248779296875, 0.135986328125, 0.2003173828125, 0.09130859375, 0.059661865234375, 0.164794921875, 0.03338623046875, 0.159423828125, 0.1268310546875, 0.1795654296875, ...

embed

75712337_c1

75712337

haskell

1

atypeInfo (Code a) Removes type level information, because Code a , being a type level list of lists, no longer has the information about whether a has named record fields or not. Is there something else I can do using generics-sop to retain that information. I quite like generic-sop , in particular not having to deal ...

[ -0.0002880096435546875, 0.01104736328125, 0.00179290771484375, 0.035400390625, -0.0020599365234375, -0.004638671875, 0.0086669921875, -0.006988525390625, 0.000774383544921875, 0.02001953125, -0.0089111328125, -0.00113677978515625, -0.0203857421875, 0.01226806640625, -0.003082275390625, ...

[ 10, 50986, 93147, 114211, 181139, 10644, 17366, 4677, 28864, 5303, 110, 51713, 1556, 36766, 24, 4806, 17164, 44457, 959, 9844, 37076, 831, 17368, 189534, 7, 9, 2146, 112033, 73, 32233, 1884, 2394, 6635, 1360, 10554, 57877, 162515, 184017, 2...

[ 0.1700439453125, 0.2171630859375, 0.2230224609375, 0.14404296875, 0.1634521484375, 0.216064453125, 0.2027587890625, 0.18896484375, 0.206787109375, 0.1483154296875, 0.011077880859375, 0.0665283203125, 0.01385498046875, 0.0174560546875, 0.082763671875, 0.1376953125, 0.178466796875, 0...

embed

41592717_c0

41592717

haskell

0

Title: how to detect circles of symbolic links in haskell Problem title: how to detect circles of symbolic links in haskell Tags: haskell, filesystems Problem: how to detect circles of symbolic links in haskell i understand that i can find circles in symbolic links with the find . -follow -printf "" command (and other ...

how to detect circles of symbolic links in haskell how to detect circles of symbolic links in haskell haskell filesystems how to detect circles of symbolic links in haskell i understand that i can find circles in symbolic links with the command (and other similar methods on the command line as previously previously sug...

[ 0.002685546875, -0.01708984375, 0.01171875, 0.0380859375, 0.0067138671875, -0.004730224609375, -0.005828857421875, 0.004638671875, -0.0021514892578125, -0.026123046875, -0.0089111328125, 0.0086669921875, 0.005706787109375, 0.0224609375, -0.002685546875, 0.0164794921875, -0.0115966796...

[ 3642, 96391, 130370, 111, 128201, 238, 22317, 23, 1556, 142508, 11435, 16751, 28219, 7413, 75101, 150624, 13315, 53418, 69307, 41018, 12353, 184911, 456, 11627, 30646, 118704, 20880, 18499, 11787, 11508, 6077, 12765, 128405, 42154, 133 ]

[ 0.0139617919921875, 0.2152099609375, 0.22802734375, 0.07305908203125, 0.2154541015625, 0.0908203125, 0.199951171875, 0.07421875, 0.134033203125, 0.2174072265625, 0.0882568359375, 0.13916015625, 0.033966064453125, 0.1373291015625, 0.1702880859375, 0.00555419921875, 0.000091552734375, ...

embed

11094242_c0

11094242

haskell

0

Title: Are Haskell thunks mutable concerning evaluation? Problem title: Are Haskell thunks mutable concerning evaluation? Tags: seq, lazy-evaluation, haskell Problem: Are Haskell thunks mutable concerning evaluation? While looking into parallel programming, and subsequently evaluation strategies, the question whether t...

Are Haskell thunks mutable concerning evaluation? Are Haskell thunks mutable concerning evaluation? seq lazy-evaluation haskell Haskell Thunk Evaluates Are Haskell thunks mutable concerning evaluation? While looking into parallel programming, and subsequently evaluation strategies, the question whether thunks are mutab...

[ -0.0057373046875, 0.0306396484375, 0.0155029296875, 0.0242919921875, 0.014404296875, -0.00927734375, -0.0091552734375, 0.0084228515625, -0.001495361328125, 0.003936767578125, 0.006134033203125, 0.0269775390625, -0.00421142578125, 0.0211181640625, -0.00115203857421875, -0.00503540039062...

[ 15901, 20625, 142508, 4911, 19, 1224, 842, 22819, 50509, 219836, 40, 864, 21, 3285, 159258, 1556, 6003, 3678, 151228, 1636, 95103, 56037, 50531, 621, 27781, 18151, 26265, 151575, 1909, 5775, 31, 68772, 3638, 3173, 34292, 138, 52490, 7464, 5...

[ 0.003692626953125, 0.1136474609375, 0.2275390625, 0.11669921875, 0.1016845703125, 0.17333984375, 0.16015625, 0.1947021484375, 0.01226806640625, 0.1971435546875, 0.09161376953125, 0.14111328125, 0.006378173828125, 0.1060791015625, 0.1463623046875, 0.08447265625, 0.058563232421875, 0...

embed

1150866_c0

1150866

haskell

0

Title: Graphs (Nodes and Edges) Problem title: Graphs (Nodes and Edges) Tags: haskell, graph-theory Problem: Graphs (Nodes and Edges) I am using HASKELL for graph games. I am willing to get a suitable method for reach ability from a node to a particular node in the graph apart from using bfs or trees etc. As I asked fo...

Graphs (Nodes and Edges) Graphs (Nodes and Edges) haskell graph-theory Graphs Nodes Edges Graphs (Nodes and Edges) I am using HASKELL for graph games. I am willing to get a suitable method for reach ability from a node to a particular node in the graph apart from using bfs or trees etc. As I asked for code in haskell f...

[ -0.0068359375, 0.02294921875, -0.003936767578125, 0.004852294921875, -0.01019287109375, -0.0079345703125, -0.013427734375, -0.017822265625, 0.006072998046875, -0.017822265625, -0.001434326171875, -0.044677734375, 0.01129150390625, 0.0155029296875, -0.011474609375, 0.00262451171875, 0...

[ 6524, 11727, 5021, 988, 136, 69030, 7, 1556, 142508, 41382, 2347, 30675, 438, 17368, 11666, 10762, 56051, 100, 27528, 109269, 202319, 55300, 58359, 81273, 1295, 110, 17311, 34955, 876, 17447, 1360, 18151, 23, 1632, 47, 112668, 3525, 16454, ...

[ 0.197021484375, 0.215087890625, 0.1580810546875, 0.1270751953125, 0.0986328125, 0.194091796875, 0.0406494140625, 0.14208984375, 0.2308349609375, 0.24072265625, 0.06610107421875, 0.0238037109375, 0.13916015625, 0.09393310546875, 0.1083984375, 0.1136474609375, 0.1697998046875, 0.0392...

embed

34184201_c0

34184201

haskell

0

Title: Is there a simpler type system with the practical utilities of CoC? Problem title: Is there a simpler type system with the practical utilities of CoC? Tags: haskell, type-systems, functional-programming, types Problem: Is there a simpler type system with the practical utilities of CoC? The Calculus of Constructi...

Is there a simpler type system with the practical utilities of CoC? Is there a simpler type system with the practical utilities of CoC? haskell type-systems functional-programming types CoC Is there a simpler type system with the practical utilities of CoC? The Calculus of Constructions, as presented on the Simpler, Ea...

[ 0.01025390625, 0.0089111328125, -0.0038299560546875, 0.0191650390625, 0.020751953125, -0.031982421875, -0.005615234375, -0.000004500150680541992, -0.0050048828125, -0.01385498046875, -0.00811767578125, 0.00439453125, 0.01177978515625, -0.005828857421875, 0.01275634765625, -0.0106811523...

[ 8781, 42, 10644, 5426, 678, 138155, 19537, 2449, 1311, 441, 2685, 1556, 142508, 16751, 123309, 28966, 52895, 212467, 223, 111, 195769, 60552, 241, 1544, 56, 4552, 831, 11814, 56037, 46876, 756, 4127, 183871, 41206, 175199, 26785, 7432, 98869,...

[ 0.155029296875, 0.1185302734375, 0.2144775390625, 0.16845703125, 0.0640869140625, 0.1964111328125, 0.1346435546875, 0.06671142578125, 0.12451171875, 0.1793212890625, 0.0091552734375, 0.0880126953125, 0.2020263671875, 0.12646484375, 0.0908203125, 0.06689453125, 0.1632080078125, 0.16...

embed

15368658_c0

15368658

haskell

0

Title: What is the equivalent Haskell type for C99 bool when using FFI? Problem title: What is the equivalent Haskell type for C99 bool when using FFI? Tags: c99, ffi, haskell Problem: What is the equivalent Haskell type for C99 bool when using FFI? I have a library which uses C99 bool data type and I would like to cal...

What is the equivalent Haskell type for C99 bool when using FFI? What is the equivalent Haskell type for C99 bool when using FFI? c99 ffi haskell FFI What Haskell C99 What is the equivalent Haskell type for C99 bool when using FFI? I have a library which uses C99 bool data type and I would like to call it via FFI. What...

[ 0.0079345703125, 0.017578125, -0.0009765625, 0.00830078125, 0.006805419921875, 0.007476806640625, 0.0123291015625, -0.00946044921875, 0.002838134765625, 0.0069580078125, -0.01434326171875, -0.0380859375, -0.0024871826171875, 0.00897216796875, 0.00347900390625, 0.01068115234375, -0.00...

[ 183234, 20625, 142508, 10644, 313, 5046, 142484, 563, 22724, 501, 24500, 1556, 4865, 35773, 2053, 11782, 1829, 42518, 184293, 50986, 660, 5922, 110, 43386, 32399, 46002, 30700, 115081, 32354, 41206, 51515, 2811, 1294 ]

[ 0.1402587890625, 0.115234375, 0.2178955078125, 0.1844482421875, 0.08209228515625, 0.291748046875, 0.157470703125, 0.0760498046875, 0.2080078125, 0.041534423828125, 0.175048828125, 0.10406494140625, 0.0338134765625, 0.1361083984375, 0.05157470703125, 0.0160064697265625, 0.015243530273...

embed

39667785_c0

39667785

haskell

0

Title: Different Maybe Types When Inspecting in GHCI Problem title: Different Maybe Types When Inspecting in GHCI Tags: types, polymorphism, haskell, option-type Problem: Different Maybe Types When Inspecting in GHCI I'm new to Haskell and trying to teach myself the ropes, so forgive me if this is a basic question. If ...

Different Maybe Types When Inspecting in GHCI Different Maybe Types When Inspecting in GHCI types polymorphism haskell option-type Different Maybe Types When Inspecting GHCI Just Num Stack Char Different Maybe Types When Inspecting in GHCI I'm new to Haskell and trying to teach myself the ropes, so forgive me if this i...

[ 0.009521484375, -0.00616455078125, 0.0185546875, 0.0093994140625, 0.0027008056640625, 0.0274658203125, 0.01116943359375, -0.01025390625, 0.00250244140625, 0.0213623046875, -0.00421142578125, -0.0498046875, -0.00106048583984375, -0.00897216796875, 0.0057373046875, 0.0084228515625, 0.0...

[ 242520, 83425, 60457, 14847, 360, 16711, 1916, 41877, 17304, 23, 52895, 35874, 178851, 1556, 142508, 35829, 50986, 9563, 52782, 6512, 2594, 21656, 20625, 87850, 90, 96259, 62822, 9803, 1257, 29481, 56, 9486, 318, 15400, 2046, 12921, 237, 3506...

[ 0.1934814453125, 0.31982421875, 0.260009765625, 0.0166778564453125, 0.0750732421875, 0.1932373046875, 0.0255889892578125, 0.147705078125, 0.1756591796875, 0.017120361328125, 0.254150390625, 0.0836181640625, 0.1612548828125, 0.1175537109375, 0.2308349609375, 0.1883544921875, 0.1885986...

embed

4235348_c0

4235348

haskell

0

Title: Converting IO Int to Int Problem title: Converting IO Int to Int Tags: syntax, monads, io, haskell Problem: Converting IO Int to Int I've created a combobox from converting a xmlWidget to a comboBox with the function castTocomboBox and now I want to get the text or the index of the active item. The problem is th...

Converting IO Int to Int Converting IO Int to Int syntax monads io haskell Converting Glade gtk2hs Converting IO Int to Int I've created a combobox from converting a xmlWidget to a comboBox with the function castTocomboBox and now I want to get the text or the index of the active item. The problem is that if I use the ...

[ -0.00872802734375, 0.0025634765625, -0.00433349609375, 0.003387451171875, 0.0125732421875, 0.017333984375, -0.01068115234375, 0.00250244140625, 0.007781982421875, -0.0419921875, 0.0279541015625, -0.04248046875, -0.0137939453125, 0.04736328125, 0.010498046875, -0.0191650390625, 0.0001...

[ 1657, 814, 1916, 17780, 360, 18, 47, 6002, 86531, 2667, 712, 22995, 1556, 142508, 90040, 13, 31472, 304, 127, 75935, 375, 837, 11728, 1295, 96760, 131492, 1456, 532, 3794, 72295, 32354, 37702, 7763, 277, 3444, 2046, 7986, 707, 63262, 3645...

[ 0.036590576171875, 0.126953125, 0.0643310546875, 0.253173828125, 0.1990966796875, 0.2054443359375, 0.1146240234375, 0.0257568359375, 0.042572021484375, 0.10614013671875, 0.1651611328125, 0.172119140625, 0.048583984375, 0.1712646484375, 0.15771484375, 0.1497802734375, 0.1312255859375,...

embed

49086884_c0

49086884

haskell

0

Title: Generate all changes of signs Problem title: Generate all changes of signs Tags: combinations, haskell, transform Problem: Generate all changes of signs I have many lists. Say for short [[1,2],[3,4]] . I need to generate all changes of signs of each element. Thus, for the short example, the result would be [[1,2...

Generate all changes of signs Generate all changes of signs combinations haskell transform Generate Generate all changes of signs I have many lists. Say for short [[1,2],[3,4]] . I need to generate all changes of signs of each element. Thus, for the short example, the result would be Is there a package to perform such ...

[ -0.009765625, 0.0125732421875, -0.027587890625, -0.002655029296875, 0.0025482177734375, 0.004486083984375, -0.000705718994140625, -0.00004744529724121094, 0.0017242431640625, 0.01214599609375, -0.01239013671875, -0.0032958984375, 0.0220947265625, 0.03173828125, -0.009765625, 0.01135253...

[ 155370, 67, 756, 65572, 111, 24092, 7, 162515, 1556, 142508, 27198, 765, 5941, 5303, 16610, 133063, 82449, 3871, 47, 139392, 12638, 12830, 27781, 16750, 98169, 51339, 6044, 41018, 234873, 4527, 17569, 5915, 4358, 5701, 140909, 42079, 117434, ...

[ 0.211669921875, 0.0838623046875, 0.1773681640625, 0.25390625, 0.1064453125, 0.2374267578125, 0.10528564453125, 0.1937255859375, 0.144287109375, 0.2257080078125, 0.25, 0.033905029296875, 0.0885009765625, 0.198486328125, 0.121337890625, 0.07122802734375, 0.1358642578125, 0.0645751953...

embed

10049377_c1

10049377

haskell

1

a different parameter meow , then GHC produces code that invokes numerators a million times, each with an identical implicit parameters necklaces . It's nevertheless obvious that numerators only needs to be invoked once though, the first time ?necklaces gets assigned, meaning GHC could potentially notice this optimiza...

[ -0.03515625, 0.007110595703125, -0.0078125, -0.0036773681640625, 0.0038909912109375, 0.03466796875, -0.023681640625, -0.0130615234375, 0.004150390625, -0.028564453125, -0.01080322265625, -0.01806640625, -0.0072021484375, 0.00897216796875, 0.00616455078125, -0.020263671875, -0.0234375...

[ 12921, 171859, 163, 8770, 527, 73265, 27489, 18151, 23, 23253, 90, 100762, 22230, 10, 19879, 20028, 12638, 31943, 165164, 4272, 4704, 5170, 162520, 4734, 27117, 24145, 21208, 5117, 1733, 705, 21986, 95486, 5809, 38516, 60322, 903, 87235, 1363...

[ 0.1634521484375, 0.273193359375, 0.1480712890625, 0.25146484375, 0.11474609375, 0.2275390625, 0.10137939453125, 0.19287109375, 0.03643798828125, 0.1680908203125, 0.006866455078125, 0.26220703125, 0.2030029296875, 0.011566162109375, 0.149658203125, 0.158203125, 0.0161590576171875, 0...

embed

14838480_c0

14838480

haskell

0

Title: Finding the max of a list using tail recursion Problem title: Finding the max of a list using tail recursion Tags: haskell Problem: Finding the max of a list using tail recursion I am trying to understand how to write functions using tail recursion in Haskell. In my example below, the function takes in a list an...

Finding the max of a list using tail recursion Finding the max of a list using tail recursion haskell tail Finding x:xs Finding the max of a list using tail recursion I am trying to understand how to write functions using tail recursion in Haskell. In my example below, the function takes in a list and outputs the maxim...

[ 0.00830078125, 0.0147705078125, 0.03125, 0.00848388671875, 0.01446533203125, 0.0247802734375, 0.005767822265625, -0.005615234375, 0.017822265625, -0.0286865234375, 0.003936767578125, -0.0299072265625, 0.014892578125, -0.0079345703125, 0.030029296875, -0.00592041015625, -0.01684570312...

[ 26040, 18389, 111, 5303, 17368, 46741, 195625, 1830, 70, 1556, 142508, 1022, 12, 425, 28219, 33022, 32354, 20625, 27781, 35064, 51776, 23, 140992, 38132, 34292, 91177, 4527, 501, 77336, 4343, 43581, 73342, 4488, 110527 ]

[ 0.1148681640625, 0.23388671875, 0.0640869140625, 0.1873779296875, 0.059173583984375, 0.246826171875, 0.2091064453125, 0.0877685546875, 0.036224365234375, 0.1199951171875, 0.2039794921875, 0.0677490234375, 0.0213165283203125, 0.07659912109375, 0.010009765625, 0.0570068359375, 0.144775...

embed

22822926_c0

22822926

haskell

0

Title: What is the point of using Monad in a program? Problem title: What is the point of using Monad in a program? Tags: haskell Problem: What is the point of using Monad in a program? Say i'm creating an image processing library with Haskell. I've defined a few of my own data types. When should i declare some of my d...

What is the point of using Monad in a program? What is the point of using Monad in a program? haskell Monad What What is the point of using Monad in a program? Say i'm creating an image processing library with Haskell. I've defined a few of my own data types. When should i declare some of my data types to be Monad(or f...

[ -0.00066375732421875, 0.00390625, 0.0033721923828125, 0.013427734375, 0.000591278076171875, 0.01068115234375, 0.007080078125, 0.003448486328125, -0.01177978515625, -0.01055908203125, -0.0081787109375, -0.053955078125, -0.01007080078125, -0.00787353515625, -0.019287109375, -0.0152587890...

[ 4865, 6275, 111, 17368, 60331, 71, 23, 1528, 1556, 142508, 83, 70, 105233, 29569, 9433, 35773, 678, 20625, 272, 61924, 10846, 10002, 2053, 52895, 14847, 5608, 159978, 186, 7477, 18770, 41816, 68073, 28219, 831, 192, 48398, 645, 110527, 1364...

[ 0.0364990234375, 0.158935546875, 0.00726318359375, 0.1466064453125, 0.251953125, 0.23681640625, 0.06024169921875, 0.1724853515625, 0.1129150390625, 0.2333984375, 0.00677490234375, 0.0191802978515625, 0.06134033203125, 0.1094970703125, 0.05682373046875, 0.116455078125, 0.0474853515625...

embed

39259502_c0

39259502

haskell

0

Title: Printing very big numbers Problem title: Printing very big numbers Tags: haskell Problem: Printing very big numbers I begin to learn Haskell and I don't understand what happens : I have a very simple code : import System.IO import Control.Monad fact n = product [1..n] main :: IO () main = do input_line <- getLin...

Printing very big numbers Printing very big numbers haskell System.IO Control.Monad Printing input_line Main fact.hs Compiling Printing very big numbers I begin to learn Haskell and I don't understand what happens : I have a very simple code : In ghci, when I try but What am I missing ? Thank you for any explanation.

[ -0.00677490234375, 0.0096435546875, 0.00640869140625, 0.0169677734375, 0.002899169921875, 0.0019989013671875, 0.0191650390625, -0.004638671875, -0.0035858154296875, -0.0279541015625, 0.00115203857421875, -0.024658203125, -0.01123046875, -0.01336669921875, -0.00701904296875, -0.00260925...

[ 39754, 214, 4552, 6957, 101935, 1556, 142508, 12353, 17780, 27131, 46674, 712, 107730, 2256, 12321, 15824, 5, 127, 7, 15612, 49725, 9842, 30698, 20625, 2301, 18, 28219, 96276, 765, 8781, 18151, 360, 31380, 318, 3229, 9790, 1284, 4865, 444, ...

[ 0.1983642578125, 0.07293701171875, 0.1473388671875, 0.138671875, 0.1912841796875, 0.146240234375, 0.2449951171875, 0.07098388671875, 0.15576171875, 0.1348876953125, 0.0755615234375, 0.1138916015625, 0.1094970703125, 0.125, 0.09521484375, 0.18798828125, 0.002349853515625, 0.12719726...

embed

27002489_c0

27002489

haskell

0

Title: Use Yesod widgets to build HTML pages Problem title: Use Yesod widgets to build HTML pages Tags: haskell, yesod Problem: Use Yesod widgets to build HTML pages I am working on a static blog generator as a side project, and I'd like to use Yesod's widgets as the templating engine. My question boils down to whether...

Use Yesod widgets to build HTML pages Use Yesod widgets to build HTML pages haskell yesod Text.Blaze.Html.Renderer.String Yesod Use HTML Hello World Use Yesod widgets to build HTML pages I am working on a static blog generator as a side project, and I'd like to use Yesod's widgets as the templating engine. My question ...

[ 0.001190185546875, 0.01904296875, 0.0201416015625, -0.00439453125, -0.017578125, 0.0185546875, -0.01409912109375, -0.022216796875, -0.005950927734375, -0.048583984375, -0.0087890625, -0.041748046875, -0.0169677734375, -0.0184326171875, 0.0040283203125, -0.0133056640625, 0.00494384765...

[ 36836, 32635, 2199, 148631, 7, 47, 45367, 19097, 37967, 1556, 142508, 2422, 23722, 24129, 94901, 841, 18, 7237, 23894, 56, 71713, 35378, 6661, 20697, 201939, 1415, 145823, 5609, 13452, 1884, 4527, 237, 127446, 26518, 87907, 36766, 7722, 83, ...

[ 0.0833740234375, 0.17822265625, 0.2548828125, 0.27734375, 0.10211181640625, 0.041656494140625, 0.1580810546875, 0.2457275390625, 0.1494140625, 0.1015625, 0.1929931640625, 0.12548828125, 0.1947021484375, 0.1207275390625, 0.169189453125, 0.032958984375, 0.0941162109375, 0.1064453125,...

embed

42004616_c0

42004616

haskell

0

Title: Haskell function which acts differently depending on the monad type Problem title: Haskell function which acts differently depending on the monad type Tags: alternative-functor, monads, monadplus, haskell Problem: Haskell function which acts differently depending on the monad type I'm trying to implement a funct...

Haskell function which acts differently depending on the monad type Haskell function which acts differently depending on the monad type alternative-functor monads monadplus haskell Haskell MonadPlus s:sx Maybe Just Haskell function which acts differently depending on the monad type I'm trying to implement a function wh...

[ 0.0004634857177734375, 0.006927490234375, -0.0003910064697265625, 0.01043701171875, 0.02001953125, 0.0009002685546875, -0.003509521484375, 0.0002460479736328125, -0.00099945068359375, -0.03759765625, 0.01220703125, -0.0023651123046875, -0.00885009765625, -0.0003337860107421875, 0.0099487...

[ 20625, 142508, 32354, 3129, 27992, 12921, 538, 96819, 2667, 712, 10644, 30700, 16498, 18770, 32108, 1556, 60331, 71, 88225, 91, 12, 425, 8, 98, 31577, 29479, 56104, 3884, 5117, 12830, 5303, 2174, 83, 30646, 28271, 151117, 9563, 106, 5608, ...

[ 0.1343994140625, 0.26708984375, 0.17578125, 0.029327392578125, 0.1328125, 0.1717529296875, 0.049896240234375, 0.11572265625, 0.1231689453125, 0.1759033203125, 0.1568603515625, 0.1356201171875, 0.07879638671875, 0.05389404296875, 0.146728515625, 0.1246337890625, 0.1337890625, 0.0422...

embed

48808945_c0

48808945

haskell

0

Title: GHC Haskell duplicate symbols for architecture x86_64 Problem title: GHC Haskell duplicate symbols for architecture x86_64 Tags: ghc, haskell Problem: GHC Haskell duplicate symbols for architecture x86_64 If I follow an example in Real World Haskell (JSON example) and I first omit the mistake of the brackets in ...

GHC Haskell duplicate symbols for architecture x86_64 GHC Haskell duplicate symbols for architecture x86_64 ghc haskell GHC Haskell x86_64 GHC Haskell duplicate symbols for architecture x86_64 If I follow an example in Real World Haskell (JSON example) and I first omit the mistake of the brackets in the module, when I ...

[ -0.007415771484375, 0.005584716796875, -0.01300048828125, -0.0038604736328125, -0.0052490234375, -0.00225830078125, -0.005584716796875, 0.0034027099609375, -0.01495361328125, -0.0303955078125, -0.020751953125, -0.02783203125, 0.0289306640625, 0.000522613525390625, 0.0034637451171875, 0...

[ 527, 73265, 20625, 142508, 171763, 67, 26582, 159958, 15276, 13307, 31380, 238, 1556, 28960, 27781, 5120, 6661, 1375, 58627, 5117, 171, 217, 121742, 1620, 27853, 88996, 3229, 9969, 1340, 7464, 225, 25632, 18499, 6528, 103608, 2967, 12956 ]

[ 0.0806884765625, 0.196044921875, 0.15234375, 0.2242431640625, 0.197021484375, 0.03765869140625, 0.18701171875, 0.1158447265625, 0.186767578125, 0.142822265625, 0.083251953125, 0.057647705078125, 0.0615234375, 0.0860595703125, 0.1162109375, 0.1143798828125, 0.1114501953125, 0.114624...

embed

37037446_c0

37037446

haskell

0

Title: Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? Problem title: Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? Tags: haskell Problem: Can someone show me how to populate a list of lists in haskell from a textfile or a csv...

Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? haskell a Can Can someone show me how to populate a list of lists in haskell from a textfile or a csv file? I am new to haskell and ...

[ 0.00885009765625, -0.00164794921875, 0.0179443359375, 0.01104736328125, -0.005615234375, 0.007171630859375, 0.01007080078125, 0.01220703125, -0.0064697265625, -0.005950927734375, -0.025146484375, -0.043212890625, 0.0016937255859375, -0.0103759765625, -0.0250244140625, -0.00326538085937...

[ 4171, 22008, 7639, 163, 3642, 47, 27623, 67, 5303, 111, 7, 23, 1556, 142508, 1295, 7986, 29822, 20763, 334, 11435, 707, 10, 3525, 51339, 50944, 425, 127664, 3444, 136, 70541, 22936, 124962, 44237, 124519, 17721, 15555, 186, 133063, 96386, ...

[ 0.0540771484375, 0.03271484375, 0.108642578125, 0.0406494140625, 0.0723876953125, 0.01177978515625, 0.19580078125, 0.0662841796875, 0.258056640625, 0.08544921875, 0.07281494140625, 0.059417724609375, 0.1588134765625, 0.239990234375, 0.115966796875, 0.1500244140625, 0.2119140625, 0....

embed

38915534_c3

38915534

haskell

3

0.14.2, gtk-0.13.9, gtk-0.13.8.1, gtk-0.13.8, gtk-0.13.7, gtk-0.13.6, gtk-0.13.4, gtk-0.13.3, gtk-0.13.2, gtk-0.13.1, gtk-0.13.0.3, gtk-0.13.0.2, gtk-0.13.0.1, gtk-0.13.0.0, gtk-0.12.5.7, gtk-0.12.5.6, gtk-0.12.5.5, gtk-0.12.5.4, gtk-0.12.5.3, gtk-0.12.5.2, gtk-0.12.5.1, gtk-0.12.5.0, gtk-0.12.4, gtk-0.12.3.1, gtk-0.12...

[ -0.014892578125, 0.0289306640625, 0.0038909912109375, -0.004058837890625, 0.0311279296875, -0.015380859375, -0.0189208984375, -0.000736236572265625, 0.0030975341796875, 0.041259765625, -0.004058837890625, -0.06396484375, -0.027587890625, -0.0103759765625, -0.00372314453125, 0.003860473...

[ 107754, 117904, 4, 706, 31472, 9, 102014, 156611, 23320, 5, 2681, 206730, 135527, 109981, 102738, 172508, 134693, 107033, 97109, 170179, 133684, 99929, 15654, 160355, 124525, 148462, 48413, 617, 363, 158296, 156627, 187461, 116591, 120883, 70147, ...

[ 0.2210693359375, 0.258544921875, 0.133056640625, 0.1556396484375, 0.267822265625, 0.1016845703125, 0.1943359375, 0.256591796875, 0.1492919921875, 0.0909423828125, 0.2325439453125, 0.18701171875, 0.1981201171875, 0.171630859375, 0.1839599609375, 0.2109375, 0.1912841796875, 0.1978759...

embed

27219660_c0

27219660

haskell

0

Title: Open Type Level Proofs in Haskell/Idris Problem title: Open Type Level Proofs in Haskell/Idris Tags: proof, category-theory, correctness, haskell, idris Problem: Open Type Level Proofs in Haskell/Idris In Idris/Haskell, one can prove properties of data by annotating the types and using GADT constructors, such as...

Open Type Level Proofs in Haskell/Idris Open Type Level Proofs in Haskell/Idris proof category-theory correctness haskell idris Open Type Level Proofs Haskell Idris Open Type Level Proofs in Haskell/Idris In Idris/Haskell, one can prove properties of data by annotating the types and using GADT constructors, such as wit...

[ 0.020263671875, -0.009033203125, -0.0015869140625, 0.0047607421875, 0.0111083984375, -0.01031494140625, -0.017333984375, -0.0027008056640625, -0.01025390625, -0.042236328125, -0.0133056640625, -0.01275634765625, 0.003082275390625, -0.012939453125, -0.004852294921875, 0.0272216796875, ...

[ 13527, 60457, 84136, 1250, 4390, 20625, 142508, 64, 568, 14152, 7, 23, 98869, 95487, 2347, 30675, 26785, 1556, 3679, 181545, 6495, 831, 23534, 183871, 2053, 8668, 52895, 23749, 41072, 64549, 678, 52884, 18, 144570, 7941, 587, 57266, 10644, ...

[ 0.182861328125, 0.2425537109375, 0.1856689453125, 0.1146240234375, 0.130859375, 0.1138916015625, 0.2052001953125, 0.0247955322265625, 0.0238494873046875, 0.1175537109375, 0.04974365234375, 0.014007568359375, 0.130126953125, 0.1278076171875, 0.043426513671875, 0.003509521484375, 0.078...

embed

46873964_c0

46873964

haskell

0

Title: 20 intermediate haskell exercise - Exercise 9 Problem title: 20 intermediate haskell exercise - Exercise 9 Tags: haskell Problem: 20 intermediate haskell exercise - Exercise 9 I was working on 20 intermediate haskell exercise. And Exercise 9 is: class Misty m where banana :: (a -> m b) -> m a -> m b unicorn :: a...

20 intermediate haskell exercise - Exercise 9 20 intermediate haskell exercise - Exercise 9 haskell Exercise Misty 20 intermediate haskell exercise - Exercise 9 I was working on 20 intermediate haskell exercise. And Exercise 9 is: And the solution offered here is If I replace m with ((->) t) in banana's type signature,...

[ 0.017578125, 0.0040283203125, 0.00628662109375, 0.007720947265625, 0.016357421875, 0.0267333984375, 0.004364013671875, 0.0120849609375, 0.0218505859375, 0.000507354736328125, -0.0216064453125, -0.0089111328125, 0.01507568359375, 0.00555419921875, -0.0155029296875, 0.0069580078125, 0....

[ 387, 81814, 1556, 142508, 81979, 155534, 483, 2182, 7950, 939, 20697, 184, 70, 29806, 122399, 91995, 347, 678, 103607, 808, 16, 134399, 10644, 138256, 1650, 37202, 128239, 32354, 100, 60494, 15400, 27117, 17262, 10750, 35166, 83, 425, 3650, ...

[ 0.14306640625, 0.107666015625, 0.10986328125, 0.1800537109375, 0.1431884765625, 0.119873046875, 0.1934814453125, 0.0103759765625, 0.0692138671875, 0.1243896484375, 0.0160064697265625, 0.00457763671875, 0.0511474609375, 0.1131591796875, 0.0207977294921875, 0.1580810546875, 0.172241210...

embed

60764963_c1

60764963

haskell

1

>>= (`shouldBe` val) it "should throw error if it gets a Nothing" $ do (run extract $ do I.mustEvalExpr badExpr ) `shouldThrow` anyException Question Is this the best I can do? I feel like run extract $ do is fine, and I think it's good to be explicit when things are complicated. But I was wondering if there was a way...

[ -0.00872802734375, 0, 0.0167236328125, -0.021484375, 0.0167236328125, 0.02392578125, 0.009765625, -0.021240234375, 0.00836181640625, -0.03857421875, -0.004608154296875, -0.004486083984375, -0.01312255859375, 0.006683349609375, 0.01214599609375, 0.00811767578125, 0.00531005859375, 0...

[ 6396, 1369, 11412, 52366, 6766, 3502, 442, 104250, 18499, 2174, 62163, 10, 182747, 3650, 54, 16428, 125663, 2647, 18, 647, 1405, 19279, 10287, 6494, 20800, 15555, 2499, 63928, 903, 70, 2965, 831, 12319, 11675, 5885, 4127, 143726, 621, 96704...

[ 0.07501220703125, 0.146484375, 0.124267578125, 0.1873779296875, 0.2054443359375, 0.233154296875, 0.049407958984375, 0.1768798828125, 0.23193359375, 0.08447265625, 0.108642578125, 0.000579833984375, 0.22509765625, 0.1829833984375, 0.138916015625, 0.147705078125, 0.273681640625, 0.07...

embed

34134058_c0

34134058

haskell

0

Title: Syntax in Haskell/Elm Problem title: Syntax in Haskell/Elm Tags: elm, haskell Problem: Syntax in Haskell/Elm Can't find anything about this syntax in Haskel/Elm: bar day yOffset = rect [ x <| toString <| (day.xOffset * (barWidth + barMargin)), y <| toString <| if day.amount <= 0 then yOffset else yOffset - day.a...

Syntax in Haskell/Elm Syntax in Haskell/Elm elm haskell Syntax Haskell Elm day.xOffset day.amount Svg.title day.day List.map x.words List.minimum Maybe.withDefault Syntax in Haskell/Elm Can't find anything about this syntax in Haskel/Elm: What does mean <| and |> ?

[ 0.01422119140625, 0.005584716796875, 0.0035247802734375, 0.010498046875, -0.011474609375, 0.01446533203125, -0.007171630859375, 0.014404296875, 0.000804901123046875, -0.00457763671875, -0.0069580078125, 0.01123046875, -0.0069580078125, -0.003662109375, -0.00093841552734375, -0.03784179...

[ 19010, 86531, 20625, 142508, 64, 7623, 39, 23, 88, 1556, 540, 5155, 425, 150369, 3509, 121147, 33214, 177, 5440, 5636, 32036, 62346, 47416, 9222, 24105, 83425, 76228, 187423, 11, 7136, 903, 6002, 2590, 4865, 14602, 29459, 58745, 136, 2740 ]

[ 0.1451416015625, 0.1910400390625, 0.1143798828125, 0.228271484375, 0.04595947265625, 0.158935546875, 0.1663818359375, 0.02569580078125, 0.11279296875, 0.10076904296875, 0.153564453125, 0.138671875, 0.037750244140625, 0.1246337890625, 0.1297607421875, 0.1512451171875, 0.05670166015625...

embed

55348906_c0

55348906

haskell

0

Title: How would I find the distance between two elements in a list? Problem title: How would I find the distance between two elements in a list? Tags: haskell Problem: How would I find the distance between two elements in a list? I have to find the distance between first appearance of two elements in a list. The progr...

How would I find the distance between two elements in a list? How would I find the distance between two elements in a list? haskell How Maybe Just Nothing How would I find the distance between two elements in a list? I have to find the distance between first appearance of two elements in a list. The program we are usin...

[ 0.01153564453125, 0.01361083984375, 0.0028533935546875, 0.0005645751953125, 0.004425048828125, 0.04345703125, 0.018310546875, 0.0225830078125, 0.00970458984375, 0.0084228515625, 0.006072998046875, -0.023193359375, -0.01153564453125, 0.00159454345703125, -0.00836181640625, 0.001953125, ...

[ 11249, 2806, 87, 7413, 70, 62488, 17721, 6626, 80854, 23, 5303, 1556, 142508, 83425, 9563, 182747, 10, 765, 5117, 170894, 1528, 17368, 20625, 1118, 21997, 112045, 4358, 4034, 48225, 86869, 30607, 3642, 13204, 449, 442, 43599, 1984, 864, 330...

[ 0.08160400390625, 0.09954833984375, 0.042327880859375, 0.166748046875, 0.1318359375, 0.291748046875, 0.1953125, 0.1573486328125, 0.202392578125, 0.072998046875, 0.229248046875, 0.1224365234375, 0.243896484375, 0.1903076171875, 0.09051513671875, 0.201904296875, 0.08782958984375, 0.0...

embed

63042751_c5

63042751

haskell

5

638xm37wl94la8dxlbjaq-zlib-1.2.11-dev, in9vak3zphkx9c635iz639iabgrib2fl-postgresql-11.8, qsarmp3rsyvhb7m22xl0fdpsnaf3lv6b-pcre-8.44-dev, pkg-config-wrapper-0.29.2, v1v3flnwxs3n5lhfrfrs16rcygjzzhmy-zookeeper-3.4.13, grng8b5wmrppx2rmcsqkmjyq23bj1j38-zookeeper_mt-3.4.13, qqra09ff0q8vwqicjs20fn1rvn00k6fy-ghc-8.8.3, pj43dfd...

[ -0.007568359375, -0.0079345703125, -0.0027313232421875, 0.01055908203125, -0.000919342041015625, 0.00433349609375, -0.0211181640625, -0.020751953125, -0.006561279296875, 0.014892578125, 0.0164794921875, -0.010986328125, 0.0024261474609375, -0.000537872314453125, -0.00909423828125, 0.02...

[ 6, 190076, 10945, 27751, 14889, 864, 9, 169, 5612, 48400, 5, 1662, 18548, 4, 1126, 30987, 166000, 163709, 11049, 15991, 4594, 17562, 99247, 5759, 119044, 7612, 163883, 35748, 8517, 153837, 5429, 11, 8079, 133684, 151309, 2485, 1176, 1158, 3...

[ 0.0599365234375, 0.18896484375, 0.0693359375, 0.034912109375, 0.08837890625, 0.0606689453125, 0.0684814453125, 0.09417724609375, 0.28955078125, 0.2083740234375, 0.09893798828125, 0.1964111328125, 0.233154296875, 0.08056640625, 0.0203094482421875, 0.07763671875, 0.031951904296875, 0...

embed

11178572_c0

11178572

haskell

0

Title: Deriving PathInfo class in web routes? Problem title: Deriving PathInfo class in web routes? Tags: happstack, haskell Problem: Deriving PathInfo class in web routes? I am reading the web-routes tutorial in Happstack, and I have no idea what this is doing: $(derivePathInfo ''Sitemap) class PathInfo a where toPath...

Deriving PathInfo class in web routes? Deriving PathInfo class in web routes? happstack haskell Deriving PathInfo Sitemap URLParser Deriving PathInfo class in web routes? I am reading the web-routes tutorial in Happstack, and I have no idea what this is doing: The doc simply says: but where does it "store" it? I though...

[ 0.025390625, 0.0186767578125, 0, 0.01373291015625, -0.0048828125, 0.0081787109375, -0.00439453125, -0.01104736328125, 0.0031280517578125, -0.04296875, -0.01263427734375, -0.021728515625, -0.00872802734375, 0.003509521484375, -0.0218505859375, 0.017822265625, -0.0016937255859375, 0....

[ 1310, 14, 6496, 108421, 93147, 18507, 23, 1467, 36439, 7, 32, 256, 6366, 590, 2594, 1556, 142508, 200033, 31862, 28636, 2189, 16454, 133261, 57143, 208612, 110, 6528, 2367, 903, 20594, 51584, 42856, 17378, 1284, 7440, 14602, 442, 45804, 175...

[ 0.1160888671875, 0.1080322265625, 0.1142578125, 0.2354736328125, 0.320068359375, 0.2186279296875, 0.07659912109375, 0.1484375, 0.2010498046875, 0.0855712890625, 0.007598876953125, 0.0997314453125, 0.1085205078125, 0.1265869140625, 0.1474609375, 0.150390625, 0.2442626953125, 0.25048...

embed

20509739_c0

20509739

haskell

0

Title: Record syntax for QuasiQuoter constructor Problem title: Record syntax for QuasiQuoter constructor Tags: haskell, template-haskell Problem: Record syntax for QuasiQuoter constructor The documentation for template Haskell says that QuasiQuoter is defined as data QuasiQuoter = QuasiQuoter { quoteExp :: String -> Q...

Record syntax for QuasiQuoter constructor Record syntax for QuasiQuoter constructor haskell template-haskell Record QuasiQuoter Exp Pat Type Dec Record syntax for QuasiQuoter constructor The documentation for template Haskell says that QuasiQuoter is defined as I have encountered examples such as silly shown below. How...

[ -0.01239013671875, 0.003662109375, -0.0017852783203125, -0.00139617919921875, -0.004852294921875, 0.00119781494140625, 0.0002288818359375, 0.001922607421875, 0.00506591796875, 0.006591796875, 0.007354736328125, -0.0235595703125, 0.0194091796875, -0.01324462890625, -0.0084228515625, -0....

[ 54877, 6002, 86531, 19559, 172, 31583, 31, 720, 64549, 748, 1556, 142508, 110934, 10557, 60075, 9876, 60457, 25755, 209806, 20625, 61924, 190647, 27781, 78, 12097, 127887, 35064, 4488, 18, 26292, 23, 66747, 683, 257, 196707, 120152, 44457 ]

[ 0.2113037109375, 0.1251220703125, 0.15478515625, 0.1495361328125, 0.126708984375, 0.1558837890625, 0.094970703125, 0.1875, 0.1610107421875, 0.053009033203125, 0.0770263671875, 0.193603515625, 0.173583984375, 0.0609130859375, 0.11572265625, 0.119140625, 0.1351318359375, 0.1580810546...

embed

20669295_c0

20669295

haskell

0

Title: Haskell - sum a list of lists using foldr/foldl Problem title: Haskell - sum a list of lists using foldr/foldl Tags: haskell, list Problem: Haskell - sum a list of lists using foldr/foldl I'm trying to write functions to sum a list of lists (type Integer ). I have already done it using map : summat :: [[Integer]...

Haskell - sum a list of lists using foldr/foldl Haskell - sum a list of lists using foldr/foldl haskell list foldr/foldl Haskell Integer x:xs summat2 Haskell - sum a list of lists using foldr/foldl I'm trying to write functions to sum a list of lists (type Integer ). I have already done it using map : but can't figure ...

[ -0.0020751953125, -0.01080322265625, -0.00167083740234375, -0.0078125, -0.021484375, 0.006622314453125, -0.0101318359375, 0.01239013671875, 0.00775146484375, -0.04052734375, 0.0016937255859375, -0.048095703125, 0.006805419921875, -0.006195068359375, -0.0126953125, -0.0166015625, -0.0...

[ 20625, 142508, 10554, 5303, 111, 7, 17368, 18344, 7569, 64, 42822, 141, 10, 1556, 44401, 1022, 425, 29334, 18, 304, 31577, 33022, 32354, 50986, 16940, 22288, 831, 26366, 4488, 248, 20469, 37842, 1884, 27489, 5941, 18499, 5122, 158, 4460 ]

[ 0.12255859375, 0.238037109375, 0.2357177734375, 0.2236328125, 0.0946044921875, 0.06695556640625, 0.086669921875, 0.1517333984375, 0.2255859375, 0.047515869140625, 0.166259765625, 0.1695556640625, 0.0235595703125, 0.1224365234375, 0.1710205078125, 0.0469970703125, 0.048675537109375, ...

embed

74697521_c1

74697521

haskell

1

[ 0.01007080078125, 0.004058837890625, -0.01513671875, 0.028564453125, 0.009521484375, 0.003204345703125, 0.0302734375, 0.000583648681640625, 0.00946044921875, -0.000431060791015625, 0.003662109375, 0.006866455078125, -0.0062255859375, 0.00128936767578125, -0.01251220703125, 0.0125122070...

[ 2053, 60075, 2203, 10842, 23351, 214, 141, 16406, 6496, 17367, 8183, 2994, 24169, 7, 153, 717, 1098, 4153, 18, 360, 365, 257, 38699, 316, 88225, 95, 34058, 4439, 83, 141012, 20763, 14055, 15769, 75675, 839, 238, 864, 39116, 13269, 10588, ...

[ 0.2310791015625, 0.2391357421875, 0.070556640625, 0.175537109375, 0.2125244140625, 0.08416748046875, 0.1939697265625, 0.1361083984375, 0.0966796875, 0.227783203125, 0.1580810546875, 0.09320068359375, 0.1759033203125, 0.0635986328125, 0.0176849365234375, 0.1458740234375, 0.24060058593...

embed

4302900_c1

4302900

haskell

1

, Nothing,Just 4, Just 7, Nothing,Nothing] , [Nothing,Nothing,Nothing,Nothing,Just 1, Just 3, Nothing,Just 2, Just 8] , [Just 4, Nothing,Nothing,Just 5, Nothing,Just 2, Nothing,Nothing,Just 9] , [Just 2, Just 7, Nothing,Just 4, Just 6, Nothing,Nothing,Nothing,Nothing] , [Nothing,Nothing,Just 5, Just 3, Nothing,Just 8, ...

[ -0.004974365234375, 0.0184326171875, 0.025390625, 0.000762939453125, -0.008056640625, 0.0091552734375, 0.01141357421875, -0.0120849609375, -0.00156402587890625, 0.0235595703125, -0.0048828125, -0.01202392578125, -0.025146484375, 0.021728515625, -0.029541015625, 0.031005859375, -0.019...

[ 4, 182747, 127794, 201, 9563, 361, 5021, 64113, 268, 378, 106, 138, 116, 382, 190, 483, 305, 11853, 3642, 8932, 38067, 83, 61924, 71, 2053, 15334, 2203, 10666, 15555, 1984, 82419, 372, 360, 18, 16406, 6496, 17367, 864, 28864, 26073, 12,...

[ 0.0819091796875, 0.248046875, 0.1793212890625, 0.233642578125, 0.1859130859375, 0.1824951171875, 0.06903076171875, 0.186279296875, 0.02398681640625, 0.00848388671875, 0.08740234375, 0.1400146484375, 0.0697021484375, 0.13818359375, 0.0921630859375, 0.1778564453125, 0.1077880859375, ...

embed

49491461_c0

49491461

haskell

0

Title: What does split in Haskell do? Problem title: What does split in Haskell do? Tags: haskell, split, reverse, functional-programming Problem: What does split in Haskell do? I'm new to Haskell and I came into the code below and don't actually understand what it does. I know that the toDigits function is declared to...

What does split in Haskell do? What does split in Haskell do? haskell split reverse functional-programming What Haskell Integer What does split in Haskell do? I'm new to Haskell and I came into the code below and don't actually understand what it does. I know that the toDigits function is declared to take an Integer an...

[ -0.021240234375, 0.01519775390625, -0.00153350830078125, -0.00634765625, -0.038818359375, 0.031494140625, 0.0142822265625, 0.01177978515625, 0.0059814453125, 0.004241943359375, 0.01611328125, -0.0078125, -0.02490234375, -0.00032806396484375, -0.00030517578125, -0.00592041015625, 0.00...

[ 4865, 14602, 65450, 23, 20625, 142508, 54, 1556, 39531, 184, 123309, 28966, 44401, 3525, 47, 18151, 35064, 2301, 18, 28219, 2367, 442, 3714, 14055, 15769, 7, 32354, 83, 159978, 5646, 136, 30646, 10298, 91, 4263, 10750, 653, 105950, 757, 7...

[ 0.1156005859375, 0.106201171875, 0.283447265625, 0.1126708984375, 0.154296875, 0.264404296875, 0.11865234375, 0.1224365234375, 0.1607666015625, 0.0828857421875, 0.11376953125, 0.0673828125, 0.2158203125, 0.027099609375, 0.1729736328125, 0.047943115234375, 0.04400634765625, 0.018310...

embed

49614566_c1

49614566

haskell

1

1.0.1, libdrm_nouveau.so.2.0.0, libdrm_intel.so.1.0.0, libz.so.1.2.8, i965_dri.so, libXi.so.6.1.0, libglut.so.3.9.0, libXdmcp.so.6.0.0, libXau.so.6.0.0, libpthread-2.23.so, libdrm.so.2.4.0, libXxf86vm.so.1.0.0, libxcb.so.1.1.0, libxcb-dri2.so.0.0.0, libxcb-glx.so.0.0.0, libX11.so.6.3.0, libX11-xcb.so.1.0.0, libXfixes.s...

0.3.0 libdl-2.23.so libutil-2.23.so librt-2.23.so libGL.so.1.2.0 libGLU.so.1.3.1 libm-2.23.so ld-2.23.so ffffffffff600000-ffffffffff601000 Abandon Cannot use Haskell OpenGL on Linux Edit: My package opengl-examples works very well, so this is an issue with the FFI. I wanted to try my opengl-implicit package on another ...

[ -0.02685546875, -0.02685546875, -0.0067138671875, 0.00125885009765625, -0.000469207763671875, 0.0185546875, 0.006866455078125, -0.000965118408203125, 0.004302978515625, 0.0125732421875, 0.01409912109375, -0.016845703125, 0.0125732421875, 0.0062255859375, -0.00830078125, -0.026489257812...

[ 757, 132265, 25474, 20469, 5428, 3742, 991, 400, 8789, 379, 3198, 78703, 5, 73011, 22335, 22892, 97109, 39, 10715, 4598, 14105, 8262, 191, 4171, 10869, 4527, 20625, 142508, 13527, 98, 29908, 98169, 9803, 11016, 3355, 302, 99726, 43240, 4552...

[ 0.07525634765625, 0.14501953125, 0.102783203125, 0.148681640625, 0.023895263671875, 0.1268310546875, 0.123779296875, 0.0239715576171875, 0.0311279296875, 0.086669921875, 0.064453125, 0.25537109375, 0.0169219970703125, 0.048828125, 0.1328125, 0.00006103515625, 0.0849609375, 0.038085...

embed