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
33454145_c0	33454145	haskell	0	Title: How to change an element in [String] in Haskell? Problem title: How to change an element in [String] in Haskell? Tags: haskell Problem: How to change an element in [String] in Haskell? I'm working on a program that receives as input a board game as follows: ##### #_ ## # ## # # # .# ##### 1 4 (player initial pos...	How to change an element in [String] in Haskell? How to change an element in [String] in Haskell? haskell How Haskell How to change an element in [String] in Haskell? I'm working on a program that receives as input a board game as follows: After receiving the input, the program transforms it to a [String]. This case, i...	[ -0.01055908203125, 0.00225830078125, -0.0002765655517578125, 0.003936767578125, 0.013427734375, -0.0047607421875, 0.003021240234375, 0.00970458984375, 0.01361083984375, 0.04052734375, 0.0213623046875, -0.000762939453125, 0.0098876953125, 0.00347900390625, -0.037353515625, -0.0134887695...	[ 11249, 47, 15549, 12830, 23, 71713, 214, 20625, 142508, 32, 1556, 142, 378, 20697, 1528, 53299, 237, 107730, 45443, 6712, 24372, 217063, 27198, 10, 187284, 454, 173894, 468, 201, 831, 17203, 19069, 163324, 31, 28670, 30646, 61475, 5303, 167...	[ 0.109375, 0.08740234375, 0.253662109375, 0.2188720703125, 0.114501953125, 0.1966552734375, 0.1224365234375, 0.146240234375, 0.243896484375, 0.0050048828125, 0.1348876953125, 0.030670166015625, 0.004241943359375, 0.03717041015625, 0.1005859375, 0.040191650390625, 0.019500732421875, ...	embed
28829976_c0	28829976	haskell	0	Title: FFI and static libraries used in application Problem title: FFI and static libraries used in application Tags: crash, ffi, haskell, static-libraries Problem: FFI and static libraries used in application I wrote a Haskell library that links against a C library – a static one. Compilation is done perfectly, and ca...	FFI and static libraries used in application FFI and static libraries used in application crash ffi haskell static-libraries FFI FFI and static libraries used in application I wrote a Haskell library that links against a C library – a static one. Compilation is done perfectly, and cabal repl gives me access to the func...	[ 0.0079345703125, -0.01300048828125, 0.0225830078125, 0.0022430419921875, -0.0205078125, -0.0087890625, -0.006011962890625, -0.0002956390380859375, -0.00131988525390625, -0.033447265625, -0.00193023681640625, -0.0478515625, 0.006561279296875, 0.039306640625, 0.0303955078125, -0.00988769...	[ 563, 22724, 136, 201939, 35773, 10484, 11814, 38415, 150631, 24500, 1556, 142508, 150, 2844, 54397, 20625, 1294, 22317, 26548, 313, 15612, 16940, 169123, 109524, 456, 2424, 17203, 32354, 76242, 25474, 20600, 19096, 11728, 111, 32562, 11675, 442...	[ 0.09783935546875, 0.2481689453125, 0.041107177734375, 0.1976318359375, 0.2259521484375, 0.1026611328125, 0.0867919921875, 0.1629638671875, 0.206787109375, 0.207275390625, 0.1309814453125, 0.2340087890625, 0.117919921875, 0.1739501953125, 0.06201171875, 0.1170654296875, 0.099365234375...	embed
42684129_c0	42684129	haskell	0	Title: Disable "Segmentation fault/access violation in generated code"? Problem title: Disable "Segmentation fault/access violation in generated code"? Tags: haskell, ghc, ffi Problem: Disable "Segmentation fault/access violation in generated code"? We're using FFI to call potentially unsafe C funct...	Disable "Segmentation fault/access violation in generated code"? Disable "Segmentation fault/access violation in generated code"? haskell ghc ffi Disable Segmentation Disable "Segmentation fault/access violation in generated code"? We're using FFI to call potentially unsafe C functions. Sometimes bu...	[ 0.01055908203125, 0.006866455078125, 0.00421142578125, -0.0166015625, -0.000614166259765625, -0.004638671875, -0.0012664794921875, 0.006439208984375, -0.01068115234375, -0.022705078125, -0.01409912109375, 0.0040283203125, 0.023193359375, 0.0322265625, 0.0166015625, -0.00104522705078125...	[ 6206, 2886, 2507, 674, 2320, 193857, 113041, 200265, 139392, 18151, 1556, 142508, 31380, 238, 24500, 38462, 294, 64, 23, 71, 17368, 563, 22724, 11782, 38516, 51, 115840, 313, 32354, 54608, 20625, 7426, 2037, 26008, 130250, 9626, 3773, 53418, ...	[ 0.095458984375, 0.1751708984375, 0.1795654296875, 0.181640625, 0.05517578125, 0.207275390625, 0.1854248046875, 0.210693359375, 0.1595458984375, 0.1649169921875, 0.1259765625, 0.2230224609375, 0.0902099609375, 0.048828125, 0.1788330078125, 0.2022705078125, 0.000030517578125, 0.01419...	embed
10439017_c0	10439017	haskell	0	Title: How do I fix an "Occurs check: cannot construct the infinite type" error? Problem title: How do I fix an "Occurs check: cannot construct the infinite type" error? Tags: haskell, list Problem: How do I fix an "Occurs check: cannot construct the infinite type" error? I am trying to write a remo...	How do I fix an "Occurs check: cannot construct the infinite type" error? How do I fix an "Occurs check: cannot construct the infinite type" error? haskell list How Occurs x:xs not.a Bool When How do I fix an "Occurs check: cannot construct the infinite type" error? I am trying to write a remove fun...	[ 0.0013885498046875, 0.017333984375, -0.0003108978271484375, 0.01348876953125, -0.00213623046875, -0.00994873046875, -0.0021209716796875, 0.00136566162109375, -0.00058746337890625, -0.01202392578125, 0.002288818359375, -0.0126953125, 0.00970458984375, 0.000972747802734375, -0.010681152343...	[ 11249, 30022, 670, 238, 48650, 12765, 53418, 64549, 54241, 10644, 18499, 13, 1556, 142508, 5303, 180, 1022, 425, 7, 959, 11, 2460, 929, 12, 31577, 33022, 87388, 32354, 38937, 71, 2055, 712, 140992, 18151, 25632, 26008, 29459, 15549, 17932, ...	[ 0.006134033203125, 0.1224365234375, 0.08349609375, 0.08544921875, 0.2117919921875, 0.2049560546875, 0.16064453125, 0.1871337890625, 0.1513671875, 0.201171875, 0.185302734375, 0.055419921875, 0.06597900390625, 0.1640625, 0.09271240234375, 0.09326171875, 0.042816162109375, 0.09313964...	embed
23466779_c0	23466779	haskell	0	Title: getArgs expecting [char] instead of [string] Problem title: getArgs expecting [char] instead of [string] Tags: haskell, io Problem: getArgs expecting [char] instead of [string] This code worked fine when it only took first. I get this error after having added second. Couldn't match expected type 'Char' with actu...	getArgs expecting [char] instead of [string] getArgs expecting [char] instead of [string] haskell io System.Environment Couldn Char Expected Actual Main Hello getArgs expecting [char] instead of [string] This code worked fine when it only took first. I get this error after having added second. Which makes no sense to m...	[ 0.0048828125, -0.01531982421875, -0.00927734375, 0.0240478515625, 0.007354736328125, 0.0296630859375, 0.0037994384765625, 0.0037689208984375, 0.0027923583984375, -0.00634765625, 0.0283203125, -0.02685546875, -0.007659912109375, -0.003936767578125, -0.0040283203125, -0.007110595703125, ...	[ 2046, 7614, 9405, 41206, 214, 9254, 64457, 111, 91693, 1556, 142508, 22995, 12353, 686, 1900, 191147, 19, 21656, 60075, 13, 89829, 100582, 12321, 35378, 18151, 79786, 5885, 4734, 34739, 5117, 903, 18499, 7103, 49814, 17932, 10422, 177, 139124...	[ 0.1331787109375, 0.22509765625, 0.221435546875, 0.2392578125, 0.0828857421875, 0.2135009765625, 0.126953125, 0.0171661376953125, 0.188720703125, 0.0941162109375, 0.1934814453125, 0.184326171875, 0.1009521484375, 0.07183837890625, 0.1097412109375, 0.09210205078125, 0.023590087890625, ...	embed
53341188_c0	53341188	haskell	0	Title: Traverse a tree with an arbitrary number of branches Problem title: Traverse a tree with an arbitrary number of branches Tags: haskell Problem: Traverse a tree with an arbitrary number of branches I want to calculate the maximum degree in a Tree which has an arbitrary number of branches. data Tree a = Node a [Tr...	Traverse a tree with an arbitrary number of branches Traverse a tree with an arbitrary number of branches haskell Traverse Tree Node Show Answer tree1 Traverse a tree with an arbitrary number of branches I want to calculate the maximum degree in a Tree which has an arbitrary number of branches. Now, I am getting an err...	[ -0.012939453125, 0.0277099609375, -0.0206298828125, -0.00689697265625, 0.01397705078125, 0.0093994140625, -0.00970458984375, -0.0218505859375, 0.010986328125, -0.047119140625, -0.0036163330078125, -0.032470703125, 0.0252685546875, 0.0164794921875, 0.00775146484375, 0.0022735595703125, ...	[ 4937, 37676, 10, 53201, 678, 61799, 1294, 14012, 111, 90356, 1556, 142508, 101344, 438, 112, 17367, 418, 87, 3444, 74481, 67, 38132, 79385, 23, 18499, 33022, 26785, 103510, 86869, 2967 ]	[ 0.12451171875, 0.1849365234375, 0.048614501953125, 0.248046875, 0.1177978515625, 0.153564453125, 0.040771484375, 0.119384765625, 0.050018310546875, 0.254638671875, 0.114501953125, 0.2098388671875, 0.225341796875, 0.08868408203125, 0.06121826171875, 0.014251708984375, 0.0015869140625,...	embed
19661885_c0	19661885	haskell	0	Title: Could not find module `Test.QuickCheck' on Ubuntu Problem title: Could not find module `Test.QuickCheck' on Ubuntu Tags: testing, ubuntu, haskell Problem: Could not find module `Test.QuickCheck' on Ubuntu I'm importing QuickCheck at the top of my file: import Test.QuickCheck ... Compiling the file with...	Could not find module `Test.QuickCheck' on Ubuntu Could not find module `Test.QuickCheck' on Ubuntu testing ubuntu haskell Test.QuickCheck Could Ubuntu Lab1.hs Lab1.hs:1:8 Use Failed Could not find module `Test.QuickCheck' on Ubuntu I'm importing QuickCheck at the top of my file: Compiling the file with ghc L...	[ -0.00567626953125, 0.007354736328125, 0.0064697265625, -0.00787353515625, 0.00007486343383789062, 0.003326416015625, 0.023681640625, -0.020263671875, -0.00640869140625, -0.004364013671875, -0.006744384765625, -0.0361328125, 0.00640869140625, -0.007110595703125, -0.015869140625, 0.01062...	[ 191147, 959, 7413, 88996, 111337, 96010, 2594, 202567, 3768, 98, 116890, 134234, 198996, 1556, 142508, 8647, 21488, 127, 1019, 36836, 190355, 24927, 89038, 2663, 11435, 15612, 31380, 238, 418, 903, 18499, 1747, 18, 408, 33938, 63773, 78292, 5...	[ 0.007904052734375, 0.06756591796875, 0.13330078125, 0.228759765625, 0.2216796875, 0.158203125, 0.128662109375, 0.30810546875, 0.1185302734375, 0.0249481201171875, 0.1876220703125, 0.1552734375, 0.129150390625, 0.0897216796875, 0.1717529296875, 0.1671142578125, 0.15673828125, 0.0855...	embed
21110623_c0	21110623	haskell	0	Title: Understanding the definition of a recursive function Problem title: Understanding the definition of a recursive function Tags: haskell Problem: Understanding the definition of a recursive function Hi could anyone explain to me how these pieces of code come about their answers? pip = phi 4 where phi x = if x == 1...	Understanding the definition of a recursive function Understanding the definition of a recursive function haskell Understanding x-1 Understanding the definition of a recursive function Hi could anyone explain to me how these pieces of code come about their answers? This returns a result of 26. And this returns a result...	[ 0.002655029296875, 0.009765625, -0.0191650390625, 0.0303955078125, -0.0003223419189453125, 0.00799560546875, -0.002349853515625, 0.00159454345703125, 0.0223388671875, -0.03173828125, -0.00787353515625, -0.0181884765625, -0.010009765625, 0.0260009765625, 0.0238037109375, 0.0206298828125...	[ 9626, 144057, 80934, 195625, 5844, 32354, 10, 1556, 142508, 1022, 5759, 111, 5809, 35672, 73342, 3642, 6097, 126371, 18151, 1380, 1672, 35166, 30646, 16750, 12490, 170242, 21373, 63847, 173340, 382, 162, 6849, 110, 6528, 50339, 69307 ]	[ 0.0762939453125, 0.0955810546875, 0.1644287109375, 0.2191162109375, 0.1724853515625, 0.1844482421875, 0.03240966796875, 0.1251220703125, 0.2254638671875, 0.086669921875, 0.150390625, 0.03399658203125, 0.007904052734375, 0.0059814453125, 0.109130859375, 0.0447998046875, 0.019546508789...	embed
10218076_c0	10218076	haskell	0	Title: Why does the list functor represent a context of nondeterministic choice? Problem title: Why does the list functor represent a context of nondeterministic choice? Tags: haskell, functional-programming Problem: Why does the list functor represent a context of nondeterministic choice? What does this quote mean? th...	Why does the list functor represent a context of nondeterministic choice? Why does the list functor represent a context of nondeterministic choice? haskell functional-programming Why Why does the list functor represent a context of nondeterministic choice? What does this quote mean? In the context of Functors in functi...	[ -0.004669189453125, 0.00897216796875, 0.01373291015625, 0.01177978515625, -0.003662109375, 0.00323486328125, 0.000606536865234375, -0.01153564453125, 0.0177001953125, 0.0294189453125, -0.0216064453125, -0.0274658203125, 0.00653076171875, 0.0126953125, -0.0247802734375, 0.01904296875, ...	[ 44084, 5303, 7477, 18770, 33636, 43701, 351, 112, 30524, 48242, 44126, 111, 1556, 142508, 123309, 28966, 14602, 70, 10, 66747, 29459, 28670, 56037, 28219, 83, 98102, 20037, 81273, 59911, 32354, 61514, 80854, 116419, 144, 45646, 678, 7722, 137...	[ 0.1282958984375, 0.226318359375, 0.1842041015625, 0.2430419921875, 0.2064208984375, 0.249755859375, 0.133056640625, 0.07244873046875, 0.165771484375, 0.11279296875, 0.177001953125, 0.05517578125, 0.07861328125, 0.1824951171875, 0.1605224609375, 0.06756591796875, 0.005157470703125, ...	embed
35331801_c0	35331801	haskell	0	Title: How to send text to GHCi process? Problem title: How to send text to GHCi process? Tags: ghci, haskell Problem: How to send text to GHCi process? I'm working on Haskell presentation engine Howerpoint . It is running in GHCi. I would like to create a function which would output a statement to current running GHCi...	How to send text to GHCi process? How to send text to GHCi process? ghci haskell How GHCi How to send text to GHCi process? I'm working on Haskell presentation engine Howerpoint . It is running in GHCi. I would like to create a function which would output a statement to current running GHCi session. It must work on Lin...	[ 0.0115966796875, -0.003448486328125, -0.0135498046875, 0.0108642578125, -0.01129150390625, -0.0059814453125, 0.020263671875, 0.0033416748046875, -0.0172119140625, -0.03857421875, 0.0162353515625, -0.016845703125, -0.0150146484375, 0.0247802734375, 0.00592041015625, 0.0052490234375, -...	[ 11249, 47, 25379, 7986, 527, 73265, 14, 9433, 31380, 318, 1556, 142508, 20697, 20625, 92252, 87907, 56, 38496, 51042, 1884, 28282, 32354, 140992, 63805, 43581, 56002, 8110, 4488, 29908, 136, 4727, 3773, 63559, 28670, 10644, 37842, 21771, 2046...	[ 0.0987548828125, 0.1834716796875, 0.1746826171875, 0.2568359375, 0.111328125, 0.1624755859375, 0.2276611328125, 0.1884765625, 0.10125732421875, 0.17333984375, 0.1121826171875, 0.2119140625, 0.033203125, 0.08038330078125, 0.09228515625, 0.0765380859375, 0.03900146484375, 0.177001953...	embed
1450411_c0	1450411	haskell	0	Title: Why is ghc evaluating my infinite list? Problem title: Why is ghc evaluating my infinite list? Tags: lazy-evaluation, haskell Problem: Why is ghc evaluating my infinite list? As my first haskell program I'm trying to do this - it's the hard way to get 1 to 10. I'm constructing an infinite list of integers, and s...	Why is ghc evaluating my infinite list? Why is ghc evaluating my infinite list? lazy-evaluation haskell Data.List Why Main Why is ghc evaluating my infinite list? As my first haskell program I'm trying to do this - it's the hard way to get 1 to 10. I'm constructing an infinite list of integers, and sorting them, and ta...	[ 0.0068359375, -0.000713348388671875, 0.0166015625, -0.01611328125, -0.0140380859375, 0.0028533935546875, 0.0172119140625, -0.010986328125, -0.00689697265625, -0.029052734375, 0.00787353515625, -0.0196533203125, 0.015380859375, 0.004058837890625, 0.0030517578125, 0.00020694732666015625,...	[ 44084, 83, 31380, 238, 151575, 214, 759, 54241, 13, 5303, 21, 3285, 159258, 1363, 1556, 142508, 11809, 154663, 12321, 5117, 1528, 31577, 7941, 2046, 106, 47, 4068, 64549, 892, 26255, 12096, 35971, 91177, 122991, 4488, 678, 216806, 219836, 8...	[ 0.1375732421875, 0.036376953125, 0.128662109375, 0.138427734375, 0.1761474609375, 0.06243896484375, 0.0574951171875, 0.1358642578125, 0.0997314453125, 0.1864013671875, 0.0938720703125, 0.184326171875, 0.1793212890625, 0.00494384765625, 0.1104736328125, 0.2069091796875, 0.081909179687...	embed
46147236_c0	46147236	haskell	0	Title: Haskell: Pretty print infix and prefix Problem title: Haskell: Pretty print infix and prefix Tags: types, abstract-syntax-tree, pretty-print, haskell Problem: Haskell: Pretty print infix and prefix I have a type to represent haskell types: data Type = TApp Type Type \| TVar Name \| TLit Name infixl 8 `TApp` -- a -...	Haskell: Pretty print infix and prefix Haskell: Pretty print infix and prefix types abstract-syntax-tree pretty-print haskell Haskell Pretty Type TApp TVar Name TLit Fun Maybe Haskell: Pretty print infix and prefix I have a type to represent haskell types: I want to print it as haskell does, namely, literals that are s...	[ -0.000751495361328125, -0.01092529296875, 0.0177001953125, 0.00457763671875, -0.021728515625, -0.0087890625, -0.00148773193359375, -0.00299072265625, -0.0036773681640625, 0.00750732421875, 0.0155029296875, -0.03466796875, 0.0064697265625, 0.005523681640625, 0.004119873046875, 0.0205078...	[ 20625, 142508, 197570, 28412, 23, 55923, 136, 183114, 52895, 164789, 86531, 62600, 28875, 35662, 1556, 60457, 39179, 1910, 147, 15757, 217, 28670, 83425, 765, 10644, 33636, 3444, 237, 14602, 15659, 16765, 26582, 12960, 3789, 289, 49129, 160291,...	[ 0.1304931640625, 0.2269287109375, 0.213623046875, 0.20361328125, 0.09912109375, 0.2164306640625, 0.032318115234375, 0.2071533203125, 0.2017822265625, 0.1224365234375, 0.1038818359375, 0.1260986328125, 0.1636962890625, 0.14599609375, 0.13134765625, 0.19482421875, 0.143798828125, 0.0...	embed
67127128_c0	67127128	haskell	0	Title: wierd type-error of 2 different records with a field with same name Problem title: wierd type-error of 2 different records with a field with same name Tags: haskell Problem: wierd type-error of 2 different records with a field with same name I have the following data structure: data Exp = Var String \| Unary { ex...	wierd type-error of 2 different records with a field with same name wierd type-error of 2 different records with a field with same name haskell Exp Unary UnaryOp Binary BinaryOp Not Impl Equal Constructors wierd type-error of 2 different records with a field with same name I have the following data structure: And I get...	[ 0.017822265625, -0.004913330078125, -0.00762939453125, 0.016357421875, 0.00830078125, 0.0113525390625, -0.0201416015625, 0.0069580078125, 0.00567626953125, 0.0019683837890625, -0.004150390625, -0.0159912109375, 0.049560546875, 0.001434326171875, 0.0023193359375, 0.005126953125, 0.000...	[ 1225, 4216, 10644, 188800, 116, 12921, 115923, 678, 44457, 5701, 9351, 1556, 142508, 60075, 4228, 1294, 39029, 54092, 11205, 29128, 141, 71723, 82084, 18770, 111, 25632, 2053, 45646, 18499, 13319, 2046, 15400, 52895, 233, 2967, 23, 71337, 157...	[ 0.1312255859375, 0.2120361328125, 0.1949462890625, 0.1951904296875, 0.126708984375, 0.162109375, 0.1904296875, 0.033294677734375, 0.1563720703125, 0.0941162109375, 0.08489990234375, 0.1239013671875, 0.2169189453125, 0.0867919921875, 0.0833740234375, 0.035400390625, 0.1507568359375, ...	embed
55405735_c2	55405735	haskell	2	%252FLODES7%252Fak%252Fod%252Fak_od_aux_JT00_2002.csv.gz", service name: Just "443"): does not exist (nodename nor servname provided, or not known))) Code signals: VanillaHttpException, Network.URI.Encode, Hitting, Haskell, MonadHttp, T.pack, Pull, GET, EN.encode, NoReqBody, T.splitOn, Main, UsCensusDataLodesScraper, l...	%252FLODES7%252Fak%252Fod%252Fak_od_aux_JT00_2002.csv.gz", service name: Just "443"): does not exist (nodename nor servname provided, or not known))) Code signals: VanillaHttpException, Network.URI.Encode, Hitting, Haskell, MonadHttp, T.pack, Pull, GET, EN.encode, NoReqBody, T.splitOn, Main, UsCensusDataLodesScraper, l...	[ -0.0205078125, 0.0111083984375, 0.01611328125, 0.005615234375, 0.01611328125, 0.00186920166015625, 0.00897216796875, -0.005218505859375, -0.0027313232421875, -0.020751953125, 0.01611328125, -0.025634765625, 0.004486083984375, -0.007080078125, 0.01123046875, -0.00628662109375, 0.00848...	[ 2588, 17014, 69193, 344, 12744, 2199, 10442, 112606, 7049, 41632, 4439, 334, 169, 4516, 9351, 9563, 126384, 2077, 14602, 959, 32316, 157, 112, 11627, 12488, 62016, 62952, 707, 51529, 32149, 28864, 26073, 7, 3000, 2298, 3062, 254, 19279, 639...	[ 0.00299072265625, 0.093505859375, 0.125732421875, 0.044097900390625, 0.0263671875, 0.10791015625, 0.1761474609375, 0.0966796875, 0.1441650390625, 0.2049560546875, 0.024810791015625, 0.1346435546875, 0.0650634765625, 0.23291015625, 0.09454345703125, 0.1912841796875, 0.333740234375, ...	embed
23085422_c0	23085422	haskell	0	Title: Encode strings parsed by HXT to proper UTF8 String Problem title: Encode strings parsed by HXT to proper UTF8 String Tags: utf-8, hxt, haskell Problem: Encode strings parsed by HXT to proper UTF8 String I am parsing utf8-encoded pages using hxt, simplified parser example: names = multi (hasName "h1") >>> proc h1...	Encode strings parsed by HXT to proper UTF8 String Encode strings parsed by HXT to proper UTF8 String utf-8 hxt haskell Encode HXT UTF8 Main Data.Text.IO.putStrLn Data.Text.pack utf-8 Encode strings parsed by HXT to proper UTF8 String I am parsing utf8-encoded pages using hxt, simplified parser example: Everything goes...	[ 0.0068359375, 0.01556396484375, 0.00152587890625, 0.015869140625, -0.01495361328125, 0.00897216796875, 0.0140380859375, -0.0027008056640625, -0.0087890625, 0.000025391578674316406, -0.0038909912109375, -0.05419921875, 0.0218505859375, 0.016357421875, -0.00830078125, 0.00095748901367187...	[ 357, 40899, 79315, 366, 5281, 390, 572, 70981, 47, 27798, 345, 30992, 1019, 23351, 486, 420, 17376, 1096, 29062, 1556, 142508, 12321, 11809, 174379, 17780, 7077, 71713, 5, 29102, 66332, 37967, 17368, 112892, 1029, 2189, 27781, 171581, 60899, ...	[ 0.12109375, 0.212158203125, 0.221923828125, 0.135498046875, 0.010986328125, 0.026031494140625, 0.138916015625, 0.274169921875, 0.0828857421875, 0.1103515625, 0.0426025390625, 0.186767578125, 0.20947265625, 0.15283203125, 0.09521484375, 0.10400390625, 0.176025390625, 0.11669921875, ...	embed
53101532_c0	53101532	haskell	0	Title: Text.ParserCombinators.Parsec oneOf function has error Problem title: Text.ParserCombinators.Parsec oneOf function has error Tags: haskell Problem: Text.ParserCombinators.Parsec oneOf function has error ghci version is GHCi, version 8.6.1: http://www.haskell.org/ghc/ Prelude> :m +Text.ParserCombinators.Parsec Pr...	Text.ParserCombinators.Parsec oneOf function has error Text.ParserCombinators.Parsec oneOf function has error haskell Text.ParserCombinators.Parsec Prelude Non Text.Parsec.Prim.Stream Char Use FlexibleContexts When Text.Parsec.Prim.ParsecT Text.ParserCombinators.Parsec oneOf function has error ghci version is GHCi, ver...	[ 0.004638671875, 0.006927490234375, 0.007720947265625, 0.033935546875, 0.007232666015625, 0.0006103515625, -0.0022125244140625, -0.02099609375, -0.00408935546875, -0.033935546875, -0.00604248046875, -0.0308837890625, 0.0130615234375, 0.00092315673828125, -0.0135498046875, -0.01068115234...	[ 24129, 28636, 2189, 10770, 19155, 22230, 39797, 1632, 132887, 32354, 1556, 18499, 142508, 1914, 822, 3775, 145111, 115061, 21656, 36836, 180842, 2661, 22829, 5, 618, 31380, 318, 11389, 527, 73265, 14, 3217, 173245, 10557, 9486, 238, 44084 ]	[ 0.1572265625, 0.1165771484375, 0.10009765625, 0.030792236328125, 0.19775390625, 0.10137939453125, 0.1942138671875, 0.1650390625, 0.320068359375, 0.21240234375, 0.1026611328125, 0.251708984375, 0.2320556640625, 0.05523681640625, 0.157470703125, 0.08416748046875, 0.1131591796875, 0.1...	embed
27361127_c0	27361127	haskell	0	Title: Refactor pipes interface Problem title: Refactor pipes interface Tags: haskell, pipe, refactoring Problem: Refactor pipes interface I'm putting together a model of an encoder using the pipes library (4.1.4). I have a working function encode :: (Monad m) => Int -> - -- number of codes per bit Producer Word32 m r ...	Refactor pipes interface Refactor pipes interface haskell pipe refactoring Refactor Monad Producer Word32 P.zipWith Pipe Refactor pipes interface I'm putting together a model of an encoder using the pipes library (4.1.4). I have a working function And I'd like to refactor it as I think its usage is clearer; it encodes ...	[ 0.0030517578125, 0.000972747802734375, -0.01055908203125, 0.015869140625, -0.0322265625, 0.000858306884765625, -0.03076171875, -0.01611328125, 0.0035858154296875, -0.0184326171875, -0.0098876953125, 0.0040283203125, 0.0198974609375, 0.0185546875, 0.0155029296875, 0.004608154296875, 0...	[ 853, 144810, 137158, 7, 101758, 1556, 142508, 456, 214, 60331, 71, 103687, 56, 22543, 6460, 436, 50836, 194583, 93128, 13, 118620, 25842, 3299, 22, 587, 820, 17368, 35773, 1294, 9451, 91977, 765, 20697, 32354, 1884, 47, 442, 5351, 127689, ...	[ 0.1671142578125, 0.308349609375, 0.232666015625, 0.08441162109375, 0.248291015625, 0.1058349609375, 0.20703125, 0.1673583984375, 0.0208892822265625, 0.152587890625, 0.1136474609375, 0.157958984375, 0.09417724609375, 0.13232421875, 0.2008056640625, 0.0684814453125, 0.1649169921875, ...	embed
66461055_c0	66461055	haskell	0	Title: Run the GC based on physical memory Problem title: Run the GC based on physical memory Tags: haskell, garbage-collection Problem: Run the GC based on physical memory I am running my code on AWS Lambda and I have some performance issues depending on the memory I allocate to the Lambda. For the same call: 128 MB \|...	Run the GC based on physical memory Run the GC based on physical memory haskell garbage-collection Run Cold Nominal Run the GC based on physical memory I am running my code on AWS Lambda and I have some performance issues depending on the memory I allocate to the Lambda. For the same call: The maximum used memory is al...	[ 0.00830078125, 0.014404296875, 0.01361083984375, -0.01129150390625, 0.00970458984375, -0.005462646484375, -0.00003552436828613281, 0.023193359375, 0.0159912109375, -0.0166015625, 0.01416015625, -0.01446533203125, -0.01708984375, 0.0001430511474609375, 0.0242919921875, 0.0194091796875, ...	[ 28398, 70, 69657, 35509, 98, 72761, 98323, 1556, 142508, 3671, 402, 429, 196352, 146185, 438, 1249, 289, 51042, 18151, 62, 52143, 122930, 85, 23718, 37348, 96819, 24286, 11782, 581, 38132, 11814, 11343, 9365, 73238, 12918, 57767, 185553, 5792...	[ 0.19970703125, 0.140625, 0.25048828125, 0.1644287109375, 0.037872314453125, 0.223388671875, 0.26123046875, 0.108154296875, 0.2330322265625, 0.054901123046875, 0.1519775390625, 0.0633544921875, 0.1290283203125, 0.24072265625, 0.01947021484375, 0.140380859375, 0.008087158203125, 0.11...	embed
67386251_c0	67386251	haskell	0	Title: deriving Applicative in haskell Problem title: deriving Applicative in haskell Tags: haskell Problem: deriving Applicative in haskell Why wouldn't GHC derive Applicative for KO ? #!/usr/bin/env stack -- stack --resolver lts-17.10 script {-# LANGUAGE DeriveFunctor #-} {-# LANGUAGE GeneralizedNewtypeDeriving #-} n...	deriving Applicative in haskell deriving Applicative in haskell haskell Applicative lts-17.10 LANGUAGE DeriveFunctor GeneralizedNewtypeDeriving Functor deriving Applicative in haskell Why wouldn't GHC derive Applicative for KO ?	[ 0.01171875, 0.015869140625, -0.00518798828125, 0.01953125, 0.0166015625, 0.0022735595703125, 0.01348876953125, -0.006011962890625, -0.000545501708984375, 0.001922607421875, 0.0004367828369140625, -0.0341796875, 0.01092529296875, 0.0133056640625, -0.0279541015625, -0.01904296875, 0.00...	[ 16406, 6496, 5659, 11048, 4935, 23, 1556, 142508, 933, 13521, 963, 98064, 75930, 1310, 5844, 97249, 18770, 9082, 46568, 50986, 47731, 14, 28670, 44084, 68746, 18, 527, 73265, 122, 100, 11841 ]	[ 0.150146484375, 0.093505859375, 0.1656494140625, 0.188232421875, 0.17822265625, 0.08917236328125, 0.1522216796875, 0.2154541015625, 0.0579833984375, 0.08966064453125, 0.11395263671875, 0.0911865234375, 0.01702880859375, 0.0975341796875, 0.11871337890625, 0.10064697265625, 0.083312988...	embed
30958706_c0	30958706	haskell	0	Title: Display a full image with wxHaskell Problem title: Display a full image with wxHaskell Tags: haskell, wxhaskell Problem: Display a full image with wxHaskell I am using wxHaskell to display a full image in a window. My code is: import Graphics.UI.WX import Graphics.UI.WXCore main :: IO () main = start testimg tes...	Display a full image with wxHaskell Display a full image with wxHaskell haskell wxhaskell Graphics.UI.WX Graphics.UI.WXCore Display Test Image landscape.png Display a full image with wxHaskell I am using wxHaskell to display a full image in a window. My code is: Anyway when the app runs nothing is displayed (not even t...	[ -0.0004119873046875, 0.00482177734375, -0.003997802734375, 0.000492095947265625, -0.002044677734375, 0.0130615234375, 0.01361083984375, -0.018310546875, -0.0022430419921875, -0.026123046875, 0.0225830078125, 0.0032196044921875, -0.014404296875, 0.01611328125, -0.005126953125, 0.0057983...	[ 90045, 4393, 29569, 678, 148, 425, 6495, 7, 142508, 1556, 137056, 189682, 33457, 1456, 1542, 4524, 8647, 22710, 212790, 128468, 17368, 44116, 23, 76896, 18151, 126786, 3229, 4027, 127877, 33720, 132988, 4488 ]	[ 0.1715087890625, 0.1663818359375, 0.1536865234375, 0.06695556640625, 0.0966796875, 0.1241455078125, 0.135009765625, 0.0869140625, 0.234130859375, 0.1148681640625, 0.0845947265625, 0.1197509765625, 0.04534912109375, 0.06817626953125, 0.12841796875, 0.1134033203125, 0.1285400390625, ...	embed
30966910_c0	30966910	haskell	0	Title: Why are takeR, dropR and splitAtR missing from Data.Sequence? Problem title: Why are takeR, dropR and splitAtR missing from Data.Sequence? Tags: sequence, haskell, containers Problem: Why are takeR, dropR and splitAtR missing from Data.Sequence? Data.Sequence has takeWhileR and dropWhileR for efficient deconstru...	Why are takeR, dropR and splitAtR missing from Data.Sequence? Why are takeR, dropR and splitAtR missing from Data.Sequence? sequence haskell containers Data.Sequence Why Seq containers-0.5.6.3 Why are takeR, dropR and splitAtR missing from Data.Sequence? Data.Sequence has takeWhileR and dropWhileR for efficient deconst...	[ 0.0162353515625, 0.020751953125, -0.0128173828125, -0.017578125, -0.0191650390625, -0.0086669921875, 0.00201416015625, 0.003204345703125, -0.00634765625, -0.00159454345703125, 0.01080322265625, 0.0213623046875, -0.01104736328125, 0.0120849609375, 0.019287109375, 0.01373291015625, -0....	[ 44084, 5646, 1052, 36069, 65450, 28848, 132283, 11809, 4233, 944, 3956, 1556, 142508, 116419, 503, 864, 93645, 200768, 979, 133, 93766, 8, 238478, 7108, 44689, 146291, 136, 29479, 69407, 51287, 1360, 36456, 123309, 99201, 24, 208124, 21455, 5...	[ 0.0653076171875, 0.165771484375, 0.190185546875, 0.172119140625, 0.1541748046875, 0.14111328125, 0.1270751953125, 0.110595703125, 0.06915283203125, 0.102294921875, 0.028045654296875, 0.07403564453125, 0.1839599609375, 0.176025390625, 0.06219482421875, 0.1439208984375, 0.116455078125,...	embed
39678258_c0	39678258	haskell	0	Title: Remove phantom type variable Problem title: Remove phantom type variable Tags: phantom-types, haskell Problem: Remove phantom type variable Suppose i have some type like: newtype Foo a b = Foo { getFoo :: SomeStructure b } I.e. a is a phantom type used only for compile-time checks. However, I don't want to use t...	Remove phantom type variable Remove phantom type variable phantom-types haskell Remove Foo SomeStructure FooUnrestricted Anything Remove phantom type variable Suppose i have some type like: I.e. a is a phantom type used only for compile-time checks. However, I don't want to use the phantom type everywhere. It's not uni...	[ 0.0054931640625, 0.003997802734375, -0.006500244140625, 0.0242919921875, 0.00714111328125, 0.005706787109375, -0.0026092529296875, 0.01519775390625, 0.0091552734375, -0.00347900390625, -0.014404296875, -0.017578125, -0.01953125, -0.0054931640625, -0.01129150390625, -0.00051116943359375...	[ 181139, 68743, 5928, 10644, 77336, 50986, 1556, 142508, 9572, 31, 31384, 71713, 18190, 144225, 28541, 64113, 10, 11814, 4734, 9969, 1340, 6032, 12765, 3444, 4527, 219743, 32813, 80234, 18151, 1884, 5608, 3687, 46876, 111938, 42856, 8561, 6275, ...	[ 0.169677734375, 0.157470703125, 0.188232421875, 0.209228515625, 0.252685546875, 0.203857421875, 0.1053466796875, 0.2296142578125, 0.133056640625, 0.0867919921875, 0.036407470703125, 0.0389404296875, 0.052703857421875, 0.114013671875, 0.1234130859375, 0.214599609375, 0.141357421875, ...	embed
5268156_c0	5268156	haskell	0	Title: How do you do an in-place quicksort in Haskell Problem title: How do you do an in-place quicksort in Haskell Tags: haskell Problem: How do you do an in-place quicksort in Haskell Could somebody provide an in-place quicksort haskell function? I.e. it returns a new sorted list, but the input list is copied to a mu...	How do you do an in-place quicksort in Haskell How do you do an in-place quicksort in Haskell haskell How Haskell How do you do an in-place quicksort in Haskell Could somebody provide an in-place quicksort haskell function? I.e. it returns a new sorted list, but the input list is copied to a mutable array or something....	[ -0.004638671875, 0.0245361328125, 0.0255126953125, -0.032470703125, -0.00762939453125, 0.0030670166015625, -0.007232666015625, -0.00982666015625, 0.00982666015625, -0.005096435546875, 0.014404296875, 0.004913330078125, 0.00640869140625, -0.004180908203125, -0.000286102294921875, 0.0042...	[ 11249, 54, 142, 23, 23935, 63773, 62351, 20625, 142508, 1556, 191147, 176256, 22691, 32354, 30646, 3525, 17497, 5303, 1284, 107730, 71200, 47, 842, 22819, 10298, 23718, 130306, 1528, 40226, 45712, 2776, 47763, 561, 2053, 45646, 12638, 5646, 1...	[ 0.0767822265625, 0.07122802734375, 0.05096435546875, 0.146728515625, 0.191650390625, 0.1824951171875, 0.269775390625, 0.1446533203125, 0.259033203125, 0.1414794921875, 0.03399658203125, 0.01092529296875, 0.0616455078125, 0.1610107421875, 0.1346435546875, 0.097900390625, 0.22424316406...	embed
2223468_c0	2223468	haskell	0	Title: Haskell "where" indentation: why must it be indented past identifier? Problem title: Haskell "where" indentation: why must it be indented past identifier? Tags: haskell, indentation Problem: Haskell "where" indentation: why must it be indented past identifier? This code: import Data.Char (dig...	Haskell "where" indentation: why must it be indented past identifier? Haskell "where" indentation: why must it be indented past identifier? haskell indentation Data.Char Haskell x:xs Haskell "where" indentation: why must it be indented past identifier? This code: Fails: But this version: is ok: I ca...	[ 0.002685546875, 0.000713348388671875, -0.01556396484375, 0.0038604736328125, -0.0169677734375, 0.013671875, -0.00060272216796875, -0.0107421875, 0.0201416015625, -0.005157470703125, 0.010986328125, -0.01458740234375, -0.0035247802734375, -0.0128173828125, -0.0023193359375, -0.019042968...	[ 20625, 142508, 136913, 41502, 18597, 22062, 15400, 8110, 3674, 11015, 42485, 56, 1556, 11809, 84068, 1022, 12, 425, 18151, 190355, 4966, 903, 11389, 3664, 26366, 8382, 6626, 4568, 933, 26866 ]	[ 0.1383056640625, 0.222900390625, 0.214111328125, 0.03387451171875, 0.201416015625, 0.1226806640625, 0.1748046875, 0.1336669921875, 0.122314453125, 0.2364501953125, 0.21240234375, 0.09814453125, 0.126708984375, 0.08203125, 0.0999755859375, 0.02203369140625, 0.0225677490234375, 0.077...	embed
72344195_c0	72344195	haskell	0	Title: Generating Simple List from 1 to 10 with haskell Problem title: Generating Simple List from 1 to 10 with haskell Tags: list, increment, haskell, counter Problem: Generating Simple List from 1 to 10 with haskell I am new in Haskell, could guys help me how to generating list from 1 to 10. I tried to make like this...	Generating Simple List from 1 to 10 with haskell Generating Simple List from 1 to 10 with haskell list increment haskell counter 1 Generating Simple List Integer n-1 Generating Simple List from 1 to 10 with haskell I am new in Haskell, could guys help me how to generating list from 1 to 10. I tried to make like this: T...	[ 0.00634765625, 0.006500244140625, -0.0162353515625, 0.0191650390625, 0.0074462890625, 0.00811767578125, -0.005035400390625, 0.00909423828125, -0.0009765625, -0.02880859375, -0.0064697265625, -0.02001953125, 0.01251220703125, 0.041748046875, 0.007171630859375, -0.007568359375, 0.01440...	[ 155370, 1916, 60552, 32036, 1295, 106, 47, 209, 678, 1556, 142508, 5303, 158661, 105416, 44401, 653, 5759, 3525, 20625, 5809, 51484, 4358, 3642, 12663, 4068, 37842, 3249, 1884, 16750, 959, 831, 32354, 237, 34292, 18151, 3444, 11782, 140992, ...	[ 0.1571044921875, 0.04931640625, 0.207763671875, 0.2027587890625, 0.07598876953125, 0.123046875, 0.12109375, 0.2135009765625, 0.06744384765625, 0.154296875, 0.2115478515625, 0.1949462890625, 0.1595458984375, 0.1334228515625, 0.12353515625, 0.00115966796875, 0.1195068359375, 0.040649...	embed
45651550_c0	45651550	haskell	0	Title: Define concat function for Digits Problem title: Define concat function for Digits Tags: haskell Problem: Define concat function for Digits I have a list chars and I would like to concat all characters, which are digits and which are next to each other For example: ['1','5','+','2','4'] => ["15","+","24"] concat...	Define concat function for Digits Define concat function for Digits haskell Define Digits concat1 Char Couldn Expected Actual Define concat function for Digits I have a list chars and I would like to concat all characters, which are digits and which are next to each other For example: ['1','5','+','2','4'] => ["15","+"...	[ -0.004150390625, -0.01495361328125, 0.007110595703125, 0.005828857421875, -0.00799560546875, 0.0250244140625, -0.0098876953125, 0.017578125, 0.0118408203125, 0.00009679794311523438, -0.01177978515625, -0.008544921875, -0.013427734375, -0.01116943359375, -0.0015716552734375, -0.01501464...	[ 262, 64552, 158, 4460, 32354, 100, 51174, 933, 1556, 142508, 418, 21656, 191147, 19, 60075, 13, 100582, 5303, 21441, 7, 2806, 1884, 47, 756, 124850, 153939, 11737, 12638, 3789, 27781, 758, 1328, 304, 617, 44357, 1837, 2357, 37842, 18151, ...	[ 0.0780029296875, 0.19189453125, 0.1827392578125, 0.296630859375, 0.20849609375, 0.06982421875, 0.1619873046875, 0.1544189453125, 0.1168212890625, 0.22119140625, 0.09027099609375, 0.16064453125, 0.117919921875, 0.04144287109375, 0.10223388671875, 0.10528564453125, 0.1348876953125, 0...	embed
45757839_c0	45757839	haskell	0	Title: Removing duplicate elements in a Seq Problem title: Removing duplicate elements in a Seq Tags: haskell Problem: Removing duplicate elements in a Seq wondering how to implement nub over a Seq a I get that one could do: nubSeq :: Seq a -> Seq a nubSeq = fromList . nub . toList Just wondering is there something sta...	Removing duplicate elements in a Seq Removing duplicate elements in a Seq haskell Removing Seq Data.Sequence.foldrWithIndex Data.Sequence.elemIndexR Just Nothing Data.Sequence.empty Removing duplicate elements in a Seq wondering how to implement nub over a Seq a I get that one could do: Just wondering is there somethin...	[ -0.0059814453125, 0.036376953125, 0.0166015625, -0.00579833984375, 0.001312255859375, -0.000682830810546875, 0.01507568359375, 0.01007080078125, -0.0062255859375, -0.039794921875, -0.0299072265625, 0.005462646484375, -0.005828857421875, 0.015625, -0.015869140625, 0.0078125, 0.0011291...	[ 853, 432, 6496, 171763, 67, 80854, 23, 503, 864, 1556, 142508, 11809, 4233, 944, 42822, 194583, 39659, 27889, 1052, 9563, 182747, 33548, 149016, 3642, 29479, 315, 275, 645, 10, 2046, 5809, 9844, 5570, 959, 96760, 32036, 11782, 1984, 11, 1...	[ 0.0201873779296875, 0.1429443359375, 0.07958984375, 0.2257080078125, 0.1370849609375, 0.19287109375, 0.042999267578125, 0.1195068359375, 0.19677734375, 0.1204833984375, 0.2099609375, 0.09307861328125, 0.019927978515625, 0.03936767578125, 0.084228515625, 0.05999755859375, 0.1088867187...	embed
47444436_c0	47444436	haskell	0	Title: In Haskell, how can I get a list of available functions for a data structure? Problem title: In Haskell, how can I get a list of available functions for a data structure? Tags: haskell Problem: In Haskell, how can I get a list of available functions for a data structure? I know I'm asking the wrong question here...	In Haskell, how can I get a list of available functions for a data structure? In Haskell, how can I get a list of available functions for a data structure? haskell Haskell NTree In Haskell, how can I get a list of available functions for a data structure? I know I'm asking the wrong question here, but I'm coming to Has...	[ 0.0206298828125, 0.00250244140625, -0.001312255859375, -0.00009202957153320312, 0.00897216796875, 0.0155029296875, 0.008056640625, -0.018798828125, 0.0245361328125, -0.0537109375, -0.00921630859375, -0.0361328125, -0.0022430419921875, -0.01190185546875, -0.006591796875, -0.012023925781...	[ 360, 20625, 142508, 3642, 831, 2046, 10, 5303, 111, 19882, 32354, 7, 100, 2053, 45646, 1556, 107, 13, 47, 1295, 145581, 183234, 150624, 18507, 572, 70981, 366, 184, 92537, 11435, 4527, 16750, 65779, 441, 102656, 982, 2806, 1672, 20949, 28...	[ 0.060302734375, 0.1451416015625, 0.257568359375, 0.055877685546875, 0.0677490234375, 0.138427734375, 0.0880126953125, 0.1917724609375, 0.0921630859375, 0.2486572265625, 0.273193359375, 0.057403564453125, 0.0999755859375, 0.1287841796875, 0.242431640625, 0.0889892578125, 0.16320800781...	embed
69325169_c0	69325169	haskell	0	Title: Haskell: a return before is cancelled out by a monad after. How? Problem title: Haskell: a return before is cancelled out by a monad after. How? Tags: type-inference, return, haskell, monads Problem: Haskell: a return before is cancelled out by a monad after. How? How do I understand the statement return 1 getLi...	Haskell: a return before is cancelled out by a monad after. How? Haskell: a return before is cancelled out by a monad after. How? type-inference return haskell monads Haskell How Prelude Monad Num Haskell: a return before is cancelled out by a monad after. How? How do I understand the statement return 1 getLine ? It pa...	[ -0.0022430419921875, 0.00946044921875, 0.003173828125, 0.02587890625, 0.0157470703125, -0.0079345703125, 0.01202392578125, -0.020263671875, 0.00116729736328125, -0.020751953125, -0.0126953125, -0.02978515625, -0.0291748046875, -0.00946044921875, 0.01324462890625, -0.025634765625, 0.0...	[ 20625, 142508, 30646, 8108, 53017, 6259, 1810, 2667, 712, 7103, 11249, 10644, 73, 69988, 1556, 1914, 822, 112, 60331, 71, 52782, 28219, 63805, 106, 2046, 93232, 10922, 78292, 37202, 31943, 4398, 34680, 3789, 10422, 3564, 12996, 4717, 13, 83...	[ 0.13525390625, 0.251708984375, 0.24365234375, 0.1680908203125, 0.1591796875, 0.08917236328125, 0.1102294921875, 0.0943603515625, 0.146728515625, 0.1226806640625, 0.06585693359375, 0.14013671875, 0.000152587890625, 0.1300048828125, 0.1187744140625, 0.0301513671875, 0.09075927734375, ...	embed
10039274_c0	10039274	haskell	0	Title: Pass Types as arguments to a function in Haskell? Problem title: Pass Types as arguments to a function in Haskell? Tags: haskell, types Problem: Pass Types as arguments to a function in Haskell? The following two functions are extremely similar. They read from a [String] n elements, either [Int] or [Float]. How ...	Pass Types as arguments to a function in Haskell? Pass Types as arguments to a function in Haskell? haskell types Pass Types Haskell x:xs Float Pass Types as arguments to a function in Haskell? The following two functions are extremely similar. They read from a [String] n elements, either [Int] or [Float]. How can I fa...	[ 0.0125732421875, -0.003265380859375, 0.00848388671875, -0.00909423828125, -0.0008392333984375, -0.0000972747802734375, 0.0052490234375, -0.029052734375, -0.0107421875, -0.0233154296875, 0.01324462890625, -0.05224609375, 0.003997802734375, -0.007598876953125, -0.0020904541015625, -0.005...	[ 28872, 60457, 7, 237, 10750, 47, 32354, 23, 20625, 142508, 32, 1556, 52895, 1022, 12, 425, 38699, 257, 25632, 6626, 111531, 21373, 12301, 1295, 71713, 214, 653, 80854, 4153, 18, 919, 365, 31461, 39210, 18151, 1810, 3714, 191619, 8060, 452...	[ 0.20947265625, 0.270751953125, 0.06268310546875, 0.0936279296875, 0.22265625, 0.06317138671875, 0.1597900390625, 0.029083251953125, 0.134033203125, 0.235107421875, 0.008148193359375, 0.110595703125, 0.244873046875, 0.038604736328125, 0.0200347900390625, 0.05535888671875, 0.1774902343...	embed
12636535_c1	12636535	haskell	1	has an idea ? Here's what I do, I spare you the anagram searching and the file parsing functions: -- Read the file -> store the content into a list -> work on that list -> print the output result98 = do contents <- readFile ".\\resources\\98.txt" putStrLn $ (process.words.format) contents -- Find anagram pairs -> Find...	has an idea ? Here's what I do, I spare you the anagram searching and the file parsing functions: -- Read the file -> store the content into a list -> work on that list -> print the output result98 = do contents <- readFile ".\\resources\\98.txt" putStrLn $ (process.words.format) contents -- Find anagram pairs -> Find...	[ 0.00750732421875, -0.00360107421875, 0.001983642578125, 0.00982666015625, 0.00579833984375, 0.0177001953125, -0.00016307830810546875, 0.00013065338134765625, 0.005828857421875, -0.000621795654296875, 0.013916015625, 0.01318359375, -0.034912109375, -0.0262451171875, -0.006866455078125, ...	[ 1556, 142, 6528, 705, 11853, 25, 2367, 87, 54, 69463, 398, 3877, 25561, 157318, 136, 11435, 366, 6953, 32354, 12, 4210, 4764, 70, 33079, 4343, 10941, 3934, 5303, 4488, 28412, 140992, 16750, 16665, 2203, 12301, 174350, 107, 60427, 124326, ...	[ 0.1514892578125, 0.059112548828125, 0.217041015625, 0.0377197265625, 0.06427001953125, 0.01220703125, 0.096923828125, 0.07452392578125, 0.16064453125, 0.1514892578125, 0.006011962890625, 0.21630859375, 0.251708984375, 0.1810302734375, 0.01214599609375, 0.2469482421875, 0.172729492187...	embed
17684906_c0	17684906	haskell	0	Title: Memoize a Double function in Haskell Problem title: Memoize a Double function in Haskell Tags: haskell, memoization Problem: Memoize a Double function in Haskell I have a function slow :: Double -> Double which gets called very often (hundreds of millions of times), but only gets called on about a thousand discr...	Memoize a Double function in Haskell Memoize a Double function in Haskell haskell memoization Memoize Double Haskell Data.Bits Memoize a Double function in Haskell I have a function which gets called very often (hundreds of millions of times), but only gets called on about a thousand discrete values. This seems like an...	[ 0.00015735626220703125, -0.021240234375, 0.031982421875, -0.006988525390625, 0.016845703125, 0.02734375, -0.0179443359375, -0.0012969970703125, 0.01416015625, -0.003936767578125, -0.00439453125, 0.01123046875, 0.00139617919921875, -0.0086669921875, 0.0174560546875, 0.01483154296875, ...	[ 17443, 31, 20650, 107172, 32354, 20625, 142508, 23, 1556, 163, 432, 47691, 11809, 5, 571, 14481, 62163, 35839, 4552, 27983, 66456, 43077, 20028, 4734, 98, 1672, 199823, 81604, 142424, 37202, 40881, 25469, 831, 26366, 3642, 111, 10, 5570, 61...	[ 0.171142578125, 0.153564453125, 0.138671875, 0.266357421875, 0.2208251953125, 0.1658935546875, 0.262939453125, 0.021087646484375, 0.1527099609375, 0.1534423828125, 0.1875, 0.1280517578125, 0.1075439453125, 0.00469970703125, 0.1033935546875, 0.151611328125, 0.0283203125, 0.159179687...	embed
24404844_c0	24404844	haskell	0	Title: Haskell - Instance Declaration on hMatrix Problem title: Haskell - Instance Declaration on hMatrix Tags: haskell, hmatrix Problem: Haskell - Instance Declaration on hMatrix I'm using the function fromBlocks from hMatrix over a list whose elements are determined by functions of type Int -> Int -> Int -> Matrix In...	Haskell - Instance Declaration on hMatrix Haskell - Instance Declaration on hMatrix haskell hmatrix a Haskell Instance Declaration Matrix Element Possible Haskell - Instance Declaration on hMatrix I'm using the function fromBlocks from hMatrix over a list whose elements are determined by functions of type Int -> Int ->...	[ -0.0033111572265625, 0.01263427734375, 0.00860595703125, -0.006988525390625, 0.000461578369140625, 0.00958251953125, 0.0093994140625, 0.00052642822265625, 0.00360107421875, -0.0179443359375, -0.0157470703125, -0.03271484375, -0.003875732421875, -0.0194091796875, -0.0322265625, -0.00236...	[ 20625, 142508, 360, 116071, 98501, 1363, 98, 1096, 4613, 87427, 20, 1556, 192, 10, 194234, 48325, 115861, 2661, 17368, 70, 32354, 1295, 166191, 645, 5303, 80854, 83324, 10644, 18, 527, 73265, 186992, 14192, 111, 16750, 903, 181135, 678, 198...	[ 0.1646728515625, 0.2626953125, 0.122314453125, 0.204833984375, 0.2452392578125, 0.034912109375, 0.0909423828125, 0.145263671875, 0.111083984375, 0.1654052734375, 0.019012451171875, 0.14453125, 0.095458984375, 0.018402099609375, 0.22119140625, 0.138916015625, 0.07611083984375, 0.005...	embed
37668314_c0	37668314	haskell	0	Title: Get user from database using session value (Haskell - Yesod) Problem title: Get user from database using session value (Haskell - Yesod) Tags: yesod, haskell, session, authentication Problem: Get user from database using session value (Haskell - Yesod) I want to get User information from database using session v...	Get user from database using session value (Haskell - Yesod) Get user from database using session value (Haskell - Yesod) yesod haskell session authentication database session Get Haskell Yesod Handler Html get404 _ID profile.hamlet UserId Get user from database using session value (Haskell - Yesod) I want to get User ...	[ -0.000797271728515625, -0.0047607421875, 0.0040283203125, -0.0186767578125, -0.01318359375, 0.018310546875, 0.000606536865234375, -0.00970458984375, 0.00946044921875, -0.07666015625, 0.00015926361083984375, 0.0169677734375, -0.0164794921875, -0.0186767578125, 0.021484375, -0.0054626464...	[ 20779, 38937, 1295, 63399, 17368, 56002, 34292, 6495, 7, 142508, 32635, 2199, 2422, 23722, 1556, 195734, 20625, 10639, 603, 7237, 2046, 2839, 617, 7146, 60641, 3915, 1974, 53400, 568, 71, 3444, 4677, 64457, 26824, 36836, 903, 175399, 2071, ...	[ 0.11474609375, 0.2025146484375, 0.1591796875, 0.195556640625, 0.064453125, 0.1885986328125, 0.1927490234375, 0.071044921875, 0.04571533203125, 0.209228515625, 0.1234130859375, 0.2152099609375, 0.084228515625, 0.1802978515625, 0.07757568359375, 0.09136962890625, 0.0816650390625, 0.0...	embed
29241477_c0	29241477	haskell	0	Title: Margin of a Haskell diagrams SVG file Problem title: Margin of a Haskell diagrams SVG file Tags: graphics, haskell-diagrams, haskell Problem: Margin of a Haskell diagrams SVG file I am trying this diagrams example: funs = map (flip (^)) [2..6] visualize f = stroke' (with & vertexNames .~ [[0 .. 6 :: Int]] ) (reg...	Margin of a Haskell diagrams SVG file Margin of a Haskell diagrams SVG file graphics haskell-diagrams haskell Margin Haskell SVG Local StarFun Margin of a Haskell diagrams SVG file I am trying this diagrams example: And here is the result: Everything appears as expected that some of the numbers (or more precisely, the ...	[ 0.014404296875, 0.0145263671875, -0.003631591796875, 0.00579833984375, -0.009765625, 0.0106201171875, 0.0037689208984375, 0.012939453125, 0.007598876953125, -0.00823974609375, -0.006103515625, 0.017822265625, 0.00360107421875, -0.0025634765625, 0.017578125, -0.002288818359375, 0.0087...	[ 33346, 73, 111, 20625, 142508, 117233, 159, 79855, 11435, 10, 48461, 1556, 3390, 25561, 24172, 4612, 97249, 31577, 903, 27781, 3688, 16750, 171581, 135179, 237, 84751, 3060, 101935, 134995, 27585, 6097, 3687, 43573, 121303, 29569, 3564, 6713, ...	[ 0.208740234375, 0.1427001953125, 0.103271484375, 0.1337890625, 0.26025390625, 0.2105712890625, 0.0322265625, 0.2169189453125, 0.119140625, 0.013702392578125, 0.0848388671875, 0.1265869140625, 0.06329345703125, 0.1187744140625, 0.0728759765625, 0.0880126953125, 0.1829833984375, 0.11...	embed
46168176_c0	46168176	haskell	0	Title: Using map and filter function Problem title: Using map and filter function Tags: haskell Problem: Using map and filter function I can't figure out how to implement the map and filter function for a matrix. Does anyone have any suggestions that would satisfy these tests? -- \| Matrix Tests -- -- prop> mapMatrix (\...	Using map and filter function Using map and filter function haskell Using Matrix Tests matrix1 matrix2 Bool Using map and filter function I can't figure out how to implement the map and filter function for a matrix. Does anyone have any suggestions that would satisfy these tests?	[ 0.006622314453125, 0.0087890625, 0.0087890625, -0.01397705078125, 0.0093994140625, -0.01220703125, -0.01263427734375, 0.0020599365234375, -0.006500244140625, -0.00093841552734375, 0.001251220703125, 0.004180908203125, -0.0142822265625, 0.0035400390625, -0.025390625, -0.002227783203125,...	[ 345, 6953, 22288, 136, 46312, 32354, 1556, 142508, 194234, 8647, 50944, 425, 418, 304, 2460, 929, 87, 831, 18, 26366, 1810, 3642, 47, 29479, 100, 35672, 157666, 40407, 6097, 109921 ]	[ 0.1275634765625, 0.06689453125, 0.233642578125, 0.1663818359375, 0.278076171875, 0.2056884765625, 0.1378173828125, 0.2315673828125, 0.20556640625, 0.2083740234375, 0.2041015625, 0.144287109375, 0.038238525390625, 0.060791015625, 0.0986328125, 0.174072265625, 0.0098724365234375, 0.0...	embed
9664660_c0	9664660	haskell	0	Title: What does this combinator do: s (s k) Problem title: What does this combinator do: s (s k) Tags: lambda, combinators, lambda-calculus, combinatory-logic, haskell Problem: What does this combinator do: s (s k) I now understand the type signature of s (s k) : s (s k) :: ((t1 -> t2) -> t1) -> (t1 -> t2) -> t1 And I...	What does this combinator do: s (s k) What does this combinator do: s (s k) lambda combinators lambda-calculus combinatory-logic haskell What What does this combinator do: s (s k) I now understand the type signature of s (s k) : And I can create examples that work without error in the Haskell WinGHCi tool: Example : re...	[ -0.001617431640625, 0.016845703125, 0.0028076171875, 0.0016632080078125, 0.0019073486328125, -0.00012493133544921875, 0.004425048828125, -0.002197265625, 0.00186920166015625, 0.0091552734375, 0.0036773681640625, -0.01385498046875, -0.0040283203125, 0.0096435546875, -0.00921630859375, 0...	[ 4865, 14602, 903, 22321, 1290, 54, 91, 15, 7, 472, 21, 6492, 85, 22230, 6827, 94739, 31667, 137043, 1556, 142508, 28219, 10644, 138256, 28282, 27781, 4488, 15490, 18499, 20625, 17686, 41877, 40658, 55516, 89536, 30646, 116, 201, 39457, 42, ...	[ 0.087890625, 0.10650634765625, 0.10614013671875, 0.2432861328125, 0.1925048828125, 0.12939453125, 0.2080078125, 0.040557861328125, 0.1468505859375, 0.241943359375, 0.03118896484375, 0.1524658203125, 0.125732421875, 0.0982666015625, 0.06060791015625, 0.0999755859375, 0.063232421875, ...	embed
66636009_c0	66636009	haskell	0	Title: Factorial function returning negative number for large input Problem title: Factorial function returning negative number for large input Tags: haskell Problem: Factorial function returning negative number for large input My factorial function seems to work for numbers between 1 and 6, but not for numbers much bi...	Factorial function returning negative number for large input Factorial function returning negative number for large input haskell Factorial Factorial function returning negative number for large input My factorial function seems to work for numbers between 1 and 6, but not for numbers much bigger than 6, for example st...	[ 0.007293701171875, -0.0130615234375, -0.00341796875, -0.01507568359375, 0.01263427734375, -0.0030975341796875, 0.0020904541015625, 0.000797271728515625, -0.00885009765625, 0.01611328125, 0.0098876953125, -0.0247802734375, -0.01495361328125, 0.01019287109375, 0.01116943359375, -0.004119...	[ 117969, 15403, 32354, 30646, 40907, 14012, 100, 21334, 107730, 1556, 142508, 2646, 31461, 37202, 4488, 101935, 17721, 106, 136, 305, 1284, 959, 5045, 167785, 3501, 27781, 72134, 678, 952, 38, 50339, 621, 53418, 26366, 15400, 11853, 759, 3688,...	[ 0.246337890625, 0.1964111328125, 0.21435546875, 0.1715087890625, 0.2646484375, 0.1817626953125, 0.06884765625, 0.15283203125, 0.2281494140625, 0.1512451171875, 0.2381591796875, 0.007415771484375, 0.22998046875, 0.045440673828125, 0.1395263671875, 0.1546630859375, 0.0782470703125, 0...	embed
68951481_c1	68951481	haskell	1	to duplicate information putting starting symbol information in both the StaticParser and DynamicParser . Another issue is that almost all parsers will have the potential to throw which means we will have to spend a lot of time inside Maybe or Either creating what is essentially the "monads do not compose problem." Th...	to duplicate information putting starting symbol information in both the StaticParser and DynamicParser . Another issue is that almost all parsers will have the potential to throw which means we will have to spend a lot of time inside Maybe or Either creating what is essentially the "monads do not compose problem." Th...	[ -0.005218505859375, 0.01116943359375, 0.0157470703125, 0.010009765625, -0.01446533203125, 0.01141357421875, -0.0186767578125, -0.0172119140625, -0.004913330078125, -0.0205078125, -0.004913330078125, -0.0025634765625, 0.004241943359375, -0.002105712890625, 0.00299072265625, 0.0147705078...	[ 47, 171763, 67, 4677, 118620, 72134, 26582, 71465, 238, 28636, 2189, 136, 73327, 21068, 116267, 31089, 39555, 756, 366, 7, 1314, 1221, 765, 38516, 104250, 47445, 5915, 1733, 46132, 83425, 707, 4565, 9319, 105233, 85590, 87039, 6468, 54, 959...	[ 0.1131591796875, 0.2418212890625, 0.1591796875, 0.19921875, 0.0350341796875, 0.1641845703125, 0.2115478515625, 0.2076416015625, 0.09765625, 0.214111328125, 0.234375, 0.0262451171875, 0.167236328125, 0.1329345703125, 0.01995849609375, 0.1275634765625, 0.038848876953125, 0.068359375,...	embed
69244454_c0	69244454	haskell	0	Title: How can I define a function of type Integral a => a? Problem title: How can I define a function of type Integral a => a? Tags: haskell Problem: How can I define a function of type Integral a => a? We've just started learning Haskell at uni, and in one of my homework problems, we have to define a function f...	How can I define a function of type Integral a => a? How can I define a function of type Integral a => a? haskell How Integral Num How can I define a function of type Integral a => a? We've just started learning Haskell at uni, and in one of my homework problems, we have to define a function for this type signatu...	[ -0.01055908203125, -0.01953125, 0.00457763671875, 0.00225830078125, 0.006744384765625, -0.004913330078125, 0.0020904541015625, -0.01007080078125, -0.0013580322265625, -0.0198974609375, -0.0010223388671875, -0.019287109375, -0.002838134765625, 0.0184326171875, 0.0184326171875, -0.018310...	[ 11249, 831, 87, 61924, 32354, 10644, 204681, 10, 2203, 1230, 5386, 111, 1556, 142508, 52782, 44357, 52080, 20625, 19844, 5368, 18244, 44402, 903, 138256, 62822, 678, 2811, 136, 18221, 1001, 997, 20, 661, 5809, 33022, 3493, 4488, 8622, 110, ...	[ 0.0863037109375, 0.0732421875, 0.05224609375, 0.2379150390625, 0.2197265625, 0.1767578125, 0.2705078125, 0.1397705078125, 0.09228515625, 0.066650390625, 0.1663818359375, 0.03955078125, 0.1068115234375, 0.2052001953125, 0.21240234375, 0.122802734375, 0.027679443359375, 0.08551025390...	embed
11529932_c0	11529932	haskell	0	Title: How does setPosition work? Problem title: How does setPosition work? Tags: haskell, parsec Problem: How does setPosition work? I am unsure on how to use setPosition (Parsec library). Here is an extremely simple piece of code which should read the first 3 characters of the second line of a text. import Text.Parse...	How does setPosition work? How does setPosition work? haskell parsec Text.ParserCombinators.Parsec How How does setPosition work? I am unsure on how to use setPosition (Parsec library). Here is an extremely simple piece of code which should read the first 3 characters of the second line of a text. Still, the output is ...	[ -0.006256103515625, 0.01031494140625, 0.0179443359375, 0.052734375, -0.000885009765625, 0.018798828125, -0.00433349609375, -0.00714111328125, 0.0091552734375, -0.00004839897155761719, -0.0004024505615234375, 0.0203857421875, 0.0081787109375, -0.0074462890625, -0.010986328125, 0.0066223...	[ 11249, 14602, 5423, 7192, 172, 1363, 4488, 1556, 142508, 366, 39797, 24129, 28636, 2189, 19155, 22230, 51646, 3642, 4527, 35773, 1294, 111531, 8781, 18151, 5608, 12301, 5117, 138, 124850, 17932, 13315, 7986, 140992, 117177, 959, 2940, 12319, ...	[ 0.1043701171875, 0.1085205078125, 0.232177734375, 0.1943359375, 0.1910400390625, 0.16748046875, 0.153564453125, 0.09814453125, 0.18798828125, 0.055419921875, 0.175537109375, 0.0916748046875, 0.1019287109375, 0.037445068359375, 0.1278076171875, 0.057464599609375, 0.0252532958984375, ...	embed
34698377_c0	34698377	haskell	0	Title: Can Stack make sure that dependencies aren't tampered with? Problem title: Can Stack make sure that dependencies aren't tampered with? Tags: security, hackage, haskell-stack, haskell Problem: Can Stack make sure that dependencies aren't tampered with? One problem with Cabal is that it pulls packages fr...	Can Stack make sure that dependencies aren't tampered with? Can Stack make sure that dependencies aren't tampered with? security hackage haskell-stack haskell Can Stack Can Stack make sure that dependencies aren't tampered with? One problem with Cabal is that it pulls packages from Hackage, and as it's been d...	[ -0.00860595703125, 0.01458740234375, 0.0189208984375, 0.017333984375, -0.004974365234375, 0.00836181640625, -0.0047607421875, 0.0179443359375, 0.007568359375, 0.007110595703125, -0.0093994140625, 0.0031585693359375, 0.0194091796875, 0.048828125, -0.0081787109375, 0.00836181640625, -0...	[ 4171, 6512, 2594, 3249, 9077, 42548, 117538, 125381, 18, 190745, 71, 678, 3768, 48031, 85526, 4588, 1556, 142508, 590, 2967, 30438, 289, 50065, 98169, 1295, 52922, 5941, 48322, 3642, 63847, 8137, 60744, 18151, 831, 2046, 23, 52295, 170944, ...	[ 0.0821533203125, 0.2197265625, 0.207275390625, 0.0777587890625, 0.151123046875, 0.256591796875, 0.1807861328125, 0.043975830078125, 0.1109619140625, 0.2271728515625, 0.1165771484375, 0.142822265625, 0.002197265625, 0.156005859375, 0.1768798828125, 0.199462890625, 0.1474609375, 0.19...	embed
3957192_c0	3957192	haskell	0	Title: RankNTypes for instance declarations? Problem title: RankNTypes for instance declarations? Tags: types, type-systems, haskell, higher-rank-types Problem: RankNTypes for instance declarations? I've been playing around with RankNTypes recently and wonder if it is possible to use them in instance declarations. Here...	RankNTypes for instance declarations? RankNTypes for instance declarations? types type-systems haskell higher-rank-types RankNTypes Expr Add Show Evaluation RankNTypes for instance declarations? I've been playing around with RankNTypes recently and wonder if it is possible to use them in instance declarations. Here is ...	[ 0.004241943359375, 0.00103759765625, 0.000782012939453125, -0.00885009765625, -0.00787353515625, 0.0019378662109375, -0.0001354217529296875, -0.024658203125, -0.006744384765625, -0.03369140625, 0.00189208984375, -0.0284423828125, 0.01104736328125, -0.01708984375, -0.00179290771484375, ...	[ 134405, 839, 196707, 7, 100, 110527, 21635, 5256, 52895, 10644, 16751, 1556, 142508, 77546, 36467, 50986, 60075, 42, 29117, 17367, 151228, 75169, 10932, 32195, 7722, 4527, 23, 8781, 27781, 9803, 2053, 33022, 2816, 4288, 27494, 10, 876, 3444, ...	[ 0.2186279296875, 0.142333984375, 0.2822265625, 0.0419921875, 0.037322998046875, 0.2349853515625, 0.1783447265625, 0.043365478515625, 0.1986083984375, 0.1534423828125, 0.1143798828125, 0.0726318359375, 0.176513671875, 0.04315185546875, 0.1552734375, 0.2052001953125, 0.042755126953125,...	embed
51530084_c0	51530084	haskell	0	Title: Getting stack to build only haddock docs and not the library/executable Problem title: Getting stack to build only haddock docs and not the library/executable Tags: haskell-stack, haskell, haddock Problem: Getting stack to build only haddock docs and not the library/executable Following up from How to exclude de...	Getting stack to build only haddock docs and not the library/executable Getting stack to build only haddock docs and not the library/executable haskell-stack haskell haddock Getting Getting stack to build only haddock docs and not the library/executable Following up from How to exclude dependencies when building haddoc...	[ -0.01806640625, 0.017578125, -0.0146484375, -0.006927490234375, -0.006317138671875, 0.025146484375, -0.022216796875, -0.002471923828125, 0.01806640625, -0.020751953125, 0.004425048828125, -0.01953125, 0.007720947265625, 0.01446533203125, 0.0245361328125, 0.001678466796875, 0.00129699...	[ 210732, 177261, 47, 45367, 4734, 1902, 138414, 54, 4439, 959, 35773, 46480, 1010, 22819, 1556, 142508, 590, 2594, 39041, 42548, 117538, 33976, 7, 179933, 40956, 75101, 157, 8408, 112, 6423, 1467, 22584, 175254, 1294, 88303, 28129, 4034, 9433,...	[ 0.09124755859375, 0.2493896484375, 0.0220184326171875, 0.15869140625, 0.10467529296875, 0.1602783203125, 0.249267578125, 0.108642578125, 0.091064453125, 0.077880859375, 0.144775390625, 0.072998046875, 0.12548828125, 0.134033203125, 0.0826416015625, 0.1593017578125, 0.1195068359375, ...	embed
54034145_c0	54034145	haskell	0	Title: Pattern syntax in expression Problem title: Pattern syntax in expression Tags: monads, haskell Problem: Pattern syntax in expression I am wondering why am i getting this error since i have not used any pattern.In my case i have not pattern matched on the filterM 's lambda . Error Pattern syntax in expression con...	Pattern syntax in expression Pattern syntax in expression monads haskell System.Directory Control.Monad Pattern Fil getFiles::FilePath Pattern syntax in expression I am wondering why am i getting this error since i have not used any pattern.In my case i have not pattern matched on the filterM 's lambda . Error I just w...	[ -0.000667572021484375, 0.00921630859375, -0.025146484375, -0.01275634765625, -0.007415771484375, 0.011474609375, 0.01470947265625, -0.01116943359375, -0.00035858154296875, -0.014892578125, -0.000782012939453125, 0.0018310546875, -0.00811767578125, 0.001617431640625, 0.0032501220703125, ...	[ 9876, 22766, 6002, 86531, 23, 125195, 2667, 712, 1556, 142508, 12353, 184911, 27131, 46674, 24158, 2046, 174350, 683, 10519, 149016, 15400, 903, 18499, 765, 959, 11814, 2499, 103510, 14858, 46312, 594, 6492, 85, 212059, 3444, 102158, 14364, 2...	[ 0.22314453125, 0.193603515625, 0.1566162109375, 0.1932373046875, 0.047882080078125, 0.258544921875, 0.0841064453125, 0.123779296875, 0.06976318359375, 0.1846923828125, 0.0257110595703125, 0.0081787109375, 0.08203125, 0.0723876953125, 0.07867431640625, 0.022247314453125, 0.12329101562...	embed
21506748_c1	21506748	haskell	1	v True >> readIORef v always return True ? In the maybePrint case (from the IORef docs) would a readIORef myRef (along with maybe a seq or something) before readIORef yourRef have forced a barrier to reordering? What's the straightforward mental model I should have? Is it something like: within and from the point of v...	v True >> readIORef v always return True ? In the maybePrint case (from the IORef docs) would a readIORef myRef (along with maybe a seq or something) before readIORef yourRef have forced a barrier to reordering? What's the straightforward mental model I should have? Is it something like: within and from the point of v...	[ 0.0002880096435546875, 0.015869140625, 0.0047607421875, 0.01177978515625, 0.010498046875, 0.01116943359375, -0.004150390625, 0.0062255859375, -0.00408935546875, 0.0006103515625, 0.022705078125, -0.0013427734375, -0.0027008056640625, 0.02099609375, 0, -0.00042724609375, -0.01831054687...	[ 81, 87599, 12301, 123435, 4240, 11343, 30646, 51139, 112079, 18, 7225, 759, 190015, 40, 864, 8108, 935, 168861, 125861, 456, 80596, 80560, 13893, 3299, 5608, 28032, 6275, 21455, 11651, 86997, 12989, 214, 41018, 108975, 57, 86, 243228, 9969, ...	[ 0.2059326171875, 0.194091796875, 0.17431640625, 0.18115234375, 0.268798828125, 0.1241455078125, 0.1749267578125, 0.1690673828125, 0.1524658203125, 0.0169525146484375, 0.004638671875, 0.1097412109375, 0.25244140625, 0.042388916015625, 0.08624267578125, 0.047088623046875, 0.046875, 0...	embed
22027025_c0	22027025	haskell	0	Title: Calling a Haskell function from Ruby on Heroku Problem title: Calling a Haskell function from Ruby on Heroku Tags: haskell, ruby, heroku Problem: Calling a Haskell function from Ruby on Heroku So I'd like to call a Haskell function from a Ruby app running on Heroku. I'm aware of Hubris , but it seems unlikely to...	Calling a Haskell function from Ruby on Heroku Calling a Haskell function from Ruby on Heroku haskell ruby heroku Ruby Calling Haskell Heroku Calling a Haskell function from Ruby on Heroku So I'd like to call a Haskell function from a Ruby app running on Heroku. I'm aware of Hubris , but it seems unlikely to work in th...	[ 0.00008249282836914062, 0.02197265625, -0.00244140625, 0.000102996826171875, -0.0003299713134765625, 0.01104736328125, 0.001129150390625, -0.0194091796875, -0.0068359375, -0.051025390625, -0.0087890625, -0.0201416015625, 0.006256103515625, 0.0181884765625, 0.01025390625, -0.01361083984...	[ 26265, 214, 20625, 142508, 32354, 1295, 158189, 98, 56889, 319, 1556, 21922, 53, 40814, 1884, 11782, 4027, 51042, 107419, 53465, 3679, 4488, 19096, 11728, 47644, 191082, 96760, 18151, 47, 110, 55516, 1632, 51876, 147306, 188, 1542, 990, 26951...	[ 0.16845703125, 0.039764404296875, 0.1607666015625, 0.291015625, 0.19970703125, 0.12353515625, 0.26220703125, 0.09356689453125, 0.2008056640625, 0.1920166015625, 0.11767578125, 0.120849609375, 0.09637451171875, 0.1407470703125, 0.029998779296875, 0.1741943359375, 0.1490478515625, 0....	embed
45787011_c0	45787011	haskell	0	Title: Is getLine lazy? Problem title: Is getLine lazy? Tags: processing-efficiency, haskell, io, lazy-evaluation Problem: Is getLine lazy? Is getLine lazy? Say I have a very long line on the input. It's just a sequence of numbers. I only need to sum 3 first numbers. Will getLine be efficient and read only the first pa...	Is getLine lazy? Is getLine lazy? processing-efficiency haskell io lazy-evaluation Control.Applicative Is getLine lazy? Is getLine lazy? Say I have a very long line on the input. It's just a sequence of numbers. I only need to sum 3 first numbers. Will getLine be efficient and read only the first part of the line, or d...	[ -0.0157470703125, -0.0050048828125, 0.017578125, 0.014892578125, -0.005828857421875, 0.016357421875, 0.02734375, -0.0033416748046875, 0.0189208984375, -0.033447265625, 0.002532958984375, -0.0008392333984375, -0.0093994140625, -0.00074005126953125, -0.002685546875, 0.017578125, 0.0040...	[ 2071, 2046, 93232, 21, 3285, 9433, 11044, 1556, 142508, 22995, 159258, 27131, 11048, 4552, 4989, 13315, 107730, 944, 101935, 3871, 10554, 138, 5117, 93766, 12301, 2831, 28282, 10002, 32354, 16454, 124850, 1632, 208124, 645, 31251, 390 ]	[ 0.0635986328125, 0.169189453125, 0.280517578125, 0.1634521484375, 0.2083740234375, 0.0435791015625, 0.0479736328125, 0.1119384765625, 0.2171630859375, 0.161865234375, 0.1099853515625, 0.1470947265625, 0.024566650390625, 0.0147857666015625, 0.1026611328125, 0.1788330078125, 0.10913085...	embed
30718440_c2	30718440	haskell	2	5, tagsoup, text, scalpel, containers, network-uri, monad-loops, wreq, lens, bytestring, parsec, utf8-string, tagsoup, xml, feed, regex-pcre, aeson, network, wai, wai-extra, wai-cors, wai-middleware-static, warp, servant-server >= 0.4, rethinkdb >= 1.16, transformers, either, unordered-containers, mtl, http-types, safe...	5, tagsoup, text, scalpel, containers, network-uri, monad-loops, wreq, lens, bytestring, parsec, utf8-string, tagsoup, xml, feed, regex-pcre, aeson, network, wai, wai-extra, wai-cors, wai-middleware-static, warp, servant-server >= 0.4, rethinkdb >= 1.16, transformers, either, unordered-containers, mtl, http-types, safe...	[ 0.000247955322265625, 0.019775390625, 0.00994873046875, 0.00933837890625, -0.005706787109375, -0.00823974609375, -0.0103759765625, 0.01361083984375, -0.0019073486328125, 0.003936767578125, 0.00958251953125, -0.007293701171875, -0.01007080078125, 0.0084228515625, 0.002899169921875, 0.01...	[ 190, 4, 69141, 31, 2037, 7986, 117906, 5310, 116419, 7, 33120, 1162, 2667, 712, 28354, 107, 864, 3098, 390, 67, 91693, 39797, 420, 1019, 131492, 61590, 6835, 3355, 7612, 90, 191, 259, 14, 112779, 10517, 22000, 19298, 15876, 201939, 1631, ...	[ 0.2105712890625, 0.052581787109375, 0.171142578125, 0.0965576171875, 0.206787109375, 0.1820068359375, 0.05255126953125, 0.2034912109375, 0.2125244140625, 0.06390380859375, 0.1466064453125, 0.11474609375, 0.0941162109375, 0.127197265625, 0.1572265625, 0.1190185546875, 0.063232421875, ...	embed
59345398_c1	59345398	haskell	1	what type give to the evaluation function, as when state-annotated types are involved I think evaluation should be formulated as having a type close to the following: evalM :: Codensity AST (a := j) i -> Codensity ((->) St) (a := j) i where St allows us to keep track of state at the value-level, so that the right-hand...	what type give to the evaluation function, as when state-annotated types are involved I think evaluation should be formulated as having a type close to the following: evalM :: Codensity AST (a := j) i -> Codensity ((->) St) (a := j) i where St allows us to keep track of state at the value-level, so that the right-hand...	[ -0.017578125, -0.0014190673828125, -0.003265380859375, 0.0010223388671875, 0.0091552734375, -0.020263671875, -0.00909423828125, -0.0191650390625, 0.0019073486328125, -0.02587890625, -0.01068115234375, 0.0103759765625, -0.0023040771484375, 0.008544921875, 0.005035400390625, -0.010253906...	[ 10644, 8337, 47, 219836, 32354, 11341, 11071, 102, 52895, 75412, 5351, 5608, 26168, 3674, 237, 19441, 20903, 25632, 28, 1405, 594, 1311, 34609, 2481, 48963, 11, 1647, 17, 33079, 2907, 114864, 13695, 28560, 34292, 67919, 7108, 12336, 5609, 6...	[ 0.2196044921875, 0.093505859375, 0.06365966796875, 0.294677734375, 0.1461181640625, 0.1043701171875, 0.1129150390625, 0.035400390625, 0.179931640625, 0.04962158203125, 0.072998046875, 0.0677490234375, 0.16650390625, 0.07025146484375, 0.051177978515625, 0.058868408203125, 0.1496582031...	embed
9965716_c0	9965716	haskell	0	Title: How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? Problem title: How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? Tags: vector, ghc, haskell, unboxing Problem: How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? I want to use the vector p...	How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? vector ghc haskell unboxing How Data.Vector.Unbox StablePtr Haskell ptr2Int Ptr addr2Int int2Addr Unbox How to provide a Data.Vector.Unbox instance for StablePtr's in...	[ 0.0128173828125, 0.02783203125, 0.01019287109375, -0.010498046875, 0.002227783203125, 0.005462646484375, -0.0233154296875, -0.0225830078125, 0.00347900390625, -0.0220947265625, -0.00897216796875, -0.0245361328125, -0.01611328125, 0.03125, 0, 0.012939453125, 0.00145721435546875, 0.0...	[ 11249, 47, 22691, 11809, 26455, 18770, 14256, 11728, 110527, 100, 159, 22819, 683, 4448, 3768, 20625, 142508, 173, 31380, 238, 1556, 51, 27037, 42, 304, 4153, 436, 18, 7569, 992, 23, 3444, 4527, 98169, 4343, 10298, 4778, 25632, 143834, 15...	[ 0.0693359375, 0.0167388916015625, 0.122802734375, 0.1378173828125, 0.186279296875, 0.1953125, 0.12841796875, 0.2451171875, 0.2415771484375, 0.0091552734375, 0.0389404296875, 0.2117919921875, 0.085693359375, 0.214599609375, 0.0994873046875, 0.1392822265625, 0.2486572265625, 0.158691...	embed
61789891_c1	61789891	haskell	1	them. I am so lost now on how to even start and I'm more so looking for hints rather than have the code written out so I can learn. I know I need a case of x but should I use foldl? an accumulator? and what would that look like as accumulators still confuse me EDIT** I've tried with List Comprehension but I'm not sure...	them. I am so lost now on how to even start and I'm more so looking for hints rather than have the code written out so I can learn. I know I need a case of x but should I use foldl? an accumulator? and what would that look like as accumulators still confuse me EDIT** I've tried with List Comprehension but I'm not sure...	[ -0.0167236328125, 0.00927734375, -0.001800537109375, -0.00006246566772460938, 0.00213623046875, 0.01275634765625, -0.000885009765625, 0.0111083984375, -0.0029296875, 0.00244140625, 0.0179443359375, -0.023193359375, 0.00921630859375, 0.0157470703125, -0.01611328125, 0.003753662109375, ...	[ 2856, 5, 444, 221, 72856, 5036, 3642, 47, 3853, 4034, 1286, 16487, 5122, 18151, 30698, 3714, 3871, 10, 7225, 111, 1022, 5608, 4527, 18344, 20469, 183278, 1290, 6713, 22230, 55681, 37842, 678, 32036, 142158, 3220, 6889, 9077, 70163, 756, 1...	[ 0.173095703125, 0.0203094482421875, 0.03240966796875, 0.06878662109375, 0.115478515625, 0.04949951171875, 0.05450439453125, 0.008636474609375, 0.0208740234375, 0.0780029296875, 0.0148773193359375, 0.01641845703125, 0.077392578125, 0.173095703125, 0.0880126953125, 0.040679931640625, 0...	embed
35999706_c0	35999706	haskell	0	Title: Do typing judgements have a kind? Problem title: Do typing judgements have a kind? Tags: haskell, polymorphism, type-kinds, dependent-type, types Problem: Do typing judgements have a kind? In Richard Eisenberg's talk on his work with levity polymorphism for dependent Haskell, he clearly shows that this judgement...	Do typing judgements have a kind? Do typing judgements have a kind? haskell polymorphism type-kinds dependent-type types Star Do typing judgements have a kind? In Richard Eisenberg's talk on his work with levity polymorphism for dependent Haskell, he clearly shows that this judgement / type is sound: Does this mean tha...	[ 0.00836181640625, -0.0052490234375, 0.002410888671875, -0.0140380859375, 0.01336669921875, -0.005615234375, -0.0025482177734375, -0.01531982421875, 0.00390625, -0.0194091796875, -0.0021209716796875, -0.0166015625, -0.0022125244140625, -0.0068359375, -0.019287109375, -0.00457763671875, ...	[ 11417, 214, 116983, 9035, 765, 10, 8562, 1556, 142508, 35874, 178851, 10644, 68347, 108750, 50986, 52895, 4612, 984, 22758, 138745, 4969, 22120, 37498, 939, 20625, 123019, 45831, 903, 674, 83, 45730, 29459, 61261, 661, 1286, 110677, 176377, 1...	[ 0.2044677734375, 0.1082763671875, 0.2247314453125, 0.12548828125, 0.0770263671875, 0.0872802734375, 0.238037109375, 0.0936279296875, 0.20703125, 0.13818359375, 0.1611328125, 0.219482421875, 0.1568603515625, 0.1492919921875, 0.1744384765625, 0.167724609375, 0.148193359375, 0.0162353...	embed
24343787_c0	24343787	haskell	0	Title: splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell Problem title: splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell Tags: haskell Problem: splitting a list of integers to 2 lists: one of positive ...	splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell haskell splitting a list of integers to 2 lists: one of positive numbers and the other of negative num...	[ -0.0166015625, -0.01251220703125, -0.0030670166015625, -0.004241943359375, -0.02734375, 0.0230712890625, 0.00171661376953125, 0.01177978515625, 0.0002765655517578125, 0.023681640625, 0.0036773681640625, -0.0142822265625, 0.000606536865234375, 0.005340576171875, -0.00543212890625, 0.002...	[ 65450, 1916, 5303, 892, 26255, 47, 116, 111, 24491, 101935, 136, 3789, 40907, 1556, 142508, 11249, 831, 87, 81887, 7722, 54, 17932, 9790, 209303, 7464, 959, 20949, 26785, 16750, 11675, 4163 ]	[ 0.2158203125, 0.0560302734375, 0.2269287109375, 0.135498046875, 0.1295166015625, 0.11767578125, 0.159912109375, 0.05389404296875, 0.194580078125, 0.112060546875, 0.0166778564453125, 0.056365966796875, 0.193359375, 0.0919189453125, 0.180419921875, 0.033477783203125, 0.0546875, 0.016...	embed
29381484_c3	29381484	haskell	3	P30375, Gogo-A, Gorilla, MAVMAPRTLVLLLSGALALTQTWAGSHSMRYFSTSVSRPGRGEPRFIAVGYVDDTQFVRF, DSDAASQRMEPRAPWIEQEGPEYWDRNTRNVKAHSQTDRVDLGTLRGYYNQSEDGSHTIQ, RMYGCDVGSDGRFLRGYQQDAYDGKDYIALNEDLRSWTAADMAAEITKRKWEAAHFAEQL, RAYLEGTCVEWLRRHLENGKETLQRTDAPKTHMTHHAVSDHEAILRCWALSFYPAEITLT, WQRDGEDQTQDTELVETRPAGDGTFQKWAAVVVPSGQEQRYTCHVQ...	P30375, Gogo-A, Gorilla, MAVMAPRTLVLLLSGALALTQTWAGSHSMRYFSTSVSRPGRGEPRFIAVGYVDDTQFVRF, DSDAASQRMEPRAPWIEQEGPEYWDRNTRNVKAHSQTDRVDLGTLRGYYNQSEDGSHTIQ, RMYGCDVGSDGRFLRGYQQDAYDGKDYIALNEDLRSWTAADMAAEITKRKWEAAHFAEQL, RAYLEGTCVEWLRRHLENGKETLQRTDAPKTHMTHHAVSDHEAILRCWALSFYPAEITLT, WQRDGEDQTQDTELVETRPAGDGTFQKWAAVVVPSGQEQRYTCHVQ...	[ 0.004547119140625, 0.0233154296875, 0.00909423828125, -0.00543212890625, 0.001251220703125, -0.023681640625, 0.00909423828125, 0.0050048828125, 0.01007080078125, 0.036376953125, 0.0245361328125, 0.0050048828125, -0.0087890625, -0.003875732421875, -0.000591278076171875, -0.0046691894531...	[ 436, 1197, 85433, 4, 173529, 9, 284, 12035, 2298, 276, 27816, 105748, 20503, 32811, 23708, 19759, 88946, 23613, 12927, 34388, 36381, 12763, 47207, 38796, 49741, 11679, 17255, 22724, 24231, 919, 41869, 6538, 9713, 21290, 132191, 161357, 151149, ...	[ 0.198486328125, 0.271240234375, 0.345458984375, 0.1385498046875, 0.299560546875, 0.1915283203125, 0.222412109375, 0.2177734375, 0.263916015625, 0.082763671875, 0.17578125, 0.0799560546875, 0.0430908203125, 0.07025146484375, 0.0355224609375, 0.034332275390625, 0.06207275390625, 0.03...	embed
63420753_c0	63420753	haskell	0	Title: Implementing Applicative instance for dictionaries (Map, associated arrays) Problem title: Implementing Applicative instance for dictionaries (Map, associated arrays) Tags: data-structures, functional-programming, haskell, separation-of-concerns Problem: Implementing Applicative instance for dictionaries (Map, a...	Implementing Applicative instance for dictionaries (Map, associated arrays) Implementing Applicative instance for dictionaries (Map, associated arrays) data-structures functional-programming haskell separation-of-concerns Implementing Applicative Map Functor Implementing Applicative instance for dictionaries (Map, asso...	[ 0.014404296875, 0.0033416748046875, 0.00225830078125, 0.0126953125, -0.0029144287109375, 0.005950927734375, 0.015869140625, -0.0062255859375, 0.0164794921875, -0.00445556640625, 0.00145721435546875, -0.009765625, 0.000591278076171875, 0.02587890625, 0.005523681640625, -0.00009393692016...	[ 153941, 214, 5659, 11048, 4935, 110527, 100, 45, 10763, 11, 10484, 166179, 137272, 10298, 4778, 2053, 137656, 123309, 28966, 1556, 142508, 37451, 4390, 3443, 42719, 28670, 18770, 37202, 80560, 2472, 47, 29479, 7477, 37720, 291, 26783, 41018, ...	[ 0.2147216796875, 0.03143310546875, 0.1888427734375, 0.2261962890625, 0.197998046875, 0.268310546875, 0.0777587890625, 0.102294921875, 0.1424560546875, 0.110595703125, 0.0853271484375, 0.23583984375, 0.196044921875, 0.1153564453125, 0.0960693359375, 0.0762939453125, 0.09307861328125, ...	embed
14103667_c0	14103667	haskell	0	Title: How to draw on an X11 Drawable with Cairo in Haskell Problem title: How to draw on an X11 Drawable with Cairo in Haskell Tags: x11, surface, xlib, haskell, cairo Problem: How to draw on an X11 Drawable with Cairo in Haskell I recently made my first steps in X11 programming in Haskell and now I want to draw texts...	How to draw on an X11 Drawable with Cairo in Haskell How to draw on an X11 Drawable with Cairo in Haskell x11 surface xlib haskell cairo How X11 Drawable Cairo Haskell cairo_xlib_surface_create How to draw on an X11 Drawable with Cairo in Haskell I recently made my first steps in X11 programming in Haskell and now I wa...	[ 0.00927734375, 0.01300048828125, -0.0059814453125, 0.00506591796875, -0.007537841796875, 0.0011749267578125, 0.028076171875, -0.0059814453125, -0.00860595703125, -0.025146484375, 0.00860595703125, -0.0264892578125, 0.01251220703125, 0.00689697265625, -0.00179290771484375, 0.00207519531...	[ 11249, 79442, 98, 1193, 1662, 18186, 434, 2886, 678, 149109, 31, 20625, 142508, 1022, 71579, 5612, 1556, 78968, 425, 7102, 40404, 7612, 23, 98441, 56037, 7986, 17368, 683, 27803, 313, 57143, 28282, 2182, 137565, 1264, 32354, 132283, 3917, 1...	[ 0.049163818359375, 0.1923828125, 0.07244873046875, 0.114990234375, 0.1942138671875, 0.07171630859375, 0.0838623046875, 0.16455078125, 0.09332275390625, 0.203857421875, 0.1990966796875, 0.1026611328125, 0.1878662109375, 0.0186767578125, 0.1602783203125, 0.18798828125, 0.03823852539062...	embed
16576465_c0	16576465	haskell	0	Title: What does Tree(Int,Int) mean in haskell? Problem title: What does Tree(Int,Int) mean in haskell? Tags: tuples, tree, haskell Problem: What does Tree(Int,Int) mean in haskell? I am learning data structures in Haskell right now. I saw something like: Tree(Int,Int) Does that mean tuple of trees? I'm trying to write...	What does Tree(Int,Int) mean in haskell? What does Tree(Int,Int) mean in haskell? tuples tree haskell What Tree Leaf Node Show Integer What does Tree(Int,Int) mean in haskell? I am learning data structures in Haskell right now. I saw something like: Does that mean tuple of trees? I'm trying to write something like: But...	[ 0.01495361328125, 0.0203857421875, -0.0079345703125, 0.015380859375, 0.0159912109375, 0.024658203125, -0.02001953125, -0.0211181640625, 0.003997802734375, -0.030517578125, -0.0186767578125, -0.0211181640625, 0.0048828125, 0.00726318359375, -0.003814697265625, 0.0059814453125, 0.02697...	[ 4865, 14602, 101344, 132, 4153, 18, 4, 29459, 23, 1556, 142508, 370, 99726, 53201, 636, 2407, 438, 112, 17367, 44401, 2053, 45646, 20625, 24124, 450, 8705, 111, 1360, 90, 69427, 14858, 18499, 2046, 57888, 12638, 30646, 11001, 765 ]	[ 0.0570068359375, 0.044525146484375, 0.274658203125, 0.044830322265625, 0.10150146484375, 0.1317138671875, 0.039031982421875, 0.1248779296875, 0.048248291015625, 0.113037109375, 0.197509765625, 0.1004638671875, 0.159423828125, 0.1654052734375, 0.03997802734375, 0.1103515625, 0.0991821...	embed
47350937_c0	47350937	haskell	0	Title: type "name" = Int - is it worth declaring? Problem title: type "name" = Int - is it worth declaring? Tags: declaration, data-structures, haskell Problem: type "name" = Int - is it worth declaring? I have a function that returns the Price of a product, it currently looks like priceOfProduct:: ...	type "name" = Int - is it worth declaring? type "name" = Int - is it worth declaring? declaration data-structures haskell Price type "name" = Int - is it worth declaring? I have a function that returns the Price of a product, it currently looks like Is it worth declaring so that the function becomes...	[ 0.0247802734375, 0.006744384765625, -0.0020751953125, 0.020263671875, 0.0034637451171875, 0.015869140625, -0.005767822265625, 0.0018768310546875, 0.026611328125, 0.0107421875, 0.0074462890625, 0.0191650390625, -0.01202392578125, -0.001617431640625, 0.01409912109375, 0.0181884765625, ...	[ 10644, 11627, 2203, 360, 18, 83, 41965, 8, 18347, 2852, 21635, 1363, 2053, 137656, 1556, 142508, 48025, 442, 32354, 30646, 12996, 82424, 33342, 1884, 2071, 24209, 17569, 4527, 370, 99726, 933, 6713, 11522, 10002, 45646, 80234, 63559, 4127, ...	[ 0.1829833984375, 0.185791015625, 0.08251953125, 0.1351318359375, 0.16064453125, 0.048492431640625, 0.1488037109375, 0.116943359375, 0.1922607421875, 0.1282958984375, 0.197509765625, 0.00677490234375, 0.0826416015625, 0.150146484375, 0.07977294921875, 0.201904296875, 0.2044677734375, ...	embed
64946789_c0	64946789	haskell	0	Title: How to make a table that works in github markdown and hackage? Problem title: How to make a table that works in github markdown and hackage? Tags: hackage, haskell, markdown Problem: How to make a table that works in github markdown and hackage? It seems that both formats support tables, though they are complete...	How to make a table that works in github markdown and hackage? How to make a table that works in github markdown and hackage? hackage haskell markdown How How to make a table that works in github markdown and hackage? It seems that both formats support tables, though they are completely different formats. GitHub Markdo...	[ 0.007598876953125, 0.0030517578125, -0.004913330078125, -0.0155029296875, -0.0010223388671875, 0.00150299072265625, 0.00439453125, 0.0016326904296875, -0.007781982421875, -0.004913330078125, 0.002685546875, -0.034423828125, -0.008056640625, 0.00958251953125, -0.0208740234375, 0.0041198...	[ 11249, 47, 3249, 23180, 450, 43240, 23, 62270, 32102, 16188, 34695, 136, 85526, 4588, 10, 1556, 142508, 15044, 9384, 8060, 12921, 527, 217, 140505, 7880, 55720, 59725, 29191, 1614, 3509, 19097, 7722, 52922, 6392, 79298, 44116, 10776, 12301, ...	[ 0.06243896484375, 0.0166778564453125, 0.1427001953125, 0.2646484375, 0.0740966796875, 0.1622314453125, 0.0546875, 0.1502685546875, 0.2003173828125, 0.157958984375, 0.157470703125, 0.121826171875, 0.193359375, 0.1400146484375, 0.048492431640625, 0.10400390625, 0.1741943359375, 0.062...	embed
41103420_c0	41103420	haskell	0	Title: How to manipulate trees in Haskell Problem title: How to manipulate trees in Haskell Tags: haskell, tree, binary-tree, data-structures Problem: How to manipulate trees in Haskell I would like to write a function that, given an n will exactly add the amount of leaves without degenerating the tree. Something like ...	How to manipulate trees in Haskell How to manipulate trees in Haskell haskell tree binary-tree data-structures How Haskell SimpleT Show addTree::Int addTree2 How to manipulate trees in Haskell I would like to write a function that, given an n will exactly add the amount of leaves without degenerating the tree. Somethin...	[ 0.0189208984375, 0.012451171875, -0.01953125, -0.008544921875, 0.0172119140625, 0.01068115234375, -0.01483154296875, -0.02294921875, 0.00762939453125, -0.03515625, 0.0196533203125, -0.03564453125, 0.005096435546875, 0.0194091796875, 0.012939453125, 0.00823974609375, 0.02001953125, ...	[ 11249, 45258, 67, 1360, 90, 20625, 142508, 47, 23, 1556, 53201, 2394, 6635, 62600, 2053, 137656, 60552, 618, 17367, 15190, 62731, 18, 304, 1884, 33022, 32354, 34475, 653, 1221, 66161, 41170, 31358, 15490, 8, 48281, 903, 13, 61924, 237, 71...	[ 0.041290283203125, 0.236328125, 0.09124755859375, 0.220947265625, 0.09454345703125, 0.141357421875, 0.23779296875, 0.0235595703125, 0.047637939453125, 0.1236572265625, 0.181396484375, 0.0877685546875, 0.046600341796875, 0.177978515625, 0.047821044921875, 0.07843017578125, 0.101745605...	embed
44155749_c0	44155749	haskell	0	Title: Combinatorics in Erlang Problem title: Combinatorics in Erlang Tags: erlang, haskell Problem: Combinatorics in Erlang I want to find combinatorics of integer in Erlang, equivalent of this Haskell code: composition 0 = [[]] composition n = [x:rest \| x <- [1..n], rest <- composition (n-x)] so far I tried this whic...	Combinatorics in Erlang Combinatorics in Erlang erlang haskell combinatorics Erlang x:rest lists:seq N-X combinatorics:comb combinatorics.erl Combinatorics in Erlang I want to find combinatorics of integer in Erlang, equivalent of this Haskell code: so far I tried this which It doesn't work: The code return This error:	[ -0.04541015625, 0.0206298828125, 0.01409912109375, 0.0084228515625, -0.0084228515625, 0.006011962890625, -0.0035400390625, 0.01214599609375, -0.0036468505859375, -0.032470703125, -0.00070953369140625, -0.002685546875, 0.036376953125, 0.00005316734313964844, -0.01263427734375, -0.001548...	[ 106935, 19, 13300, 4439, 1004, 3066, 72, 1556, 142508, 22321, 3826, 1022, 56644, 5303, 184, 864, 541, 9, 1542, 277, 275, 56, 141, 3444, 7413, 111, 892, 1505, 23, 183234, 20625, 18151, 2060, 37842, 1650, 22027, 18, 4488, 30646, 3293, 184...	[ 0.1727294921875, 0.10595703125, 0.1529541015625, 0.106201171875, 0.138671875, 0.28662109375, 0.056854248046875, 0.06103515625, 0.233642578125, 0.204345703125, 0.13671875, 0.04443359375, 0.1318359375, 0.121826171875, 0.0543212890625, 0.1612548828125, 0.034149169921875, 0.00521850585...	embed
64252010_c0	64252010	haskell	0	Title: Is there a way to compare Haskell and C functions via AutoBench? Problem title: Is there a way to compare Haskell and C functions via AutoBench? Tags: haskell, c, autobench, benchmarking Problem: Is there a way to compare Haskell and C functions via AutoBench? I am used to benchmark Haskell functions via AutoBen...	Is there a way to compare Haskell and C functions via AutoBench? Is there a way to compare Haskell and C functions via AutoBench? haskell c autobench benchmarking Haskell AutoBench Is there a way to compare Haskell and C functions via AutoBench? I am used to benchmark Haskell functions via AutoBench but I haven't found...	[ 0.0032196044921875, -0.022216796875, 0.0157470703125, -0.000820159912109375, -0.0023193359375, 0.00482177734375, 0.00543212890625, -0.00555419921875, -0.0157470703125, -0.0294189453125, -0.00970458984375, -0.0009765625, 0.005523681640625, 0.0034027099609375, 0.00494384765625, -0.030151...	[ 3917, 47, 69101, 20625, 142508, 136, 313, 32354, 1829, 4396, 45901, 206, 10, 1556, 501, 1809, 776, 240057, 214, 11814, 3004, 37397, 678, 442, 3871, 116, 61590, 96759, 18, 5303, 27983, 11675, 6032, 1733, 51, 4084, 75101, 64557, 44691, 2046...	[ 0.10546875, 0.038482666015625, 0.210205078125, 0.1063232421875, 0.2587890625, 0.10418701171875, 0.1787109375, 0.206298828125, 0.06671142578125, 0.1778564453125, 0.1966552734375, 0.14501953125, 0.00177001953125, 0.094970703125, 0.1304931640625, 0.1568603515625, 0.18408203125, 0.2239...	embed
16154592_c0	16154592	haskell	0	Title: Haskell: No instance for (Eq a) arising from a use of `==' Problem title: Haskell: No instance for (Eq a) arising from a use of `==' Tags: haskell Problem: Haskell: No instance for (Eq a) arising from a use of `==' isPalindrome :: [a] -> Bool isPalindrome xs = case xs of [] -> True [x] -> True a -> (la...	Haskell: No instance for (Eq a) arising from a use of `==' Haskell: No instance for (Eq a) arising from a use of `==' haskell a Haskell Bool Haskell: No instance for (Eq a) arising from a use of `==' results in Why is this error occurring?	[ -0.0031890869140625, 0.015869140625, -0.00148773193359375, 0.00653076171875, 0.004425048828125, 0.034912109375, 0.01300048828125, -0.0218505859375, -0.00005459785461425781, 0.0067138671875, 0.0120849609375, -0.021484375, 0.0027008056640625, -0.006317138671875, -0.00457763671875, -0.027...	[ 20625, 142508, 438, 110527, 100, 864, 10, 187, 72219, 1295, 4527, 69112, 425, 3768, 12, 1556, 2460, 929, 111, 50339, 44084, 83, 903, 18499, 74918, 2852 ]	[ 0.169921875, 0.2587890625, 0.159912109375, 0.25244140625, 0.1044921875, 0.168212890625, 0.1273193359375, 0.09686279296875, 0.0947265625, 0.081298828125, 0.140625, 0.28662109375, 0.000762939453125, 0.173095703125, 0.009857177734375, 0.1663818359375, 0.0931396484375, 0.1759033203125,...	embed
17447415_c0	17447415	haskell	0	Title: Saving the state of a random number generator in haskell Problem title: Saving the state of a random number generator in haskell Tags: haskell, random Problem: Saving the state of a random number generator in haskell I'm currently using the Crypto.Random and Crypto.Random.DRBG Haskell libraries for generating ra...	Saving the state of a random number generator in haskell Saving the state of a random number generator in haskell haskell random Saving Crypto.Random Crypto.Random.DRBG Show Saving the state of a random number generator in haskell I'm currently using the Crypto.Random and Crypto.Random.DRBG Haskell libraries for genera...	[ 0.000736236572265625, 0.0101318359375, 0.01055908203125, -0.0022430419921875, -0.005889892578125, 0.015869140625, 0.0020294189453125, -0.0230712890625, -0.00010538101196289062, -0.033935546875, -0.0057373046875, 0.0150146484375, 0.00885009765625, 0.030517578125, 0.0037078857421875, -0....	[ 947, 6496, 11341, 96759, 14012, 145823, 23, 1556, 142508, 111, 201543, 126525, 3815, 23498, 85556, 17367, 17368, 20625, 35773, 10484, 12663, 101935, 3871, 47, 4343, 2363, 117249, 3173, 11435, 124326, 3444, 21342, 5701, 6626, 103391, 139392, 129...	[ 0.153564453125, 0.0655517578125, 0.19189453125, 0.170166015625, 0.1229248046875, 0.2362060546875, 0.05328369140625, 0.1373291015625, 0.2218017578125, 0.02838134765625, 0.1490478515625, 0.10302734375, 0.160400390625, 0.058929443359375, 0.1497802734375, 0.2120361328125, 0.0351257324218...	embed
51015178_c0	51015178	haskell	0	Title: How to get rid of the black console window for a compiled Haskell GUI application Problem title: How to get rid of the black console window for a compiled Haskell GUI application Tags: gtk, glade, user-interface, haskell Problem: How to get rid of the black console window for a compiled Haskell GUI application I...	How to get rid of the black console window for a compiled Haskell GUI application How to get rid of the black console window for a compiled Haskell GUI application gtk glade user-interface haskell How Haskell GUI stack-1.7.1 ghc-8.2.2 glade-3.8 How to get rid of the black console window for a compiled Haskell GUI appli...	[ 0.005340576171875, 0.01708984375, 0.0133056640625, 0.0037994384765625, 0.007537841796875, 0.0115966796875, 0.000614166259765625, -0.00628662109375, -0.016357421875, -0.00653076171875, 0.01153564453125, -0.04345703125, -0.00531005859375, 0.006683349609375, 0.002105712890625, 0.003677368...	[ 11249, 2046, 31351, 111, 70, 22556, 130250, 76896, 100, 375, 5974, 20625, 142508, 195490, 38415, 31472, 116755, 38937, 10433, 1556, 177261, 165830, 31380, 238, 17376, 70147, 135527, 678, 1328, 20682, 3882, 14847, 11675, 71924, 2886, 10, 11343, ...	[ 0.053070068359375, 0.07867431640625, 0.165771484375, 0.09454345703125, 0.046356201171875, 0.2379150390625, 0.263427734375, 0.230712890625, 0.0301971435546875, 0.0745849609375, 0.14794921875, 0.1280517578125, 0.22705078125, 0.2159423828125, 0.1451416015625, 0.128173828125, 0.196289062...	embed
52693299_c0	52693299	haskell	0	Title: I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" Problem title: I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" Tags: recursion, pattern-matchin...	I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" recursion pattern-matching haskell Non-exhaustive Inte...	[ -0.0361328125, 0.0233154296875, 0.0035247802734375, 0.007049560546875, -0.0084228515625, 0.000010788440704345703, -0.0269775390625, -0.000568389892578125, 0.0179443359375, -0.0113525390625, 0.0267333984375, 0.00775146484375, 0.00439453125, -0.0267333984375, 0.007598876953125, 0.0079345...	[ 3768, 31577, 15265, 64552, 12996, 80934, 1556, 142508, 18499, 59881, 3355, 18391, 4935, 103510, 7, 23, 32354, 54433, 195625, 98753, 3775, 44401, 1022, 12, 425, 1632, 22027, 18, 4488, 70, 72, 18304, 35064, 17368, 14858, 61353, 43240, 5885 ]	[ 0.042877197265625, 0.03778076171875, 0.0714111328125, 0.1119384765625, 0.1978759765625, 0.1475830078125, 0.1318359375, 0.2078857421875, 0.1585693359375, 0.165283203125, 0.06787109375, 0.146728515625, 0.049713134765625, 0.20654296875, 0.007568359375, 0.0758056640625, 0.15966796875, ...	embed
19320169_c0	19320169	haskell	0	Title: Filter duplicate events in reactive-banana Problem title: Filter duplicate events in reactive-banana Tags: frp, haskell, reactive-banana Problem: Filter duplicate events in reactive-banana Let's say I have x :: Event t (A,B) I can get the first component of it: fst <$> x :: Event t A However, this event will fir...	Filter duplicate events in reactive-banana Filter duplicate events in reactive-banana frp haskell reactive-banana Filter Event Moment Filter duplicate events in reactive-banana Let's say I have I can get the first component of it: However, this event will fire even when the first component doesn't change. I want to avo...	[ -0.01361083984375, 0.031982421875, -0.0081787109375, -0.0103759765625, 0.0008087158203125, -0.01214599609375, 0.01470947265625, 0.0225830078125, -0.0009002685546875, -0.046142578125, -0.04541015625, 0.025390625, -0.00014495849609375, 0.03271484375, -0.01348876953125, 0.0152587890625, ...	[ 128896, 171763, 67, 47353, 456, 71232, 105281, 11, 14119, 254, 1556, 142508, 36943, 29339, 831, 2046, 5117, 82761, 19732, 1221, 11476, 3853, 22027, 18, 15549, 3444, 71864, 2806, 185553, 135587, 65970, 62, 110527, 864, 87388, 208479, 959, 9881...	[ 0.239501953125, 0.2332763671875, 0.063720703125, 0.2022705078125, 0.0860595703125, 0.190673828125, 0.1658935546875, 0.14599609375, 0.03936767578125, 0.04254150390625, 0.06182861328125, 0.16357421875, 0.140380859375, 0.1942138671875, 0.0207977294921875, 0.0728759765625, 0.059295654296...	embed
19513589_c0	19513589	haskell	0	Title: Defining a new instance over Yesod's Key a? Problem title: Defining a new instance over Yesod's Key a? Tags: yesod, type-families, haskell Problem: Defining a new instance over Yesod's Key a? Having received a value of type Key a , I can easily define and use this function: keyToInt64 :: Key a -> Int64...	Defining a new instance over Yesod's Key a? Defining a new instance over Yesod's Key a? yesod type-families haskell Defining Yesod Key keyToInt64 Int64 PersistInt64 Num Illegal Defining a new instance over Yesod's Key a? Having received a value of type Key a , I can easily define and use this function: Howeve...	[ -0.0028839111328125, 0.0026397705078125, 0.0010223388671875, -0.031982421875, -0.0084228515625, 0.01397705078125, 0.006072998046875, -0.01324462890625, -0.0064697265625, -0.0201416015625, 0.0027618408203125, -0.031494140625, -0.0196533203125, -0.003204345703125, -0.01031494140625, -0.0...	[ 88606, 449, 3525, 110527, 645, 32635, 2199, 3768, 26824, 10, 2422, 23722, 10644, 69128, 1556, 142508, 22799, 7763, 18, 13307, 57309, 271, 52782, 891, 86966, 75204, 34292, 111, 72546, 61924, 4527, 32354, 831, 5701, 1295, 28032, 100, 18499, 9...	[ 0.194091796875, 0.06298828125, 0.1370849609375, 0.245849609375, 0.137939453125, 0.173095703125, 0.24658203125, 0.0654296875, 0.1551513671875, 0.1566162109375, 0.1124267578125, 0.2042236328125, 0.1695556640625, 0.102783203125, 0.0863037109375, 0.1934814453125, 0.102783203125, 0.1071...	embed
47236567_c0	47236567	haskell	0	Title: Haskell Data "Error - Control stack overflow" Problem title: Haskell Data "Error - Control stack overflow" Tags: haskell, instance Problem: Haskell Data "Error - Control stack overflow" I'm a newbie in Haskell and I am writing my first data structure. data Nat = Null \| N Nat For example: 5 is...	Haskell Data "Error - Control stack overflow" Haskell Data "Error - Control stack overflow" haskell instance Haskell Data Error Control Nat Show Ord Num Enum xs2 Haskell Data "Error - Control stack overflow" I'm a newbie in Haskell and I am writing my first data structure. For example: 5 is N (N (N ...	[ 0.00396728515625, 0.0096435546875, 0.00775146484375, 0.0014495849609375, 0.0255126953125, 0.0005645751953125, 0.0196533203125, -0.02685546875, 0.0186767578125, -0.0081787109375, 0.006256103515625, -0.025634765625, 0.035888671875, 0.0034027099609375, 0.005950927734375, 0.01177978515625,...	[ 20625, 142508, 11809, 18468, 31611, 27131, 177261, 645, 118664, 1556, 110527, 212059, 68875, 17367, 35379, 52782, 357, 316, 1022, 7, 304, 3525, 9014, 32562, 5117, 2053, 45646, 190, 83, 541, 839, 1429, 1181, 28282, 1295, 864, 54397, 21771, 4...	[ 0.141845703125, 0.261474609375, 0.15380859375, 0.135986328125, 0.176513671875, 0.2437744140625, 0.1741943359375, 0.1287841796875, 0.268310546875, 0.1219482421875, 0.2091064453125, 0.178466796875, 0.1624755859375, 0.1961669921875, 0.155029296875, 0.15478515625, 0.05419921875, 0.1881...	embed
9547325_c1	9547325	haskell	1	written through some STM mechanism, such as a TChan . A special thread receives these messages, passing out data requested through another TChan , or taking received data and writing it to the shared data structure. This solution seems free of the problems plaguing solutions 1-3, but it also seems to me that it essent...	written through some STM mechanism, such as a TChan . A special thread receives these messages, passing out data requested through another TChan , or taking received data and writing it to the shared data structure. This solution seems free of the problems plaguing solutions 1-3, but it also seems to me that it essent...	[ -0.0054931640625, 0.03125, -0.0205078125, 0.0125732421875, 0.0186767578125, -0.01171875, -0.000370025634765625, -0.0130615234375, -0.006134033203125, -0.0380859375, -0.007080078125, -0.003936767578125, -0.002349853515625, 0.032470703125, -0.0115966796875, 0.0205078125, 0.019165039062...	[ 59121, 8305, 159, 10111, 191619, 384, 127008, 5361, 86997, 53299, 89914, 452, 2053, 50336, 35971, 75204, 32562, 47, 99764, 45646, 29806, 37202, 4092, 44402, 58650, 51347, 54867, 85590, 76199, 1257, 17368, 26267, 2449, 13695, 74729, 1660, 26008,...	[ 0.1495361328125, 0.0697021484375, 0.0777587890625, 0.2474365234375, 0.198486328125, 0.061614990234375, 0.208251953125, 0.1177978515625, 0.19482421875, 0.07421875, 0.1458740234375, 0.09814453125, 0.11474609375, 0.136962890625, 0.0067138671875, 0.0635986328125, 0.1248779296875, 0.007...	embed
64175005_c0	64175005	haskell	0	Title: How do I use Aeson to generate a literal (unquoted) javascript expression? Problem title: How do I use Aeson to generate a literal (unquoted) javascript expression? Tags: json, object-literal, template-haskell, haskell, aeson Problem: How do I use Aeson to generate a literal (unquoted) javascript expression? i'm...	How do I use Aeson to generate a literal (unquoted) javascript expression? How do I use Aeson to generate a literal (unquoted) javascript expression? json object-literal template-haskell haskell aeson How Aeson Value vega.Debug Data.Aeson.QQ.Simple How do I use Aeson to generate a literal (unquoted) javascript expressi...	[ -0.0103759765625, -0.0228271484375, -0.033447265625, -0.00860595703125, -0.0162353515625, -0.00860595703125, -0.000530242919921875, 0.01519775390625, -0.00384521484375, -0.01055908203125, 0.010009765625, 0.0284423828125, 0.006988525390625, -0.003936767578125, 0.01129150390625, 0.000720...	[ 11249, 4527, 62, 90, 191, 139392, 15659, 289, 309, 68726, 136951, 125195, 1647, 1681, 36746, 39798, 110934, 10557, 142508, 1556, 10, 190060, 173, 208, 4657, 85779, 11809, 284, 66286, 8859, 33209, 47, 17368, 32354, 3871, 27875, 903, 134598, ...	[ 0.06494140625, 0.13427734375, 0.1396484375, 0.1475830078125, 0.2261962890625, 0.186279296875, 0.1658935546875, 0.1243896484375, 0.0908203125, 0.1763916015625, 0.245361328125, 0.23828125, 0.05328369140625, 0.1368408203125, 0.1451416015625, 0.1180419921875, 0.1680908203125, 0.0157165...	embed
35837199_c0	35837199	haskell	0	Title: Making a set data type with list data structure in Haskell Problem title: Making a set data type with list data structure in Haskell Tags: data-structures, haskell, set Problem: Making a set data type with list data structure in Haskell Write insert and member operations in Haskell. Make sure that in ML and Hask...	Making a set data type with list data structure in Haskell Making a set data type with list data structure in Haskell data-structures haskell set Making Haskell Making a set data type with list data structure in Haskell The code I written above just makes it have functions that perform on lists. Is there a way to make ...	[ 0.0019683837890625, 0.0252685546875, 0.020751953125, 0.0050048828125, -0.0047607421875, 0.00946044921875, -0.023193359375, -0.005523681640625, 0.00238037109375, 0.0019989013671875, -0.0194091796875, -0.00787353515625, 0.01904296875, 0.005645751953125, -0.023681640625, 0.0166015625, 0...	[ 13676, 5423, 2053, 10644, 678, 5303, 45646, 20625, 142508, 137656, 1556, 18151, 30482, 765, 32354, 51339, 98, 3917, 3249, 903, 3934, 10, 18507, 90502, 52080, 123309, 56037, 20653, 19943, 32786, 77336, 6044 ]	[ 0.05938720703125, 0.19580078125, 0.107666015625, 0.171142578125, 0.0709228515625, 0.1993408203125, 0.197998046875, 0.1207275390625, 0.2041015625, 0.1319580078125, 0.0946044921875, 0.0560302734375, 0.07220458984375, 0.05059814453125, 0.12939453125, 0.1099853515625, 0.0462646484375, ...	embed
54383159_c0	54383159	haskell	0	Title: Why aren't those two expressions equivalent and one gives an error? Problem title: Why aren't those two expressions equivalent and one gives an error? Tags: functional-programming, haskell, function Problem: Why aren't those two expressions equivalent and one gives an error? --Find kth element of list ...	Why aren't those two expressions equivalent and one gives an error? Why aren't those two expressions equivalent and one gives an error? functional-programming haskell function Why Find Empty List Wrong Expected Why aren't those two expressions equivalent and one gives an error? Gives an error Expected kind ->...	[ -0.0106201171875, 0.007232666015625, -0.00125885009765625, -0.020751953125, 0.011962890625, 0.01007080078125, -0.0147705078125, -0.00482177734375, 0.00921630859375, -0.007476806640625, 0.034423828125, -0.03125, -0.0032806396484375, -0.0024261474609375, 0.0091552734375, -0.011474609375,...	[ 44084, 6626, 125195, 183234, 76199, 18499, 1632, 123309, 28966, 1556, 142508, 32354, 26040, 31678, 939, 32036, 35133, 60075, 13, 89829, 125381, 18, 77878, 8562, 158, 2816, 4288, 1284, 360, 661, 113307, 130078, 22027, 8337 ]	[ 0.06170654296875, 0.07421875, 0.216064453125, 0.173583984375, 0.0816650390625, 0.199951171875, 0.03582763671875, 0.07220458984375, 0.028350830078125, 0.06494140625, 0.1712646484375, 0.0555419921875, 0.11279296875, 0.129638671875, 0.10675048828125, 0.15966796875, 0.1163330078125, 0....	embed
54987826_c0	54987826	haskell	0	Title: Haskell - Echoing all characters besides spaces Problem title: Haskell - Echoing all characters besides spaces Tags: haskell Problem: Haskell - Echoing all characters besides spaces I am supposed to have an input of [Char] and output [Char] but from the input double all the characters twice besides the spaces. I...	Haskell - Echoing all characters besides spaces Haskell - Echoing all characters besides spaces haskell Haskell Echoing Char Hello World HHeelloo WWoorrlldd Haskell - Echoing all characters besides spaces I am supposed to have an input of [Char] and output [Char] but from the input double all the characters twice besid...	[ -0.00701904296875, -0.006195068359375, -0.016357421875, 0.0242919921875, 0.01708984375, 0.039794921875, 0.0005340576171875, -0.01953125, 0.00390625, 0.00665283203125, 0.0022430419921875, -0.0269775390625, -0.0004177093505859375, -0.0016937255859375, -0.0228271484375, 0.023681640625, ...	[ 20625, 142508, 241, 3089, 214, 756, 124850, 30338, 988, 32628, 1556, 21656, 35378, 6661, 572, 13025, 13817, 31, 95162, 16495, 1181, 4028, 134598, 107730, 84068, 140992, 1295, 41929, 186351, 831, 12638, 62816, 26719, 26366, 39041, 5646, 841, 7...	[ 0.1572265625, 0.267578125, 0.10125732421875, 0.25390625, 0.08612060546875, 0.1292724609375, 0.19384765625, 0.1182861328125, 0.07421875, 0.2347412109375, 0.1361083984375, 0.1497802734375, 0.173095703125, 0.1661376953125, 0.0244140625, 0.1138916015625, 0.1763916015625, 0.118774414062...	embed
13279791_c0	13279791	haskell	0	Title: XMonad startup on different workspaces Problem title: XMonad startup on different workspaces Tags: haskell, xmonad Problem: XMonad startup on different workspaces I want to startup some applications in different workspaces(it is important) on xmonad start. So, I wrote following startupHook : startupApps :: [Stri...	XMonad startup on different workspaces XMonad startup on different workspaces haskell xmonad XMonad zipWithM_ XMonad startup on different workspaces I want to startup some applications in different workspaces(it is important) on xmonad start. So, I wrote following startupHook : But, it spawns all apps in first workspac...	[ 0.005096435546875, 0.027587890625, -0.016357421875, 0.0147705078125, 0.0034942626953125, 0.00007963180541992188, 0.0225830078125, -0.027587890625, 0.0078125, -0.02783203125, 0.033935546875, 0.00775146484375, -0.0162353515625, 0.03125, -0.01220703125, -0.0167236328125, -0.010131835937...	[ 1193, 46674, 712, 73882, 98, 12921, 4488, 65421, 1556, 142508, 1022, 3796, 68330, 194583, 594, 3444, 86685, 23, 5526, 4034, 54397, 25632, 11193, 685, 5623, 7710, 7, 756, 49966, 5117, 4537, 2967, 38415, 2046, 959, 3229, 20653, 26859, 72367, ...	[ 0.1180419921875, 0.171875, 0.1927490234375, 0.22607421875, 0.053375244140625, 0.1534423828125, 0.1405029296875, 0.2249755859375, 0.063232421875, 0.18603515625, 0.087646484375, 0.1397705078125, 0.1199951171875, 0.111328125, 0.010955810546875, 0.059814453125, 0.1434326171875, 0.05410...	embed
17785916_c0	17785916	haskell	0	Title: Can Haskell functions be serialized? Problem title: Can Haskell functions be serialized? Tags: serialization, deserialization, distributed, haskell Problem: Can Haskell functions be serialized? The best way to do it would be to get the representation of the function (if it can be recovered somehow). Binary seria...	Can Haskell functions be serialized? Can Haskell functions be serialized? serialization deserialization distributed haskell Can Haskell Can Haskell functions be serialized? The best way to do it would be to get the representation of the function (if it can be recovered somehow). Binary serialization is preferred for ef...	[ 0.019775390625, 0.02587890625, 0.01226806640625, -0.00171661376953125, -0.0181884765625, -0.006683349609375, -0.0277099609375, 0.00390625, -0.00836181640625, -0.026123046875, -0.006256103515625, -0.0033111572265625, -0.0034942626953125, 0.029541015625, 0.0020599365234375, 0.00842285156...	[ 4171, 20625, 142508, 32354, 7, 186, 35686, 29367, 47691, 8, 184, 51626, 15917, 3674, 1556, 2965, 3917, 54, 2046, 18811, 3190, 831, 192026, 209303, 54092, 1294, 12601, 2822, 227066, 89397, 73133, 69201, 29479, 17, 9874, 1042, 28702, 66211, 5...	[ 0.11865234375, 0.14990234375, 0.25341796875, 0.2415771484375, 0.06982421875, 0.0947265625, 0.2305908203125, 0.1390380859375, 0.1187744140625, 0.131591796875, 0.07952880859375, 0.1593017578125, 0.1427001953125, 0.00360107421875, 0.11669921875, 0.08709716796875, 0.0418701171875, 0.00...	embed
42774191_c0	42774191	haskell	0	Title: how does hgearman-client work? Problem title: how does hgearman-client work? Tags: haskell, gearman Problem: how does hgearman-client work? Unfortunately the package hgearman does not provide any test or example and I can't work it out for myself how should be combined connectGearman and submitJob to put a job t...	how does hgearman-client work? how does hgearman-client work? haskell gearman GearmanError B.pack HostName Port Either GearmanClient StateT S.StateT how does hgearman-client work? Unfortunately the package hgearman does not provide any test or example and I can't work it out for myself how should be combined connectGea...	[ -0.01116943359375, 0.0030975341796875, -0.01190185546875, 0.0025787353515625, -0.00933837890625, 0.00885009765625, -0.01446533203125, -0.0274658203125, 0.00433349609375, -0.03173828125, 0.005828857421875, -0.015380859375, -0.0040283203125, -0.007080078125, -0.02978515625, -0.0062561035...	[ 3642, 14602, 1096, 429, 147, 669, 222978, 4488, 1556, 142508, 72397, 58736, 18468, 31611, 335, 29102, 100932, 163612, 13791, 150, 2517, 22836, 618, 159, 135206, 98169, 3034, 27781, 70163, 37067, 10429, 137447, 194802, 3884, 12447, 10723, 16750,...	[ 0.063232421875, 0.02667236328125, 0.117431640625, 0.08428955078125, 0.1341552734375, 0.1929931640625, 0.271484375, 0.1328125, 0.0804443359375, 0.16748046875, 0.1849365234375, 0.2127685546875, 0.046600341796875, 0.0108642578125, 0.0357666015625, 0.13037109375, 0.05859375, 0.08410644...	embed
77294689_c0	77294689	haskell	0	Title: Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? Problem title: Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? Tags: c%2B%2B, list, haskell, arrays Problem: Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? I want to call a Haskell function from C++: a = ...	Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? c%2B%2B list haskell arrays There Way Give Haskell Read Access C-style Arrays Double Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? I want to call a Haskell functi...	[ 0.0155029296875, 0.00909423828125, 0.002838134765625, -0.00714111328125, 0.0155029296875, 0.002532958984375, 0.00506591796875, -0.006591796875, 0.00677490234375, -0.018310546875, -0.006927490234375, -0.0247802734375, -0.00872802734375, -0.01165771484375, 0.00311279296875, -0.0145874023...	[ 2071, 8622, 142, 180, 27750, 42261, 77878, 20625, 142508, 4764, 40266, 47, 313, 40946, 69253, 4778, 717, 501, 5303, 1556, 10298, 107172, 3444, 11782, 32354, 1295, 37223, 7440, 1238, 1022, 41929, 1065, 6366, 11341, 7844, 199334, 53383, 26267, ...	[ 0.009368896484375, 0.076416015625, 0.06005859375, 0.219970703125, 0.194091796875, 0.1558837890625, 0.1038818359375, 0.17919921875, 0.28759765625, 0.2308349609375, 0.2081298828125, 0.07183837890625, 0.150390625, 0.2366943359375, 0.17041015625, 0.143798828125, 0.032867431640625, 0.06...	embed
8066850_c0	8066850	haskell	0	Title: Why doesn't Haskell's Prelude.read return a Maybe? Problem title: Why doesn't Haskell's Prelude.read return a Maybe? Tags: haskell, types, parsing Problem: Why doesn't Haskell's Prelude.read return a Maybe? Is there a good reason why the type of Prelude.read is read :: Read a => String -> a r...	Why doesn't Haskell's Prelude.read return a Maybe? Why doesn't Haskell's Prelude.read return a Maybe? haskell types parsing Why Haskell Prelude.read Maybe Read Either Left Right Why doesn't Haskell's Prelude.read return a Maybe? Is there a good reason why the type of Prelude.read is rather than retu...	[ -0.00787353515625, -0.005859375, 0.0198974609375, 0.019287109375, -0.0034332275390625, 0.019775390625, 0.005767822265625, -0.03662109375, 0.005157470703125, -0.00860595703125, 0.005615234375, -0.0281982421875, -0.014892578125, -0.03369140625, 0.011962890625, -0.0181884765625, -0.0220...	[ 44084, 22027, 3768, 18, 20625, 142508, 1914, 822, 112, 39116, 30646, 83425, 1556, 52895, 366, 6953, 4764, 9319, 636, 2480, 90911, 10, 31635, 15400, 10644, 43257, 3501, 34292, 79315, 13648, 35782, 184, 2886, 1286, 6083, 4565, 23351, 214, 705...	[ 0.1270751953125, 0.07061767578125, 0.05029296875, 0.1085205078125, 0.116455078125, 0.2471923828125, 0.117919921875, 0.2041015625, 0.135009765625, 0.2374267578125, 0.201171875, 0.3203125, 0.07562255859375, 0.1644287109375, 0.134033203125, 0.0180206298828125, 0.1700439453125, 0.15893...	embed
64394487_c0	64394487	haskell	0	Title: If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? Problem title: If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? Tags: functional-programming, cu...	If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? functional-programming curry-howard haskell category-t...	[ 0.01336669921875, -0.00494384765625, 0.0068359375, -0.005615234375, -0.00872802734375, 0.00494384765625, -0.006072998046875, -0.006683349609375, 0.00091552734375, -0.00006389617919921875, -0.01214599609375, -0.02587890625, 0.00160980224609375, -0.01116943359375, 0.0022125244140625, 0.0...	[ 4263, 4565, 9319, 831, 186, 40101, 636, 2480, 707, 90911, 1284, 959, 15044, 15400, 42518, 47, 33172, 64457, 1193, 24638, 17065, 1294, 11193, 19364, 6620, 123309, 28966, 198555, 497, 1556, 142508, 95487, 31, 34677, 137043, 14602, 442, 35166, ...	[ 0.003509521484375, 0.114501953125, 0.28662109375, 0.115966796875, 0.07623291015625, 0.052215576171875, 0.118408203125, 0.181396484375, 0.04058837890625, 0.185791015625, 0.06744384765625, 0.0885009765625, 0.125, 0.141845703125, 0.20849609375, 0.06707763671875, 0.2734375, 0.150146484...	embed
36385940_c0	36385940	haskell	0	Title: Custom Show instance for Complex Problem title: Custom Show instance for Complex Tags: haskell, typeclass Problem: Custom Show instance for Complex I want to print complex numbers like this: instance (Show a) => Show (Complex a) where show (a :+ b) = show a ++ " ":show b ++ "i" But the module is deriving(Show) f...	Custom Show instance for Complex Custom Show instance for Complex haskell typeclass Custom Show Complex Data.Complex Custom Show instance for Complex I want to print complex numbers like this: But the module is deriving(Show) for Complex . I could copy the Data.Complex module, remove the deriving(Show) part and add my ...	[ -0.0186767578125, 0.006500244140625, 0.01300048828125, 0.031005859375, 0.005828857421875, 0.0107421875, 0.0238037109375, -0.004913330078125, 0.0125732421875, 0.0045166015625, -0.0185546875, -0.00408935546875, 0.005889892578125, 0.035888671875, -0.0174560546875, 0.0040283203125, -0.01...	[ 130664, 17367, 110527, 100, 113197, 1556, 142508, 10644, 67413, 11809, 10770, 44974, 3444, 28412, 27140, 101935, 1884, 903, 4966, 88996, 16406, 6496, 168660, 5809, 43658, 87388, 2831, 15190, 10002, 8108, 2448, 22288, 756, 47, 114122, 831, 4734,...	[ 0.1966552734375, 0.22216796875, 0.240234375, 0.05645751953125, 0.266845703125, 0.0921630859375, 0.1854248046875, 0.16015625, 0.1439208984375, 0.0670166015625, 0.066162109375, 0.210693359375, 0.0693359375, 0.1619873046875, 0.227783203125, 0.1595458984375, 0.11181640625, 0.0447692871...	embed
36595669_c0	36595669	haskell	0	Title: Haskell, No instance for (Applicative M) Problem title: Haskell, No instance for (Applicative M) Tags: monads, haskell, compiler-errors Problem: Haskell, No instance for (Applicative M) Look at my code. ghci told that No instance for (Applicative M) arising from the superclasses of an instance declaration In the...	Haskell, No instance for (Applicative M) Haskell, No instance for (Applicative M) monads haskell compiler-errors monadic Haskell Applicative StOut Stack Monad Haskell, No instance for (Applicative M) Look at my code. ghci told that No instance for (Applicative M) arising from the superclasses of an instance declaration...	[ -0.0157470703125, 0.0081787109375, 0.0081787109375, 0.02490234375, 0.0206298828125, 0.0277099609375, 0.01153564453125, -0.0115966796875, 0.00823974609375, -0.007659912109375, 0.0172119140625, -0.039794921875, 0.0091552734375, 0.01141357421875, 0.011474609375, -0.0032196044921875, -0....	[ 20625, 142508, 438, 110527, 100, 39179, 11048, 4935, 276, 4, 2667, 712, 1556, 9969, 34759, 188800, 11, 18403, 5659, 2907, 79858, 6512, 2594, 60331, 71, 18151, 31380, 318, 30745, 187, 72219, 1295, 1601, 67413, 111, 21635, 46674, 28219, 18499...	[ 0.1705322265625, 0.271484375, 0.16650390625, 0.3037109375, 0.2127685546875, 0.131103515625, 0.161376953125, 0.1292724609375, 0.192626953125, 0.0162506103515625, 0.0830078125, 0.130126953125, 0.13623046875, 0.0755615234375, 0.08453369140625, 0.1484375, 0.01373291015625, 0.0332641601...	embed
36992158_c0	36992158	haskell	0	Title: Haskell newbie gotcha: why does this η-reduction change type inference? Problem title: Haskell newbie gotcha: why does this η-reduction change type inference? Tags: functional-programming, haskell, static-typing, type-inference Problem: Haskell newbie gotcha: why does this η-reduction change type inference? Lear...	Haskell newbie gotcha: why does this η-reduction change type inference? Haskell newbie gotcha: why does this η-reduction change type inference? functional-programming haskell static-typing type-inference Haskell Haskell newbie gotcha: why does this η-reduction change type inference? Learning Haskell right now and stumb...	[ -0.0018463134765625, -0.00604248046875, 0.0145263671875, 0.016357421875, 0.00738525390625, 0.0036773681640625, -0.005828857421875, 0.005889892578125, -0.0059814453125, -0.0084228515625, -0.01263427734375, -0.00665283203125, -0.0004215240478515625, -0.021728515625, 0.0035858154296875, -...	[ 20625, 142508, 3525, 9014, 4163, 1436, 15400, 14602, 903, 781, 107, 77391, 15549, 10644, 53498, 6620, 123309, 28966, 1556, 201939, 46280, 69988, 114344, 81960, 939, 137399, 13538, 7077, 678, 201, 136, 40401, 140992, 4966, 83, 84751, 9842, 100...	[ 0.1273193359375, 0.2093505859375, 0.092529296875, 0.136962890625, 0.05914306640625, 0.1676025390625, 0.1650390625, 0.0364990234375, 0.0906982421875, 0.22802734375, 0.16845703125, 0.173583984375, 0.20068359375, 0.209716796875, 0.1942138671875, 0.0831298828125, 0.06536865234375, 0.02...	embed
1739186_c0	1739186	haskell	0	Title: Are peekCString and peekCStringLen lazy? Problem title: Are peekCString and peekCStringLen lazy? Tags: ffi, lazy-evaluation, haskell Problem: Are peekCString and peekCStringLen lazy? I have a C function that creates a null terminated string and returns a pointer to it, there is also corresponding deallocation fu...	Are peekCString and peekCStringLen lazy? Are peekCString and peekCStringLen lazy? ffi lazy-evaluation haskell ccall get_str CString free_str Are peekCString and peekCStringLen lazy? I have a C function that creates a null terminated string and returns a pointer to it, there is also corresponding deallocation function. ...	[ 0.029052734375, 0.01556396484375, 0.00089263916015625, 0.0294189453125, 0.006195068359375, 0.0213623046875, 0.010986328125, 0.026123046875, 0.0216064453125, -0.00653076171875, 0.0033721923828125, -0.0157470703125, 0.004730224609375, 0.01263427734375, -0.0213623046875, 0.002426147460937...	[ 280, 343, 19283, 18, 2852, 136, 866, 33, 21, 3285, 15901, 24500, 159258, 1556, 142508, 85763, 2046, 9297, 25841, 4092, 313, 32354, 28282, 56574, 121011, 79315, 30646, 6275, 56, 35142, 87632, 3444, 20625, 23351, 214, 1295, 176377, 33662, 772...	[ 0.161865234375, 0.1416015625, 0.05926513671875, 0.0438232421875, 0.2274169921875, 0.07049560546875, 0.1090087890625, 0.172607421875, 0.175537109375, 0.208984375, 0.021148681640625, 0.1136474609375, 0.14697265625, 0.05902099609375, 0.210693359375, 0.1865234375, 0.033782958984375, 0....	embed
18481452_c0	18481452	haskell	0	Title: Reader monad, how bind readers works? Problem title: Reader monad, how bind readers works? Tags: haskell, monads Problem: Reader monad, how bind readers works? I'm a beginner in Haskell. I learned How to create a Reader and How to query a shared variables. I looked into the source code of Reader.hs in Hugs98 ins...	Reader monad, how bind readers works? Reader monad, how bind readers works? haskell monads Reader Monad Reader monad, how bind readers works? I'm a beginner in Haskell. I learned How to create a Reader and How to query a shared variables. I looked into the source code of Reader.hs in Hugs98 Here I can see (return a) cr...	[ 0.0019073486328125, 0.0166015625, 0.0225830078125, 0.0152587890625, 0.01165771484375, 0.005218505859375, -0.00738525390625, -0.01336669921875, -0.002838134765625, -0.0301513671875, 0.015625, -0.005157470703125, -0.0120849609375, -0.005401611328125, 0.006561279296875, -0.017578125, -0...	[ 122636, 2667, 712, 3642, 68557, 120709, 43240, 1556, 142508, 60331, 71, 9842, 1679, 20625, 28282, 41, 1294, 99764, 77336, 31344, 18151, 5, 127, 7, 99926, 16665, 65395, 19, 10, 137565, 10366, 32354, 51776, 34292, 30646, 347, 6396, 1369, 472,...	[ 0.28662109375, 0.08880615234375, 0.1573486328125, 0.0970458984375, 0.2498779296875, 0.31005859375, 0.1640625, 0.0775146484375, 0.2203369140625, 0.140625, 0.1126708984375, 0.0230255126953125, 0.046539306640625, 0.08160400390625, 0.090576171875, 0.018341064453125, 0.0196075439453125, ...	embed
73279979_c0	73279979	haskell	0	Title: installing z3 haskell bindings on windows Problem title: installing z3 haskell bindings on windows Tags: windows, haskell, z3 Problem: installing z3 haskell bindings on windows I've followed the docs for z3 to install it onto my windows machine. The output says Z3 was successfully built. but when I try to instal...	installing z3 haskell bindings on windows installing z3 haskell bindings on windows windows haskell z3 Missing z3.h installing z3 haskell bindings on windows I've followed the docs for z3 to install it onto my windows machine. The output says Z3 was successfully built. but when I try to install Haskell bindings by runn...	[ -0.0030975341796875, 0.00445556640625, 0.002349853515625, 0.00830078125, -0.0179443359375, 0.01019287109375, -0.01287841796875, -0.010986328125, 0.00168609619140625, 0.00946044921875, -0.007476806640625, -0.036376953125, 0.0123291015625, -0.00823974609375, 0.004425048828125, 0.02832031...	[ 20600, 97, 363, 1556, 142508, 128239, 54825, 16771, 127, 7, 134629, 140992, 567, 65771, 88303, 9790, 20625, 51042, 109524, 18499, 17997, 79786, 150624, 54, 80383, 29954, 167934, 116392, 55898, 4488, 3871, 75101, 132283 ]	[ 0.1336669921875, 0.11669921875, 0.2022705078125, 0.1171875, 0.2166748046875, 0.1798095703125, 0.113525390625, 0.1051025390625, 0.1064453125, 0.038604736328125, 0.052642822265625, 0.006103515625, 0.128173828125, 0.07147216796875, 0.0843505859375, 0.007659912109375, 0.106201171875, 0...	embed
69157282_c0	69157282	haskell	0	Title: In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? Problem title: In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? Tags: operating-system, linux, haskell Problem: In Haskell, can syncing hardware clock while retrieving the time cause...	In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? operating-system linux haskell Haskell parseISO8601 In Haskell, can syncing hardware clock while retrieving the time cause a serious problem...	[ 0.01300048828125, -0.005462646484375, 0.0032958984375, -0.006591796875, 0.0181884765625, -0.0023040771484375, -0.0072021484375, 0.000667572021484375, -0.00885009765625, -0.06689453125, 0.0107421875, -0.00958251953125, 0.00579833984375, -0.00872802734375, -0.0155029296875, -0.0133666992...	[ 360, 20625, 142508, 831, 954, 60636, 76407, 501, 21135, 12960, 97351, 1733, 22304, 85583, 2967, 456, 172852, 16751, 11508, 6077, 1556, 366, 184, 58230, 15276, 6746, 6496, 10, 31089, 53383, 3688, 38516, 6002, 37534, 5701, 50336, 678, 2046, 4...	[ 0.037872314453125, 0.15478515625, 0.2459716796875, 0.1241455078125, 0.1568603515625, 0.1678466796875, 0.2127685546875, 0.051025390625, 0.1932373046875, 0.05340576171875, 0.10748291015625, 0.1800537109375, 0.150146484375, 0.1343994140625, 0.1593017578125, 0.02166748046875, 0.039123535...	embed
33754669_c0	33754669	haskell	0	Title: Why won't this simple Morte program typecheck? Problem title: Why won't this simple Morte program typecheck? Tags: types, morte, haskell Problem: Why won't this simple Morte program typecheck? I'm trying to better understand the Calculus of Constructions through Morte. My first attempt was to call the ...	Why won't this simple Morte program typecheck? Why won't this simple Morte program typecheck? types morte haskell Why Morte Context Expression Error Only Why won't this simple Morte program typecheck? I'm trying to better understand the Calculus of Constructions through Morte. My first attempt was to call the...	[ 0.003265380859375, -0.000553131103515625, 0.006500244140625, 0.017822265625, 0.0106201171875, 0.002593994140625, -0.000896453857421875, 0.0177001953125, -0.00958251953125, -0.053466796875, 0.00074005126953125, -0.022705078125, -0.0216064453125, -0.02294921875, 0.031982421875, 0.0059509...	[ 44084, 23742, 3768, 18, 903, 8781, 5919, 67, 1528, 10644, 78292, 52895, 20055, 1556, 142508, 1657, 22829, 25129, 1830, 212059, 87293, 212467, 195769, 8305, 81887, 11782, 182324, 32354, 68034, 35782, 9969, 1340, 18499, 9925, 3249, 10422, 3447, ...	[ 0.119873046875, 0.09429931640625, 0.044219970703125, 0.0982666015625, 0.0615234375, 0.135986328125, 0.1754150390625, 0.1927490234375, 0.1641845703125, 0.1988525390625, 0.273193359375, 0.1800537109375, 0.2244873046875, 0.09674072265625, 0.2083740234375, 0.0811767578125, 0.19580078125,...	embed
14548417_c0	14548417	haskell	0	Title: mod function and type classes in haskell Problem title: mod function and type classes in haskell Tags: types, typeclass, haskell Problem: mod function and type classes in haskell i have this line of code in haskell, where level :: Float , and y :: Int , mod (floor(fromIntegral y + (level/2))) (floor level) and g...	mod function and type classes in haskell mod function and type classes in haskell types typeclass haskell a Float Integral Possible mod function and type classes in haskell i have this line of code in haskell, where level :: Float , and y :: Int , and ghci returns me the following: i try several versions using fromInte...	[ -0.01287841796875, -0.00787353515625, 0.0059814453125, -0.003509521484375, 0.0142822265625, 0.018310546875, -0.009033203125, -0.00457763671875, -0.006134033203125, -0.02685546875, -0.005218505859375, -0.03857421875, 0.0159912109375, 0.0036163330078125, 0.00933837890625, -0.016845703125...	[ 2811, 32354, 136, 10644, 61112, 1556, 142508, 23, 52895, 67413, 10, 38699, 257, 204681, 115861, 13315, 18151, 17366, 1984, 113, 360, 18, 31380, 318, 30646, 9790, 40368, 11389, 1295, 67, 5739, 141, 74912, 96760, 12477, 28970, 5701, 35166, 75...	[ 0.2034912109375, 0.17724609375, 0.091552734375, 0.216064453125, 0.2406005859375, 0.1412353515625, 0.2193603515625, 0.038909912109375, 0.19921875, 0.19140625, 0.002960205078125, 0.146728515625, 0.0772705078125, 0.1907958984375, 0.015167236328125, 0.031982421875, 0.0845947265625, 0.1...	embed
19643664_c0	19643664	haskell	0	Title: Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b Problem title: Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b Tags: haskell Problem: Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b There is a standard tryPick function if F# that returns the first (from...	Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b haskell Standard Haskell Maybe Maybe.mapMaybe Nothing x:_ Just Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b There is a standard tryPick function if F# that retur...	[ -0.019287109375, -0.00390625, 0.0218505859375, -0.00144195556640625, -0.0107421875, 0.0274658203125, -0.0028839111328125, -0.00506591796875, 0.006378173828125, -0.0196533203125, 0.006866455078125, 0.0037384033203125, -0.008056640625, 0.0147705078125, 0.00225830078125, -0.00933837890625...	[ 20744, 20625, 142508, 32354, 1984, 11, 20, 1230, 5386, 83425, 876, 1556, 62346, 82419, 372, 182747, 1022, 5570, 9790, 683, 41113, 2174, 563, 4904, 30646, 7, 5117, 161063, 25737, 188, 54969, 2499, 756, 65771, 38415, 111, 98, 12830, 5303, 1...	[ 0.2227783203125, 0.1611328125, 0.244384765625, 0.200927734375, 0.05230712890625, 0.038848876953125, 0.022003173828125, 0.07318115234375, 0.1314697265625, 0.197021484375, 0.1192626953125, 0.120849609375, 0.10595703125, 0.05963134765625, 0.05908203125, 0.10589599609375, 0.05078125, 0...	embed
76259852_c0	76259852	haskell	0	Title: How do I pass C compiler flags in a Haskell Stack package.yaml Problem title: How do I pass C compiler flags in a Haskell Stack package.yaml Tags: haskell-stack, ffi, haskell Problem: How do I pass C compiler flags in a Haskell Stack package.yaml I'm working on a Haskell project involving some FFI, and I keep ma...	How do I pass C compiler flags in a Haskell Stack package.yaml How do I pass C compiler flags in a Haskell Stack package.yaml haskell-stack ffi haskell How Haskell Stack package.yaml Werror-implicit-function-declaration How do I pass C compiler flags in a Haskell Stack package.yaml I'm working on a Haskell project invo...	[ 0.0157470703125, 0.00396728515625, -0.00738525390625, -0.0201416015625, -0.0035247802734375, -0.00872802734375, -0.017578125, -0.015625, -0.018310546875, -0.003570556640625, 0.007171630859375, -0.03857421875, 0.00107574462890625, -0.00335693359375, -0.00823974609375, 0.021240234375, ...	[ 11249, 27875, 313, 9969, 34759, 49938, 7, 20625, 142508, 6512, 2594, 98169, 14520, 141, 23, 1556, 590, 24500, 601, 188800, 64357, 60923, 137175, 50718, 320, 20697, 13452, 563, 22724, 13695, 19336, 11417, 123055, 32354, 18151, 165164, 21635, 1...	[ 0.059814453125, 0.156494140625, 0.169677734375, 0.159423828125, 0.15625, 0.2266845703125, 0.0222625732421875, 0.1263427734375, 0.2247314453125, 0.15478515625, 0.12646484375, 0.1695556640625, 0.13720703125, 0.1295166015625, 0.037445068359375, 0.09332275390625, 0.08685302734375, 0.12...	embed
46448892_c1	46448892	haskell	1	"report.xlsx" return $ toXlsx bs And this crashes: test :: IO (Maybe Worksheet) test = do bs <- L.readFile "report.xlsx" return $ toXlsx bs ^? ixSheet "List1" It looks like Windows has a problem with ^? . Edit 2 No crash with this equivalent code: test :: IO (Maybe Worksheet) test = do bs <- L.readFile "report.xlsx" l...	"report.xlsx" return $ toXlsx bs And this crashes: test :: IO (Maybe Worksheet) test = do bs <- L.readFile "report.xlsx" return $ toXlsx bs ^? ixSheet "List1" It looks like Windows has a problem with ^? . Edit 2 No crash with this equivalent code: test :: IO (Maybe Worksheet) test = do bs <- L.readFile "report.xlsx" l...	[ 0.014404296875, 0.0130615234375, -0.005523681640625, 0.00836181640625, -0.0174560546875, 0.0211181640625, 0.0047607421875, -0.0016326904296875, 0.00286865234375, 0.004608154296875, 0.022216796875, 0.0118408203125, -0.0172119140625, 0.0091552734375, 0.0106201171875, 0.0050048828125, -...	[ 79770, 92595, 7, 425, 30646, 3650, 47, 1542, 8080, 876, 903, 150631, 90, 3034, 17780, 82419, 27985, 7816, 126, 16, 54, 339, 39116, 174350, 13331, 4084, 72859, 154663, 418, 33342, 3773, 1556, 2967, 678, 183234, 18151, 1022, 2203, 155434, 2...	[ 0.25439453125, 0.1500244140625, 0.083984375, 0.165283203125, 0.146240234375, 0.062042236328125, 0.14013671875, 0.089599609375, 0.108642578125, 0.078125, 0.050628662109375, 0.2325439453125, 0.09918212890625, 0.2059326171875, 0.1593017578125, 0.038543701171875, 0.06671142578125, 0.15...	embed
10209707_c0	10209707	haskell	0	Title: Parse string into another data type in Haskell Problem title: Parse string into another data type in Haskell Tags: parsing, haskell, regex Problem: Parse string into another data type in Haskell Recently I have been trying to create in Haskell a regex interpretor. What I did was create a new data type with all p...	Parse string into another data type in Haskell Parse string into another data type in Haskell parsing haskell regex Parse Haskell Seq Sym Rep Parse string into another data type in Haskell Recently I have been trying to create in Haskell a regex interpretor. What I did was create a new data type with all possible const...	[ -0.00592041015625, 0.0106201171875, -0.0179443359375, 0.046142578125, -0.00201416015625, 0.0322265625, -0.01312255859375, 0.003173828125, 0.00049591064453125, -0.01806640625, -0.0179443359375, -0.0096435546875, 0.0048828125, 0.0031890869140625, -0.021240234375, 0.01483154296875, 0.00...	[ 2392, 184, 79315, 3934, 15700, 2053, 10644, 20625, 142508, 366, 1556, 6835, 3355, 503, 864, 4843, 39, 33742, 31577, 28282, 29481, 748, 7722, 64549, 40, 944, 661, 13331, 51514, 61924, 110394, 32354, 43240, 2967, 96760, 107730, 23351, 214, 27...	[ 0.151611328125, 0.0489501953125, 0.2327880859375, 0.1435546875, 0.1156005859375, 0.1248779296875, 0.2120361328125, 0.127197265625, 0.216064453125, 0.1341552734375, 0.1107177734375, 0.112060546875, 0.13037109375, 0.047698974609375, 0.1571044921875, 0.06640625, 0.125244140625, 0.1741...	embed
15273158_c0	15273158	haskell	0	Title: How do I use a let within a do block in ghci? Problem title: How do I use a let within a do block in ghci? Tags: ghci, haskell Problem: How do I use a let within a do block in ghci? I'm trying to create a do block interactively in ghci. As long as I don't define a variable with in block, it's fine: Prelude>let a...	How do I use a let within a do block in ghci? How do I use a let within a do block in ghci? ghci haskell How Prelude How do I use a let within a do block in ghci? I'm trying to create a do block interactively in ghci. As long as I don't define a variable with in block, it's fine: but I can't figure out how to define a ...	[ -0.01409912109375, -0.0027313232421875, 0.01458740234375, 0.0206298828125, -0.0018768310546875, 0.0234375, -0.004486083984375, 0.00189971923828125, 0.0019683837890625, -0.013916015625, -0.01116943359375, -0.0216064453125, -0.0107421875, 0.001495361328125, 0.0106201171875, 0.00219726562...	[ 11249, 4527, 10, 2633, 28032, 54, 46389, 23, 31380, 318, 1556, 142508, 822, 112, 28282, 212398, 61924, 77336, 678, 5885, 50961, 366, 184, 18499, 20625, 31344, 11435, 3900, 19309, 47 ]	[ 0.040679931640625, 0.143310546875, 0.0802001953125, 0.230712890625, 0.1630859375, 0.1524658203125, 0.207763671875, 0.04327392578125, 0.1016845703125, 0.1595458984375, 0.0628662109375, 0.1724853515625, 0.0618896484375, 0.00140380859375, 0.04644775390625, 0.1177978515625, 0.1201171875,...	embed
16691986_c0	16691986	haskell	0	Title: Create list of strings from list of doubles, non Scientific notation Problem title: Create list of strings from list of doubles, non Scientific notation Tags: floating-point, haskell Problem: Create list of strings from list of doubles, non Scientific notation listOfLongDeci = [showFFloat Nothing (1/a) \| a<-[2.....	Create list of strings from list of doubles, non Scientific notation Create list of strings from list of doubles, non Scientific notation floating-point haskell list Create Scientific Nothing listOfLongDeci2 listOfLongDeci3 Create list of strings from list of doubles, non Scientific notation the 1st gives a list of Sho...	[ -0.0003662109375, -0.003570556640625, -0.006072998046875, 0.005767822265625, 0.00433349609375, -0.000392913818359375, 0.0177001953125, -0.004241943359375, 0.0172119140625, 0.041015625, -0.0115966796875, -0.01708984375, -0.0004787445068359375, 0.01226806640625, -0.00994873046875, 0.0078...	[ 151313, 5303, 111, 79315, 7, 1295, 41929, 351, 210017, 110, 22062, 21917, 26518, 38496, 1556, 142508, 182747, 132887, 4021, 4657, 318, 304, 363, 271, 76199, 17367, 294, 3642, 831, 3249, 7639, 116, 2208, 57456, 138, 4216, 4734, 4527, 28282, ...	[ 0.1243896484375, 0.2052001953125, 0.041412353515625, 0.2454833984375, 0.050140380859375, 0.1146240234375, 0.20361328125, 0.159912109375, 0.1732177734375, 0.1351318359375, 0.080078125, 0.0955810546875, 0.05084228515625, 0.1134033203125, 0.09796142578125, 0.1990966796875, 0.13037109375...	embed
37908274_c0	37908274	haskell	0	Title: Haskell Aeson JSON Object inside JSON Array Problem title: Haskell Aeson JSON Object inside JSON Array Tags: aeson, json, haskell Problem: Haskell Aeson JSON Object inside JSON Array I am trying to convert a JSON String into an ADT This is my ADT: data UserList = UserList { userListUsers :: [UserId] } This is my...	Haskell Aeson JSON Object inside JSON Array Haskell Aeson JSON Object inside JSON Array aeson json haskell Haskell Aeson JSON Object Array UserList UserId FromJSON User Bad Request Haskell Aeson JSON Object inside JSON Array I am trying to convert a JSON String into an ADT This is my ADT: This is my FromJSON instance f...	[ -0.0035858154296875, 0.006256103515625, -0.021240234375, 0.01080322265625, -0.0189208984375, 0.0036163330078125, -0.0216064453125, 0.005828857421875, -0.0035400390625, -0.023193359375, -0.0126953125, 0.000553131103515625, 0.0024566650390625, -0.003570556640625, 0.0115966796875, -0.0099...	[ 20625, 142508, 62, 90, 191, 821, 58627, 134549, 46132, 69253, 53, 10, 1647, 1681, 1556, 53400, 154663, 568, 28090, 1375, 12745, 853, 75616, 31577, 96760, 23351, 214, 3934, 142, 41072, 83, 759, 3293, 110527, 77681, 903, 32635, 2199, 10723, ...	[ 0.1263427734375, 0.201171875, 0.09033203125, 0.118896484375, 0.19482421875, 0.1416015625, 0.230712890625, 0.2210693359375, 0.155029296875, 0.1441650390625, 0.0692138671875, 0.0653076171875, 0.07843017578125, 0.18115234375, 0.1287841796875, 0.1202392578125, 0.1507568359375, 0.002349...	embed
21152669_c0	21152669	haskell	0	Title: haskell matrix power without using if-else statement Problem title: haskell matrix power without using if-else statement Tags: matrix, haskell, linear-algebra Problem: haskell matrix power without using if-else statement I have the following function to obtain power of a matrix X^0 = identity matrix, X^1 =X; X^2...	haskell matrix power without using if-else statement haskell matrix power without using if-else statement matrix haskell linear-algebra if-else Numeric.Container Numeric.LinearAlgebra Field Matrix Integer haskell matrix power without using if-else statement I have the following function to obtain power of a matrix X^0 ...	[ -0.0262451171875, 0.0126953125, 0.0264892578125, 0.011474609375, 0.0137939453125, 0.00115203857421875, -0.00726318359375, 0.01483154296875, 0.0029449462890625, 0.01300048828125, 0.01068115234375, -0.00885009765625, 0.000888824462890625, -0.004486083984375, -0.0164794921875, 0.016967773...	[ 1556, 142508, 50944, 425, 14537, 15490, 17368, 2174, 5557, 63805, 192617, 429, 93511, 25500, 93232, 117657, 194234, 44401, 25632, 32354, 113054, 111, 1193, 8353, 2389, 182324, 418, 1542, 363, 617, 25, 37842, 7722, 456, 434, 18781 ]	[ 0.1492919921875, 0.212890625, 0.18017578125, 0.1026611328125, 0.253173828125, 0.0989990234375, 0.0638427734375, 0.155029296875, 0.1898193359375, 0.1883544921875, 0.1220703125, 0.01568603515625, 0.0006103515625, 0.062103271484375, 0.033660888671875, 0.09625244140625, 0.1649169921875, ...	embed
71134730_c0	71134730	haskell	0	Title: How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? Problem title: How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? Tags: haskell, haskell-stack Problem: How to build and modify source code locally of a package from Hack...	How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? haskell haskell-stack Hackage the How Haskell Stack How to build and modify source code locally of a package from Hackage usin...	[ -0.00628662109375, 0.03515625, -0.002227783203125, 0.0027923583984375, 0.0093994140625, -0.0014190673828125, -0.0126953125, 0.000056743621826171875, 0.00787353515625, -0.0157470703125, -0.00133514404296875, -0.0361328125, 0.0194091796875, 0.01043701171875, 0.020263671875, 0.01275634765...	[ 11249, 47, 45367, 136, 2811, 40383, 31344, 18151, 4000, 538, 98169, 1295, 52922, 4588, 17368, 6495, 7, 142508, 6512, 2594, 111, 1556, 590, 70, 20625, 9473, 64330, 7026, 102158, 3034, 160328, 20903, 6713, 159958, 28007, 1543, 162466, 179933, ...	[ 0.138427734375, 0.0292816162109375, 0.200927734375, 0.1173095703125, 0.1834716796875, 0.126220703125, 0.227783203125, 0.2261962890625, 0.1744384765625, 0.0570068359375, 0.2158203125, 0.11962890625, 0.2054443359375, 0.225830078125, 0.09149169921875, 0.145751953125, 0.1240234375, 0.2...	embed
47830807_c0	47830807	haskell	0	Title: Does randomIO (from System.Random) ever produce 0? Problem title: Does randomIO (from System.Random) ever produce 0? Tags: haskell, random Problem: Does randomIO (from System.Random) ever produce 0? I understand that randomIO::IO Float produces uniformly distributed Float numbers, but my question is in what rang...	Does randomIO (from System.Random) ever produce 0? Does randomIO (from System.Random) ever produce 0? haskell random System.Random Does randomIO::IO Float Infinity Does randomIO (from System.Random) ever produce 0? I understand that randomIO::IO Float produces uniformly distributed Float numbers, but my question is in ...	[ 0.00079345703125, -0.000492095947265625, 0.01336669921875, -0.0166015625, 0.0035552978515625, 0.01129150390625, 0.0184326171875, -0.01531982421875, -0.0128173828125, 0.0022430419921875, 0.015869140625, -0.0155029296875, 0.00439453125, -0.006927490234375, 0.01513671875, 0.0179443359375,...	[ 101790, 96759, 17780, 161063, 12353, 5, 126525, 3815, 17669, 27489, 757, 1556, 142508, 12, 38699, 257, 134322, 53, 28219, 61514, 15917, 3674, 101935, 9655, 23, 2367, 37457, 2389, 76172, 22085, 17727, 23937, 17721, 85526, 4588, 91067, 15122, 5...	[ 0.089111328125, 0.236328125, 0.26123046875, 0.0823974609375, 0.1617431640625, 0.0201263427734375, 0.1588134765625, 0.2130126953125, 0.179931640625, 0.219970703125, 0.228759765625, 0.116943359375, 0.2061767578125, 0.020538330078125, 0.2176513671875, 0.1444091796875, 0.174072265625, ...	embed

33454145_c0

33454145

haskell

0

Title: How to change an element in [String] in Haskell? Problem title: How to change an element in [String] in Haskell? Tags: haskell Problem: How to change an element in [String] in Haskell? I'm working on a program that receives as input a board game as follows: ##### #_ ## # ## # # # .# ##### 1 4 (player initial pos...

How to change an element in [String] in Haskell? How to change an element in [String] in Haskell? haskell How Haskell How to change an element in [String] in Haskell? I'm working on a program that receives as input a board game as follows: After receiving the input, the program transforms it to a [String]. This case, i...

[ -0.01055908203125, 0.00225830078125, -0.0002765655517578125, 0.003936767578125, 0.013427734375, -0.0047607421875, 0.003021240234375, 0.00970458984375, 0.01361083984375, 0.04052734375, 0.0213623046875, -0.000762939453125, 0.0098876953125, 0.00347900390625, -0.037353515625, -0.0134887695...

[ 11249, 47, 15549, 12830, 23, 71713, 214, 20625, 142508, 32, 1556, 142, 378, 20697, 1528, 53299, 237, 107730, 45443, 6712, 24372, 217063, 27198, 10, 187284, 454, 173894, 468, 201, 831, 17203, 19069, 163324, 31, 28670, 30646, 61475, 5303, 167...

[ 0.109375, 0.08740234375, 0.253662109375, 0.2188720703125, 0.114501953125, 0.1966552734375, 0.1224365234375, 0.146240234375, 0.243896484375, 0.0050048828125, 0.1348876953125, 0.030670166015625, 0.004241943359375, 0.03717041015625, 0.1005859375, 0.040191650390625, 0.019500732421875, ...

embed

28829976_c0

28829976

haskell

0

Title: FFI and static libraries used in application Problem title: FFI and static libraries used in application Tags: crash, ffi, haskell, static-libraries Problem: FFI and static libraries used in application I wrote a Haskell library that links against a C library – a static one. Compilation is done perfectly, and ca...

FFI and static libraries used in application FFI and static libraries used in application crash ffi haskell static-libraries FFI FFI and static libraries used in application I wrote a Haskell library that links against a C library – a static one. Compilation is done perfectly, and cabal repl gives me access to the func...

[ 0.0079345703125, -0.01300048828125, 0.0225830078125, 0.0022430419921875, -0.0205078125, -0.0087890625, -0.006011962890625, -0.0002956390380859375, -0.00131988525390625, -0.033447265625, -0.00193023681640625, -0.0478515625, 0.006561279296875, 0.039306640625, 0.0303955078125, -0.00988769...

[ 563, 22724, 136, 201939, 35773, 10484, 11814, 38415, 150631, 24500, 1556, 142508, 150, 2844, 54397, 20625, 1294, 22317, 26548, 313, 15612, 16940, 169123, 109524, 456, 2424, 17203, 32354, 76242, 25474, 20600, 19096, 11728, 111, 32562, 11675, 442...

[ 0.09783935546875, 0.2481689453125, 0.041107177734375, 0.1976318359375, 0.2259521484375, 0.1026611328125, 0.0867919921875, 0.1629638671875, 0.206787109375, 0.207275390625, 0.1309814453125, 0.2340087890625, 0.117919921875, 0.1739501953125, 0.06201171875, 0.1170654296875, 0.099365234375...

embed

42684129_c0

42684129

haskell

0

Title: Disable "Segmentation fault/access violation in generated code"? Problem title: Disable "Segmentation fault/access violation in generated code"? Tags: haskell, ghc, ffi Problem: Disable "Segmentation fault/access violation in generated code"? We're using FFI to call potentially unsafe C funct...

Disable "Segmentation fault/access violation in generated code"? Disable "Segmentation fault/access violation in generated code"? haskell ghc ffi Disable Segmentation Disable "Segmentation fault/access violation in generated code"? We're using FFI to call potentially unsafe C functions. Sometimes bu...

[ 0.01055908203125, 0.006866455078125, 0.00421142578125, -0.0166015625, -0.000614166259765625, -0.004638671875, -0.0012664794921875, 0.006439208984375, -0.01068115234375, -0.022705078125, -0.01409912109375, 0.0040283203125, 0.023193359375, 0.0322265625, 0.0166015625, -0.00104522705078125...

[ 6206, 2886, 2507, 674, 2320, 193857, 113041, 200265, 139392, 18151, 1556, 142508, 31380, 238, 24500, 38462, 294, 64, 23, 71, 17368, 563, 22724, 11782, 38516, 51, 115840, 313, 32354, 54608, 20625, 7426, 2037, 26008, 130250, 9626, 3773, 53418, ...

[ 0.095458984375, 0.1751708984375, 0.1795654296875, 0.181640625, 0.05517578125, 0.207275390625, 0.1854248046875, 0.210693359375, 0.1595458984375, 0.1649169921875, 0.1259765625, 0.2230224609375, 0.0902099609375, 0.048828125, 0.1788330078125, 0.2022705078125, 0.000030517578125, 0.01419...

embed

10439017_c0

10439017

haskell

0

Title: How do I fix an "Occurs check: cannot construct the infinite type" error? Problem title: How do I fix an "Occurs check: cannot construct the infinite type" error? Tags: haskell, list Problem: How do I fix an "Occurs check: cannot construct the infinite type" error? I am trying to write a remo...

How do I fix an "Occurs check: cannot construct the infinite type" error? How do I fix an "Occurs check: cannot construct the infinite type" error? haskell list How Occurs x:xs not.a Bool When How do I fix an "Occurs check: cannot construct the infinite type" error? I am trying to write a remove fun...

[ 0.0013885498046875, 0.017333984375, -0.0003108978271484375, 0.01348876953125, -0.00213623046875, -0.00994873046875, -0.0021209716796875, 0.00136566162109375, -0.00058746337890625, -0.01202392578125, 0.002288818359375, -0.0126953125, 0.00970458984375, 0.000972747802734375, -0.010681152343...

[ 11249, 30022, 670, 238, 48650, 12765, 53418, 64549, 54241, 10644, 18499, 13, 1556, 142508, 5303, 180, 1022, 425, 7, 959, 11, 2460, 929, 12, 31577, 33022, 87388, 32354, 38937, 71, 2055, 712, 140992, 18151, 25632, 26008, 29459, 15549, 17932, ...

[ 0.006134033203125, 0.1224365234375, 0.08349609375, 0.08544921875, 0.2117919921875, 0.2049560546875, 0.16064453125, 0.1871337890625, 0.1513671875, 0.201171875, 0.185302734375, 0.055419921875, 0.06597900390625, 0.1640625, 0.09271240234375, 0.09326171875, 0.042816162109375, 0.09313964...

embed

23466779_c0

23466779

haskell

0

Title: getArgs expecting [char] instead of [string] Problem title: getArgs expecting [char] instead of [string] Tags: haskell, io Problem: getArgs expecting [char] instead of [string] This code worked fine when it only took first. I get this error after having added second. Couldn't match expected type 'Char' with actu...

getArgs expecting [char] instead of [string] getArgs expecting [char] instead of [string] haskell io System.Environment Couldn Char Expected Actual Main Hello getArgs expecting [char] instead of [string] This code worked fine when it only took first. I get this error after having added second. Which makes no sense to m...

[ 0.0048828125, -0.01531982421875, -0.00927734375, 0.0240478515625, 0.007354736328125, 0.0296630859375, 0.0037994384765625, 0.0037689208984375, 0.0027923583984375, -0.00634765625, 0.0283203125, -0.02685546875, -0.007659912109375, -0.003936767578125, -0.0040283203125, -0.007110595703125, ...

[ 2046, 7614, 9405, 41206, 214, 9254, 64457, 111, 91693, 1556, 142508, 22995, 12353, 686, 1900, 191147, 19, 21656, 60075, 13, 89829, 100582, 12321, 35378, 18151, 79786, 5885, 4734, 34739, 5117, 903, 18499, 7103, 49814, 17932, 10422, 177, 139124...

[ 0.1331787109375, 0.22509765625, 0.221435546875, 0.2392578125, 0.0828857421875, 0.2135009765625, 0.126953125, 0.0171661376953125, 0.188720703125, 0.0941162109375, 0.1934814453125, 0.184326171875, 0.1009521484375, 0.07183837890625, 0.1097412109375, 0.09210205078125, 0.023590087890625, ...

embed

53341188_c0

53341188

haskell

0

Title: Traverse a tree with an arbitrary number of branches Problem title: Traverse a tree with an arbitrary number of branches Tags: haskell Problem: Traverse a tree with an arbitrary number of branches I want to calculate the maximum degree in a Tree which has an arbitrary number of branches. data Tree a = Node a [Tr...

Traverse a tree with an arbitrary number of branches Traverse a tree with an arbitrary number of branches haskell Traverse Tree Node Show Answer tree1 Traverse a tree with an arbitrary number of branches I want to calculate the maximum degree in a Tree which has an arbitrary number of branches. Now, I am getting an err...

[ -0.012939453125, 0.0277099609375, -0.0206298828125, -0.00689697265625, 0.01397705078125, 0.0093994140625, -0.00970458984375, -0.0218505859375, 0.010986328125, -0.047119140625, -0.0036163330078125, -0.032470703125, 0.0252685546875, 0.0164794921875, 0.00775146484375, 0.0022735595703125, ...

[ 4937, 37676, 10, 53201, 678, 61799, 1294, 14012, 111, 90356, 1556, 142508, 101344, 438, 112, 17367, 418, 87, 3444, 74481, 67, 38132, 79385, 23, 18499, 33022, 26785, 103510, 86869, 2967 ]

[ 0.12451171875, 0.1849365234375, 0.048614501953125, 0.248046875, 0.1177978515625, 0.153564453125, 0.040771484375, 0.119384765625, 0.050018310546875, 0.254638671875, 0.114501953125, 0.2098388671875, 0.225341796875, 0.08868408203125, 0.06121826171875, 0.014251708984375, 0.0015869140625,...

embed

19661885_c0

19661885

haskell

0

Title: Could not find module `Test.QuickCheck' on Ubuntu Problem title: Could not find module `Test.QuickCheck' on Ubuntu Tags: testing, ubuntu, haskell Problem: Could not find module `Test.QuickCheck' on Ubuntu I'm importing QuickCheck at the top of my file: import Test.QuickCheck ... Compiling the file with...

Could not find module `Test.QuickCheck' on Ubuntu Could not find module `Test.QuickCheck' on Ubuntu testing ubuntu haskell Test.QuickCheck Could Ubuntu Lab1.hs Lab1.hs:1:8 Use Failed Could not find module `Test.QuickCheck' on Ubuntu I'm importing QuickCheck at the top of my file: Compiling the file with ghc L...

[ -0.00567626953125, 0.007354736328125, 0.0064697265625, -0.00787353515625, 0.00007486343383789062, 0.003326416015625, 0.023681640625, -0.020263671875, -0.00640869140625, -0.004364013671875, -0.006744384765625, -0.0361328125, 0.00640869140625, -0.007110595703125, -0.015869140625, 0.01062...

[ 191147, 959, 7413, 88996, 111337, 96010, 2594, 202567, 3768, 98, 116890, 134234, 198996, 1556, 142508, 8647, 21488, 127, 1019, 36836, 190355, 24927, 89038, 2663, 11435, 15612, 31380, 238, 418, 903, 18499, 1747, 18, 408, 33938, 63773, 78292, 5...

[ 0.007904052734375, 0.06756591796875, 0.13330078125, 0.228759765625, 0.2216796875, 0.158203125, 0.128662109375, 0.30810546875, 0.1185302734375, 0.0249481201171875, 0.1876220703125, 0.1552734375, 0.129150390625, 0.0897216796875, 0.1717529296875, 0.1671142578125, 0.15673828125, 0.0855...

embed

21110623_c0

21110623

haskell

0

Title: Understanding the definition of a recursive function Problem title: Understanding the definition of a recursive function Tags: haskell Problem: Understanding the definition of a recursive function Hi could anyone explain to me how these pieces of code come about their answers? pip = phi 4 where phi x = if x == 1...

Understanding the definition of a recursive function Understanding the definition of a recursive function haskell Understanding x-1 Understanding the definition of a recursive function Hi could anyone explain to me how these pieces of code come about their answers? This returns a result of 26. And this returns a result...

[ 0.002655029296875, 0.009765625, -0.0191650390625, 0.0303955078125, -0.0003223419189453125, 0.00799560546875, -0.002349853515625, 0.00159454345703125, 0.0223388671875, -0.03173828125, -0.00787353515625, -0.0181884765625, -0.010009765625, 0.0260009765625, 0.0238037109375, 0.0206298828125...

[ 9626, 144057, 80934, 195625, 5844, 32354, 10, 1556, 142508, 1022, 5759, 111, 5809, 35672, 73342, 3642, 6097, 126371, 18151, 1380, 1672, 35166, 30646, 16750, 12490, 170242, 21373, 63847, 173340, 382, 162, 6849, 110, 6528, 50339, 69307 ]

[ 0.0762939453125, 0.0955810546875, 0.1644287109375, 0.2191162109375, 0.1724853515625, 0.1844482421875, 0.03240966796875, 0.1251220703125, 0.2254638671875, 0.086669921875, 0.150390625, 0.03399658203125, 0.007904052734375, 0.0059814453125, 0.109130859375, 0.0447998046875, 0.019546508789...

embed

10218076_c0

10218076

haskell

0

Title: Why does the list functor represent a context of nondeterministic choice? Problem title: Why does the list functor represent a context of nondeterministic choice? Tags: haskell, functional-programming Problem: Why does the list functor represent a context of nondeterministic choice? What does this quote mean? th...

Why does the list functor represent a context of nondeterministic choice? Why does the list functor represent a context of nondeterministic choice? haskell functional-programming Why Why does the list functor represent a context of nondeterministic choice? What does this quote mean? In the context of Functors in functi...

[ -0.004669189453125, 0.00897216796875, 0.01373291015625, 0.01177978515625, -0.003662109375, 0.00323486328125, 0.000606536865234375, -0.01153564453125, 0.0177001953125, 0.0294189453125, -0.0216064453125, -0.0274658203125, 0.00653076171875, 0.0126953125, -0.0247802734375, 0.01904296875, ...

[ 44084, 5303, 7477, 18770, 33636, 43701, 351, 112, 30524, 48242, 44126, 111, 1556, 142508, 123309, 28966, 14602, 70, 10, 66747, 29459, 28670, 56037, 28219, 83, 98102, 20037, 81273, 59911, 32354, 61514, 80854, 116419, 144, 45646, 678, 7722, 137...

[ 0.1282958984375, 0.226318359375, 0.1842041015625, 0.2430419921875, 0.2064208984375, 0.249755859375, 0.133056640625, 0.07244873046875, 0.165771484375, 0.11279296875, 0.177001953125, 0.05517578125, 0.07861328125, 0.1824951171875, 0.1605224609375, 0.06756591796875, 0.005157470703125, ...

embed

35331801_c0

35331801

haskell

0

Title: How to send text to GHCi process? Problem title: How to send text to GHCi process? Tags: ghci, haskell Problem: How to send text to GHCi process? I'm working on Haskell presentation engine Howerpoint . It is running in GHCi. I would like to create a function which would output a statement to current running GHCi...

How to send text to GHCi process? How to send text to GHCi process? ghci haskell How GHCi How to send text to GHCi process? I'm working on Haskell presentation engine Howerpoint . It is running in GHCi. I would like to create a function which would output a statement to current running GHCi session. It must work on Lin...

[ 0.0115966796875, -0.003448486328125, -0.0135498046875, 0.0108642578125, -0.01129150390625, -0.0059814453125, 0.020263671875, 0.0033416748046875, -0.0172119140625, -0.03857421875, 0.0162353515625, -0.016845703125, -0.0150146484375, 0.0247802734375, 0.00592041015625, 0.0052490234375, -...

[ 11249, 47, 25379, 7986, 527, 73265, 14, 9433, 31380, 318, 1556, 142508, 20697, 20625, 92252, 87907, 56, 38496, 51042, 1884, 28282, 32354, 140992, 63805, 43581, 56002, 8110, 4488, 29908, 136, 4727, 3773, 63559, 28670, 10644, 37842, 21771, 2046...

[ 0.0987548828125, 0.1834716796875, 0.1746826171875, 0.2568359375, 0.111328125, 0.1624755859375, 0.2276611328125, 0.1884765625, 0.10125732421875, 0.17333984375, 0.1121826171875, 0.2119140625, 0.033203125, 0.08038330078125, 0.09228515625, 0.0765380859375, 0.03900146484375, 0.177001953...

embed

1450411_c0

1450411

haskell

0

Title: Why is ghc evaluating my infinite list? Problem title: Why is ghc evaluating my infinite list? Tags: lazy-evaluation, haskell Problem: Why is ghc evaluating my infinite list? As my first haskell program I'm trying to do this - it's the hard way to get 1 to 10. I'm constructing an infinite list of integers, and s...

Why is ghc evaluating my infinite list? Why is ghc evaluating my infinite list? lazy-evaluation haskell Data.List Why Main Why is ghc evaluating my infinite list? As my first haskell program I'm trying to do this - it's the hard way to get 1 to 10. I'm constructing an infinite list of integers, and sorting them, and ta...

[ 0.0068359375, -0.000713348388671875, 0.0166015625, -0.01611328125, -0.0140380859375, 0.0028533935546875, 0.0172119140625, -0.010986328125, -0.00689697265625, -0.029052734375, 0.00787353515625, -0.0196533203125, 0.015380859375, 0.004058837890625, 0.0030517578125, 0.00020694732666015625,...

[ 44084, 83, 31380, 238, 151575, 214, 759, 54241, 13, 5303, 21, 3285, 159258, 1363, 1556, 142508, 11809, 154663, 12321, 5117, 1528, 31577, 7941, 2046, 106, 47, 4068, 64549, 892, 26255, 12096, 35971, 91177, 122991, 4488, 678, 216806, 219836, 8...

[ 0.1375732421875, 0.036376953125, 0.128662109375, 0.138427734375, 0.1761474609375, 0.06243896484375, 0.0574951171875, 0.1358642578125, 0.0997314453125, 0.1864013671875, 0.0938720703125, 0.184326171875, 0.1793212890625, 0.00494384765625, 0.1104736328125, 0.2069091796875, 0.081909179687...

embed

46147236_c0

46147236

haskell

0

Title: Haskell: Pretty print infix and prefix Problem title: Haskell: Pretty print infix and prefix Tags: types, abstract-syntax-tree, pretty-print, haskell Problem: Haskell: Pretty print infix and prefix I have a type to represent haskell types: data Type = TApp Type Type | TVar Name | TLit Name infixl 8 `TApp` -- a -...

Haskell: Pretty print infix and prefix Haskell: Pretty print infix and prefix types abstract-syntax-tree pretty-print haskell Haskell Pretty Type TApp TVar Name TLit Fun Maybe Haskell: Pretty print infix and prefix I have a type to represent haskell types: I want to print it as haskell does, namely, literals that are s...

[ -0.000751495361328125, -0.01092529296875, 0.0177001953125, 0.00457763671875, -0.021728515625, -0.0087890625, -0.00148773193359375, -0.00299072265625, -0.0036773681640625, 0.00750732421875, 0.0155029296875, -0.03466796875, 0.0064697265625, 0.005523681640625, 0.004119873046875, 0.0205078...

[ 20625, 142508, 197570, 28412, 23, 55923, 136, 183114, 52895, 164789, 86531, 62600, 28875, 35662, 1556, 60457, 39179, 1910, 147, 15757, 217, 28670, 83425, 765, 10644, 33636, 3444, 237, 14602, 15659, 16765, 26582, 12960, 3789, 289, 49129, 160291,...

[ 0.1304931640625, 0.2269287109375, 0.213623046875, 0.20361328125, 0.09912109375, 0.2164306640625, 0.032318115234375, 0.2071533203125, 0.2017822265625, 0.1224365234375, 0.1038818359375, 0.1260986328125, 0.1636962890625, 0.14599609375, 0.13134765625, 0.19482421875, 0.143798828125, 0.0...

embed

67127128_c0

67127128

haskell

0

Title: wierd type-error of 2 different records with a field with same name Problem title: wierd type-error of 2 different records with a field with same name Tags: haskell Problem: wierd type-error of 2 different records with a field with same name I have the following data structure: data Exp = Var String | Unary { ex...

wierd type-error of 2 different records with a field with same name wierd type-error of 2 different records with a field with same name haskell Exp Unary UnaryOp Binary BinaryOp Not Impl Equal Constructors wierd type-error of 2 different records with a field with same name I have the following data structure: And I get...

[ 0.017822265625, -0.004913330078125, -0.00762939453125, 0.016357421875, 0.00830078125, 0.0113525390625, -0.0201416015625, 0.0069580078125, 0.00567626953125, 0.0019683837890625, -0.004150390625, -0.0159912109375, 0.049560546875, 0.001434326171875, 0.0023193359375, 0.005126953125, 0.000...

[ 1225, 4216, 10644, 188800, 116, 12921, 115923, 678, 44457, 5701, 9351, 1556, 142508, 60075, 4228, 1294, 39029, 54092, 11205, 29128, 141, 71723, 82084, 18770, 111, 25632, 2053, 45646, 18499, 13319, 2046, 15400, 52895, 233, 2967, 23, 71337, 157...

[ 0.1312255859375, 0.2120361328125, 0.1949462890625, 0.1951904296875, 0.126708984375, 0.162109375, 0.1904296875, 0.033294677734375, 0.1563720703125, 0.0941162109375, 0.08489990234375, 0.1239013671875, 0.2169189453125, 0.0867919921875, 0.0833740234375, 0.035400390625, 0.1507568359375, ...

embed

55405735_c2

55405735

haskell

2

%252FLODES7%252Fak%252Fod%252Fak_od_aux_JT00_2002.csv.gz", service name: Just "443"): does not exist (nodename nor servname provided, or not known))) Code signals: VanillaHttpException, Network.URI.Encode, Hitting, Haskell, MonadHttp, T.pack, Pull, GET, EN.encode, NoReqBody, T.splitOn, Main, UsCensusDataLodesScraper, l...

[ -0.0205078125, 0.0111083984375, 0.01611328125, 0.005615234375, 0.01611328125, 0.00186920166015625, 0.00897216796875, -0.005218505859375, -0.0027313232421875, -0.020751953125, 0.01611328125, -0.025634765625, 0.004486083984375, -0.007080078125, 0.01123046875, -0.00628662109375, 0.00848...

[ 2588, 17014, 69193, 344, 12744, 2199, 10442, 112606, 7049, 41632, 4439, 334, 169, 4516, 9351, 9563, 126384, 2077, 14602, 959, 32316, 157, 112, 11627, 12488, 62016, 62952, 707, 51529, 32149, 28864, 26073, 7, 3000, 2298, 3062, 254, 19279, 639...

[ 0.00299072265625, 0.093505859375, 0.125732421875, 0.044097900390625, 0.0263671875, 0.10791015625, 0.1761474609375, 0.0966796875, 0.1441650390625, 0.2049560546875, 0.024810791015625, 0.1346435546875, 0.0650634765625, 0.23291015625, 0.09454345703125, 0.1912841796875, 0.333740234375, ...

embed

23085422_c0

23085422

haskell

0

Title: Encode strings parsed by HXT to proper UTF8 String Problem title: Encode strings parsed by HXT to proper UTF8 String Tags: utf-8, hxt, haskell Problem: Encode strings parsed by HXT to proper UTF8 String I am parsing utf8-encoded pages using hxt, simplified parser example: names = multi (hasName "h1") >>> proc h1...

Encode strings parsed by HXT to proper UTF8 String Encode strings parsed by HXT to proper UTF8 String utf-8 hxt haskell Encode HXT UTF8 Main Data.Text.IO.putStrLn Data.Text.pack utf-8 Encode strings parsed by HXT to proper UTF8 String I am parsing utf8-encoded pages using hxt, simplified parser example: Everything goes...

[ 0.0068359375, 0.01556396484375, 0.00152587890625, 0.015869140625, -0.01495361328125, 0.00897216796875, 0.0140380859375, -0.0027008056640625, -0.0087890625, 0.000025391578674316406, -0.0038909912109375, -0.05419921875, 0.0218505859375, 0.016357421875, -0.00830078125, 0.00095748901367187...

[ 357, 40899, 79315, 366, 5281, 390, 572, 70981, 47, 27798, 345, 30992, 1019, 23351, 486, 420, 17376, 1096, 29062, 1556, 142508, 12321, 11809, 174379, 17780, 7077, 71713, 5, 29102, 66332, 37967, 17368, 112892, 1029, 2189, 27781, 171581, 60899, ...

[ 0.12109375, 0.212158203125, 0.221923828125, 0.135498046875, 0.010986328125, 0.026031494140625, 0.138916015625, 0.274169921875, 0.0828857421875, 0.1103515625, 0.0426025390625, 0.186767578125, 0.20947265625, 0.15283203125, 0.09521484375, 0.10400390625, 0.176025390625, 0.11669921875, ...

embed

53101532_c0

53101532

haskell

0

Title: Text.ParserCombinators.Parsec oneOf function has error Problem title: Text.ParserCombinators.Parsec oneOf function has error Tags: haskell Problem: Text.ParserCombinators.Parsec oneOf function has error ghci version is GHCi, version 8.6.1: http://www.haskell.org/ghc/ Prelude> :m +Text.ParserCombinators.Parsec Pr...

Text.ParserCombinators.Parsec oneOf function has error Text.ParserCombinators.Parsec oneOf function has error haskell Text.ParserCombinators.Parsec Prelude Non Text.Parsec.Prim.Stream Char Use FlexibleContexts When Text.Parsec.Prim.ParsecT Text.ParserCombinators.Parsec oneOf function has error ghci version is GHCi, ver...

[ 0.004638671875, 0.006927490234375, 0.007720947265625, 0.033935546875, 0.007232666015625, 0.0006103515625, -0.0022125244140625, -0.02099609375, -0.00408935546875, -0.033935546875, -0.00604248046875, -0.0308837890625, 0.0130615234375, 0.00092315673828125, -0.0135498046875, -0.01068115234...

[ 24129, 28636, 2189, 10770, 19155, 22230, 39797, 1632, 132887, 32354, 1556, 18499, 142508, 1914, 822, 3775, 145111, 115061, 21656, 36836, 180842, 2661, 22829, 5, 618, 31380, 318, 11389, 527, 73265, 14, 3217, 173245, 10557, 9486, 238, 44084 ]

[ 0.1572265625, 0.1165771484375, 0.10009765625, 0.030792236328125, 0.19775390625, 0.10137939453125, 0.1942138671875, 0.1650390625, 0.320068359375, 0.21240234375, 0.1026611328125, 0.251708984375, 0.2320556640625, 0.05523681640625, 0.157470703125, 0.08416748046875, 0.1131591796875, 0.1...

embed

27361127_c0

27361127

haskell

0

Title: Refactor pipes interface Problem title: Refactor pipes interface Tags: haskell, pipe, refactoring Problem: Refactor pipes interface I'm putting together a model of an encoder using the pipes library (4.1.4). I have a working function encode :: (Monad m) => Int -> - -- number of codes per bit Producer Word32 m r ...

Refactor pipes interface Refactor pipes interface haskell pipe refactoring Refactor Monad Producer Word32 P.zipWith Pipe Refactor pipes interface I'm putting together a model of an encoder using the pipes library (4.1.4). I have a working function And I'd like to refactor it as I think its usage is clearer; it encodes ...

[ 0.0030517578125, 0.000972747802734375, -0.01055908203125, 0.015869140625, -0.0322265625, 0.000858306884765625, -0.03076171875, -0.01611328125, 0.0035858154296875, -0.0184326171875, -0.0098876953125, 0.0040283203125, 0.0198974609375, 0.0185546875, 0.0155029296875, 0.004608154296875, 0...

[ 853, 144810, 137158, 7, 101758, 1556, 142508, 456, 214, 60331, 71, 103687, 56, 22543, 6460, 436, 50836, 194583, 93128, 13, 118620, 25842, 3299, 22, 587, 820, 17368, 35773, 1294, 9451, 91977, 765, 20697, 32354, 1884, 47, 442, 5351, 127689, ...

[ 0.1671142578125, 0.308349609375, 0.232666015625, 0.08441162109375, 0.248291015625, 0.1058349609375, 0.20703125, 0.1673583984375, 0.0208892822265625, 0.152587890625, 0.1136474609375, 0.157958984375, 0.09417724609375, 0.13232421875, 0.2008056640625, 0.0684814453125, 0.1649169921875, ...

embed

66461055_c0

66461055

haskell

0

Title: Run the GC based on physical memory Problem title: Run the GC based on physical memory Tags: haskell, garbage-collection Problem: Run the GC based on physical memory I am running my code on AWS Lambda and I have some performance issues depending on the memory I allocate to the Lambda. For the same call: 128 MB |...

Run the GC based on physical memory Run the GC based on physical memory haskell garbage-collection Run Cold Nominal Run the GC based on physical memory I am running my code on AWS Lambda and I have some performance issues depending on the memory I allocate to the Lambda. For the same call: The maximum used memory is al...

[ 0.00830078125, 0.014404296875, 0.01361083984375, -0.01129150390625, 0.00970458984375, -0.005462646484375, -0.00003552436828613281, 0.023193359375, 0.0159912109375, -0.0166015625, 0.01416015625, -0.01446533203125, -0.01708984375, 0.0001430511474609375, 0.0242919921875, 0.0194091796875, ...

[ 28398, 70, 69657, 35509, 98, 72761, 98323, 1556, 142508, 3671, 402, 429, 196352, 146185, 438, 1249, 289, 51042, 18151, 62, 52143, 122930, 85, 23718, 37348, 96819, 24286, 11782, 581, 38132, 11814, 11343, 9365, 73238, 12918, 57767, 185553, 5792...

[ 0.19970703125, 0.140625, 0.25048828125, 0.1644287109375, 0.037872314453125, 0.223388671875, 0.26123046875, 0.108154296875, 0.2330322265625, 0.054901123046875, 0.1519775390625, 0.0633544921875, 0.1290283203125, 0.24072265625, 0.01947021484375, 0.140380859375, 0.008087158203125, 0.11...

embed

67386251_c0

67386251

haskell

0

Title: deriving Applicative in haskell Problem title: deriving Applicative in haskell Tags: haskell Problem: deriving Applicative in haskell Why wouldn't GHC derive Applicative for KO ? #!/usr/bin/env stack -- stack --resolver lts-17.10 script {-# LANGUAGE DeriveFunctor #-} {-# LANGUAGE GeneralizedNewtypeDeriving #-} n...

deriving Applicative in haskell deriving Applicative in haskell haskell Applicative lts-17.10 LANGUAGE DeriveFunctor GeneralizedNewtypeDeriving Functor deriving Applicative in haskell Why wouldn't GHC derive Applicative for KO ?

[ 0.01171875, 0.015869140625, -0.00518798828125, 0.01953125, 0.0166015625, 0.0022735595703125, 0.01348876953125, -0.006011962890625, -0.000545501708984375, 0.001922607421875, 0.0004367828369140625, -0.0341796875, 0.01092529296875, 0.0133056640625, -0.0279541015625, -0.01904296875, 0.00...

[ 16406, 6496, 5659, 11048, 4935, 23, 1556, 142508, 933, 13521, 963, 98064, 75930, 1310, 5844, 97249, 18770, 9082, 46568, 50986, 47731, 14, 28670, 44084, 68746, 18, 527, 73265, 122, 100, 11841 ]

[ 0.150146484375, 0.093505859375, 0.1656494140625, 0.188232421875, 0.17822265625, 0.08917236328125, 0.1522216796875, 0.2154541015625, 0.0579833984375, 0.08966064453125, 0.11395263671875, 0.0911865234375, 0.01702880859375, 0.0975341796875, 0.11871337890625, 0.10064697265625, 0.083312988...

embed

30958706_c0

30958706

haskell

0

Title: Display a full image with wxHaskell Problem title: Display a full image with wxHaskell Tags: haskell, wxhaskell Problem: Display a full image with wxHaskell I am using wxHaskell to display a full image in a window. My code is: import Graphics.UI.WX import Graphics.UI.WXCore main :: IO () main = start testimg tes...

Display a full image with wxHaskell Display a full image with wxHaskell haskell wxhaskell Graphics.UI.WX Graphics.UI.WXCore Display Test Image landscape.png Display a full image with wxHaskell I am using wxHaskell to display a full image in a window. My code is: Anyway when the app runs nothing is displayed (not even t...

[ -0.0004119873046875, 0.00482177734375, -0.003997802734375, 0.000492095947265625, -0.002044677734375, 0.0130615234375, 0.01361083984375, -0.018310546875, -0.0022430419921875, -0.026123046875, 0.0225830078125, 0.0032196044921875, -0.014404296875, 0.01611328125, -0.005126953125, 0.0057983...

[ 90045, 4393, 29569, 678, 148, 425, 6495, 7, 142508, 1556, 137056, 189682, 33457, 1456, 1542, 4524, 8647, 22710, 212790, 128468, 17368, 44116, 23, 76896, 18151, 126786, 3229, 4027, 127877, 33720, 132988, 4488 ]

[ 0.1715087890625, 0.1663818359375, 0.1536865234375, 0.06695556640625, 0.0966796875, 0.1241455078125, 0.135009765625, 0.0869140625, 0.234130859375, 0.1148681640625, 0.0845947265625, 0.1197509765625, 0.04534912109375, 0.06817626953125, 0.12841796875, 0.1134033203125, 0.1285400390625, ...

embed

30966910_c0

30966910

haskell

0

Title: Why are takeR, dropR and splitAtR missing from Data.Sequence? Problem title: Why are takeR, dropR and splitAtR missing from Data.Sequence? Tags: sequence, haskell, containers Problem: Why are takeR, dropR and splitAtR missing from Data.Sequence? Data.Sequence has takeWhileR and dropWhileR for efficient deconstru...

Why are takeR, dropR and splitAtR missing from Data.Sequence? Why are takeR, dropR and splitAtR missing from Data.Sequence? sequence haskell containers Data.Sequence Why Seq containers-0.5.6.3 Why are takeR, dropR and splitAtR missing from Data.Sequence? Data.Sequence has takeWhileR and dropWhileR for efficient deconst...

[ 0.0162353515625, 0.020751953125, -0.0128173828125, -0.017578125, -0.0191650390625, -0.0086669921875, 0.00201416015625, 0.003204345703125, -0.00634765625, -0.00159454345703125, 0.01080322265625, 0.0213623046875, -0.01104736328125, 0.0120849609375, 0.019287109375, 0.01373291015625, -0....

[ 44084, 5646, 1052, 36069, 65450, 28848, 132283, 11809, 4233, 944, 3956, 1556, 142508, 116419, 503, 864, 93645, 200768, 979, 133, 93766, 8, 238478, 7108, 44689, 146291, 136, 29479, 69407, 51287, 1360, 36456, 123309, 99201, 24, 208124, 21455, 5...

[ 0.0653076171875, 0.165771484375, 0.190185546875, 0.172119140625, 0.1541748046875, 0.14111328125, 0.1270751953125, 0.110595703125, 0.06915283203125, 0.102294921875, 0.028045654296875, 0.07403564453125, 0.1839599609375, 0.176025390625, 0.06219482421875, 0.1439208984375, 0.116455078125,...

embed

39678258_c0

39678258

haskell

0

Title: Remove phantom type variable Problem title: Remove phantom type variable Tags: phantom-types, haskell Problem: Remove phantom type variable Suppose i have some type like: newtype Foo a b = Foo { getFoo :: SomeStructure b } I.e. a is a phantom type used only for compile-time checks. However, I don't want to use t...

Remove phantom type variable Remove phantom type variable phantom-types haskell Remove Foo SomeStructure FooUnrestricted Anything Remove phantom type variable Suppose i have some type like: I.e. a is a phantom type used only for compile-time checks. However, I don't want to use the phantom type everywhere. It's not uni...

[ 0.0054931640625, 0.003997802734375, -0.006500244140625, 0.0242919921875, 0.00714111328125, 0.005706787109375, -0.0026092529296875, 0.01519775390625, 0.0091552734375, -0.00347900390625, -0.014404296875, -0.017578125, -0.01953125, -0.0054931640625, -0.01129150390625, -0.00051116943359375...

[ 181139, 68743, 5928, 10644, 77336, 50986, 1556, 142508, 9572, 31, 31384, 71713, 18190, 144225, 28541, 64113, 10, 11814, 4734, 9969, 1340, 6032, 12765, 3444, 4527, 219743, 32813, 80234, 18151, 1884, 5608, 3687, 46876, 111938, 42856, 8561, 6275, ...

[ 0.169677734375, 0.157470703125, 0.188232421875, 0.209228515625, 0.252685546875, 0.203857421875, 0.1053466796875, 0.2296142578125, 0.133056640625, 0.0867919921875, 0.036407470703125, 0.0389404296875, 0.052703857421875, 0.114013671875, 0.1234130859375, 0.214599609375, 0.141357421875, ...

embed

5268156_c0

5268156

haskell

0

Title: How do you do an in-place quicksort in Haskell Problem title: How do you do an in-place quicksort in Haskell Tags: haskell Problem: How do you do an in-place quicksort in Haskell Could somebody provide an in-place quicksort haskell function? I.e. it returns a new sorted list, but the input list is copied to a mu...

How do you do an in-place quicksort in Haskell How do you do an in-place quicksort in Haskell haskell How Haskell How do you do an in-place quicksort in Haskell Could somebody provide an in-place quicksort haskell function? I.e. it returns a new sorted list, but the input list is copied to a mutable array or something....

[ -0.004638671875, 0.0245361328125, 0.0255126953125, -0.032470703125, -0.00762939453125, 0.0030670166015625, -0.007232666015625, -0.00982666015625, 0.00982666015625, -0.005096435546875, 0.014404296875, 0.004913330078125, 0.00640869140625, -0.004180908203125, -0.000286102294921875, 0.0042...

[ 11249, 54, 142, 23, 23935, 63773, 62351, 20625, 142508, 1556, 191147, 176256, 22691, 32354, 30646, 3525, 17497, 5303, 1284, 107730, 71200, 47, 842, 22819, 10298, 23718, 130306, 1528, 40226, 45712, 2776, 47763, 561, 2053, 45646, 12638, 5646, 1...

[ 0.0767822265625, 0.07122802734375, 0.05096435546875, 0.146728515625, 0.191650390625, 0.1824951171875, 0.269775390625, 0.1446533203125, 0.259033203125, 0.1414794921875, 0.03399658203125, 0.01092529296875, 0.0616455078125, 0.1610107421875, 0.1346435546875, 0.097900390625, 0.22424316406...

embed

2223468_c0

2223468

haskell

0

Title: Haskell "where" indentation: why must it be indented past identifier? Problem title: Haskell "where" indentation: why must it be indented past identifier? Tags: haskell, indentation Problem: Haskell "where" indentation: why must it be indented past identifier? This code: import Data.Char (dig...

Haskell "where" indentation: why must it be indented past identifier? Haskell "where" indentation: why must it be indented past identifier? haskell indentation Data.Char Haskell x:xs Haskell "where" indentation: why must it be indented past identifier? This code: Fails: But this version: is ok: I ca...

[ 0.002685546875, 0.000713348388671875, -0.01556396484375, 0.0038604736328125, -0.0169677734375, 0.013671875, -0.00060272216796875, -0.0107421875, 0.0201416015625, -0.005157470703125, 0.010986328125, -0.01458740234375, -0.0035247802734375, -0.0128173828125, -0.0023193359375, -0.019042968...

[ 20625, 142508, 136913, 41502, 18597, 22062, 15400, 8110, 3674, 11015, 42485, 56, 1556, 11809, 84068, 1022, 12, 425, 18151, 190355, 4966, 903, 11389, 3664, 26366, 8382, 6626, 4568, 933, 26866 ]

[ 0.1383056640625, 0.222900390625, 0.214111328125, 0.03387451171875, 0.201416015625, 0.1226806640625, 0.1748046875, 0.1336669921875, 0.122314453125, 0.2364501953125, 0.21240234375, 0.09814453125, 0.126708984375, 0.08203125, 0.0999755859375, 0.02203369140625, 0.0225677490234375, 0.077...

embed

72344195_c0

72344195

haskell

0

Title: Generating Simple List from 1 to 10 with haskell Problem title: Generating Simple List from 1 to 10 with haskell Tags: list, increment, haskell, counter Problem: Generating Simple List from 1 to 10 with haskell I am new in Haskell, could guys help me how to generating list from 1 to 10. I tried to make like this...

Generating Simple List from 1 to 10 with haskell Generating Simple List from 1 to 10 with haskell list increment haskell counter 1 Generating Simple List Integer n-1 Generating Simple List from 1 to 10 with haskell I am new in Haskell, could guys help me how to generating list from 1 to 10. I tried to make like this: T...

[ 0.00634765625, 0.006500244140625, -0.0162353515625, 0.0191650390625, 0.0074462890625, 0.00811767578125, -0.005035400390625, 0.00909423828125, -0.0009765625, -0.02880859375, -0.0064697265625, -0.02001953125, 0.01251220703125, 0.041748046875, 0.007171630859375, -0.007568359375, 0.01440...

[ 155370, 1916, 60552, 32036, 1295, 106, 47, 209, 678, 1556, 142508, 5303, 158661, 105416, 44401, 653, 5759, 3525, 20625, 5809, 51484, 4358, 3642, 12663, 4068, 37842, 3249, 1884, 16750, 959, 831, 32354, 237, 34292, 18151, 3444, 11782, 140992, ...

[ 0.1571044921875, 0.04931640625, 0.207763671875, 0.2027587890625, 0.07598876953125, 0.123046875, 0.12109375, 0.2135009765625, 0.06744384765625, 0.154296875, 0.2115478515625, 0.1949462890625, 0.1595458984375, 0.1334228515625, 0.12353515625, 0.00115966796875, 0.1195068359375, 0.040649...

embed

45651550_c0

45651550

haskell

0

Title: Define concat function for Digits Problem title: Define concat function for Digits Tags: haskell Problem: Define concat function for Digits I have a list chars and I would like to concat all characters, which are digits and which are next to each other For example: ['1','5','+','2','4'] => ["15","+","24"] concat...

Define concat function for Digits Define concat function for Digits haskell Define Digits concat1 Char Couldn Expected Actual Define concat function for Digits I have a list chars and I would like to concat all characters, which are digits and which are next to each other For example: ['1','5','+','2','4'] => ["15","+"...

[ -0.004150390625, -0.01495361328125, 0.007110595703125, 0.005828857421875, -0.00799560546875, 0.0250244140625, -0.0098876953125, 0.017578125, 0.0118408203125, 0.00009679794311523438, -0.01177978515625, -0.008544921875, -0.013427734375, -0.01116943359375, -0.0015716552734375, -0.01501464...

[ 262, 64552, 158, 4460, 32354, 100, 51174, 933, 1556, 142508, 418, 21656, 191147, 19, 60075, 13, 100582, 5303, 21441, 7, 2806, 1884, 47, 756, 124850, 153939, 11737, 12638, 3789, 27781, 758, 1328, 304, 617, 44357, 1837, 2357, 37842, 18151, ...

[ 0.0780029296875, 0.19189453125, 0.1827392578125, 0.296630859375, 0.20849609375, 0.06982421875, 0.1619873046875, 0.1544189453125, 0.1168212890625, 0.22119140625, 0.09027099609375, 0.16064453125, 0.117919921875, 0.04144287109375, 0.10223388671875, 0.10528564453125, 0.1348876953125, 0...

embed

45757839_c0

45757839

haskell

0

Title: Removing duplicate elements in a Seq Problem title: Removing duplicate elements in a Seq Tags: haskell Problem: Removing duplicate elements in a Seq wondering how to implement nub over a Seq a I get that one could do: nubSeq :: Seq a -> Seq a nubSeq = fromList . nub . toList Just wondering is there something sta...

Removing duplicate elements in a Seq Removing duplicate elements in a Seq haskell Removing Seq Data.Sequence.foldrWithIndex Data.Sequence.elemIndexR Just Nothing Data.Sequence.empty Removing duplicate elements in a Seq wondering how to implement nub over a Seq a I get that one could do: Just wondering is there somethin...

[ -0.0059814453125, 0.036376953125, 0.0166015625, -0.00579833984375, 0.001312255859375, -0.000682830810546875, 0.01507568359375, 0.01007080078125, -0.0062255859375, -0.039794921875, -0.0299072265625, 0.005462646484375, -0.005828857421875, 0.015625, -0.015869140625, 0.0078125, 0.0011291...

[ 853, 432, 6496, 171763, 67, 80854, 23, 503, 864, 1556, 142508, 11809, 4233, 944, 42822, 194583, 39659, 27889, 1052, 9563, 182747, 33548, 149016, 3642, 29479, 315, 275, 645, 10, 2046, 5809, 9844, 5570, 959, 96760, 32036, 11782, 1984, 11, 1...

[ 0.0201873779296875, 0.1429443359375, 0.07958984375, 0.2257080078125, 0.1370849609375, 0.19287109375, 0.042999267578125, 0.1195068359375, 0.19677734375, 0.1204833984375, 0.2099609375, 0.09307861328125, 0.019927978515625, 0.03936767578125, 0.084228515625, 0.05999755859375, 0.1088867187...

embed

47444436_c0

47444436

haskell

0

Title: In Haskell, how can I get a list of available functions for a data structure? Problem title: In Haskell, how can I get a list of available functions for a data structure? Tags: haskell Problem: In Haskell, how can I get a list of available functions for a data structure? I know I'm asking the wrong question here...

In Haskell, how can I get a list of available functions for a data structure? In Haskell, how can I get a list of available functions for a data structure? haskell Haskell NTree In Haskell, how can I get a list of available functions for a data structure? I know I'm asking the wrong question here, but I'm coming to Has...

[ 0.0206298828125, 0.00250244140625, -0.001312255859375, -0.00009202957153320312, 0.00897216796875, 0.0155029296875, 0.008056640625, -0.018798828125, 0.0245361328125, -0.0537109375, -0.00921630859375, -0.0361328125, -0.0022430419921875, -0.01190185546875, -0.006591796875, -0.012023925781...

[ 360, 20625, 142508, 3642, 831, 2046, 10, 5303, 111, 19882, 32354, 7, 100, 2053, 45646, 1556, 107, 13, 47, 1295, 145581, 183234, 150624, 18507, 572, 70981, 366, 184, 92537, 11435, 4527, 16750, 65779, 441, 102656, 982, 2806, 1672, 20949, 28...

[ 0.060302734375, 0.1451416015625, 0.257568359375, 0.055877685546875, 0.0677490234375, 0.138427734375, 0.0880126953125, 0.1917724609375, 0.0921630859375, 0.2486572265625, 0.273193359375, 0.057403564453125, 0.0999755859375, 0.1287841796875, 0.242431640625, 0.0889892578125, 0.16320800781...

embed

69325169_c0

69325169

haskell

0

Title: Haskell: a return before is cancelled out by a monad after. How? Problem title: Haskell: a return before is cancelled out by a monad after. How? Tags: type-inference, return, haskell, monads Problem: Haskell: a return before is cancelled out by a monad after. How? How do I understand the statement return 1 getLi...

Haskell: a return before is cancelled out by a monad after. How? Haskell: a return before is cancelled out by a monad after. How? type-inference return haskell monads Haskell How Prelude Monad Num Haskell: a return before is cancelled out by a monad after. How? How do I understand the statement return 1 getLine ? It pa...

[ -0.0022430419921875, 0.00946044921875, 0.003173828125, 0.02587890625, 0.0157470703125, -0.0079345703125, 0.01202392578125, -0.020263671875, 0.00116729736328125, -0.020751953125, -0.0126953125, -0.02978515625, -0.0291748046875, -0.00946044921875, 0.01324462890625, -0.025634765625, 0.0...

[ 20625, 142508, 30646, 8108, 53017, 6259, 1810, 2667, 712, 7103, 11249, 10644, 73, 69988, 1556, 1914, 822, 112, 60331, 71, 52782, 28219, 63805, 106, 2046, 93232, 10922, 78292, 37202, 31943, 4398, 34680, 3789, 10422, 3564, 12996, 4717, 13, 83...

[ 0.13525390625, 0.251708984375, 0.24365234375, 0.1680908203125, 0.1591796875, 0.08917236328125, 0.1102294921875, 0.0943603515625, 0.146728515625, 0.1226806640625, 0.06585693359375, 0.14013671875, 0.000152587890625, 0.1300048828125, 0.1187744140625, 0.0301513671875, 0.09075927734375, ...

embed

10039274_c0

10039274

haskell

0

Title: Pass Types as arguments to a function in Haskell? Problem title: Pass Types as arguments to a function in Haskell? Tags: haskell, types Problem: Pass Types as arguments to a function in Haskell? The following two functions are extremely similar. They read from a [String] n elements, either [Int] or [Float]. How ...

Pass Types as arguments to a function in Haskell? Pass Types as arguments to a function in Haskell? haskell types Pass Types Haskell x:xs Float Pass Types as arguments to a function in Haskell? The following two functions are extremely similar. They read from a [String] n elements, either [Int] or [Float]. How can I fa...

[ 0.0125732421875, -0.003265380859375, 0.00848388671875, -0.00909423828125, -0.0008392333984375, -0.0000972747802734375, 0.0052490234375, -0.029052734375, -0.0107421875, -0.0233154296875, 0.01324462890625, -0.05224609375, 0.003997802734375, -0.007598876953125, -0.0020904541015625, -0.005...

[ 28872, 60457, 7, 237, 10750, 47, 32354, 23, 20625, 142508, 32, 1556, 52895, 1022, 12, 425, 38699, 257, 25632, 6626, 111531, 21373, 12301, 1295, 71713, 214, 653, 80854, 4153, 18, 919, 365, 31461, 39210, 18151, 1810, 3714, 191619, 8060, 452...

[ 0.20947265625, 0.270751953125, 0.06268310546875, 0.0936279296875, 0.22265625, 0.06317138671875, 0.1597900390625, 0.029083251953125, 0.134033203125, 0.235107421875, 0.008148193359375, 0.110595703125, 0.244873046875, 0.038604736328125, 0.0200347900390625, 0.05535888671875, 0.1774902343...

embed

12636535_c1

12636535

haskell

1

has an idea ? Here's what I do, I spare you the anagram searching and the file parsing functions: -- Read the file -> store the content into a list -> work on that list -> print the output result98 = do contents <- readFile ".\\resources\\98.txt" putStrLn $ (process.words.format) contents -- Find anagram pairs -> Find...

[ 0.00750732421875, -0.00360107421875, 0.001983642578125, 0.00982666015625, 0.00579833984375, 0.0177001953125, -0.00016307830810546875, 0.00013065338134765625, 0.005828857421875, -0.000621795654296875, 0.013916015625, 0.01318359375, -0.034912109375, -0.0262451171875, -0.006866455078125, ...

[ 1556, 142, 6528, 705, 11853, 25, 2367, 87, 54, 69463, 398, 3877, 25561, 157318, 136, 11435, 366, 6953, 32354, 12, 4210, 4764, 70, 33079, 4343, 10941, 3934, 5303, 4488, 28412, 140992, 16750, 16665, 2203, 12301, 174350, 107, 60427, 124326, ...

[ 0.1514892578125, 0.059112548828125, 0.217041015625, 0.0377197265625, 0.06427001953125, 0.01220703125, 0.096923828125, 0.07452392578125, 0.16064453125, 0.1514892578125, 0.006011962890625, 0.21630859375, 0.251708984375, 0.1810302734375, 0.01214599609375, 0.2469482421875, 0.172729492187...

embed

17684906_c0

17684906

haskell

0

Title: Memoize a Double function in Haskell Problem title: Memoize a Double function in Haskell Tags: haskell, memoization Problem: Memoize a Double function in Haskell I have a function slow :: Double -> Double which gets called very often (hundreds of millions of times), but only gets called on about a thousand discr...

Memoize a Double function in Haskell Memoize a Double function in Haskell haskell memoization Memoize Double Haskell Data.Bits Memoize a Double function in Haskell I have a function which gets called very often (hundreds of millions of times), but only gets called on about a thousand discrete values. This seems like an...

[ 0.00015735626220703125, -0.021240234375, 0.031982421875, -0.006988525390625, 0.016845703125, 0.02734375, -0.0179443359375, -0.0012969970703125, 0.01416015625, -0.003936767578125, -0.00439453125, 0.01123046875, 0.00139617919921875, -0.0086669921875, 0.0174560546875, 0.01483154296875, ...

[ 17443, 31, 20650, 107172, 32354, 20625, 142508, 23, 1556, 163, 432, 47691, 11809, 5, 571, 14481, 62163, 35839, 4552, 27983, 66456, 43077, 20028, 4734, 98, 1672, 199823, 81604, 142424, 37202, 40881, 25469, 831, 26366, 3642, 111, 10, 5570, 61...

[ 0.171142578125, 0.153564453125, 0.138671875, 0.266357421875, 0.2208251953125, 0.1658935546875, 0.262939453125, 0.021087646484375, 0.1527099609375, 0.1534423828125, 0.1875, 0.1280517578125, 0.1075439453125, 0.00469970703125, 0.1033935546875, 0.151611328125, 0.0283203125, 0.159179687...

embed

24404844_c0

24404844

haskell

0

Title: Haskell - Instance Declaration on hMatrix Problem title: Haskell - Instance Declaration on hMatrix Tags: haskell, hmatrix Problem: Haskell - Instance Declaration on hMatrix I'm using the function fromBlocks from hMatrix over a list whose elements are determined by functions of type Int -> Int -> Int -> Matrix In...

Haskell - Instance Declaration on hMatrix Haskell - Instance Declaration on hMatrix haskell hmatrix a Haskell Instance Declaration Matrix Element Possible Haskell - Instance Declaration on hMatrix I'm using the function fromBlocks from hMatrix over a list whose elements are determined by functions of type Int -> Int ->...

[ -0.0033111572265625, 0.01263427734375, 0.00860595703125, -0.006988525390625, 0.000461578369140625, 0.00958251953125, 0.0093994140625, 0.00052642822265625, 0.00360107421875, -0.0179443359375, -0.0157470703125, -0.03271484375, -0.003875732421875, -0.0194091796875, -0.0322265625, -0.00236...

[ 20625, 142508, 360, 116071, 98501, 1363, 98, 1096, 4613, 87427, 20, 1556, 192, 10, 194234, 48325, 115861, 2661, 17368, 70, 32354, 1295, 166191, 645, 5303, 80854, 83324, 10644, 18, 527, 73265, 186992, 14192, 111, 16750, 903, 181135, 678, 198...

[ 0.1646728515625, 0.2626953125, 0.122314453125, 0.204833984375, 0.2452392578125, 0.034912109375, 0.0909423828125, 0.145263671875, 0.111083984375, 0.1654052734375, 0.019012451171875, 0.14453125, 0.095458984375, 0.018402099609375, 0.22119140625, 0.138916015625, 0.07611083984375, 0.005...

embed

37668314_c0

37668314

haskell

0

Title: Get user from database using session value (Haskell - Yesod) Problem title: Get user from database using session value (Haskell - Yesod) Tags: yesod, haskell, session, authentication Problem: Get user from database using session value (Haskell - Yesod) I want to get User information from database using session v...

Get user from database using session value (Haskell - Yesod) Get user from database using session value (Haskell - Yesod) yesod haskell session authentication database session Get Haskell Yesod Handler Html get404 _ID profile.hamlet UserId Get user from database using session value (Haskell - Yesod) I want to get User ...

[ -0.000797271728515625, -0.0047607421875, 0.0040283203125, -0.0186767578125, -0.01318359375, 0.018310546875, 0.000606536865234375, -0.00970458984375, 0.00946044921875, -0.07666015625, 0.00015926361083984375, 0.0169677734375, -0.0164794921875, -0.0186767578125, 0.021484375, -0.0054626464...

[ 20779, 38937, 1295, 63399, 17368, 56002, 34292, 6495, 7, 142508, 32635, 2199, 2422, 23722, 1556, 195734, 20625, 10639, 603, 7237, 2046, 2839, 617, 7146, 60641, 3915, 1974, 53400, 568, 71, 3444, 4677, 64457, 26824, 36836, 903, 175399, 2071, ...

[ 0.11474609375, 0.2025146484375, 0.1591796875, 0.195556640625, 0.064453125, 0.1885986328125, 0.1927490234375, 0.071044921875, 0.04571533203125, 0.209228515625, 0.1234130859375, 0.2152099609375, 0.084228515625, 0.1802978515625, 0.07757568359375, 0.09136962890625, 0.0816650390625, 0.0...

embed

29241477_c0

29241477

haskell

0

Title: Margin of a Haskell diagrams SVG file Problem title: Margin of a Haskell diagrams SVG file Tags: graphics, haskell-diagrams, haskell Problem: Margin of a Haskell diagrams SVG file I am trying this diagrams example: funs = map (flip (^)) [2..6] visualize f = stroke' (with & vertexNames .~ [[0 .. 6 :: Int]] ) (reg...

Margin of a Haskell diagrams SVG file Margin of a Haskell diagrams SVG file graphics haskell-diagrams haskell Margin Haskell SVG Local StarFun Margin of a Haskell diagrams SVG file I am trying this diagrams example: And here is the result: Everything appears as expected that some of the numbers (or more precisely, the ...

[ 0.014404296875, 0.0145263671875, -0.003631591796875, 0.00579833984375, -0.009765625, 0.0106201171875, 0.0037689208984375, 0.012939453125, 0.007598876953125, -0.00823974609375, -0.006103515625, 0.017822265625, 0.00360107421875, -0.0025634765625, 0.017578125, -0.002288818359375, 0.0087...

[ 33346, 73, 111, 20625, 142508, 117233, 159, 79855, 11435, 10, 48461, 1556, 3390, 25561, 24172, 4612, 97249, 31577, 903, 27781, 3688, 16750, 171581, 135179, 237, 84751, 3060, 101935, 134995, 27585, 6097, 3687, 43573, 121303, 29569, 3564, 6713, ...

[ 0.208740234375, 0.1427001953125, 0.103271484375, 0.1337890625, 0.26025390625, 0.2105712890625, 0.0322265625, 0.2169189453125, 0.119140625, 0.013702392578125, 0.0848388671875, 0.1265869140625, 0.06329345703125, 0.1187744140625, 0.0728759765625, 0.0880126953125, 0.1829833984375, 0.11...

embed

46168176_c0

46168176

haskell

0

Title: Using map and filter function Problem title: Using map and filter function Tags: haskell Problem: Using map and filter function I can't figure out how to implement the map and filter function for a matrix. Does anyone have any suggestions that would satisfy these tests? -- | Matrix Tests -- -- prop> mapMatrix (\...

Using map and filter function Using map and filter function haskell Using Matrix Tests matrix1 matrix2 Bool Using map and filter function I can't figure out how to implement the map and filter function for a matrix. Does anyone have any suggestions that would satisfy these tests?

[ 0.006622314453125, 0.0087890625, 0.0087890625, -0.01397705078125, 0.0093994140625, -0.01220703125, -0.01263427734375, 0.0020599365234375, -0.006500244140625, -0.00093841552734375, 0.001251220703125, 0.004180908203125, -0.0142822265625, 0.0035400390625, -0.025390625, -0.002227783203125,...

[ 345, 6953, 22288, 136, 46312, 32354, 1556, 142508, 194234, 8647, 50944, 425, 418, 304, 2460, 929, 87, 831, 18, 26366, 1810, 3642, 47, 29479, 100, 35672, 157666, 40407, 6097, 109921 ]

[ 0.1275634765625, 0.06689453125, 0.233642578125, 0.1663818359375, 0.278076171875, 0.2056884765625, 0.1378173828125, 0.2315673828125, 0.20556640625, 0.2083740234375, 0.2041015625, 0.144287109375, 0.038238525390625, 0.060791015625, 0.0986328125, 0.174072265625, 0.0098724365234375, 0.0...

embed

9664660_c0

9664660

haskell

0

Title: What does this combinator do: s (s k) Problem title: What does this combinator do: s (s k) Tags: lambda, combinators, lambda-calculus, combinatory-logic, haskell Problem: What does this combinator do: s (s k) I now understand the type signature of s (s k) : s (s k) :: ((t1 -> t2) -> t1) -> (t1 -> t2) -> t1 And I...

What does this combinator do: s (s k) What does this combinator do: s (s k) lambda combinators lambda-calculus combinatory-logic haskell What What does this combinator do: s (s k) I now understand the type signature of s (s k) : And I can create examples that work without error in the Haskell WinGHCi tool: Example : re...

[ -0.001617431640625, 0.016845703125, 0.0028076171875, 0.0016632080078125, 0.0019073486328125, -0.00012493133544921875, 0.004425048828125, -0.002197265625, 0.00186920166015625, 0.0091552734375, 0.0036773681640625, -0.01385498046875, -0.0040283203125, 0.0096435546875, -0.00921630859375, 0...

[ 4865, 14602, 903, 22321, 1290, 54, 91, 15, 7, 472, 21, 6492, 85, 22230, 6827, 94739, 31667, 137043, 1556, 142508, 28219, 10644, 138256, 28282, 27781, 4488, 15490, 18499, 20625, 17686, 41877, 40658, 55516, 89536, 30646, 116, 201, 39457, 42, ...

[ 0.087890625, 0.10650634765625, 0.10614013671875, 0.2432861328125, 0.1925048828125, 0.12939453125, 0.2080078125, 0.040557861328125, 0.1468505859375, 0.241943359375, 0.03118896484375, 0.1524658203125, 0.125732421875, 0.0982666015625, 0.06060791015625, 0.0999755859375, 0.063232421875, ...

embed

66636009_c0

66636009

haskell

0

Title: Factorial function returning negative number for large input Problem title: Factorial function returning negative number for large input Tags: haskell Problem: Factorial function returning negative number for large input My factorial function seems to work for numbers between 1 and 6, but not for numbers much bi...

Factorial function returning negative number for large input Factorial function returning negative number for large input haskell Factorial Factorial function returning negative number for large input My factorial function seems to work for numbers between 1 and 6, but not for numbers much bigger than 6, for example st...

[ 0.007293701171875, -0.0130615234375, -0.00341796875, -0.01507568359375, 0.01263427734375, -0.0030975341796875, 0.0020904541015625, 0.000797271728515625, -0.00885009765625, 0.01611328125, 0.0098876953125, -0.0247802734375, -0.01495361328125, 0.01019287109375, 0.01116943359375, -0.004119...

[ 117969, 15403, 32354, 30646, 40907, 14012, 100, 21334, 107730, 1556, 142508, 2646, 31461, 37202, 4488, 101935, 17721, 106, 136, 305, 1284, 959, 5045, 167785, 3501, 27781, 72134, 678, 952, 38, 50339, 621, 53418, 26366, 15400, 11853, 759, 3688,...

[ 0.246337890625, 0.1964111328125, 0.21435546875, 0.1715087890625, 0.2646484375, 0.1817626953125, 0.06884765625, 0.15283203125, 0.2281494140625, 0.1512451171875, 0.2381591796875, 0.007415771484375, 0.22998046875, 0.045440673828125, 0.1395263671875, 0.1546630859375, 0.0782470703125, 0...

embed

68951481_c1

68951481

haskell

1

to duplicate information putting starting symbol information in both the StaticParser and DynamicParser . Another issue is that almost all parsers will have the potential to throw which means we will have to spend a lot of time inside Maybe or Either creating what is essentially the "monads do not compose problem." Th...

[ -0.005218505859375, 0.01116943359375, 0.0157470703125, 0.010009765625, -0.01446533203125, 0.01141357421875, -0.0186767578125, -0.0172119140625, -0.004913330078125, -0.0205078125, -0.004913330078125, -0.0025634765625, 0.004241943359375, -0.002105712890625, 0.00299072265625, 0.0147705078...

[ 47, 171763, 67, 4677, 118620, 72134, 26582, 71465, 238, 28636, 2189, 136, 73327, 21068, 116267, 31089, 39555, 756, 366, 7, 1314, 1221, 765, 38516, 104250, 47445, 5915, 1733, 46132, 83425, 707, 4565, 9319, 105233, 85590, 87039, 6468, 54, 959...

[ 0.1131591796875, 0.2418212890625, 0.1591796875, 0.19921875, 0.0350341796875, 0.1641845703125, 0.2115478515625, 0.2076416015625, 0.09765625, 0.214111328125, 0.234375, 0.0262451171875, 0.167236328125, 0.1329345703125, 0.01995849609375, 0.1275634765625, 0.038848876953125, 0.068359375,...

embed

69244454_c0

69244454

haskell

0

Title: How can I define a function of type Integral a => a? Problem title: How can I define a function of type Integral a => a? Tags: haskell Problem: How can I define a function of type Integral a => a? We've just started learning Haskell at uni, and in one of my homework problems, we have to define a function f...

How can I define a function of type Integral a => a? How can I define a function of type Integral a => a? haskell How Integral Num How can I define a function of type Integral a => a? We've just started learning Haskell at uni, and in one of my homework problems, we have to define a function for this type signatu...

[ -0.01055908203125, -0.01953125, 0.00457763671875, 0.00225830078125, 0.006744384765625, -0.004913330078125, 0.0020904541015625, -0.01007080078125, -0.0013580322265625, -0.0198974609375, -0.0010223388671875, -0.019287109375, -0.002838134765625, 0.0184326171875, 0.0184326171875, -0.018310...

[ 11249, 831, 87, 61924, 32354, 10644, 204681, 10, 2203, 1230, 5386, 111, 1556, 142508, 52782, 44357, 52080, 20625, 19844, 5368, 18244, 44402, 903, 138256, 62822, 678, 2811, 136, 18221, 1001, 997, 20, 661, 5809, 33022, 3493, 4488, 8622, 110, ...

[ 0.0863037109375, 0.0732421875, 0.05224609375, 0.2379150390625, 0.2197265625, 0.1767578125, 0.2705078125, 0.1397705078125, 0.09228515625, 0.066650390625, 0.1663818359375, 0.03955078125, 0.1068115234375, 0.2052001953125, 0.21240234375, 0.122802734375, 0.027679443359375, 0.08551025390...

embed

11529932_c0

11529932

haskell

0

Title: How does setPosition work? Problem title: How does setPosition work? Tags: haskell, parsec Problem: How does setPosition work? I am unsure on how to use setPosition (Parsec library). Here is an extremely simple piece of code which should read the first 3 characters of the second line of a text. import Text.Parse...

How does setPosition work? How does setPosition work? haskell parsec Text.ParserCombinators.Parsec How How does setPosition work? I am unsure on how to use setPosition (Parsec library). Here is an extremely simple piece of code which should read the first 3 characters of the second line of a text. Still, the output is ...

[ -0.006256103515625, 0.01031494140625, 0.0179443359375, 0.052734375, -0.000885009765625, 0.018798828125, -0.00433349609375, -0.00714111328125, 0.0091552734375, -0.00004839897155761719, -0.0004024505615234375, 0.0203857421875, 0.0081787109375, -0.0074462890625, -0.010986328125, 0.0066223...

[ 11249, 14602, 5423, 7192, 172, 1363, 4488, 1556, 142508, 366, 39797, 24129, 28636, 2189, 19155, 22230, 51646, 3642, 4527, 35773, 1294, 111531, 8781, 18151, 5608, 12301, 5117, 138, 124850, 17932, 13315, 7986, 140992, 117177, 959, 2940, 12319, ...

[ 0.1043701171875, 0.1085205078125, 0.232177734375, 0.1943359375, 0.1910400390625, 0.16748046875, 0.153564453125, 0.09814453125, 0.18798828125, 0.055419921875, 0.175537109375, 0.0916748046875, 0.1019287109375, 0.037445068359375, 0.1278076171875, 0.057464599609375, 0.0252532958984375, ...

embed

34698377_c0

34698377

haskell

0

Title: Can Stack make sure that dependencies aren't tampered with? Problem title: Can Stack make sure that dependencies aren't tampered with? Tags: security, hackage, haskell-stack, haskell Problem: Can Stack make sure that dependencies aren't tampered with? One problem with Cabal is that it pulls packages fr...

Can Stack make sure that dependencies aren't tampered with? Can Stack make sure that dependencies aren't tampered with? security hackage haskell-stack haskell Can Stack Can Stack make sure that dependencies aren't tampered with? One problem with Cabal is that it pulls packages from Hackage, and as it's been d...

[ -0.00860595703125, 0.01458740234375, 0.0189208984375, 0.017333984375, -0.004974365234375, 0.00836181640625, -0.0047607421875, 0.0179443359375, 0.007568359375, 0.007110595703125, -0.0093994140625, 0.0031585693359375, 0.0194091796875, 0.048828125, -0.0081787109375, 0.00836181640625, -0...

[ 4171, 6512, 2594, 3249, 9077, 42548, 117538, 125381, 18, 190745, 71, 678, 3768, 48031, 85526, 4588, 1556, 142508, 590, 2967, 30438, 289, 50065, 98169, 1295, 52922, 5941, 48322, 3642, 63847, 8137, 60744, 18151, 831, 2046, 23, 52295, 170944, ...

[ 0.0821533203125, 0.2197265625, 0.207275390625, 0.0777587890625, 0.151123046875, 0.256591796875, 0.1807861328125, 0.043975830078125, 0.1109619140625, 0.2271728515625, 0.1165771484375, 0.142822265625, 0.002197265625, 0.156005859375, 0.1768798828125, 0.199462890625, 0.1474609375, 0.19...

embed

3957192_c0

3957192

haskell

0

Title: RankNTypes for instance declarations? Problem title: RankNTypes for instance declarations? Tags: types, type-systems, haskell, higher-rank-types Problem: RankNTypes for instance declarations? I've been playing around with RankNTypes recently and wonder if it is possible to use them in instance declarations. Here...

RankNTypes for instance declarations? RankNTypes for instance declarations? types type-systems haskell higher-rank-types RankNTypes Expr Add Show Evaluation RankNTypes for instance declarations? I've been playing around with RankNTypes recently and wonder if it is possible to use them in instance declarations. Here is ...

[ 0.004241943359375, 0.00103759765625, 0.000782012939453125, -0.00885009765625, -0.00787353515625, 0.0019378662109375, -0.0001354217529296875, -0.024658203125, -0.006744384765625, -0.03369140625, 0.00189208984375, -0.0284423828125, 0.01104736328125, -0.01708984375, -0.00179290771484375, ...

[ 134405, 839, 196707, 7, 100, 110527, 21635, 5256, 52895, 10644, 16751, 1556, 142508, 77546, 36467, 50986, 60075, 42, 29117, 17367, 151228, 75169, 10932, 32195, 7722, 4527, 23, 8781, 27781, 9803, 2053, 33022, 2816, 4288, 27494, 10, 876, 3444, ...

[ 0.2186279296875, 0.142333984375, 0.2822265625, 0.0419921875, 0.037322998046875, 0.2349853515625, 0.1783447265625, 0.043365478515625, 0.1986083984375, 0.1534423828125, 0.1143798828125, 0.0726318359375, 0.176513671875, 0.04315185546875, 0.1552734375, 0.2052001953125, 0.042755126953125,...

embed

51530084_c0

51530084

haskell

0

Title: Getting stack to build only haddock docs and not the library/executable Problem title: Getting stack to build only haddock docs and not the library/executable Tags: haskell-stack, haskell, haddock Problem: Getting stack to build only haddock docs and not the library/executable Following up from How to exclude de...

Getting stack to build only haddock docs and not the library/executable Getting stack to build only haddock docs and not the library/executable haskell-stack haskell haddock Getting Getting stack to build only haddock docs and not the library/executable Following up from How to exclude dependencies when building haddoc...

[ -0.01806640625, 0.017578125, -0.0146484375, -0.006927490234375, -0.006317138671875, 0.025146484375, -0.022216796875, -0.002471923828125, 0.01806640625, -0.020751953125, 0.004425048828125, -0.01953125, 0.007720947265625, 0.01446533203125, 0.0245361328125, 0.001678466796875, 0.00129699...

[ 210732, 177261, 47, 45367, 4734, 1902, 138414, 54, 4439, 959, 35773, 46480, 1010, 22819, 1556, 142508, 590, 2594, 39041, 42548, 117538, 33976, 7, 179933, 40956, 75101, 157, 8408, 112, 6423, 1467, 22584, 175254, 1294, 88303, 28129, 4034, 9433,...

[ 0.09124755859375, 0.2493896484375, 0.0220184326171875, 0.15869140625, 0.10467529296875, 0.1602783203125, 0.249267578125, 0.108642578125, 0.091064453125, 0.077880859375, 0.144775390625, 0.072998046875, 0.12548828125, 0.134033203125, 0.0826416015625, 0.1593017578125, 0.1195068359375, ...

embed

54034145_c0

54034145

haskell

0

Title: Pattern syntax in expression Problem title: Pattern syntax in expression Tags: monads, haskell Problem: Pattern syntax in expression I am wondering why am i getting this error since i have not used any pattern.In my case i have not pattern matched on the filterM 's lambda . Error Pattern syntax in expression con...

Pattern syntax in expression Pattern syntax in expression monads haskell System.Directory Control.Monad Pattern Fil getFiles::FilePath Pattern syntax in expression I am wondering why am i getting this error since i have not used any pattern.In my case i have not pattern matched on the filterM 's lambda . Error I just w...

[ -0.000667572021484375, 0.00921630859375, -0.025146484375, -0.01275634765625, -0.007415771484375, 0.011474609375, 0.01470947265625, -0.01116943359375, -0.00035858154296875, -0.014892578125, -0.000782012939453125, 0.0018310546875, -0.00811767578125, 0.001617431640625, 0.0032501220703125, ...

[ 9876, 22766, 6002, 86531, 23, 125195, 2667, 712, 1556, 142508, 12353, 184911, 27131, 46674, 24158, 2046, 174350, 683, 10519, 149016, 15400, 903, 18499, 765, 959, 11814, 2499, 103510, 14858, 46312, 594, 6492, 85, 212059, 3444, 102158, 14364, 2...

[ 0.22314453125, 0.193603515625, 0.1566162109375, 0.1932373046875, 0.047882080078125, 0.258544921875, 0.0841064453125, 0.123779296875, 0.06976318359375, 0.1846923828125, 0.0257110595703125, 0.0081787109375, 0.08203125, 0.0723876953125, 0.07867431640625, 0.022247314453125, 0.12329101562...

embed

21506748_c1

21506748

haskell

1

v True >> readIORef v always return True ? In the maybePrint case (from the IORef docs) would a readIORef myRef (along with maybe a seq or something) before readIORef yourRef have forced a barrier to reordering? What's the straightforward mental model I should have? Is it something like: within and from the point of v...

[ 0.0002880096435546875, 0.015869140625, 0.0047607421875, 0.01177978515625, 0.010498046875, 0.01116943359375, -0.004150390625, 0.0062255859375, -0.00408935546875, 0.0006103515625, 0.022705078125, -0.0013427734375, -0.0027008056640625, 0.02099609375, 0, -0.00042724609375, -0.01831054687...

[ 81, 87599, 12301, 123435, 4240, 11343, 30646, 51139, 112079, 18, 7225, 759, 190015, 40, 864, 8108, 935, 168861, 125861, 456, 80596, 80560, 13893, 3299, 5608, 28032, 6275, 21455, 11651, 86997, 12989, 214, 41018, 108975, 57, 86, 243228, 9969, ...

[ 0.2059326171875, 0.194091796875, 0.17431640625, 0.18115234375, 0.268798828125, 0.1241455078125, 0.1749267578125, 0.1690673828125, 0.1524658203125, 0.0169525146484375, 0.004638671875, 0.1097412109375, 0.25244140625, 0.042388916015625, 0.08624267578125, 0.047088623046875, 0.046875, 0...

embed

22027025_c0

22027025

haskell

0

Title: Calling a Haskell function from Ruby on Heroku Problem title: Calling a Haskell function from Ruby on Heroku Tags: haskell, ruby, heroku Problem: Calling a Haskell function from Ruby on Heroku So I'd like to call a Haskell function from a Ruby app running on Heroku. I'm aware of Hubris , but it seems unlikely to...

Calling a Haskell function from Ruby on Heroku Calling a Haskell function from Ruby on Heroku haskell ruby heroku Ruby Calling Haskell Heroku Calling a Haskell function from Ruby on Heroku So I'd like to call a Haskell function from a Ruby app running on Heroku. I'm aware of Hubris , but it seems unlikely to work in th...

[ 0.00008249282836914062, 0.02197265625, -0.00244140625, 0.000102996826171875, -0.0003299713134765625, 0.01104736328125, 0.001129150390625, -0.0194091796875, -0.0068359375, -0.051025390625, -0.0087890625, -0.0201416015625, 0.006256103515625, 0.0181884765625, 0.01025390625, -0.01361083984...

[ 26265, 214, 20625, 142508, 32354, 1295, 158189, 98, 56889, 319, 1556, 21922, 53, 40814, 1884, 11782, 4027, 51042, 107419, 53465, 3679, 4488, 19096, 11728, 47644, 191082, 96760, 18151, 47, 110, 55516, 1632, 51876, 147306, 188, 1542, 990, 26951...

[ 0.16845703125, 0.039764404296875, 0.1607666015625, 0.291015625, 0.19970703125, 0.12353515625, 0.26220703125, 0.09356689453125, 0.2008056640625, 0.1920166015625, 0.11767578125, 0.120849609375, 0.09637451171875, 0.1407470703125, 0.029998779296875, 0.1741943359375, 0.1490478515625, 0....

embed

45787011_c0

45787011

haskell

0

Title: Is getLine lazy? Problem title: Is getLine lazy? Tags: processing-efficiency, haskell, io, lazy-evaluation Problem: Is getLine lazy? Is getLine lazy? Say I have a very long line on the input. It's just a sequence of numbers. I only need to sum 3 first numbers. Will getLine be efficient and read only the first pa...

Is getLine lazy? Is getLine lazy? processing-efficiency haskell io lazy-evaluation Control.Applicative Is getLine lazy? Is getLine lazy? Say I have a very long line on the input. It's just a sequence of numbers. I only need to sum 3 first numbers. Will getLine be efficient and read only the first part of the line, or d...

[ -0.0157470703125, -0.0050048828125, 0.017578125, 0.014892578125, -0.005828857421875, 0.016357421875, 0.02734375, -0.0033416748046875, 0.0189208984375, -0.033447265625, 0.002532958984375, -0.0008392333984375, -0.0093994140625, -0.00074005126953125, -0.002685546875, 0.017578125, 0.0040...

[ 2071, 2046, 93232, 21, 3285, 9433, 11044, 1556, 142508, 22995, 159258, 27131, 11048, 4552, 4989, 13315, 107730, 944, 101935, 3871, 10554, 138, 5117, 93766, 12301, 2831, 28282, 10002, 32354, 16454, 124850, 1632, 208124, 645, 31251, 390 ]

[ 0.0635986328125, 0.169189453125, 0.280517578125, 0.1634521484375, 0.2083740234375, 0.0435791015625, 0.0479736328125, 0.1119384765625, 0.2171630859375, 0.161865234375, 0.1099853515625, 0.1470947265625, 0.024566650390625, 0.0147857666015625, 0.1026611328125, 0.1788330078125, 0.10913085...

embed

30718440_c2

30718440

haskell

2

5, tagsoup, text, scalpel, containers, network-uri, monad-loops, wreq, lens, bytestring, parsec, utf8-string, tagsoup, xml, feed, regex-pcre, aeson, network, wai, wai-extra, wai-cors, wai-middleware-static, warp, servant-server >= 0.4, rethinkdb >= 1.16, transformers, either, unordered-containers, mtl, http-types, safe...

[ 0.000247955322265625, 0.019775390625, 0.00994873046875, 0.00933837890625, -0.005706787109375, -0.00823974609375, -0.0103759765625, 0.01361083984375, -0.0019073486328125, 0.003936767578125, 0.00958251953125, -0.007293701171875, -0.01007080078125, 0.0084228515625, 0.002899169921875, 0.01...

[ 190, 4, 69141, 31, 2037, 7986, 117906, 5310, 116419, 7, 33120, 1162, 2667, 712, 28354, 107, 864, 3098, 390, 67, 91693, 39797, 420, 1019, 131492, 61590, 6835, 3355, 7612, 90, 191, 259, 14, 112779, 10517, 22000, 19298, 15876, 201939, 1631, ...

[ 0.2105712890625, 0.052581787109375, 0.171142578125, 0.0965576171875, 0.206787109375, 0.1820068359375, 0.05255126953125, 0.2034912109375, 0.2125244140625, 0.06390380859375, 0.1466064453125, 0.11474609375, 0.0941162109375, 0.127197265625, 0.1572265625, 0.1190185546875, 0.063232421875, ...

embed

59345398_c1

59345398

haskell

1

what type give to the evaluation function, as when state-annotated types are involved I think evaluation should be formulated as having a type close to the following: evalM :: Codensity AST (a := j) i -> Codensity ((->) St) (a := j) i where St allows us to keep track of state at the value-level, so that the right-hand...

[ -0.017578125, -0.0014190673828125, -0.003265380859375, 0.0010223388671875, 0.0091552734375, -0.020263671875, -0.00909423828125, -0.0191650390625, 0.0019073486328125, -0.02587890625, -0.01068115234375, 0.0103759765625, -0.0023040771484375, 0.008544921875, 0.005035400390625, -0.010253906...

[ 10644, 8337, 47, 219836, 32354, 11341, 11071, 102, 52895, 75412, 5351, 5608, 26168, 3674, 237, 19441, 20903, 25632, 28, 1405, 594, 1311, 34609, 2481, 48963, 11, 1647, 17, 33079, 2907, 114864, 13695, 28560, 34292, 67919, 7108, 12336, 5609, 6...

[ 0.2196044921875, 0.093505859375, 0.06365966796875, 0.294677734375, 0.1461181640625, 0.1043701171875, 0.1129150390625, 0.035400390625, 0.179931640625, 0.04962158203125, 0.072998046875, 0.0677490234375, 0.16650390625, 0.07025146484375, 0.051177978515625, 0.058868408203125, 0.1496582031...

embed

9965716_c0

9965716

haskell

0

Title: How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? Problem title: How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? Tags: vector, ghc, haskell, unboxing Problem: How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? I want to use the vector p...

How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? How to provide a Data.Vector.Unbox instance for StablePtr's in Haskell? vector ghc haskell unboxing How Data.Vector.Unbox StablePtr Haskell ptr2Int Ptr addr2Int int2Addr Unbox How to provide a Data.Vector.Unbox instance for StablePtr's in...

[ 0.0128173828125, 0.02783203125, 0.01019287109375, -0.010498046875, 0.002227783203125, 0.005462646484375, -0.0233154296875, -0.0225830078125, 0.00347900390625, -0.0220947265625, -0.00897216796875, -0.0245361328125, -0.01611328125, 0.03125, 0, 0.012939453125, 0.00145721435546875, 0.0...

[ 11249, 47, 22691, 11809, 26455, 18770, 14256, 11728, 110527, 100, 159, 22819, 683, 4448, 3768, 20625, 142508, 173, 31380, 238, 1556, 51, 27037, 42, 304, 4153, 436, 18, 7569, 992, 23, 3444, 4527, 98169, 4343, 10298, 4778, 25632, 143834, 15...

[ 0.0693359375, 0.0167388916015625, 0.122802734375, 0.1378173828125, 0.186279296875, 0.1953125, 0.12841796875, 0.2451171875, 0.2415771484375, 0.0091552734375, 0.0389404296875, 0.2117919921875, 0.085693359375, 0.214599609375, 0.0994873046875, 0.1392822265625, 0.2486572265625, 0.158691...

embed

61789891_c1

61789891

haskell

1

them. I am so lost now on how to even start and I'm more so looking for hints rather than have the code written out so I can learn. I know I need a case of x but should I use foldl? an accumulator? and what would that look like as accumulators still confuse me EDIT** I've tried with List Comprehension but I'm not sure...

[ -0.0167236328125, 0.00927734375, -0.001800537109375, -0.00006246566772460938, 0.00213623046875, 0.01275634765625, -0.000885009765625, 0.0111083984375, -0.0029296875, 0.00244140625, 0.0179443359375, -0.023193359375, 0.00921630859375, 0.0157470703125, -0.01611328125, 0.003753662109375, ...

[ 2856, 5, 444, 221, 72856, 5036, 3642, 47, 3853, 4034, 1286, 16487, 5122, 18151, 30698, 3714, 3871, 10, 7225, 111, 1022, 5608, 4527, 18344, 20469, 183278, 1290, 6713, 22230, 55681, 37842, 678, 32036, 142158, 3220, 6889, 9077, 70163, 756, 1...

[ 0.173095703125, 0.0203094482421875, 0.03240966796875, 0.06878662109375, 0.115478515625, 0.04949951171875, 0.05450439453125, 0.008636474609375, 0.0208740234375, 0.0780029296875, 0.0148773193359375, 0.01641845703125, 0.077392578125, 0.173095703125, 0.0880126953125, 0.040679931640625, 0...

embed

35999706_c0

35999706

haskell

0

Title: Do typing judgements have a kind? Problem title: Do typing judgements have a kind? Tags: haskell, polymorphism, type-kinds, dependent-type, types Problem: Do typing judgements have a kind? In Richard Eisenberg's talk on his work with levity polymorphism for dependent Haskell, he clearly shows that this judgement...

Do typing judgements have a kind? Do typing judgements have a kind? haskell polymorphism type-kinds dependent-type types Star Do typing judgements have a kind? In Richard Eisenberg's talk on his work with levity polymorphism for dependent Haskell, he clearly shows that this judgement / type is sound: Does this mean tha...

[ 0.00836181640625, -0.0052490234375, 0.002410888671875, -0.0140380859375, 0.01336669921875, -0.005615234375, -0.0025482177734375, -0.01531982421875, 0.00390625, -0.0194091796875, -0.0021209716796875, -0.0166015625, -0.0022125244140625, -0.0068359375, -0.019287109375, -0.00457763671875, ...

[ 11417, 214, 116983, 9035, 765, 10, 8562, 1556, 142508, 35874, 178851, 10644, 68347, 108750, 50986, 52895, 4612, 984, 22758, 138745, 4969, 22120, 37498, 939, 20625, 123019, 45831, 903, 674, 83, 45730, 29459, 61261, 661, 1286, 110677, 176377, 1...

[ 0.2044677734375, 0.1082763671875, 0.2247314453125, 0.12548828125, 0.0770263671875, 0.0872802734375, 0.238037109375, 0.0936279296875, 0.20703125, 0.13818359375, 0.1611328125, 0.219482421875, 0.1568603515625, 0.1492919921875, 0.1744384765625, 0.167724609375, 0.148193359375, 0.0162353...

embed

24343787_c0

24343787

haskell

0

Title: splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell Problem title: splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell Tags: haskell Problem: splitting a list of integers to 2 lists: one of positive ...

splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell splitting a list of integers to 2 lists: one of positive numbers and the other of negative numbers - haskell haskell splitting a list of integers to 2 lists: one of positive numbers and the other of negative num...

[ -0.0166015625, -0.01251220703125, -0.0030670166015625, -0.004241943359375, -0.02734375, 0.0230712890625, 0.00171661376953125, 0.01177978515625, 0.0002765655517578125, 0.023681640625, 0.0036773681640625, -0.0142822265625, 0.000606536865234375, 0.005340576171875, -0.00543212890625, 0.002...

[ 65450, 1916, 5303, 892, 26255, 47, 116, 111, 24491, 101935, 136, 3789, 40907, 1556, 142508, 11249, 831, 87, 81887, 7722, 54, 17932, 9790, 209303, 7464, 959, 20949, 26785, 16750, 11675, 4163 ]

[ 0.2158203125, 0.0560302734375, 0.2269287109375, 0.135498046875, 0.1295166015625, 0.11767578125, 0.159912109375, 0.05389404296875, 0.194580078125, 0.112060546875, 0.0166778564453125, 0.056365966796875, 0.193359375, 0.0919189453125, 0.180419921875, 0.033477783203125, 0.0546875, 0.016...

embed

29381484_c3

29381484

haskell

3

P30375, Gogo-A, Gorilla, MAVMAPRTLVLLLSGALALTQTWAGSHSMRYFSTSVSRPGRGEPRFIAVGYVDDTQFVRF, DSDAASQRMEPRAPWIEQEGPEYWDRNTRNVKAHSQTDRVDLGTLRGYYNQSEDGSHTIQ, RMYGCDVGSDGRFLRGYQQDAYDGKDYIALNEDLRSWTAADMAAEITKRKWEAAHFAEQL, RAYLEGTCVEWLRRHLENGKETLQRTDAPKTHMTHHAVSDHEAILRCWALSFYPAEITLT, WQRDGEDQTQDTELVETRPAGDGTFQKWAAVVVPSGQEQRYTCHVQ...

[ 0.004547119140625, 0.0233154296875, 0.00909423828125, -0.00543212890625, 0.001251220703125, -0.023681640625, 0.00909423828125, 0.0050048828125, 0.01007080078125, 0.036376953125, 0.0245361328125, 0.0050048828125, -0.0087890625, -0.003875732421875, -0.000591278076171875, -0.0046691894531...

[ 436, 1197, 85433, 4, 173529, 9, 284, 12035, 2298, 276, 27816, 105748, 20503, 32811, 23708, 19759, 88946, 23613, 12927, 34388, 36381, 12763, 47207, 38796, 49741, 11679, 17255, 22724, 24231, 919, 41869, 6538, 9713, 21290, 132191, 161357, 151149, ...

[ 0.198486328125, 0.271240234375, 0.345458984375, 0.1385498046875, 0.299560546875, 0.1915283203125, 0.222412109375, 0.2177734375, 0.263916015625, 0.082763671875, 0.17578125, 0.0799560546875, 0.0430908203125, 0.07025146484375, 0.0355224609375, 0.034332275390625, 0.06207275390625, 0.03...

embed

63420753_c0

63420753

haskell

0

Title: Implementing Applicative instance for dictionaries (Map, associated arrays) Problem title: Implementing Applicative instance for dictionaries (Map, associated arrays) Tags: data-structures, functional-programming, haskell, separation-of-concerns Problem: Implementing Applicative instance for dictionaries (Map, a...

Implementing Applicative instance for dictionaries (Map, associated arrays) Implementing Applicative instance for dictionaries (Map, associated arrays) data-structures functional-programming haskell separation-of-concerns Implementing Applicative Map Functor Implementing Applicative instance for dictionaries (Map, asso...

[ 0.014404296875, 0.0033416748046875, 0.00225830078125, 0.0126953125, -0.0029144287109375, 0.005950927734375, 0.015869140625, -0.0062255859375, 0.0164794921875, -0.00445556640625, 0.00145721435546875, -0.009765625, 0.000591278076171875, 0.02587890625, 0.005523681640625, -0.00009393692016...

[ 153941, 214, 5659, 11048, 4935, 110527, 100, 45, 10763, 11, 10484, 166179, 137272, 10298, 4778, 2053, 137656, 123309, 28966, 1556, 142508, 37451, 4390, 3443, 42719, 28670, 18770, 37202, 80560, 2472, 47, 29479, 7477, 37720, 291, 26783, 41018, ...

[ 0.2147216796875, 0.03143310546875, 0.1888427734375, 0.2261962890625, 0.197998046875, 0.268310546875, 0.0777587890625, 0.102294921875, 0.1424560546875, 0.110595703125, 0.0853271484375, 0.23583984375, 0.196044921875, 0.1153564453125, 0.0960693359375, 0.0762939453125, 0.09307861328125, ...

embed

14103667_c0

14103667

haskell

0

Title: How to draw on an X11 Drawable with Cairo in Haskell Problem title: How to draw on an X11 Drawable with Cairo in Haskell Tags: x11, surface, xlib, haskell, cairo Problem: How to draw on an X11 Drawable with Cairo in Haskell I recently made my first steps in X11 programming in Haskell and now I want to draw texts...

How to draw on an X11 Drawable with Cairo in Haskell How to draw on an X11 Drawable with Cairo in Haskell x11 surface xlib haskell cairo How X11 Drawable Cairo Haskell cairo_xlib_surface_create How to draw on an X11 Drawable with Cairo in Haskell I recently made my first steps in X11 programming in Haskell and now I wa...

[ 0.00927734375, 0.01300048828125, -0.0059814453125, 0.00506591796875, -0.007537841796875, 0.0011749267578125, 0.028076171875, -0.0059814453125, -0.00860595703125, -0.025146484375, 0.00860595703125, -0.0264892578125, 0.01251220703125, 0.00689697265625, -0.00179290771484375, 0.00207519531...

[ 11249, 79442, 98, 1193, 1662, 18186, 434, 2886, 678, 149109, 31, 20625, 142508, 1022, 71579, 5612, 1556, 78968, 425, 7102, 40404, 7612, 23, 98441, 56037, 7986, 17368, 683, 27803, 313, 57143, 28282, 2182, 137565, 1264, 32354, 132283, 3917, 1...

[ 0.049163818359375, 0.1923828125, 0.07244873046875, 0.114990234375, 0.1942138671875, 0.07171630859375, 0.0838623046875, 0.16455078125, 0.09332275390625, 0.203857421875, 0.1990966796875, 0.1026611328125, 0.1878662109375, 0.0186767578125, 0.1602783203125, 0.18798828125, 0.03823852539062...

embed

16576465_c0

16576465

haskell

0

Title: What does Tree(Int,Int) mean in haskell? Problem title: What does Tree(Int,Int) mean in haskell? Tags: tuples, tree, haskell Problem: What does Tree(Int,Int) mean in haskell? I am learning data structures in Haskell right now. I saw something like: Tree(Int,Int) Does that mean tuple of trees? I'm trying to write...

What does Tree(Int,Int) mean in haskell? What does Tree(Int,Int) mean in haskell? tuples tree haskell What Tree Leaf Node Show Integer What does Tree(Int,Int) mean in haskell? I am learning data structures in Haskell right now. I saw something like: Does that mean tuple of trees? I'm trying to write something like: But...

[ 0.01495361328125, 0.0203857421875, -0.0079345703125, 0.015380859375, 0.0159912109375, 0.024658203125, -0.02001953125, -0.0211181640625, 0.003997802734375, -0.030517578125, -0.0186767578125, -0.0211181640625, 0.0048828125, 0.00726318359375, -0.003814697265625, 0.0059814453125, 0.02697...

[ 4865, 14602, 101344, 132, 4153, 18, 4, 29459, 23, 1556, 142508, 370, 99726, 53201, 636, 2407, 438, 112, 17367, 44401, 2053, 45646, 20625, 24124, 450, 8705, 111, 1360, 90, 69427, 14858, 18499, 2046, 57888, 12638, 30646, 11001, 765 ]

[ 0.0570068359375, 0.044525146484375, 0.274658203125, 0.044830322265625, 0.10150146484375, 0.1317138671875, 0.039031982421875, 0.1248779296875, 0.048248291015625, 0.113037109375, 0.197509765625, 0.1004638671875, 0.159423828125, 0.1654052734375, 0.03997802734375, 0.1103515625, 0.0991821...

embed

47350937_c0

47350937

haskell

0

Title: type "name" = Int - is it worth declaring? Problem title: type "name" = Int - is it worth declaring? Tags: declaration, data-structures, haskell Problem: type "name" = Int - is it worth declaring? I have a function that returns the Price of a product, it currently looks like priceOfProduct:: ...

type "name" = Int - is it worth declaring? type "name" = Int - is it worth declaring? declaration data-structures haskell Price type "name" = Int - is it worth declaring? I have a function that returns the Price of a product, it currently looks like Is it worth declaring so that the function becomes...

[ 0.0247802734375, 0.006744384765625, -0.0020751953125, 0.020263671875, 0.0034637451171875, 0.015869140625, -0.005767822265625, 0.0018768310546875, 0.026611328125, 0.0107421875, 0.0074462890625, 0.0191650390625, -0.01202392578125, -0.001617431640625, 0.01409912109375, 0.0181884765625, ...

[ 10644, 11627, 2203, 360, 18, 83, 41965, 8, 18347, 2852, 21635, 1363, 2053, 137656, 1556, 142508, 48025, 442, 32354, 30646, 12996, 82424, 33342, 1884, 2071, 24209, 17569, 4527, 370, 99726, 933, 6713, 11522, 10002, 45646, 80234, 63559, 4127, ...

[ 0.1829833984375, 0.185791015625, 0.08251953125, 0.1351318359375, 0.16064453125, 0.048492431640625, 0.1488037109375, 0.116943359375, 0.1922607421875, 0.1282958984375, 0.197509765625, 0.00677490234375, 0.0826416015625, 0.150146484375, 0.07977294921875, 0.201904296875, 0.2044677734375, ...

embed

64946789_c0

64946789

haskell

0

Title: How to make a table that works in github markdown and hackage? Problem title: How to make a table that works in github markdown and hackage? Tags: hackage, haskell, markdown Problem: How to make a table that works in github markdown and hackage? It seems that both formats support tables, though they are complete...

How to make a table that works in github markdown and hackage? How to make a table that works in github markdown and hackage? hackage haskell markdown How How to make a table that works in github markdown and hackage? It seems that both formats support tables, though they are completely different formats. GitHub Markdo...

[ 0.007598876953125, 0.0030517578125, -0.004913330078125, -0.0155029296875, -0.0010223388671875, 0.00150299072265625, 0.00439453125, 0.0016326904296875, -0.007781982421875, -0.004913330078125, 0.002685546875, -0.034423828125, -0.008056640625, 0.00958251953125, -0.0208740234375, 0.0041198...

[ 11249, 47, 3249, 23180, 450, 43240, 23, 62270, 32102, 16188, 34695, 136, 85526, 4588, 10, 1556, 142508, 15044, 9384, 8060, 12921, 527, 217, 140505, 7880, 55720, 59725, 29191, 1614, 3509, 19097, 7722, 52922, 6392, 79298, 44116, 10776, 12301, ...

[ 0.06243896484375, 0.0166778564453125, 0.1427001953125, 0.2646484375, 0.0740966796875, 0.1622314453125, 0.0546875, 0.1502685546875, 0.2003173828125, 0.157958984375, 0.157470703125, 0.121826171875, 0.193359375, 0.1400146484375, 0.048492431640625, 0.10400390625, 0.1741943359375, 0.062...

embed

41103420_c0

41103420

haskell

0

Title: How to manipulate trees in Haskell Problem title: How to manipulate trees in Haskell Tags: haskell, tree, binary-tree, data-structures Problem: How to manipulate trees in Haskell I would like to write a function that, given an n will exactly add the amount of leaves without degenerating the tree. Something like ...

How to manipulate trees in Haskell How to manipulate trees in Haskell haskell tree binary-tree data-structures How Haskell SimpleT Show addTree::Int addTree2 How to manipulate trees in Haskell I would like to write a function that, given an n will exactly add the amount of leaves without degenerating the tree. Somethin...

[ 0.0189208984375, 0.012451171875, -0.01953125, -0.008544921875, 0.0172119140625, 0.01068115234375, -0.01483154296875, -0.02294921875, 0.00762939453125, -0.03515625, 0.0196533203125, -0.03564453125, 0.005096435546875, 0.0194091796875, 0.012939453125, 0.00823974609375, 0.02001953125, ...

[ 11249, 45258, 67, 1360, 90, 20625, 142508, 47, 23, 1556, 53201, 2394, 6635, 62600, 2053, 137656, 60552, 618, 17367, 15190, 62731, 18, 304, 1884, 33022, 32354, 34475, 653, 1221, 66161, 41170, 31358, 15490, 8, 48281, 903, 13, 61924, 237, 71...

[ 0.041290283203125, 0.236328125, 0.09124755859375, 0.220947265625, 0.09454345703125, 0.141357421875, 0.23779296875, 0.0235595703125, 0.047637939453125, 0.1236572265625, 0.181396484375, 0.0877685546875, 0.046600341796875, 0.177978515625, 0.047821044921875, 0.07843017578125, 0.101745605...

embed

44155749_c0

44155749

haskell

0

Title: Combinatorics in Erlang Problem title: Combinatorics in Erlang Tags: erlang, haskell Problem: Combinatorics in Erlang I want to find combinatorics of integer in Erlang, equivalent of this Haskell code: composition 0 = [[]] composition n = [x:rest | x <- [1..n], rest <- composition (n-x)] so far I tried this whic...

Combinatorics in Erlang Combinatorics in Erlang erlang haskell combinatorics Erlang x:rest lists:seq N-X combinatorics:comb combinatorics.erl Combinatorics in Erlang I want to find combinatorics of integer in Erlang, equivalent of this Haskell code: so far I tried this which It doesn't work: The code return This error:

[ -0.04541015625, 0.0206298828125, 0.01409912109375, 0.0084228515625, -0.0084228515625, 0.006011962890625, -0.0035400390625, 0.01214599609375, -0.0036468505859375, -0.032470703125, -0.00070953369140625, -0.002685546875, 0.036376953125, 0.00005316734313964844, -0.01263427734375, -0.001548...

[ 106935, 19, 13300, 4439, 1004, 3066, 72, 1556, 142508, 22321, 3826, 1022, 56644, 5303, 184, 864, 541, 9, 1542, 277, 275, 56, 141, 3444, 7413, 111, 892, 1505, 23, 183234, 20625, 18151, 2060, 37842, 1650, 22027, 18, 4488, 30646, 3293, 184...

[ 0.1727294921875, 0.10595703125, 0.1529541015625, 0.106201171875, 0.138671875, 0.28662109375, 0.056854248046875, 0.06103515625, 0.233642578125, 0.204345703125, 0.13671875, 0.04443359375, 0.1318359375, 0.121826171875, 0.0543212890625, 0.1612548828125, 0.034149169921875, 0.00521850585...

embed

64252010_c0

64252010

haskell

0

Title: Is there a way to compare Haskell and C functions via AutoBench? Problem title: Is there a way to compare Haskell and C functions via AutoBench? Tags: haskell, c, autobench, benchmarking Problem: Is there a way to compare Haskell and C functions via AutoBench? I am used to benchmark Haskell functions via AutoBen...

Is there a way to compare Haskell and C functions via AutoBench? Is there a way to compare Haskell and C functions via AutoBench? haskell c autobench benchmarking Haskell AutoBench Is there a way to compare Haskell and C functions via AutoBench? I am used to benchmark Haskell functions via AutoBench but I haven't found...

[ 0.0032196044921875, -0.022216796875, 0.0157470703125, -0.000820159912109375, -0.0023193359375, 0.00482177734375, 0.00543212890625, -0.00555419921875, -0.0157470703125, -0.0294189453125, -0.00970458984375, -0.0009765625, 0.005523681640625, 0.0034027099609375, 0.00494384765625, -0.030151...

[ 3917, 47, 69101, 20625, 142508, 136, 313, 32354, 1829, 4396, 45901, 206, 10, 1556, 501, 1809, 776, 240057, 214, 11814, 3004, 37397, 678, 442, 3871, 116, 61590, 96759, 18, 5303, 27983, 11675, 6032, 1733, 51, 4084, 75101, 64557, 44691, 2046...

[ 0.10546875, 0.038482666015625, 0.210205078125, 0.1063232421875, 0.2587890625, 0.10418701171875, 0.1787109375, 0.206298828125, 0.06671142578125, 0.1778564453125, 0.1966552734375, 0.14501953125, 0.00177001953125, 0.094970703125, 0.1304931640625, 0.1568603515625, 0.18408203125, 0.2239...

embed

16154592_c0

16154592

haskell

0

Title: Haskell: No instance for (Eq a) arising from a use of `==' Problem title: Haskell: No instance for (Eq a) arising from a use of `==' Tags: haskell Problem: Haskell: No instance for (Eq a) arising from a use of `==' isPalindrome :: [a] -> Bool isPalindrome xs = case xs of [] -> True [x] -> True a -> (la...

Haskell: No instance for (Eq a) arising from a use of `==' Haskell: No instance for (Eq a) arising from a use of `==' haskell a Haskell Bool Haskell: No instance for (Eq a) arising from a use of `==' results in Why is this error occurring?

[ -0.0031890869140625, 0.015869140625, -0.00148773193359375, 0.00653076171875, 0.004425048828125, 0.034912109375, 0.01300048828125, -0.0218505859375, -0.00005459785461425781, 0.0067138671875, 0.0120849609375, -0.021484375, 0.0027008056640625, -0.006317138671875, -0.00457763671875, -0.027...

[ 20625, 142508, 438, 110527, 100, 864, 10, 187, 72219, 1295, 4527, 69112, 425, 3768, 12, 1556, 2460, 929, 111, 50339, 44084, 83, 903, 18499, 74918, 2852 ]

[ 0.169921875, 0.2587890625, 0.159912109375, 0.25244140625, 0.1044921875, 0.168212890625, 0.1273193359375, 0.09686279296875, 0.0947265625, 0.081298828125, 0.140625, 0.28662109375, 0.000762939453125, 0.173095703125, 0.009857177734375, 0.1663818359375, 0.0931396484375, 0.1759033203125,...

embed

17447415_c0

17447415

haskell

0

Title: Saving the state of a random number generator in haskell Problem title: Saving the state of a random number generator in haskell Tags: haskell, random Problem: Saving the state of a random number generator in haskell I'm currently using the Crypto.Random and Crypto.Random.DRBG Haskell libraries for generating ra...

Saving the state of a random number generator in haskell Saving the state of a random number generator in haskell haskell random Saving Crypto.Random Crypto.Random.DRBG Show Saving the state of a random number generator in haskell I'm currently using the Crypto.Random and Crypto.Random.DRBG Haskell libraries for genera...

[ 0.000736236572265625, 0.0101318359375, 0.01055908203125, -0.0022430419921875, -0.005889892578125, 0.015869140625, 0.0020294189453125, -0.0230712890625, -0.00010538101196289062, -0.033935546875, -0.0057373046875, 0.0150146484375, 0.00885009765625, 0.030517578125, 0.0037078857421875, -0....

[ 947, 6496, 11341, 96759, 14012, 145823, 23, 1556, 142508, 111, 201543, 126525, 3815, 23498, 85556, 17367, 17368, 20625, 35773, 10484, 12663, 101935, 3871, 47, 4343, 2363, 117249, 3173, 11435, 124326, 3444, 21342, 5701, 6626, 103391, 139392, 129...

[ 0.153564453125, 0.0655517578125, 0.19189453125, 0.170166015625, 0.1229248046875, 0.2362060546875, 0.05328369140625, 0.1373291015625, 0.2218017578125, 0.02838134765625, 0.1490478515625, 0.10302734375, 0.160400390625, 0.058929443359375, 0.1497802734375, 0.2120361328125, 0.0351257324218...

embed

51015178_c0

51015178

haskell

0

Title: How to get rid of the black console window for a compiled Haskell GUI application Problem title: How to get rid of the black console window for a compiled Haskell GUI application Tags: gtk, glade, user-interface, haskell Problem: How to get rid of the black console window for a compiled Haskell GUI application I...

How to get rid of the black console window for a compiled Haskell GUI application How to get rid of the black console window for a compiled Haskell GUI application gtk glade user-interface haskell How Haskell GUI stack-1.7.1 ghc-8.2.2 glade-3.8 How to get rid of the black console window for a compiled Haskell GUI appli...

[ 0.005340576171875, 0.01708984375, 0.0133056640625, 0.0037994384765625, 0.007537841796875, 0.0115966796875, 0.000614166259765625, -0.00628662109375, -0.016357421875, -0.00653076171875, 0.01153564453125, -0.04345703125, -0.00531005859375, 0.006683349609375, 0.002105712890625, 0.003677368...

[ 11249, 2046, 31351, 111, 70, 22556, 130250, 76896, 100, 375, 5974, 20625, 142508, 195490, 38415, 31472, 116755, 38937, 10433, 1556, 177261, 165830, 31380, 238, 17376, 70147, 135527, 678, 1328, 20682, 3882, 14847, 11675, 71924, 2886, 10, 11343, ...

[ 0.053070068359375, 0.07867431640625, 0.165771484375, 0.09454345703125, 0.046356201171875, 0.2379150390625, 0.263427734375, 0.230712890625, 0.0301971435546875, 0.0745849609375, 0.14794921875, 0.1280517578125, 0.22705078125, 0.2159423828125, 0.1451416015625, 0.128173828125, 0.196289062...

embed

52693299_c0

52693299

haskell

0

Title: I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" Problem title: I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" Tags: recursion, pattern-matchin...

I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" I'm trying to redefine the product definition in haskell. I get an error saying "Non-exhaustive patterns in function" recursion pattern-matching haskell Non-exhaustive Inte...

[ -0.0361328125, 0.0233154296875, 0.0035247802734375, 0.007049560546875, -0.0084228515625, 0.000010788440704345703, -0.0269775390625, -0.000568389892578125, 0.0179443359375, -0.0113525390625, 0.0267333984375, 0.00775146484375, 0.00439453125, -0.0267333984375, 0.007598876953125, 0.0079345...

[ 3768, 31577, 15265, 64552, 12996, 80934, 1556, 142508, 18499, 59881, 3355, 18391, 4935, 103510, 7, 23, 32354, 54433, 195625, 98753, 3775, 44401, 1022, 12, 425, 1632, 22027, 18, 4488, 70, 72, 18304, 35064, 17368, 14858, 61353, 43240, 5885 ]

[ 0.042877197265625, 0.03778076171875, 0.0714111328125, 0.1119384765625, 0.1978759765625, 0.1475830078125, 0.1318359375, 0.2078857421875, 0.1585693359375, 0.165283203125, 0.06787109375, 0.146728515625, 0.049713134765625, 0.20654296875, 0.007568359375, 0.0758056640625, 0.15966796875, ...

embed

19320169_c0

19320169

haskell

0

Title: Filter duplicate events in reactive-banana Problem title: Filter duplicate events in reactive-banana Tags: frp, haskell, reactive-banana Problem: Filter duplicate events in reactive-banana Let's say I have x :: Event t (A,B) I can get the first component of it: fst <$> x :: Event t A However, this event will fir...

Filter duplicate events in reactive-banana Filter duplicate events in reactive-banana frp haskell reactive-banana Filter Event Moment Filter duplicate events in reactive-banana Let's say I have I can get the first component of it: However, this event will fire even when the first component doesn't change. I want to avo...

[ -0.01361083984375, 0.031982421875, -0.0081787109375, -0.0103759765625, 0.0008087158203125, -0.01214599609375, 0.01470947265625, 0.0225830078125, -0.0009002685546875, -0.046142578125, -0.04541015625, 0.025390625, -0.00014495849609375, 0.03271484375, -0.01348876953125, 0.0152587890625, ...

[ 128896, 171763, 67, 47353, 456, 71232, 105281, 11, 14119, 254, 1556, 142508, 36943, 29339, 831, 2046, 5117, 82761, 19732, 1221, 11476, 3853, 22027, 18, 15549, 3444, 71864, 2806, 185553, 135587, 65970, 62, 110527, 864, 87388, 208479, 959, 9881...

[ 0.239501953125, 0.2332763671875, 0.063720703125, 0.2022705078125, 0.0860595703125, 0.190673828125, 0.1658935546875, 0.14599609375, 0.03936767578125, 0.04254150390625, 0.06182861328125, 0.16357421875, 0.140380859375, 0.1942138671875, 0.0207977294921875, 0.0728759765625, 0.059295654296...

embed

19513589_c0

19513589

haskell

0

Title: Defining a new instance over Yesod's Key a? Problem title: Defining a new instance over Yesod's Key a? Tags: yesod, type-families, haskell Problem: Defining a new instance over Yesod's Key a? Having received a value of type Key a , I can easily define and use this function: keyToInt64 :: Key a -> Int64...

Defining a new instance over Yesod's Key a? Defining a new instance over Yesod's Key a? yesod type-families haskell Defining Yesod Key keyToInt64 Int64 PersistInt64 Num Illegal Defining a new instance over Yesod's Key a? Having received a value of type Key a , I can easily define and use this function: Howeve...

[ -0.0028839111328125, 0.0026397705078125, 0.0010223388671875, -0.031982421875, -0.0084228515625, 0.01397705078125, 0.006072998046875, -0.01324462890625, -0.0064697265625, -0.0201416015625, 0.0027618408203125, -0.031494140625, -0.0196533203125, -0.003204345703125, -0.01031494140625, -0.0...

[ 88606, 449, 3525, 110527, 645, 32635, 2199, 3768, 26824, 10, 2422, 23722, 10644, 69128, 1556, 142508, 22799, 7763, 18, 13307, 57309, 271, 52782, 891, 86966, 75204, 34292, 111, 72546, 61924, 4527, 32354, 831, 5701, 1295, 28032, 100, 18499, 9...

[ 0.194091796875, 0.06298828125, 0.1370849609375, 0.245849609375, 0.137939453125, 0.173095703125, 0.24658203125, 0.0654296875, 0.1551513671875, 0.1566162109375, 0.1124267578125, 0.2042236328125, 0.1695556640625, 0.102783203125, 0.0863037109375, 0.1934814453125, 0.102783203125, 0.1071...

embed

47236567_c0

47236567

haskell

0

Title: Haskell Data "Error - Control stack overflow" Problem title: Haskell Data "Error - Control stack overflow" Tags: haskell, instance Problem: Haskell Data "Error - Control stack overflow" I'm a newbie in Haskell and I am writing my first data structure. data Nat = Null | N Nat For example: 5 is...

Haskell Data "Error - Control stack overflow" Haskell Data "Error - Control stack overflow" haskell instance Haskell Data Error Control Nat Show Ord Num Enum xs2 Haskell Data "Error - Control stack overflow" I'm a newbie in Haskell and I am writing my first data structure. For example: 5 is N (N (N ...

[ 0.00396728515625, 0.0096435546875, 0.00775146484375, 0.0014495849609375, 0.0255126953125, 0.0005645751953125, 0.0196533203125, -0.02685546875, 0.0186767578125, -0.0081787109375, 0.006256103515625, -0.025634765625, 0.035888671875, 0.0034027099609375, 0.005950927734375, 0.01177978515625,...

[ 20625, 142508, 11809, 18468, 31611, 27131, 177261, 645, 118664, 1556, 110527, 212059, 68875, 17367, 35379, 52782, 357, 316, 1022, 7, 304, 3525, 9014, 32562, 5117, 2053, 45646, 190, 83, 541, 839, 1429, 1181, 28282, 1295, 864, 54397, 21771, 4...

[ 0.141845703125, 0.261474609375, 0.15380859375, 0.135986328125, 0.176513671875, 0.2437744140625, 0.1741943359375, 0.1287841796875, 0.268310546875, 0.1219482421875, 0.2091064453125, 0.178466796875, 0.1624755859375, 0.1961669921875, 0.155029296875, 0.15478515625, 0.05419921875, 0.1881...

embed

9547325_c1

9547325

haskell

1

written through some STM mechanism, such as a TChan . A special thread receives these messages, passing out data requested through another TChan , or taking received data and writing it to the shared data structure. This solution seems free of the problems plaguing solutions 1-3, but it also seems to me that it essent...

[ -0.0054931640625, 0.03125, -0.0205078125, 0.0125732421875, 0.0186767578125, -0.01171875, -0.000370025634765625, -0.0130615234375, -0.006134033203125, -0.0380859375, -0.007080078125, -0.003936767578125, -0.002349853515625, 0.032470703125, -0.0115966796875, 0.0205078125, 0.019165039062...

[ 59121, 8305, 159, 10111, 191619, 384, 127008, 5361, 86997, 53299, 89914, 452, 2053, 50336, 35971, 75204, 32562, 47, 99764, 45646, 29806, 37202, 4092, 44402, 58650, 51347, 54867, 85590, 76199, 1257, 17368, 26267, 2449, 13695, 74729, 1660, 26008,...

[ 0.1495361328125, 0.0697021484375, 0.0777587890625, 0.2474365234375, 0.198486328125, 0.061614990234375, 0.208251953125, 0.1177978515625, 0.19482421875, 0.07421875, 0.1458740234375, 0.09814453125, 0.11474609375, 0.136962890625, 0.0067138671875, 0.0635986328125, 0.1248779296875, 0.007...

embed

64175005_c0

64175005

haskell

0

Title: How do I use Aeson to generate a literal (unquoted) javascript expression? Problem title: How do I use Aeson to generate a literal (unquoted) javascript expression? Tags: json, object-literal, template-haskell, haskell, aeson Problem: How do I use Aeson to generate a literal (unquoted) javascript expression? i'm...

How do I use Aeson to generate a literal (unquoted) javascript expression? How do I use Aeson to generate a literal (unquoted) javascript expression? json object-literal template-haskell haskell aeson How Aeson Value vega.Debug Data.Aeson.QQ.Simple How do I use Aeson to generate a literal (unquoted) javascript expressi...

[ -0.0103759765625, -0.0228271484375, -0.033447265625, -0.00860595703125, -0.0162353515625, -0.00860595703125, -0.000530242919921875, 0.01519775390625, -0.00384521484375, -0.01055908203125, 0.010009765625, 0.0284423828125, 0.006988525390625, -0.003936767578125, 0.01129150390625, 0.000720...

[ 11249, 4527, 62, 90, 191, 139392, 15659, 289, 309, 68726, 136951, 125195, 1647, 1681, 36746, 39798, 110934, 10557, 142508, 1556, 10, 190060, 173, 208, 4657, 85779, 11809, 284, 66286, 8859, 33209, 47, 17368, 32354, 3871, 27875, 903, 134598, ...

[ 0.06494140625, 0.13427734375, 0.1396484375, 0.1475830078125, 0.2261962890625, 0.186279296875, 0.1658935546875, 0.1243896484375, 0.0908203125, 0.1763916015625, 0.245361328125, 0.23828125, 0.05328369140625, 0.1368408203125, 0.1451416015625, 0.1180419921875, 0.1680908203125, 0.0157165...

embed

35837199_c0

35837199

haskell

0

Title: Making a set data type with list data structure in Haskell Problem title: Making a set data type with list data structure in Haskell Tags: data-structures, haskell, set Problem: Making a set data type with list data structure in Haskell Write insert and member operations in Haskell. Make sure that in ML and Hask...

Making a set data type with list data structure in Haskell Making a set data type with list data structure in Haskell data-structures haskell set Making Haskell Making a set data type with list data structure in Haskell The code I written above just makes it have functions that perform on lists. Is there a way to make ...

[ 0.0019683837890625, 0.0252685546875, 0.020751953125, 0.0050048828125, -0.0047607421875, 0.00946044921875, -0.023193359375, -0.005523681640625, 0.00238037109375, 0.0019989013671875, -0.0194091796875, -0.00787353515625, 0.01904296875, 0.005645751953125, -0.023681640625, 0.0166015625, 0...

[ 13676, 5423, 2053, 10644, 678, 5303, 45646, 20625, 142508, 137656, 1556, 18151, 30482, 765, 32354, 51339, 98, 3917, 3249, 903, 3934, 10, 18507, 90502, 52080, 123309, 56037, 20653, 19943, 32786, 77336, 6044 ]

[ 0.05938720703125, 0.19580078125, 0.107666015625, 0.171142578125, 0.0709228515625, 0.1993408203125, 0.197998046875, 0.1207275390625, 0.2041015625, 0.1319580078125, 0.0946044921875, 0.0560302734375, 0.07220458984375, 0.05059814453125, 0.12939453125, 0.1099853515625, 0.0462646484375, ...

embed

54383159_c0

54383159

haskell

0

Title: Why aren't those two expressions equivalent and one gives an error? Problem title: Why aren't those two expressions equivalent and one gives an error? Tags: functional-programming, haskell, function Problem: Why aren't those two expressions equivalent and one gives an error? --Find kth element of list ...

Why aren't those two expressions equivalent and one gives an error? Why aren't those two expressions equivalent and one gives an error? functional-programming haskell function Why Find Empty List Wrong Expected Why aren't those two expressions equivalent and one gives an error? Gives an error Expected kind ->...

[ -0.0106201171875, 0.007232666015625, -0.00125885009765625, -0.020751953125, 0.011962890625, 0.01007080078125, -0.0147705078125, -0.00482177734375, 0.00921630859375, -0.007476806640625, 0.034423828125, -0.03125, -0.0032806396484375, -0.0024261474609375, 0.0091552734375, -0.011474609375,...

[ 44084, 6626, 125195, 183234, 76199, 18499, 1632, 123309, 28966, 1556, 142508, 32354, 26040, 31678, 939, 32036, 35133, 60075, 13, 89829, 125381, 18, 77878, 8562, 158, 2816, 4288, 1284, 360, 661, 113307, 130078, 22027, 8337 ]

[ 0.06170654296875, 0.07421875, 0.216064453125, 0.173583984375, 0.0816650390625, 0.199951171875, 0.03582763671875, 0.07220458984375, 0.028350830078125, 0.06494140625, 0.1712646484375, 0.0555419921875, 0.11279296875, 0.129638671875, 0.10675048828125, 0.15966796875, 0.1163330078125, 0....

embed

54987826_c0

54987826

haskell

0

Title: Haskell - Echoing all characters besides spaces Problem title: Haskell - Echoing all characters besides spaces Tags: haskell Problem: Haskell - Echoing all characters besides spaces I am supposed to have an input of [Char] and output [Char] but from the input double all the characters twice besides the spaces. I...

Haskell - Echoing all characters besides spaces Haskell - Echoing all characters besides spaces haskell Haskell Echoing Char Hello World HHeelloo WWoorrlldd Haskell - Echoing all characters besides spaces I am supposed to have an input of [Char] and output [Char] but from the input double all the characters twice besid...

[ -0.00701904296875, -0.006195068359375, -0.016357421875, 0.0242919921875, 0.01708984375, 0.039794921875, 0.0005340576171875, -0.01953125, 0.00390625, 0.00665283203125, 0.0022430419921875, -0.0269775390625, -0.0004177093505859375, -0.0016937255859375, -0.0228271484375, 0.023681640625, ...

[ 20625, 142508, 241, 3089, 214, 756, 124850, 30338, 988, 32628, 1556, 21656, 35378, 6661, 572, 13025, 13817, 31, 95162, 16495, 1181, 4028, 134598, 107730, 84068, 140992, 1295, 41929, 186351, 831, 12638, 62816, 26719, 26366, 39041, 5646, 841, 7...

[ 0.1572265625, 0.267578125, 0.10125732421875, 0.25390625, 0.08612060546875, 0.1292724609375, 0.19384765625, 0.1182861328125, 0.07421875, 0.2347412109375, 0.1361083984375, 0.1497802734375, 0.173095703125, 0.1661376953125, 0.0244140625, 0.1138916015625, 0.1763916015625, 0.118774414062...

embed

13279791_c0

13279791

haskell

0

Title: XMonad startup on different workspaces Problem title: XMonad startup on different workspaces Tags: haskell, xmonad Problem: XMonad startup on different workspaces I want to startup some applications in different workspaces(it is important) on xmonad start. So, I wrote following startupHook : startupApps :: [Stri...

XMonad startup on different workspaces XMonad startup on different workspaces haskell xmonad XMonad zipWithM_ XMonad startup on different workspaces I want to startup some applications in different workspaces(it is important) on xmonad start. So, I wrote following startupHook : But, it spawns all apps in first workspac...

[ 0.005096435546875, 0.027587890625, -0.016357421875, 0.0147705078125, 0.0034942626953125, 0.00007963180541992188, 0.0225830078125, -0.027587890625, 0.0078125, -0.02783203125, 0.033935546875, 0.00775146484375, -0.0162353515625, 0.03125, -0.01220703125, -0.0167236328125, -0.010131835937...

[ 1193, 46674, 712, 73882, 98, 12921, 4488, 65421, 1556, 142508, 1022, 3796, 68330, 194583, 594, 3444, 86685, 23, 5526, 4034, 54397, 25632, 11193, 685, 5623, 7710, 7, 756, 49966, 5117, 4537, 2967, 38415, 2046, 959, 3229, 20653, 26859, 72367, ...

[ 0.1180419921875, 0.171875, 0.1927490234375, 0.22607421875, 0.053375244140625, 0.1534423828125, 0.1405029296875, 0.2249755859375, 0.063232421875, 0.18603515625, 0.087646484375, 0.1397705078125, 0.1199951171875, 0.111328125, 0.010955810546875, 0.059814453125, 0.1434326171875, 0.05410...

embed

17785916_c0

17785916

haskell

0

Title: Can Haskell functions be serialized? Problem title: Can Haskell functions be serialized? Tags: serialization, deserialization, distributed, haskell Problem: Can Haskell functions be serialized? The best way to do it would be to get the representation of the function (if it can be recovered somehow). Binary seria...

Can Haskell functions be serialized? Can Haskell functions be serialized? serialization deserialization distributed haskell Can Haskell Can Haskell functions be serialized? The best way to do it would be to get the representation of the function (if it can be recovered somehow). Binary serialization is preferred for ef...

[ 0.019775390625, 0.02587890625, 0.01226806640625, -0.00171661376953125, -0.0181884765625, -0.006683349609375, -0.0277099609375, 0.00390625, -0.00836181640625, -0.026123046875, -0.006256103515625, -0.0033111572265625, -0.0034942626953125, 0.029541015625, 0.0020599365234375, 0.00842285156...

[ 4171, 20625, 142508, 32354, 7, 186, 35686, 29367, 47691, 8, 184, 51626, 15917, 3674, 1556, 2965, 3917, 54, 2046, 18811, 3190, 831, 192026, 209303, 54092, 1294, 12601, 2822, 227066, 89397, 73133, 69201, 29479, 17, 9874, 1042, 28702, 66211, 5...

[ 0.11865234375, 0.14990234375, 0.25341796875, 0.2415771484375, 0.06982421875, 0.0947265625, 0.2305908203125, 0.1390380859375, 0.1187744140625, 0.131591796875, 0.07952880859375, 0.1593017578125, 0.1427001953125, 0.00360107421875, 0.11669921875, 0.08709716796875, 0.0418701171875, 0.00...

embed

42774191_c0

42774191

haskell

0

Title: how does hgearman-client work? Problem title: how does hgearman-client work? Tags: haskell, gearman Problem: how does hgearman-client work? Unfortunately the package hgearman does not provide any test or example and I can't work it out for myself how should be combined connectGearman and submitJob to put a job t...

how does hgearman-client work? how does hgearman-client work? haskell gearman GearmanError B.pack HostName Port Either GearmanClient StateT S.StateT how does hgearman-client work? Unfortunately the package hgearman does not provide any test or example and I can't work it out for myself how should be combined connectGea...

[ -0.01116943359375, 0.0030975341796875, -0.01190185546875, 0.0025787353515625, -0.00933837890625, 0.00885009765625, -0.01446533203125, -0.0274658203125, 0.00433349609375, -0.03173828125, 0.005828857421875, -0.015380859375, -0.0040283203125, -0.007080078125, -0.02978515625, -0.0062561035...

[ 3642, 14602, 1096, 429, 147, 669, 222978, 4488, 1556, 142508, 72397, 58736, 18468, 31611, 335, 29102, 100932, 163612, 13791, 150, 2517, 22836, 618, 159, 135206, 98169, 3034, 27781, 70163, 37067, 10429, 137447, 194802, 3884, 12447, 10723, 16750,...

[ 0.063232421875, 0.02667236328125, 0.117431640625, 0.08428955078125, 0.1341552734375, 0.1929931640625, 0.271484375, 0.1328125, 0.0804443359375, 0.16748046875, 0.1849365234375, 0.2127685546875, 0.046600341796875, 0.0108642578125, 0.0357666015625, 0.13037109375, 0.05859375, 0.08410644...

embed

77294689_c0

77294689

haskell

0

Title: Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? Problem title: Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? Tags: c%2B%2B, list, haskell, arrays Problem: Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? I want to call a Haskell function from C++: a = ...

Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? c%2B%2B list haskell arrays There Way Give Haskell Read Access C-style Arrays Double Is There an O(1) Way To Give Haskell Read Access to C-style Arrays? I want to call a Haskell functi...

[ 0.0155029296875, 0.00909423828125, 0.002838134765625, -0.00714111328125, 0.0155029296875, 0.002532958984375, 0.00506591796875, -0.006591796875, 0.00677490234375, -0.018310546875, -0.006927490234375, -0.0247802734375, -0.00872802734375, -0.01165771484375, 0.00311279296875, -0.0145874023...

[ 2071, 8622, 142, 180, 27750, 42261, 77878, 20625, 142508, 4764, 40266, 47, 313, 40946, 69253, 4778, 717, 501, 5303, 1556, 10298, 107172, 3444, 11782, 32354, 1295, 37223, 7440, 1238, 1022, 41929, 1065, 6366, 11341, 7844, 199334, 53383, 26267, ...

[ 0.009368896484375, 0.076416015625, 0.06005859375, 0.219970703125, 0.194091796875, 0.1558837890625, 0.1038818359375, 0.17919921875, 0.28759765625, 0.2308349609375, 0.2081298828125, 0.07183837890625, 0.150390625, 0.2366943359375, 0.17041015625, 0.143798828125, 0.032867431640625, 0.06...

embed

8066850_c0

8066850

haskell

0

Title: Why doesn't Haskell's Prelude.read return a Maybe? Problem title: Why doesn't Haskell's Prelude.read return a Maybe? Tags: haskell, types, parsing Problem: Why doesn't Haskell's Prelude.read return a Maybe? Is there a good reason why the type of Prelude.read is read :: Read a => String -> a r...

Why doesn't Haskell's Prelude.read return a Maybe? Why doesn't Haskell's Prelude.read return a Maybe? haskell types parsing Why Haskell Prelude.read Maybe Read Either Left Right Why doesn't Haskell's Prelude.read return a Maybe? Is there a good reason why the type of Prelude.read is rather than retu...

[ -0.00787353515625, -0.005859375, 0.0198974609375, 0.019287109375, -0.0034332275390625, 0.019775390625, 0.005767822265625, -0.03662109375, 0.005157470703125, -0.00860595703125, 0.005615234375, -0.0281982421875, -0.014892578125, -0.03369140625, 0.011962890625, -0.0181884765625, -0.0220...

[ 44084, 22027, 3768, 18, 20625, 142508, 1914, 822, 112, 39116, 30646, 83425, 1556, 52895, 366, 6953, 4764, 9319, 636, 2480, 90911, 10, 31635, 15400, 10644, 43257, 3501, 34292, 79315, 13648, 35782, 184, 2886, 1286, 6083, 4565, 23351, 214, 705...

[ 0.1270751953125, 0.07061767578125, 0.05029296875, 0.1085205078125, 0.116455078125, 0.2471923828125, 0.117919921875, 0.2041015625, 0.135009765625, 0.2374267578125, 0.201171875, 0.3203125, 0.07562255859375, 0.1644287109375, 0.134033203125, 0.0180206298828125, 0.1700439453125, 0.15893...

embed

64394487_c0

64394487

haskell

0

Title: If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? Problem title: If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? Tags: functional-programming, cu...

If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? If Either can be either Left or Right but not both, then why does it correspond to OR instead of XOR in Curry-Howard correspondence? functional-programming curry-howard haskell category-t...

[ 0.01336669921875, -0.00494384765625, 0.0068359375, -0.005615234375, -0.00872802734375, 0.00494384765625, -0.006072998046875, -0.006683349609375, 0.00091552734375, -0.00006389617919921875, -0.01214599609375, -0.02587890625, 0.00160980224609375, -0.01116943359375, 0.0022125244140625, 0.0...

[ 4263, 4565, 9319, 831, 186, 40101, 636, 2480, 707, 90911, 1284, 959, 15044, 15400, 42518, 47, 33172, 64457, 1193, 24638, 17065, 1294, 11193, 19364, 6620, 123309, 28966, 198555, 497, 1556, 142508, 95487, 31, 34677, 137043, 14602, 442, 35166, ...

[ 0.003509521484375, 0.114501953125, 0.28662109375, 0.115966796875, 0.07623291015625, 0.052215576171875, 0.118408203125, 0.181396484375, 0.04058837890625, 0.185791015625, 0.06744384765625, 0.0885009765625, 0.125, 0.141845703125, 0.20849609375, 0.06707763671875, 0.2734375, 0.150146484...

embed

36385940_c0

36385940

haskell

0

Title: Custom Show instance for Complex Problem title: Custom Show instance for Complex Tags: haskell, typeclass Problem: Custom Show instance for Complex I want to print complex numbers like this: instance (Show a) => Show (Complex a) where show (a :+ b) = show a ++ " ":show b ++ "i" But the module is deriving(Show) f...

Custom Show instance for Complex Custom Show instance for Complex haskell typeclass Custom Show Complex Data.Complex Custom Show instance for Complex I want to print complex numbers like this: But the module is deriving(Show) for Complex . I could copy the Data.Complex module, remove the deriving(Show) part and add my ...

[ -0.0186767578125, 0.006500244140625, 0.01300048828125, 0.031005859375, 0.005828857421875, 0.0107421875, 0.0238037109375, -0.004913330078125, 0.0125732421875, 0.0045166015625, -0.0185546875, -0.00408935546875, 0.005889892578125, 0.035888671875, -0.0174560546875, 0.0040283203125, -0.01...

[ 130664, 17367, 110527, 100, 113197, 1556, 142508, 10644, 67413, 11809, 10770, 44974, 3444, 28412, 27140, 101935, 1884, 903, 4966, 88996, 16406, 6496, 168660, 5809, 43658, 87388, 2831, 15190, 10002, 8108, 2448, 22288, 756, 47, 114122, 831, 4734,...

[ 0.1966552734375, 0.22216796875, 0.240234375, 0.05645751953125, 0.266845703125, 0.0921630859375, 0.1854248046875, 0.16015625, 0.1439208984375, 0.0670166015625, 0.066162109375, 0.210693359375, 0.0693359375, 0.1619873046875, 0.227783203125, 0.1595458984375, 0.11181640625, 0.0447692871...

embed

36595669_c0

36595669

haskell

0

Title: Haskell, No instance for (Applicative M) Problem title: Haskell, No instance for (Applicative M) Tags: monads, haskell, compiler-errors Problem: Haskell, No instance for (Applicative M) Look at my code. ghci told that No instance for (Applicative M) arising from the superclasses of an instance declaration In the...

Haskell, No instance for (Applicative M) Haskell, No instance for (Applicative M) monads haskell compiler-errors monadic Haskell Applicative StOut Stack Monad Haskell, No instance for (Applicative M) Look at my code. ghci told that No instance for (Applicative M) arising from the superclasses of an instance declaration...

[ -0.0157470703125, 0.0081787109375, 0.0081787109375, 0.02490234375, 0.0206298828125, 0.0277099609375, 0.01153564453125, -0.0115966796875, 0.00823974609375, -0.007659912109375, 0.0172119140625, -0.039794921875, 0.0091552734375, 0.01141357421875, 0.011474609375, -0.0032196044921875, -0....

[ 20625, 142508, 438, 110527, 100, 39179, 11048, 4935, 276, 4, 2667, 712, 1556, 9969, 34759, 188800, 11, 18403, 5659, 2907, 79858, 6512, 2594, 60331, 71, 18151, 31380, 318, 30745, 187, 72219, 1295, 1601, 67413, 111, 21635, 46674, 28219, 18499...

[ 0.1705322265625, 0.271484375, 0.16650390625, 0.3037109375, 0.2127685546875, 0.131103515625, 0.161376953125, 0.1292724609375, 0.192626953125, 0.0162506103515625, 0.0830078125, 0.130126953125, 0.13623046875, 0.0755615234375, 0.08453369140625, 0.1484375, 0.01373291015625, 0.0332641601...

embed

36992158_c0

36992158

haskell

0

Title: Haskell newbie gotcha: why does this η-reduction change type inference? Problem title: Haskell newbie gotcha: why does this η-reduction change type inference? Tags: functional-programming, haskell, static-typing, type-inference Problem: Haskell newbie gotcha: why does this η-reduction change type inference? Lear...

Haskell newbie gotcha: why does this η-reduction change type inference? Haskell newbie gotcha: why does this η-reduction change type inference? functional-programming haskell static-typing type-inference Haskell Haskell newbie gotcha: why does this η-reduction change type inference? Learning Haskell right now and stumb...

[ -0.0018463134765625, -0.00604248046875, 0.0145263671875, 0.016357421875, 0.00738525390625, 0.0036773681640625, -0.005828857421875, 0.005889892578125, -0.0059814453125, -0.0084228515625, -0.01263427734375, -0.00665283203125, -0.0004215240478515625, -0.021728515625, 0.0035858154296875, -...

[ 20625, 142508, 3525, 9014, 4163, 1436, 15400, 14602, 903, 781, 107, 77391, 15549, 10644, 53498, 6620, 123309, 28966, 1556, 201939, 46280, 69988, 114344, 81960, 939, 137399, 13538, 7077, 678, 201, 136, 40401, 140992, 4966, 83, 84751, 9842, 100...

[ 0.1273193359375, 0.2093505859375, 0.092529296875, 0.136962890625, 0.05914306640625, 0.1676025390625, 0.1650390625, 0.0364990234375, 0.0906982421875, 0.22802734375, 0.16845703125, 0.173583984375, 0.20068359375, 0.209716796875, 0.1942138671875, 0.0831298828125, 0.06536865234375, 0.02...

embed

1739186_c0

1739186

haskell

0

Title: Are peekCString and peekCStringLen lazy? Problem title: Are peekCString and peekCStringLen lazy? Tags: ffi, lazy-evaluation, haskell Problem: Are peekCString and peekCStringLen lazy? I have a C function that creates a null terminated string and returns a pointer to it, there is also corresponding deallocation fu...

Are peekCString and peekCStringLen lazy? Are peekCString and peekCStringLen lazy? ffi lazy-evaluation haskell ccall get_str CString free_str Are peekCString and peekCStringLen lazy? I have a C function that creates a null terminated string and returns a pointer to it, there is also corresponding deallocation function. ...

[ 0.029052734375, 0.01556396484375, 0.00089263916015625, 0.0294189453125, 0.006195068359375, 0.0213623046875, 0.010986328125, 0.026123046875, 0.0216064453125, -0.00653076171875, 0.0033721923828125, -0.0157470703125, 0.004730224609375, 0.01263427734375, -0.0213623046875, 0.002426147460937...

[ 280, 343, 19283, 18, 2852, 136, 866, 33, 21, 3285, 15901, 24500, 159258, 1556, 142508, 85763, 2046, 9297, 25841, 4092, 313, 32354, 28282, 56574, 121011, 79315, 30646, 6275, 56, 35142, 87632, 3444, 20625, 23351, 214, 1295, 176377, 33662, 772...

[ 0.161865234375, 0.1416015625, 0.05926513671875, 0.0438232421875, 0.2274169921875, 0.07049560546875, 0.1090087890625, 0.172607421875, 0.175537109375, 0.208984375, 0.021148681640625, 0.1136474609375, 0.14697265625, 0.05902099609375, 0.210693359375, 0.1865234375, 0.033782958984375, 0....

embed

18481452_c0

18481452

haskell

0

Title: Reader monad, how bind readers works? Problem title: Reader monad, how bind readers works? Tags: haskell, monads Problem: Reader monad, how bind readers works? I'm a beginner in Haskell. I learned How to create a Reader and How to query a shared variables. I looked into the source code of Reader.hs in Hugs98 ins...

Reader monad, how bind readers works? Reader monad, how bind readers works? haskell monads Reader Monad Reader monad, how bind readers works? I'm a beginner in Haskell. I learned How to create a Reader and How to query a shared variables. I looked into the source code of Reader.hs in Hugs98 Here I can see (return a) cr...

[ 0.0019073486328125, 0.0166015625, 0.0225830078125, 0.0152587890625, 0.01165771484375, 0.005218505859375, -0.00738525390625, -0.01336669921875, -0.002838134765625, -0.0301513671875, 0.015625, -0.005157470703125, -0.0120849609375, -0.005401611328125, 0.006561279296875, -0.017578125, -0...

[ 122636, 2667, 712, 3642, 68557, 120709, 43240, 1556, 142508, 60331, 71, 9842, 1679, 20625, 28282, 41, 1294, 99764, 77336, 31344, 18151, 5, 127, 7, 99926, 16665, 65395, 19, 10, 137565, 10366, 32354, 51776, 34292, 30646, 347, 6396, 1369, 472,...

[ 0.28662109375, 0.08880615234375, 0.1573486328125, 0.0970458984375, 0.2498779296875, 0.31005859375, 0.1640625, 0.0775146484375, 0.2203369140625, 0.140625, 0.1126708984375, 0.0230255126953125, 0.046539306640625, 0.08160400390625, 0.090576171875, 0.018341064453125, 0.0196075439453125, ...

embed

73279979_c0

73279979

haskell

0

Title: installing z3 haskell bindings on windows Problem title: installing z3 haskell bindings on windows Tags: windows, haskell, z3 Problem: installing z3 haskell bindings on windows I've followed the docs for z3 to install it onto my windows machine. The output says Z3 was successfully built. but when I try to instal...

installing z3 haskell bindings on windows installing z3 haskell bindings on windows windows haskell z3 Missing z3.h installing z3 haskell bindings on windows I've followed the docs for z3 to install it onto my windows machine. The output says Z3 was successfully built. but when I try to install Haskell bindings by runn...

[ -0.0030975341796875, 0.00445556640625, 0.002349853515625, 0.00830078125, -0.0179443359375, 0.01019287109375, -0.01287841796875, -0.010986328125, 0.00168609619140625, 0.00946044921875, -0.007476806640625, -0.036376953125, 0.0123291015625, -0.00823974609375, 0.004425048828125, 0.02832031...

[ 20600, 97, 363, 1556, 142508, 128239, 54825, 16771, 127, 7, 134629, 140992, 567, 65771, 88303, 9790, 20625, 51042, 109524, 18499, 17997, 79786, 150624, 54, 80383, 29954, 167934, 116392, 55898, 4488, 3871, 75101, 132283 ]

[ 0.1336669921875, 0.11669921875, 0.2022705078125, 0.1171875, 0.2166748046875, 0.1798095703125, 0.113525390625, 0.1051025390625, 0.1064453125, 0.038604736328125, 0.052642822265625, 0.006103515625, 0.128173828125, 0.07147216796875, 0.0843505859375, 0.007659912109375, 0.106201171875, 0...

embed

69157282_c0

69157282

haskell

0

Title: In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? Problem title: In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? Tags: operating-system, linux, haskell Problem: In Haskell, can syncing hardware clock while retrieving the time cause...

In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? In Haskell, can syncing hardware clock while retrieving the time cause a serious problem? operating-system linux haskell Haskell parseISO8601 In Haskell, can syncing hardware clock while retrieving the time cause a serious problem...

[ 0.01300048828125, -0.005462646484375, 0.0032958984375, -0.006591796875, 0.0181884765625, -0.0023040771484375, -0.0072021484375, 0.000667572021484375, -0.00885009765625, -0.06689453125, 0.0107421875, -0.00958251953125, 0.00579833984375, -0.00872802734375, -0.0155029296875, -0.0133666992...

[ 360, 20625, 142508, 831, 954, 60636, 76407, 501, 21135, 12960, 97351, 1733, 22304, 85583, 2967, 456, 172852, 16751, 11508, 6077, 1556, 366, 184, 58230, 15276, 6746, 6496, 10, 31089, 53383, 3688, 38516, 6002, 37534, 5701, 50336, 678, 2046, 4...

[ 0.037872314453125, 0.15478515625, 0.2459716796875, 0.1241455078125, 0.1568603515625, 0.1678466796875, 0.2127685546875, 0.051025390625, 0.1932373046875, 0.05340576171875, 0.10748291015625, 0.1800537109375, 0.150146484375, 0.1343994140625, 0.1593017578125, 0.02166748046875, 0.039123535...

embed

33754669_c0

33754669

haskell

0

Title: Why won't this simple Morte program typecheck? Problem title: Why won't this simple Morte program typecheck? Tags: types, morte, haskell Problem: Why won't this simple Morte program typecheck? I'm trying to better understand the Calculus of Constructions through Morte. My first attempt was to call the ...

Why won't this simple Morte program typecheck? Why won't this simple Morte program typecheck? types morte haskell Why Morte Context Expression Error Only Why won't this simple Morte program typecheck? I'm trying to better understand the Calculus of Constructions through Morte. My first attempt was to call the...

[ 0.003265380859375, -0.000553131103515625, 0.006500244140625, 0.017822265625, 0.0106201171875, 0.002593994140625, -0.000896453857421875, 0.0177001953125, -0.00958251953125, -0.053466796875, 0.00074005126953125, -0.022705078125, -0.0216064453125, -0.02294921875, 0.031982421875, 0.0059509...

[ 44084, 23742, 3768, 18, 903, 8781, 5919, 67, 1528, 10644, 78292, 52895, 20055, 1556, 142508, 1657, 22829, 25129, 1830, 212059, 87293, 212467, 195769, 8305, 81887, 11782, 182324, 32354, 68034, 35782, 9969, 1340, 18499, 9925, 3249, 10422, 3447, ...

[ 0.119873046875, 0.09429931640625, 0.044219970703125, 0.0982666015625, 0.0615234375, 0.135986328125, 0.1754150390625, 0.1927490234375, 0.1641845703125, 0.1988525390625, 0.273193359375, 0.1800537109375, 0.2244873046875, 0.09674072265625, 0.2083740234375, 0.0811767578125, 0.19580078125,...

embed

14548417_c0

14548417

haskell

0

Title: mod function and type classes in haskell Problem title: mod function and type classes in haskell Tags: types, typeclass, haskell Problem: mod function and type classes in haskell i have this line of code in haskell, where level :: Float , and y :: Int , mod (floor(fromIntegral y + (level/2))) (floor level) and g...

mod function and type classes in haskell mod function and type classes in haskell types typeclass haskell a Float Integral Possible mod function and type classes in haskell i have this line of code in haskell, where level :: Float , and y :: Int , and ghci returns me the following: i try several versions using fromInte...

[ -0.01287841796875, -0.00787353515625, 0.0059814453125, -0.003509521484375, 0.0142822265625, 0.018310546875, -0.009033203125, -0.00457763671875, -0.006134033203125, -0.02685546875, -0.005218505859375, -0.03857421875, 0.0159912109375, 0.0036163330078125, 0.00933837890625, -0.016845703125...

[ 2811, 32354, 136, 10644, 61112, 1556, 142508, 23, 52895, 67413, 10, 38699, 257, 204681, 115861, 13315, 18151, 17366, 1984, 113, 360, 18, 31380, 318, 30646, 9790, 40368, 11389, 1295, 67, 5739, 141, 74912, 96760, 12477, 28970, 5701, 35166, 75...

[ 0.2034912109375, 0.17724609375, 0.091552734375, 0.216064453125, 0.2406005859375, 0.1412353515625, 0.2193603515625, 0.038909912109375, 0.19921875, 0.19140625, 0.002960205078125, 0.146728515625, 0.0772705078125, 0.1907958984375, 0.015167236328125, 0.031982421875, 0.0845947265625, 0.1...

embed

19643664_c0

19643664

haskell

0

Title: Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b Problem title: Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b Tags: haskell Problem: Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b There is a standard tryPick function if F# that returns the first (from...

Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b haskell Standard Haskell Maybe Maybe.mapMaybe Nothing x:_ Just Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b There is a standard tryPick function if F# that retur...

[ -0.019287109375, -0.00390625, 0.0218505859375, -0.00144195556640625, -0.0107421875, 0.0274658203125, -0.0028839111328125, -0.00506591796875, 0.006378173828125, -0.0196533203125, 0.006866455078125, 0.0037384033203125, -0.008056640625, 0.0147705078125, 0.00225830078125, -0.00933837890625...

[ 20744, 20625, 142508, 32354, 1984, 11, 20, 1230, 5386, 83425, 876, 1556, 62346, 82419, 372, 182747, 1022, 5570, 9790, 683, 41113, 2174, 563, 4904, 30646, 7, 5117, 161063, 25737, 188, 54969, 2499, 756, 65771, 38415, 111, 98, 12830, 5303, 1...

[ 0.2227783203125, 0.1611328125, 0.244384765625, 0.200927734375, 0.05230712890625, 0.038848876953125, 0.022003173828125, 0.07318115234375, 0.1314697265625, 0.197021484375, 0.1192626953125, 0.120849609375, 0.10595703125, 0.05963134765625, 0.05908203125, 0.10589599609375, 0.05078125, 0...

embed

76259852_c0

76259852

haskell

0

Title: How do I pass C compiler flags in a Haskell Stack package.yaml Problem title: How do I pass C compiler flags in a Haskell Stack package.yaml Tags: haskell-stack, ffi, haskell Problem: How do I pass C compiler flags in a Haskell Stack package.yaml I'm working on a Haskell project involving some FFI, and I keep ma...

How do I pass C compiler flags in a Haskell Stack package.yaml How do I pass C compiler flags in a Haskell Stack package.yaml haskell-stack ffi haskell How Haskell Stack package.yaml Werror-implicit-function-declaration How do I pass C compiler flags in a Haskell Stack package.yaml I'm working on a Haskell project invo...

[ 0.0157470703125, 0.00396728515625, -0.00738525390625, -0.0201416015625, -0.0035247802734375, -0.00872802734375, -0.017578125, -0.015625, -0.018310546875, -0.003570556640625, 0.007171630859375, -0.03857421875, 0.00107574462890625, -0.00335693359375, -0.00823974609375, 0.021240234375, ...

[ 11249, 27875, 313, 9969, 34759, 49938, 7, 20625, 142508, 6512, 2594, 98169, 14520, 141, 23, 1556, 590, 24500, 601, 188800, 64357, 60923, 137175, 50718, 320, 20697, 13452, 563, 22724, 13695, 19336, 11417, 123055, 32354, 18151, 165164, 21635, 1...

[ 0.059814453125, 0.156494140625, 0.169677734375, 0.159423828125, 0.15625, 0.2266845703125, 0.0222625732421875, 0.1263427734375, 0.2247314453125, 0.15478515625, 0.12646484375, 0.1695556640625, 0.13720703125, 0.1295166015625, 0.037445068359375, 0.09332275390625, 0.08685302734375, 0.12...

embed

46448892_c1

46448892

haskell

1

"report.xlsx" return $ toXlsx bs And this crashes: test :: IO (Maybe Worksheet) test = do bs <- L.readFile "report.xlsx" return $ toXlsx bs ^? ixSheet "List1" It looks like Windows has a problem with ^? . Edit 2 No crash with this equivalent code: test :: IO (Maybe Worksheet) test = do bs <- L.readFile "report.xlsx" l...

[ 0.014404296875, 0.0130615234375, -0.005523681640625, 0.00836181640625, -0.0174560546875, 0.0211181640625, 0.0047607421875, -0.0016326904296875, 0.00286865234375, 0.004608154296875, 0.022216796875, 0.0118408203125, -0.0172119140625, 0.0091552734375, 0.0106201171875, 0.0050048828125, -...

[ 79770, 92595, 7, 425, 30646, 3650, 47, 1542, 8080, 876, 903, 150631, 90, 3034, 17780, 82419, 27985, 7816, 126, 16, 54, 339, 39116, 174350, 13331, 4084, 72859, 154663, 418, 33342, 3773, 1556, 2967, 678, 183234, 18151, 1022, 2203, 155434, 2...

[ 0.25439453125, 0.1500244140625, 0.083984375, 0.165283203125, 0.146240234375, 0.062042236328125, 0.14013671875, 0.089599609375, 0.108642578125, 0.078125, 0.050628662109375, 0.2325439453125, 0.09918212890625, 0.2059326171875, 0.1593017578125, 0.038543701171875, 0.06671142578125, 0.15...

embed

10209707_c0

10209707

haskell

0

Title: Parse string into another data type in Haskell Problem title: Parse string into another data type in Haskell Tags: parsing, haskell, regex Problem: Parse string into another data type in Haskell Recently I have been trying to create in Haskell a regex interpretor. What I did was create a new data type with all p...

Parse string into another data type in Haskell Parse string into another data type in Haskell parsing haskell regex Parse Haskell Seq Sym Rep Parse string into another data type in Haskell Recently I have been trying to create in Haskell a regex interpretor. What I did was create a new data type with all possible const...

[ -0.00592041015625, 0.0106201171875, -0.0179443359375, 0.046142578125, -0.00201416015625, 0.0322265625, -0.01312255859375, 0.003173828125, 0.00049591064453125, -0.01806640625, -0.0179443359375, -0.0096435546875, 0.0048828125, 0.0031890869140625, -0.021240234375, 0.01483154296875, 0.00...

[ 2392, 184, 79315, 3934, 15700, 2053, 10644, 20625, 142508, 366, 1556, 6835, 3355, 503, 864, 4843, 39, 33742, 31577, 28282, 29481, 748, 7722, 64549, 40, 944, 661, 13331, 51514, 61924, 110394, 32354, 43240, 2967, 96760, 107730, 23351, 214, 27...

[ 0.151611328125, 0.0489501953125, 0.2327880859375, 0.1435546875, 0.1156005859375, 0.1248779296875, 0.2120361328125, 0.127197265625, 0.216064453125, 0.1341552734375, 0.1107177734375, 0.112060546875, 0.13037109375, 0.047698974609375, 0.1571044921875, 0.06640625, 0.125244140625, 0.1741...

embed

15273158_c0

15273158

haskell

0

Title: How do I use a let within a do block in ghci? Problem title: How do I use a let within a do block in ghci? Tags: ghci, haskell Problem: How do I use a let within a do block in ghci? I'm trying to create a do block interactively in ghci. As long as I don't define a variable with in block, it's fine: Prelude>let a...

How do I use a let within a do block in ghci? How do I use a let within a do block in ghci? ghci haskell How Prelude How do I use a let within a do block in ghci? I'm trying to create a do block interactively in ghci. As long as I don't define a variable with in block, it's fine: but I can't figure out how to define a ...

[ -0.01409912109375, -0.0027313232421875, 0.01458740234375, 0.0206298828125, -0.0018768310546875, 0.0234375, -0.004486083984375, 0.00189971923828125, 0.0019683837890625, -0.013916015625, -0.01116943359375, -0.0216064453125, -0.0107421875, 0.001495361328125, 0.0106201171875, 0.00219726562...

[ 11249, 4527, 10, 2633, 28032, 54, 46389, 23, 31380, 318, 1556, 142508, 822, 112, 28282, 212398, 61924, 77336, 678, 5885, 50961, 366, 184, 18499, 20625, 31344, 11435, 3900, 19309, 47 ]

[ 0.040679931640625, 0.143310546875, 0.0802001953125, 0.230712890625, 0.1630859375, 0.1524658203125, 0.207763671875, 0.04327392578125, 0.1016845703125, 0.1595458984375, 0.0628662109375, 0.1724853515625, 0.0618896484375, 0.00140380859375, 0.04644775390625, 0.1177978515625, 0.1201171875,...

embed

16691986_c0

16691986

haskell

0

Title: Create list of strings from list of doubles, non Scientific notation Problem title: Create list of strings from list of doubles, non Scientific notation Tags: floating-point, haskell Problem: Create list of strings from list of doubles, non Scientific notation listOfLongDeci = [showFFloat Nothing (1/a) | a<-[2.....

Create list of strings from list of doubles, non Scientific notation Create list of strings from list of doubles, non Scientific notation floating-point haskell list Create Scientific Nothing listOfLongDeci2 listOfLongDeci3 Create list of strings from list of doubles, non Scientific notation the 1st gives a list of Sho...

[ -0.0003662109375, -0.003570556640625, -0.006072998046875, 0.005767822265625, 0.00433349609375, -0.000392913818359375, 0.0177001953125, -0.004241943359375, 0.0172119140625, 0.041015625, -0.0115966796875, -0.01708984375, -0.0004787445068359375, 0.01226806640625, -0.00994873046875, 0.0078...

[ 151313, 5303, 111, 79315, 7, 1295, 41929, 351, 210017, 110, 22062, 21917, 26518, 38496, 1556, 142508, 182747, 132887, 4021, 4657, 318, 304, 363, 271, 76199, 17367, 294, 3642, 831, 3249, 7639, 116, 2208, 57456, 138, 4216, 4734, 4527, 28282, ...

[ 0.1243896484375, 0.2052001953125, 0.041412353515625, 0.2454833984375, 0.050140380859375, 0.1146240234375, 0.20361328125, 0.159912109375, 0.1732177734375, 0.1351318359375, 0.080078125, 0.0955810546875, 0.05084228515625, 0.1134033203125, 0.09796142578125, 0.1990966796875, 0.13037109375...

embed

37908274_c0

37908274

haskell

0

Title: Haskell Aeson JSON Object inside JSON Array Problem title: Haskell Aeson JSON Object inside JSON Array Tags: aeson, json, haskell Problem: Haskell Aeson JSON Object inside JSON Array I am trying to convert a JSON String into an ADT This is my ADT: data UserList = UserList { userListUsers :: [UserId] } This is my...

Haskell Aeson JSON Object inside JSON Array Haskell Aeson JSON Object inside JSON Array aeson json haskell Haskell Aeson JSON Object Array UserList UserId FromJSON User Bad Request Haskell Aeson JSON Object inside JSON Array I am trying to convert a JSON String into an ADT This is my ADT: This is my FromJSON instance f...

[ -0.0035858154296875, 0.006256103515625, -0.021240234375, 0.01080322265625, -0.0189208984375, 0.0036163330078125, -0.0216064453125, 0.005828857421875, -0.0035400390625, -0.023193359375, -0.0126953125, 0.000553131103515625, 0.0024566650390625, -0.003570556640625, 0.0115966796875, -0.0099...

[ 20625, 142508, 62, 90, 191, 821, 58627, 134549, 46132, 69253, 53, 10, 1647, 1681, 1556, 53400, 154663, 568, 28090, 1375, 12745, 853, 75616, 31577, 96760, 23351, 214, 3934, 142, 41072, 83, 759, 3293, 110527, 77681, 903, 32635, 2199, 10723, ...

[ 0.1263427734375, 0.201171875, 0.09033203125, 0.118896484375, 0.19482421875, 0.1416015625, 0.230712890625, 0.2210693359375, 0.155029296875, 0.1441650390625, 0.0692138671875, 0.0653076171875, 0.07843017578125, 0.18115234375, 0.1287841796875, 0.1202392578125, 0.1507568359375, 0.002349...

embed

21152669_c0

21152669

haskell

0

Title: haskell matrix power without using if-else statement Problem title: haskell matrix power without using if-else statement Tags: matrix, haskell, linear-algebra Problem: haskell matrix power without using if-else statement I have the following function to obtain power of a matrix X^0 = identity matrix, X^1 =X; X^2...

haskell matrix power without using if-else statement haskell matrix power without using if-else statement matrix haskell linear-algebra if-else Numeric.Container Numeric.LinearAlgebra Field Matrix Integer haskell matrix power without using if-else statement I have the following function to obtain power of a matrix X^0 ...

[ -0.0262451171875, 0.0126953125, 0.0264892578125, 0.011474609375, 0.0137939453125, 0.00115203857421875, -0.00726318359375, 0.01483154296875, 0.0029449462890625, 0.01300048828125, 0.01068115234375, -0.00885009765625, 0.000888824462890625, -0.004486083984375, -0.0164794921875, 0.016967773...

[ 1556, 142508, 50944, 425, 14537, 15490, 17368, 2174, 5557, 63805, 192617, 429, 93511, 25500, 93232, 117657, 194234, 44401, 25632, 32354, 113054, 111, 1193, 8353, 2389, 182324, 418, 1542, 363, 617, 25, 37842, 7722, 456, 434, 18781 ]

[ 0.1492919921875, 0.212890625, 0.18017578125, 0.1026611328125, 0.253173828125, 0.0989990234375, 0.0638427734375, 0.155029296875, 0.1898193359375, 0.1883544921875, 0.1220703125, 0.01568603515625, 0.0006103515625, 0.062103271484375, 0.033660888671875, 0.09625244140625, 0.1649169921875, ...

embed

71134730_c0

71134730

haskell

0

Title: How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? Problem title: How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? Tags: haskell, haskell-stack Problem: How to build and modify source code locally of a package from Hack...

How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? How to build and modify source code locally of a package from Hackage using the `Haskell Stack`? haskell haskell-stack Hackage the How Haskell Stack How to build and modify source code locally of a package from Hackage usin...

[ -0.00628662109375, 0.03515625, -0.002227783203125, 0.0027923583984375, 0.0093994140625, -0.0014190673828125, -0.0126953125, 0.000056743621826171875, 0.00787353515625, -0.0157470703125, -0.00133514404296875, -0.0361328125, 0.0194091796875, 0.01043701171875, 0.020263671875, 0.01275634765...

[ 11249, 47, 45367, 136, 2811, 40383, 31344, 18151, 4000, 538, 98169, 1295, 52922, 4588, 17368, 6495, 7, 142508, 6512, 2594, 111, 1556, 590, 70, 20625, 9473, 64330, 7026, 102158, 3034, 160328, 20903, 6713, 159958, 28007, 1543, 162466, 179933, ...

[ 0.138427734375, 0.0292816162109375, 0.200927734375, 0.1173095703125, 0.1834716796875, 0.126220703125, 0.227783203125, 0.2261962890625, 0.1744384765625, 0.0570068359375, 0.2158203125, 0.11962890625, 0.2054443359375, 0.225830078125, 0.09149169921875, 0.145751953125, 0.1240234375, 0.2...

embed

47830807_c0

47830807

haskell

0

Title: Does randomIO (from System.Random) ever produce 0? Problem title: Does randomIO (from System.Random) ever produce 0? Tags: haskell, random Problem: Does randomIO (from System.Random) ever produce 0? I understand that randomIO::IO Float produces uniformly distributed Float numbers, but my question is in what rang...

Does randomIO (from System.Random) ever produce 0? Does randomIO (from System.Random) ever produce 0? haskell random System.Random Does randomIO::IO Float Infinity Does randomIO (from System.Random) ever produce 0? I understand that randomIO::IO Float produces uniformly distributed Float numbers, but my question is in ...

[ 0.00079345703125, -0.000492095947265625, 0.01336669921875, -0.0166015625, 0.0035552978515625, 0.01129150390625, 0.0184326171875, -0.01531982421875, -0.0128173828125, 0.0022430419921875, 0.015869140625, -0.0155029296875, 0.00439453125, -0.006927490234375, 0.01513671875, 0.0179443359375,...

[ 101790, 96759, 17780, 161063, 12353, 5, 126525, 3815, 17669, 27489, 757, 1556, 142508, 12, 38699, 257, 134322, 53, 28219, 61514, 15917, 3674, 101935, 9655, 23, 2367, 37457, 2389, 76172, 22085, 17727, 23937, 17721, 85526, 4588, 91067, 15122, 5...

[ 0.089111328125, 0.236328125, 0.26123046875, 0.0823974609375, 0.1617431640625, 0.0201263427734375, 0.1588134765625, 0.2130126953125, 0.179931640625, 0.219970703125, 0.228759765625, 0.116943359375, 0.2061767578125, 0.020538330078125, 0.2176513671875, 0.1444091796875, 0.174072265625, ...

embed