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
33130252_c1	33130252	haskell	1	works as expected, because I got past an error about pg_config missing, to the error I currently have. Second, I also tried adding the lib and include directories to my PATH, but this did not change the error. I should also mention my Postgres installation works fine on its own. Code signals: --extra-include-dirs, lib...	works as expected, because I got past an error about pg_config missing, to the error I currently have. Second, I also tried adding the lib and include directories to my PATH, but this did not change the error. I should also mention my Postgres installation works fine on its own. Code signals: --extra-include-dirs, lib...	[ 0.005035400390625, 0.02099609375, -0.00726318359375, 0.0169677734375, -0.01025390625, 0.01190185546875, -0.006317138671875, 0.00136566162109375, -0.0048828125, -0.012939453125, 0.0076904296875, -0.0235595703125, 0.021728515625, -0.00714111328125, -0.01043701171875, 0.00799560546875, ...	[ 43240, 237, 84751, 4, 6637, 11015, 18499, 915, 177, 454, 153837, 132283, 47, 87, 82424, 765, 5, 77648, 37842, 154107, 70, 25474, 26698, 14364, 3387, 759, 436, 139909, 959, 15549, 2795, 17562, 59720, 5885, 6863, 10002, 28864, 26073, 112779, ...	[ 0.1654052734375, 0.0906982421875, 0.146484375, 0.004974365234375, 0.009368896484375, 0.1192626953125, 0.17333984375, 0.07366943359375, 0.1634521484375, 0.03546142578125, 0.276123046875, 0.1549072265625, 0.011566162109375, 0.010284423828125, 0.087890625, 0.039642333984375, 0.046386718...	embed
34789371_c0	34789371	haskell	0	Title: Why are arbitrary sized tuples useful? (Template Haskell) Problem title: Why are arbitrary sized tuples useful? (Template Haskell) Tags: tuples, list, template-haskell, haskell Problem: Why are arbitrary sized tuples useful? (Template Haskell) In the introductory text for Template Haskell one of the examples for...	Why are arbitrary sized tuples useful? (Template Haskell) Why are arbitrary sized tuples useful? (Template Haskell) tuples list template-haskell haskell Why Template Haskell Why are arbitrary sized tuples useful? (Template Haskell) In the introductory text for Template Haskell one of the examples for why Template Haske...	[ 0.0194091796875, -0.000058650970458984375, 0.002655029296875, 0.0093994140625, 0.0035400390625, 0.0033721923828125, -0.006317138671875, -0.00160980224609375, 0.01251220703125, -0.0021209716796875, -0.010009765625, -0.054443359375, 0.003936767578125, 0.01226806640625, 0.00469970703125, ...	[ 44084, 621, 61799, 1294, 13267, 71, 370, 99726, 80234, 159065, 19309, 20625, 142508, 5303, 110934, 10557, 1556, 196631, 39864, 7986, 27781, 15400, 20697, 678, 4865, 60042, 111, 2053, 10644, 5701, 959, 4527, 52895, 8705, 12921, 71062 ]	[ 0.1328125, 0.033477783203125, 0.1634521484375, 0.1051025390625, 0.1427001953125, 0.07275390625, 0.151611328125, 0.233642578125, 0.1759033203125, 0.1031494140625, 0.08203125, 0.1102294921875, 0.2186279296875, 0.1318359375, 0.200439453125, 0.0654296875, 0.08203125, 0.2288818359375, ...	embed
14657746_c0	14657746	haskell	0	Title: xmonad will behave abnormally if compiled with "ghc -threaded" Problem title: xmonad will behave abnormally if compiled with "ghc -threaded" Tags: xmonad, haskell Problem: xmonad will behave abnormally if compiled with "ghc -threaded" The xmonad created using xmonad --recompile works great. H...	xmonad will behave abnormally if compiled with "ghc -threaded" xmonad will behave abnormally if compiled with "ghc -threaded" xmonad haskell xmonad will behave abnormally if compiled with "ghc -threaded" The xmonad created using xmonad --recompile works great. However, if we build xmonad using 'ghc ...	[ -0.0045166015625, 0.01422119140625, 0.00439453125, 0.004974365234375, 0.0021514892578125, 0.009033203125, -0.01434326171875, 0.01214599609375, -0.0152587890625, -0.0478515625, 0.0220947265625, 0.00653076171875, -0.006439208984375, -0.0228271484375, -0.00101470947265625, 0.0006065368652...	[ 1022, 3796, 712, 68991, 1563, 33176, 375, 5974, 678, 9486, 238, 39116, 297, 1556, 142508, 1221, 75935, 17368, 4210, 107, 58875, 1340, 43240, 6782, 45367, 127, 7, 151134, 9351, 59499, 13651, 105742, 32087, 16145, 71, 186, 22799, 80934, 4488,...	[ 0.08721923828125, 0.1580810546875, 0.189208984375, 0.11474609375, 0.0239410400390625, 0.1085205078125, 0.03131103515625, 0.15673828125, 0.009368896484375, 0.087158203125, 0.110595703125, 0.135009765625, 0.05865478515625, 0.0732421875, 0.202880859375, 0.0230560302734375, 0.06103515625...	embed
2423894_c0	2423894	haskell	0	Title: Using Haskell's Parsec to parse binary files? Problem title: Using Haskell's Parsec to parse binary files? Tags: haskell, parsing, binary Problem: Using Haskell's Parsec to parse binary files? Parsec is designed to parse textual information, but it occurs to me that Parsec could also be suitable to do ...	Using Haskell's Parsec to parse binary files? Using Haskell's Parsec to parse binary files? haskell parsing binary Using Haskell Parsec Using Haskell's Parsec to parse binary files? Parsec is designed to parse textual information, but it occurs to me that Parsec could also be suitable to do binary file format...	[ -0.0026397705078125, 0.0108642578125, 0.00982666015625, 0.04638671875, -0.00173187255859375, 0.0274658203125, -0.00201416015625, -0.0296630859375, -0.00836181640625, -0.0032196044921875, 0.00286865234375, -0.01263427734375, -0.00238037109375, 0.01007080078125, 0.00146484375, 0.02490234...	[ 345, 6953, 20625, 142508, 3768, 2392, 39797, 47, 366, 184, 2394, 6635, 102158, 1556, 83, 82775, 90426, 4677, 5809, 202319, 54, 11435, 9384, 27140, 83687, 35431, 33180, 1810, 80596, 81273, 21373, 30700, 98169, 14602, 903, 2965, 3917 ]	[ 0.09564208984375, 0.096923828125, 0.142822265625, 0.2398681640625, 0.060546875, 0.1788330078125, 0.272705078125, 0.0430908203125, 0.1737060546875, 0.1280517578125, 0.1905517578125, 0.16259765625, 0.1763916015625, 0.1259765625, 0.002960205078125, 0.164306640625, 0.126220703125, 0.10...	embed
40444687_c0	40444687	haskell	0	Title: Haskell: How to change algorithm to work on any size of list? Problem title: Haskell: How to change algorithm to work on any size of list? Tags: haskell, algorithm Problem: Haskell: How to change algorithm to work on any size of list? x=take 1 project main = print $ x it is return a list of 3 pairs [(x,y),(x,y),...	Haskell: How to change algorithm to work on any size of list? Haskell: How to change algorithm to work on any size of list? haskell algorithm Haskell How Haskell: How to change algorithm to work on any size of list? I have this code: it is return a list of 3 pairs [(x,y),(x,y),(x,y)] . There are 3 conditions: If you su...	[ -0.00921630859375, 0.0211181640625, 0.010009765625, 0.015625, -0.005706787109375, -0.000308990478515625, -0.0216064453125, 0.018310546875, 0.004669189453125, -0.003997802734375, 0.01275634765625, -0.0137939453125, 0.0093994140625, 0.0096435546875, -0.013671875, 0.0029449462890625, 0....	[ 20625, 142508, 11249, 47, 15549, 234873, 4488, 98, 2499, 13267, 5303, 12, 111, 1556, 765, 903, 18151, 30646, 138, 80836, 425, 53, 27289, 4263, 398, 10554, 756, 1022, 8110, 2046, 1892, 1639, 40715, 2289, 19713, 1632, 113, 450, 105950, 1031...	[ 0.167724609375, 0.268798828125, 0.130859375, 0.1072998046875, 0.22900390625, 0.2919921875, 0.161865234375, 0.09381103515625, 0.12890625, 0.1783447265625, 0.2183837890625, 0.000762939453125, 0.04864501953125, 0.160888671875, 0.016204833984375, 0.010711669921875, 0.114501953125, 0.15...	embed
20821432_c0	20821432	haskell	0	Title: cabal-dev install Happstack-server how Problem title: cabal-dev install Happstack-server how Tags: cabal-dev, haskell Problem: cabal-dev install Happstack-server how here is what I did: makdir happstack_01 cabal-dev install happstack-server write the typical helloworld.hs with "import Happstack.Server (nullConf,...	cabal-dev install Happstack-server how cabal-dev install Happstack-server how cabal-dev haskell Happstack-server cabal-dev install Happstack-server how here is what I did: makdir happstack_01 cabal-dev install happstack-server write the typical helloworld.hs with "import Happstack.Server (nullConf, simpleHTTP, toRespon...	[ 0.00140380859375, -0.00885009765625, -0.00130462646484375, 0.02783203125, -0.0108642578125, 0.00640869140625, 0.009033203125, -0.00194549560546875, 0.000850677490234375, -0.03173828125, -0.007080078125, -0.036865234375, 0.0101318359375, 0.0084228515625, 0.01611328125, 0.00982666015625,...	[ 109524, 18548, 20600, 208612, 590, 2594, 39642, 3642, 1556, 142508, 17719, 936, 256, 6366, 6746, 33022, 222201, 33600, 31, 32554, 127, 60270, 193348, 139550, 11935, 420, 8781, 23658, 47, 94399, 3664, 31380, 39116, 35378, 70646, 191147, 959, 7...	[ 0.2137451171875, 0.2039794921875, 0.17529296875, 0.2398681640625, 0.1986083984375, 0.20263671875, 0.1846923828125, 0.051025390625, 0.13720703125, 0.2044677734375, 0.05804443359375, 0.1103515625, 0.118896484375, 0.142822265625, 0.0479736328125, 0.049591064453125, 0.061309814453125, ...	embed
47686289_c0	47686289	haskell	0	Title: Why is `Functor ((->) r)` not shown on the Functor documentation Problem title: Why is `Functor ((->) r)` not shown on the Functor documentation Tags: haskell, functor Problem: Why is `Functor ((->) r)` not shown on the Functor documentation In the source code, https://hackage.haskell.org/package/base-4.10...	Why is `Functor ((->) r)` not shown on the Functor documentation Why is `Functor ((->) r)` not shown on the Functor documentation haskell functor Why Functor Why is `Functor ((->) r)` not shown on the Functor documentation In the source code, https://hackage.haskell.org/package/base-4.10.1.0/docs/src/GHC.Base.htm...	[ 0.02685546875, -0.0084228515625, 0.0196533203125, -0.0191650390625, 0.006988525390625, 0.01446533203125, -0.00372314453125, -0.0184326171875, 0.0023345947265625, 0.000354766845703125, -0.004730224609375, -0.0211181640625, -0.0033416748046875, 0.01019287109375, -0.01434326171875, -0.002...	[ 44084, 83, 97249, 18770, 60494, 9, 1230, 5386, 1690, 959, 127887, 28670, 209806, 1556, 142508, 7477, 9473, 103607, 31344, 18151, 139509, 4588, 10557, 1478, 29102, 37382, 11565, 10179, 102107, 29713, 19437, 41877, 441, 63473, 7693, 84632, 418, ...	[ 0.1158447265625, 0.0149688720703125, 0.235107421875, 0.2347412109375, 0.128662109375, 0.0858154296875, 0.06317138671875, 0.1495361328125, 0.1832275390625, 0.1329345703125, 0.18994140625, 0.2125244140625, 0.209228515625, 0.1038818359375, 0.201416015625, 0.12451171875, 0.00277709960937...	embed
66528701_c0	66528701	haskell	0	Title: I have installed cassava-0.5.2.0, but the compiler is still complaining Problem title: I have installed cassava-0.5.2.0, but the compiler is still complaining Tags: haskell-stack, haskell Problem: I have installed cassava-0.5.2.0, but the compiler is still complaining I am trying to get Cassava up and running. I...	I have installed cassava-0.5.2.0, but the compiler is still complaining I have installed cassava-0.5.2.0, but the compiler is still complaining haskell-stack haskell Data.Csv qualified cassava-0.5.2.0 Data.Vector Could I have installed cassava-0.5.2.0, but the compiler is still complaining I am trying to get Cassava up...	[ -0.00848388671875, 0.0079345703125, -0.0032806396484375, 0.04248046875, 0.005218505859375, 0.022216796875, 0.0072021484375, 0.005767822265625, -0.0191650390625, -0.007720947265625, -0.019287109375, -0.053955078125, 0.0106201171875, 0.005889892578125, 0.000934600830078125, -0.0092773437...	[ 765, 20600, 377, 1192, 330, 93645, 73011, 1284, 9969, 34759, 7464, 186992, 214, 1556, 142508, 590, 2594, 11809, 5, 441, 67756, 217225, 26455, 18770, 191147, 297, 31577, 103978, 5528, 51042, 65771, 3229, 9790, 1340, 16195, 19514, 678, 18499, ...	[ 0.048736572265625, 0.1634521484375, 0.074462890625, 0.1322021484375, 0.259033203125, 0.2215576171875, 0.1912841796875, 0.050262451171875, 0.1533203125, 0.1739501953125, 0.09747314453125, 0.187744140625, 0.05303955078125, 0.1075439453125, 0.219970703125, 0.08013916015625, 0.0955200195...	embed
31711599_c1	31711599	haskell	1	o test test.c: #include "HsFFI.h" extern void __stginit_Test(void); extern void test(); int main(int argc, char *argv[]) { hs_init(&argc, &argv); hs_add_root(__stginit_Test); int i; for (i = 0; i < 100000000; i++) { test(); } hs_exit(); return 0; } test2.c: void test() { } Test.hs: {-# LANGUAGE ForeignFunctionInterface...	o test test.c: #include "HsFFI.h" extern void __stginit_Test(void); extern void test(); int main(int argc, char *argv[]) { hs_init(&argc, &argv); hs_add_root(__stginit_Test); int i; for (i = 0; i < 100000000; i++) { test(); } hs_exit(); return 0; } test2.c: void test() { } Test.hs: {-# LANGUAGE ForeignFunctionInterface...	[ 0.01531982421875, -0.0006561279296875, -0.0196533203125, -0.001922607421875, 0.0101318359375, -0.0087890625, 0.009033203125, -0.000713348388671875, -0.0020751953125, -0.017333984375, -0.0106201171875, -0.0152587890625, -0.0162353515625, 0.01495361328125, 0.0181884765625, 0.005767822265...	[ 36, 3034, 5, 238, 12, 468, 217028, 841, 7, 30110, 568, 127, 76714, 2292, 71, 271, 39402, 18, 111337, 965, 532, 3142, 23, 5201, 4288, 79459, 21441, 61477, 334, 1096, 73, 217, 132, 1230, 11, 4028, 148920, 17, 100, 14, 757, 4426, 805, ...	[ 0.2060546875, 0.25146484375, 0.015380859375, 0.1025390625, 0.07696533203125, 0.0418701171875, 0.2425537109375, 0.0865478515625, 0.1036376953125, 0.1656494140625, 0.139404296875, 0.16650390625, 0.15625, 0.1575927734375, 0.021087646484375, 0.01373291015625, 0.06878662109375, 0.118041...	embed
18605310_c0	18605310	haskell	0	Title: How to change function calls with parenthesis using composition in Haskell? Problem title: How to change function calls with parenthesis using composition in Haskell? Tags: haskell Problem: How to change function calls with parenthesis using composition in Haskell? Here's what I write: (take 2 (repeat " ")) I wa...	How to change function calls with parenthesis using composition in Haskell? How to change function calls with parenthesis using composition in Haskell? haskell composition How Haskell How to change function calls with parenthesis using composition in Haskell? Here's what I write: (take 2 (repeat " ")) I want to change ...	[ -0.03466796875, -0.0103759765625, 0.000797271728515625, 0.048828125, 0.00823974609375, 0.02490234375, 0.00029754638671875, 0.010009765625, 0.006378173828125, -0.028076171875, -0.006683349609375, 0.01470947265625, -0.0023193359375, 0.007232666015625, 0.010986328125, -0.01312255859375, ...	[ 11249, 47, 15549, 32354, 11782, 678, 49129, 160291, 7, 166577, 20625, 142508, 17368, 23, 1556, 33022, 78219, 116, 107, 1081, 257, 44, 3444, 14700, 42, 15490, 4171, 4527, 1242, 1884, 221, 405, 49725, 3331, 1076, 7840, 24084, 836, 1022, 801...	[ 0.05194091796875, 0.0531005859375, 0.209228515625, 0.1934814453125, 0.189208984375, 0.0894775390625, 0.148193359375, 0.182861328125, 0.0511474609375, 0.2479248046875, 0.135498046875, 0.2369384765625, 0.02496337890625, 0.0281524658203125, 0.1192626953125, 0.033843994140625, 0.15917968...	embed
25698518_c0	25698518	haskell	0	Title: configure ghc's default output file extension? Problem title: configure ghc's default output file extension? Tags: haskell, ghc Problem: configure ghc's default output file extension? When I have a file foo.hs and run ghc foo.hs , it generates a binary file without an extension, foo . This is rather in...	configure ghc's default output file extension? configure ghc's default output file extension? haskell ghc foo.hs configure ghc's default output file extension? When I have a file foo.hs and run ghc foo.hs , it generates a binary file without an extension, foo . This is rather inconvenient for ignoring by .git...	[ 0.00762939453125, 0.005126953125, 0.0032196044921875, -0.0033111572265625, -0.00994873046875, -0.01953125, -0.0390625, 0.003082275390625, -0.0019073486328125, 0.00244140625, -0.0014495849609375, 0.00555419921875, -0.01007080078125, 0.0081787109375, -0.00872802734375, -0.007110595703125...	[ 222495, 31380, 238, 3768, 114977, 140992, 11435, 111938, 1556, 142508, 5775, 31, 127, 7, 765, 11675, 139392, 2394, 6635, 15490, 192206, 47438, 15769, 167790, 13, 3714, 3917, 3789, 6056, 5809, 33022, 8781, 128019, 26499, 5868, 876 ]	[ 0.2269287109375, 0.1534423828125, 0.14697265625, 0.055999755859375, 0.2357177734375, 0.20458984375, 0.1724853515625, 0.20361328125, 0.12890625, 0.218017578125, 0.1590576171875, 0.1729736328125, 0.13916015625, 0.00726318359375, 0.002166748046875, 0.0758056640625, 0.1312255859375, 0....	embed
38375984_c0	38375984	haskell	0	Title: HOWTO transform a tuple of functions into a function that emits a tuple Problem title: HOWTO transform a tuple of functions into a function that emits a tuple Tags: tuples, haskell, functional-programming Problem: HOWTO transform a tuple of functions into a function that emits a tuple Given that I have a tuple o...	HOWTO transform a tuple of functions into a function that emits a tuple HOWTO transform a tuple of functions into a function that emits a tuple tuples haskell functional-programming HOWTO HOWTO transform a tuple of functions into a function that emits a tuple Given that I have a tuple of functions with the same input b...	[ -0.00099945068359375, 0.00007486343383789062, -0.00012683868408203125, 0.0203857421875, -0.0111083984375, 0.0027313232421875, -0.0242919921875, -0.026611328125, 0.017333984375, -0.01513671875, -0.00872802734375, 0.004913330078125, -0.002532958984375, 0.0390625, -0.01287841796875, -0.00...	[ 21997, 150042, 27198, 370, 8705, 111, 32354, 3934, 450, 53225, 7, 10, 99726, 1556, 142508, 123309, 28966, 765, 678, 5701, 107730, 1284, 12921, 140992, 11249, 96760, 30646, 107013, 189534, 29806, 2967, 9351, 28864, 27781, 77947 ]	[ 0.1312255859375, 0.283447265625, 0.188720703125, 0.1702880859375, 0.2337646484375, 0.0689697265625, 0.2247314453125, 0.1094970703125, 0.027099609375, 0.2271728515625, 0.044525146484375, 0.029144287109375, 0.200439453125, 0.1322021484375, 0.207275390625, 0.1357421875, 0.09429931640625...	embed
29996688_c0	29996688	haskell	0	Title: GHCI 7.8.3 does not support utf8 characters Problem title: GHCI 7.8.3 does not support utf8 characters Tags: ghc, ghci, haskell, utf-8 Problem: GHCI 7.8.3 does not support utf8 characters I've read in the utf8-string package that ghc should support utf8 by default. I've even seen somewhere being written that now...	GHCI 7.8.3 does not support utf8 characters GHCI 7.8.3 does not support utf8 characters ghc ghci haskell utf-8 GHCI utf8 asd.txt Exception filenames.txt utf-8 GHCI 7.8.3 does not support utf8 characters I've read in the utf8-string package that ghc should support utf8 by default. I've even seen somewhere being written ...	[ 0.003509521484375, 0.0206298828125, 0.013671875, -0.0042724609375, -0.01708984375, -0.0016326904296875, -0.0038604736328125, -0.0177001953125, -0.020751953125, 0.033447265625, -0.017822265625, -0.0294189453125, 0.00860595703125, -0.008544921875, -0.00830078125, 0.0059814453125, 0.016...	[ 41877, 17304, 361, 52196, 363, 14602, 959, 8060, 486, 420, 1019, 124850, 31380, 238, 318, 1556, 142508, 17376, 237, 71, 5, 124326, 5443, 63928, 11435, 11627, 12301, 91693, 98169, 5608, 114977, 272, 3853, 51592, 5036, 18151, 22469, 11814, 61...	[ 0.1614990234375, 0.208984375, 0.06500244140625, 0.17333984375, 0.1534423828125, 0.0684814453125, 0.110107421875, 0.1820068359375, 0.10546875, 0.1156005859375, 0.22119140625, 0.193115234375, 0.142333984375, 0.154296875, 0.169677734375, 0.1170654296875, 0.2119140625, 0.150146484375, ...	embed
5584984_c1	5584984	haskell	1	AFAIK, both are reputed well suited for this kind of operation). I know none of these languages. I could learn on of them to provide my example but this would'nt be a fair comparison: I am not sure to be able to provide an implementation allowing both expressivity and performances. So my two questions are : 1) which la...	AFAIK, both are reputed well suited for this kind of operation). I know none of these languages. I could learn on of them to provide my example but this would'nt be a fair comparison: I am not sure to be able to provide an implementation allowing both expressivity and performances. So my two questions are : 1) which la...	[ -0.00106048583984375, 0.0296630859375, -0.02001953125, -0.00396728515625, 0.00185394287109375, 0.0028076171875, -0.00811767578125, -0.00003838539123535156, 0.0106201171875, -0.0234375, -0.0128173828125, 0.00469970703125, 0.014892578125, -0.0140380859375, -0.015625, 0.000322341918945312...	[ 6, 151334, 17756, 15044, 621, 7077, 5299, 14947, 71, 100, 903, 8562, 41018, 194, 3714, 351, 6097, 46876, 7, 5809, 30698, 98, 2856, 22691, 27781, 660, 44075, 225490, 9077, 208124, 190358, 36510, 54613, 23718, 5, 6626, 17582, 2965, 22599, 1...	[ 0.021240234375, 0.0841064453125, 0.1055908203125, 0.140869140625, 0.024078369140625, 0.10498046875, 0.0615234375, 0.149169921875, 0.0667724609375, 0.02032470703125, 0.085205078125, 0.08319091796875, 0.18701171875, 0.0197296142578125, 0.097412109375, 0.0177764892578125, 0.073120117187...	embed
15861885_c0	15861885	haskell	0	Title: Explanation of currying in simple terms Problem title: Explanation of currying in simple terms Tags: haskell, currying Problem: Explanation of currying in simple terms I'm currently learning about Haskell and have come across something called currying and curried values. I have also found that (+) is a curried v...	Explanation of currying in simple terms Explanation of currying in simple terms haskell currying Explanation Integer Explanation of currying in simple terms I'm currently learning about Haskell and have come across something called currying and curried values. I have also found that (+) is a curried version of + From w...	[ -0.003173828125, -0.00274658203125, 0.0115966796875, 0.0203857421875, 0.019287109375, 0.032958984375, -0.002227783203125, -0.0120849609375, 0.00616455078125, -0.018310546875, 0.0166015625, -0.05224609375, -0.0093994140625, 0.01123046875, -0.00191497802734375, -0.025146484375, 0.00393...	[ 5443, 5868, 198555, 214, 8781, 69407, 1556, 142508, 44401, 52080, 20625, 36880, 35839, 9709, 46572, 142424, 22183, 16, 83, 10, 11389, 997, 14192, 351, 16820, 765, 107730, 116, 101935, 5701, 72856, 187136, 27781 ]	[ 0.024993896484375, 0.144287109375, 0.24560546875, 0.1627197265625, 0.1322021484375, 0.130126953125, 0.1287841796875, 0.21630859375, 0.1900634765625, 0.011505126953125, 0.1065673828125, 0.0139617919921875, 0.0009765625, 0.145751953125, 0.1920166015625, 0.1748046875, 0.2366943359375, ...	embed
26439915_c0	26439915	haskell	0	Title: Why `Just String` will be wrong in Haskell Problem title: Why `Just String` will be wrong in Haskell Tags: haskell Problem: Why `Just String` will be wrong in Haskell Hi I have a trivial but exhausting question during learning myself the Parameterized Types topic in Haskell. Here is my question: Look this is the...	Why `Just String` will be wrong in Haskell Why `Just String` will be wrong in Haskell haskell Why Just Haskell Maybe Nothing Why `Just String` will be wrong in Haskell Hi I have a trivial but exhausting question during learning myself the Parameterized Types topic in Haskell. Here is my question: Look this is the defin...	[ -0.01336669921875, 0.006317138671875, -0.000039577484130859375, 0.00738525390625, 0.000583648681640625, 0.0189208984375, -0.0076904296875, 0.0023345947265625, 0.0022430419921875, -0.010009765625, 0.00543212890625, -0.048828125, -0.0032196044921875, 0.0067138671875, 0.000606536865234375, ...	[ 44084, 127794, 23351, 214, 1221, 186, 44691, 20625, 142508, 23, 1556, 9563, 83425, 182747, 686, 146353, 9655, 1720, 29089, 29367, 60457, 28451, 60818, 903, 80934, 4527, 1884, 15400, 831, 18, 5646, 10644, 77336, 3714, 2967, 32233, 150863, 1284...	[ 0.110107421875, 0.1495361328125, 0.2017822265625, 0.1351318359375, 0.06787109375, 0.0654296875, 0.1510009765625, 0.111328125, 0.2225341796875, 0.035430908203125, 0.087158203125, 0.1536865234375, 0.287353515625, 0.1397705078125, 0.010528564453125, 0.07110595703125, 0.00286865234375, ...	embed
56264267_c0	56264267	haskell	0	Title: Haskell list filtering with two arguments Problem title: Haskell list filtering with two arguments Tags: filter, list, haskell Problem: Haskell list filtering with two arguments I have to write a function, which filters with one argument that results True , then filters with another argument which results False ...	Haskell list filtering with two arguments Haskell list filtering with two arguments filter list haskell Haskell Bool x:xs Haskell list filtering with two arguments I have to write a function, which filters with one argument that results True , then filters with another argument which results False I tried this: But I n...	[ -0.0228271484375, 0.04248046875, 0.005859375, -0.01129150390625, 0.00299072265625, 0.010986328125, -0.00021266937255859375, 0.01409912109375, 0.01251220703125, 0.0247802734375, 0.00775146484375, -0.002288818359375, 0.0120849609375, 0.018798828125, -0.00506591796875, 0.00897216796875, ...	[ 20625, 142508, 5303, 46312, 214, 678, 6626, 10750, 1556, 2460, 929, 1022, 12, 425, 765, 33022, 32354, 1632, 50339, 87599, 15700, 22225, 184, 37842, 3871, 450, 7440, 10869, 706, 1326, 27781 ]	[ 0.1221923828125, 0.216552734375, 0.2110595703125, 0.2286376953125, 0.056854248046875, 0.0614013671875, 0.1829833984375, 0.2359619140625, 0.1065673828125, 0.07293701171875, 0.156005859375, 0.08349609375, 0.01141357421875, 0.1317138671875, 0.0225982666015625, 0.070068359375, 0.12915039...	embed
61526610_c0	61526610	haskell	0	Title: How to use Filter and Map Haskell? Problem title: How to use Filter and Map Haskell? Tags: haskell Problem: How to use Filter and Map Haskell? First of all sorry for my Englisch, I am new in Haskell and i dont really know much about it. I want all even Numbers from [0..6] and then the square Numbers from them. L...	How to use Filter and Map Haskell? How to use Filter and Map Haskell? haskell How Filter Map Haskell How to use Filter and Map Haskell? First of all sorry for my Englisch, I am new in Haskell and i dont really know much about it. I want all even Numbers from [0..6] and then the square Numbers from them. Like this a x =...	[ 0.0030364990234375, 0.01446533203125, -0.01055908203125, -0.020263671875, 0.0111083984375, 0.0169677734375, 0.005615234375, 0.00457763671875, 0.0035552978515625, -0.01165771484375, 0.0015716552734375, -0.028564453125, -0.009033203125, 0.0262451171875, -0.001861572265625, -0.00549316406...	[ 11249, 47, 4527, 128896, 136, 42719, 20625, 142508, 32, 1556, 59090, 100, 133456, 444, 3525, 13319, 6183, 3714, 5045, 3444, 756, 3853, 103332, 7, 1295, 2389, 5, 910, 268, 7068, 70, 108047, 18852, 903, 10, 1022, 2203, 661, 6, 4426, 9, ...	[ 0.1072998046875, 0.038909912109375, 0.1676025390625, 0.3154296875, 0.16650390625, 0.257568359375, 0.1907958984375, 0.26220703125, 0.0196990966796875, 0.173583984375, 0.059967041015625, 0.001495361328125, 0.154541015625, 0.01068115234375, 0.04388427734375, 0.07208251953125, 0.01168823...	embed
63193423_c0	63193423	haskell	0	Title: How to identify required extensions for Servant Problem title: How to identify required extensions for Servant Tags: servant, haskell Problem: How to identify required extensions for Servant I am reading a servant tutorial but do not understand which extension is used for what parts of the code. The tutorial sta...	How to identify required extensions for Servant How to identify required extensions for Servant servant haskell How Servant How to identify required extensions for Servant I am reading a servant tutorial but do not understand which extension is used for what parts of the code. The tutorial starts by adding ~10 extensio...	[ 0.004241943359375, 0.004425048828125, 0.0198974609375, 0.0159912109375, -0.0174560546875, -0.00113677978515625, -0.0196533203125, -0.0068359375, -0.005096435546875, 0.008056640625, 0.0118408203125, -0.0269775390625, 0.000640869140625, 0.020263671875, 0.000850677490234375, 0.01428222656...	[ 11249, 135812, 56065, 111938, 7, 100, 5406, 30624, 187646, 1556, 142508, 16454, 57143, 28219, 11814, 63920, 18151, 4034, 154107, 963, 86595, 11435, 5117, 27781, 4734, 144570, 1031, 29479, 10002, 10723, 4527, 20187, 14012, 55300 ]	[ 0.05926513671875, 0.185791015625, 0.24169921875, 0.216796875, 0.096435546875, 0.076904296875, 0.168212890625, 0.207275390625, 0.2266845703125, 0.1217041015625, 0.1734619140625, 0.01715087890625, 0.1165771484375, 0.010040283203125, 0.060821533203125, 0.0142059326171875, 0.034484863281...	embed
63279576_c0	63279576	haskell	0	Title: Representing a computational graph in Haskell Problem title: Representing a computational graph in Haskell Tags: automatic-differentiation, algorithm, data-structures, functional-programming, haskell Problem: Representing a computational graph in Haskell I'm trying to write a simple automatic differentiation pac...	Representing a computational graph in Haskell Representing a computational graph in Haskell automatic-differentiation algorithm data-structures functional-programming haskell Representing Haskell Representing a computational graph in Haskell I'm trying to write a simple automatic differentiation package in Haskell. Wha...	[ -0.00604248046875, 0.034912109375, 0.01019287109375, 0.041015625, -0.0191650390625, 0.017822265625, -0.01953125, 0.005035400390625, -0.0155029296875, -0.03125, -0.04150390625, -0.027099609375, -0.00058746337890625, 0.045166015625, -0.00173187255859375, 0.019775390625, 0.0043640136718...	[ 853, 55247, 214, 181135, 43315, 41382, 23, 20625, 142508, 101038, 238778, 14, 234873, 2053, 137656, 123309, 28966, 1556, 31577, 33022, 8781, 99710, 2320, 98169, 621, 93766, 48322, 33636, 10644, 115840, 80581, 606, 4527, 10135, 9, 107, 40383, ...	[ 0.09625244140625, 0.2379150390625, 0.0078125, 0.1356201171875, 0.08258056640625, 0.2420654296875, 0.047698974609375, 0.149658203125, 0.25439453125, 0.1982421875, 0.140380859375, 0.1014404296875, 0.1063232421875, 0.0682373046875, 0.1239013671875, 0.1212158203125, 0.06610107421875, 0...	embed
15572767_c0	15572767	haskell	0	Title: How to implement Haskell instance in python? Problem title: How to implement Haskell instance in python? Tags: haskell, inheritance, multiple-inheritance, python Problem: How to implement Haskell instance in python? In Haskell if you create an instance like this: instance (Eq a) => POrd (Set a) where ... Then if...	How to implement Haskell instance in python? How to implement Haskell instance in python? haskell inheritance multiple-inheritance python How Haskell POrd Set How to implement Haskell instance in python? In Haskell if you create an instance like this: Then if you need to do the same thing in python, does it mean that w...	[ 0.0091552734375, 0.00052642822265625, 0.0123291015625, 0.0235595703125, -0.0198974609375, 0.0230712890625, 0.00286865234375, -0.007354736328125, 0.0084228515625, -0.0021514892578125, -0.00982666015625, -0.02001953125, 0.00836181640625, 0.00262451171875, -0.028076171875, 0.0042724609375...	[ 11249, 47, 29479, 20625, 142508, 110527, 23, 17198, 50828, 1556, 3334, 217, 48716, 73, 7154, 8574, 4216, 19943, 360, 28282, 1884, 903, 3871, 54, 5701, 29459, 105233, 18507, 35839, 14481, 1295, 15700, 241, 864 ]	[ 0.058807373046875, 0.0247802734375, 0.21875, 0.204345703125, 0.307373046875, 0.29150390625, 0.0869140625, 0.14990234375, 0.19775390625, 0.17236328125, 0.161376953125, 0.051483154296875, 0.1153564453125, 0.020721435546875, 0.01007080078125, 0.103759765625, 0.1434326171875, 0.2211914...	embed
22942194_c1	22942194	haskell	1	@wombat$ cabal configure --enable-executable-profiling --enable-library-profiling Resolving dependencies... Configuring creatur-realtra-1.0.8... amy@wombat$ cabal build --ghc-options=-Werror && cabal test && cabal install <snip> amy@wombat$ cabal run realtra-benchmark +RTS -p cabal: the flag -p requires the program to ...	@wombat$ cabal configure --enable-executable-profiling --enable-library-profiling Resolving dependencies... Configuring creatur-realtra-1.0.8... amy@wombat$ cabal build --ghc-options=-Werror && cabal test && cabal install <snip> amy@wombat$ cabal run realtra-benchmark +RTS -p cabal: the flag -p requires the program to ...	[ -0.0106201171875, -0.0033416748046875, -0.0167236328125, -0.00860595703125, -0.00408935546875, 0.0031585693359375, -0.0196533203125, 0.0004062652587890625, -0.00634765625, 0.005645751953125, 0.0023651123046875, -0.00469970703125, -0.01025390625, -0.01409912109375, -0.01251220703125, 0....	[ 1374, 434, 16298, 18, 109524, 222495, 2886, 46480, 1010, 22819, 58395, 214, 150, 2844, 132944, 42548, 117538, 59994, 48107, 474, 107, 28095, 5759, 132208, 10, 1176, 981, 45367, 9486, 238, 109585, 188800, 3034, 20600, 93, 11675, 2773, 1517, ...	[ 0.011444091796875, 0.00079345703125, 0.102783203125, 0.072265625, 0.239990234375, 0.1851806640625, 0.05419921875, 0.030487060546875, 0.09466552734375, 0.0784912109375, 0.197021484375, 0.06085205078125, 0.0142669677734375, 0.08489990234375, 0.1436767578125, 0.16748046875, 0.0325622558...	embed
21538903_c0	21538903	haskell	0	Title: How can I elegantly invert a Map's keys and values? Problem title: How can I elegantly invert a Map's keys and values? Tags: haskell Problem: How can I elegantly invert a Map's keys and values? I have a Map (or associative list) that looks like this: [("A", ["KB", "KC"]), ("B", ["KD", "KE"])] How can I...	How can I elegantly invert a Map's keys and values? How can I elegantly invert a Map's keys and values? haskell How Map How can I elegantly invert a Map's keys and values? I have a Map (or associative list) that looks like this: How can I concisely transform the above Map so that the keys are the values and t...	[ 0.000759124755859375, -0.003387451171875, 0.00579833984375, -0.00982666015625, -0.024658203125, -0.01416015625, -0.0201416015625, -0.01361083984375, 0.006866455078125, 0.027587890625, 0.015869140625, 0.0279541015625, 0.0294189453125, 0.046142578125, -0.01409912109375, 0.006103515625, ...	[ 11249, 831, 87, 27650, 538, 131983, 42719, 3768, 22799, 7, 136, 142424, 1556, 142508, 10, 166027, 5303, 33342, 1884, 903, 158, 10794, 27198, 36917, 221, 621, 16750, 6713, 29806 ]	[ 0.10638427734375, 0.09112548828125, 0.044586181640625, 0.1993408203125, 0.06195068359375, 0.273193359375, 0.2271728515625, 0.053466796875, 0.221435546875, 0.059417724609375, 0.132568359375, 0.1756591796875, 0.1240234375, 0.212158203125, 0.01849365234375, 0.10888671875, 0.129760742187...	embed
66610681_c0	66610681	haskell	0	Title: How could you rewrite this function in just one line using infinite lists in Haskell? Problem title: How could you rewrite this function in just one line using infinite lists in Haskell? Tags: haskell Problem: How could you rewrite this function in just one line using infinite lists in Haskell? I'm still a bit c...	How could you rewrite this function in just one line using infinite lists in Haskell? How could you rewrite this function in just one line using infinite lists in Haskell? haskell infinite How Haskell mylist.append How could you rewrite this function in just one line using infinite lists in Haskell? I'm still a bit con...	[ -0.003387451171875, 0.003936767578125, -0.004241943359375, -0.006072998046875, 0.00787353515625, 0.0194091796875, -0.01177978515625, -0.003387451171875, 0.009765625, -0.03515625, -0.006317138671875, -0.01043701171875, 0.024169921875, 0.037353515625, 0.0029754638671875, 0.00227355957031...	[ 11249, 5809, 456, 434, 18781, 903, 32354, 23, 1660, 1632, 13315, 54241, 13, 5303, 20625, 142508, 17368, 1556, 759, 6562, 9007, 3611, 55681, 3642, 4527, 28219, 23755, 12096, 145581, 831, 59121, 237 ]	[ 0.04791259765625, 0.05169677734375, 0.14453125, 0.1363525390625, 0.181640625, 0.065185546875, 0.209228515625, 0.0562744140625, 0.0943603515625, 0.1326904296875, 0.1575927734375, 0.15673828125, 0.08575439453125, 0.179931640625, 0.1402587890625, 0.23486328125, 0.013519287109375, 0.12...	embed
29679170_c0	29679170	haskell	0	Title: How can I split a list into chunks using span? Problem title: How can I split a list into chunks using span? Tags: haskell Problem: How can I split a list into chunks using span? Can I rewrite this using library functions? chunks :: ([a] -> ([a], [a])) -> [a] -> [[a]] chunks f [] = [] chunks f xs = case c of [] ...	How can I split a list into chunks using span? How can I split a list into chunks using span? haskell span How How can I split a list into chunks using span? Can I rewrite this using library functions? If I give it a span -like function that always takes at least one element off the list, it'll consume the list and ret...	[ -0.0272216796875, 0.00830078125, 0.01904296875, -0.00604248046875, -0.0179443359375, 0.01214599609375, -0.01263427734375, -0.01904296875, -0.0159912109375, -0.0234375, 0.002044677734375, 0.00537109375, -0.0224609375, -0.003143310546875, 0.000614166259765625, -0.004180908203125, -0.00...	[ 11249, 831, 65450, 5303, 3934, 7839, 1224, 17368, 27734, 87, 1556, 142508, 456, 434, 18781, 35773, 1294, 32354, 8337, 5062, 11343, 51776, 19713, 1632, 12830, 5773, 1181, 18588, 30646, 1614, 6562, 80854, 148431, 12638, 1733, 35839 ]	[ 0.059906005859375, 0.055328369140625, 0.2330322265625, 0.229248046875, 0.164306640625, 0.224365234375, 0.1761474609375, 0.080078125, 0.278076171875, 0.014190673828125, 0.1407470703125, 0.21728515625, 0.05499267578125, 0.0655517578125, 0.103271484375, 0.1290283203125, 0.04006958007812...	embed
59725921_c1	59725921	haskell	1	1,25,120] let mp = M.fromList $ zip [0..(length xs)] xs let xs' = [5,17,32,150,9,90] let mp' = M.fromList $ zip [0..(length xs')] xs' let expected = [(1, 31),(3, 151)] getSimilarities mp mp' `shouldBe` expected However, I do not really like "check" function as I do not need to form a new map there, I just need to check...	1,25,120] let mp = M.fromList $ zip [0..(length xs)] xs let xs' = [5,17,32,150,9,90] let mp' = M.fromList $ zip [0..(length xs')] xs' let expected = [(1, 31),(3, 151)] getSimilarities mp mp' `shouldBe` expected However, I do not really like "check" function as I do not need to form a new map there, I just need to check...	[ -0.0262451171875, -0.0033721923828125, -0.01177978515625, -0.031005859375, -0.027099609375, -0.01531982421875, 0.015380859375, 0.00946044921875, 0.0274658203125, 0.00811767578125, 0.0234375, 0.05224609375, 0.0257568359375, 0.012939453125, -0.01263427734375, 0.005401611328125, -0.0033...	[ 106, 2588, 20840, 2633, 9607, 2203, 276, 161063, 154663, 68330, 2389, 23986, 1022, 7, 758, 2489, 6460, 19236, 193328, 25, 84751, 41600, 4, 1936, 86827, 90483, 2046, 294, 2605, 1703, 2449, 11412, 52366, 6766, 54, 959, 6183, 1884, 78292, 32...	[ 0.0574951171875, 0.2587890625, 0.2491455078125, 0.08447265625, 0.209716796875, 0.03857421875, 0.0836181640625, 0.169921875, 0.22509765625, 0.2259521484375, 0.0228271484375, 0.0980224609375, 0.0987548828125, 0.08013916015625, 0.0631103515625, 0.1201171875, 0.1739501953125, 0.2309570...	embed
35479467_c1	35479467	haskell	1	Int -> Int)) are identical because of, well... currying. Anyhow, if the last argument were an EnvTransformer: f :: Int -> Int -> Int -> EnvTransformer g :: Int -> (Int -> (Int -> EnvTransformer)) h :: Int -> (Int -> (Int -> (ClassEnv -> Maybe ClassEnv))) j :: Int -> Int -> Int -> ClassEnv -> Maybe ClassEnv ... all of t...	Int -> Int)) are identical because of, well... currying. Anyhow, if the last argument were an EnvTransformer: f :: Int -> Int -> Int -> EnvTransformer g :: Int -> (Int -> (Int -> EnvTransformer)) h :: Int -> (Int -> (Int -> (ClassEnv -> Maybe ClassEnv))) j :: Int -> Int -> Int -> ClassEnv -> Maybe ClassEnv ... all of t...	[ -0.005889892578125, -0.00970458984375, -0.003448486328125, 0.005126953125, -0.000560760498046875, 0.0184326171875, -0.0194091796875, -0.0166015625, 0.00225830078125, 0.0027618408203125, 0.025146484375, -0.01116943359375, -0.007049560546875, -0.00347900390625, 0.015380859375, -0.0087890...	[ 360, 18, 33079, 16, 621, 31943, 6827, 6637, 198555, 214, 47251, 2174, 4568, 10750, 357, 334, 62624, 82772, 1238, 1984, 706, 4153, 1096, 140803, 7768, 83425, 35014, 1647, 32354, 5646, 201, 40, 6366, 304, 92, 59121, 49129, 35412, 14612, 113...	[ 0.14990234375, 0.223876953125, 0.1251220703125, 0.00762939453125, 0.067138671875, 0.1636962890625, 0.1380615234375, 0.0308837890625, 0.2237548828125, 0.135498046875, 0.013702392578125, 0.0189971923828125, 0.13330078125, 0.2490234375, 0.10400390625, 0.15771484375, 0.1446533203125, 0...	embed
37012770_c0	37012770	haskell	0	Title: Haskell, reverse two elements in list? Problem title: Haskell, reverse two elements in list? Tags: list, haskell Problem: Haskell, reverse two elements in list? i want to take a list and always reverse two elements. Example: input 1: [1,2,3,4,5] , output 1: [2,1,4,3,5] input 2: [1,2,3,4,5,6] output 2: [2,1,4,3,6...	Haskell, reverse two elements in list? Haskell, reverse two elements in list? list haskell Haskell x:y:xs Main Exception test.hs Non-exhaustive Haskell, reverse two elements in list? i want to take a list and always reverse two elements. Example: input 1: [1,2,3,4,5] , output 1: [2,1,4,3,5] input 2: [1,2,3,4,5,6] outpu...	[ -0.0167236328125, 0.0279541015625, 0.000942230224609375, 0.006134033203125, 0.020751953125, 0.030029296875, -0.001922607421875, 0.0159912109375, 0.0223388671875, 0.01153564453125, 0.040283203125, 0.007080078125, 0.00701904296875, -0.00909423828125, 0.015869140625, 0.0194091796875, 0....	[ 20625, 142508, 39531, 184, 6626, 80854, 23, 5303, 32, 4, 1556, 1022, 53, 12, 425, 12321, 5443, 63928, 3034, 127, 3775, 3355, 18391, 4935, 3444, 5646, 11343, 89536, 107730, 13806, 155761, 80389, 140992, 163324, 92714, 15573, 133063, 82449, 1...	[ 0.17431640625, 0.2479248046875, 0.250244140625, 0.195556640625, 0.209716796875, 0.2283935546875, 0.0994873046875, 0.2264404296875, 0.0174407958984375, 0.017730712890625, 0.1529541015625, 0.0244140625, 0.06982421875, 0.005035400390625, 0.083984375, 0.0675048828125, 0.052093505859375, ...	embed
25759094_c0	25759094	haskell	0	Title: Template Haskell in GHCI Problem title: Template Haskell in GHCI Tags: haskell, ghci, compiler-errors Problem: Template Haskell in GHCI I'm new at learning Haskell so I'll say sorry in advance for the silly questions. I want to build a function that removes all the upper cases from a string (I use GHCI) removeUp...	Template Haskell in GHCI Template Haskell in GHCI haskell ghci compiler-errors Template Haskell GHCI Syntax Perhaps TemplateHaskell Template Haskell in GHCI I'm new at learning Haskell so I'll say sorry in advance for the silly questions. I want to build a function that removes all the upper cases from a string (I use ...	[ -0.00933837890625, 0.00311279296875, 0.00141143798828125, -0.004119873046875, 0.00848388671875, 0.01251220703125, 0.00897216796875, 0.000789642333984375, -0.0115966796875, -0.041259765625, -0.007049560546875, -0.029296875, 0.0142822265625, -0.0034942626953125, 0.005889892578125, 0.0076...	[ 196631, 20625, 142508, 41877, 17304, 23, 1556, 31380, 318, 9969, 34759, 188800, 19010, 86531, 181799, 6495, 7, 3525, 52080, 59090, 12097, 3444, 45367, 32354, 87388, 756, 70, 1407, 56, 50218, 1295, 79315, 4966, 1340, 45831, 25632, 26008, 4865,...	[ 0.271728515625, 0.14404296875, 0.2479248046875, 0.140869140625, 0.1878662109375, 0.0309906005859375, 0.11767578125, 0.1112060546875, 0.1746826171875, 0.1285400390625, 0.1287841796875, 0.1676025390625, 0.0692138671875, 0.10321044921875, 0.043121337890625, 0.0931396484375, 0.0523681640...	embed
40903305_c0	40903305	haskell	0	Title: Haskell: Non-exhaustive patterns in factorial function Problem title: Haskell: Non-exhaustive patterns in factorial function Tags: pattern-matching, haskell, ghci Problem: Haskell: Non-exhaustive patterns in factorial function I've tried implementing a recursive factorial function in GHCi, but I'm receiving the ...	Haskell: Non-exhaustive patterns in factorial function Haskell: Non-exhaustive patterns in factorial function pattern-matching haskell ghci Haskell Non-exhaustive Prelude n-1 Exception Haskell: Non-exhaustive patterns in factorial function I've tried implementing a recursive factorial function in GHCi, but I'm receivin...	[ -0.015869140625, 0.00555419921875, 0.01495361328125, 0.004638671875, 0.00457763671875, 0.0026702880859375, 0.0020751953125, -0.01263427734375, -0.01031494140625, -0.01348876953125, 0.01275634765625, -0.031494140625, -0.004852294921875, -0.01025390625, 0.018310546875, -0.00390625, 0.0...	[ 20625, 142508, 3775, 3355, 18391, 4935, 103510, 31461, 15403, 32354, 23, 98753, 1556, 31380, 318, 1914, 822, 112, 653, 5759, 5443, 63928, 37842, 29479, 195625, 5844, 527, 73265, 14, 217063, 25632, 18499, 903, 38162, 1295, 71864, 121742, 22690...	[ 0.1368408203125, 0.2646484375, 0.193115234375, 0.06988525390625, 0.16162109375, 0.0938720703125, 0.217041015625, 0.1646728515625, 0.1317138671875, 0.1512451171875, 0.0260162353515625, 0.1561279296875, 0.139404296875, 0.121337890625, 0.1644287109375, 0.060638427734375, 0.1680908203125...	embed
51456200_c0	51456200	haskell	0	Title: Unable to match Haskell type Problem title: Unable to match Haskell type Tags: haskell Problem: Unable to match Haskell type I know there are lots of questions on this topic, but I feel that there is something specific about the library that I am using that is giving me the error. module Test where import Clash....	Unable to match Haskell type Unable to match Haskell type haskell Clash.Prelude init Unable Haskell Test Vec Nil Test.hs:28:14 Couldn Nat Test.hs:26:1-33 Expected Actual Relevant Test.hs:27:1 Cons Unable to match Haskell type I know there are lots of questions on this topic, but I feel that there is something specific ...	[ -0.01226806640625, 0.033203125, -0.0162353515625, 0.01123046875, 0.0029296875, -0.0086669921875, -0.031494140625, -0.017822265625, 0.007354736328125, -0.0054931640625, 0.01007080078125, -0.02099609375, 0.02001953125, 0.00567626953125, 0.00994873046875, -0.00994873046875, 0.0184326171...	[ 992, 2886, 14858, 20625, 142508, 10644, 1556, 313, 5544, 19273, 822, 112, 23, 217, 8647, 52884, 77175, 127, 28270, 22635, 191147, 19, 68875, 28194, 125565, 60075, 13, 100582, 133, 30624, 27592, 19721, 39215, 12319, 29458, 35773, 1294, 18499, ...	[ 0.0889892578125, 0.1639404296875, 0.22802734375, 0.1595458984375, 0.252685546875, 0.179443359375, 0.150146484375, 0.05194091796875, 0.2071533203125, 0.088623046875, 0.16455078125, 0.1246337890625, 0.041351318359375, 0.035614013671875, 0.150146484375, 0.12548828125, 0.1221923828125, ...	embed
18909649_c0	18909649	haskell	0	Title: What is the RWS Monad and when is it used Problem title: What is the RWS Monad and when is it used Tags: haskell, monad-transformers Problem: What is the RWS Monad and when is it used I ran across the RWS Monad and its MonadTransformer while looking up something in the mtl library. There is no real documentation...	What is the RWS Monad and when is it used What is the RWS Monad and when is it used haskell monad-transformers What RWS Monad What is the RWS Monad and when is it used I ran across the RWS Monad and its MonadTransformer while looking up something in the mtl library. There is no real documentation there, and I was wonde...	[ -0.00823974609375, -0.00124359130859375, 0.01287841796875, 0.013427734375, 0.0234375, 0.00058746337890625, 0.00482177734375, -0.009033203125, -0.0172119140625, 0.006744384765625, 0.021728515625, -0.006317138671875, -0.009521484375, -0.0013580322265625, -0.01263427734375, -0.00640869140...	[ 4865, 83, 70, 627, 52143, 60331, 71, 3229, 442, 11814, 1556, 142508, 2667, 712, 215175, 1314, 13028, 36880, 62624, 82772, 18, 141, 35773, 209806, 2367, 903, 7440, 62163, 90791, 15322, 5264, 33462, 122636, 4, 601, 2783, 22836, 177261, 17262,...	[ 0.0477294921875, 0.04986572265625, 0.050201416015625, 0.1353759765625, 0.245849609375, 0.2119140625, 0.188232421875, 0.0791015625, 0.052215576171875, 0.126708984375, 0.0899658203125, 0.1781005859375, 0.113525390625, 0.135498046875, 0.1956787109375, 0.103759765625, 0.017852783203125, ...	embed
43101697_c0	43101697	haskell	0	Title: No instance for (Show a) arising Problem title: No instance for (Show a) arising Tags: haskell Problem: No instance for (Show a) arising ghci is giving me the error "No instance for (Show a) arising from use of 'commaSeperated'" What im trying to do is define a show for my data Set that uses curly braces instead...	No instance for (Show a) arising No instance for (Show a) arising haskell Show Set Char x:xs No instance for (Show a) arising ghci is giving me the error "No instance for (Show a) arising from use of 'commaSeperated'" What im trying to do is define a show for my data Set that uses curly braces instead of square. What a...	[ -0.00008153915405273438, 0.00665283203125, 0.03125, 0.007171630859375, -0.0076904296875, 0.020263671875, 0.0111083984375, 0.003326416015625, 0.0201416015625, 0.0186767578125, -0.031982421875, -0.0091552734375, 0.0361328125, 0.0155029296875, -0.00885009765625, -0.0167236328125, -0.002...	[ 438, 110527, 100, 168660, 10, 187, 72219, 1556, 142508, 17367, 19943, 21656, 1022, 425, 31380, 318, 163, 18499, 5021, 1295, 4527, 277, 192, 4233, 1264, 27686, 31577, 61924, 7639, 2053, 9709, 538, 1620, 5170, 64457, 6, 108047, 444, 20594, ...	[ 0.142822265625, 0.272705078125, 0.109375, 0.2235107421875, 0.11474609375, 0.130615234375, 0.161376953125, 0.11767578125, 0.2183837890625, 0.1807861328125, 0.1561279296875, 0.130859375, 0.0189056396484375, 0.06207275390625, 0.086669921875, 0.11328125, 0.002410888671875, 0.1706542968...	embed
77636725_c1	77636725	haskell	1	Data\Local\Temp\cabal-repl.-26728\dist-newstyle\build\x86_64-windows\ghc-8.10.2\fake-package-0\x\script\build\script\script-tmp\Main.o ) Linking C:\Users\<me>\AppData\Local\Temp\cabal-repl.-26728\dist-newstyle\build\x86_64-windows\ghc-8.10.2\fake-package-0\x\script\build\script\script.exe ... 2 Code signals: Control.Ex...	Data\Local\Temp\cabal-repl.-26728\dist-newstyle\build\x86_64-windows\ghc-8.10.2\fake-package-0\x\script\build\script\script-tmp\Main.o ) Linking C:\Users\<me>\AppData\Local\Temp\cabal-repl.-26728\dist-newstyle\build\x86_64-windows\ghc-8.10.2\fake-package-0\x\script\build\script\script.exe ... 2 Code signals: Control.Ex...	[ 0.0023040771484375, 0.01031494140625, -0.012451171875, 0.000507354736328125, 0.006439208984375, 0.006591796875, 0.002685546875, -0.006866455078125, -0.004180908203125, 0.00250244140625, -0.0120849609375, -0.00146484375, 0.006927490234375, 0.02685546875, 0.01068115234375, -0.01177978515...	[ 11809, 203758, 159065, 408, 3571, 107, 2424, 51372, 3882, 46295, 54936, 40946, 177149, 15276, 13307, 229792, 9486, 238, 17376, 10179, 304, 1021, 29102, 23320, 32032, 2676, 168793, 31, 12779, 214, 313, 1062, 7, 282, 39179, 137989, 5, 454, 46...	[ 0.144775390625, 0.145751953125, 0.2296142578125, 0.0867919921875, 0.2069091796875, 0.0213775634765625, 0.135986328125, 0.08056640625, 0.1805419921875, 0.06396484375, 0.038848876953125, 0.196533203125, 0.20361328125, 0.16845703125, 0.1298828125, 0.1104736328125, 0.09259033203125, 0....	embed
32551144_c0	32551144	haskell	0	Title: Inverting List Elements in Haskell Problem title: Inverting List Elements in Haskell Tags: haskell, list Problem: Inverting List Elements in Haskell I am trying to invert two-elements lists in xs . For example, invert [[1,2], [5,6,7], [10,20]] will return [[2,1], [5,6,7], [20,10]] . It doesn't invert [5,6,7] bec...	Inverting List Elements in Haskell Inverting List Elements in Haskell haskell list Inverting List Elements Haskell Inverting List Elements in Haskell I am trying to invert two-elements lists in xs . For example, invert [[1,2], [5,6,7], [10,20]] will return [[2,1], [5,6,7], [20,10]] . It doesn't invert [5,6,7] because i...	[ -0.00518798828125, 0.01611328125, -0.003631591796875, -0.005706787109375, -0.00421142578125, 0.031982421875, -0.0196533203125, -0.0177001953125, -0.0086669921875, 0.028564453125, 0.0196533203125, -0.00787353515625, 0.0108642578125, 0.0263671875, -0.02490234375, 0.021240234375, 0.0336...	[ 148639, 1916, 32036, 48325, 23, 20625, 142508, 1556, 5303, 31577, 131983, 6626, 62766, 1022, 7, 133063, 104629, 966, 963, 1549, 1221, 30646, 304, 76172, 22027, 18, 83, 138, 12830, 59121, 2060, 10644, 21635, 201505, 7225, 3525, 157666, 29479, ...	[ 0.233642578125, 0.10076904296875, 0.21435546875, 0.2196044921875, 0.045257568359375, 0.1646728515625, 0.260009765625, 0.1463623046875, 0.2213134765625, 0.099365234375, 0.279296875, 0.14404296875, 0.2171630859375, 0.1243896484375, 0.0946044921875, 0.139404296875, 0.159912109375, 0.0...	embed
64682066_c0	64682066	haskell	0	Title: Should stack.yaml.lock be checked into source control? Problem title: Should stack.yaml.lock be checked into source control? Tags: haskell, version-control, haskell-stack Problem: Should stack.yaml.lock be checked into source control? Since stack v2, stack produces a stack.yaml.lock file. Should this file be com...	Should stack.yaml.lock be checked into source control? Should stack.yaml.lock be checked into source control? haskell version-control haskell-stack Should stack.yaml.lock stack.yaml Should stack.yaml.lock be checked into source control? Since stack v2, stack produces a stack.yaml.lock file. Should this file be committe...	[ -0.006011962890625, -0.000797271728515625, 0.01434326171875, -0.0238037109375, -0.005584716796875, 0.005035400390625, -0.0130615234375, 0.006683349609375, -0.0177001953125, 0.0174560546875, -0.0125732421875, -0.0205078125, 0.00014495849609375, 0.0152587890625, -0.00787353515625, 0.0277...	[ 151117, 177261, 5, 14520, 141, 21135, 186, 12765, 297, 3934, 31344, 6226, 1556, 142508, 11389, 81988, 590, 2594, 66016, 81, 304, 27489, 11435, 174176, 47, 5608, 15769, 167790, 13, 104, 3535, 139392, 10941, 56112, 18, 70541, 256, 114942, 425...	[ 0.0823974609375, 0.23974609375, 0.0341796875, 0.20703125, 0.1873779296875, 0.2442626953125, 0.031005859375, 0.1910400390625, 0.023162841796875, 0.0914306640625, 0.207275390625, 0.200439453125, 0.114013671875, 0.203857421875, 0.118408203125, 0.1290283203125, 0.0986328125, 0.13378906...	embed
35823465_c0	35823465	haskell	0	Title: haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] Problem title: haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] Tags: haskell Problem: haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] I'm trying ...	haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] haskell Cannot Either EitherInts haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] I'm trying to declare a...	[ 0.0031280517578125, 0.00433349609375, -0.0067138671875, 0.0152587890625, -0.021728515625, 0.024169921875, -0.00665283203125, 0.00115203857421875, -0.004730224609375, -0.0203857421875, -0.0091552734375, -0.04443359375, 0.0296630859375, -0.01104736328125, -0.020263671875, -0.003067016601...	[ 1556, 142508, 4171, 10869, 366, 184, 2053, 64549, 748, 54936, 50986, 21635, 14, 9319, 360, 18, 4565, 4153, 933, 23, 31577, 159978, 5303, 52895, 9790, 9969, 1340, 903, 10644, 18499, 87, 765, 110, 6528, 15400, 20594, 44691 ]	[ 0.14453125, 0.24755859375, 0.064697265625, 0.1363525390625, 0.136962890625, 0.08612060546875, 0.140869140625, 0.1689453125, 0.114990234375, 0.0626220703125, 0.2410888671875, 0.1436767578125, 0.03985595703125, 0.197021484375, 0.0771484375, 0.095947265625, 0.089111328125, 0.062561035...	embed
3621588_c1	3621588	haskell	1	(Integral a) => [a] -> Bool prop_sum xs = almostEqual (fromIntegral (length xs) * mean (fromList xs)) (fromIntegral (sum xs)) -- This passes: check_mean_ok = quickCheck (prop_like_arith_mean :: [Integer] -> Property) >> quickCheck (prop_sum :: [Integer] -> Bool) -- This fails: check_mean_fail = quickCheck (prop_like_a...	(Integral a) => [a] -> Bool prop_sum xs = almostEqual (fromIntegral (length xs) * mean (fromList xs)) (fromIntegral (sum xs)) -- This passes: check_mean_ok = quickCheck (prop_like_arith_mean :: [Integer] -> Property) >> quickCheck (prop_sum :: [Integer] -> Bool) -- This fails: check_mean_fail = quickCheck (prop_like_a...	[ -0.0205078125, -0.0036163330078125, 0.0027008056640625, 0.00142669677734375, -0.01055908203125, 0.00543212890625, 0.00506591796875, -0.0194091796875, 0.017822265625, 0.01263427734375, 0.000598907470703125, 0.0260009765625, 0.0233154296875, -0.00482177734375, -0.004302978515625, 0.00424...	[ 15, 4153, 67, 5739, 141, 10, 44357, 11, 33079, 2460, 929, 25793, 454, 11832, 1022, 7, 2203, 39555, 647, 71723, 161063, 23986, 661, 29459, 154663, 4210, 3293, 10922, 12765, 282, 66, 685, 63773, 202567, 36290, 5062, 8962, 206984, 35782, 120...	[ 0.047943115234375, 0.040618896484375, 0.15087890625, 0.12939453125, 0.1171875, 0.1434326171875, 0.06256103515625, 0.06219482421875, 0.013092041015625, 0.11669921875, 0.212158203125, 0.245849609375, 0.0264129638671875, 0.250244140625, 0.151611328125, 0.1336669921875, 0.045135498046875...	embed
18792665_c2	18792665	haskell	2	1.45496), (3.07156,2.1016), (0.64665,2.90991), (1.93993,1.13162), (1.13163,2.42492), (3.87988,1.77827), (3.39488,5.98147), (2.74823,3.87986), (2.26326,2.74825), (1.45496,3.7182), (5.01149,1.77828), (5.17317,2.10159), (0.96996,4.36486), (0.48498,3.07156), (-0.96996,3.39489), (-1.77828,2.26325), (-1.61661,-0.8083), (-1.4...	1.45496), (3.07156,2.1016), (0.64665,2.90991), (1.93993,1.13162), (1.13163,2.42492), (3.87988,1.77827), (3.39488,5.98147), (2.74823,3.87986), (2.26326,2.74825), (1.45496,3.7182), (5.01149,1.77828), (5.17317,2.10159), (0.96996,4.36486), (0.48498,3.07156), (-0.96996,3.39489), (-1.77828,2.26325), (-1.61661,-0.8083), (-1.4...	[ -0.0108642578125, -0.000202178955078125, -0.01068115234375, 0.006866455078125, 0.0076904296875, 0.00360107421875, -0.001953125, 0.0283203125, 0.00201416015625, 0.0216064453125, 0.00836181640625, 0.017822265625, 0.01092529296875, -0.01165771484375, -0.0020751953125, 0.01226806640625, ...	[ 615, 152463, 109241, 4, 6896, 5, 8368, 155740, 68107, 169887, 247, 22085, 13307, 170686, 5442, 5039, 5046, 17727, 15, 158304, 9323, 11591, 92134, 5016, 10837, 2858, 2681, 138808, 116591, 2357, 129524, 135527, 168405, 206029, 170702, 80847, 9285...	[ 0.1204833984375, 0.255615234375, 0.273681640625, 0.127685546875, 0.133056640625, 0.1170654296875, 0.1341552734375, 0.1907958984375, 0.05291748046875, 0.1927490234375, 0.1416015625, 0.045654296875, 0.121826171875, 0.2020263671875, 0.10675048828125, 0.1336669921875, 0.1787109375, 0.1...	embed
5298703_c0	5298703	haskell	0	Title: Practice part of lambda abstractions Problem title: Practice part of lambda abstractions Tags: lambda, haskell, abstraction Problem: Practice part of lambda abstractions I'm new in Haskell programming. Now i'm learn lambda function and lambda abstractions. And i thought, what's the practice part of lambda functi...	Practice part of lambda abstractions Practice part of lambda abstractions lambda haskell abstraction Practice Practice part of lambda abstractions I'm new in Haskell programming. Now i'm learn lambda function and lambda abstractions. And i thought, what's the practice part of lambda functions. For example we have: What...	[ -0.0038299560546875, -0.004974365234375, 0.0072021484375, -0.00592041015625, -0.004730224609375, 0.0159912109375, -0.00213623046875, 0.021728515625, 0.007659912109375, -0.009521484375, -0.000263214111328125, -0.0294189453125, -0.003692626953125, 0.0245361328125, 0.002349853515625, 0.00...	[ 109613, 13, 2831, 21, 6492, 85, 164789, 17514, 1556, 142508, 3525, 20625, 56037, 32354, 17569, 41361, 7, 765, 111, 903, 831, 28282, 3638, 5423, 22288, 10750, 87293, 18151, 456, 77391, 15400, 1830, 28864, 83, 959, 6957, 6275, 44084 ]	[ 0.2183837890625, 0.0281524658203125, 0.13671875, 0.066650390625, 0.18359375, 0.1268310546875, 0.1734619140625, 0.057037353515625, 0.087158203125, 0.1947021484375, 0.002685546875, 0.07373046875, 0.04412841796875, 0.1527099609375, 0.032958984375, 0.2392578125, 0.006866455078125, 0.01...	embed
27221522_c1	27221522	haskell	1	[]) \| x::xs -> let newMax = max maxL x in let (maxR, aclist) = aux newMax acc xs in if maxL > x && x < maxR then (max maxR x,(min (maxL-x) (maxR-x))::aclist) else (max maxR x, aclist) in fold_left max 0 (snd (aux min_int [] list)) but I have to make it without using recursion, while I'm able to use high order function...	[]) \| x::xs -> let newMax = max maxL x in let (maxR, aclist) = aux newMax acc xs in if maxL > x && x < maxR then (max maxR x,(min (maxL-x) (maxR-x))::aclist) else (max maxR x, aclist) in fold_left max 0 (snd (aux min_int [] list)) but I have to make it without using recursion, while I'm able to use high order function...	[ -0.0177001953125, 0.0072021484375, 0.024658203125, 0.0225830078125, -0.010009765625, 0.039306640625, -0.002349853515625, 0.0174560546875, 0.03271484375, -0.02392578125, 0.01904296875, 0.02392578125, 0.00787353515625, 0.00787353515625, 0.0242919921875, -0.02001953125, -0.0186767578125...	[ 58745, 1022, 12, 425, 7, 33079, 2633, 3525, 71346, 18389, 866, 23, 24084, 1052, 1030, 6562, 2970, 50015, 2174, 977, 619, 1230, 4426, 1249, 9, 2263, 37076, 42822, 133, 2480, 757, 2208, 10442, 881, 4288, 5303, 765, 3249, 15490, 17368, 195...	[ 0.0157623291015625, 0.09576416015625, 0.06158447265625, 0.1318359375, 0.092041015625, 0.0274505615234375, 0.20654296875, 0.153076171875, 0.2186279296875, 0.1690673828125, 0.1673583984375, 0.0528564453125, 0.1513671875, 0.1439208984375, 0.039581298828125, 0.2060546875, 0.18896484375, ...	embed
76552414_c0	76552414	haskell	0	Title: Compiling C source files with Clang instead of gcc when building with Haskell stack? Problem title: Compiling C source files with Clang instead of gcc when building with Haskell stack? Tags: haskell, haskell-stack, cabal Problem: Compiling C source files with Clang instead of gcc when building with Haskell stack...	Compiling C source files with Clang instead of gcc when building with Haskell stack? Compiling C source files with Clang instead of gcc when building with Haskell stack? haskell haskell-stack cabal Compiling Clang Haskell Compiling C source files with Clang instead of gcc when building with Haskell stack? Currently if ...	[ 0.0115966796875, 0.0264892578125, 0.000640869140625, 0.0016326904296875, 0.006866455078125, -0.0062255859375, -0.0128173828125, 0.005889892578125, -0.034912109375, 0.000804901123046875, -0.005706787109375, -0.021240234375, 0.000583648681640625, 0.011474609375, 0.012451171875, 0.0196533...	[ 15612, 49725, 313, 31344, 102158, 678, 3066, 64457, 22109, 238, 33976, 20625, 142508, 177261, 1556, 590, 2594, 109524, 3229, 45367, 13452, 501, 9969, 1340, 17368, 2806, 1884, 6097, 7722, 15549, 98169, 5, 14520, 141, 707, 69307 ]	[ 0.1436767578125, 0.105224609375, 0.18408203125, 0.2022705078125, 0.169921875, 0.08843994140625, 0.29443359375, 0.1571044921875, 0.168212890625, 0.14501953125, 0.130859375, 0.1361083984375, 0.2257080078125, 0.1905517578125, 0.112548828125, 0.0750732421875, 0.0771484375, 0.1688232421...	embed
45632218_c0	45632218	haskell	0	Title: How would I write this function in point-free style? Problem title: How would I write this function in point-free style? Tags: haskell Problem: How would I write this function in point-free style? I'm just looking to make general improvements to my Haskell code, and was wondering if the following function could ...	How would I write this function in point-free style? How would I write this function in point-free style? haskell How How would I write this function in point-free style? I'm just looking to make general improvements to my Haskell code, and was wondering if the following function could be made point-free? Mostly for cu...	[ -0.0186767578125, 0.0023956298828125, -0.0235595703125, -0.0177001953125, 0.000335693359375, -0.0142822265625, -0.0026397705078125, -0.00982666015625, -0.006744384765625, -0.028564453125, -0.004669189453125, -0.001129150390625, -0.0030517578125, 0.01129150390625, -0.02099609375, -0.004...	[ 11249, 2806, 87, 33022, 903, 32354, 6275, 32087, 20623, 23, 9, 1556, 142508, 4537, 136912, 20625, 18151, 149016, 25632, 5809, 7228, 79975, 72018, 6626, 1884, 4527, 46312, 19537, 3996, 27781, 20662 ]	[ 0.08306884765625, 0.09906005859375, 0.025390625, 0.162841796875, 0.061492919921875, 0.2030029296875, 0.1412353515625, 0.1759033203125, 0.176025390625, 0.046661376953125, 0.04388427734375, 0.117919921875, 0.1951904296875, 0.033477783203125, 0.083740234375, 0.1026611328125, 0.064392089...	embed
37434500_c0	37434500	haskell	0	Title: Apply the composition of a list of functions to each number of a list Problem title: Apply the composition of a list of functions to each number of a list Tags: function-composition, haskell Problem: Apply the composition of a list of functions to each number of a list Given a list of functions and a list of num...	Apply the composition of a list of functions to each number of a list Apply the composition of a list of functions to each number of a list function-composition haskell Apply End Apply the composition of a list of functions to each number of a list Given a list of functions and a list of numbers, I want first function ...	[ -0.02783203125, -0.00116729736328125, 0.0164794921875, 0.0267333984375, -0.012451171875, 0.0255126953125, -0.00153350830078125, 0.015625, 0.00634765625, -0.00897216796875, -0.007659912109375, -0.01190185546875, 0.0218505859375, 0.0380859375, -0.009521484375, -0.01483154296875, 0.0016...	[ 5659, 538, 166577, 5303, 111, 32354, 7, 47, 12638, 14012, 277, 40322, 1556, 142508, 18878, 136, 101935, 3444, 5117, 190659, 16750, 7068, 11814, 100, 17932, 2685, 45367, 73, 903 ]	[ 0.162109375, 0.1094970703125, 0.24169921875, 0.1883544921875, 0.023895263671875, 0.1925048828125, 0.00994873046875, 0.10540771484375, 0.06939697265625, 0.1396484375, 0.135498046875, 0.145751953125, 0.122314453125, 0.21533203125, 0.1180419921875, 0.0537109375, 0.131103515625, 0.1152...	embed
20024723_c0	20024723	haskell	0	Title: View documentation of packages installed into a cabal sandbox Problem title: View documentation of packages installed into a cabal sandbox Tags: cabal, haskell, sandbox Problem: View documentation of packages installed into a cabal sandbox Is there a way to view the documentation of any package I installed in a ...	View documentation of packages installed into a cabal sandbox View documentation of packages installed into a cabal sandbox cabal haskell sandbox View View documentation of packages installed into a cabal sandbox Is there a way to view the documentation of any package I installed in a cabal sandbox? Currently I have a ...	[ 0.0172119140625, -0.0021514892578125, 0.023193359375, -0.007781982421875, -0.0052490234375, 0.0172119140625, 0.0029449462890625, 0.0098876953125, 0.006011962890625, -0.0185546875, 0.0069580078125, -0.024658203125, -0.000217437744140625, -0.010498046875, -0.00860595703125, 0.00830078125...	[ 29805, 209806, 98169, 20600, 297, 3934, 10, 109524, 19096, 11728, 1556, 142508, 3917, 47, 21455, 111, 2499, 87, 23, 26499, 44677, 39210, 60875, 442, 8781, 10723, 28987, 11522, 68186, 903, 34735, 18548, 214, 72977, 42850 ]	[ 0.205810546875, 0.3017578125, 0.2303466796875, 0.2081298828125, 0.09716796875, 0.10052490234375, 0.046966552734375, 0.2459716796875, 0.173828125, 0.2205810546875, 0.083740234375, 0.18896484375, 0.0545654296875, 0.09246826171875, 0.221923828125, 0.0650634765625, 0.0241546630859375, ...	embed
44263370_c1	44263370	haskell	1	see, bevor "Chuck" there is Person , so I've to use somehow > to get it. And that's it, just a line with <$> , <> and *> that works that way. I don't have a clue, and I'm getting crazy with this. Maybe anyone could help me. EDIT satisfy :: (Char -> Bool) -> Parser Char -- parse a desired character satisfy p = Parser...	see, bevor "Chuck" there is Person , so I've to use somehow > to get it. And that's it, just a line with <$> , <> and *> that works that way. I don't have a clue, and I'm getting crazy with this. Maybe anyone could help me. EDIT satisfy :: (Char -> Bool) -> Parser Char -- parse a desired character satisfy p = Parser...	[ 0.004791259765625, 0.01507568359375, 0.005218505859375, 0.0281982421875, 0.00408935546875, 0.03125, 0.0079345703125, -0.0162353515625, 0.004913330078125, -0.005828857421875, 0.0035400390625, -0.01446533203125, -0.0035400390625, 0.0191650390625, -0.0024871826171875, -0.018798828125, 0...	[ 1957, 68280, 15982, 75554, 2685, 83, 15270, 87, 272, 4527, 209303, 661, 2740, 47, 2046, 442, 450, 1660, 13315, 678, 4369, 1639, 43240, 3917, 765, 29786, 20949, 116666, 903, 83425, 35672, 4358, 172864, 40407, 53, 84068, 33079, 2460, 929, 2...	[ 0.0877685546875, 0.224853515625, 0.1766357421875, 0.255126953125, 0.0823974609375, 0.030364990234375, 0.253173828125, 0.002655029296875, 0.03631591796875, 0.114990234375, 0.08416748046875, 0.1033935546875, 0.18603515625, 0.00177001953125, 0.121337890625, 0.10693359375, 0.007720947265...	embed
9055662_c0	9055662	haskell	0	Title: GHCi - Breakpoint is skipped on second run Problem title: GHCi - Breakpoint is skipped on second run Tags: ghci, haskell Problem: GHCi - Breakpoint is skipped on second run I'm new to Haskell and I'm getting an annoying behaviour when debugging. I add my break point using :break I run main Everything is ok I typ...	GHCi - Breakpoint is skipped on second run GHCi - Breakpoint is skipped on second run ghci haskell GHCi Breakpoint GHCi - Breakpoint is skipped on second run I'm new to Haskell and I'm getting an annoying behaviour when debugging. I add my break point using :break I run main Everything is ok I type :continue to finish ...	[ -0.003631591796875, -0.00518798828125, 0.00701904296875, 0.0206298828125, -0.01483154296875, 0.01806640625, -0.001556396484375, 0.0189208984375, 0.003814697265625, -0.00052642822265625, 0.003082275390625, -0.017333984375, -0.01458740234375, 0.0194091796875, 0.0238037109375, 0.014587402...	[ 527, 73265, 14, 131904, 38496, 83, 7158, 48398, 98, 17932, 11675, 31380, 318, 1556, 142508, 3525, 20625, 8668, 38543, 224833, 8, 978, 15190, 36356, 6275, 70751, 87, 5201, 3664, 10644, 133891, 67229, 71924, 456, 16428, 959, 5962, 176683, 18,...	[ 0.0821533203125, 0.1253662109375, 0.1947021484375, 0.2030029296875, 0.2125244140625, 0.01446533203125, 0.1458740234375, 0.10491943359375, 0.049346923828125, 0.165283203125, 0.1661376953125, 0.07525634765625, 0.1123046875, 0.1177978515625, 0.2335205078125, 0.0232696533203125, 0.097900...	embed
58842377_c0	58842377	haskell	0	Title: Double for loop in haskell Problem title: Double for loop in haskell Tags: recursion, haskell, loops Problem: Double for loop in haskell I'm trying to make a new list with the 2nd number of a tuple of if the first number is in the first list, here a example helplist [0,2] [(0,"a"),(3,"x"),(5,"y"),(1,"b"),(2,"c")...	Double for loop in haskell Double for loop in haskell recursion haskell loops Double Char x:xs Double for loop in haskell I'm trying to make a new list with the 2nd number of a tuple of if the first number is in the first list, here a example helplist [0,2] [(0,"a"),(3,"x"),(5,"y"),(1,"b"),(2,"c")] = ["a","c"] I've try...	[ 0.0047607421875, -0.0194091796875, 0.00665283203125, 0.0269775390625, 0.0115966796875, 0.019287109375, 0.0172119140625, 0.017333984375, 0.02685546875, 0.0111083984375, 0.00982666015625, -0.0224609375, 0.0152587890625, 0.00885009765625, -0.018798828125, -0.0002689361572265625, 0.00686...	[ 107172, 100, 40956, 23, 1556, 142508, 195625, 1830, 21656, 1022, 12, 425, 31577, 3249, 3525, 5303, 678, 116, 2208, 14012, 370, 8705, 2174, 5117, 83, 27781, 4358, 6562, 2389, 90173, 11, 86827, 104116, 53, 54753, 2203, 238, 9790, 5941, 1625...	[ 0.223388671875, 0.150390625, 0.226318359375, 0.06683349609375, 0.1629638671875, 0.251220703125, 0.200439453125, 0.11279296875, 0.16650390625, 0.0880126953125, 0.03277587890625, 0.1075439453125, 0.0701904296875, 0.023468017578125, 0.066650390625, 0.1427001953125, 0.021820068359375, ...	embed
34897366_c0	34897366	haskell	0	Title: Function pattern matching in Haskell Problem title: Function pattern matching in Haskell Tags: haskell Problem: Function pattern matching in Haskell I'm trying to learn Haskell in guidance of Learn You a Haskell , but the following puzzles me. lucky :: (Integral a) => a -> String lucky 7 = "LUCKY NUMBER SEVEN!" ...	Function pattern matching in Haskell Function pattern matching in Haskell haskell Haskell Integral LUCKY NUMBER SEVEN Sorry Function pattern matching in Haskell I'm trying to learn Haskell in guidance of Learn You a Haskell , but the following puzzles me. As you can see, there's one line up there stating the exact type...	[ -0.021484375, -0.004974365234375, 0.00836181640625, -0.003021240234375, -0.005615234375, 0.00653076171875, -0.025390625, -0.00390625, 0.0107421875, 0.006561279296875, 0.00015354156494140625, -0.0252685546875, -0.003631591796875, -0.00616455078125, 0.019775390625, 0.000885009765625, 0...	[ 28670, 10763, 103510, 14858, 214, 23, 20625, 142508, 1556, 204681, 30684, 441, 32272, 109020, 24480, 6755, 30223, 90502, 31577, 30698, 196219, 134031, 25632, 104192, 1957, 1632, 13315, 1257, 2685, 13254, 24763, 52895, 32354, 83, 903, 63559, 417...	[ 0.12255859375, 0.071044921875, 0.21875, 0.2149658203125, 0.081298828125, 0.061065673828125, 0.138916015625, 0.220947265625, 0.1146240234375, 0.1768798828125, 0.1119384765625, 0.101318359375, 0.1417236328125, 0.1038818359375, 0.039093017578125, 0.1405029296875, 0.166259765625, 0.075...	embed
4228416_c1	4228416	haskell	1	back inito the MVar Now the thing simply starts to eat A LOT of memory. Probably because the old heaps don't get garbage collected soon/frequently enough..? Is there a way to solve these problems or do I have to get back to C...? What I am doing should be mostly zerocopy operation - am I using wrong libraries to achie...	back inito the MVar Now the thing simply starts to eat A LOT of memory. Probably because the old heaps don't get garbage collected soon/frequently enough..? Is there a way to solve these problems or do I have to get back to C...? What I am doing should be mostly zerocopy operation - am I using wrong libraries to achie...	[ -0.000942230224609375, 0.0294189453125, -0.0238037109375, -0.002777099609375, 0.0128173828125, -0.005645751953125, -0.0010528564453125, 0.007354736328125, -0.00005626678466796875, -0.01129150390625, 0.018310546875, 0.006988525390625, 0.028564453125, 0.0233154296875, 0.01165771484375, -...	[ 4420, 485, 188, 70, 66160, 147, 13580, 42856, 4034, 47, 73203, 115447, 111, 98323, 10332, 17305, 6423, 402, 43799, 33662, 12176, 3917, 86869, 44402, 313, 153161, 45234, 137366, 41018, 44691, 35773, 69307, 118620, 184, 864, 3884, 61922, 347, ...	[ 0.14404296875, 0.1251220703125, 0.160888671875, 0.002716064453125, 0.1397705078125, 0.2333984375, 0.07269287109375, 0.007232666015625, 0.05902099609375, 0.0848388671875, 0.1492919921875, 0.1361083984375, 0.0232696533203125, 0.194091796875, 0.04132080078125, 0.151611328125, 0.14526367...	embed
46257773_c1	46257773	haskell	1	9","2HCH0030","2HCH0031","2H_4_0033"] Now I want to remove all the entries that are "" . So I try nonEmptyANames <- filter (\s -> s /= "") anames But I get this error: • Couldn't match type ‘[]’ with ‘IO’ Expected type: IO String Actual type: [String] • In a stmt of a 'do' block: nonEmptyANames <- filter (\ s -> s /= "...	9","2HCH0030","2HCH0031","2H_4_0033"] Now I want to remove all the entries that are "" . So I try nonEmptyANames <- filter (\s -> s /= "") anames But I get this error: • Couldn't match type ‘[]’ with ‘IO’ Expected type: IO String Actual type: [String] • In a stmt of a 'do' block: nonEmptyANames <- filter (\ s -> s /= "...	[ -0.00958251953125, -0.00775146484375, 0, 0.0283203125, -0.0093994140625, -0.0029144287109375, 0.00799560546875, 0.008056640625, 0.006072998046875, 0.0264892578125, 0.0228271484375, -0.01458740234375, 0.00811767578125, -0.00193023681640625, -0.0159912109375, -0.0042724609375, 0.041748...	[ 483, 304, 841, 16999, 7049, 1197, 5016, 617, 123276, 363, 3444, 47, 87388, 756, 70, 112820, 90, 450, 621, 44, 58, 9790, 351, 134332, 939, 9330, 302, 46312, 41872, 33079, 91, 248, 3877, 3716, 903, 18499, 191147, 18, 14858, 10644, 1065, ...	[ 0.1513671875, 0.0214080810546875, 0.03411865234375, 0.055908203125, 0.050506591796875, 0.1302490234375, 0.1239013671875, 0.0037841796875, 0.04937744140625, 0.061004638671875, 0.058319091796875, 0.058319091796875, 0.1934814453125, 0.0780029296875, 0.022003173828125, 0.197021484375, 0....	embed
31580302_c0	31580302	haskell	0	Title: Main function complains of returning a non IO monad Problem title: Main function complains of returning a non IO monad Tags: haskell Problem: Main function complains of returning a non IO monad import Debug.Trace main = do trace "Main function parses, and returns - " "0" return () This throws error as, app.hs:3:...	Main function complains of returning a non IO monad Main function complains of returning a non IO monad haskell Debug.Trace Main app.hs:3:1 Couldn When Main function complains of returning a non IO monad This throws error as, If i am not wrong, the module must work without return. But with or without return function, i...	[ -0.00811767578125, 0.01513671875, -0.0006103515625, 0.0159912109375, -0.00159454345703125, 0.0027618408203125, 0.005401611328125, -0.01513671875, -0.0115966796875, -0.01397705078125, 0.00946044921875, -0.0390625, 0.0035400390625, -0.0234375, 0.00701904296875, -0.003204345703125, 0.01...	[ 12321, 32354, 186992, 30646, 351, 17780, 2667, 712, 214, 1556, 142508, 262, 85779, 28542, 329, 4027, 127, 19721, 191147, 19, 14847, 111, 104250, 18499, 237, 4263, 17, 444, 959, 44691, 88996, 8110, 4488, 15490, 4966, 678, 707, 83, 20697 ]	[ 0.1778564453125, 0.173583984375, 0.19970703125, 0.2432861328125, 0.1856689453125, 0.20068359375, 0.1287841796875, 0.1685791015625, 0.00628662109375, 0.1204833984375, 0.2034912109375, 0.073974609375, 0.2027587890625, 0.1439208984375, 0.0202484130859375, 0.1484375, 0.0550537109375, 0...	embed
64634999_c0	64634999	haskell	0	Title: Tasty HUnit test against Either Problem title: Tasty HUnit test against Either Tags: hunit, haskell Problem: Tasty HUnit test against Either I am fairly new to Haskell, and I was wondering if there is a way to test a pattern match, as in erlang. An example is a function that returns an Either a b, Can I match ag...	Tasty HUnit test against Either Tasty HUnit test against Either hunit haskell Tasty HUnit Either Tasty HUnit test against Either I am fairly new to Haskell, and I was wondering if there is a way to test a pattern match, as in erlang. An example is a function that returns an Either a b, Can I match against Left b, whils...	[ -0.0033111572265625, -0.0126953125, 0.000843048095703125, -0.000728607177734375, -0.015380859375, -0.01611328125, -0.0167236328125, -0.0213623046875, 0.00323486328125, 0.0203857421875, 0.0177001953125, -0.01385498046875, 0.004791259765625, 0.000698089599609375, 0.010986328125, 0.006896...	[ 9598, 939, 22438, 6773, 3034, 26548, 4565, 9319, 1926, 217, 1556, 142508, 20625, 149016, 3917, 103510, 14858, 72, 3066, 27781, 32354, 30646, 10, 876, 4171, 636, 2480, 217982, 47438, 68034, 23351, 214, 212059, 3444, 2174, 18499, 74918, 7986, ...	[ 0.1658935546875, 0.16796875, 0.0946044921875, 0.2244873046875, 0.2091064453125, 0.16064453125, 0.0723876953125, 0.185302734375, 0.1165771484375, 0.1453857421875, 0.0982666015625, 0.2159423828125, 0.100341796875, 0.003448486328125, 0.040924072265625, 0.1981201171875, 0.209228515625, ...	embed
2546455_c0	2546455	haskell	0	Title: What is wrong with my definition of Zip in Haskell? Problem title: What is wrong with my definition of Zip in Haskell? Tags: haskell, zip, combinators Problem: What is wrong with my definition of Zip in Haskell? -- eg. myzip [’a’, ’b’, ’c’] [1, 2, 3, 4] -> [(’a’, 1), (’b’, 2), (’c’, 3)] myzip :: Ord a => [a] -> ...	What is wrong with my definition of Zip in Haskell? What is wrong with my definition of Zip in Haskell? haskell zip combinators What Zip Haskell Ord list1 list2 Occurs When Failed What is wrong with my definition of Zip in Haskell? I get this error message:	[ -0.00689697265625, 0.009521484375, 0.001556396484375, 0.01031494140625, 0.0025787353515625, 0.02099609375, -0.017822265625, 0.00160980224609375, 0.00762939453125, -0.0106201171875, 0.0028533935546875, -0.0035858154296875, 0.0016632080078125, 0.00537109375, -0.01092529296875, 0.02038574...	[ 4865, 83, 44691, 678, 759, 80934, 162150, 23, 20625, 142508, 1556, 68330, 22321, 22230, 35379, 5303, 418, 304, 180, 238, 48650, 14847, 190355, 297, 903, 18499, 26008 ]	[ 0.03363037109375, 0.012176513671875, 0.1376953125, 0.08013916015625, 0.04095458984375, 0.166015625, 0.256103515625, 0.051177978515625, 0.11004638671875, 0.2276611328125, 0.09613037109375, 0.217041015625, 0.1556396484375, 0.07293701171875, 0.150634765625, 0.11181640625, 0.022750854492...	embed
26872843_c0	26872843	haskell	0	Title: Haskell filtered string to list Problem title: Haskell filtered string to list Tags: list, haskell, filter, string Problem: Haskell filtered string to list I want a fuction where you put in a String like "Hello I am 25 years old!" and get a list out of it like ["hello","i","am","years","old"]. So it should put a...	Haskell filtered string to list Haskell filtered string to list list haskell filter string Haskell Haskell filtered string to list I want a fuction where you put in a String like "Hello I am 25 years old!" and get a list out of it like ["hello","i","am","years","old"]. So it should put all uppercase letters in lowercas...	[ -0.003387451171875, -0.00157928466796875, -0.01483154296875, 0.01007080078125, 0.0048828125, 0.0263671875, 0.01708984375, -0.01239013671875, 0.00689697265625, -0.0001392364501953125, 0.001068115234375, -0.0169677734375, -0.00250244140625, 0.00811767578125, -0.0106201171875, 0.014038085...	[ 20625, 142508, 46312, 297, 79315, 47, 5303, 1556, 3444, 5639, 10763, 3884, 23, 23351, 214, 1884, 841, 13817, 87, 444, 714, 5369, 10332, 3890, 2046, 1810, 830, 14, 302, 46799, 18345, 5608, 756, 1407, 58437, 120820, 92319, 154109, 26818, 66...	[ 0.139892578125, 0.22265625, 0.265869140625, 0.1090087890625, 0.254150390625, 0.10888671875, 0.2435302734375, 0.1297607421875, 0.115478515625, 0.1619873046875, 0.1558837890625, 0.040985107421875, 0.0599365234375, 0.166748046875, 0.08935546875, 0.018218994140625, 0.052032470703125, 0...	embed
46677991_c0	46677991	haskell	0	Title: Rigid type error Problem title: Rigid type error Tags: haskell Problem: Rigid type error I have the following code: data Argument = Argument { ttype :: Type, value :: String } data Predicate = Predicate { lemma :: String , arguments :: [Argument] } class Throw a where throw :: a -> a -> Predicate instance Throw ...	Rigid type error Rigid type error haskell rel Rigid Argument Type Predicate Throw STUFF HAPPENS HERE OTHER PATTERNS HAPPEN context.hs:162:11 Couldn context.hs:161:1-55 LEAVING OUT BREVITY SAKE Relevant context.hs:162:6 context.hs:162:1 Rigid type error I have the following code: The idea is that b in the qWho signature...	[ -0.0037384033203125, 0.0059814453125, -0.005828857421875, 0.00909423828125, 0.01409912109375, 0.0035858154296875, -0.034912109375, -0.01153564453125, -0.002288818359375, -0.032958984375, 0.0029296875, -0.01092529296875, -0.00188446044921875, -0.0233154296875, 0.01708984375, -0.01446533...	[ 129956, 532, 10644, 18499, 1556, 142508, 7962, 112140, 60457, 7145, 2063, 6003, 15555, 94432, 30110, 572, 40680, 42603, 65791, 224750, 100308, 14755, 11572, 43701, 127, 22354, 19993, 191147, 19, 151525, 112930, 52001, 40972, 63823, 159, 119960, ...	[ 0.2132568359375, 0.2008056640625, 0.228759765625, 0.205078125, 0.11572265625, 0.2176513671875, 0.1005859375, 0.2471923828125, 0.2066650390625, 0.1466064453125, 0.1961669921875, 0.037841796875, 0.13623046875, 0.064208984375, 0.1282958984375, 0.034637451171875, 0.07135009765625, 0.03...	embed
66993706_c0	66993706	haskell	0	Title: Parsing IO [Int] to use the Int Problem title: Parsing IO [Int] to use the Int Tags: list, io, integer, parsing, haskell Problem: Parsing IO [Int] to use the Int I am developing in Haskell and I had to use System.Random . Now I have a IO [Int] and I would like to parse it to get the Int out of it and then use it...	Parsing IO [Int] to use the Int Parsing IO [Int] to use the Int list io integer parsing haskell Parsing System.Random x:xs Couldn Parsing IO [Int] to use the Int I am developing in Haskell and I had to use System.Random . Now I have a IO [Int] and I would like to parse it to get the Int out of it and then use it to per...	[ -0.0213623046875, -0.005706787109375, 0.010498046875, -0.017333984375, -0.007720947265625, 0.029541015625, 0.01434326171875, -0.0018157958984375, 0.0185546875, -0.0247802734375, 0.01904296875, -0.0045166015625, 0.00118255615234375, 0.02197265625, 0.016357421875, -0.004058837890625, -...	[ 2392, 6953, 17780, 4153, 18, 47, 4527, 360, 6, 5303, 22995, 892, 1505, 366, 1556, 142508, 12353, 126525, 3815, 1022, 12, 425, 191147, 168698, 20625, 5, 765, 1884, 184, 2046, 1810, 51339, 142, 22631, 98, 18499, 7, 11249, 378, 46132 ]	[ 0.157470703125, 0.08013916015625, 0.25634765625, 0.1585693359375, 0.18115234375, 0.054595947265625, 0.1529541015625, 0.17431640625, 0.006072998046875, 0.1820068359375, 0.2423095703125, 0.1357421875, 0.0660400390625, 0.1607666015625, 0.12548828125, 0.2213134765625, 0.107421875, 0.12...	embed
24228402_c0	24228402	haskell	0	Title: NixOS and ghc-mod - Module not found Problem title: NixOS and ghc-mod - Module not found Tags: nixos, emacs, haskell Problem: NixOS and ghc-mod - Module not found I'm experimenting a problem with the interaction between the ghc-mod plugin in emacs, and NixOS 14.04. Basically, once packages are installed via nix-...	NixOS and ghc-mod - Module not found NixOS and ghc-mod - Module not found nixos emacs haskell NixOS Module NixOS and ghc-mod - Module not found I'm experimenting a problem with the interaction between the ghc-mod plugin in emacs, and NixOS 14.04. Basically, once packages are installed via nix-env -i , they are visible ...	[ -0.015625, 0.005584716796875, 0.00885009765625, 0.01068115234375, -0.0002841949462890625, 0.020263671875, -0.009033203125, -0.00396728515625, -0.00152587890625, 0.005035400390625, -0.01324462890625, -0.0478515625, 0.0054931640625, -0.006591796875, -0.0072021484375, -0.0113525390625, ...	[ 1520, 425, 7285, 136, 31380, 238, 13415, 63014, 13, 959, 14037, 9, 300, 47436, 352, 2263, 1556, 142508, 28007, 2967, 182809, 69993, 6370, 39876, 24145, 98169, 20600, 1829, 33, 334, 14, 75693, 318, 75530, 61170, 182867, 43084, 54608, 99126, ...	[ 0.108154296875, 0.1041259765625, 0.182861328125, 0.07305908203125, 0.1612548828125, 0.1568603515625, 0.233154296875, 0.240966796875, 0.0745849609375, 0.0902099609375, 0.1739501953125, 0.009735107421875, 0.076904296875, 0.143798828125, 0.101806640625, 0.1175537109375, 0.1112060546875,...	embed
43363044_c0	43363044	haskell	0	Title: Haskell data type parametrized with random generator data type Problem title: Haskell data type parametrized with random generator data type Tags: haskell Problem: Haskell data type parametrized with random generator data type How can I parametrize a data type with a random generator data type? I tried this: dat...	Haskell data type parametrized with random generator data type Haskell data type parametrized with random generator data type haskell Haskell DataType Data RandomGen Predicate Failed GameState Haskell data type parametrized with random generator data type How can I parametrize a data type with a random generator data t...	[ -0.004547119140625, 0.026123046875, -0.01177978515625, -0.0103759765625, 0.0125732421875, 0.0181884765625, 0.01190185546875, -0.005157470703125, -0.01226806640625, -0.060546875, 0.019775390625, -0.0208740234375, -0.0123291015625, -0.01019287109375, -0.01226806640625, -0.012451171875, ...	[ 20625, 142508, 2053, 10644, 39850, 29367, 678, 96759, 145823, 1556, 11809, 196707, 39643, 306, 105376, 7145, 2063, 190355, 297, 13547, 135206, 11249, 831, 87, 170358, 731, 37842, 903, 4966, 2046 ]	[ 0.1619873046875, 0.235107421875, 0.1734619140625, 0.2274169921875, 0.201416015625, 0.07244873046875, 0.1424560546875, 0.167724609375, 0.22509765625, 0.1396484375, 0.11322021484375, 0.225830078125, 0.11260986328125, 0.0390625, 0.1624755859375, 0.09893798828125, 0.0745849609375, 0.14...	embed
7785059_c0	7785059	haskell	0	Title: Haskell, lacks an accompanying binding? Problem title: Haskell, lacks an accompanying binding? Tags: haskell Problem: Haskell, lacks an accompanying binding? this is my program (I realise it's not an entirely useful program): data Temp a = Something1 \| Something2 deriving (Show,Eq,Ord) length :: Temp a -> Intege...	Haskell, lacks an accompanying binding? Haskell, lacks an accompanying binding? haskell Haskell Temp Something1 Something2 Show Ord Integer Haskell, lacks an accompanying binding? this is my program (I realise it's not an entirely useful program): and I keep getting the error message: Haskellfile.lhs:3:3: The type sign...	[ 0.007232666015625, 0.038330078125, -0.006744384765625, -0.0015411376953125, -0.00096893310546875, 0.0130615234375, 0.00836181640625, 0.000606536865234375, 0.00958251953125, -0.0264892578125, -0.01361083984375, -0.04052734375, 0.005950927734375, 0.0123291015625, 0.011474609375, -0.01086...	[ 20625, 142508, 21, 22824, 142, 1030, 146365, 214, 128239, 1556, 37446, 200905, 418, 304, 17367, 35379, 44401, 1528, 2773, 959, 80234, 13695, 18499, 26008, 29822, 79366, 363, 10644, 138256, 23986, 927, 53418, 8337, 76242, 34292, 4358 ]	[ 0.1419677734375, 0.2359619140625, 0.1136474609375, 0.1361083984375, 0.0474853515625, 0.038726806640625, 0.150390625, 0.06982421875, 0.22509765625, 0.1209716796875, 0.1802978515625, 0.1317138671875, 0.0595703125, 0.06988525390625, 0.132080078125, 0.139404296875, 0.156494140625, 0.09...	embed
8274470_c0	8274470	haskell	0	Title: How to fix the yesod ipv6 only issue? Problem title: How to fix the yesod ipv6 only issue? Tags: haskell, yesod Problem: How to fix the yesod ipv6 only issue? There's an outstanding issue with yesod where it only listens on ipv6. I am following the yesod in five minutes guide and have this issue when running "ye...	How to fix the yesod ipv6 only issue? How to fix the yesod ipv6 only issue? haskell yesod How ipv6 How to fix the yesod ipv6 only issue? There's an outstanding issue with yesod where it only listens on ipv6. I am following the yesod in five minutes guide and have this issue when running "yesod devel". How can I fix it ...	[ -0.006561279296875, 0.001312255859375, 0.01153564453125, -0.000637054443359375, 0.00156402587890625, 0.005615234375, -0.02490234375, -0.0159912109375, -0.0152587890625, -0.016357421875, 0.021240234375, -0.01300048828125, -0.0045166015625, -0.0023651123046875, 0.01190185546875, 0.012390...	[ 11249, 47, 30022, 2422, 23722, 17, 132059, 910, 4734, 31089, 1556, 142508, 216348, 678, 7440, 442, 44632, 98, 25632, 43606, 14633, 17997, 51042, 1033, 8, 2601, 5036, 1257, 9790, 170846, 1810, 27211, 759, 9007, 46295, 112, 127, 5550, 254, ...	[ 0.077880859375, 0.07421875, 0.1455078125, 0.2052001953125, 0.26171875, 0.0716552734375, 0.190185546875, 0.2197265625, 0.153076171875, 0.1328125, 0.1300048828125, 0.2049560546875, 0.0732421875, 0.034759521484375, 0.006072998046875, 0.0293121337890625, 0.2110595703125, 0.106689453125...	embed
30015171_c0	30015171	haskell	0	Title: Haskell tree size Problem title: Haskell tree size Tags: haskell, tree Problem: Haskell tree size Still a haskell noob here! I am trying to get the size of a tree? data Tree a = Leaf a \| Node (Tree a) (Tree a) size :: Tree a -> Int size empty = 0 size (Leaf n) = 1 size (Node x z) = size x + size z + 1 If I call ...	Haskell tree size Haskell tree size haskell tree Haskell Tree Leaf Node Haskell tree size Still a haskell noob here! I am trying to get the size of a tree? If I call the function with All I get is 0. Is the code correct and I am just not calling it correctly? BTW, I have seen lots of examples with Empty instead of empt...	[ 0.0025634765625, -0.007080078125, 0.0155029296875, -0.0020294189453125, 0.01422119140625, 0.0086669921875, -0.01190185546875, -0.01446533203125, 0.0107421875, -0.0230712890625, 0.003204345703125, -0.02099609375, -0.000732421875, 0.007049560546875, 0.0106201171875, 0.0011138916015625, ...	[ 20625, 142508, 53201, 13267, 1556, 101344, 636, 2407, 438, 112, 50605, 3522, 3688, 38, 31577, 2046, 70, 111, 11782, 32354, 678, 3164, 87, 83, 757, 18151, 26785, 159029, 170207, 51592, 71358, 27781, 31678, 939, 64457, 201505, 113660, 142, 18...	[ 0.1531982421875, 0.254638671875, 0.240478515625, 0.232666015625, 0.1435546875, 0.182861328125, 0.0174407958984375, 0.1156005859375, 0.0791015625, 0.017547607421875, 0.0222930908203125, 0.0958251953125, 0.0140533447265625, 0.004241943359375, 0.062347412109375, 0.153076171875, 0.079467...	embed
30802142_c1	30802142	haskell	1	is out of bounds: Main> rndSelectIO' "asdf" 5 >>= putStrLn dfas** Exception: Number of items requested is larger than list Main> rndSelectIO' "asdf" 2 >>= putStrLn ** Exception: Number of items requested is larger than list As you can see, the following 2 (for me) unexpected things happen: Instead of directly givi...	is out of bounds: Main> rndSelectIO' "asdf" 5 >>= putStrLn dfas** Exception: Number of items requested is larger than list Main> rndSelectIO' "asdf" 2 >>= putStrLn ** Exception: Number of items requested is larger than list As you can see, the following 2 (for me) unexpected things happen: Instead of directly givi...	[ -0.006011962890625, 0.018798828125, 0.00799560546875, -0.01953125, 0.006622314453125, 0.01373291015625, -0.0172119140625, -0.01336669921875, 0.0179443359375, -0.01165771484375, 0.0164794921875, -0.04833984375, 0.00970458984375, 0.021484375, 0.0184326171875, 0.00762939453125, 0.018310...	[ 83, 1810, 111, 99091, 7, 168793, 1690, 2208, 294, 100184, 17780, 162, 420, 190, 3884, 71713, 866, 19, 104, 31773, 5443, 63928, 103332, 55769, 50336, 297, 150679, 3501, 5303, 58, 831, 1957, 25632, 116, 241957, 8966, 53383, 175399, 105237, ...	[ 0.09228515625, 0.109619140625, 0.08734130859375, 0.1553955078125, 0.0144805908203125, 0.116455078125, 0.026947021484375, 0.1318359375, 0.0318603515625, 0.15380859375, 0.200439453125, 0.02972412109375, 0.1494140625, 0.10369873046875, 0.1234130859375, 0.115234375, 0.004913330078125, ...	embed
57624349_c1	57624349	haskell	1	proximity (including diagonal), so I'm looking for a result like bellow: [ [(-1 , 2)] , [(1, 2),(1,1)] , [(-2, -0),(-1,-1),(-1,-2)] , [(2, -1)]] I've researched and tried various algorithm like BFS, Flood Fill but my input data never fit the structural requirements or my understanding of the subjects doesn't allow me ...	proximity (including diagonal), so I'm looking for a result like bellow: [ [(-1 , 2)] , [(1, 2),(1,1)] , [(-2, -0),(-1,-1),(-1,-2)] , [(2, -1)]] I've researched and tried various algorithm like BFS, Flood Fill but my input data never fit the structural requirements or my understanding of the subjects doesn't allow me ...	[ 0.00897216796875, 0.0185546875, -0.017578125, -0.01263427734375, -0.023193359375, 0.0150146484375, 0.0013427734375, 0.011474609375, 0.012451171875, -0.00537109375, -0.0017547607421875, 0.001495361328125, 0.001739501953125, 0.00335693359375, -0.0302734375, 0.0091552734375, 0.002395629...	[ 241846, 939, 216561, 207997, 16487, 100, 16750, 1884, 186, 41566, 5759, 4958, 41600, 17727, 5428, 20, 77495, 110218, 10461, 54753, 25188, 37842, 67842, 234873, 335, 36381, 91841, 140423, 1284, 107730, 2053, 8306, 11177, 118990, 96679, 100094, 2...	[ 0.269287109375, 0.1484375, 0.0279083251953125, 0.2239990234375, 0.1241455078125, 0.050323486328125, 0.15576171875, 0.08917236328125, 0.03839111328125, 0.21533203125, 0.140625, 0.09918212890625, 0.030853271484375, 0.0712890625, 0.0643310546875, 0.006103515625, 0.1337890625, 0.110961...	embed
16785594_c0	16785594	haskell	0	Title: How to import GLUT in Haskell script file Problem title: How to import GLUT in Haskell script file Tags: glut, haskell, graphics, opengl, hugs Problem: How to import GLUT in Haskell script file I get an error when i try to import GLUT package import Graphics.Rendering.OpenGL import Graphics.UI.GLUT The error i a...	How to import GLUT in Haskell script file How to import GLUT in Haskell script file glut haskell graphics opengl hugs GLUT Graphics.Rendering.OpenGL Graphics.UI.GLUT How Haskell How to import GLUT in Haskell script file I get an error when i try to import GLUT package The error i am getting is : I don't know how to use...	[ -0.01312255859375, 0.010009765625, -0.00188446044921875, -0.0024261474609375, 0.002532958984375, 0.0031890869140625, 0.015869140625, -0.0244140625, -0.0115966796875, 0.003875732421875, -0.003326416015625, -0.0478515625, 0.0111083984375, -0.02294921875, 0.0048828125, -0.00921630859375, ...	[ 11249, 24927, 527, 143662, 23, 20625, 142508, 26499, 11435, 47, 167994, 1556, 48461, 9803, 11016, 35875, 7, 189682, 33, 111747, 103264, 78703, 33457, 724, 18499, 9790, 98169, 20949, 3714, 3642, 4527, 59488, 17686, 30513, 9405, 831, 18, 7413, ...	[ 0.040679931640625, 0.2283935546875, 0.117431640625, 0.28662109375, 0.09088134765625, 0.125, 0.22265625, 0.175537109375, 0.1060791015625, 0.018524169921875, 0.2415771484375, 0.1142578125, 0.1822509765625, 0.030364990234375, 0.07763671875, 0.1214599609375, 0.05462646484375, 0.2171630...	embed
27762615_c0	27762615	haskell	0	Title: GCC error message after installing OSX Yosemite on Macbook Pro Problem title: GCC error message after installing OSX Yosemite on Macbook Pro Tags: macos, haskell, ghc, gcc Problem: GCC error message after installing OSX Yosemite on Macbook Pro Since I updated my Macbook to OSX Yosemite, I've getting the followin...	GCC error message after installing OSX Yosemite on Macbook Pro GCC error message after installing OSX Yosemite on Macbook Pro macos haskell ghc gcc GCC OSX Yosemite Macbook Pro kern.osversion GCC error message after installing OSX Yosemite on Macbook Pro Since I updated my Macbook to OSX Yosemite, I've getting the foll...	[ 0.00970458984375, 0.020263671875, 0.006927490234375, -0.00909423828125, 0.0057373046875, 0.0013275146484375, -0.031494140625, -0.002349853515625, -0.03271484375, 0.00101470947265625, 0.010009765625, -0.05712890625, -0.00677490234375, -0.0135498046875, 0.0194091796875, 0.00823974609375,...	[ 527, 13709, 18499, 26008, 7103, 20600, 11787, 1542, 6949, 184, 35093, 4727, 14137, 1250, 214, 98, 7840, 1556, 142508, 31380, 238, 22109, 77924, 232, 46354, 150011, 47, 1631, 592, 3293, 6032, 4527, 73265, 9969, 1340, 20625, 1528, 49725, 9433...	[ 0.1280517578125, 0.2120361328125, 0.13916015625, 0.09375, 0.0654296875, 0.114501953125, 0.1170654296875, 0.1185302734375, 0.191650390625, 0.14599609375, 0.2088623046875, 0.0966796875, 0.1619873046875, 0.1510009765625, 0.010009765625, 0.0211334228515625, 0.084228515625, 0.0919189453...	embed
20172710_c0	20172710	haskell	0	Title: Error check within do block in Haskell Problem title: Error check within do block in Haskell Tags: haskell Problem: Error check within do block in Haskell i have the following set of actions: action1 :: IO Bool action2 :: IO Bool action3 :: IO Bool some actions are just composition of another actions complexActi...	Error check within do block in Haskell Error check within do block in Haskell haskell Error Haskell action1 Bool action2 action3 Error check within do block in Haskell i have the following set of actions: some actions are just composition of another actions What i need is the construction that checks result of each act...	[ -0.015625, 0.00133514404296875, 0.000698089599609375, -0.004730224609375, 0.00762939453125, 0.031494140625, -0.01043701171875, 0.01544189453125, 0.00897216796875, 0.01495361328125, 0.0034942626953125, -0.006591796875, 0.020263671875, 0.000881195068359375, -0.01104736328125, 0.017700195...	[ 212059, 12765, 28032, 54, 46389, 20625, 142508, 23, 1556, 22631, 2460, 929, 304, 363, 25632, 5423, 61972, 3060, 166577, 15700, 3871, 50961, 16750, 12638, 30646, 22225, 184, 7225, 98320, 23009, 72977, 31351, 450, 8562, 337, 34759, 92558 ]	[ 0.2081298828125, 0.1982421875, 0.1864013671875, 0.1417236328125, 0.2064208984375, 0.12548828125, 0.2098388671875, 0.026519775390625, 0.128662109375, 0.1607666015625, 0.045928955078125, 0.1439208984375, 0.00421142578125, 0.0859375, 0.0148773193359375, 0.0560302734375, 0.153564453125, ...	embed
4701207_c0	4701207	haskell	0	Title: Current status of automatic parallelism in Haskell Problem title: Current status of automatic parallelism in Haskell Tags: optimization, multicore, haskell, ghc, parallel-processing Problem: Current status of automatic parallelism in Haskell Possible Duplicate: What's the status of multicore programming in Haske...	Current status of automatic parallelism in Haskell Current status of automatic parallelism in Haskell optimization multicore haskell ghc parallel-processing Current Haskell Current status of automatic parallelism in Haskell What is the status especially in GHC? Is it popular yet, or still being experimental? How carefu...	[ -0.005645751953125, 0.0096435546875, 0.019287109375, 0.00130462646484375, -0.0189208984375, 0.01507568359375, -0.0011749267578125, -0.01116943359375, -0.0150146484375, -0.01483154296875, -0.01068115234375, 0.01385498046875, -0.0011138916015625, 0.01275634765625, -0.014404296875, 0.0098...	[ 114063, 10778, 101038, 95103, 8780, 23, 20625, 142508, 87235, 6024, 30854, 1556, 31380, 238, 63923, 527, 73265, 5700, 14373, 7464, 195935, 517, 64552, 3964, 9969, 34759, 37476, 3229, 20650, 11675, 6032, 55076, 86997, 20740, 13267, 95307, 40140,...	[ 0.12841796875, 0.1541748046875, 0.217529296875, 0.2491455078125, 0.1243896484375, 0.029083251953125, 0.1517333984375, 0.2440185546875, 0.1295166015625, 0.057861328125, 0.126708984375, 0.1395263671875, 0.1121826171875, 0.111572265625, 0.07269287109375, 0.08544921875, 0.193603515625, ...	embed
7856245_c0	7856245	haskell	0	Title: Not in scope : data constructor IsTriangle Problem title: Not in scope : data constructor IsTriangle Tags: haskell, module Problem: Not in scope : data constructor IsTriangle Here is the module - Number1.hs module Number1(isTriangle) where isTriangle x y z = if xx+yy >= z*z then True else False This is the mai...	Not in scope : data constructor IsTriangle Not in scope : data constructor IsTriangle haskell module System.Environment Number1 Not IsTriangle Main1.hs Not in scope : data constructor IsTriangle Here is the module - Number1.hs This is the main program Main1.hs This error I get when ghc --make Main1.hs	[ 0.00445556640625, -0.01611328125, -0.016845703125, 0.00139617919921875, 0.008544921875, 0.0238037109375, 0.02490234375, 0.013916015625, -0.00022029876708984375, -0.0184326171875, -0.0120849609375, -0.027099609375, 0.0147705078125, -0.00994873046875, -0.0023956298828125, 0.00537109375, ...	[ 11205, 23, 70820, 2053, 64549, 748, 2071, 74257, 109217, 6, 1556, 142508, 88996, 12353, 686, 1900, 103332, 418, 12321, 127, 11853, 83, 7, 3293, 5201, 1528, 18499, 3229, 31380, 238, 4210, 55898, 5 ]	[ 0.18701171875, 0.1392822265625, 0.2183837890625, 0.1033935546875, 0.15771484375, 0.082763671875, 0.1539306640625, 0.18603515625, 0.2261962890625, 0.0220947265625, 0.1300048828125, 0.21044921875, 0.1861572265625, 0.07928466796875, 0.0736083984375, 0.1033935546875, 0.140380859375, 0....	embed
9912880_c0	9912880	haskell	0	Title: Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? Problem title: Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? Tags: reactive-programming, frp, haskell Problem: Does it make sense to use FRP (reactive-banana in particular) for ...	Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? reactive-programming frp haskell Does FRP Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? I'm t...	[ -0.012451171875, 0.0111083984375, 0.0118408203125, 0.00274658203125, -0.00897216796875, -0.001922607421875, 0.006500244140625, 0.00787353515625, -0.00152587890625, -0.0128173828125, 0.0096435546875, -0.00341796875, -0.0025787353515625, 0.037109375, -0.0286865234375, 0.0028228759765625,...	[ 101790, 3249, 10422, 4527, 563, 38796, 107, 71232, 105281, 11, 17311, 100, 15504, 35509, 237, 26506, 6712, 456, 28966, 14119, 254, 1556, 142508, 47644, 1884, 104155, 519, 101758, 5351, 80836, 552, 3784, 87039, 18403, 63769, 38937, 107730, 759...	[ 0.06280517578125, 0.0736083984375, 0.1622314453125, 0.0972900390625, 0.10064697265625, 0.276123046875, 0.0899658203125, 0.2120361328125, 0.159423828125, 0.15380859375, 0.008697509765625, 0.0382080078125, 0.193603515625, 0.14599609375, 0.082275390625, 0.2052001953125, 0.1302490234375,...	embed
67478004_c0	67478004	haskell	0	Title: How to write the signum fuction in haskell (Type problem) Problem title: How to write the signum fuction in haskell (Type problem) Tags: haskell, function Problem: How to write the signum fuction in haskell (Type problem) I want to write the signum function in Haskell but i can't figure out how to properly write...	How to write the signum fuction in haskell (Type problem) How to write the signum fuction in haskell (Type problem) haskell function How Type signum1 Num How to write the signum fuction in haskell (Type problem) I want to write the signum function in Haskell but i can't figure out how to properly write the type singatu...	[ -0.010498046875, 0.0103759765625, 0.0093994140625, -0.005126953125, -0.015869140625, 0.006072998046875, 0.003021240234375, 0.0081787109375, -0.0017242431640625, 0.00811767578125, -0.0250244140625, -0.0233154296875, 0.0004711151123046875, 0.007476806640625, 0.01177978515625, 0.004272460...	[ 11249, 47, 33022, 1144, 2606, 5639, 10763, 23, 1556, 142508, 196707, 2967, 70, 32354, 60457, 418, 52782, 3444, 20625, 26366, 155965, 10644, 5367, 11, 6644, 43240, 11907, 171859, 18507, 16750, 5608, 40101, 757, 106, 707, 68940, 360, 18, 1431...	[ 0.06646728515625, 0.0310821533203125, 0.191162109375, 0.1719970703125, 0.24658203125, 0.1837158203125, 0.1490478515625, 0.041778564453125, 0.13671875, 0.212158203125, 0.1888427734375, 0.1688232421875, 0.0208587646484375, 0.177734375, 0.1600341796875, 0.09454345703125, 0.167724609375,...	embed
30156681_c0	30156681	haskell	0	Title: How to implement recursive function? Problem title: How to implement recursive function? Tags: haskell, ghc Problem: How to implement recursive function? Below defines an Algebraic Data Type IntList : data IntList = Empty \| Cons Int IntList The function intListProd computes the product of IntList type : intListP...	How to implement recursive function? How to implement recursive function? haskell ghc How IntList Empty Cons Main How to implement recursive function? Below defines an Algebraic Data Type IntList : The function intListProd computes the product of IntList type : But I'm unsure how to create IntList type. I've tried : Bu...	[ -0.00970458984375, 0.004119873046875, 0.01116943359375, 0.0279541015625, -0.0279541015625, 0.016357421875, -0.002960205078125, -0.0027618408203125, -0.0172119140625, -0.0003147125244140625, 0.0177001953125, -0.013427734375, -0.00726318359375, 0.0203857421875, 0.016845703125, -0.0029602...	[ 11249, 47, 29479, 195625, 5844, 32354, 1556, 142508, 31380, 238, 360, 18, 154663, 31678, 939, 39215, 17336, 61924, 429, 2844, 11809, 60457, 23, 10752, 71, 7077, 12996, 10644, 51646, 3642, 28282, 37842, 23253 ]	[ 0.0621337890625, 0.06146240234375, 0.2059326171875, 0.23486328125, 0.203369140625, 0.20361328125, 0.07769775390625, 0.1842041015625, 0.051300048828125, 0.045928955078125, 0.08782958984375, 0.117919921875, 0.261474609375, 0.158447265625, 0.1068115234375, 0.1519775390625, 0.04644775390...	embed
30924448_c3	30924448	haskell	3	8.0.0, vm001, Downloads, github.com, ghcjs-jquery.git, Cloning, Counting, Total, Receiving, KiB, Resolving, Checking, Cabal-1.22.3.0, cabal-install-1.22.3.0.tar.gz, node-v0.12.4.tar.gz, Cabal-1.22.3.0.tar.gz, ghc-7.10.1, regex-tdfa-text-1.0.0.3, cabal-install-1.22.3.0, ghc-7.10.1-x86_64-unknown-linux-deb7.tar.bz2, node...	8.0.0, vm001, Downloads, github.com, ghcjs-jquery.git, Cloning, Counting, Total, Receiving, KiB, Resolving, Checking, Cabal-1.22.3.0, cabal-install-1.22.3.0.tar.gz, node-v0.12.4.tar.gz, Cabal-1.22.3.0.tar.gz, ghc-7.10.1, regex-tdfa-text-1.0.0.3, cabal-install-1.22.3.0, ghc-7.10.1-x86_64-unknown-linux-deb7.tar.bz2, node...	[ -0.0078125, 0.010498046875, 0.01806640625, 0.010009765625, 0.027099609375, 0.00074005126953125, -0.024658203125, 0.0172119140625, 0.0002880096435546875, 0.031494140625, -0.023193359375, -0.044189453125, -0.000476837158203125, 0.011962890625, -0.0203857421875, 0.0184326171875, 0.00860...	[ 3217, 99929, 4, 81, 39, 34479, 4857, 62270, 32102, 277, 31380, 238, 28175, 9, 170, 944, 1294, 15769, 51053, 592, 1311, 128396, 33867, 93908, 6496, 1519, 571, 132944, 38679, 30438, 289, 5759, 5, 4015, 132265, 109524, 80383, 867, 110, 112, ...	[ 0.2044677734375, 0.228515625, 0.044586181640625, 0.153564453125, 0.11376953125, 0.23486328125, 0.1728515625, 0.1180419921875, 0.161865234375, 0.06097412109375, 0.12939453125, 0.1348876953125, 0.255615234375, 0.0226593017578125, 0.116943359375, 0.1824951171875, 0.175048828125, 0.202...	embed
32303377_c0	32303377	haskell	0	Title: What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? Problem title: What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? Tags: haskell-stack, haskell Problem: What's the difference between `stack i...	What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? haskell-stack haskell What NAME project.cabal package_name What's the difference between `stack in...	[ 0.0093994140625, -0.00003886222839355469, 0.004425048828125, 0.0302734375, -0.0172119140625, 0.01495361328125, -0.0128173828125, 0.005096435546875, 0.0142822265625, 0.024658203125, 0.03466796875, -0.0264892578125, 0.005279541015625, 0.020751953125, -0.006561279296875, 0.0091552734375, ...	[ 3768, 60212, 17721, 590, 2594, 20600, 182512, 136, 45367, 105254, 7, 13452, 408, 3571, 11435, 1556, 142508, 98169, 11627, 70, 154107, 1379, 40059, 119475, 177261, 28032, 14364 ]	[ 0.017608642578125, 0.1761474609375, 0.09246826171875, 0.12451171875, 0.16357421875, 0.1744384765625, 0.20654296875, 0.07440185546875, 0.1016845703125, 0.1702880859375, 0.03558349609375, 0.158447265625, 0.1007080078125, 0.1903076171875, 0.10595703125, 0.0762939453125, 0.1866455078125,...	embed
57523360_c2	57523360	haskell	2	. a008284_tabl :: [[Int]] a008284_tabl = [1] : f [[1]] where f xss = ys : f (ys : xss) where ys = map sum (zipWith take [1..] xss) ++ [1] _P :: Int -> Int -> Int _P m n = sum (concatMap (take (min m n)) (take m a008284_tabl)) dico' :: Int -> Int -> Seq (Maybe Int) dico' m n = go 1 S.empty where pmn = Just $ Just $ _P m...	. a008284_tabl :: [[Int]] a008284_tabl = [1] : f [[1]] where f xss = ys : f (ys : xss) where ys = map sum (zipWith take [1..] xss) ++ [1] _P :: Int -> Int -> Int _P m n = sum (concatMap (take (min m n)) (take m a008284_tabl)) dico' :: Int -> Int -> Seq (Maybe Int) dico' m n = go 1 S.empty where pmn = Just $ Just $ _P m...	[ -0.003631591796875, 0.0274658203125, -0.001129150390625, 0.00787353515625, -0.028076171875, -0.003265380859375, 0.02001953125, 0.0196533203125, 0.0240478515625, -0.00133514404296875, -0.0014801025390625, 0.0242919921875, -0.01409912109375, 0.02783203125, 0.004791259765625, 0.009765625,...	[ 6, 5, 10, 155720, 3882, 617, 454, 102, 9030, 1984, 110558, 4153, 18, 86245, 2203, 17550, 152, 1238, 25256, 7440, 1022, 7, 113, 4778, 22288, 10554, 50836, 194583, 5646, 68252, 37223, 683, 360, 347, 653, 2271, 4460, 166179, 78219, 1249, 8...	[ 0.0096435546875, 0.078369140625, 0.18115234375, 0.235595703125, 0.2423095703125, 0.236328125, 0.05059814453125, 0.2135009765625, 0.25048828125, 0.115966796875, 0.00830078125, 0.1279296875, 0.1590576171875, 0.0238800048828125, 0.11865234375, 0.08709716796875, 0.03448486328125, 0.171...	embed
59190195_c0	59190195	haskell	0	Title: How to create a list of list of numbers in Haskell Problem title: How to create a list of list of numbers in Haskell Tags: haskell Problem: How to create a list of list of numbers in Haskell I need to create a function that makes a board of size row and column and then populate that with zeros. mkBoard 2 3 would...	How to create a list of list of numbers in Haskell How to create a list of list of numbers in Haskell haskell How Haskell How to create a list of list of numbers in Haskell I need to create a function that makes a board of size row and column and then populate that with zeros. mkBoard 2 3 would make [[0,0,0],[0,0,0]] I...	[ 0.0159912109375, -0.00127410888671875, 0.0014190673828125, -0.00151824951171875, 0.006195068359375, -0.00592041015625, 0.002105712890625, 0.0015869140625, 0.004486083984375, -0.01025390625, -0.01287841796875, -0.035400390625, 0.026123046875, 0.00433349609375, -0.02490234375, -0.0005836...	[ 11249, 28282, 5303, 111, 101935, 23, 20625, 142508, 47, 10, 1556, 87, 3871, 32354, 30482, 45443, 13267, 15555, 136, 3365, 316, 27623, 678, 45234, 19201, 12647, 5861, 116, 138, 2806, 3249, 2389, 63527, 3714, 4034, 3525, 56037, 47644, 1884, ...	[ 0.053619384765625, 0.1798095703125, 0.2103271484375, 0.10089111328125, 0.21435546875, 0.06170654296875, 0.1585693359375, 0.2384033203125, 0.0191192626953125, 0.01177978515625, 0.150146484375, 0.024139404296875, 0.062255859375, 0.15966796875, 0.0625, 0.19482421875, 0.1141357421875, ...	embed
38703424_c0	38703424	haskell	0	Title: How does getLine work in haskell? Problem title: How does getLine work in haskell? Tags: io, functional-programming, haskell, getline Problem: How does getLine work in haskell? Looking at the definition of getLine in the Haskell Prelude , I get how the recursion works, where you keep asking for a character until...	How does getLine work in haskell? How does getLine work in haskell? io functional-programming haskell getline How c:....:return How does getLine work in haskell? Looking at the definition of getLine in the Haskell Prelude , I get how the recursion works, where you keep asking for a character until you hit a newline and...	[ -0.00060272216796875, 0.00148773193359375, 0.0118408203125, 0.01611328125, 0.00897216796875, 0.0162353515625, 0.019287109375, -0.00958251953125, 0.006378173828125, -0.00927734375, 0.017578125, -0.040771484375, 0.009033203125, 0.0164794921875, -0.000293731689453125, 0.0032501220703125, ...	[ 11249, 14602, 2046, 93232, 4488, 23, 1556, 142508, 22995, 123309, 28966, 2256, 501, 12, 5, 27, 65395, 19, 80934, 20625, 1914, 822, 112, 3642, 195625, 1830, 43240, 13695, 113292, 62816, 24189, 5962, 3525, 45367, 5303, 30646, 137565, 17780, 6...	[ 0.082763671875, 0.03515625, 0.1700439453125, 0.270263671875, 0.134765625, 0.062744140625, 0.1435546875, 0.217529296875, 0.126708984375, 0.1014404296875, 0.043701171875, 0.2186279296875, 0.03106689453125, 0.0843505859375, 0.015594482421875, 0.0802001953125, 0.218505859375, 0.0417785...	embed
74858044_c0	74858044	haskell	0	Title: Attempting to run Haskell File on GHC error Problem title: Attempting to run Haskell File on GHC error Tags: haskell Problem: Attempting to run Haskell File on GHC error When attempting to load Haskell file test.hs into terminal. I get this response: <interactive>:5:1: error: Variable not in scope: test :: b0 ->...	Attempting to run Haskell File on GHC error Attempting to run Haskell File on GHC error haskell Attempting Haskell File GHC Variable Attempting to run Haskell File on GHC error When attempting to load Haskell file test.hs into terminal. I get this response: This is the code from test.hs: How do I get the file to load i...	[ 0.00186920166015625, -0.000629425048828125, 0.0096435546875, 0.006439208984375, 0.015625, 0.0133056640625, -0.0072021484375, 0.00653076171875, -0.01171875, 0.006011962890625, -0.01007080078125, -0.0299072265625, -0.012939453125, -0.004913330078125, 0.01507568359375, 0.007537841796875, ...	[ 1913, 34224, 1916, 11675, 20625, 142508, 42724, 98, 527, 73265, 18499, 47, 1556, 84572, 81887, 214, 72367, 11435, 3034, 5, 127, 7, 3934, 33949, 57553, 3293, 83, 70, 18151, 1295, 11249, 2046, 23, 9803, 508, 17378, 6713, 209806, 3871, 24927...	[ 0.0225372314453125, 0.12939453125, 0.03167724609375, 0.10357666015625, 0.1527099609375, 0.24853515625, 0.134521484375, 0.091796875, 0.06500244140625, 0.1719970703125, 0.1412353515625, 0.06103515625, 0.1256103515625, 0.1287841796875, 0.1177978515625, 0.010467529296875, 0.161376953125,...	embed
75611110_c0	75611110	haskell	0	Title: Explanation on this haskell code which takes a list of uncurried elements and curries them Problem title: Explanation on this haskell code which takes a list of uncurried elements and curries them Tags: currying, haskell Problem: Explanation on this haskell code which takes a list of uncurried elements and curri...	Explanation on this haskell code which takes a list of uncurried elements and curries them Explanation on this haskell code which takes a list of uncurried elements and curries them currying haskell Explanation Explanation on this haskell code which takes a list of uncurried elements and curries them I am trying to ana...	[ -0.002532958984375, -0.00628662109375, 0.01202392578125, -0.00518798828125, -0.000949859619140625, 0.006927490234375, -0.0017852783203125, -0.0186767578125, 0.0042724609375, -0.017578125, 0.00026702880859375, -0.031494140625, 0.00897216796875, 0.0031585693359375, -0.0203857421875, -0.0...	[ 5443, 5868, 2320, 98, 903, 1556, 142508, 18151, 3129, 51776, 5303, 51, 16820, 46572, 80854, 9709, 10484, 136, 198555, 214, 2856, 7968, 16031, 149201, 77947, 154663, 33079, 104, 441, 474, 2203, 3650, 64240, 53, 425, 113, 152 ]	[ 0.041015625, 0.1412353515625, 0.0528564453125, 0.009857177734375, 0.0936279296875, 0.121826171875, 0.19287109375, 0.1507568359375, 0.010162353515625, 0.07470703125, 0.1341552734375, 0.129638671875, 0.1142578125, 0.2059326171875, 0.17431640625, 0.1533203125, 0.156005859375, 0.018249...	embed
32814305_c0	32814305	haskell	0	Title: Group a list of tuples by their 1st element Problem title: Group a list of tuples by their 1st element Tags: tuples, list, grouping, haskell Problem: Group a list of tuples by their 1st element Say I have a tuple list that consists of [("ab", 1), ("ab", 2), ("ac", 3)] Using the group function would split this li...	Group a list of tuples by their 1st element Group a list of tuples by their 1st element tuples list grouping haskell Group Group a list of tuples by their 1st element Say I have a tuple list that consists of [("ab", 1), ("ab", 2), ("ac", 3)] Using the group function would split this list into a list of lists of tuples ...	[ 0.021484375, 0.00089263916015625, -0.00982666015625, 0.0011444091796875, -0.01373291015625, -0.00311279296875, -0.0135498046875, -0.005035400390625, 0.02734375, -0.01007080078125, -0.0155029296875, 0.0108642578125, -0.00653076171875, 0.016357421875, -0.01507568359375, 0.014892578125, ...	[ 10760, 5303, 370, 99726, 390, 2363, 106, 271, 12830, 111, 21115, 1556, 142508, 765, 8705, 58055, 2055, 4879, 4958, 2263, 8439, 345, 32354, 2806, 65450, 3934, 11249, 47438, 214, 1632, 136044, 37769, 35509, 80854, 75358, 44841 ]	[ 0.274169921875, 0.1884765625, 0.1529541015625, 0.254150390625, 0.1248779296875, 0.044097900390625, 0.0723876953125, 0.0968017578125, 0.186279296875, 0.0513916015625, 0.24462890625, 0.1151123046875, 0.23046875, 0.002960205078125, 0.2132568359375, 0.0684814453125, 0.1280517578125, 0....	embed
13057028_c0	13057028	haskell	0	Title: How can this function be written using foldr? Problem title: How can this function be written using foldr? Tags: fold, higher-order-functions, haskell, functional-programming, recursion Problem: How can this function be written using foldr? I have this simple function which returns a list of pairs with the adjac...	How can this function be written using foldr? How can this function be written using foldr? fold higher-order-functions haskell functional-programming recursion foldr How x:y:xs y:xs x:xs How can this function be written using foldr? I have this simple function which returns a list of pairs with the adjacents elements ...	[ -0.0184326171875, 0.0015411376953125, -0.0181884765625, 0.01007080078125, -0.01531982421875, 0.02587890625, -0.015625, 0.00537109375, 0.002166748046875, -0.0478515625, 0.0009918212890625, -0.017333984375, -0.015869140625, -0.0029449462890625, 0.006439208984375, 0.00555419921875, -0.0...	[ 11249, 831, 903, 32354, 186, 59121, 17368, 18344, 7569, 42822, 77546, 80596, 137175, 1556, 142508, 123309, 28966, 195625, 1022, 12, 53, 425, 7, 113, 8781, 30646, 5303, 80836, 678, 123594, 16797, 80854, 44402, 31577, 33022, 5122, 16940 ]	[ 0.1123046875, 0.084228515625, 0.1007080078125, 0.1959228515625, 0.05389404296875, 0.16845703125, 0.132080078125, 0.151611328125, 0.24169921875, 0.22314453125, 0.039886474609375, 0.123779296875, 0.1253662109375, 0.07257080078125, 0.182861328125, 0.0916748046875, 0.046173095703125, 0...	embed
37102919_c0	37102919	haskell	0	Title: error in patternmatching in Haskell Problem title: error in patternmatching in Haskell Tags: pattern-matching, haskell, parse-error Problem: error in patternmatching in Haskell I am writing a function that maps lists of lists of bools invectively into lists of bools. This is my code: y=[False\| y<-[0..]] encode :...	error in patternmatching in Haskell error in patternmatching in Haskell pattern-matching haskell parse-error Haskell Bool x:xs zip1 True:True error in patternmatching in Haskell I am writing a function that maps lists of lists of bools invectively into lists of bools. This is my code: The zip1 function just takes two l...	[ 0.000766754150390625, 0.0169677734375, -0.0078125, 0.01953125, -0.007415771484375, 0.01300048828125, -0.0238037109375, 0.01318359375, -0.0035247802734375, -0.00022983551025390625, 0.01165771484375, -0.009765625, 0.0078125, -0.00714111328125, 0.0164794921875, 0.013916015625, 0.0078125...	[ 18499, 23, 103510, 98753, 214, 20625, 142508, 1556, 366, 184, 188800, 2460, 929, 1022, 425, 7, 68330, 418, 87599, 882, 32562, 32354, 22288, 5303, 111, 142484, 334, 100034, 3934, 18151, 1660, 51776, 6626, 33022, 75939, 3525, 20949, 26008, 44...	[ 0.1964111328125, 0.1016845703125, 0.2281494140625, 0.2763671875, 0.1104736328125, 0.1453857421875, 0.2247314453125, 0.142578125, 0.080078125, 0.08819580078125, 0.1612548828125, 0.0589599609375, 0.1290283203125, 0.068603515625, 0.090087890625, 0.03192138671875, 0.212646484375, 0.126...	embed
3710991_c0	3710991	haskell	0	Title: Convert a "do" notation with more than two actions to use the bind function Problem title: Convert a "do" notation with more than two actions to use the bind function Tags: monads, haskell, ghc Problem: Convert a "do" notation with more than two actions to use the bind function I know that th...	Convert a "do" notation with more than two actions to use the bind function Convert a "do" notation with more than two actions to use the bind function monads haskell ghc Convert line1 line2 Convert a "do" notation with more than two actions to use the bind function I know that the following "do" no...	[ -0.0230712890625, 0.00518798828125, -0.00762939453125, 0.021728515625, -0.006195068359375, 0.03466796875, -0.00872802734375, 0.00408935546875, 0.027587890625, -0.0184326171875, -0.01348876953125, -0.0184326171875, -0.0159912109375, 0.01373291015625, -0.006622314453125, 0.01806640625, ...	[ 1657, 11549, 246, 41502, 110, 22062, 678, 1286, 3501, 6626, 61972, 4527, 68557, 32354, 2667, 712, 1556, 142508, 31380, 238, 13315, 418, 304, 25632, 89817, 183234, 2046, 93232, 6396, 41872, 2256, 3884, 71713, 866, 19, 3642 ]	[ 0.0191192626953125, 0.1556396484375, 0.193115234375, 0.035888671875, 0.1607666015625, 0.1331787109375, 0.0260467529296875, 0.0692138671875, 0.050079345703125, 0.1029052734375, 0.1641845703125, 0.060638427734375, 0.2445068359375, 0.16796875, 0.03314208984375, 0.0543212890625, 0.065917...	embed
53517200_c0	53517200	haskell	0	Title: Confused by converting WHNF to NF in Haskell Problem title: Confused by converting WHNF to NF in Haskell Tags: haskell, weak-head-normal-form Problem: Confused by converting WHNF to NF in Haskell In a simple example, converting WHNF to NF by printing works fine Prelude> let x = 1 + 2 :: Int Prelude> :sprint x x ...	Confused by converting WHNF to NF in Haskell Confused by converting WHNF to NF in Haskell haskell weak-head-normal-form Confused WHNF Haskell Prelude Confused by converting WHNF to NF in Haskell In a simple example, converting WHNF to NF by printing works fine But in a case, the type is not declared it doesn't work. Ca...	[ 0.0034942626953125, 0.004547119140625, -0.00714111328125, 0.00604248046875, -0.021240234375, 0.01171875, -0.0084228515625, 0.000698089599609375, -0.0052490234375, 0.01385498046875, -0.00994873046875, -0.01519775390625, -0.006500244140625, 0.024169921875, -0.00897216796875, -0.015258789...	[ 106161, 33740, 96760, 601, 841, 73493, 47, 20625, 142508, 1556, 642, 344, 31251, 33176, 5037, 822, 8781, 27781, 2448, 1916, 43240, 5885, 10644, 959, 159978, 22027, 18, 4488, 73342, 142477, 4568 ]	[ 0.10504150390625, 0.031494140625, 0.1165771484375, 0.0714111328125, 0.1187744140625, 0.2509765625, 0.060333251953125, 0.0992431640625, 0.2110595703125, 0.0792236328125, 0.10235595703125, 0.1015625, 0.147216796875, 0.1114501953125, 0.1329345703125, 0.036102294921875, 0.00604248046875,...	embed
74385460_c1	74385460	haskell	1	) . out -- Anamorphism type Coalgebra f a = a -> f a ana :: (Functor f) => Coalgebra f a -> a -> Fix f ana f = In . fmap (ana f) . f The approach mentioned in this post ( https://stackoverflow.com/a/56012344 ) for writing recursion schemes that go from Int -> Int, is to write a hylomorphism where the anamorphism sort o...	) . out -- Anamorphism type Coalgebra f a = a -> f a ana :: (Functor f) => Coalgebra f a -> a -> Fix f ana f = In . fmap (ana f) . f The approach mentioned in this post ( https://stackoverflow.com/a/56012344 ) for writing recursion schemes that go from Int -> Int, is to write a hylomorphism where the anamorphism sort o...	[ -0.0123291015625, -0.010009765625, -0.000039577484130859375, 0.0262451171875, 0.01373291015625, -0.005584716796875, -0.0003757476806640625, -0.01953125, 0.01361083984375, -0.03125, -0.01141357421875, -0.033447265625, 0.00726318359375, 0.033203125, 0.01611328125, -0.04150390625, -0.00...	[ 5, 1810, 5710, 178851, 8780, 10644, 1311, 289, 429, 2844, 1238, 10, 2203, 33079, 3877, 97249, 18770, 96746, 360, 62346, 1500, 51515, 119056, 1305, 118664, 32562, 195625, 1830, 150370, 738, 1295, 18, 33022, 2119, 365, 45367, 11782, 177261, 6...	[ 0.021484375, 0.1712646484375, 0.1531982421875, 0.2464599609375, 0.1337890625, 0.1441650390625, 0.0921630859375, 0.0980224609375, 0.122314453125, 0.103759765625, 0.1312255859375, 0.1170654296875, 0.042022705078125, 0.1585693359375, 0.21923828125, 0.1142578125, 0.1492919921875, 0.202...	embed
42047831_c0	42047831	haskell	0	Title: Getting the cabal version of a GHC compiled program? Problem title: Getting the cabal version of a GHC compiled program? Tags: haskell, cabal Problem: Getting the cabal version of a GHC compiled program? If I compile an executable using GHC's cabal build , is there a way to get the version number as stated in th...	Getting the cabal version of a GHC compiled program? Getting the cabal version of a GHC compiled program? haskell cabal System.Environment Getting GHC Getting the cabal version of a GHC compiled program? If I compile an executable using GHC's cabal build , is there a way to get the version number as stated in the proje...	[ 0.00787353515625, 0.004913330078125, 0.004058837890625, 0.0167236328125, 0, 0.0032958984375, -0.0198974609375, 0.033447265625, -0.01214599609375, -0.0247802734375, -0.0157470703125, -0.02880859375, -0.0106201171875, -0.0089111328125, -0.0002841949462890625, 0.019287109375, -0.0097656...	[ 210732, 109524, 11389, 527, 73265, 375, 5974, 1528, 70, 1556, 142508, 12353, 686, 1900, 9969, 1340, 71924, 2886, 45367, 3917, 2046, 14012, 11341, 13452, 5, 408, 3571, 11435, 1295, 46132, 5201, 32354, 9351, 21373, 10752, 15896, 5983 ]	[ 0.1075439453125, 0.2373046875, 0.2271728515625, 0.07537841796875, 0.1849365234375, 0.0173492431640625, 0.09051513671875, 0.1527099609375, 0.00726318359375, 0.08551025390625, 0.1875, 0.0966796875, 0.020782470703125, 0.03839111328125, 0.0911865234375, 0.05010986328125, 0.1051025390625,...	embed
47374082_c2	47374082	haskell	2	Process/Read.hs:306:3) 2017-11-19 12:25:05.796327: [debug] Run process: /usr/bin/gcc -v @(System/Process/Read.hs:306:3) 2017-11-19 12:25:05.799566: [debug] Process finished in [92m3ms[0m: /usr/bin/gcc -v @(System/Process/Read.hs:306:3) 2017-11-19 12:25:05.799710: [debug] PIE enabled @(Stack/Setup.hs:583:17) 2017-11-19 ...	Process/Read.hs:306:3) 2017-11-19 12:25:05.796327: [debug] Run process: /usr/bin/gcc -v @(System/Process/Read.hs:306:3) 2017-11-19 12:25:05.799566: [debug] Process finished in [92m3ms[0m: /usr/bin/gcc -v @(System/Process/Read.hs:306:3) 2017-11-19 12:25:05.799710: [debug] PIE enabled @(Stack/Setup.hs:583:17) 2017-11-19 ...	[ -0.011474609375, -0.01385498046875, 0.004669189453125, 0.006927490234375, -0.004058837890625, 0.0012054443359375, -0.0272216796875, -0.005828857421875, -0.0179443359375, 0.004058837890625, -0.00750732421875, -0.00445556640625, -0.00439453125, 0.002410888671875, 0.0130615234375, 0.01293...	[ 123996, 31345, 127, 7, 1197, 910, 21320, 505, 36099, 2947, 427, 21224, 22377, 15748, 3768, 112, 85779, 28398, 9433, 223, 42, 7568, 177, 10060, 20, 334, 1374, 84293, 10752, 26531, 5, 163712, 186225, 122799, 23, 12231, 39, 363, 4432, 963, ...	[ 0.2001953125, 0.2362060546875, 0.119140625, 0.1151123046875, 0.06280517578125, 0.1259765625, 0.1270751953125, 0.110595703125, 0.0863037109375, 0.04730224609375, 0.007293701171875, 0.063720703125, 0.039337158203125, 0.03948974609375, 0.0980224609375, 0.02752685546875, 0.1640625, 0.1...	embed
60159403_c0	60159403	haskell	0	Title: Create List by multiplying object with [1..n] Problem title: Create List by multiplying object with [1..n] Tags: list, haskell Problem: Create List by multiplying object with [1..n] I am still not into Haskell and need a hint for the following function. I want to create a list by adding each multiplication of a ...	Create List by multiplying object with [1..n] Create List by multiplying object with [1..n] list haskell Create List Create List by multiplying object with [1..n] I am still not into Haskell and need a hint for the following function. I want to create a list by adding each multiplication of a pair: E.g. n = 3, pair (1,...	[ 0.0118408203125, 0.00848388671875, -0.005645751953125, 0.014404296875, 0.004425048828125, 0.01318359375, -0.0264892578125, 0.006927490234375, 0.022216796875, -0.018310546875, 0.0205078125, -0.031494140625, 0.01470947265625, 0.007659912109375, -0.028564453125, -0.003570556640625, 0.01...	[ 151313, 32036, 390, 6024, 62479, 36746, 678, 68252, 5, 19, 5303, 1556, 142508, 7464, 959, 3934, 20625, 3871, 5122, 18, 25632, 32354, 3444, 28282, 10, 154107, 12638, 127664, 1363, 111, 80836, 653, 2203, 138, 10461, 44357, 133063, 29557, 6896...	[ 0.1888427734375, 0.299072265625, 0.061767578125, 0.1611328125, 0.189697265625, 0.222412109375, 0.06915283203125, 0.1256103515625, 0.0523681640625, 0.12109375, 0.26318359375, 0.17138671875, 0.2425537109375, 0.007232666015625, 0.0214691162109375, 0.060302734375, 0.146240234375, 0.057...	embed
62475453_c0	62475453	haskell	0	Title: Applicative functors and records in purescript Problem title: Applicative functors and records in purescript Tags: purescript, haskell Problem: Applicative functors and records in purescript In Haskell, I'm used to doing stuff like this. data Foo = Foo { foo :: String, bar :: String } mFoo :: (Monad m) => m Stri...	Applicative functors and records in purescript Applicative functors and records in purescript purescript haskell Applicative Foo Monad Applicative functors and records in purescript In Haskell, I'm used to doing stuff like this. The same does not work in purescript, however. Is there a way to achieve the same outcome, ...	[ -0.01318359375, 0.007415771484375, -0.0068359375, 0.0299072265625, 0.007720947265625, 0.00927734375, 0.00860595703125, -0.0062255859375, -0.00078582763671875, -0.0269775390625, 0.01953125, -0.00579833984375, -0.004852294921875, 0.0196533203125, -0.00848388671875, -0.024169921875, 0.0...	[ 5659, 11048, 4935, 7477, 18770, 136, 115923, 34166, 32032, 1556, 142508, 9572, 31, 60331, 71, 20625, 11814, 959, 4488, 3917, 69307, 5701, 184345, 13695, 17164, 6002, 86531, 190358, 2878, 38415, 1829, 41816, 33976, 110527 ]	[ 0.1280517578125, 0.1785888671875, 0.1650390625, 0.164794921875, 0.1787109375, 0.0693359375, 0.2255859375, 0.1937255859375, 0.265625, 0.12548828125, 0.2205810546875, 0.1563720703125, 0.088623046875, 0.1517333984375, 0.08740234375, 0.1112060546875, 0.08099365234375, 0.020965576171875...	embed
34673374_c0	34673374	haskell	0	Title: Haskell saferead of file Problem title: Haskell saferead of file Tags: io, haskell Problem: Haskell saferead of file I am attempting to write a simple Haskell function that reads a files contents, if the file exists, and does nothing otherwise. safeRead :: String -> IO () safeRead path = readFile path `catch` ha...	Haskell saferead of file Haskell saferead of file io haskell isDoesNotExistError Haskell Haskell saferead of file I am attempting to write a simple Haskell function that reads a files contents, if the file exists, and does nothing otherwise. This, however, fails with: parse error (possibly incorrect indentation or mism...	[ -0.0024261474609375, 0.01544189453125, 0.01190185546875, -0.00860595703125, -0.00157928466796875, 0.00150299072265625, -0.00013256072998046875, -0.006011962890625, 0.00028228759765625, -0.0157470703125, 0.014892578125, -0.01470947265625, -0.017822265625, -0.021240234375, 0.036376953125, ...	[ 20625, 142508, 46002, 39116, 111, 11435, 22995, 1556, 83, 90, 122116, 19279, 1419, 18468, 81887, 33022, 8781, 32354, 12301, 102158, 10941, 2174, 70, 32316, 14602, 33720, 120262, 35782, 366, 184, 18499, 7522, 214552, 18597, 22062, 1239, 98753, ...	[ 0.1348876953125, 0.19921875, 0.184814453125, 0.2237548828125, 0.125732421875, 0.1571044921875, 0.158935546875, 0.1446533203125, 0.0869140625, 0.011932373046875, 0.095458984375, 0.1370849609375, 0.1383056640625, 0.0732421875, 0.04583740234375, 0.0318603515625, 0.05902099609375, 0.12...	embed
27398266_c0	27398266	haskell	0	Title: Taking a value from the Gen monad to the IO monad Problem title: Taking a value from the Gen monad to the IO monad Tags: quickcheck, monads, haskell Problem: Taking a value from the Gen monad to the IO monad I'm generating a minesweeper board and want to generate the board based on where the first click (actuall...	Taking a value from the Gen monad to the IO monad Taking a value from the Gen monad to the IO monad quickcheck monads haskell the Taking Gen Taking a value from the Gen monad to the IO monad I'm generating a minesweeper board and want to generate the board based on where the first click (actually not a click, just a st...	[ -0.018798828125, -0.0150146484375, -0.00897216796875, -0.0019378662109375, -0.0101318359375, 0.00909423828125, 0.004547119140625, -0.011962890625, 0.0045166015625, -0.038818359375, 0.0081787109375, 0.006378173828125, 0.01531982421875, -0.0031280517578125, 0.01025390625, -0.01171875, ...	[ 2561, 214, 34292, 1295, 15937, 2667, 712, 47, 17780, 10, 63773, 78292, 1556, 142508, 12663, 5665, 7, 1177, 13, 1264, 45443, 3444, 139392, 35509, 7440, 5117, 18158, 112302, 79315, 59121, 1827, 71, 33636, 16940, 2967, 21208, 765, 17664, 136, ...	[ 0.170654296875, 0.105224609375, 0.1971435546875, 0.087646484375, 0.249267578125, 0.1385498046875, 0.1722412109375, 0.1513671875, 0.25830078125, 0.1949462890625, 0.1175537109375, 0.2353515625, 0.09521484375, 0.2200927734375, 0.1116943359375, 0.1673583984375, 0.05865478515625, 0.1453...	embed
74888599_c1	74888599	haskell	1	Test.Tasty.Patterns.Parser Error S-8506 Directory Glorious Glasgow Haskell Compilation System How do I install and run Test.Tasty.Patterns I want to use the following for testing the ReadP Monad Parser. https://hackage.haskell.org/package/tasty-1.4.3/docs/Test-Tasty-Patterns-Parser.html . How can I install it correctl...	Test.Tasty.Patterns.Parser Error S-8506 Directory Glorious Glasgow Haskell Compilation System How do I install and run Test.Tasty.Patterns I want to use the following for testing the ReadP Monad Parser. https://hackage.haskell.org/package/tasty-1.4.3/docs/Test-Tasty-Patterns-Parser.html . How can I install it correctl...	[ -0.01043701171875, 0.019775390625, 0.013916015625, 0.00958251953125, -0.021484375, 0.01165771484375, -0.01123046875, -0.0186767578125, 0.005950927734375, -0.014404296875, 0.005462646484375, -0.012451171875, 0.01165771484375, -0.0177001953125, 0.021484375, 0.0167236328125, -0.00665283...	[ 8647, 9874, 8946, 8335, 3055, 1779, 28636, 2189, 212059, 159, 109189, 910, 31068, 46173, 93905, 181787, 20625, 142508, 15612, 12353, 20600, 136, 11675, 5, 3444, 4527, 25632, 134234, 4764, 683, 60331, 71, 2392, 139509, 10557, 29102, 102, 91977...	[ 0.1690673828125, 0.19873046875, 0.236572265625, 0.1363525390625, 0.1414794921875, 0.10302734375, 0.1199951171875, 0.1474609375, 0.0860595703125, 0.026519775390625, 0.08038330078125, 0.0799560546875, 0.0219573974609375, 0.0283660888671875, 0.0806884765625, 0.1275634765625, 0.090454101...	embed
42471712_c0	42471712	haskell	0	Title: CreateGHCiProcess failed with failed with error 0: The operation completed successfully Problem title: CreateGHCiProcess failed with failed with error 0: The operation completed successfully Tags: haskell Problem: CreateGHCiProcess failed with failed with error 0: The operation completed successfully When I open...	CreateGHCiProcess failed with failed with error 0: The operation completed successfully CreateGHCiProcess failed with failed with error 0: The operation completed successfully haskell CreateGHCiProcess CreateGHCiProcess failed with failed with error 0: The operation completed successfully When I open WinGHCi the follow...	[ 0.00139617919921875, -0.0091552734375, -0.01385498046875, 0.010986328125, -0.0113525390625, 0.0021209716796875, 0.00799560546875, -0.018798828125, -0.0087890625, -0.00323486328125, -0.0017242431640625, -0.0255126953125, 0.006317138671875, 0.0034027099609375, 0.004302978515625, 0.012878...	[ 151313, 41877, 40658, 10752, 26531, 165523, 678, 18499, 757, 581, 41018, 140528, 65771, 1556, 142508, 87, 9803, 17686, 26008, 7426, 12, 3714, 30022, 903, 5117, 1733, 31577, 20625, 80383, 1528 ]	[ 0.2061767578125, 0.1903076171875, 0.2322998046875, 0.1331787109375, 0.15771484375, 0.2164306640625, 0.1160888671875, 0.1453857421875, 0.1767578125, 0.0784912109375, 0.204345703125, 0.219482421875, 0.1925048828125, 0.099609375, 0.225830078125, 0.009429931640625, 0.099609375, 0.10937...	embed
61342881_c0	61342881	haskell	0	Title: Haskell Define Data Type Problem title: Haskell Define Data Type Tags: haskell Problem: Haskell Define Data Type I trying to create a type class Place which has String Coord [Int] , and a testData to store all the element into a list data Place = Place String Coord [Int] deriving (Ord,Eq,Show,Read) data Coord = ...	Haskell Define Data Type Haskell Define Data Type haskell Haskell Define Data Type Place Coord Ord Show Read Cord Double London Cardiff Norwich Birmingham Liverpool Hull Newcastle Belfast Glasgow Plymouth Aberdeen Stornoway Lerwick Helier UP917725.hs:20:15 Couldn Integer Char Haskell Define Data Type I trying to create...	[ 0.001495361328125, 0.013427734375, -0.00628662109375, 0.00933837890625, 0.00726318359375, -0.0169677734375, 0.0277099609375, -0.004425048828125, -0.000431060791015625, 0.01531982421875, -0.00830078125, -0.043212890625, -0.000885009765625, -0.0218505859375, -0.0274658203125, 0.001121520...	[ 20625, 142508, 262, 64552, 11809, 60457, 1556, 41076, 1311, 6651, 35379, 17367, 4764, 134736, 107172, 9020, 3980, 152462, 12876, 69696, 188377, 39721, 46840, 188831, 12628, 39473, 181787, 538, 111443, 8592, 112, 33, 23604, 157, 7514, 44726, 932...	[ 0.1649169921875, 0.288818359375, 0.1314697265625, 0.2138671875, 0.18603515625, 0.27734375, 0.15283203125, 0.205810546875, 0.0848388671875, 0.18359375, 0.146240234375, 0.1544189453125, 0.1622314453125, 0.17138671875, 0.109619140625, 0.1622314453125, 0.0552978515625, 0.19140625, 0....	embed
12393088_c1	12393088	haskell	1	cat * \| wc , but my instinct tells me that the file I/O should outweigh the CPU time needed by a good margin. Simply using cat * \| wc processes about 20MB/s with a hot cache, but using my Haskell program (compiled with -O ) runs at less than 10MB/s, even after some basic optimization. Profiling tells me that most of t...	cat * \| wc , but my instinct tells me that the file I/O should outweigh the CPU time needed by a good margin. Simply using cat * \| wc processes about 20MB/s with a hot cache, but using my Haskell program (compiled with -O ) runs at less than 10MB/s, even after some basic optimization. Profiling tells me that most of t...	[ 0.0147705078125, -0.0291748046875, -0.0128173828125, -0.017822265625, -0.0185546875, -0.013427734375, 0.00592041015625, -0.033203125, 0.0128173828125, -0.0245361328125, 0.003387451171875, -0.0069580078125, 0.00799560546875, 0.0096435546875, -0.014404296875, -0.00058746337890625, -0.0...	[ 7515, 661, 58745, 92922, 1284, 218024, 14192, 11435, 87, 64, 670, 5608, 1810, 1177, 6958, 86039, 1733, 44841, 4127, 92142, 17368, 9433, 90, 387, 12689, 8010, 82365, 20625, 142508, 1528, 5974, 20, 127877, 99, 40715, 209, 62822, 87235, 58848,...	[ 0.2205810546875, 0.153076171875, 0.0867919921875, 0.227783203125, 0.0142364501953125, 0.1953125, 0.0190277099609375, 0.18017578125, 0.004302978515625, 0.1490478515625, 0.1552734375, 0.006683349609375, 0.0196380615234375, 0.02838134765625, 0.07733154296875, 0.170654296875, 0.100219726...	embed
35108630_c0	35108630	haskell	0	Title: How to query with `sqlite-simple` without having to specify a concrete return type? Problem title: How to query with `sqlite-simple` without having to specify a concrete return type? Tags: sqlite-simple, haskell, sqlite Problem: How to query with `sqlite-simple` without having to specify a concrete return type? ...	How to query with `sqlite-simple` without having to specify a concrete return type? How to query with `sqlite-simple` without having to specify a concrete return type? sqlite-simple haskell sqlite How query_ How to query with `sqlite-simple` without having to specify a concrete return type? Anyone knows if http://hacka...	[ 0.01092529296875, 0.005401611328125, 0.004119873046875, 0.0228271484375, -0.01129150390625, -0.0206298828125, -0.01007080078125, -0.0006561279296875, 0.01025390625, -0.0027008056640625, 0.017822265625, -0.06494140625, -0.01025390625, -0.002288818359375, -0.023193359375, 0.0065002441406...	[ 11249, 41, 1294, 678, 95255, 67, 191560, 15490, 40140, 122776, 30646, 10644, 7, 19441, 1556, 142508, 93002, 139509, 4588, 10557, 29102, 121254, 38331, 2389, 37382, 158897, 1486, 8859, 33209, 7693, 831, 11675, 15555, 28412, 143726, 48502, 370, ...	[ 0.023681640625, 0.132568359375, 0.1317138671875, 0.07861328125, 0.1917724609375, 0.1585693359375, 0.228759765625, 0.07745361328125, 0.0836181640625, 0.1688232421875, 0.1759033203125, 0.13916015625, 0.000701904296875, 0.03173828125, 0.0599365234375, 0.15380859375, 0.022369384765625, ...	embed
23232194_c0	23232194	haskell	0	Title: How does Haskell evaluate this function which undoes list intercalation? Problem title: How does Haskell evaluate this function which undoes list intercalation? Tags: equational-reasoning, haskell Problem: How does Haskell evaluate this function which undoes list intercalation? I'm trying to understand how Haske...	How does Haskell evaluate this function which undoes list intercalation? How does Haskell evaluate this function which undoes list intercalation? equational-reasoning haskell How Haskell x1:x2:xs x1:is x2:ps How does Haskell evaluate this function which undoes list intercalation? I'm trying to understand how Haskell ev...	[ -0.00885009765625, 0.0048828125, -0.0054931640625, 0.01336669921875, -0.0169677734375, 0.0240478515625, -0.0009307861328125, 0.01141357421875, 0.0004062652587890625, 0.0201416015625, -0.00946044921875, 0.004302978515625, 0.017333984375, 0.02783203125, -0.01007080078125, -0.014099121093...	[ 11249, 20625, 142508, 151575, 13, 903, 32354, 165, 31, 90, 5303, 1940, 6827, 2320, 13722, 43315, 1681, 1556, 1022, 82825, 425, 304, 7, 164, 12, 6423, 3129, 28219, 3642, 28, 27494, 1636, 25040, 68252, 116, 138, 201, 190, 2046, 418, 7440,...	[ 0.057037353515625, 0.149169921875, 0.2509765625, 0.170654296875, 0.0498046875, 0.0804443359375, 0.177734375, 0.1632080078125, 0.1549072265625, 0.098388671875, 0.1971435546875, 0.1424560546875, 0.18115234375, 0.04119873046875, 0.0914306640625, 0.014862060546875, 0.049530029296875, 0...	embed
21094784_c0	21094784	haskell	0	Title: Point authRoute directly to google auth Problem title: Point authRoute directly to google auth Tags: haskell, yesod Problem: Point authRoute directly to google auth Since I'm only using google auth anyways, I would like to get rid of the login screen seeing as it's quite superfluous to have a page with just a go...	Point authRoute directly to google auth Point authRoute directly to google auth haskell yesod Point Just AuthR LoginR Point authRoute directly to google auth Since I'm only using google auth anyways, I would like to get rid of the login screen seeing as it's quite superfluous to have a page with just a google button on...	[ 0.00933837890625, 0.016845703125, 0.0035858154296875, -0.0247802734375, -0.016845703125, 0.002044677734375, -0.003997802734375, 0.0037841796875, 0.01116943359375, -0.032958984375, 0.0189208984375, -0.039306640625, -0.0181884765625, 0.0230712890625, -0.00860595703125, 0.006256103515625,...	[ 41097, 531, 927, 12724, 6743, 105237, 47, 26484, 1556, 142508, 2422, 23722, 9563, 5655, 1052, 122986, 4734, 17368, 109954, 1884, 2046, 31351, 70, 73655, 49119, 18026, 10, 9191, 77679, 98, 3917, 7722, 5423, 6275, 64457, 111, 3650, 8781, 8190...	[ 0.203857421875, 0.2080078125, 0.181884765625, 0.1837158203125, 0.162841796875, 0.18310546875, 0.14404296875, 0.190185546875, 0.14111328125, 0.2119140625, 0.1412353515625, 0.1865234375, 0.126953125, 0.1871337890625, 0.1624755859375, 0.1705322265625, 0.0273590087890625, 0.04495239257...	embed
70380927_c0	70380927	haskell	0	Title: Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? Problem title: Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? Tags: haskell, windows, visual-studio-code, visual-studio Problem: Why does VSC save my Haskell files as a .hsig and can i change ...	Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? haskell windows visual-studio-code visual-studio Why VSC Haskell Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? We ...	[ 0.006134033203125, 0.01019287109375, 0.00848388671875, 0.009033203125, -0.00482177734375, -0.01300048828125, -0.0301513671875, 0.00836181640625, -0.00537109375, -0.00026702880859375, -0.02099609375, -0.0035247802734375, -0.0012359619140625, 0.0087890625, -0.00122833251953125, -0.001602...	[ 44084, 310, 14495, 30098, 20625, 142508, 102158, 237, 5, 127, 20561, 831, 15549, 8, 45895, 7136, 7, 47, 1556, 54825, 21176, 52629, 40899, 759, 10, 17, 168861, 1528, 40466, 18151, 11435, 41877, 17304, 18, 9969, 1340, 765, 442, 3535, 11907,...	[ 0.0889892578125, 0.169189453125, 0.2210693359375, 0.13427734375, 0.154296875, 0.261962890625, 0.166259765625, 0.04290771484375, 0.0509033203125, 0.12109375, 0.24658203125, 0.0701904296875, 0.1395263671875, 0.1103515625, 0.129638671875, 0.12890625, 0.10174560546875, 0.03448486328125...	embed
9824671_c0	9824671	haskell	0	Title: Haskell class Num not contained in Ord? Problem title: Haskell class Num not contained in Ord? Tags: haskell Problem: Haskell class Num not contained in Ord? I was reading LYAH and read that the Num class isn't a subset of Ord. This means that there is a Num type which is not a member of Ord, what could constitu...	Haskell class Num not contained in Ord? Haskell class Num not contained in Ord? haskell Haskell Num Ord Haskell class Num not contained in Ord? I was reading LYAH and read that the Num class isn't a subset of Ord. This means that there is a Num type which is not a member of Ord, what could constitute such a type? Thank...	[ -0.00213623046875, -0.0021514892578125, 0.01556396484375, 0.0004291534423828125, -0.00830078125, 0.033935546875, -0.005523681640625, -0.0263671875, 0.0023193359375, 0.0264892578125, -0.01953125, -0.04638671875, 0.00323486328125, -0.02197265625, -0.0218505859375, -0.0126953125, -0.015...	[ 20625, 142508, 18507, 52782, 959, 70541, 297, 23, 35379, 32, 1556, 339, 192583, 56112, 18, 1614, 3509, 10644, 32786, 5809, 11764 ]	[ 0.1312255859375, 0.2275390625, 0.1868896484375, 0.2369384765625, 0.128173828125, 0.1492919921875, 0.03509521484375, 0.0684814453125, 0.2178955078125, 0.003631591796875, 0.106689453125, 0.00335693359375, 0.117431640625, 0.053253173828125, 0.0654296875, 0.0771484375, 0.07879638671875, ...	embed

33130252_c1

33130252

haskell

1

works as expected, because I got past an error about pg_config missing, to the error I currently have. Second, I also tried adding the lib and include directories to my PATH, but this did not change the error. I should also mention my Postgres installation works fine on its own. Code signals: --extra-include-dirs, lib...

[ 0.005035400390625, 0.02099609375, -0.00726318359375, 0.0169677734375, -0.01025390625, 0.01190185546875, -0.006317138671875, 0.00136566162109375, -0.0048828125, -0.012939453125, 0.0076904296875, -0.0235595703125, 0.021728515625, -0.00714111328125, -0.01043701171875, 0.00799560546875, ...

[ 43240, 237, 84751, 4, 6637, 11015, 18499, 915, 177, 454, 153837, 132283, 47, 87, 82424, 765, 5, 77648, 37842, 154107, 70, 25474, 26698, 14364, 3387, 759, 436, 139909, 959, 15549, 2795, 17562, 59720, 5885, 6863, 10002, 28864, 26073, 112779, ...

[ 0.1654052734375, 0.0906982421875, 0.146484375, 0.004974365234375, 0.009368896484375, 0.1192626953125, 0.17333984375, 0.07366943359375, 0.1634521484375, 0.03546142578125, 0.276123046875, 0.1549072265625, 0.011566162109375, 0.010284423828125, 0.087890625, 0.039642333984375, 0.046386718...

embed

34789371_c0

34789371

haskell

0

Title: Why are arbitrary sized tuples useful? (Template Haskell) Problem title: Why are arbitrary sized tuples useful? (Template Haskell) Tags: tuples, list, template-haskell, haskell Problem: Why are arbitrary sized tuples useful? (Template Haskell) In the introductory text for Template Haskell one of the examples for...

Why are arbitrary sized tuples useful? (Template Haskell) Why are arbitrary sized tuples useful? (Template Haskell) tuples list template-haskell haskell Why Template Haskell Why are arbitrary sized tuples useful? (Template Haskell) In the introductory text for Template Haskell one of the examples for why Template Haske...

[ 0.0194091796875, -0.000058650970458984375, 0.002655029296875, 0.0093994140625, 0.0035400390625, 0.0033721923828125, -0.006317138671875, -0.00160980224609375, 0.01251220703125, -0.0021209716796875, -0.010009765625, -0.054443359375, 0.003936767578125, 0.01226806640625, 0.00469970703125, ...

[ 44084, 621, 61799, 1294, 13267, 71, 370, 99726, 80234, 159065, 19309, 20625, 142508, 5303, 110934, 10557, 1556, 196631, 39864, 7986, 27781, 15400, 20697, 678, 4865, 60042, 111, 2053, 10644, 5701, 959, 4527, 52895, 8705, 12921, 71062 ]

[ 0.1328125, 0.033477783203125, 0.1634521484375, 0.1051025390625, 0.1427001953125, 0.07275390625, 0.151611328125, 0.233642578125, 0.1759033203125, 0.1031494140625, 0.08203125, 0.1102294921875, 0.2186279296875, 0.1318359375, 0.200439453125, 0.0654296875, 0.08203125, 0.2288818359375, ...

embed

14657746_c0

14657746

haskell

0

Title: xmonad will behave abnormally if compiled with "ghc -threaded" Problem title: xmonad will behave abnormally if compiled with "ghc -threaded" Tags: xmonad, haskell Problem: xmonad will behave abnormally if compiled with "ghc -threaded" The xmonad created using xmonad --recompile works great. H...

xmonad will behave abnormally if compiled with "ghc -threaded" xmonad will behave abnormally if compiled with "ghc -threaded" xmonad haskell xmonad will behave abnormally if compiled with "ghc -threaded" The xmonad created using xmonad --recompile works great. However, if we build xmonad using 'ghc ...

[ -0.0045166015625, 0.01422119140625, 0.00439453125, 0.004974365234375, 0.0021514892578125, 0.009033203125, -0.01434326171875, 0.01214599609375, -0.0152587890625, -0.0478515625, 0.0220947265625, 0.00653076171875, -0.006439208984375, -0.0228271484375, -0.00101470947265625, 0.0006065368652...

[ 1022, 3796, 712, 68991, 1563, 33176, 375, 5974, 678, 9486, 238, 39116, 297, 1556, 142508, 1221, 75935, 17368, 4210, 107, 58875, 1340, 43240, 6782, 45367, 127, 7, 151134, 9351, 59499, 13651, 105742, 32087, 16145, 71, 186, 22799, 80934, 4488,...

[ 0.08721923828125, 0.1580810546875, 0.189208984375, 0.11474609375, 0.0239410400390625, 0.1085205078125, 0.03131103515625, 0.15673828125, 0.009368896484375, 0.087158203125, 0.110595703125, 0.135009765625, 0.05865478515625, 0.0732421875, 0.202880859375, 0.0230560302734375, 0.06103515625...

embed

2423894_c0

2423894

haskell

0

Title: Using Haskell's Parsec to parse binary files? Problem title: Using Haskell's Parsec to parse binary files? Tags: haskell, parsing, binary Problem: Using Haskell's Parsec to parse binary files? Parsec is designed to parse textual information, but it occurs to me that Parsec could also be suitable to do ...

Using Haskell's Parsec to parse binary files? Using Haskell's Parsec to parse binary files? haskell parsing binary Using Haskell Parsec Using Haskell's Parsec to parse binary files? Parsec is designed to parse textual information, but it occurs to me that Parsec could also be suitable to do binary file format...

[ -0.0026397705078125, 0.0108642578125, 0.00982666015625, 0.04638671875, -0.00173187255859375, 0.0274658203125, -0.00201416015625, -0.0296630859375, -0.00836181640625, -0.0032196044921875, 0.00286865234375, -0.01263427734375, -0.00238037109375, 0.01007080078125, 0.00146484375, 0.02490234...

[ 345, 6953, 20625, 142508, 3768, 2392, 39797, 47, 366, 184, 2394, 6635, 102158, 1556, 83, 82775, 90426, 4677, 5809, 202319, 54, 11435, 9384, 27140, 83687, 35431, 33180, 1810, 80596, 81273, 21373, 30700, 98169, 14602, 903, 2965, 3917 ]

[ 0.09564208984375, 0.096923828125, 0.142822265625, 0.2398681640625, 0.060546875, 0.1788330078125, 0.272705078125, 0.0430908203125, 0.1737060546875, 0.1280517578125, 0.1905517578125, 0.16259765625, 0.1763916015625, 0.1259765625, 0.002960205078125, 0.164306640625, 0.126220703125, 0.10...

embed

40444687_c0

40444687

haskell

0

Title: Haskell: How to change algorithm to work on any size of list? Problem title: Haskell: How to change algorithm to work on any size of list? Tags: haskell, algorithm Problem: Haskell: How to change algorithm to work on any size of list? x=take 1 project main = print $ x it is return a list of 3 pairs [(x,y),(x,y),...

Haskell: How to change algorithm to work on any size of list? Haskell: How to change algorithm to work on any size of list? haskell algorithm Haskell How Haskell: How to change algorithm to work on any size of list? I have this code: it is return a list of 3 pairs [(x,y),(x,y),(x,y)] . There are 3 conditions: If you su...

[ -0.00921630859375, 0.0211181640625, 0.010009765625, 0.015625, -0.005706787109375, -0.000308990478515625, -0.0216064453125, 0.018310546875, 0.004669189453125, -0.003997802734375, 0.01275634765625, -0.0137939453125, 0.0093994140625, 0.0096435546875, -0.013671875, 0.0029449462890625, 0....

[ 20625, 142508, 11249, 47, 15549, 234873, 4488, 98, 2499, 13267, 5303, 12, 111, 1556, 765, 903, 18151, 30646, 138, 80836, 425, 53, 27289, 4263, 398, 10554, 756, 1022, 8110, 2046, 1892, 1639, 40715, 2289, 19713, 1632, 113, 450, 105950, 1031...

[ 0.167724609375, 0.268798828125, 0.130859375, 0.1072998046875, 0.22900390625, 0.2919921875, 0.161865234375, 0.09381103515625, 0.12890625, 0.1783447265625, 0.2183837890625, 0.000762939453125, 0.04864501953125, 0.160888671875, 0.016204833984375, 0.010711669921875, 0.114501953125, 0.15...

embed

20821432_c0

20821432

haskell

0

Title: cabal-dev install Happstack-server how Problem title: cabal-dev install Happstack-server how Tags: cabal-dev, haskell Problem: cabal-dev install Happstack-server how here is what I did: makdir happstack_01 cabal-dev install happstack-server write the typical helloworld.hs with "import Happstack.Server (nullConf,...

cabal-dev install Happstack-server how cabal-dev install Happstack-server how cabal-dev haskell Happstack-server cabal-dev install Happstack-server how here is what I did: makdir happstack_01 cabal-dev install happstack-server write the typical helloworld.hs with "import Happstack.Server (nullConf, simpleHTTP, toRespon...

[ 0.00140380859375, -0.00885009765625, -0.00130462646484375, 0.02783203125, -0.0108642578125, 0.00640869140625, 0.009033203125, -0.00194549560546875, 0.000850677490234375, -0.03173828125, -0.007080078125, -0.036865234375, 0.0101318359375, 0.0084228515625, 0.01611328125, 0.00982666015625,...

[ 109524, 18548, 20600, 208612, 590, 2594, 39642, 3642, 1556, 142508, 17719, 936, 256, 6366, 6746, 33022, 222201, 33600, 31, 32554, 127, 60270, 193348, 139550, 11935, 420, 8781, 23658, 47, 94399, 3664, 31380, 39116, 35378, 70646, 191147, 959, 7...

[ 0.2137451171875, 0.2039794921875, 0.17529296875, 0.2398681640625, 0.1986083984375, 0.20263671875, 0.1846923828125, 0.051025390625, 0.13720703125, 0.2044677734375, 0.05804443359375, 0.1103515625, 0.118896484375, 0.142822265625, 0.0479736328125, 0.049591064453125, 0.061309814453125, ...

embed

47686289_c0

47686289

haskell

0

Title: Why is `Functor ((->) r)` not shown on the Functor documentation Problem title: Why is `Functor ((->) r)` not shown on the Functor documentation Tags: haskell, functor Problem: Why is `Functor ((->) r)` not shown on the Functor documentation In the source code, https://hackage.haskell.org/package/base-4.10...

Why is `Functor ((->) r)` not shown on the Functor documentation Why is `Functor ((->) r)` not shown on the Functor documentation haskell functor Why Functor Why is `Functor ((->) r)` not shown on the Functor documentation In the source code, https://hackage.haskell.org/package/base-4.10.1.0/docs/src/GHC.Base.htm...

[ 0.02685546875, -0.0084228515625, 0.0196533203125, -0.0191650390625, 0.006988525390625, 0.01446533203125, -0.00372314453125, -0.0184326171875, 0.0023345947265625, 0.000354766845703125, -0.004730224609375, -0.0211181640625, -0.0033416748046875, 0.01019287109375, -0.01434326171875, -0.002...

[ 44084, 83, 97249, 18770, 60494, 9, 1230, 5386, 1690, 959, 127887, 28670, 209806, 1556, 142508, 7477, 9473, 103607, 31344, 18151, 139509, 4588, 10557, 1478, 29102, 37382, 11565, 10179, 102107, 29713, 19437, 41877, 441, 63473, 7693, 84632, 418, ...

[ 0.1158447265625, 0.0149688720703125, 0.235107421875, 0.2347412109375, 0.128662109375, 0.0858154296875, 0.06317138671875, 0.1495361328125, 0.1832275390625, 0.1329345703125, 0.18994140625, 0.2125244140625, 0.209228515625, 0.1038818359375, 0.201416015625, 0.12451171875, 0.00277709960937...

embed

66528701_c0

66528701

haskell

0

Title: I have installed cassava-0.5.2.0, but the compiler is still complaining Problem title: I have installed cassava-0.5.2.0, but the compiler is still complaining Tags: haskell-stack, haskell Problem: I have installed cassava-0.5.2.0, but the compiler is still complaining I am trying to get Cassava up and running. I...

I have installed cassava-0.5.2.0, but the compiler is still complaining I have installed cassava-0.5.2.0, but the compiler is still complaining haskell-stack haskell Data.Csv qualified cassava-0.5.2.0 Data.Vector Could I have installed cassava-0.5.2.0, but the compiler is still complaining I am trying to get Cassava up...

[ -0.00848388671875, 0.0079345703125, -0.0032806396484375, 0.04248046875, 0.005218505859375, 0.022216796875, 0.0072021484375, 0.005767822265625, -0.0191650390625, -0.007720947265625, -0.019287109375, -0.053955078125, 0.0106201171875, 0.005889892578125, 0.000934600830078125, -0.0092773437...

[ 765, 20600, 377, 1192, 330, 93645, 73011, 1284, 9969, 34759, 7464, 186992, 214, 1556, 142508, 590, 2594, 11809, 5, 441, 67756, 217225, 26455, 18770, 191147, 297, 31577, 103978, 5528, 51042, 65771, 3229, 9790, 1340, 16195, 19514, 678, 18499, ...

[ 0.048736572265625, 0.1634521484375, 0.074462890625, 0.1322021484375, 0.259033203125, 0.2215576171875, 0.1912841796875, 0.050262451171875, 0.1533203125, 0.1739501953125, 0.09747314453125, 0.187744140625, 0.05303955078125, 0.1075439453125, 0.219970703125, 0.08013916015625, 0.0955200195...

embed

31711599_c1

31711599

haskell

1

o test test.c: #include "HsFFI.h" extern void __stginit_Test(void); extern void test(); int main(int argc, char *argv[]) { hs_init(&argc, &argv); hs_add_root(__stginit_Test); int i; for (i = 0; i < 100000000; i++) { test(); } hs_exit(); return 0; } test2.c: void test() { } Test.hs: {-# LANGUAGE ForeignFunctionInterface...

[ 0.01531982421875, -0.0006561279296875, -0.0196533203125, -0.001922607421875, 0.0101318359375, -0.0087890625, 0.009033203125, -0.000713348388671875, -0.0020751953125, -0.017333984375, -0.0106201171875, -0.0152587890625, -0.0162353515625, 0.01495361328125, 0.0181884765625, 0.005767822265...

[ 36, 3034, 5, 238, 12, 468, 217028, 841, 7, 30110, 568, 127, 76714, 2292, 71, 271, 39402, 18, 111337, 965, 532, 3142, 23, 5201, 4288, 79459, 21441, 61477, 334, 1096, 73, 217, 132, 1230, 11, 4028, 148920, 17, 100, 14, 757, 4426, 805, ...

[ 0.2060546875, 0.25146484375, 0.015380859375, 0.1025390625, 0.07696533203125, 0.0418701171875, 0.2425537109375, 0.0865478515625, 0.1036376953125, 0.1656494140625, 0.139404296875, 0.16650390625, 0.15625, 0.1575927734375, 0.021087646484375, 0.01373291015625, 0.06878662109375, 0.118041...

embed

18605310_c0

18605310

haskell

0

Title: How to change function calls with parenthesis using composition in Haskell? Problem title: How to change function calls with parenthesis using composition in Haskell? Tags: haskell Problem: How to change function calls with parenthesis using composition in Haskell? Here's what I write: (take 2 (repeat " ")) I wa...

How to change function calls with parenthesis using composition in Haskell? How to change function calls with parenthesis using composition in Haskell? haskell composition How Haskell How to change function calls with parenthesis using composition in Haskell? Here's what I write: (take 2 (repeat " ")) I want to change ...

[ -0.03466796875, -0.0103759765625, 0.000797271728515625, 0.048828125, 0.00823974609375, 0.02490234375, 0.00029754638671875, 0.010009765625, 0.006378173828125, -0.028076171875, -0.006683349609375, 0.01470947265625, -0.0023193359375, 0.007232666015625, 0.010986328125, -0.01312255859375, ...

[ 11249, 47, 15549, 32354, 11782, 678, 49129, 160291, 7, 166577, 20625, 142508, 17368, 23, 1556, 33022, 78219, 116, 107, 1081, 257, 44, 3444, 14700, 42, 15490, 4171, 4527, 1242, 1884, 221, 405, 49725, 3331, 1076, 7840, 24084, 836, 1022, 801...

[ 0.05194091796875, 0.0531005859375, 0.209228515625, 0.1934814453125, 0.189208984375, 0.0894775390625, 0.148193359375, 0.182861328125, 0.0511474609375, 0.2479248046875, 0.135498046875, 0.2369384765625, 0.02496337890625, 0.0281524658203125, 0.1192626953125, 0.033843994140625, 0.15917968...

embed

25698518_c0

25698518

haskell

0

Title: configure ghc's default output file extension? Problem title: configure ghc's default output file extension? Tags: haskell, ghc Problem: configure ghc's default output file extension? When I have a file foo.hs and run ghc foo.hs , it generates a binary file without an extension, foo . This is rather in...

configure ghc's default output file extension? configure ghc's default output file extension? haskell ghc foo.hs configure ghc's default output file extension? When I have a file foo.hs and run ghc foo.hs , it generates a binary file without an extension, foo . This is rather inconvenient for ignoring by .git...

[ 0.00762939453125, 0.005126953125, 0.0032196044921875, -0.0033111572265625, -0.00994873046875, -0.01953125, -0.0390625, 0.003082275390625, -0.0019073486328125, 0.00244140625, -0.0014495849609375, 0.00555419921875, -0.01007080078125, 0.0081787109375, -0.00872802734375, -0.007110595703125...

[ 222495, 31380, 238, 3768, 114977, 140992, 11435, 111938, 1556, 142508, 5775, 31, 127, 7, 765, 11675, 139392, 2394, 6635, 15490, 192206, 47438, 15769, 167790, 13, 3714, 3917, 3789, 6056, 5809, 33022, 8781, 128019, 26499, 5868, 876 ]

[ 0.2269287109375, 0.1534423828125, 0.14697265625, 0.055999755859375, 0.2357177734375, 0.20458984375, 0.1724853515625, 0.20361328125, 0.12890625, 0.218017578125, 0.1590576171875, 0.1729736328125, 0.13916015625, 0.00726318359375, 0.002166748046875, 0.0758056640625, 0.1312255859375, 0....

embed

38375984_c0

38375984

haskell

0

Title: HOWTO transform a tuple of functions into a function that emits a tuple Problem title: HOWTO transform a tuple of functions into a function that emits a tuple Tags: tuples, haskell, functional-programming Problem: HOWTO transform a tuple of functions into a function that emits a tuple Given that I have a tuple o...

HOWTO transform a tuple of functions into a function that emits a tuple HOWTO transform a tuple of functions into a function that emits a tuple tuples haskell functional-programming HOWTO HOWTO transform a tuple of functions into a function that emits a tuple Given that I have a tuple of functions with the same input b...

[ -0.00099945068359375, 0.00007486343383789062, -0.00012683868408203125, 0.0203857421875, -0.0111083984375, 0.0027313232421875, -0.0242919921875, -0.026611328125, 0.017333984375, -0.01513671875, -0.00872802734375, 0.004913330078125, -0.002532958984375, 0.0390625, -0.01287841796875, -0.00...

[ 21997, 150042, 27198, 370, 8705, 111, 32354, 3934, 450, 53225, 7, 10, 99726, 1556, 142508, 123309, 28966, 765, 678, 5701, 107730, 1284, 12921, 140992, 11249, 96760, 30646, 107013, 189534, 29806, 2967, 9351, 28864, 27781, 77947 ]

[ 0.1312255859375, 0.283447265625, 0.188720703125, 0.1702880859375, 0.2337646484375, 0.0689697265625, 0.2247314453125, 0.1094970703125, 0.027099609375, 0.2271728515625, 0.044525146484375, 0.029144287109375, 0.200439453125, 0.1322021484375, 0.207275390625, 0.1357421875, 0.09429931640625...

embed

29996688_c0

29996688

haskell

0

Title: GHCI 7.8.3 does not support utf8 characters Problem title: GHCI 7.8.3 does not support utf8 characters Tags: ghc, ghci, haskell, utf-8 Problem: GHCI 7.8.3 does not support utf8 characters I've read in the utf8-string package that ghc should support utf8 by default. I've even seen somewhere being written that now...

GHCI 7.8.3 does not support utf8 characters GHCI 7.8.3 does not support utf8 characters ghc ghci haskell utf-8 GHCI utf8 asd.txt Exception filenames.txt utf-8 GHCI 7.8.3 does not support utf8 characters I've read in the utf8-string package that ghc should support utf8 by default. I've even seen somewhere being written ...

[ 0.003509521484375, 0.0206298828125, 0.013671875, -0.0042724609375, -0.01708984375, -0.0016326904296875, -0.0038604736328125, -0.0177001953125, -0.020751953125, 0.033447265625, -0.017822265625, -0.0294189453125, 0.00860595703125, -0.008544921875, -0.00830078125, 0.0059814453125, 0.016...

[ 41877, 17304, 361, 52196, 363, 14602, 959, 8060, 486, 420, 1019, 124850, 31380, 238, 318, 1556, 142508, 17376, 237, 71, 5, 124326, 5443, 63928, 11435, 11627, 12301, 91693, 98169, 5608, 114977, 272, 3853, 51592, 5036, 18151, 22469, 11814, 61...

[ 0.1614990234375, 0.208984375, 0.06500244140625, 0.17333984375, 0.1534423828125, 0.0684814453125, 0.110107421875, 0.1820068359375, 0.10546875, 0.1156005859375, 0.22119140625, 0.193115234375, 0.142333984375, 0.154296875, 0.169677734375, 0.1170654296875, 0.2119140625, 0.150146484375, ...

embed

5584984_c1

5584984

haskell

1

AFAIK, both are reputed well suited for this kind of operation). I know none of these languages. I could learn on of them to provide my example but this would'nt be a fair comparison: I am not sure to be able to provide an implementation allowing both expressivity and performances. So my two questions are : 1) which la...

[ -0.00106048583984375, 0.0296630859375, -0.02001953125, -0.00396728515625, 0.00185394287109375, 0.0028076171875, -0.00811767578125, -0.00003838539123535156, 0.0106201171875, -0.0234375, -0.0128173828125, 0.00469970703125, 0.014892578125, -0.0140380859375, -0.015625, 0.000322341918945312...

[ 6, 151334, 17756, 15044, 621, 7077, 5299, 14947, 71, 100, 903, 8562, 41018, 194, 3714, 351, 6097, 46876, 7, 5809, 30698, 98, 2856, 22691, 27781, 660, 44075, 225490, 9077, 208124, 190358, 36510, 54613, 23718, 5, 6626, 17582, 2965, 22599, 1...

[ 0.021240234375, 0.0841064453125, 0.1055908203125, 0.140869140625, 0.024078369140625, 0.10498046875, 0.0615234375, 0.149169921875, 0.0667724609375, 0.02032470703125, 0.085205078125, 0.08319091796875, 0.18701171875, 0.0197296142578125, 0.097412109375, 0.0177764892578125, 0.073120117187...

embed

15861885_c0

15861885

haskell

0

Title: Explanation of currying in simple terms Problem title: Explanation of currying in simple terms Tags: haskell, currying Problem: Explanation of currying in simple terms I'm currently learning about Haskell and have come across something called currying and curried values. I have also found that (+) is a curried v...

Explanation of currying in simple terms Explanation of currying in simple terms haskell currying Explanation Integer Explanation of currying in simple terms I'm currently learning about Haskell and have come across something called currying and curried values. I have also found that (+) is a curried version of + From w...

[ -0.003173828125, -0.00274658203125, 0.0115966796875, 0.0203857421875, 0.019287109375, 0.032958984375, -0.002227783203125, -0.0120849609375, 0.00616455078125, -0.018310546875, 0.0166015625, -0.05224609375, -0.0093994140625, 0.01123046875, -0.00191497802734375, -0.025146484375, 0.00393...

[ 5443, 5868, 198555, 214, 8781, 69407, 1556, 142508, 44401, 52080, 20625, 36880, 35839, 9709, 46572, 142424, 22183, 16, 83, 10, 11389, 997, 14192, 351, 16820, 765, 107730, 116, 101935, 5701, 72856, 187136, 27781 ]

[ 0.024993896484375, 0.144287109375, 0.24560546875, 0.1627197265625, 0.1322021484375, 0.130126953125, 0.1287841796875, 0.21630859375, 0.1900634765625, 0.011505126953125, 0.1065673828125, 0.0139617919921875, 0.0009765625, 0.145751953125, 0.1920166015625, 0.1748046875, 0.2366943359375, ...

embed

26439915_c0

26439915

haskell

0

Title: Why `Just String` will be wrong in Haskell Problem title: Why `Just String` will be wrong in Haskell Tags: haskell Problem: Why `Just String` will be wrong in Haskell Hi I have a trivial but exhausting question during learning myself the Parameterized Types topic in Haskell. Here is my question: Look this is the...

Why `Just String` will be wrong in Haskell Why `Just String` will be wrong in Haskell haskell Why Just Haskell Maybe Nothing Why `Just String` will be wrong in Haskell Hi I have a trivial but exhausting question during learning myself the Parameterized Types topic in Haskell. Here is my question: Look this is the defin...

[ -0.01336669921875, 0.006317138671875, -0.000039577484130859375, 0.00738525390625, 0.000583648681640625, 0.0189208984375, -0.0076904296875, 0.0023345947265625, 0.0022430419921875, -0.010009765625, 0.00543212890625, -0.048828125, -0.0032196044921875, 0.0067138671875, 0.000606536865234375, ...

[ 44084, 127794, 23351, 214, 1221, 186, 44691, 20625, 142508, 23, 1556, 9563, 83425, 182747, 686, 146353, 9655, 1720, 29089, 29367, 60457, 28451, 60818, 903, 80934, 4527, 1884, 15400, 831, 18, 5646, 10644, 77336, 3714, 2967, 32233, 150863, 1284...

[ 0.110107421875, 0.1495361328125, 0.2017822265625, 0.1351318359375, 0.06787109375, 0.0654296875, 0.1510009765625, 0.111328125, 0.2225341796875, 0.035430908203125, 0.087158203125, 0.1536865234375, 0.287353515625, 0.1397705078125, 0.010528564453125, 0.07110595703125, 0.00286865234375, ...

embed

56264267_c0

56264267

haskell

0

Title: Haskell list filtering with two arguments Problem title: Haskell list filtering with two arguments Tags: filter, list, haskell Problem: Haskell list filtering with two arguments I have to write a function, which filters with one argument that results True , then filters with another argument which results False ...

Haskell list filtering with two arguments Haskell list filtering with two arguments filter list haskell Haskell Bool x:xs Haskell list filtering with two arguments I have to write a function, which filters with one argument that results True , then filters with another argument which results False I tried this: But I n...

[ -0.0228271484375, 0.04248046875, 0.005859375, -0.01129150390625, 0.00299072265625, 0.010986328125, -0.00021266937255859375, 0.01409912109375, 0.01251220703125, 0.0247802734375, 0.00775146484375, -0.002288818359375, 0.0120849609375, 0.018798828125, -0.00506591796875, 0.00897216796875, ...

[ 20625, 142508, 5303, 46312, 214, 678, 6626, 10750, 1556, 2460, 929, 1022, 12, 425, 765, 33022, 32354, 1632, 50339, 87599, 15700, 22225, 184, 37842, 3871, 450, 7440, 10869, 706, 1326, 27781 ]

[ 0.1221923828125, 0.216552734375, 0.2110595703125, 0.2286376953125, 0.056854248046875, 0.0614013671875, 0.1829833984375, 0.2359619140625, 0.1065673828125, 0.07293701171875, 0.156005859375, 0.08349609375, 0.01141357421875, 0.1317138671875, 0.0225982666015625, 0.070068359375, 0.12915039...

embed

61526610_c0

61526610

haskell

0

Title: How to use Filter and Map Haskell? Problem title: How to use Filter and Map Haskell? Tags: haskell Problem: How to use Filter and Map Haskell? First of all sorry for my Englisch, I am new in Haskell and i dont really know much about it. I want all even Numbers from [0..6] and then the square Numbers from them. L...

How to use Filter and Map Haskell? How to use Filter and Map Haskell? haskell How Filter Map Haskell How to use Filter and Map Haskell? First of all sorry for my Englisch, I am new in Haskell and i dont really know much about it. I want all even Numbers from [0..6] and then the square Numbers from them. Like this a x =...

[ 0.0030364990234375, 0.01446533203125, -0.01055908203125, -0.020263671875, 0.0111083984375, 0.0169677734375, 0.005615234375, 0.00457763671875, 0.0035552978515625, -0.01165771484375, 0.0015716552734375, -0.028564453125, -0.009033203125, 0.0262451171875, -0.001861572265625, -0.00549316406...

[ 11249, 47, 4527, 128896, 136, 42719, 20625, 142508, 32, 1556, 59090, 100, 133456, 444, 3525, 13319, 6183, 3714, 5045, 3444, 756, 3853, 103332, 7, 1295, 2389, 5, 910, 268, 7068, 70, 108047, 18852, 903, 10, 1022, 2203, 661, 6, 4426, 9, ...

[ 0.1072998046875, 0.038909912109375, 0.1676025390625, 0.3154296875, 0.16650390625, 0.257568359375, 0.1907958984375, 0.26220703125, 0.0196990966796875, 0.173583984375, 0.059967041015625, 0.001495361328125, 0.154541015625, 0.01068115234375, 0.04388427734375, 0.07208251953125, 0.01168823...

embed

63193423_c0

63193423

haskell

0

Title: How to identify required extensions for Servant Problem title: How to identify required extensions for Servant Tags: servant, haskell Problem: How to identify required extensions for Servant I am reading a servant tutorial but do not understand which extension is used for what parts of the code. The tutorial sta...

How to identify required extensions for Servant How to identify required extensions for Servant servant haskell How Servant How to identify required extensions for Servant I am reading a servant tutorial but do not understand which extension is used for what parts of the code. The tutorial starts by adding ~10 extensio...

[ 0.004241943359375, 0.004425048828125, 0.0198974609375, 0.0159912109375, -0.0174560546875, -0.00113677978515625, -0.0196533203125, -0.0068359375, -0.005096435546875, 0.008056640625, 0.0118408203125, -0.0269775390625, 0.000640869140625, 0.020263671875, 0.000850677490234375, 0.01428222656...

[ 11249, 135812, 56065, 111938, 7, 100, 5406, 30624, 187646, 1556, 142508, 16454, 57143, 28219, 11814, 63920, 18151, 4034, 154107, 963, 86595, 11435, 5117, 27781, 4734, 144570, 1031, 29479, 10002, 10723, 4527, 20187, 14012, 55300 ]

[ 0.05926513671875, 0.185791015625, 0.24169921875, 0.216796875, 0.096435546875, 0.076904296875, 0.168212890625, 0.207275390625, 0.2266845703125, 0.1217041015625, 0.1734619140625, 0.01715087890625, 0.1165771484375, 0.010040283203125, 0.060821533203125, 0.0142059326171875, 0.034484863281...

embed

63279576_c0

63279576

haskell

0

Title: Representing a computational graph in Haskell Problem title: Representing a computational graph in Haskell Tags: automatic-differentiation, algorithm, data-structures, functional-programming, haskell Problem: Representing a computational graph in Haskell I'm trying to write a simple automatic differentiation pac...

Representing a computational graph in Haskell Representing a computational graph in Haskell automatic-differentiation algorithm data-structures functional-programming haskell Representing Haskell Representing a computational graph in Haskell I'm trying to write a simple automatic differentiation package in Haskell. Wha...

[ -0.00604248046875, 0.034912109375, 0.01019287109375, 0.041015625, -0.0191650390625, 0.017822265625, -0.01953125, 0.005035400390625, -0.0155029296875, -0.03125, -0.04150390625, -0.027099609375, -0.00058746337890625, 0.045166015625, -0.00173187255859375, 0.019775390625, 0.0043640136718...

[ 853, 55247, 214, 181135, 43315, 41382, 23, 20625, 142508, 101038, 238778, 14, 234873, 2053, 137656, 123309, 28966, 1556, 31577, 33022, 8781, 99710, 2320, 98169, 621, 93766, 48322, 33636, 10644, 115840, 80581, 606, 4527, 10135, 9, 107, 40383, ...

[ 0.09625244140625, 0.2379150390625, 0.0078125, 0.1356201171875, 0.08258056640625, 0.2420654296875, 0.047698974609375, 0.149658203125, 0.25439453125, 0.1982421875, 0.140380859375, 0.1014404296875, 0.1063232421875, 0.0682373046875, 0.1239013671875, 0.1212158203125, 0.06610107421875, 0...

embed

15572767_c0

15572767

haskell

0

Title: How to implement Haskell instance in python? Problem title: How to implement Haskell instance in python? Tags: haskell, inheritance, multiple-inheritance, python Problem: How to implement Haskell instance in python? In Haskell if you create an instance like this: instance (Eq a) => POrd (Set a) where ... Then if...

How to implement Haskell instance in python? How to implement Haskell instance in python? haskell inheritance multiple-inheritance python How Haskell POrd Set How to implement Haskell instance in python? In Haskell if you create an instance like this: Then if you need to do the same thing in python, does it mean that w...

[ 0.0091552734375, 0.00052642822265625, 0.0123291015625, 0.0235595703125, -0.0198974609375, 0.0230712890625, 0.00286865234375, -0.007354736328125, 0.0084228515625, -0.0021514892578125, -0.00982666015625, -0.02001953125, 0.00836181640625, 0.00262451171875, -0.028076171875, 0.0042724609375...

[ 11249, 47, 29479, 20625, 142508, 110527, 23, 17198, 50828, 1556, 3334, 217, 48716, 73, 7154, 8574, 4216, 19943, 360, 28282, 1884, 903, 3871, 54, 5701, 29459, 105233, 18507, 35839, 14481, 1295, 15700, 241, 864 ]

[ 0.058807373046875, 0.0247802734375, 0.21875, 0.204345703125, 0.307373046875, 0.29150390625, 0.0869140625, 0.14990234375, 0.19775390625, 0.17236328125, 0.161376953125, 0.051483154296875, 0.1153564453125, 0.020721435546875, 0.01007080078125, 0.103759765625, 0.1434326171875, 0.2211914...

embed

22942194_c1

22942194

haskell

1

@wombat$ cabal configure --enable-executable-profiling --enable-library-profiling Resolving dependencies... Configuring creatur-realtra-1.0.8... amy@wombat$ cabal build --ghc-options=-Werror && cabal test && cabal install <snip> amy@wombat$ cabal run realtra-benchmark +RTS -p cabal: the flag -p requires the program to ...

[ -0.0106201171875, -0.0033416748046875, -0.0167236328125, -0.00860595703125, -0.00408935546875, 0.0031585693359375, -0.0196533203125, 0.0004062652587890625, -0.00634765625, 0.005645751953125, 0.0023651123046875, -0.00469970703125, -0.01025390625, -0.01409912109375, -0.01251220703125, 0....

[ 1374, 434, 16298, 18, 109524, 222495, 2886, 46480, 1010, 22819, 58395, 214, 150, 2844, 132944, 42548, 117538, 59994, 48107, 474, 107, 28095, 5759, 132208, 10, 1176, 981, 45367, 9486, 238, 109585, 188800, 3034, 20600, 93, 11675, 2773, 1517, ...

[ 0.011444091796875, 0.00079345703125, 0.102783203125, 0.072265625, 0.239990234375, 0.1851806640625, 0.05419921875, 0.030487060546875, 0.09466552734375, 0.0784912109375, 0.197021484375, 0.06085205078125, 0.0142669677734375, 0.08489990234375, 0.1436767578125, 0.16748046875, 0.0325622558...

embed

21538903_c0

21538903

haskell

0

Title: How can I elegantly invert a Map's keys and values? Problem title: How can I elegantly invert a Map's keys and values? Tags: haskell Problem: How can I elegantly invert a Map's keys and values? I have a Map (or associative list) that looks like this: [("A", ["KB", "KC"]), ("B", ["KD", "KE"])] How can I...

How can I elegantly invert a Map's keys and values? How can I elegantly invert a Map's keys and values? haskell How Map How can I elegantly invert a Map's keys and values? I have a Map (or associative list) that looks like this: How can I concisely transform the above Map so that the keys are the values and t...

[ 0.000759124755859375, -0.003387451171875, 0.00579833984375, -0.00982666015625, -0.024658203125, -0.01416015625, -0.0201416015625, -0.01361083984375, 0.006866455078125, 0.027587890625, 0.015869140625, 0.0279541015625, 0.0294189453125, 0.046142578125, -0.01409912109375, 0.006103515625, ...

[ 11249, 831, 87, 27650, 538, 131983, 42719, 3768, 22799, 7, 136, 142424, 1556, 142508, 10, 166027, 5303, 33342, 1884, 903, 158, 10794, 27198, 36917, 221, 621, 16750, 6713, 29806 ]

[ 0.10638427734375, 0.09112548828125, 0.044586181640625, 0.1993408203125, 0.06195068359375, 0.273193359375, 0.2271728515625, 0.053466796875, 0.221435546875, 0.059417724609375, 0.132568359375, 0.1756591796875, 0.1240234375, 0.212158203125, 0.01849365234375, 0.10888671875, 0.129760742187...

embed

66610681_c0

66610681

haskell

0

Title: How could you rewrite this function in just one line using infinite lists in Haskell? Problem title: How could you rewrite this function in just one line using infinite lists in Haskell? Tags: haskell Problem: How could you rewrite this function in just one line using infinite lists in Haskell? I'm still a bit c...

How could you rewrite this function in just one line using infinite lists in Haskell? How could you rewrite this function in just one line using infinite lists in Haskell? haskell infinite How Haskell mylist.append How could you rewrite this function in just one line using infinite lists in Haskell? I'm still a bit con...

[ -0.003387451171875, 0.003936767578125, -0.004241943359375, -0.006072998046875, 0.00787353515625, 0.0194091796875, -0.01177978515625, -0.003387451171875, 0.009765625, -0.03515625, -0.006317138671875, -0.01043701171875, 0.024169921875, 0.037353515625, 0.0029754638671875, 0.00227355957031...

[ 11249, 5809, 456, 434, 18781, 903, 32354, 23, 1660, 1632, 13315, 54241, 13, 5303, 20625, 142508, 17368, 1556, 759, 6562, 9007, 3611, 55681, 3642, 4527, 28219, 23755, 12096, 145581, 831, 59121, 237 ]

[ 0.04791259765625, 0.05169677734375, 0.14453125, 0.1363525390625, 0.181640625, 0.065185546875, 0.209228515625, 0.0562744140625, 0.0943603515625, 0.1326904296875, 0.1575927734375, 0.15673828125, 0.08575439453125, 0.179931640625, 0.1402587890625, 0.23486328125, 0.013519287109375, 0.12...

embed

29679170_c0

29679170

haskell

0

Title: How can I split a list into chunks using span? Problem title: How can I split a list into chunks using span? Tags: haskell Problem: How can I split a list into chunks using span? Can I rewrite this using library functions? chunks :: ([a] -> ([a], [a])) -> [a] -> [[a]] chunks f [] = [] chunks f xs = case c of [] ...

How can I split a list into chunks using span? How can I split a list into chunks using span? haskell span How How can I split a list into chunks using span? Can I rewrite this using library functions? If I give it a span -like function that always takes at least one element off the list, it'll consume the list and ret...

[ -0.0272216796875, 0.00830078125, 0.01904296875, -0.00604248046875, -0.0179443359375, 0.01214599609375, -0.01263427734375, -0.01904296875, -0.0159912109375, -0.0234375, 0.002044677734375, 0.00537109375, -0.0224609375, -0.003143310546875, 0.000614166259765625, -0.004180908203125, -0.00...

[ 11249, 831, 65450, 5303, 3934, 7839, 1224, 17368, 27734, 87, 1556, 142508, 456, 434, 18781, 35773, 1294, 32354, 8337, 5062, 11343, 51776, 19713, 1632, 12830, 5773, 1181, 18588, 30646, 1614, 6562, 80854, 148431, 12638, 1733, 35839 ]

[ 0.059906005859375, 0.055328369140625, 0.2330322265625, 0.229248046875, 0.164306640625, 0.224365234375, 0.1761474609375, 0.080078125, 0.278076171875, 0.014190673828125, 0.1407470703125, 0.21728515625, 0.05499267578125, 0.0655517578125, 0.103271484375, 0.1290283203125, 0.04006958007812...

embed

59725921_c1

59725921

haskell

1

1,25,120] let mp = M.fromList $ zip [0..(length xs)] xs let xs' = [5,17,32,150,9,90] let mp' = M.fromList $ zip [0..(length xs')] xs' let expected = [(1, 31),(3, 151)] getSimilarities mp mp' `shouldBe` expected However, I do not really like "check" function as I do not need to form a new map there, I just need to check...

[ -0.0262451171875, -0.0033721923828125, -0.01177978515625, -0.031005859375, -0.027099609375, -0.01531982421875, 0.015380859375, 0.00946044921875, 0.0274658203125, 0.00811767578125, 0.0234375, 0.05224609375, 0.0257568359375, 0.012939453125, -0.01263427734375, 0.005401611328125, -0.0033...

[ 106, 2588, 20840, 2633, 9607, 2203, 276, 161063, 154663, 68330, 2389, 23986, 1022, 7, 758, 2489, 6460, 19236, 193328, 25, 84751, 41600, 4, 1936, 86827, 90483, 2046, 294, 2605, 1703, 2449, 11412, 52366, 6766, 54, 959, 6183, 1884, 78292, 32...

[ 0.0574951171875, 0.2587890625, 0.2491455078125, 0.08447265625, 0.209716796875, 0.03857421875, 0.0836181640625, 0.169921875, 0.22509765625, 0.2259521484375, 0.0228271484375, 0.0980224609375, 0.0987548828125, 0.08013916015625, 0.0631103515625, 0.1201171875, 0.1739501953125, 0.2309570...

embed

35479467_c1

35479467

haskell

1

Int -> Int)) are identical because of, well... currying. Anyhow, if the last argument were an EnvTransformer: f :: Int -> Int -> Int -> EnvTransformer g :: Int -> (Int -> (Int -> EnvTransformer)) h :: Int -> (Int -> (Int -> (ClassEnv -> Maybe ClassEnv))) j :: Int -> Int -> Int -> ClassEnv -> Maybe ClassEnv ... all of t...

[ -0.005889892578125, -0.00970458984375, -0.003448486328125, 0.005126953125, -0.000560760498046875, 0.0184326171875, -0.0194091796875, -0.0166015625, 0.00225830078125, 0.0027618408203125, 0.025146484375, -0.01116943359375, -0.007049560546875, -0.00347900390625, 0.015380859375, -0.0087890...

[ 360, 18, 33079, 16, 621, 31943, 6827, 6637, 198555, 214, 47251, 2174, 4568, 10750, 357, 334, 62624, 82772, 1238, 1984, 706, 4153, 1096, 140803, 7768, 83425, 35014, 1647, 32354, 5646, 201, 40, 6366, 304, 92, 59121, 49129, 35412, 14612, 113...

[ 0.14990234375, 0.223876953125, 0.1251220703125, 0.00762939453125, 0.067138671875, 0.1636962890625, 0.1380615234375, 0.0308837890625, 0.2237548828125, 0.135498046875, 0.013702392578125, 0.0189971923828125, 0.13330078125, 0.2490234375, 0.10400390625, 0.15771484375, 0.1446533203125, 0...

embed

37012770_c0

37012770

haskell

0

Title: Haskell, reverse two elements in list? Problem title: Haskell, reverse two elements in list? Tags: list, haskell Problem: Haskell, reverse two elements in list? i want to take a list and always reverse two elements. Example: input 1: [1,2,3,4,5] , output 1: [2,1,4,3,5] input 2: [1,2,3,4,5,6] output 2: [2,1,4,3,6...

Haskell, reverse two elements in list? Haskell, reverse two elements in list? list haskell Haskell x:y:xs Main Exception test.hs Non-exhaustive Haskell, reverse two elements in list? i want to take a list and always reverse two elements. Example: input 1: [1,2,3,4,5] , output 1: [2,1,4,3,5] input 2: [1,2,3,4,5,6] outpu...

[ -0.0167236328125, 0.0279541015625, 0.000942230224609375, 0.006134033203125, 0.020751953125, 0.030029296875, -0.001922607421875, 0.0159912109375, 0.0223388671875, 0.01153564453125, 0.040283203125, 0.007080078125, 0.00701904296875, -0.00909423828125, 0.015869140625, 0.0194091796875, 0....

[ 20625, 142508, 39531, 184, 6626, 80854, 23, 5303, 32, 4, 1556, 1022, 53, 12, 425, 12321, 5443, 63928, 3034, 127, 3775, 3355, 18391, 4935, 3444, 5646, 11343, 89536, 107730, 13806, 155761, 80389, 140992, 163324, 92714, 15573, 133063, 82449, 1...

[ 0.17431640625, 0.2479248046875, 0.250244140625, 0.195556640625, 0.209716796875, 0.2283935546875, 0.0994873046875, 0.2264404296875, 0.0174407958984375, 0.017730712890625, 0.1529541015625, 0.0244140625, 0.06982421875, 0.005035400390625, 0.083984375, 0.0675048828125, 0.052093505859375, ...

embed

25759094_c0

25759094

haskell

0

Title: Template Haskell in GHCI Problem title: Template Haskell in GHCI Tags: haskell, ghci, compiler-errors Problem: Template Haskell in GHCI I'm new at learning Haskell so I'll say sorry in advance for the silly questions. I want to build a function that removes all the upper cases from a string (I use GHCI) removeUp...

Template Haskell in GHCI Template Haskell in GHCI haskell ghci compiler-errors Template Haskell GHCI Syntax Perhaps TemplateHaskell Template Haskell in GHCI I'm new at learning Haskell so I'll say sorry in advance for the silly questions. I want to build a function that removes all the upper cases from a string (I use ...

[ -0.00933837890625, 0.00311279296875, 0.00141143798828125, -0.004119873046875, 0.00848388671875, 0.01251220703125, 0.00897216796875, 0.000789642333984375, -0.0115966796875, -0.041259765625, -0.007049560546875, -0.029296875, 0.0142822265625, -0.0034942626953125, 0.005889892578125, 0.0076...

[ 196631, 20625, 142508, 41877, 17304, 23, 1556, 31380, 318, 9969, 34759, 188800, 19010, 86531, 181799, 6495, 7, 3525, 52080, 59090, 12097, 3444, 45367, 32354, 87388, 756, 70, 1407, 56, 50218, 1295, 79315, 4966, 1340, 45831, 25632, 26008, 4865,...

[ 0.271728515625, 0.14404296875, 0.2479248046875, 0.140869140625, 0.1878662109375, 0.0309906005859375, 0.11767578125, 0.1112060546875, 0.1746826171875, 0.1285400390625, 0.1287841796875, 0.1676025390625, 0.0692138671875, 0.10321044921875, 0.043121337890625, 0.0931396484375, 0.0523681640...

embed

40903305_c0

40903305

haskell

0

Title: Haskell: Non-exhaustive patterns in factorial function Problem title: Haskell: Non-exhaustive patterns in factorial function Tags: pattern-matching, haskell, ghci Problem: Haskell: Non-exhaustive patterns in factorial function I've tried implementing a recursive factorial function in GHCi, but I'm receiving the ...

Haskell: Non-exhaustive patterns in factorial function Haskell: Non-exhaustive patterns in factorial function pattern-matching haskell ghci Haskell Non-exhaustive Prelude n-1 Exception Haskell: Non-exhaustive patterns in factorial function I've tried implementing a recursive factorial function in GHCi, but I'm receivin...

[ -0.015869140625, 0.00555419921875, 0.01495361328125, 0.004638671875, 0.00457763671875, 0.0026702880859375, 0.0020751953125, -0.01263427734375, -0.01031494140625, -0.01348876953125, 0.01275634765625, -0.031494140625, -0.004852294921875, -0.01025390625, 0.018310546875, -0.00390625, 0.0...

[ 20625, 142508, 3775, 3355, 18391, 4935, 103510, 31461, 15403, 32354, 23, 98753, 1556, 31380, 318, 1914, 822, 112, 653, 5759, 5443, 63928, 37842, 29479, 195625, 5844, 527, 73265, 14, 217063, 25632, 18499, 903, 38162, 1295, 71864, 121742, 22690...

[ 0.1368408203125, 0.2646484375, 0.193115234375, 0.06988525390625, 0.16162109375, 0.0938720703125, 0.217041015625, 0.1646728515625, 0.1317138671875, 0.1512451171875, 0.0260162353515625, 0.1561279296875, 0.139404296875, 0.121337890625, 0.1644287109375, 0.060638427734375, 0.1680908203125...

embed

51456200_c0

51456200

haskell

0

Title: Unable to match Haskell type Problem title: Unable to match Haskell type Tags: haskell Problem: Unable to match Haskell type I know there are lots of questions on this topic, but I feel that there is something specific about the library that I am using that is giving me the error. module Test where import Clash....

Unable to match Haskell type Unable to match Haskell type haskell Clash.Prelude init Unable Haskell Test Vec Nil Test.hs:28:14 Couldn Nat Test.hs:26:1-33 Expected Actual Relevant Test.hs:27:1 Cons Unable to match Haskell type I know there are lots of questions on this topic, but I feel that there is something specific ...

[ -0.01226806640625, 0.033203125, -0.0162353515625, 0.01123046875, 0.0029296875, -0.0086669921875, -0.031494140625, -0.017822265625, 0.007354736328125, -0.0054931640625, 0.01007080078125, -0.02099609375, 0.02001953125, 0.00567626953125, 0.00994873046875, -0.00994873046875, 0.0184326171...

[ 992, 2886, 14858, 20625, 142508, 10644, 1556, 313, 5544, 19273, 822, 112, 23, 217, 8647, 52884, 77175, 127, 28270, 22635, 191147, 19, 68875, 28194, 125565, 60075, 13, 100582, 133, 30624, 27592, 19721, 39215, 12319, 29458, 35773, 1294, 18499, ...

[ 0.0889892578125, 0.1639404296875, 0.22802734375, 0.1595458984375, 0.252685546875, 0.179443359375, 0.150146484375, 0.05194091796875, 0.2071533203125, 0.088623046875, 0.16455078125, 0.1246337890625, 0.041351318359375, 0.035614013671875, 0.150146484375, 0.12548828125, 0.1221923828125, ...

embed

18909649_c0

18909649

haskell

0

Title: What is the RWS Monad and when is it used Problem title: What is the RWS Monad and when is it used Tags: haskell, monad-transformers Problem: What is the RWS Monad and when is it used I ran across the RWS Monad and its MonadTransformer while looking up something in the mtl library. There is no real documentation...

What is the RWS Monad and when is it used What is the RWS Monad and when is it used haskell monad-transformers What RWS Monad What is the RWS Monad and when is it used I ran across the RWS Monad and its MonadTransformer while looking up something in the mtl library. There is no real documentation there, and I was wonde...

[ -0.00823974609375, -0.00124359130859375, 0.01287841796875, 0.013427734375, 0.0234375, 0.00058746337890625, 0.00482177734375, -0.009033203125, -0.0172119140625, 0.006744384765625, 0.021728515625, -0.006317138671875, -0.009521484375, -0.0013580322265625, -0.01263427734375, -0.00640869140...

[ 4865, 83, 70, 627, 52143, 60331, 71, 3229, 442, 11814, 1556, 142508, 2667, 712, 215175, 1314, 13028, 36880, 62624, 82772, 18, 141, 35773, 209806, 2367, 903, 7440, 62163, 90791, 15322, 5264, 33462, 122636, 4, 601, 2783, 22836, 177261, 17262,...

[ 0.0477294921875, 0.04986572265625, 0.050201416015625, 0.1353759765625, 0.245849609375, 0.2119140625, 0.188232421875, 0.0791015625, 0.052215576171875, 0.126708984375, 0.0899658203125, 0.1781005859375, 0.113525390625, 0.135498046875, 0.1956787109375, 0.103759765625, 0.017852783203125, ...

embed

43101697_c0

43101697

haskell

0

Title: No instance for (Show a) arising Problem title: No instance for (Show a) arising Tags: haskell Problem: No instance for (Show a) arising ghci is giving me the error "No instance for (Show a) arising from use of 'commaSeperated'" What im trying to do is define a show for my data Set that uses curly braces instead...

No instance for (Show a) arising No instance for (Show a) arising haskell Show Set Char x:xs No instance for (Show a) arising ghci is giving me the error "No instance for (Show a) arising from use of 'commaSeperated'" What im trying to do is define a show for my data Set that uses curly braces instead of square. What a...

[ -0.00008153915405273438, 0.00665283203125, 0.03125, 0.007171630859375, -0.0076904296875, 0.020263671875, 0.0111083984375, 0.003326416015625, 0.0201416015625, 0.0186767578125, -0.031982421875, -0.0091552734375, 0.0361328125, 0.0155029296875, -0.00885009765625, -0.0167236328125, -0.002...

[ 438, 110527, 100, 168660, 10, 187, 72219, 1556, 142508, 17367, 19943, 21656, 1022, 425, 31380, 318, 163, 18499, 5021, 1295, 4527, 277, 192, 4233, 1264, 27686, 31577, 61924, 7639, 2053, 9709, 538, 1620, 5170, 64457, 6, 108047, 444, 20594, ...

[ 0.142822265625, 0.272705078125, 0.109375, 0.2235107421875, 0.11474609375, 0.130615234375, 0.161376953125, 0.11767578125, 0.2183837890625, 0.1807861328125, 0.1561279296875, 0.130859375, 0.0189056396484375, 0.06207275390625, 0.086669921875, 0.11328125, 0.002410888671875, 0.1706542968...

embed

77636725_c1

77636725

haskell

1

Data\Local\Temp\cabal-repl.-26728\dist-newstyle\build\x86_64-windows\ghc-8.10.2\fake-package-0\x\script\build\script\script-tmp\Main.o ) Linking C:\Users\<me>\AppData\Local\Temp\cabal-repl.-26728\dist-newstyle\build\x86_64-windows\ghc-8.10.2\fake-package-0\x\script\build\script\script.exe ... 2 Code signals: Control.Ex...

[ 0.0023040771484375, 0.01031494140625, -0.012451171875, 0.000507354736328125, 0.006439208984375, 0.006591796875, 0.002685546875, -0.006866455078125, -0.004180908203125, 0.00250244140625, -0.0120849609375, -0.00146484375, 0.006927490234375, 0.02685546875, 0.01068115234375, -0.01177978515...

[ 11809, 203758, 159065, 408, 3571, 107, 2424, 51372, 3882, 46295, 54936, 40946, 177149, 15276, 13307, 229792, 9486, 238, 17376, 10179, 304, 1021, 29102, 23320, 32032, 2676, 168793, 31, 12779, 214, 313, 1062, 7, 282, 39179, 137989, 5, 454, 46...

[ 0.144775390625, 0.145751953125, 0.2296142578125, 0.0867919921875, 0.2069091796875, 0.0213775634765625, 0.135986328125, 0.08056640625, 0.1805419921875, 0.06396484375, 0.038848876953125, 0.196533203125, 0.20361328125, 0.16845703125, 0.1298828125, 0.1104736328125, 0.09259033203125, 0....

embed

32551144_c0

32551144

haskell

0

Title: Inverting List Elements in Haskell Problem title: Inverting List Elements in Haskell Tags: haskell, list Problem: Inverting List Elements in Haskell I am trying to invert two-elements lists in xs . For example, invert [[1,2], [5,6,7], [10,20]] will return [[2,1], [5,6,7], [20,10]] . It doesn't invert [5,6,7] bec...

Inverting List Elements in Haskell Inverting List Elements in Haskell haskell list Inverting List Elements Haskell Inverting List Elements in Haskell I am trying to invert two-elements lists in xs . For example, invert [[1,2], [5,6,7], [10,20]] will return [[2,1], [5,6,7], [20,10]] . It doesn't invert [5,6,7] because i...

[ -0.00518798828125, 0.01611328125, -0.003631591796875, -0.005706787109375, -0.00421142578125, 0.031982421875, -0.0196533203125, -0.0177001953125, -0.0086669921875, 0.028564453125, 0.0196533203125, -0.00787353515625, 0.0108642578125, 0.0263671875, -0.02490234375, 0.021240234375, 0.0336...

[ 148639, 1916, 32036, 48325, 23, 20625, 142508, 1556, 5303, 31577, 131983, 6626, 62766, 1022, 7, 133063, 104629, 966, 963, 1549, 1221, 30646, 304, 76172, 22027, 18, 83, 138, 12830, 59121, 2060, 10644, 21635, 201505, 7225, 3525, 157666, 29479, ...

[ 0.233642578125, 0.10076904296875, 0.21435546875, 0.2196044921875, 0.045257568359375, 0.1646728515625, 0.260009765625, 0.1463623046875, 0.2213134765625, 0.099365234375, 0.279296875, 0.14404296875, 0.2171630859375, 0.1243896484375, 0.0946044921875, 0.139404296875, 0.159912109375, 0.0...

embed

64682066_c0

64682066

haskell

0

Title: Should stack.yaml.lock be checked into source control? Problem title: Should stack.yaml.lock be checked into source control? Tags: haskell, version-control, haskell-stack Problem: Should stack.yaml.lock be checked into source control? Since stack v2, stack produces a stack.yaml.lock file. Should this file be com...

Should stack.yaml.lock be checked into source control? Should stack.yaml.lock be checked into source control? haskell version-control haskell-stack Should stack.yaml.lock stack.yaml Should stack.yaml.lock be checked into source control? Since stack v2, stack produces a stack.yaml.lock file. Should this file be committe...

[ -0.006011962890625, -0.000797271728515625, 0.01434326171875, -0.0238037109375, -0.005584716796875, 0.005035400390625, -0.0130615234375, 0.006683349609375, -0.0177001953125, 0.0174560546875, -0.0125732421875, -0.0205078125, 0.00014495849609375, 0.0152587890625, -0.00787353515625, 0.0277...

[ 151117, 177261, 5, 14520, 141, 21135, 186, 12765, 297, 3934, 31344, 6226, 1556, 142508, 11389, 81988, 590, 2594, 66016, 81, 304, 27489, 11435, 174176, 47, 5608, 15769, 167790, 13, 104, 3535, 139392, 10941, 56112, 18, 70541, 256, 114942, 425...

[ 0.0823974609375, 0.23974609375, 0.0341796875, 0.20703125, 0.1873779296875, 0.2442626953125, 0.031005859375, 0.1910400390625, 0.023162841796875, 0.0914306640625, 0.207275390625, 0.200439453125, 0.114013671875, 0.203857421875, 0.118408203125, 0.1290283203125, 0.0986328125, 0.13378906...

embed

35823465_c0

35823465

haskell

0

Title: haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] Problem title: haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] Tags: haskell Problem: haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] I'm trying ...

haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] haskell Cannot Either EitherInts haskell - Cannot parse data constructor in a data/newtype declaration: [Either Int Int] I'm trying to declare a...

[ 0.0031280517578125, 0.00433349609375, -0.0067138671875, 0.0152587890625, -0.021728515625, 0.024169921875, -0.00665283203125, 0.00115203857421875, -0.004730224609375, -0.0203857421875, -0.0091552734375, -0.04443359375, 0.0296630859375, -0.01104736328125, -0.020263671875, -0.003067016601...

[ 1556, 142508, 4171, 10869, 366, 184, 2053, 64549, 748, 54936, 50986, 21635, 14, 9319, 360, 18, 4565, 4153, 933, 23, 31577, 159978, 5303, 52895, 9790, 9969, 1340, 903, 10644, 18499, 87, 765, 110, 6528, 15400, 20594, 44691 ]

[ 0.14453125, 0.24755859375, 0.064697265625, 0.1363525390625, 0.136962890625, 0.08612060546875, 0.140869140625, 0.1689453125, 0.114990234375, 0.0626220703125, 0.2410888671875, 0.1436767578125, 0.03985595703125, 0.197021484375, 0.0771484375, 0.095947265625, 0.089111328125, 0.062561035...

embed

3621588_c1

3621588

haskell

1

(Integral a) => [a] -> Bool prop_sum xs = almostEqual (fromIntegral (length xs) * mean (fromList xs)) (fromIntegral (sum xs)) -- This passes: check_mean_ok = quickCheck (prop_like_arith_mean :: [Integer] -> Property) >> quickCheck (prop_sum :: [Integer] -> Bool) -- This fails: check_mean_fail = quickCheck (prop_like_a...

[ -0.0205078125, -0.0036163330078125, 0.0027008056640625, 0.00142669677734375, -0.01055908203125, 0.00543212890625, 0.00506591796875, -0.0194091796875, 0.017822265625, 0.01263427734375, 0.000598907470703125, 0.0260009765625, 0.0233154296875, -0.00482177734375, -0.004302978515625, 0.00424...

[ 15, 4153, 67, 5739, 141, 10, 44357, 11, 33079, 2460, 929, 25793, 454, 11832, 1022, 7, 2203, 39555, 647, 71723, 161063, 23986, 661, 29459, 154663, 4210, 3293, 10922, 12765, 282, 66, 685, 63773, 202567, 36290, 5062, 8962, 206984, 35782, 120...

[ 0.047943115234375, 0.040618896484375, 0.15087890625, 0.12939453125, 0.1171875, 0.1434326171875, 0.06256103515625, 0.06219482421875, 0.013092041015625, 0.11669921875, 0.212158203125, 0.245849609375, 0.0264129638671875, 0.250244140625, 0.151611328125, 0.1336669921875, 0.045135498046875...

embed

18792665_c2

18792665

haskell

2

1.45496), (3.07156,2.1016), (0.64665,2.90991), (1.93993,1.13162), (1.13163,2.42492), (3.87988,1.77827), (3.39488,5.98147), (2.74823,3.87986), (2.26326,2.74825), (1.45496,3.7182), (5.01149,1.77828), (5.17317,2.10159), (0.96996,4.36486), (0.48498,3.07156), (-0.96996,3.39489), (-1.77828,2.26325), (-1.61661,-0.8083), (-1.4...

[ -0.0108642578125, -0.000202178955078125, -0.01068115234375, 0.006866455078125, 0.0076904296875, 0.00360107421875, -0.001953125, 0.0283203125, 0.00201416015625, 0.0216064453125, 0.00836181640625, 0.017822265625, 0.01092529296875, -0.01165771484375, -0.0020751953125, 0.01226806640625, ...

[ 615, 152463, 109241, 4, 6896, 5, 8368, 155740, 68107, 169887, 247, 22085, 13307, 170686, 5442, 5039, 5046, 17727, 15, 158304, 9323, 11591, 92134, 5016, 10837, 2858, 2681, 138808, 116591, 2357, 129524, 135527, 168405, 206029, 170702, 80847, 9285...

[ 0.1204833984375, 0.255615234375, 0.273681640625, 0.127685546875, 0.133056640625, 0.1170654296875, 0.1341552734375, 0.1907958984375, 0.05291748046875, 0.1927490234375, 0.1416015625, 0.045654296875, 0.121826171875, 0.2020263671875, 0.10675048828125, 0.1336669921875, 0.1787109375, 0.1...

embed

5298703_c0

5298703

haskell

0

Title: Practice part of lambda abstractions Problem title: Practice part of lambda abstractions Tags: lambda, haskell, abstraction Problem: Practice part of lambda abstractions I'm new in Haskell programming. Now i'm learn lambda function and lambda abstractions. And i thought, what's the practice part of lambda functi...

Practice part of lambda abstractions Practice part of lambda abstractions lambda haskell abstraction Practice Practice part of lambda abstractions I'm new in Haskell programming. Now i'm learn lambda function and lambda abstractions. And i thought, what's the practice part of lambda functions. For example we have: What...

[ -0.0038299560546875, -0.004974365234375, 0.0072021484375, -0.00592041015625, -0.004730224609375, 0.0159912109375, -0.00213623046875, 0.021728515625, 0.007659912109375, -0.009521484375, -0.000263214111328125, -0.0294189453125, -0.003692626953125, 0.0245361328125, 0.002349853515625, 0.00...

[ 109613, 13, 2831, 21, 6492, 85, 164789, 17514, 1556, 142508, 3525, 20625, 56037, 32354, 17569, 41361, 7, 765, 111, 903, 831, 28282, 3638, 5423, 22288, 10750, 87293, 18151, 456, 77391, 15400, 1830, 28864, 83, 959, 6957, 6275, 44084 ]

[ 0.2183837890625, 0.0281524658203125, 0.13671875, 0.066650390625, 0.18359375, 0.1268310546875, 0.1734619140625, 0.057037353515625, 0.087158203125, 0.1947021484375, 0.002685546875, 0.07373046875, 0.04412841796875, 0.1527099609375, 0.032958984375, 0.2392578125, 0.006866455078125, 0.01...

embed

27221522_c1

27221522

haskell

1

[]) | x::xs -> let newMax = max maxL x in let (maxR, aclist) = aux newMax acc xs in if maxL > x && x < maxR then (max maxR x,(min (maxL-x) (maxR-x))::aclist) else (max maxR x, aclist) in fold_left max 0 (snd (aux min_int [] list)) but I have to make it without using recursion, while I'm able to use high order function...

[ -0.0177001953125, 0.0072021484375, 0.024658203125, 0.0225830078125, -0.010009765625, 0.039306640625, -0.002349853515625, 0.0174560546875, 0.03271484375, -0.02392578125, 0.01904296875, 0.02392578125, 0.00787353515625, 0.00787353515625, 0.0242919921875, -0.02001953125, -0.0186767578125...

[ 58745, 1022, 12, 425, 7, 33079, 2633, 3525, 71346, 18389, 866, 23, 24084, 1052, 1030, 6562, 2970, 50015, 2174, 977, 619, 1230, 4426, 1249, 9, 2263, 37076, 42822, 133, 2480, 757, 2208, 10442, 881, 4288, 5303, 765, 3249, 15490, 17368, 195...

[ 0.0157623291015625, 0.09576416015625, 0.06158447265625, 0.1318359375, 0.092041015625, 0.0274505615234375, 0.20654296875, 0.153076171875, 0.2186279296875, 0.1690673828125, 0.1673583984375, 0.0528564453125, 0.1513671875, 0.1439208984375, 0.039581298828125, 0.2060546875, 0.18896484375, ...

embed

76552414_c0

76552414

haskell

0

Title: Compiling C source files with Clang instead of gcc when building with Haskell stack? Problem title: Compiling C source files with Clang instead of gcc when building with Haskell stack? Tags: haskell, haskell-stack, cabal Problem: Compiling C source files with Clang instead of gcc when building with Haskell stack...

Compiling C source files with Clang instead of gcc when building with Haskell stack? Compiling C source files with Clang instead of gcc when building with Haskell stack? haskell haskell-stack cabal Compiling Clang Haskell Compiling C source files with Clang instead of gcc when building with Haskell stack? Currently if ...

[ 0.0115966796875, 0.0264892578125, 0.000640869140625, 0.0016326904296875, 0.006866455078125, -0.0062255859375, -0.0128173828125, 0.005889892578125, -0.034912109375, 0.000804901123046875, -0.005706787109375, -0.021240234375, 0.000583648681640625, 0.011474609375, 0.012451171875, 0.0196533...

[ 15612, 49725, 313, 31344, 102158, 678, 3066, 64457, 22109, 238, 33976, 20625, 142508, 177261, 1556, 590, 2594, 109524, 3229, 45367, 13452, 501, 9969, 1340, 17368, 2806, 1884, 6097, 7722, 15549, 98169, 5, 14520, 141, 707, 69307 ]

[ 0.1436767578125, 0.105224609375, 0.18408203125, 0.2022705078125, 0.169921875, 0.08843994140625, 0.29443359375, 0.1571044921875, 0.168212890625, 0.14501953125, 0.130859375, 0.1361083984375, 0.2257080078125, 0.1905517578125, 0.112548828125, 0.0750732421875, 0.0771484375, 0.1688232421...

embed

45632218_c0

45632218

haskell

0

Title: How would I write this function in point-free style? Problem title: How would I write this function in point-free style? Tags: haskell Problem: How would I write this function in point-free style? I'm just looking to make general improvements to my Haskell code, and was wondering if the following function could ...

How would I write this function in point-free style? How would I write this function in point-free style? haskell How How would I write this function in point-free style? I'm just looking to make general improvements to my Haskell code, and was wondering if the following function could be made point-free? Mostly for cu...

[ -0.0186767578125, 0.0023956298828125, -0.0235595703125, -0.0177001953125, 0.000335693359375, -0.0142822265625, -0.0026397705078125, -0.00982666015625, -0.006744384765625, -0.028564453125, -0.004669189453125, -0.001129150390625, -0.0030517578125, 0.01129150390625, -0.02099609375, -0.004...

[ 11249, 2806, 87, 33022, 903, 32354, 6275, 32087, 20623, 23, 9, 1556, 142508, 4537, 136912, 20625, 18151, 149016, 25632, 5809, 7228, 79975, 72018, 6626, 1884, 4527, 46312, 19537, 3996, 27781, 20662 ]

[ 0.08306884765625, 0.09906005859375, 0.025390625, 0.162841796875, 0.061492919921875, 0.2030029296875, 0.1412353515625, 0.1759033203125, 0.176025390625, 0.046661376953125, 0.04388427734375, 0.117919921875, 0.1951904296875, 0.033477783203125, 0.083740234375, 0.1026611328125, 0.064392089...

embed

37434500_c0

37434500

haskell

0

Title: Apply the composition of a list of functions to each number of a list Problem title: Apply the composition of a list of functions to each number of a list Tags: function-composition, haskell Problem: Apply the composition of a list of functions to each number of a list Given a list of functions and a list of num...

Apply the composition of a list of functions to each number of a list Apply the composition of a list of functions to each number of a list function-composition haskell Apply End Apply the composition of a list of functions to each number of a list Given a list of functions and a list of numbers, I want first function ...

[ -0.02783203125, -0.00116729736328125, 0.0164794921875, 0.0267333984375, -0.012451171875, 0.0255126953125, -0.00153350830078125, 0.015625, 0.00634765625, -0.00897216796875, -0.007659912109375, -0.01190185546875, 0.0218505859375, 0.0380859375, -0.009521484375, -0.01483154296875, 0.0016...

[ 5659, 538, 166577, 5303, 111, 32354, 7, 47, 12638, 14012, 277, 40322, 1556, 142508, 18878, 136, 101935, 3444, 5117, 190659, 16750, 7068, 11814, 100, 17932, 2685, 45367, 73, 903 ]

[ 0.162109375, 0.1094970703125, 0.24169921875, 0.1883544921875, 0.023895263671875, 0.1925048828125, 0.00994873046875, 0.10540771484375, 0.06939697265625, 0.1396484375, 0.135498046875, 0.145751953125, 0.122314453125, 0.21533203125, 0.1180419921875, 0.0537109375, 0.131103515625, 0.1152...

embed

20024723_c0

20024723

haskell

0

Title: View documentation of packages installed into a cabal sandbox Problem title: View documentation of packages installed into a cabal sandbox Tags: cabal, haskell, sandbox Problem: View documentation of packages installed into a cabal sandbox Is there a way to view the documentation of any package I installed in a ...

View documentation of packages installed into a cabal sandbox View documentation of packages installed into a cabal sandbox cabal haskell sandbox View View documentation of packages installed into a cabal sandbox Is there a way to view the documentation of any package I installed in a cabal sandbox? Currently I have a ...

[ 0.0172119140625, -0.0021514892578125, 0.023193359375, -0.007781982421875, -0.0052490234375, 0.0172119140625, 0.0029449462890625, 0.0098876953125, 0.006011962890625, -0.0185546875, 0.0069580078125, -0.024658203125, -0.000217437744140625, -0.010498046875, -0.00860595703125, 0.00830078125...

[ 29805, 209806, 98169, 20600, 297, 3934, 10, 109524, 19096, 11728, 1556, 142508, 3917, 47, 21455, 111, 2499, 87, 23, 26499, 44677, 39210, 60875, 442, 8781, 10723, 28987, 11522, 68186, 903, 34735, 18548, 214, 72977, 42850 ]

[ 0.205810546875, 0.3017578125, 0.2303466796875, 0.2081298828125, 0.09716796875, 0.10052490234375, 0.046966552734375, 0.2459716796875, 0.173828125, 0.2205810546875, 0.083740234375, 0.18896484375, 0.0545654296875, 0.09246826171875, 0.221923828125, 0.0650634765625, 0.0241546630859375, ...

embed

44263370_c1

44263370

haskell

1

see, bevor "Chuck" there is Person , so I've to use somehow *> to get it. And that's it, just a line with <$> , <*> and *> that works that way. I don't have a clue, and I'm getting crazy with this. Maybe anyone could help me. EDIT satisfy :: (Char -> Bool) -> Parser Char -- parse a desired character satisfy p = Parser...

[ 0.004791259765625, 0.01507568359375, 0.005218505859375, 0.0281982421875, 0.00408935546875, 0.03125, 0.0079345703125, -0.0162353515625, 0.004913330078125, -0.005828857421875, 0.0035400390625, -0.01446533203125, -0.0035400390625, 0.0191650390625, -0.0024871826171875, -0.018798828125, 0...

[ 1957, 68280, 15982, 75554, 2685, 83, 15270, 87, 272, 4527, 209303, 661, 2740, 47, 2046, 442, 450, 1660, 13315, 678, 4369, 1639, 43240, 3917, 765, 29786, 20949, 116666, 903, 83425, 35672, 4358, 172864, 40407, 53, 84068, 33079, 2460, 929, 2...

[ 0.0877685546875, 0.224853515625, 0.1766357421875, 0.255126953125, 0.0823974609375, 0.030364990234375, 0.253173828125, 0.002655029296875, 0.03631591796875, 0.114990234375, 0.08416748046875, 0.1033935546875, 0.18603515625, 0.00177001953125, 0.121337890625, 0.10693359375, 0.007720947265...

embed

9055662_c0

9055662

haskell

0

Title: GHCi - Breakpoint is skipped on second run Problem title: GHCi - Breakpoint is skipped on second run Tags: ghci, haskell Problem: GHCi - Breakpoint is skipped on second run I'm new to Haskell and I'm getting an annoying behaviour when debugging. I add my break point using :break I run main Everything is ok I typ...

GHCi - Breakpoint is skipped on second run GHCi - Breakpoint is skipped on second run ghci haskell GHCi Breakpoint GHCi - Breakpoint is skipped on second run I'm new to Haskell and I'm getting an annoying behaviour when debugging. I add my break point using :break I run main Everything is ok I type :continue to finish ...

[ -0.003631591796875, -0.00518798828125, 0.00701904296875, 0.0206298828125, -0.01483154296875, 0.01806640625, -0.001556396484375, 0.0189208984375, 0.003814697265625, -0.00052642822265625, 0.003082275390625, -0.017333984375, -0.01458740234375, 0.0194091796875, 0.0238037109375, 0.014587402...

[ 527, 73265, 14, 131904, 38496, 83, 7158, 48398, 98, 17932, 11675, 31380, 318, 1556, 142508, 3525, 20625, 8668, 38543, 224833, 8, 978, 15190, 36356, 6275, 70751, 87, 5201, 3664, 10644, 133891, 67229, 71924, 456, 16428, 959, 5962, 176683, 18,...

[ 0.0821533203125, 0.1253662109375, 0.1947021484375, 0.2030029296875, 0.2125244140625, 0.01446533203125, 0.1458740234375, 0.10491943359375, 0.049346923828125, 0.165283203125, 0.1661376953125, 0.07525634765625, 0.1123046875, 0.1177978515625, 0.2335205078125, 0.0232696533203125, 0.097900...

embed

58842377_c0

58842377

haskell

0

Title: Double for loop in haskell Problem title: Double for loop in haskell Tags: recursion, haskell, loops Problem: Double for loop in haskell I'm trying to make a new list with the 2nd number of a tuple of if the first number is in the first list, here a example helplist [0,2] [(0,"a"),(3,"x"),(5,"y"),(1,"b"),(2,"c")...

Double for loop in haskell Double for loop in haskell recursion haskell loops Double Char x:xs Double for loop in haskell I'm trying to make a new list with the 2nd number of a tuple of if the first number is in the first list, here a example helplist [0,2] [(0,"a"),(3,"x"),(5,"y"),(1,"b"),(2,"c")] = ["a","c"] I've try...

[ 0.0047607421875, -0.0194091796875, 0.00665283203125, 0.0269775390625, 0.0115966796875, 0.019287109375, 0.0172119140625, 0.017333984375, 0.02685546875, 0.0111083984375, 0.00982666015625, -0.0224609375, 0.0152587890625, 0.00885009765625, -0.018798828125, -0.0002689361572265625, 0.00686...

[ 107172, 100, 40956, 23, 1556, 142508, 195625, 1830, 21656, 1022, 12, 425, 31577, 3249, 3525, 5303, 678, 116, 2208, 14012, 370, 8705, 2174, 5117, 83, 27781, 4358, 6562, 2389, 90173, 11, 86827, 104116, 53, 54753, 2203, 238, 9790, 5941, 1625...

[ 0.223388671875, 0.150390625, 0.226318359375, 0.06683349609375, 0.1629638671875, 0.251220703125, 0.200439453125, 0.11279296875, 0.16650390625, 0.0880126953125, 0.03277587890625, 0.1075439453125, 0.0701904296875, 0.023468017578125, 0.066650390625, 0.1427001953125, 0.021820068359375, ...

embed

34897366_c0

34897366

haskell

0

Title: Function pattern matching in Haskell Problem title: Function pattern matching in Haskell Tags: haskell Problem: Function pattern matching in Haskell I'm trying to learn Haskell in guidance of Learn You a Haskell , but the following puzzles me. lucky :: (Integral a) => a -> String lucky 7 = "LUCKY NUMBER SEVEN!" ...

Function pattern matching in Haskell Function pattern matching in Haskell haskell Haskell Integral LUCKY NUMBER SEVEN Sorry Function pattern matching in Haskell I'm trying to learn Haskell in guidance of Learn You a Haskell , but the following puzzles me. As you can see, there's one line up there stating the exact type...

[ -0.021484375, -0.004974365234375, 0.00836181640625, -0.003021240234375, -0.005615234375, 0.00653076171875, -0.025390625, -0.00390625, 0.0107421875, 0.006561279296875, 0.00015354156494140625, -0.0252685546875, -0.003631591796875, -0.00616455078125, 0.019775390625, 0.000885009765625, 0...

[ 28670, 10763, 103510, 14858, 214, 23, 20625, 142508, 1556, 204681, 30684, 441, 32272, 109020, 24480, 6755, 30223, 90502, 31577, 30698, 196219, 134031, 25632, 104192, 1957, 1632, 13315, 1257, 2685, 13254, 24763, 52895, 32354, 83, 903, 63559, 417...

[ 0.12255859375, 0.071044921875, 0.21875, 0.2149658203125, 0.081298828125, 0.061065673828125, 0.138916015625, 0.220947265625, 0.1146240234375, 0.1768798828125, 0.1119384765625, 0.101318359375, 0.1417236328125, 0.1038818359375, 0.039093017578125, 0.1405029296875, 0.166259765625, 0.075...

embed

4228416_c1

4228416

haskell

1

back inito the MVar Now the thing simply starts to eat A LOT of memory. Probably because the old heaps don't get garbage collected soon/frequently enough..? Is there a way to solve these problems or do I have to get back to C...? What I am doing should be mostly zerocopy operation - am I using wrong libraries to achie...

[ -0.000942230224609375, 0.0294189453125, -0.0238037109375, -0.002777099609375, 0.0128173828125, -0.005645751953125, -0.0010528564453125, 0.007354736328125, -0.00005626678466796875, -0.01129150390625, 0.018310546875, 0.006988525390625, 0.028564453125, 0.0233154296875, 0.01165771484375, -...

[ 4420, 485, 188, 70, 66160, 147, 13580, 42856, 4034, 47, 73203, 115447, 111, 98323, 10332, 17305, 6423, 402, 43799, 33662, 12176, 3917, 86869, 44402, 313, 153161, 45234, 137366, 41018, 44691, 35773, 69307, 118620, 184, 864, 3884, 61922, 347, ...

[ 0.14404296875, 0.1251220703125, 0.160888671875, 0.002716064453125, 0.1397705078125, 0.2333984375, 0.07269287109375, 0.007232666015625, 0.05902099609375, 0.0848388671875, 0.1492919921875, 0.1361083984375, 0.0232696533203125, 0.194091796875, 0.04132080078125, 0.151611328125, 0.14526367...

embed

46257773_c1

46257773

haskell

1

9","2HCH0030","2HCH0031","2H_4_0033"] Now I want to remove all the entries that are "" . So I try nonEmptyANames <- filter (\s -> s /= "") anames But I get this error: • Couldn't match type ‘[]’ with ‘IO’ Expected type: IO String Actual type: [String] • In a stmt of a 'do' block: nonEmptyANames <- filter (\ s -> s /= "...

[ -0.00958251953125, -0.00775146484375, 0, 0.0283203125, -0.0093994140625, -0.0029144287109375, 0.00799560546875, 0.008056640625, 0.006072998046875, 0.0264892578125, 0.0228271484375, -0.01458740234375, 0.00811767578125, -0.00193023681640625, -0.0159912109375, -0.0042724609375, 0.041748...

[ 483, 304, 841, 16999, 7049, 1197, 5016, 617, 123276, 363, 3444, 47, 87388, 756, 70, 112820, 90, 450, 621, 44, 58, 9790, 351, 134332, 939, 9330, 302, 46312, 41872, 33079, 91, 248, 3877, 3716, 903, 18499, 191147, 18, 14858, 10644, 1065, ...

[ 0.1513671875, 0.0214080810546875, 0.03411865234375, 0.055908203125, 0.050506591796875, 0.1302490234375, 0.1239013671875, 0.0037841796875, 0.04937744140625, 0.061004638671875, 0.058319091796875, 0.058319091796875, 0.1934814453125, 0.0780029296875, 0.022003173828125, 0.197021484375, 0....

embed

31580302_c0

31580302

haskell

0

Title: Main function complains of returning a non IO monad Problem title: Main function complains of returning a non IO monad Tags: haskell Problem: Main function complains of returning a non IO monad import Debug.Trace main = do trace "Main function parses, and returns - " "0" return () This throws error as, app.hs:3:...

Main function complains of returning a non IO monad Main function complains of returning a non IO monad haskell Debug.Trace Main app.hs:3:1 Couldn When Main function complains of returning a non IO monad This throws error as, If i am not wrong, the module must work without return. But with or without return function, i...

[ -0.00811767578125, 0.01513671875, -0.0006103515625, 0.0159912109375, -0.00159454345703125, 0.0027618408203125, 0.005401611328125, -0.01513671875, -0.0115966796875, -0.01397705078125, 0.00946044921875, -0.0390625, 0.0035400390625, -0.0234375, 0.00701904296875, -0.003204345703125, 0.01...

[ 12321, 32354, 186992, 30646, 351, 17780, 2667, 712, 214, 1556, 142508, 262, 85779, 28542, 329, 4027, 127, 19721, 191147, 19, 14847, 111, 104250, 18499, 237, 4263, 17, 444, 959, 44691, 88996, 8110, 4488, 15490, 4966, 678, 707, 83, 20697 ]

[ 0.1778564453125, 0.173583984375, 0.19970703125, 0.2432861328125, 0.1856689453125, 0.20068359375, 0.1287841796875, 0.1685791015625, 0.00628662109375, 0.1204833984375, 0.2034912109375, 0.073974609375, 0.2027587890625, 0.1439208984375, 0.0202484130859375, 0.1484375, 0.0550537109375, 0...

embed

64634999_c0

64634999

haskell

0

Title: Tasty HUnit test against Either Problem title: Tasty HUnit test against Either Tags: hunit, haskell Problem: Tasty HUnit test against Either I am fairly new to Haskell, and I was wondering if there is a way to test a pattern match, as in erlang. An example is a function that returns an Either a b, Can I match ag...

Tasty HUnit test against Either Tasty HUnit test against Either hunit haskell Tasty HUnit Either Tasty HUnit test against Either I am fairly new to Haskell, and I was wondering if there is a way to test a pattern match, as in erlang. An example is a function that returns an Either a b, Can I match against Left b, whils...

[ -0.0033111572265625, -0.0126953125, 0.000843048095703125, -0.000728607177734375, -0.015380859375, -0.01611328125, -0.0167236328125, -0.0213623046875, 0.00323486328125, 0.0203857421875, 0.0177001953125, -0.01385498046875, 0.004791259765625, 0.000698089599609375, 0.010986328125, 0.006896...

[ 9598, 939, 22438, 6773, 3034, 26548, 4565, 9319, 1926, 217, 1556, 142508, 20625, 149016, 3917, 103510, 14858, 72, 3066, 27781, 32354, 30646, 10, 876, 4171, 636, 2480, 217982, 47438, 68034, 23351, 214, 212059, 3444, 2174, 18499, 74918, 7986, ...

[ 0.1658935546875, 0.16796875, 0.0946044921875, 0.2244873046875, 0.2091064453125, 0.16064453125, 0.0723876953125, 0.185302734375, 0.1165771484375, 0.1453857421875, 0.0982666015625, 0.2159423828125, 0.100341796875, 0.003448486328125, 0.040924072265625, 0.1981201171875, 0.209228515625, ...

embed

2546455_c0

2546455

haskell

0

Title: What is wrong with my definition of Zip in Haskell? Problem title: What is wrong with my definition of Zip in Haskell? Tags: haskell, zip, combinators Problem: What is wrong with my definition of Zip in Haskell? -- eg. myzip [’a’, ’b’, ’c’] [1, 2, 3, 4] -> [(’a’, 1), (’b’, 2), (’c’, 3)] myzip :: Ord a => [a] -> ...

What is wrong with my definition of Zip in Haskell? What is wrong with my definition of Zip in Haskell? haskell zip combinators What Zip Haskell Ord list1 list2 Occurs When Failed What is wrong with my definition of Zip in Haskell? I get this error message:

[ -0.00689697265625, 0.009521484375, 0.001556396484375, 0.01031494140625, 0.0025787353515625, 0.02099609375, -0.017822265625, 0.00160980224609375, 0.00762939453125, -0.0106201171875, 0.0028533935546875, -0.0035858154296875, 0.0016632080078125, 0.00537109375, -0.01092529296875, 0.02038574...

[ 4865, 83, 44691, 678, 759, 80934, 162150, 23, 20625, 142508, 1556, 68330, 22321, 22230, 35379, 5303, 418, 304, 180, 238, 48650, 14847, 190355, 297, 903, 18499, 26008 ]

[ 0.03363037109375, 0.012176513671875, 0.1376953125, 0.08013916015625, 0.04095458984375, 0.166015625, 0.256103515625, 0.051177978515625, 0.11004638671875, 0.2276611328125, 0.09613037109375, 0.217041015625, 0.1556396484375, 0.07293701171875, 0.150634765625, 0.11181640625, 0.022750854492...

embed

26872843_c0

26872843

haskell

0

Title: Haskell filtered string to list Problem title: Haskell filtered string to list Tags: list, haskell, filter, string Problem: Haskell filtered string to list I want a fuction where you put in a String like "Hello I am 25 years old!" and get a list out of it like ["hello","i","am","years","old"]. So it should put a...

Haskell filtered string to list Haskell filtered string to list list haskell filter string Haskell Haskell filtered string to list I want a fuction where you put in a String like "Hello I am 25 years old!" and get a list out of it like ["hello","i","am","years","old"]. So it should put all uppercase letters in lowercas...

[ -0.003387451171875, -0.00157928466796875, -0.01483154296875, 0.01007080078125, 0.0048828125, 0.0263671875, 0.01708984375, -0.01239013671875, 0.00689697265625, -0.0001392364501953125, 0.001068115234375, -0.0169677734375, -0.00250244140625, 0.00811767578125, -0.0106201171875, 0.014038085...

[ 20625, 142508, 46312, 297, 79315, 47, 5303, 1556, 3444, 5639, 10763, 3884, 23, 23351, 214, 1884, 841, 13817, 87, 444, 714, 5369, 10332, 3890, 2046, 1810, 830, 14, 302, 46799, 18345, 5608, 756, 1407, 58437, 120820, 92319, 154109, 26818, 66...

[ 0.139892578125, 0.22265625, 0.265869140625, 0.1090087890625, 0.254150390625, 0.10888671875, 0.2435302734375, 0.1297607421875, 0.115478515625, 0.1619873046875, 0.1558837890625, 0.040985107421875, 0.0599365234375, 0.166748046875, 0.08935546875, 0.018218994140625, 0.052032470703125, 0...

embed

46677991_c0

46677991

haskell

0

Title: Rigid type error Problem title: Rigid type error Tags: haskell Problem: Rigid type error I have the following code: data Argument = Argument { ttype :: Type, value :: String } data Predicate = Predicate { lemma :: String , arguments :: [Argument] } class Throw a where throw :: a -> a -> Predicate instance Throw ...

Rigid type error Rigid type error haskell rel Rigid Argument Type Predicate Throw STUFF HAPPENS HERE OTHER PATTERNS HAPPEN context.hs:162:11 Couldn context.hs:161:1-55 LEAVING OUT BREVITY SAKE Relevant context.hs:162:6 context.hs:162:1 Rigid type error I have the following code: The idea is that b in the qWho signature...

[ -0.0037384033203125, 0.0059814453125, -0.005828857421875, 0.00909423828125, 0.01409912109375, 0.0035858154296875, -0.034912109375, -0.01153564453125, -0.002288818359375, -0.032958984375, 0.0029296875, -0.01092529296875, -0.00188446044921875, -0.0233154296875, 0.01708984375, -0.01446533...

[ 129956, 532, 10644, 18499, 1556, 142508, 7962, 112140, 60457, 7145, 2063, 6003, 15555, 94432, 30110, 572, 40680, 42603, 65791, 224750, 100308, 14755, 11572, 43701, 127, 22354, 19993, 191147, 19, 151525, 112930, 52001, 40972, 63823, 159, 119960, ...

[ 0.2132568359375, 0.2008056640625, 0.228759765625, 0.205078125, 0.11572265625, 0.2176513671875, 0.1005859375, 0.2471923828125, 0.2066650390625, 0.1466064453125, 0.1961669921875, 0.037841796875, 0.13623046875, 0.064208984375, 0.1282958984375, 0.034637451171875, 0.07135009765625, 0.03...

embed

66993706_c0

66993706

haskell

0

Title: Parsing IO [Int] to use the Int Problem title: Parsing IO [Int] to use the Int Tags: list, io, integer, parsing, haskell Problem: Parsing IO [Int] to use the Int I am developing in Haskell and I had to use System.Random . Now I have a IO [Int] and I would like to parse it to get the Int out of it and then use it...

Parsing IO [Int] to use the Int Parsing IO [Int] to use the Int list io integer parsing haskell Parsing System.Random x:xs Couldn Parsing IO [Int] to use the Int I am developing in Haskell and I had to use System.Random . Now I have a IO [Int] and I would like to parse it to get the Int out of it and then use it to per...

[ -0.0213623046875, -0.005706787109375, 0.010498046875, -0.017333984375, -0.007720947265625, 0.029541015625, 0.01434326171875, -0.0018157958984375, 0.0185546875, -0.0247802734375, 0.01904296875, -0.0045166015625, 0.00118255615234375, 0.02197265625, 0.016357421875, -0.004058837890625, -...

[ 2392, 6953, 17780, 4153, 18, 47, 4527, 360, 6, 5303, 22995, 892, 1505, 366, 1556, 142508, 12353, 126525, 3815, 1022, 12, 425, 191147, 168698, 20625, 5, 765, 1884, 184, 2046, 1810, 51339, 142, 22631, 98, 18499, 7, 11249, 378, 46132 ]

[ 0.157470703125, 0.08013916015625, 0.25634765625, 0.1585693359375, 0.18115234375, 0.054595947265625, 0.1529541015625, 0.17431640625, 0.006072998046875, 0.1820068359375, 0.2423095703125, 0.1357421875, 0.0660400390625, 0.1607666015625, 0.12548828125, 0.2213134765625, 0.107421875, 0.12...

embed

24228402_c0

24228402

haskell

0

Title: NixOS and ghc-mod - Module not found Problem title: NixOS and ghc-mod - Module not found Tags: nixos, emacs, haskell Problem: NixOS and ghc-mod - Module not found I'm experimenting a problem with the interaction between the ghc-mod plugin in emacs, and NixOS 14.04. Basically, once packages are installed via nix-...

NixOS and ghc-mod - Module not found NixOS and ghc-mod - Module not found nixos emacs haskell NixOS Module NixOS and ghc-mod - Module not found I'm experimenting a problem with the interaction between the ghc-mod plugin in emacs, and NixOS 14.04. Basically, once packages are installed via nix-env -i , they are visible ...

[ -0.015625, 0.005584716796875, 0.00885009765625, 0.01068115234375, -0.0002841949462890625, 0.020263671875, -0.009033203125, -0.00396728515625, -0.00152587890625, 0.005035400390625, -0.01324462890625, -0.0478515625, 0.0054931640625, -0.006591796875, -0.0072021484375, -0.0113525390625, ...

[ 1520, 425, 7285, 136, 31380, 238, 13415, 63014, 13, 959, 14037, 9, 300, 47436, 352, 2263, 1556, 142508, 28007, 2967, 182809, 69993, 6370, 39876, 24145, 98169, 20600, 1829, 33, 334, 14, 75693, 318, 75530, 61170, 182867, 43084, 54608, 99126, ...

[ 0.108154296875, 0.1041259765625, 0.182861328125, 0.07305908203125, 0.1612548828125, 0.1568603515625, 0.233154296875, 0.240966796875, 0.0745849609375, 0.0902099609375, 0.1739501953125, 0.009735107421875, 0.076904296875, 0.143798828125, 0.101806640625, 0.1175537109375, 0.1112060546875,...

embed

43363044_c0

43363044

haskell

0

Title: Haskell data type parametrized with random generator data type Problem title: Haskell data type parametrized with random generator data type Tags: haskell Problem: Haskell data type parametrized with random generator data type How can I parametrize a data type with a random generator data type? I tried this: dat...

Haskell data type parametrized with random generator data type Haskell data type parametrized with random generator data type haskell Haskell DataType Data RandomGen Predicate Failed GameState Haskell data type parametrized with random generator data type How can I parametrize a data type with a random generator data t...

[ -0.004547119140625, 0.026123046875, -0.01177978515625, -0.0103759765625, 0.0125732421875, 0.0181884765625, 0.01190185546875, -0.005157470703125, -0.01226806640625, -0.060546875, 0.019775390625, -0.0208740234375, -0.0123291015625, -0.01019287109375, -0.01226806640625, -0.012451171875, ...

[ 20625, 142508, 2053, 10644, 39850, 29367, 678, 96759, 145823, 1556, 11809, 196707, 39643, 306, 105376, 7145, 2063, 190355, 297, 13547, 135206, 11249, 831, 87, 170358, 731, 37842, 903, 4966, 2046 ]

[ 0.1619873046875, 0.235107421875, 0.1734619140625, 0.2274169921875, 0.201416015625, 0.07244873046875, 0.1424560546875, 0.167724609375, 0.22509765625, 0.1396484375, 0.11322021484375, 0.225830078125, 0.11260986328125, 0.0390625, 0.1624755859375, 0.09893798828125, 0.0745849609375, 0.14...

embed

7785059_c0

7785059

haskell

0

Title: Haskell, lacks an accompanying binding? Problem title: Haskell, lacks an accompanying binding? Tags: haskell Problem: Haskell, lacks an accompanying binding? this is my program (I realise it's not an entirely useful program): data Temp a = Something1 | Something2 deriving (Show,Eq,Ord) length :: Temp a -> Intege...

Haskell, lacks an accompanying binding? Haskell, lacks an accompanying binding? haskell Haskell Temp Something1 Something2 Show Ord Integer Haskell, lacks an accompanying binding? this is my program (I realise it's not an entirely useful program): and I keep getting the error message: Haskellfile.lhs:3:3: The type sign...

[ 0.007232666015625, 0.038330078125, -0.006744384765625, -0.0015411376953125, -0.00096893310546875, 0.0130615234375, 0.00836181640625, 0.000606536865234375, 0.00958251953125, -0.0264892578125, -0.01361083984375, -0.04052734375, 0.005950927734375, 0.0123291015625, 0.011474609375, -0.01086...

[ 20625, 142508, 21, 22824, 142, 1030, 146365, 214, 128239, 1556, 37446, 200905, 418, 304, 17367, 35379, 44401, 1528, 2773, 959, 80234, 13695, 18499, 26008, 29822, 79366, 363, 10644, 138256, 23986, 927, 53418, 8337, 76242, 34292, 4358 ]

[ 0.1419677734375, 0.2359619140625, 0.1136474609375, 0.1361083984375, 0.0474853515625, 0.038726806640625, 0.150390625, 0.06982421875, 0.22509765625, 0.1209716796875, 0.1802978515625, 0.1317138671875, 0.0595703125, 0.06988525390625, 0.132080078125, 0.139404296875, 0.156494140625, 0.09...

embed

8274470_c0

8274470

haskell

0

Title: How to fix the yesod ipv6 only issue? Problem title: How to fix the yesod ipv6 only issue? Tags: haskell, yesod Problem: How to fix the yesod ipv6 only issue? There's an outstanding issue with yesod where it only listens on ipv6. I am following the yesod in five minutes guide and have this issue when running "ye...

How to fix the yesod ipv6 only issue? How to fix the yesod ipv6 only issue? haskell yesod How ipv6 How to fix the yesod ipv6 only issue? There's an outstanding issue with yesod where it only listens on ipv6. I am following the yesod in five minutes guide and have this issue when running "yesod devel". How can I fix it ...

[ -0.006561279296875, 0.001312255859375, 0.01153564453125, -0.000637054443359375, 0.00156402587890625, 0.005615234375, -0.02490234375, -0.0159912109375, -0.0152587890625, -0.016357421875, 0.021240234375, -0.01300048828125, -0.0045166015625, -0.0023651123046875, 0.01190185546875, 0.012390...

[ 11249, 47, 30022, 2422, 23722, 17, 132059, 910, 4734, 31089, 1556, 142508, 216348, 678, 7440, 442, 44632, 98, 25632, 43606, 14633, 17997, 51042, 1033, 8, 2601, 5036, 1257, 9790, 170846, 1810, 27211, 759, 9007, 46295, 112, 127, 5550, 254, ...

[ 0.077880859375, 0.07421875, 0.1455078125, 0.2052001953125, 0.26171875, 0.0716552734375, 0.190185546875, 0.2197265625, 0.153076171875, 0.1328125, 0.1300048828125, 0.2049560546875, 0.0732421875, 0.034759521484375, 0.006072998046875, 0.0293121337890625, 0.2110595703125, 0.106689453125...

embed

30015171_c0

30015171

haskell

0

Title: Haskell tree size Problem title: Haskell tree size Tags: haskell, tree Problem: Haskell tree size Still a haskell noob here! I am trying to get the size of a tree? data Tree a = Leaf a | Node (Tree a) (Tree a) size :: Tree a -> Int size empty = 0 size (Leaf n) = 1 size (Node x z) = size x + size z + 1 If I call ...

Haskell tree size Haskell tree size haskell tree Haskell Tree Leaf Node Haskell tree size Still a haskell noob here! I am trying to get the size of a tree? If I call the function with All I get is 0. Is the code correct and I am just not calling it correctly? BTW, I have seen lots of examples with Empty instead of empt...

[ 0.0025634765625, -0.007080078125, 0.0155029296875, -0.0020294189453125, 0.01422119140625, 0.0086669921875, -0.01190185546875, -0.01446533203125, 0.0107421875, -0.0230712890625, 0.003204345703125, -0.02099609375, -0.000732421875, 0.007049560546875, 0.0106201171875, 0.0011138916015625, ...

[ 20625, 142508, 53201, 13267, 1556, 101344, 636, 2407, 438, 112, 50605, 3522, 3688, 38, 31577, 2046, 70, 111, 11782, 32354, 678, 3164, 87, 83, 757, 18151, 26785, 159029, 170207, 51592, 71358, 27781, 31678, 939, 64457, 201505, 113660, 142, 18...

[ 0.1531982421875, 0.254638671875, 0.240478515625, 0.232666015625, 0.1435546875, 0.182861328125, 0.0174407958984375, 0.1156005859375, 0.0791015625, 0.017547607421875, 0.0222930908203125, 0.0958251953125, 0.0140533447265625, 0.004241943359375, 0.062347412109375, 0.153076171875, 0.079467...

embed

30802142_c1

30802142

haskell

1

is out of bounds: *Main> rndSelectIO' "asdf" 5 >>= putStrLn dfas*** Exception: Number of items requested is larger than list *Main> rndSelectIO' "asdf" 2 >>= putStrLn *** Exception: Number of items requested is larger than list As you can see, the following 2 (for me) unexpected things happen: Instead of directly givi...

[ -0.006011962890625, 0.018798828125, 0.00799560546875, -0.01953125, 0.006622314453125, 0.01373291015625, -0.0172119140625, -0.01336669921875, 0.0179443359375, -0.01165771484375, 0.0164794921875, -0.04833984375, 0.00970458984375, 0.021484375, 0.0184326171875, 0.00762939453125, 0.018310...

[ 83, 1810, 111, 99091, 7, 168793, 1690, 2208, 294, 100184, 17780, 162, 420, 190, 3884, 71713, 866, 19, 104, 31773, 5443, 63928, 103332, 55769, 50336, 297, 150679, 3501, 5303, 58, 831, 1957, 25632, 116, 241957, 8966, 53383, 175399, 105237, ...

[ 0.09228515625, 0.109619140625, 0.08734130859375, 0.1553955078125, 0.0144805908203125, 0.116455078125, 0.026947021484375, 0.1318359375, 0.0318603515625, 0.15380859375, 0.200439453125, 0.02972412109375, 0.1494140625, 0.10369873046875, 0.1234130859375, 0.115234375, 0.004913330078125, ...

embed

57624349_c1

57624349

haskell

1

proximity (including diagonal), so I'm looking for a result like bellow: [ [(-1 , 2)] , [(1, 2),(1,1)] , [(-2, -0),(-1,-1),(-1,-2)] , [(2, -1)]] I've researched and tried various algorithm like BFS, Flood Fill but my input data never fit the structural requirements or my understanding of the subjects doesn't allow me ...

[ 0.00897216796875, 0.0185546875, -0.017578125, -0.01263427734375, -0.023193359375, 0.0150146484375, 0.0013427734375, 0.011474609375, 0.012451171875, -0.00537109375, -0.0017547607421875, 0.001495361328125, 0.001739501953125, 0.00335693359375, -0.0302734375, 0.0091552734375, 0.002395629...

[ 241846, 939, 216561, 207997, 16487, 100, 16750, 1884, 186, 41566, 5759, 4958, 41600, 17727, 5428, 20, 77495, 110218, 10461, 54753, 25188, 37842, 67842, 234873, 335, 36381, 91841, 140423, 1284, 107730, 2053, 8306, 11177, 118990, 96679, 100094, 2...

[ 0.269287109375, 0.1484375, 0.0279083251953125, 0.2239990234375, 0.1241455078125, 0.050323486328125, 0.15576171875, 0.08917236328125, 0.03839111328125, 0.21533203125, 0.140625, 0.09918212890625, 0.030853271484375, 0.0712890625, 0.0643310546875, 0.006103515625, 0.1337890625, 0.110961...

embed

16785594_c0

16785594

haskell

0

Title: How to import GLUT in Haskell script file Problem title: How to import GLUT in Haskell script file Tags: glut, haskell, graphics, opengl, hugs Problem: How to import GLUT in Haskell script file I get an error when i try to import GLUT package import Graphics.Rendering.OpenGL import Graphics.UI.GLUT The error i a...

How to import GLUT in Haskell script file How to import GLUT in Haskell script file glut haskell graphics opengl hugs GLUT Graphics.Rendering.OpenGL Graphics.UI.GLUT How Haskell How to import GLUT in Haskell script file I get an error when i try to import GLUT package The error i am getting is : I don't know how to use...

[ -0.01312255859375, 0.010009765625, -0.00188446044921875, -0.0024261474609375, 0.002532958984375, 0.0031890869140625, 0.015869140625, -0.0244140625, -0.0115966796875, 0.003875732421875, -0.003326416015625, -0.0478515625, 0.0111083984375, -0.02294921875, 0.0048828125, -0.00921630859375, ...

[ 11249, 24927, 527, 143662, 23, 20625, 142508, 26499, 11435, 47, 167994, 1556, 48461, 9803, 11016, 35875, 7, 189682, 33, 111747, 103264, 78703, 33457, 724, 18499, 9790, 98169, 20949, 3714, 3642, 4527, 59488, 17686, 30513, 9405, 831, 18, 7413, ...

[ 0.040679931640625, 0.2283935546875, 0.117431640625, 0.28662109375, 0.09088134765625, 0.125, 0.22265625, 0.175537109375, 0.1060791015625, 0.018524169921875, 0.2415771484375, 0.1142578125, 0.1822509765625, 0.030364990234375, 0.07763671875, 0.1214599609375, 0.05462646484375, 0.2171630...

embed

27762615_c0

27762615

haskell

0

Title: GCC error message after installing OSX Yosemite on Macbook Pro Problem title: GCC error message after installing OSX Yosemite on Macbook Pro Tags: macos, haskell, ghc, gcc Problem: GCC error message after installing OSX Yosemite on Macbook Pro Since I updated my Macbook to OSX Yosemite, I've getting the followin...

GCC error message after installing OSX Yosemite on Macbook Pro GCC error message after installing OSX Yosemite on Macbook Pro macos haskell ghc gcc GCC OSX Yosemite Macbook Pro kern.osversion GCC error message after installing OSX Yosemite on Macbook Pro Since I updated my Macbook to OSX Yosemite, I've getting the foll...

[ 0.00970458984375, 0.020263671875, 0.006927490234375, -0.00909423828125, 0.0057373046875, 0.0013275146484375, -0.031494140625, -0.002349853515625, -0.03271484375, 0.00101470947265625, 0.010009765625, -0.05712890625, -0.00677490234375, -0.0135498046875, 0.0194091796875, 0.00823974609375,...

[ 527, 13709, 18499, 26008, 7103, 20600, 11787, 1542, 6949, 184, 35093, 4727, 14137, 1250, 214, 98, 7840, 1556, 142508, 31380, 238, 22109, 77924, 232, 46354, 150011, 47, 1631, 592, 3293, 6032, 4527, 73265, 9969, 1340, 20625, 1528, 49725, 9433...

[ 0.1280517578125, 0.2120361328125, 0.13916015625, 0.09375, 0.0654296875, 0.114501953125, 0.1170654296875, 0.1185302734375, 0.191650390625, 0.14599609375, 0.2088623046875, 0.0966796875, 0.1619873046875, 0.1510009765625, 0.010009765625, 0.0211334228515625, 0.084228515625, 0.0919189453...

embed

20172710_c0

20172710

haskell

0

Title: Error check within do block in Haskell Problem title: Error check within do block in Haskell Tags: haskell Problem: Error check within do block in Haskell i have the following set of actions: action1 :: IO Bool action2 :: IO Bool action3 :: IO Bool some actions are just composition of another actions complexActi...

Error check within do block in Haskell Error check within do block in Haskell haskell Error Haskell action1 Bool action2 action3 Error check within do block in Haskell i have the following set of actions: some actions are just composition of another actions What i need is the construction that checks result of each act...

[ -0.015625, 0.00133514404296875, 0.000698089599609375, -0.004730224609375, 0.00762939453125, 0.031494140625, -0.01043701171875, 0.01544189453125, 0.00897216796875, 0.01495361328125, 0.0034942626953125, -0.006591796875, 0.020263671875, 0.000881195068359375, -0.01104736328125, 0.017700195...

[ 212059, 12765, 28032, 54, 46389, 20625, 142508, 23, 1556, 22631, 2460, 929, 304, 363, 25632, 5423, 61972, 3060, 166577, 15700, 3871, 50961, 16750, 12638, 30646, 22225, 184, 7225, 98320, 23009, 72977, 31351, 450, 8562, 337, 34759, 92558 ]

[ 0.2081298828125, 0.1982421875, 0.1864013671875, 0.1417236328125, 0.2064208984375, 0.12548828125, 0.2098388671875, 0.026519775390625, 0.128662109375, 0.1607666015625, 0.045928955078125, 0.1439208984375, 0.00421142578125, 0.0859375, 0.0148773193359375, 0.0560302734375, 0.153564453125, ...

embed

4701207_c0

4701207

haskell

0

Title: Current status of automatic parallelism in Haskell Problem title: Current status of automatic parallelism in Haskell Tags: optimization, multicore, haskell, ghc, parallel-processing Problem: Current status of automatic parallelism in Haskell Possible Duplicate: What's the status of multicore programming in Haske...

Current status of automatic parallelism in Haskell Current status of automatic parallelism in Haskell optimization multicore haskell ghc parallel-processing Current Haskell Current status of automatic parallelism in Haskell What is the status especially in GHC? Is it popular yet, or still being experimental? How carefu...

[ -0.005645751953125, 0.0096435546875, 0.019287109375, 0.00130462646484375, -0.0189208984375, 0.01507568359375, -0.0011749267578125, -0.01116943359375, -0.0150146484375, -0.01483154296875, -0.01068115234375, 0.01385498046875, -0.0011138916015625, 0.01275634765625, -0.014404296875, 0.0098...

[ 114063, 10778, 101038, 95103, 8780, 23, 20625, 142508, 87235, 6024, 30854, 1556, 31380, 238, 63923, 527, 73265, 5700, 14373, 7464, 195935, 517, 64552, 3964, 9969, 34759, 37476, 3229, 20650, 11675, 6032, 55076, 86997, 20740, 13267, 95307, 40140,...

[ 0.12841796875, 0.1541748046875, 0.217529296875, 0.2491455078125, 0.1243896484375, 0.029083251953125, 0.1517333984375, 0.2440185546875, 0.1295166015625, 0.057861328125, 0.126708984375, 0.1395263671875, 0.1121826171875, 0.111572265625, 0.07269287109375, 0.08544921875, 0.193603515625, ...

embed

7856245_c0

7856245

haskell

0

Title: Not in scope : data constructor IsTriangle Problem title: Not in scope : data constructor IsTriangle Tags: haskell, module Problem: Not in scope : data constructor IsTriangle Here is the module - Number1.hs module Number1(isTriangle) where isTriangle x y z = if x*x+y*y >= z*z then True else False This is the mai...

Not in scope : data constructor IsTriangle Not in scope : data constructor IsTriangle haskell module System.Environment Number1 Not IsTriangle Main1.hs Not in scope : data constructor IsTriangle Here is the module - Number1.hs This is the main program Main1.hs This error I get when ghc --make Main1.hs

[ 0.00445556640625, -0.01611328125, -0.016845703125, 0.00139617919921875, 0.008544921875, 0.0238037109375, 0.02490234375, 0.013916015625, -0.00022029876708984375, -0.0184326171875, -0.0120849609375, -0.027099609375, 0.0147705078125, -0.00994873046875, -0.0023956298828125, 0.00537109375, ...

[ 11205, 23, 70820, 2053, 64549, 748, 2071, 74257, 109217, 6, 1556, 142508, 88996, 12353, 686, 1900, 103332, 418, 12321, 127, 11853, 83, 7, 3293, 5201, 1528, 18499, 3229, 31380, 238, 4210, 55898, 5 ]

[ 0.18701171875, 0.1392822265625, 0.2183837890625, 0.1033935546875, 0.15771484375, 0.082763671875, 0.1539306640625, 0.18603515625, 0.2261962890625, 0.0220947265625, 0.1300048828125, 0.21044921875, 0.1861572265625, 0.07928466796875, 0.0736083984375, 0.1033935546875, 0.140380859375, 0....

embed

9912880_c0

9912880

haskell

0

Title: Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? Problem title: Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? Tags: reactive-programming, frp, haskell Problem: Does it make sense to use FRP (reactive-banana in particular) for ...

Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? reactive-programming frp haskell Does FRP Does it make sense to use FRP (reactive-banana in particular) for a turn based ascii game? I'm t...

[ -0.012451171875, 0.0111083984375, 0.0118408203125, 0.00274658203125, -0.00897216796875, -0.001922607421875, 0.006500244140625, 0.00787353515625, -0.00152587890625, -0.0128173828125, 0.0096435546875, -0.00341796875, -0.0025787353515625, 0.037109375, -0.0286865234375, 0.0028228759765625,...

[ 101790, 3249, 10422, 4527, 563, 38796, 107, 71232, 105281, 11, 17311, 100, 15504, 35509, 237, 26506, 6712, 456, 28966, 14119, 254, 1556, 142508, 47644, 1884, 104155, 519, 101758, 5351, 80836, 552, 3784, 87039, 18403, 63769, 38937, 107730, 759...

[ 0.06280517578125, 0.0736083984375, 0.1622314453125, 0.0972900390625, 0.10064697265625, 0.276123046875, 0.0899658203125, 0.2120361328125, 0.159423828125, 0.15380859375, 0.008697509765625, 0.0382080078125, 0.193603515625, 0.14599609375, 0.082275390625, 0.2052001953125, 0.1302490234375,...

embed

67478004_c0

67478004

haskell

0

Title: How to write the signum fuction in haskell (Type problem) Problem title: How to write the signum fuction in haskell (Type problem) Tags: haskell, function Problem: How to write the signum fuction in haskell (Type problem) I want to write the signum function in Haskell but i can't figure out how to properly write...

How to write the signum fuction in haskell (Type problem) How to write the signum fuction in haskell (Type problem) haskell function How Type signum1 Num How to write the signum fuction in haskell (Type problem) I want to write the signum function in Haskell but i can't figure out how to properly write the type singatu...

[ -0.010498046875, 0.0103759765625, 0.0093994140625, -0.005126953125, -0.015869140625, 0.006072998046875, 0.003021240234375, 0.0081787109375, -0.0017242431640625, 0.00811767578125, -0.0250244140625, -0.0233154296875, 0.0004711151123046875, 0.007476806640625, 0.01177978515625, 0.004272460...

[ 11249, 47, 33022, 1144, 2606, 5639, 10763, 23, 1556, 142508, 196707, 2967, 70, 32354, 60457, 418, 52782, 3444, 20625, 26366, 155965, 10644, 5367, 11, 6644, 43240, 11907, 171859, 18507, 16750, 5608, 40101, 757, 106, 707, 68940, 360, 18, 1431...

[ 0.06646728515625, 0.0310821533203125, 0.191162109375, 0.1719970703125, 0.24658203125, 0.1837158203125, 0.1490478515625, 0.041778564453125, 0.13671875, 0.212158203125, 0.1888427734375, 0.1688232421875, 0.0208587646484375, 0.177734375, 0.1600341796875, 0.09454345703125, 0.167724609375,...

embed

30156681_c0

30156681

haskell

0

Title: How to implement recursive function? Problem title: How to implement recursive function? Tags: haskell, ghc Problem: How to implement recursive function? Below defines an Algebraic Data Type IntList : data IntList = Empty | Cons Int IntList The function intListProd computes the product of IntList type : intListP...

How to implement recursive function? How to implement recursive function? haskell ghc How IntList Empty Cons Main How to implement recursive function? Below defines an Algebraic Data Type IntList : The function intListProd computes the product of IntList type : But I'm unsure how to create IntList type. I've tried : Bu...

[ -0.00970458984375, 0.004119873046875, 0.01116943359375, 0.0279541015625, -0.0279541015625, 0.016357421875, -0.002960205078125, -0.0027618408203125, -0.0172119140625, -0.0003147125244140625, 0.0177001953125, -0.013427734375, -0.00726318359375, 0.0203857421875, 0.016845703125, -0.0029602...

[ 11249, 47, 29479, 195625, 5844, 32354, 1556, 142508, 31380, 238, 360, 18, 154663, 31678, 939, 39215, 17336, 61924, 429, 2844, 11809, 60457, 23, 10752, 71, 7077, 12996, 10644, 51646, 3642, 28282, 37842, 23253 ]

[ 0.0621337890625, 0.06146240234375, 0.2059326171875, 0.23486328125, 0.203369140625, 0.20361328125, 0.07769775390625, 0.1842041015625, 0.051300048828125, 0.045928955078125, 0.08782958984375, 0.117919921875, 0.261474609375, 0.158447265625, 0.1068115234375, 0.1519775390625, 0.04644775390...

embed

30924448_c3

30924448

haskell

3

8.0.0, vm001, Downloads, github.com, ghcjs-jquery.git, Cloning, Counting, Total, Receiving, KiB, Resolving, Checking, Cabal-1.22.3.0, cabal-install-1.22.3.0.tar.gz, node-v0.12.4.tar.gz, Cabal-1.22.3.0.tar.gz, ghc-7.10.1, regex-tdfa-text-1.0.0.3, cabal-install-1.22.3.0, ghc-7.10.1-x86_64-unknown-linux-deb7.tar.bz2, node...

[ -0.0078125, 0.010498046875, 0.01806640625, 0.010009765625, 0.027099609375, 0.00074005126953125, -0.024658203125, 0.0172119140625, 0.0002880096435546875, 0.031494140625, -0.023193359375, -0.044189453125, -0.000476837158203125, 0.011962890625, -0.0203857421875, 0.0184326171875, 0.00860...

[ 3217, 99929, 4, 81, 39, 34479, 4857, 62270, 32102, 277, 31380, 238, 28175, 9, 170, 944, 1294, 15769, 51053, 592, 1311, 128396, 33867, 93908, 6496, 1519, 571, 132944, 38679, 30438, 289, 5759, 5, 4015, 132265, 109524, 80383, 867, 110, 112, ...

[ 0.2044677734375, 0.228515625, 0.044586181640625, 0.153564453125, 0.11376953125, 0.23486328125, 0.1728515625, 0.1180419921875, 0.161865234375, 0.06097412109375, 0.12939453125, 0.1348876953125, 0.255615234375, 0.0226593017578125, 0.116943359375, 0.1824951171875, 0.175048828125, 0.202...

embed

32303377_c0

32303377

haskell

0

Title: What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? Problem title: What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? Tags: haskell-stack, haskell Problem: What's the difference between `stack i...

What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? What's the difference between `stack install NAME` and `NAME` in the build-depends of project.cabal file? haskell-stack haskell What NAME project.cabal package_name What's the difference between `stack in...

[ 0.0093994140625, -0.00003886222839355469, 0.004425048828125, 0.0302734375, -0.0172119140625, 0.01495361328125, -0.0128173828125, 0.005096435546875, 0.0142822265625, 0.024658203125, 0.03466796875, -0.0264892578125, 0.005279541015625, 0.020751953125, -0.006561279296875, 0.0091552734375, ...

[ 3768, 60212, 17721, 590, 2594, 20600, 182512, 136, 45367, 105254, 7, 13452, 408, 3571, 11435, 1556, 142508, 98169, 11627, 70, 154107, 1379, 40059, 119475, 177261, 28032, 14364 ]

[ 0.017608642578125, 0.1761474609375, 0.09246826171875, 0.12451171875, 0.16357421875, 0.1744384765625, 0.20654296875, 0.07440185546875, 0.1016845703125, 0.1702880859375, 0.03558349609375, 0.158447265625, 0.1007080078125, 0.1903076171875, 0.10595703125, 0.0762939453125, 0.1866455078125,...

embed

57523360_c2

57523360

haskell

2

. a008284_tabl :: [[Int]] a008284_tabl = [1] : f [[1]] where f xss = ys : f (ys : xss) where ys = map sum (zipWith take [1..] xss) ++ [1] _P :: Int -> Int -> Int _P m n = sum (concatMap (take (min m n)) (take m a008284_tabl)) dico' :: Int -> Int -> Seq (Maybe Int) dico' m n = go 1 S.empty where pmn = Just $ Just $ _P m...

[ -0.003631591796875, 0.0274658203125, -0.001129150390625, 0.00787353515625, -0.028076171875, -0.003265380859375, 0.02001953125, 0.0196533203125, 0.0240478515625, -0.00133514404296875, -0.0014801025390625, 0.0242919921875, -0.01409912109375, 0.02783203125, 0.004791259765625, 0.009765625,...

[ 6, 5, 10, 155720, 3882, 617, 454, 102, 9030, 1984, 110558, 4153, 18, 86245, 2203, 17550, 152, 1238, 25256, 7440, 1022, 7, 113, 4778, 22288, 10554, 50836, 194583, 5646, 68252, 37223, 683, 360, 347, 653, 2271, 4460, 166179, 78219, 1249, 8...

[ 0.0096435546875, 0.078369140625, 0.18115234375, 0.235595703125, 0.2423095703125, 0.236328125, 0.05059814453125, 0.2135009765625, 0.25048828125, 0.115966796875, 0.00830078125, 0.1279296875, 0.1590576171875, 0.0238800048828125, 0.11865234375, 0.08709716796875, 0.03448486328125, 0.171...

embed

59190195_c0

59190195

haskell

0

Title: How to create a list of list of numbers in Haskell Problem title: How to create a list of list of numbers in Haskell Tags: haskell Problem: How to create a list of list of numbers in Haskell I need to create a function that makes a board of size row and column and then populate that with zeros. mkBoard 2 3 would...

How to create a list of list of numbers in Haskell How to create a list of list of numbers in Haskell haskell How Haskell How to create a list of list of numbers in Haskell I need to create a function that makes a board of size row and column and then populate that with zeros. mkBoard 2 3 would make [[0,0,0],[0,0,0]] I...

[ 0.0159912109375, -0.00127410888671875, 0.0014190673828125, -0.00151824951171875, 0.006195068359375, -0.00592041015625, 0.002105712890625, 0.0015869140625, 0.004486083984375, -0.01025390625, -0.01287841796875, -0.035400390625, 0.026123046875, 0.00433349609375, -0.02490234375, -0.0005836...

[ 11249, 28282, 5303, 111, 101935, 23, 20625, 142508, 47, 10, 1556, 87, 3871, 32354, 30482, 45443, 13267, 15555, 136, 3365, 316, 27623, 678, 45234, 19201, 12647, 5861, 116, 138, 2806, 3249, 2389, 63527, 3714, 4034, 3525, 56037, 47644, 1884, ...

[ 0.053619384765625, 0.1798095703125, 0.2103271484375, 0.10089111328125, 0.21435546875, 0.06170654296875, 0.1585693359375, 0.2384033203125, 0.0191192626953125, 0.01177978515625, 0.150146484375, 0.024139404296875, 0.062255859375, 0.15966796875, 0.0625, 0.19482421875, 0.1141357421875, ...

embed

38703424_c0

38703424

haskell

0

Title: How does getLine work in haskell? Problem title: How does getLine work in haskell? Tags: io, functional-programming, haskell, getline Problem: How does getLine work in haskell? Looking at the definition of getLine in the Haskell Prelude , I get how the recursion works, where you keep asking for a character until...

How does getLine work in haskell? How does getLine work in haskell? io functional-programming haskell getline How c:....:return How does getLine work in haskell? Looking at the definition of getLine in the Haskell Prelude , I get how the recursion works, where you keep asking for a character until you hit a newline and...

[ -0.00060272216796875, 0.00148773193359375, 0.0118408203125, 0.01611328125, 0.00897216796875, 0.0162353515625, 0.019287109375, -0.00958251953125, 0.006378173828125, -0.00927734375, 0.017578125, -0.040771484375, 0.009033203125, 0.0164794921875, -0.000293731689453125, 0.0032501220703125, ...

[ 11249, 14602, 2046, 93232, 4488, 23, 1556, 142508, 22995, 123309, 28966, 2256, 501, 12, 5, 27, 65395, 19, 80934, 20625, 1914, 822, 112, 3642, 195625, 1830, 43240, 13695, 113292, 62816, 24189, 5962, 3525, 45367, 5303, 30646, 137565, 17780, 6...

[ 0.082763671875, 0.03515625, 0.1700439453125, 0.270263671875, 0.134765625, 0.062744140625, 0.1435546875, 0.217529296875, 0.126708984375, 0.1014404296875, 0.043701171875, 0.2186279296875, 0.03106689453125, 0.0843505859375, 0.015594482421875, 0.0802001953125, 0.218505859375, 0.0417785...

embed

74858044_c0

74858044

haskell

0

Title: Attempting to run Haskell File on GHC error Problem title: Attempting to run Haskell File on GHC error Tags: haskell Problem: Attempting to run Haskell File on GHC error When attempting to load Haskell file test.hs into terminal. I get this response: <interactive>:5:1: error: Variable not in scope: test :: b0 ->...

Attempting to run Haskell File on GHC error Attempting to run Haskell File on GHC error haskell Attempting Haskell File GHC Variable Attempting to run Haskell File on GHC error When attempting to load Haskell file test.hs into terminal. I get this response: This is the code from test.hs: How do I get the file to load i...

[ 0.00186920166015625, -0.000629425048828125, 0.0096435546875, 0.006439208984375, 0.015625, 0.0133056640625, -0.0072021484375, 0.00653076171875, -0.01171875, 0.006011962890625, -0.01007080078125, -0.0299072265625, -0.012939453125, -0.004913330078125, 0.01507568359375, 0.007537841796875, ...

[ 1913, 34224, 1916, 11675, 20625, 142508, 42724, 98, 527, 73265, 18499, 47, 1556, 84572, 81887, 214, 72367, 11435, 3034, 5, 127, 7, 3934, 33949, 57553, 3293, 83, 70, 18151, 1295, 11249, 2046, 23, 9803, 508, 17378, 6713, 209806, 3871, 24927...

[ 0.0225372314453125, 0.12939453125, 0.03167724609375, 0.10357666015625, 0.1527099609375, 0.24853515625, 0.134521484375, 0.091796875, 0.06500244140625, 0.1719970703125, 0.1412353515625, 0.06103515625, 0.1256103515625, 0.1287841796875, 0.1177978515625, 0.010467529296875, 0.161376953125,...

embed

75611110_c0

75611110

haskell

0

Title: Explanation on this haskell code which takes a list of uncurried elements and curries them Problem title: Explanation on this haskell code which takes a list of uncurried elements and curries them Tags: currying, haskell Problem: Explanation on this haskell code which takes a list of uncurried elements and curri...

Explanation on this haskell code which takes a list of uncurried elements and curries them Explanation on this haskell code which takes a list of uncurried elements and curries them currying haskell Explanation Explanation on this haskell code which takes a list of uncurried elements and curries them I am trying to ana...

[ -0.002532958984375, -0.00628662109375, 0.01202392578125, -0.00518798828125, -0.000949859619140625, 0.006927490234375, -0.0017852783203125, -0.0186767578125, 0.0042724609375, -0.017578125, 0.00026702880859375, -0.031494140625, 0.00897216796875, 0.0031585693359375, -0.0203857421875, -0.0...

[ 5443, 5868, 2320, 98, 903, 1556, 142508, 18151, 3129, 51776, 5303, 51, 16820, 46572, 80854, 9709, 10484, 136, 198555, 214, 2856, 7968, 16031, 149201, 77947, 154663, 33079, 104, 441, 474, 2203, 3650, 64240, 53, 425, 113, 152 ]

[ 0.041015625, 0.1412353515625, 0.0528564453125, 0.009857177734375, 0.0936279296875, 0.121826171875, 0.19287109375, 0.1507568359375, 0.010162353515625, 0.07470703125, 0.1341552734375, 0.129638671875, 0.1142578125, 0.2059326171875, 0.17431640625, 0.1533203125, 0.156005859375, 0.018249...

embed

32814305_c0

32814305

haskell

0

Title: Group a list of tuples by their 1st element Problem title: Group a list of tuples by their 1st element Tags: tuples, list, grouping, haskell Problem: Group a list of tuples by their 1st element Say I have a tuple list that consists of [("ab", 1), ("ab", 2), ("ac", 3)] Using the group function would split this li...

Group a list of tuples by their 1st element Group a list of tuples by their 1st element tuples list grouping haskell Group Group a list of tuples by their 1st element Say I have a tuple list that consists of [("ab", 1), ("ab", 2), ("ac", 3)] Using the group function would split this list into a list of lists of tuples ...

[ 0.021484375, 0.00089263916015625, -0.00982666015625, 0.0011444091796875, -0.01373291015625, -0.00311279296875, -0.0135498046875, -0.005035400390625, 0.02734375, -0.01007080078125, -0.0155029296875, 0.0108642578125, -0.00653076171875, 0.016357421875, -0.01507568359375, 0.014892578125, ...

[ 10760, 5303, 370, 99726, 390, 2363, 106, 271, 12830, 111, 21115, 1556, 142508, 765, 8705, 58055, 2055, 4879, 4958, 2263, 8439, 345, 32354, 2806, 65450, 3934, 11249, 47438, 214, 1632, 136044, 37769, 35509, 80854, 75358, 44841 ]

[ 0.274169921875, 0.1884765625, 0.1529541015625, 0.254150390625, 0.1248779296875, 0.044097900390625, 0.0723876953125, 0.0968017578125, 0.186279296875, 0.0513916015625, 0.24462890625, 0.1151123046875, 0.23046875, 0.002960205078125, 0.2132568359375, 0.0684814453125, 0.1280517578125, 0....

embed

13057028_c0

13057028

haskell

0

Title: How can this function be written using foldr? Problem title: How can this function be written using foldr? Tags: fold, higher-order-functions, haskell, functional-programming, recursion Problem: How can this function be written using foldr? I have this simple function which returns a list of pairs with the adjac...

How can this function be written using foldr? How can this function be written using foldr? fold higher-order-functions haskell functional-programming recursion foldr How x:y:xs y:xs x:xs How can this function be written using foldr? I have this simple function which returns a list of pairs with the adjacents elements ...

[ -0.0184326171875, 0.0015411376953125, -0.0181884765625, 0.01007080078125, -0.01531982421875, 0.02587890625, -0.015625, 0.00537109375, 0.002166748046875, -0.0478515625, 0.0009918212890625, -0.017333984375, -0.015869140625, -0.0029449462890625, 0.006439208984375, 0.00555419921875, -0.0...

[ 11249, 831, 903, 32354, 186, 59121, 17368, 18344, 7569, 42822, 77546, 80596, 137175, 1556, 142508, 123309, 28966, 195625, 1022, 12, 53, 425, 7, 113, 8781, 30646, 5303, 80836, 678, 123594, 16797, 80854, 44402, 31577, 33022, 5122, 16940 ]

[ 0.1123046875, 0.084228515625, 0.1007080078125, 0.1959228515625, 0.05389404296875, 0.16845703125, 0.132080078125, 0.151611328125, 0.24169921875, 0.22314453125, 0.039886474609375, 0.123779296875, 0.1253662109375, 0.07257080078125, 0.182861328125, 0.0916748046875, 0.046173095703125, 0...

embed

37102919_c0

37102919

haskell

0

Title: error in patternmatching in Haskell Problem title: error in patternmatching in Haskell Tags: pattern-matching, haskell, parse-error Problem: error in patternmatching in Haskell I am writing a function that maps lists of lists of bools invectively into lists of bools. This is my code: y=[False| y<-[0..]] encode :...

error in patternmatching in Haskell error in patternmatching in Haskell pattern-matching haskell parse-error Haskell Bool x:xs zip1 True:True error in patternmatching in Haskell I am writing a function that maps lists of lists of bools invectively into lists of bools. This is my code: The zip1 function just takes two l...

[ 0.000766754150390625, 0.0169677734375, -0.0078125, 0.01953125, -0.007415771484375, 0.01300048828125, -0.0238037109375, 0.01318359375, -0.0035247802734375, -0.00022983551025390625, 0.01165771484375, -0.009765625, 0.0078125, -0.00714111328125, 0.0164794921875, 0.013916015625, 0.0078125...

[ 18499, 23, 103510, 98753, 214, 20625, 142508, 1556, 366, 184, 188800, 2460, 929, 1022, 425, 7, 68330, 418, 87599, 882, 32562, 32354, 22288, 5303, 111, 142484, 334, 100034, 3934, 18151, 1660, 51776, 6626, 33022, 75939, 3525, 20949, 26008, 44...

[ 0.1964111328125, 0.1016845703125, 0.2281494140625, 0.2763671875, 0.1104736328125, 0.1453857421875, 0.2247314453125, 0.142578125, 0.080078125, 0.08819580078125, 0.1612548828125, 0.0589599609375, 0.1290283203125, 0.068603515625, 0.090087890625, 0.03192138671875, 0.212646484375, 0.126...

embed

3710991_c0

3710991

haskell

0

Title: Convert a "do" notation with more than two actions to use the bind function Problem title: Convert a "do" notation with more than two actions to use the bind function Tags: monads, haskell, ghc Problem: Convert a "do" notation with more than two actions to use the bind function I know that th...

Convert a "do" notation with more than two actions to use the bind function Convert a "do" notation with more than two actions to use the bind function monads haskell ghc Convert line1 line2 Convert a "do" notation with more than two actions to use the bind function I know that the following "do" no...

[ -0.0230712890625, 0.00518798828125, -0.00762939453125, 0.021728515625, -0.006195068359375, 0.03466796875, -0.00872802734375, 0.00408935546875, 0.027587890625, -0.0184326171875, -0.01348876953125, -0.0184326171875, -0.0159912109375, 0.01373291015625, -0.006622314453125, 0.01806640625, ...

[ 1657, 11549, 246, 41502, 110, 22062, 678, 1286, 3501, 6626, 61972, 4527, 68557, 32354, 2667, 712, 1556, 142508, 31380, 238, 13315, 418, 304, 25632, 89817, 183234, 2046, 93232, 6396, 41872, 2256, 3884, 71713, 866, 19, 3642 ]

[ 0.0191192626953125, 0.1556396484375, 0.193115234375, 0.035888671875, 0.1607666015625, 0.1331787109375, 0.0260467529296875, 0.0692138671875, 0.050079345703125, 0.1029052734375, 0.1641845703125, 0.060638427734375, 0.2445068359375, 0.16796875, 0.03314208984375, 0.0543212890625, 0.065917...

embed

53517200_c0

53517200

haskell

0

Title: Confused by converting WHNF to NF in Haskell Problem title: Confused by converting WHNF to NF in Haskell Tags: haskell, weak-head-normal-form Problem: Confused by converting WHNF to NF in Haskell In a simple example, converting WHNF to NF by printing works fine Prelude> let x = 1 + 2 :: Int Prelude> :sprint x x ...

Confused by converting WHNF to NF in Haskell Confused by converting WHNF to NF in Haskell haskell weak-head-normal-form Confused WHNF Haskell Prelude Confused by converting WHNF to NF in Haskell In a simple example, converting WHNF to NF by printing works fine But in a case, the type is not declared it doesn't work. Ca...

[ 0.0034942626953125, 0.004547119140625, -0.00714111328125, 0.00604248046875, -0.021240234375, 0.01171875, -0.0084228515625, 0.000698089599609375, -0.0052490234375, 0.01385498046875, -0.00994873046875, -0.01519775390625, -0.006500244140625, 0.024169921875, -0.00897216796875, -0.015258789...

[ 106161, 33740, 96760, 601, 841, 73493, 47, 20625, 142508, 1556, 642, 344, 31251, 33176, 5037, 822, 8781, 27781, 2448, 1916, 43240, 5885, 10644, 959, 159978, 22027, 18, 4488, 73342, 142477, 4568 ]

[ 0.10504150390625, 0.031494140625, 0.1165771484375, 0.0714111328125, 0.1187744140625, 0.2509765625, 0.060333251953125, 0.0992431640625, 0.2110595703125, 0.0792236328125, 0.10235595703125, 0.1015625, 0.147216796875, 0.1114501953125, 0.1329345703125, 0.036102294921875, 0.00604248046875,...

embed

74385460_c1

74385460

haskell

1

) . out -- Anamorphism type Coalgebra f a = a -> f a ana :: (Functor f) => Coalgebra f a -> a -> Fix f ana f = In . fmap (ana f) . f The approach mentioned in this post ( https://stackoverflow.com/a/56012344 ) for writing recursion schemes that go from Int -> Int, is to write a hylomorphism where the anamorphism sort o...

[ -0.0123291015625, -0.010009765625, -0.000039577484130859375, 0.0262451171875, 0.01373291015625, -0.005584716796875, -0.0003757476806640625, -0.01953125, 0.01361083984375, -0.03125, -0.01141357421875, -0.033447265625, 0.00726318359375, 0.033203125, 0.01611328125, -0.04150390625, -0.00...

[ 5, 1810, 5710, 178851, 8780, 10644, 1311, 289, 429, 2844, 1238, 10, 2203, 33079, 3877, 97249, 18770, 96746, 360, 62346, 1500, 51515, 119056, 1305, 118664, 32562, 195625, 1830, 150370, 738, 1295, 18, 33022, 2119, 365, 45367, 11782, 177261, 6...

[ 0.021484375, 0.1712646484375, 0.1531982421875, 0.2464599609375, 0.1337890625, 0.1441650390625, 0.0921630859375, 0.0980224609375, 0.122314453125, 0.103759765625, 0.1312255859375, 0.1170654296875, 0.042022705078125, 0.1585693359375, 0.21923828125, 0.1142578125, 0.1492919921875, 0.202...

embed

42047831_c0

42047831

haskell

0

Title: Getting the cabal version of a GHC compiled program? Problem title: Getting the cabal version of a GHC compiled program? Tags: haskell, cabal Problem: Getting the cabal version of a GHC compiled program? If I compile an executable using GHC's cabal build , is there a way to get the version number as stated in th...

Getting the cabal version of a GHC compiled program? Getting the cabal version of a GHC compiled program? haskell cabal System.Environment Getting GHC Getting the cabal version of a GHC compiled program? If I compile an executable using GHC's cabal build , is there a way to get the version number as stated in the proje...

[ 0.00787353515625, 0.004913330078125, 0.004058837890625, 0.0167236328125, 0, 0.0032958984375, -0.0198974609375, 0.033447265625, -0.01214599609375, -0.0247802734375, -0.0157470703125, -0.02880859375, -0.0106201171875, -0.0089111328125, -0.0002841949462890625, 0.019287109375, -0.0097656...

[ 210732, 109524, 11389, 527, 73265, 375, 5974, 1528, 70, 1556, 142508, 12353, 686, 1900, 9969, 1340, 71924, 2886, 45367, 3917, 2046, 14012, 11341, 13452, 5, 408, 3571, 11435, 1295, 46132, 5201, 32354, 9351, 21373, 10752, 15896, 5983 ]

[ 0.1075439453125, 0.2373046875, 0.2271728515625, 0.07537841796875, 0.1849365234375, 0.0173492431640625, 0.09051513671875, 0.1527099609375, 0.00726318359375, 0.08551025390625, 0.1875, 0.0966796875, 0.020782470703125, 0.03839111328125, 0.0911865234375, 0.05010986328125, 0.1051025390625,...

embed

47374082_c2

47374082

haskell

2

Process/Read.hs:306:3) 2017-11-19 12:25:05.796327: [debug] Run process: /usr/bin/gcc -v @(System/Process/Read.hs:306:3) 2017-11-19 12:25:05.799566: [debug] Process finished in [92m3ms[0m: /usr/bin/gcc -v @(System/Process/Read.hs:306:3) 2017-11-19 12:25:05.799710: [debug] PIE enabled @(Stack/Setup.hs:583:17) 2017-11-19 ...

[ -0.011474609375, -0.01385498046875, 0.004669189453125, 0.006927490234375, -0.004058837890625, 0.0012054443359375, -0.0272216796875, -0.005828857421875, -0.0179443359375, 0.004058837890625, -0.00750732421875, -0.00445556640625, -0.00439453125, 0.002410888671875, 0.0130615234375, 0.01293...

[ 123996, 31345, 127, 7, 1197, 910, 21320, 505, 36099, 2947, 427, 21224, 22377, 15748, 3768, 112, 85779, 28398, 9433, 223, 42, 7568, 177, 10060, 20, 334, 1374, 84293, 10752, 26531, 5, 163712, 186225, 122799, 23, 12231, 39, 363, 4432, 963, ...

[ 0.2001953125, 0.2362060546875, 0.119140625, 0.1151123046875, 0.06280517578125, 0.1259765625, 0.1270751953125, 0.110595703125, 0.0863037109375, 0.04730224609375, 0.007293701171875, 0.063720703125, 0.039337158203125, 0.03948974609375, 0.0980224609375, 0.02752685546875, 0.1640625, 0.1...

embed

60159403_c0

60159403

haskell

0

Title: Create List by multiplying object with [1..n] Problem title: Create List by multiplying object with [1..n] Tags: list, haskell Problem: Create List by multiplying object with [1..n] I am still not into Haskell and need a hint for the following function. I want to create a list by adding each multiplication of a ...

Create List by multiplying object with [1..n] Create List by multiplying object with [1..n] list haskell Create List Create List by multiplying object with [1..n] I am still not into Haskell and need a hint for the following function. I want to create a list by adding each multiplication of a pair: E.g. n = 3, pair (1,...

[ 0.0118408203125, 0.00848388671875, -0.005645751953125, 0.014404296875, 0.004425048828125, 0.01318359375, -0.0264892578125, 0.006927490234375, 0.022216796875, -0.018310546875, 0.0205078125, -0.031494140625, 0.01470947265625, 0.007659912109375, -0.028564453125, -0.003570556640625, 0.01...

[ 151313, 32036, 390, 6024, 62479, 36746, 678, 68252, 5, 19, 5303, 1556, 142508, 7464, 959, 3934, 20625, 3871, 5122, 18, 25632, 32354, 3444, 28282, 10, 154107, 12638, 127664, 1363, 111, 80836, 653, 2203, 138, 10461, 44357, 133063, 29557, 6896...

[ 0.1888427734375, 0.299072265625, 0.061767578125, 0.1611328125, 0.189697265625, 0.222412109375, 0.06915283203125, 0.1256103515625, 0.0523681640625, 0.12109375, 0.26318359375, 0.17138671875, 0.2425537109375, 0.007232666015625, 0.0214691162109375, 0.060302734375, 0.146240234375, 0.057...

embed

62475453_c0

62475453

haskell

0

Title: Applicative functors and records in purescript Problem title: Applicative functors and records in purescript Tags: purescript, haskell Problem: Applicative functors and records in purescript In Haskell, I'm used to doing stuff like this. data Foo = Foo { foo :: String, bar :: String } mFoo :: (Monad m) => m Stri...

Applicative functors and records in purescript Applicative functors and records in purescript purescript haskell Applicative Foo Monad Applicative functors and records in purescript In Haskell, I'm used to doing stuff like this. The same does not work in purescript, however. Is there a way to achieve the same outcome, ...

[ -0.01318359375, 0.007415771484375, -0.0068359375, 0.0299072265625, 0.007720947265625, 0.00927734375, 0.00860595703125, -0.0062255859375, -0.00078582763671875, -0.0269775390625, 0.01953125, -0.00579833984375, -0.004852294921875, 0.0196533203125, -0.00848388671875, -0.024169921875, 0.0...

[ 5659, 11048, 4935, 7477, 18770, 136, 115923, 34166, 32032, 1556, 142508, 9572, 31, 60331, 71, 20625, 11814, 959, 4488, 3917, 69307, 5701, 184345, 13695, 17164, 6002, 86531, 190358, 2878, 38415, 1829, 41816, 33976, 110527 ]

[ 0.1280517578125, 0.1785888671875, 0.1650390625, 0.164794921875, 0.1787109375, 0.0693359375, 0.2255859375, 0.1937255859375, 0.265625, 0.12548828125, 0.2205810546875, 0.1563720703125, 0.088623046875, 0.1517333984375, 0.08740234375, 0.1112060546875, 0.08099365234375, 0.020965576171875...

embed

34673374_c0

34673374

haskell

0

Title: Haskell saferead of file Problem title: Haskell saferead of file Tags: io, haskell Problem: Haskell saferead of file I am attempting to write a simple Haskell function that reads a files contents, if the file exists, and does nothing otherwise. safeRead :: String -> IO () safeRead path = readFile path `catch` ha...

Haskell saferead of file Haskell saferead of file io haskell isDoesNotExistError Haskell Haskell saferead of file I am attempting to write a simple Haskell function that reads a files contents, if the file exists, and does nothing otherwise. This, however, fails with: parse error (possibly incorrect indentation or mism...

[ -0.0024261474609375, 0.01544189453125, 0.01190185546875, -0.00860595703125, -0.00157928466796875, 0.00150299072265625, -0.00013256072998046875, -0.006011962890625, 0.00028228759765625, -0.0157470703125, 0.014892578125, -0.01470947265625, -0.017822265625, -0.021240234375, 0.036376953125, ...

[ 20625, 142508, 46002, 39116, 111, 11435, 22995, 1556, 83, 90, 122116, 19279, 1419, 18468, 81887, 33022, 8781, 32354, 12301, 102158, 10941, 2174, 70, 32316, 14602, 33720, 120262, 35782, 366, 184, 18499, 7522, 214552, 18597, 22062, 1239, 98753, ...

[ 0.1348876953125, 0.19921875, 0.184814453125, 0.2237548828125, 0.125732421875, 0.1571044921875, 0.158935546875, 0.1446533203125, 0.0869140625, 0.011932373046875, 0.095458984375, 0.1370849609375, 0.1383056640625, 0.0732421875, 0.04583740234375, 0.0318603515625, 0.05902099609375, 0.12...

embed

27398266_c0

27398266

haskell

0

Title: Taking a value from the Gen monad to the IO monad Problem title: Taking a value from the Gen monad to the IO monad Tags: quickcheck, monads, haskell Problem: Taking a value from the Gen monad to the IO monad I'm generating a minesweeper board and want to generate the board based on where the first click (actuall...

Taking a value from the Gen monad to the IO monad Taking a value from the Gen monad to the IO monad quickcheck monads haskell the Taking Gen Taking a value from the Gen monad to the IO monad I'm generating a minesweeper board and want to generate the board based on where the first click (actually not a click, just a st...

[ -0.018798828125, -0.0150146484375, -0.00897216796875, -0.0019378662109375, -0.0101318359375, 0.00909423828125, 0.004547119140625, -0.011962890625, 0.0045166015625, -0.038818359375, 0.0081787109375, 0.006378173828125, 0.01531982421875, -0.0031280517578125, 0.01025390625, -0.01171875, ...

[ 2561, 214, 34292, 1295, 15937, 2667, 712, 47, 17780, 10, 63773, 78292, 1556, 142508, 12663, 5665, 7, 1177, 13, 1264, 45443, 3444, 139392, 35509, 7440, 5117, 18158, 112302, 79315, 59121, 1827, 71, 33636, 16940, 2967, 21208, 765, 17664, 136, ...

[ 0.170654296875, 0.105224609375, 0.1971435546875, 0.087646484375, 0.249267578125, 0.1385498046875, 0.1722412109375, 0.1513671875, 0.25830078125, 0.1949462890625, 0.1175537109375, 0.2353515625, 0.09521484375, 0.2200927734375, 0.1116943359375, 0.1673583984375, 0.05865478515625, 0.1453...

embed

74888599_c1

74888599

haskell

1

Test.Tasty.Patterns.Parser Error S-8506 Directory Glorious Glasgow Haskell Compilation System How do I install and run Test.Tasty.Patterns I want to use the following for testing the ReadP Monad Parser. https://hackage.haskell.org/package/tasty-1.4.3/docs/Test-Tasty-Patterns-Parser.html . How can I install it correctl...

[ -0.01043701171875, 0.019775390625, 0.013916015625, 0.00958251953125, -0.021484375, 0.01165771484375, -0.01123046875, -0.0186767578125, 0.005950927734375, -0.014404296875, 0.005462646484375, -0.012451171875, 0.01165771484375, -0.0177001953125, 0.021484375, 0.0167236328125, -0.00665283...

[ 8647, 9874, 8946, 8335, 3055, 1779, 28636, 2189, 212059, 159, 109189, 910, 31068, 46173, 93905, 181787, 20625, 142508, 15612, 12353, 20600, 136, 11675, 5, 3444, 4527, 25632, 134234, 4764, 683, 60331, 71, 2392, 139509, 10557, 29102, 102, 91977...

[ 0.1690673828125, 0.19873046875, 0.236572265625, 0.1363525390625, 0.1414794921875, 0.10302734375, 0.1199951171875, 0.1474609375, 0.0860595703125, 0.026519775390625, 0.08038330078125, 0.0799560546875, 0.0219573974609375, 0.0283660888671875, 0.0806884765625, 0.1275634765625, 0.090454101...

embed

42471712_c0

42471712

haskell

0

Title: CreateGHCiProcess failed with failed with error 0: The operation completed successfully Problem title: CreateGHCiProcess failed with failed with error 0: The operation completed successfully Tags: haskell Problem: CreateGHCiProcess failed with failed with error 0: The operation completed successfully When I open...

CreateGHCiProcess failed with failed with error 0: The operation completed successfully CreateGHCiProcess failed with failed with error 0: The operation completed successfully haskell CreateGHCiProcess CreateGHCiProcess failed with failed with error 0: The operation completed successfully When I open WinGHCi the follow...

[ 0.00139617919921875, -0.0091552734375, -0.01385498046875, 0.010986328125, -0.0113525390625, 0.0021209716796875, 0.00799560546875, -0.018798828125, -0.0087890625, -0.00323486328125, -0.0017242431640625, -0.0255126953125, 0.006317138671875, 0.0034027099609375, 0.004302978515625, 0.012878...

[ 151313, 41877, 40658, 10752, 26531, 165523, 678, 18499, 757, 581, 41018, 140528, 65771, 1556, 142508, 87, 9803, 17686, 26008, 7426, 12, 3714, 30022, 903, 5117, 1733, 31577, 20625, 80383, 1528 ]

[ 0.2061767578125, 0.1903076171875, 0.2322998046875, 0.1331787109375, 0.15771484375, 0.2164306640625, 0.1160888671875, 0.1453857421875, 0.1767578125, 0.0784912109375, 0.204345703125, 0.219482421875, 0.1925048828125, 0.099609375, 0.225830078125, 0.009429931640625, 0.099609375, 0.10937...

embed

61342881_c0

61342881

haskell

0

Title: Haskell Define Data Type Problem title: Haskell Define Data Type Tags: haskell Problem: Haskell Define Data Type I trying to create a type class Place which has String Coord [Int] , and a testData to store all the element into a list data Place = Place String Coord [Int] deriving (Ord,Eq,Show,Read) data Coord = ...

Haskell Define Data Type Haskell Define Data Type haskell Haskell Define Data Type Place Coord Ord Show Read Cord Double London Cardiff Norwich Birmingham Liverpool Hull Newcastle Belfast Glasgow Plymouth Aberdeen Stornoway Lerwick Helier UP917725.hs:20:15 Couldn Integer Char Haskell Define Data Type I trying to create...

[ 0.001495361328125, 0.013427734375, -0.00628662109375, 0.00933837890625, 0.00726318359375, -0.0169677734375, 0.0277099609375, -0.004425048828125, -0.000431060791015625, 0.01531982421875, -0.00830078125, -0.043212890625, -0.000885009765625, -0.0218505859375, -0.0274658203125, 0.001121520...

[ 20625, 142508, 262, 64552, 11809, 60457, 1556, 41076, 1311, 6651, 35379, 17367, 4764, 134736, 107172, 9020, 3980, 152462, 12876, 69696, 188377, 39721, 46840, 188831, 12628, 39473, 181787, 538, 111443, 8592, 112, 33, 23604, 157, 7514, 44726, 932...

[ 0.1649169921875, 0.288818359375, 0.1314697265625, 0.2138671875, 0.18603515625, 0.27734375, 0.15283203125, 0.205810546875, 0.0848388671875, 0.18359375, 0.146240234375, 0.1544189453125, 0.1622314453125, 0.17138671875, 0.109619140625, 0.1622314453125, 0.0552978515625, 0.19140625, 0....

embed

12393088_c1

12393088

haskell

1

cat * | wc , but my instinct tells me that the file I/O should outweigh the CPU time needed by a good margin. Simply using cat * | wc processes about 20MB/s with a hot cache, but using my Haskell program (compiled with -O ) runs at less than 10MB/s, even after some basic optimization. Profiling tells me that most of t...

[ 0.0147705078125, -0.0291748046875, -0.0128173828125, -0.017822265625, -0.0185546875, -0.013427734375, 0.00592041015625, -0.033203125, 0.0128173828125, -0.0245361328125, 0.003387451171875, -0.0069580078125, 0.00799560546875, 0.0096435546875, -0.014404296875, -0.00058746337890625, -0.0...

[ 7515, 661, 58745, 92922, 1284, 218024, 14192, 11435, 87, 64, 670, 5608, 1810, 1177, 6958, 86039, 1733, 44841, 4127, 92142, 17368, 9433, 90, 387, 12689, 8010, 82365, 20625, 142508, 1528, 5974, 20, 127877, 99, 40715, 209, 62822, 87235, 58848,...

[ 0.2205810546875, 0.153076171875, 0.0867919921875, 0.227783203125, 0.0142364501953125, 0.1953125, 0.0190277099609375, 0.18017578125, 0.004302978515625, 0.1490478515625, 0.1552734375, 0.006683349609375, 0.0196380615234375, 0.02838134765625, 0.07733154296875, 0.170654296875, 0.100219726...

embed

35108630_c0

35108630

haskell

0

Title: How to query with `sqlite-simple` without having to specify a concrete return type? Problem title: How to query with `sqlite-simple` without having to specify a concrete return type? Tags: sqlite-simple, haskell, sqlite Problem: How to query with `sqlite-simple` without having to specify a concrete return type? ...

How to query with `sqlite-simple` without having to specify a concrete return type? How to query with `sqlite-simple` without having to specify a concrete return type? sqlite-simple haskell sqlite How query_ How to query with `sqlite-simple` without having to specify a concrete return type? Anyone knows if http://hacka...

[ 0.01092529296875, 0.005401611328125, 0.004119873046875, 0.0228271484375, -0.01129150390625, -0.0206298828125, -0.01007080078125, -0.0006561279296875, 0.01025390625, -0.0027008056640625, 0.017822265625, -0.06494140625, -0.01025390625, -0.002288818359375, -0.023193359375, 0.0065002441406...

[ 11249, 41, 1294, 678, 95255, 67, 191560, 15490, 40140, 122776, 30646, 10644, 7, 19441, 1556, 142508, 93002, 139509, 4588, 10557, 29102, 121254, 38331, 2389, 37382, 158897, 1486, 8859, 33209, 7693, 831, 11675, 15555, 28412, 143726, 48502, 370, ...

[ 0.023681640625, 0.132568359375, 0.1317138671875, 0.07861328125, 0.1917724609375, 0.1585693359375, 0.228759765625, 0.07745361328125, 0.0836181640625, 0.1688232421875, 0.1759033203125, 0.13916015625, 0.000701904296875, 0.03173828125, 0.0599365234375, 0.15380859375, 0.022369384765625, ...

embed

23232194_c0

23232194

haskell

0

Title: How does Haskell evaluate this function which undoes list intercalation? Problem title: How does Haskell evaluate this function which undoes list intercalation? Tags: equational-reasoning, haskell Problem: How does Haskell evaluate this function which undoes list intercalation? I'm trying to understand how Haske...

How does Haskell evaluate this function which undoes list intercalation? How does Haskell evaluate this function which undoes list intercalation? equational-reasoning haskell How Haskell x1:x2:xs x1:is x2:ps How does Haskell evaluate this function which undoes list intercalation? I'm trying to understand how Haskell ev...

[ -0.00885009765625, 0.0048828125, -0.0054931640625, 0.01336669921875, -0.0169677734375, 0.0240478515625, -0.0009307861328125, 0.01141357421875, 0.0004062652587890625, 0.0201416015625, -0.00946044921875, 0.004302978515625, 0.017333984375, 0.02783203125, -0.01007080078125, -0.014099121093...

[ 11249, 20625, 142508, 151575, 13, 903, 32354, 165, 31, 90, 5303, 1940, 6827, 2320, 13722, 43315, 1681, 1556, 1022, 82825, 425, 304, 7, 164, 12, 6423, 3129, 28219, 3642, 28, 27494, 1636, 25040, 68252, 116, 138, 201, 190, 2046, 418, 7440,...

[ 0.057037353515625, 0.149169921875, 0.2509765625, 0.170654296875, 0.0498046875, 0.0804443359375, 0.177734375, 0.1632080078125, 0.1549072265625, 0.098388671875, 0.1971435546875, 0.1424560546875, 0.18115234375, 0.04119873046875, 0.0914306640625, 0.014862060546875, 0.049530029296875, 0...

embed

21094784_c0

21094784

haskell

0

Title: Point authRoute directly to google auth Problem title: Point authRoute directly to google auth Tags: haskell, yesod Problem: Point authRoute directly to google auth Since I'm only using google auth anyways, I would like to get rid of the login screen seeing as it's quite superfluous to have a page with just a go...

Point authRoute directly to google auth Point authRoute directly to google auth haskell yesod Point Just AuthR LoginR Point authRoute directly to google auth Since I'm only using google auth anyways, I would like to get rid of the login screen seeing as it's quite superfluous to have a page with just a google button on...

[ 0.00933837890625, 0.016845703125, 0.0035858154296875, -0.0247802734375, -0.016845703125, 0.002044677734375, -0.003997802734375, 0.0037841796875, 0.01116943359375, -0.032958984375, 0.0189208984375, -0.039306640625, -0.0181884765625, 0.0230712890625, -0.00860595703125, 0.006256103515625,...

[ 41097, 531, 927, 12724, 6743, 105237, 47, 26484, 1556, 142508, 2422, 23722, 9563, 5655, 1052, 122986, 4734, 17368, 109954, 1884, 2046, 31351, 70, 73655, 49119, 18026, 10, 9191, 77679, 98, 3917, 7722, 5423, 6275, 64457, 111, 3650, 8781, 8190...

[ 0.203857421875, 0.2080078125, 0.181884765625, 0.1837158203125, 0.162841796875, 0.18310546875, 0.14404296875, 0.190185546875, 0.14111328125, 0.2119140625, 0.1412353515625, 0.1865234375, 0.126953125, 0.1871337890625, 0.1624755859375, 0.1705322265625, 0.0273590087890625, 0.04495239257...

embed

70380927_c0

70380927

haskell

0

Title: Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? Problem title: Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? Tags: haskell, windows, visual-studio-code, visual-studio Problem: Why does VSC save my Haskell files as a .hsig and can i change ...

Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? haskell windows visual-studio-code visual-studio Why VSC Haskell Why does VSC save my Haskell files as a .hsig and can i change the deafault to .hs? We ...

[ 0.006134033203125, 0.01019287109375, 0.00848388671875, 0.009033203125, -0.00482177734375, -0.01300048828125, -0.0301513671875, 0.00836181640625, -0.00537109375, -0.00026702880859375, -0.02099609375, -0.0035247802734375, -0.0012359619140625, 0.0087890625, -0.00122833251953125, -0.001602...

[ 44084, 310, 14495, 30098, 20625, 142508, 102158, 237, 5, 127, 20561, 831, 15549, 8, 45895, 7136, 7, 47, 1556, 54825, 21176, 52629, 40899, 759, 10, 17, 168861, 1528, 40466, 18151, 11435, 41877, 17304, 18, 9969, 1340, 765, 442, 3535, 11907,...

[ 0.0889892578125, 0.169189453125, 0.2210693359375, 0.13427734375, 0.154296875, 0.261962890625, 0.166259765625, 0.04290771484375, 0.0509033203125, 0.12109375, 0.24658203125, 0.0701904296875, 0.1395263671875, 0.1103515625, 0.129638671875, 0.12890625, 0.10174560546875, 0.03448486328125...

embed

9824671_c0

9824671

haskell

0

Title: Haskell class Num not contained in Ord? Problem title: Haskell class Num not contained in Ord? Tags: haskell Problem: Haskell class Num not contained in Ord? I was reading LYAH and read that the Num class isn't a subset of Ord. This means that there is a Num type which is not a member of Ord, what could constitu...

Haskell class Num not contained in Ord? Haskell class Num not contained in Ord? haskell Haskell Num Ord Haskell class Num not contained in Ord? I was reading LYAH and read that the Num class isn't a subset of Ord. This means that there is a Num type which is not a member of Ord, what could constitute such a type? Thank...

[ -0.00213623046875, -0.0021514892578125, 0.01556396484375, 0.0004291534423828125, -0.00830078125, 0.033935546875, -0.005523681640625, -0.0263671875, 0.0023193359375, 0.0264892578125, -0.01953125, -0.04638671875, 0.00323486328125, -0.02197265625, -0.0218505859375, -0.0126953125, -0.015...

[ 20625, 142508, 18507, 52782, 959, 70541, 297, 23, 35379, 32, 1556, 339, 192583, 56112, 18, 1614, 3509, 10644, 32786, 5809, 11764 ]

[ 0.1312255859375, 0.2275390625, 0.1868896484375, 0.2369384765625, 0.128173828125, 0.1492919921875, 0.03509521484375, 0.0684814453125, 0.2178955078125, 0.003631591796875, 0.106689453125, 0.00335693359375, 0.117431640625, 0.053253173828125, 0.0654296875, 0.0771484375, 0.07879638671875, ...

embed