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
40928558_c0	40928558	haskell	0	Title: filter hangs on infinite List Problem title: filter hangs on infinite List Tags: haskell Problem: filter hangs on infinite List I have this code isPrime x = x > 0 && filter divisible [1..x] == [1,x] where divisible y = x `mod` y == 0 primes = filter isPrime [1..] that defines an infinite List of primes. All thes...	filter hangs on infinite List filter hangs on infinite List haskell List Main Program Files Haskell Platform package.conf.d Cabal-1.24.0.0 GLURaw-2.0.0.1 GLUT-2.7.0.7 HTTP-4000.3.3 HUnit-1.3.1.1 ObjectName-1.1.0.1 OpenGL-3.0.0.2 OpenGLRaw-3.1.0.0 QuickCheck-2.8.2 StateVar-1.1.0.4 Win32-2.3.1.1 array-0.5.1.1 async-2.1.0...	[ -0.01104736328125, 0.0223388671875, 0.0024871826171875, -0.028564453125, 0.00616455078125, -0.022216796875, 0.02392578125, -0.00823974609375, 0.0137939453125, -0.0137939453125, 0.00138092041015625, -0.000446319580078125, 0.01068115234375, -0.0103759765625, 0.00494384765625, 0.021972656...	[ 46312, 10756, 7, 98, 54241, 13, 32036, 1556, 142508, 12321, 7663, 42724, 20625, 70968, 98169, 5, 70547, 71, 30438, 289, 5759, 20682, 99929, 90799, 14503, 15519, 73011, 102014, 527, 143662, 5428, 53489, 134926, 135913, 68037, 134693, 22438, 67...	[ 0.317138671875, 0.28076171875, 0.1175537109375, 0.1763916015625, 0.2210693359375, 0.1236572265625, 0.248779296875, 0.169677734375, 0.302978515625, 0.14892578125, 0.2301025390625, 0.222412109375, 0.187255859375, 0.2073974609375, 0.2425537109375, 0.065185546875, 0.2076416015625, 0.12...	embed
28388715_c1	28388715	haskell	1	, JSBool True, JSProp aref "b"] What goes in the place of ??? for the type? A similar problem occurs when I want to build out a constructor for JSObject's and JSFunctionCall's, as these are also expressions. Idris's soultion In Idris ??? would look something like this. data JSExp : Bool -> Type where JSArray : List (JS...	, JSBool True, JSProp aref "b"] What goes in the place of ??? for the type? A similar problem occurs when I want to build out a constructor for JSObject's and JSFunctionCall's, as these are also expressions. Idris's soultion In Idris ??? would look something like this. data JSExp : Bool -> Type where JSArray : List (JS...	[ -0.0034637451171875, 0.0220947265625, -0.000713348388671875, 0.001678466796875, -0.00101470947265625, 0.021728515625, -0.007598876953125, 0.0140380859375, 0.01336669921875, 0.0181884765625, 0.0031280517578125, -0.0022125244140625, -0.01373291015625, 0.01055908203125, -0.00189971923828125...	[ 821, 36474, 43386, 87599, 28437, 621, 420, 275, 4865, 60899, 23, 3687, 37336, 100, 10644, 2967, 45367, 64549, 748, 13055, 75161, 309, 10763, 441, 5584, 125195, 181545, 25, 57289, 1363, 360, 2806, 6713, 1884, 903, 2053, 64977, 19279, 254, ...	[ 0.13916015625, 0.0498046875, 0.234375, 0.14453125, 0.1932373046875, 0.087890625, 0.101318359375, 0.1324462890625, 0.0144805908203125, 0.065185546875, 0.0631103515625, 0.1365966796875, 0.2445068359375, 0.011199951171875, 0.20947265625, 0.033477783203125, 0.03173828125, 0.10485839843...	embed
19863790_c0	19863790	haskell	0	Title: How do phantom types work with newtype? Problem title: How do phantom types work with newtype? Tags: newtype, haskell, phantom-types Problem: How do phantom types work with newtype? My understanding of newtypes is that they are compiled out by GHC. However, this can't be the whole story because phantom types can...	How do phantom types work with newtype? How do phantom types work with newtype? newtype haskell phantom-types How Modulus How do phantom types work with newtype? My understanding of newtypes is that they are compiled out by GHC. However, this can't be the whole story because phantom types can hold information. From her...	[ -0.01348876953125, 0.00104522705078125, 0.0045166015625, 0.007293701171875, -0.01348876953125, 0.0311279296875, 0.01348876953125, 0.0179443359375, 0.02001953125, 0.004486083984375, -0.00274658203125, -0.01483154296875, 0.0130615234375, -0.0242919921875, -0.0191650390625, 0.01513671875,...	[ 11249, 54, 68743, 5928, 52895, 4488, 678, 3525, 50986, 1556, 142508, 63014, 223, 100094, 7, 375, 5974, 1810, 390, 527, 73265, 831, 16401, 4677, 28987, 33636, 8962, 140807, 8096, 15190, 1511, 864, 18, 7565, 10422, 297, 7440, 10644, 2046, 4...	[ 0.0771484375, 0.05133056640625, 0.1553955078125, 0.196533203125, 0.258056640625, 0.1302490234375, 0.1312255859375, 0.1632080078125, 0.32080078125, 0.083251953125, 0.2120361328125, 0.1417236328125, 0.073486328125, 0.07049560546875, 0.050384521484375, 0.046905517578125, 0.17431640625, ...	embed
22162566_c0	22162566	haskell	0	Title: Haskell - Tree traversal: preorder Problem title: Haskell - Tree traversal: preorder Tags: preorder, tree, types, haskell Problem: Haskell - Tree traversal: preorder I am fairly new to Haskell, and is trying to work on an assignment from my class. I am trying to create a preorder function to traverse through a t...	Haskell - Tree traversal: preorder Haskell - Tree traversal: preorder preorder tree types haskell Haskell Tree Empty Leaf Branch Couldn Haskell - Tree traversal: preorder I am fairly new to Haskell, and is trying to work on an assignment from my class. I am trying to create a preorder function to traverse through a tre...	[ 0.0145263671875, -0.0035858154296875, -0.00616455078125, -0.005340576171875, 0.015380859375, 0.0150146484375, -0.0146484375, -0.01708984375, 0.0035247802734375, -0.047119140625, -0.0028533935546875, -0.01080322265625, -0.017822265625, -0.0291748046875, -0.003509521484375, 0.00369262695...	[ 20625, 142508, 101344, 37317, 289, 479, 80596, 53201, 52895, 1556, 31678, 939, 636, 2407, 21110, 191147, 180663, 3525, 31577, 95486, 18507, 28282, 32354, 8305, 36746, 25632, 9384, 2646, 237, 13204, 18499, 127887, 35064, 74918, 2822, 99, 4568, ...	[ 0.1148681640625, 0.2196044921875, 0.2244873046875, 0.184326171875, 0.059783935546875, 0.1553955078125, 0.2509765625, 0.20361328125, 0.1488037109375, 0.109130859375, 0.123779296875, 0.048431396484375, 0.032470703125, 0.1181640625, 0.1141357421875, 0.099365234375, 0.0159149169921875, ...	embed
44737623_c1	44737623	haskell	1	the benchmark, run these commands: git submodule init && git submodule update cabal new-build bench && ./dist-newstyle/build/btree-0.1.0.0/build/bench/bench When I run the benchmark as is, there is a part of the output that reads: Off-heap tree, Amount of time taken to build: 0.293197796 If I uncomment line 151 of BTr...	the benchmark, run these commands: git submodule init && git submodule update cabal new-build bench && ./dist-newstyle/build/btree-0.1.0.0/build/bench/bench When I run the benchmark as is, there is a part of the output that reads: Off-heap tree, Amount of time taken to build: 0.293197796 If I uncomment line 151 of BTr...	[ -0.00262451171875, 0.003204345703125, 0.0196533203125, -0.0123291015625, 0.0157470703125, 0.0037841796875, -0.01531982421875, -0.004058837890625, 0.0027313232421875, -0.00110626220703125, -0.005126953125, 0.0005950927734375, 0.00732421875, 0.0181884765625, 0.0026092529296875, 0.0166015...	[ 240057, 11675, 6097, 75101, 62270, 1614, 83279, 217, 28350, 109524, 3525, 177149, 1585, 206, 40946, 62600, 102014, 99929, 776, 237, 83, 2831, 140992, 12301, 9791, 1106, 2631, 53201, 121147, 1733, 39958, 47, 45367, 126175, 11591, 124168, 11648, ...	[ 0.29833984375, 0.109619140625, 0.007049560546875, 0.196044921875, 0.223876953125, 0.115966796875, 0.099365234375, 0.030242919921875, 0.05926513671875, 0.1644287109375, 0.018218994140625, 0.1158447265625, 0.10791015625, 0.04730224609375, 0.1551513671875, 0.257080078125, 0.097290039062...	embed
8185282_c0	8185282	haskell	0	Title: Haskell vs JVM performance Problem title: Haskell vs JVM performance Tags: jvm, java, scala, haskell Problem: Haskell vs JVM performance I want to write a backend system for a web site (it'll be a custom search-style service). It needs to be highly concurrent and fast. Given my wish for concurrency, I was planni...	Haskell vs JVM performance Haskell vs JVM performance jvm java scala haskell Haskell JVM Haskell vs JVM performance I want to write a backend system for a web site (it'll be a custom search-style service). It needs to be highly concurrent and fast. Given my wish for concurrency, I was planning on using a functional lan...	[ 0.0135498046875, 0.019775390625, -0.006256103515625, -0.00089263916015625, 0.0069580078125, -0.0233154296875, -0.0020599365234375, 0.0113525390625, -0.01397705078125, -0.015869140625, -0.01251220703125, -0.004852294921875, 0.0145263671875, 0.01055908203125, -0.002960205078125, -0.00402...	[ 20625, 142508, 20209, 821, 47599, 23718, 1647, 334, 39, 79, 330, 146232, 1556, 3444, 33022, 4420, 3611, 5426, 100, 1467, 1764, 217, 114122, 33938, 9, 40946, 4516, 27117, 103210, 133244, 4271, 19, 32599, 108636, 982, 2408, 4, 58136, 17368, ...	[ 0.1875, 0.298095703125, 0.16259765625, 0.1668701171875, 0.299560546875, 0.2154541015625, 0.056884765625, 0.1412353515625, 0.05535888671875, 0.1129150390625, 0.16162109375, 0.2442626953125, 0.1776123046875, 0.0950927734375, 0.1197509765625, 0.1085205078125, 0.125244140625, 0.1171875...	embed
15164180_c0	15164180	haskell	0	Title: Simplify code by distributing [] Problem title: Simplify code by distributing [] Tags: haskell, list, monads Problem: Simplify code by distributing [] I have the following function type Assignment = [(Ref, Val)] predi2 :: [(Val,Val)] -> Ref -> Ref -> (Maybe Assignment -> [Maybe Assignment]) predi2 f k1 k2 = \ma ...	Simplify code by distributing [] Simplify code by distributing [] haskell list monads Simplify Assignment Ref Val predi2 Maybe Nothing Just Simplify code by distributing [] I have the following function Given all the instances of Maybe, I thought I could simplify it to something more simple inside the Maybe monad: But ...	[ 0.00408935546875, -0.000888824462890625, 0.0146484375, 0.0038299560546875, 0.008056640625, 0.00396728515625, -0.00982666015625, 0.00628662109375, 0.00439453125, 0.006011962890625, 0.02880859375, 0.00323486328125, -0.01123046875, -0.0230712890625, -0.007476806640625, -0.005340576171875,...	[ 55331, 28574, 53, 18151, 390, 15917, 1916, 378, 1556, 142508, 5303, 2667, 712, 1301, 31304, 53295, 4769, 1653, 304, 83425, 182747, 70, 25632, 32354, 756, 110527, 17569, 112892, 18929, 47, 1286, 8781, 46132, 2967, 2704, 37076, 3871, 30646, 3...	[ 0.170166015625, 0.192138671875, 0.1116943359375, 0.193359375, 0.037750244140625, 0.2152099609375, 0.109130859375, 0.0772705078125, 0.1099853515625, 0.2318115234375, 0.1513671875, 0.09442138671875, 0.1356201171875, 0.002899169921875, 0.1495361328125, 0.14111328125, 0.116943359375, 0...	embed
27602281_c1	27602281	haskell	1	} [leaf 8] deleteNode :: Int -> [CustomTree] -> [CustomTree] deleteNode _ [] = [] deleteNode n (x:xs) = if isNodeInTree n x then deleteNodeFromTree n x ++ xs else deleteNode n xs --below is the fixed line as per the answer below --deleteNode n (x:xs) = if isNodeInTree n x then deleteNodeFromTree n x ++ xs else x : dele...	} [leaf 8] deleteNode :: Int -> [CustomTree] -> [CustomTree] deleteNode _ [] = [] deleteNode n (x:xs) = if isNodeInTree n x then deleteNodeFromTree n x ++ xs else deleteNode n xs --below is the fixed line as per the answer below --deleteNode n (x:xs) = if isNodeInTree n x then deleteNodeFromTree n x ++ xs else x : dele...	[ 0.00469970703125, 0.0135498046875, -0.01495361328125, -0.00122833251953125, 0.0078125, 0.00830078125, 0.01068115234375, -0.033447265625, 0.0035552978515625, -0.02490234375, 0.01055908203125, 0.000850677490234375, 0.000820159912109375, -0.015869140625, -0.00390625, -0.006622314453125, ...	[ 51912, 2407, 382, 154109, 5021, 112, 1984, 360, 18, 223, 5928, 62731, 13, 653, 425, 12, 2174, 83, 4153, 1022, 168407, 37223, 37076, 7, 17336, 188347, 13315, 35064, 8520, 67, 130664, 42485, 501, 2460, 929, 87599, 18537, 22225, 525, 4358, ...	[ 0.009521484375, 0.111083984375, 0.107666015625, 0.243896484375, 0.218994140625, 0.1610107421875, 0.001495361328125, 0.070068359375, 0.05499267578125, 0.1343994140625, 0.1390380859375, 0.18115234375, 0.041473388671875, 0.1964111328125, 0.1627197265625, 0.0816650390625, 0.0615844726562...	embed
19461227_c0	19461227	haskell	0	Title: Simulating a spring/damper system in Yampa Problem title: Simulating a spring/damper system in Yampa Tags: yampa, physics, frp, haskell Problem: Simulating a spring/damper system in Yampa I'm trying to use Yampa for some basic system simulation like I'd do in Simulink. In this case I want to simulate a spring an...	Simulating a spring/damper system in Yampa Simulating a spring/damper system in Yampa yampa physics frp haskell Simulating Yampa Simulating a spring/damper system in Yampa I'm trying to use Yampa for some basic system simulation like I'd do in Simulink. In this case I want to simulate a spring and damper system, introd...	[ 0.0130615234375, 0.028564453125, -0.007568359375, 0.024658203125, 0.001220703125, 0.01409912109375, 0.0040283203125, 0.003936767578125, -0.00531005859375, -0.04345703125, 0.005218505859375, -0.0013275146484375, -0.01239013671875, 0.0198974609375, -0.01287841796875, -0.0198974609375, ...	[ 144814, 1916, 31576, 64, 85, 41577, 5426, 2369, 15293, 151, 34053, 27744, 14119, 254, 1556, 142508, 4527, 62822, 40226, 602, 561, 10187, 67, 136, 48, 65508, 35902, 14068, 57143, 59121, 25632, 26073, 32354, 33636, 58269, 28282, 40956, 29479, ...	[ 0.2279052734375, 0.0139617919921875, 0.202880859375, 0.014373779296875, 0.106201171875, 0.2137451171875, 0.16845703125, 0.1712646484375, 0.26318359375, 0.1221923828125, 0.0472412109375, 0.04095458984375, 0.002288818359375, 0.05926513671875, 0.08111572265625, 0.1995849609375, 0.023635...	embed
2246323_c0	2246323	haskell	0	Title: Iterate over list in haskell? Problem title: Iterate over list in haskell? Tags: functional-programming, portaudio, haskell Problem: Iterate over list in haskell? I'm writing an audio program in Haskell using Portaudio. I have a function that generates a list of samples I'd like to play, and I'm trying to play t...	Iterate over list in haskell? Iterate over list in haskell? functional-programming portaudio haskell NoError Iterate Right Iterate over list in haskell? I'm writing an audio program in Haskell using Portaudio. I have a function that generates a list of samples I'd like to play, and I'm trying to play them using the fol...	[ -0.00045013427734375, 0.0087890625, -0.004058837890625, 0.00714111328125, -0.01263427734375, 0.0035552978515625, 0.0120849609375, -0.0260009765625, 0.0034027099609375, -0.0419921875, 0.0184326171875, -0.022216796875, 0.0286865234375, -0.01324462890625, -0.004974365234375, 0.00110626220...	[ 87, 8560, 67, 645, 5303, 23, 1556, 142508, 32, 123309, 28966, 4898, 43521, 18468, 90911, 32562, 18215, 1528, 20625, 57979, 32354, 139392, 121413, 71, 1884, 11301, 93, 46132, 5201, 6634, 22489, 272, 75935, 54241, 18, 2485, 634, 58735, 12478,...	[ 0.0533447265625, 0.27294921875, 0.0938720703125, 0.1912841796875, 0.250244140625, 0.0755615234375, 0.151123046875, 0.25830078125, 0.007080078125, 0.1312255859375, 0.09295654296875, 0.0936279296875, 0.2115478515625, 0.00457763671875, 0.065185546875, 0.0594482421875, 0.1796875, 0.093...	embed
7509245_c1	7509245	haskell	1	vi And this code works; I've tried plugging in the SPOJ sample test case and it produces the correct result. But when I submit this solution to SPOJ (instead of importing Luke Palmer's MemoCombinators, I simply copy and paste the necessary parts into the submitted source), it exceeds the time limit. =/ I don't underst...	vi And this code works; I've tried plugging in the SPOJ sample test case and it produces the correct result. But when I submit this solution to SPOJ (instead of importing Luke Palmer's MemoCombinators, I simply copy and paste the necessary parts into the submitted source), it exceeds the time limit. =/ I don't underst...	[ -0.01806640625, 0.0294189453125, -0.0096435546875, -0.005126953125, 0.006622314453125, 0.0064697265625, 0.006103515625, 0.0123291015625, 0.0133056640625, -0.01336669921875, 0.02099609375, -0.021240234375, 0.00787353515625, 0.022216796875, 0.02099609375, 0.01708984375, 0.0122680664062...	[ 279, 903, 18151, 43240, 37842, 12266, 140195, 1375, 121413, 3034, 7225, 27489, 26785, 16750, 4966, 137447, 29806, 47, 24927, 97702, 39287, 56, 17443, 31, 10770, 19155, 22230, 43658, 71099, 63559, 63920, 230121, 31344, 442, 204839, 7, 1733, 17...	[ 0.1845703125, 0.060882568359375, 0.187255859375, 0.1195068359375, 0.042938232421875, 0.058258056640625, 0.170654296875, 0.2349853515625, 0.17431640625, 0.1737060546875, 0.074951171875, 0.053009033203125, 0.1033935546875, 0.084228515625, 0.0091552734375, 0.1585693359375, 0.16174316406...	embed
41655218_c0	41655218	haskell	0	Title: Printing Timestamps while Debugging in Haskell Problem title: Printing Timestamps while Debugging in Haskell Tags: bind, haskell, io Problem: Printing Timestamps while Debugging in Haskell I'm still learning Haskell and debugging some functions, and usually have a timestamp function to get a sense of when certai...	Printing Timestamps while Debugging in Haskell Printing Timestamps while Debugging in Haskell bind haskell io Printing Timestamps Debugging Haskell arg1 ZonedTime Doing Printing Timestamps while Debugging in Haskell I'm still learning Haskell and debugging some functions, and usually have a timestamp function to get a ...	[ -0.01611328125, -0.00119781494140625, 0.0185546875, -0.00775146484375, 0.01458740234375, 0.006256103515625, -0.008056640625, -0.00970458984375, -0.00555419921875, -0.033935546875, 0.020263671875, -0.0277099609375, -0.0021209716796875, -0.013916015625, 0.00124359130859375, 0.01574707031...	[ 39754, 19114, 2537, 6423, 12960, 262, 978, 36659, 20625, 142508, 68557, 1556, 22995, 79459, 418, 81597, 71, 70059, 7464, 52080, 8, 32354, 1733, 590, 2676, 10422, 41018, 4034, 136, 7279, 759, 2203, 16093, 7440, 70731, 70541, 4426, 4369, 1690...	[ 0.173583984375, 0.1199951171875, 0.2103271484375, 0.1103515625, 0.07513427734375, 0.1005859375, 0.1793212890625, 0.03619384765625, 0.10302734375, 0.2203369140625, 0.141845703125, 0.09130859375, 0.151123046875, 0.0521240234375, 0.027008056640625, 0.1202392578125, 0.002685546875, 0.1...	embed
59071644_c1	59071644	haskell	1	GHC appears to treat () exactly as any other type, i.e. as if there was a question about which regular value inhabiting the type should be returned from a function. The fact that there's only one such value does not seem to be (ab)used by the optimization algorithms. ETA3: when I say Haskell, I mean Haskell-as-defined...	GHC appears to treat () exactly as any other type, i.e. as if there was a question about which regular value inhabiting the type should be returned from a function. The fact that there's only one such value does not seem to be (ab)used by the optimization algorithms. ETA3: when I say Haskell, I mean Haskell-as-defined...	[ -0.0014190673828125, -0.00115966796875, 0.0159912109375, -0.01953125, -0.01324462890625, 0.01171875, -0.00006961822509765625, -0.038818359375, -0.00159454345703125, 0.006744384765625, -0.00653076171875, -0.01483154296875, -0.0026397705078125, -0.015380859375, 0.015625, -0.0005950927734...	[ 527, 73265, 135179, 85689, 66161, 237, 2499, 3789, 10644, 9655, 20324, 34292, 54815, 5608, 176377, 1295, 32354, 4734, 1632, 6044, 959, 48903, 33740, 87235, 234873, 53958, 363, 5154, 20625, 142508, 29459, 162, 112, 5983, 56829, 2347, 841, 4187...	[ 0.147216796875, 0.243408203125, 0.078857421875, 0.133056640625, 0.104736328125, 0.06475830078125, 0.02593994140625, 0.05596923828125, 0.1929931640625, 0.1685791015625, 0.1533203125, 0.124267578125, 0.102783203125, 0.0308837890625, 0.166015625, 0.006866455078125, 0.20703125, 0.04339...	embed
26556447_c0	26556447	haskell	0	Title: Can I selectively remove .cabal file's `ghc-options` in particular files? Problem title: Can I selectively remove .cabal file's `ghc-options` in particular files? Tags: haskell Problem: Can I selectively remove .cabal file's `ghc-options` in particular files? I am using ghc-options: -Wall in my .cabal ...	Can I selectively remove .cabal file's `ghc-options` in particular files? Can I selectively remove .cabal file's `ghc-options` in particular files? haskell Can Wall Constants.hs numDogs::Int numCats::Int OPTIONS_GHC Can I selectively remove .cabal file's `ghc-options` in particular files? I am using in my .ca...	[ 0.0174560546875, 0.005584716796875, 0.0159912109375, 0.0098876953125, -0.0169677734375, -0.02001953125, -0.0172119140625, 0.00946044921875, -0.0091552734375, 0.017333984375, -0.0191650390625, -0.0029296875, -0.000301361083984375, 0.0108642578125, -0.0142822265625, 0.0166015625, 0.007...	[ 4171, 36849, 5844, 87388, 408, 3571, 11435, 3768, 9486, 238, 109585, 7, 17311, 102158, 1556, 142508, 23706, 148416, 127, 13269, 8331, 9405, 18, 76775, 28023, 165117, 41877, 441, 87, 17368, 5, 5161, 442, 35463, 33342, 1884, 903, 198076, 1869...	[ 0.07037353515625, 0.1185302734375, 0.06683349609375, 0.1627197265625, 0.104248046875, 0.1859130859375, 0.1446533203125, 0.0234832763671875, 0.124267578125, 0.1051025390625, 0.2301025390625, 0.0780029296875, 0.08026123046875, 0.1644287109375, 0.10614013671875, 0.1881103515625, 0.16101...	embed
41779339_c0	41779339	haskell	0	Title: Haskell euclid algorithm greatest common divisors of two integers Problem title: Haskell euclid algorithm greatest common divisors of two integers Tags: haskell Problem: Haskell euclid algorithm greatest common divisors of two integers Write a Haskell program egcd using Euclid's algorithm to to determine the gre...	Haskell euclid algorithm greatest common divisors of two integers Haskell euclid algorithm greatest common divisors of two integers haskell Haskell Integer Prelude HaskellProject egcd.hs egcd.hs:3:36 Syntax Perhaps TemplateHaskell TemplateHaskellQuotes Template Compiling Main Failed Haskell euclid algorithm greatest co...	[ -0.00077056884765625, 0.003204345703125, 0.0166015625, -0.0029449462890625, 0.0111083984375, 0.025146484375, -0.0072021484375, -0.016845703125, -0.004608154296875, -0.01708984375, 0.00982666015625, -0.01092529296875, -0.007049560546875, -0.01336669921875, -0.01397705078125, -0.00872802...	[ 20625, 142508, 1175, 238, 12472, 234873, 158036, 39210, 45, 51858, 7, 6626, 892, 26255, 1556, 44401, 1914, 822, 223353, 30046, 71574, 127, 5, 363, 32944, 19010, 181799, 196631, 6495, 31583, 31, 15612, 12321, 190355, 111, 1528, 1284, 3229, 1...	[ 0.152587890625, 0.2384033203125, 0.1123046875, 0.0908203125, 0.2340087890625, 0.19189453125, 0.17138671875, 0.2015380859375, 0.1669921875, 0.2406005859375, 0.0980224609375, 0.1531982421875, 0.1192626953125, 0.01629638671875, 0.1259765625, 0.1270751953125, 0.0819091796875, 0.1536865...	embed
64559677_c0	64559677	haskell	0	Title: Haskell: lift a normal function to a lens Problem title: Haskell: lift a normal function to a lens Tags: haskell-lens, haskell Problem: Haskell: lift a normal function to a lens I have a HashMap that contains various things (Value is from Aeson): cs :: Hashmap Text Value cs = fromList [("phone", String "+00"), (...	Haskell: lift a normal function to a lens Haskell: lift a normal function to a lens haskell-lens haskell Data.Aeson.Lens Data.Lens Haskell Hashmap Text Value Number Maybe _Just _String _Number Scientific Integral Bounded Haskell: lift a normal function to a lens I have a HashMap that contains various things (Value is f...	[ -0.0026702880859375, -0.0084228515625, -0.01239013671875, 0.0146484375, 0.010009765625, 0.020263671875, 0.002197265625, -0.0003299713134765625, 0.0036773681640625, -0.049072265625, 0.006744384765625, 0.03955078125, -0.001434326171875, 0.003143310546875, 0.021728515625, -0.025390625, ...	[ 20625, 142508, 60520, 3638, 32354, 47, 3098, 12, 10, 1556, 1977, 11809, 284, 90, 191, 866, 1755, 162087, 62346, 24129, 190060, 103332, 83425, 127794, 71713, 18444, 26278, 210017, 204681, 335, 167457, 7, 166179, 70541, 67842, 8966, 856, 50770,...	[ 0.154052734375, 0.2734375, 0.257080078125, 0.1983642578125, 0.1962890625, 0.1414794921875, 0.2178955078125, 0.000732421875, 0.008056640625, 0.15234375, 0.1693115234375, 0.0867919921875, 0.02496337890625, 0.074462890625, 0.1671142578125, 0.1126708984375, 0.175048828125, 0.1682128906...	embed
39155853_c0	39155853	haskell	0	Title: stack --nix build complains about ghc version mismatch Problem title: stack --nix build complains about ghc version mismatch Tags: haskell-stack, haskell, nix Problem: stack --nix build complains about ghc version mismatch When building threepenny-gui on NixOS with stack --nix build , I got error saying I have t...	stack --nix build complains about ghc version mismatch stack --nix build complains about ghc version mismatch haskell-stack haskell nix config.yaml stack --nix build complains about ghc version mismatch When building threepenny-gui on NixOS with stack --nix build , I got error saying I have the wrong version of ghc. Th...	[ -0.011474609375, -0.00518798828125, 0.006195068359375, -0.0030364990234375, -0.00634765625, 0.004913330078125, -0.0189208984375, -0.00159454345703125, -0.012451171875, 0.0172119140625, 0.007080078125, -0.024169921875, 0.0194091796875, -0.0037384033203125, 0.00982666015625, 0.0092163085...	[ 177261, 4210, 93, 425, 45367, 186992, 31380, 238, 11389, 1239, 98753, 1556, 142508, 590, 2594, 300, 153837, 14520, 141, 33976, 17262, 2278, 299, 17086, 1520, 7285, 18499, 765, 44691, 37842, 169581, 22027, 18, 11675, 87109, 241957, 60875, 8475...	[ 0.21533203125, 0.059478759765625, 0.1422119140625, 0.165283203125, 0.22802734375, 0.1363525390625, 0.1328125, 0.130859375, 0.178955078125, 0.093017578125, 0.2230224609375, 0.0721435546875, 0.17626953125, 0.08917236328125, 0.0654296875, 0.1041259765625, 0.1453857421875, 0.0715942382...	embed
69773999_c0	69773999	haskell	0	Title: How do I get cabal to use a local version of a package as a dependency for a Hackage package? Problem title: How do I get cabal to use a local version of a package as a dependency for a Hackage package? Tags: cabal-install, haskell, cabal Problem: How do I get cabal to use a local version of a package as a depen...	How do I get cabal to use a local version of a package as a dependency for a Hackage package? How do I get cabal to use a local version of a package as a dependency for a Hackage package? cabal-install haskell cabal How Hackage github.com attoparsec.git How do I get cabal to use a local version of a package as a depend...	[ -0.006103515625, 0.010986328125, 0.00799560546875, 0.012939453125, -0.0033111572265625, -0.00579833984375, -0.0084228515625, 0.000949859619140625, 0.00787353515625, -0.02197265625, -0.0028533935546875, -0.0277099609375, 0.008544921875, 0.012451171875, 0.007659912109375, -0.02001953125,...	[ 11249, 2046, 109524, 47, 4527, 4000, 11389, 98169, 237, 42548, 27771, 52922, 4588, 100, 80383, 1556, 142508, 62270, 32102, 243, 31, 2500, 39797, 15769, 31577, 20600, 10, 90, 191, 98, 527, 73265, 3569, 68107, 5117, 13028, 41566, 86, 6488, ...	[ 0.05950927734375, 0.09979248046875, 0.29541015625, 0.0538330078125, 0.1414794921875, 0.1572265625, 0.1737060546875, 0.20068359375, 0.0787353515625, 0.200927734375, 0.118896484375, 0.183349609375, 0.188232421875, 0.0487060546875, 0.1309814453125, 0.0914306640625, 0.2015380859375, 0....	embed
49717000_c0	49717000	haskell	0	Title: Organizing common types in Haskell Problem title: Organizing common types in Haskell Tags: naming, module, haskell Problem: Organizing common types in Haskell I have several Haskell modules (Foo1.hs, Foo2.hs, Foo3.hs) that all depend on the same set of types (Common.hs): ... Foo/Foo1.hs Foo/Foo2.hs Foo/Foo3.hs F...	Organizing common types in Haskell Organizing common types in Haskell naming module haskell Foo.Common Foo.FooCommon Organizing Haskell Foo Foo1.hs Foo2.hs Foo3.hs Common.hs Bar Bar1.hs Bar2.hs Organizing common types in Haskell I have several Haskell modules (Foo1.hs, Foo2.hs, Foo3.hs) that all depend on the same set ...	[ 0.007110595703125, -0.0113525390625, -0.00738525390625, 0.01092529296875, 0.00775146484375, -0.007537841796875, -0.00347900390625, -0.00640869140625, -0.005218505859375, -0.00885009765625, -0.0025177001953125, 0.000675201416015625, 0.0269775390625, 0.0062255859375, -0.02099609375, -0.0...	[ 43435, 39210, 52895, 20625, 142508, 147453, 88996, 1556, 9572, 31, 10770, 3796, 27591, 127, 5442, 363, 151301, 3253, 23, 40368, 56566, 5701, 5423, 45646, 18151, 12301, 5299, 24927, 203925, 5915, 76, 4806, 7, 102158, 87420, 64194, 13452, 15410...	[ 0.263671875, 0.199951171875, 0.2386474609375, 0.147216796875, 0.218505859375, 0.1341552734375, 0.15380859375, 0.111328125, 0.12744140625, 0.07769775390625, 0.0989990234375, 0.16259765625, 0.0770263671875, 0.148681640625, 0.0192108154296875, 0.0270538330078125, 0.2161865234375, 0.12...	embed
50207475_c0	50207475	haskell	0	Title: How to use recursion for every two elements in the list Problem title: How to use recursion for every two elements in the list Tags: haskell Problem: How to use recursion for every two elements in the list I have already written a function to get a certain number of the coordinates for a line between two points....	How to use recursion for every two elements in the list How to use recursion for every two elements in the list haskell How Coord p1:p2:ps How to use recursion for every two elements in the list I have already written a function to get a certain number of the coordinates for a line between two points. But I faced some ...	[ -0.0322265625, 0.007110595703125, -0.001373291015625, 0.01190185546875, -0.005584716796875, 0.0177001953125, 0.02978515625, 0.01953125, 0.011474609375, -0.044921875, 0.005401611328125, -0.03173828125, 0.01708984375, -0.00897216796875, -0.013916015625, 0.0164794921875, 0.0174560546875...	[ 11249, 47, 4527, 195625, 1830, 100, 11907, 6626, 80854, 23, 5303, 1556, 142508, 1311, 6651, 915, 82825, 254, 304, 6423, 70, 21771, 59121, 32354, 2046, 24233, 14012, 176866, 90, 13315, 17721, 26847, 2577, 71337, 8972, 756, 35874, 6126, 10773...	[ 0.108154296875, 0.082763671875, 0.166748046875, 0.265625, 0.21923828125, 0.1024169921875, 0.168212890625, 0.197509765625, 0.20751953125, 0.04638671875, 0.2208251953125, 0.1343994140625, 0.22216796875, 0.0667724609375, 0.1597900390625, 0.0177001953125, 0.038055419921875, 0.022338867...	embed
47024808_c0	47024808	haskell	0	Title: Is there a corresponding optic for higher-order traversable functors? Problem title: Is there a corresponding optic for higher-order traversable functors? Tags: traversable, haskell, haskell-lens, haskell-hedgehog, category-theory Problem: Is there a corresponding optic for higher-order traversable functors? Hed...	Is there a corresponding optic for higher-order traversable functors? Is there a corresponding optic for higher-order traversable functors? traversable haskell haskell-lens haskell-hedgehog category-theory HTraversable Higher-order Applicative Traversable Is there a corresponding optic for higher-order traversable func...	[ 0.00390625, -0.003631591796875, -0.01226806640625, -0.0179443359375, 0.01312255859375, 0.0054931640625, -0.000408172607421875, -0.0089111328125, 0.007232666015625, -0.04833984375, -0.0024871826171875, 0.000553131103515625, 0.0034027099609375, -0.01324462890625, -0.001190185546875, -0.0...	[ 42518, 214, 233, 9523, 100, 77546, 80596, 37317, 2886, 7477, 18770, 2685, 10, 1556, 142508, 1977, 5252, 60885, 1663, 95487, 2347, 572, 28542, 7864, 19694, 11048, 4937, 87193, 18507, 61924, 11814, 678, 3323, 10644, 171859, 84382, 645, 142424, ...	[ 0.1202392578125, 0.03167724609375, 0.1788330078125, 0.169921875, 0.03173828125, 0.1385498046875, 0.152099609375, 0.1729736328125, 0.17724609375, 0.1387939453125, 0.1246337890625, 0.012725830078125, 0.012054443359375, 0.0869140625, 0.1923828125, 0.10577392578125, 0.049957275390625, ...	embed
32481418_c1	32481418	haskell	1	type family. If I did something that involved typeclass dictionaries instead like this: badEntailment :: Proxy a -> (Show a) :- (Ord a) badEntailment _ = unsafeCoerceConstraint I assume that this would almost certainly be capable of causing a segfault. Is this true? and if so, what makes it different from the original...	type family. If I did something that involved typeclass dictionaries instead like this: badEntailment :: Proxy a -> (Show a) :- (Ord a) badEntailment _ = unsafeCoerceConstraint I assume that this would almost certainly be capable of causing a segfault. Is this true? and if so, what makes it different from the original...	[ 0.01312255859375, 0.0072021484375, 0.005340576171875, -0.0035858154296875, -0.0118408203125, -0.00592041015625, -0.007293701171875, -0.00970458984375, 0.001556396484375, -0.01434326171875, -0.01214599609375, -0.010498046875, 0.012939453125, 0.0179443359375, -0.006500244140625, -0.00253...	[ 10644, 14449, 6777, 75412, 67413, 45, 10763, 11, 10484, 64457, 6494, 7768, 46741, 674, 1250, 50878, 10, 168660, 143045, 51, 115840, 56, 329, 2816, 4288, 68782, 87709, 216806, 1931, 1021, 7136, 29568, 12921, 7311, 76615, 60892, 33946, 587, 4...	[ 0.245849609375, 0.1705322265625, 0.01129150390625, 0.0677490234375, 0.1995849609375, 0.0196990966796875, 0.100830078125, 0.042327880859375, 0.00146484375, 0.0518798828125, 0.1141357421875, 0.030914306640625, 0.2120361328125, 0.0789794921875, 0.0927734375, 0.206298828125, 0.0361022949...	embed
10291550_c0	10291550	haskell	0	Title: Pattern matching vs record syntax function for data type field extraction Problem title: Pattern matching vs record syntax function for data type field extraction Tags: haskell Problem: Pattern matching vs record syntax function for data type field extraction Given an example data type with record syntax: data V...	Pattern matching vs record syntax function for data type field extraction Pattern matching vs record syntax function for data type field extraction haskell Pattern VmInfo Show Pattern matching vs record syntax function for data type field extraction Given an example data type with record syntax: and (vmInfo :: String -...	[ -0.0247802734375, -0.009521484375, 0.0101318359375, 0.0322265625, 0.0174560546875, -0.00244140625, -0.016845703125, -0.010009765625, -0.0023956298828125, -0.04052734375, 0.0126953125, -0.01416015625, 0.00150299072265625, -0.01483154296875, -0.01470947265625, -0.01214599609375, 0.0116...	[ 9876, 22766, 14858, 214, 20209, 17164, 6002, 86531, 32354, 2053, 10644, 44457, 4173, 1556, 142508, 310, 39, 93147, 17367, 27781, 334, 23351, 139392, 30646, 36917, 45646, 81, 9351, 237, 79315, 6626, 150624, 125663, 11651, 63920, 103510, 9969, ...	[ 0.185791015625, 0.18017578125, 0.26123046875, 0.061676025390625, 0.1417236328125, 0.2222900390625, 0.1600341796875, 0.2117919921875, 0.1695556640625, 0.10595703125, 0.1580810546875, 0.1505126953125, 0.144775390625, 0.0965576171875, 0.19091796875, 0.1419677734375, 0.125732421875, 0....	embed
47182529_c0	47182529	haskell	0	Title: Haskell Comparing Sorting Algorithms Problem title: Haskell Comparing Sorting Algorithms Tags: sorting, iteration, haskell Problem: Haskell Comparing Sorting Algorithms Basically I want to write a function that takes a single list as an input, applies a list of sorting algorithms to that list, and then returns a...	Haskell Comparing Sorting Algorithms Haskell Comparing Sorting Algorithms sorting iteration haskell Haskell Comparing Sorting Algorithms Ord Bool x:y:xs y:xs Haskell Comparing Sorting Algorithms Basically I want to write a function that takes a single list as an input, applies a list of sorting algorithms to that list,...	[ -0.0091552734375, 0.005401611328125, 0.01556396484375, -0.006500244140625, -0.00099945068359375, 0.0125732421875, -0.0184326171875, -0.0262451171875, 0.0029449462890625, 0.0181884765625, -0.004852294921875, 0.0213623046875, 0.0213623046875, -0.005218505859375, -0.01031494140625, -0.002...	[ 20625, 142508, 113307, 53666, 214, 109847, 2783, 12096, 720, 1556, 35379, 2460, 929, 1022, 53, 425, 113, 18337, 3444, 33022, 32354, 51776, 11001, 5303, 237, 107730, 4027, 234873, 30646, 73783, 34677, 114141, 756, 11180, 19388, 17497, 959, 127...	[ 0.118896484375, 0.21923828125, 0.178955078125, 0.186767578125, 0.09130859375, 0.08184814453125, 0.0831298828125, 0.1846923828125, 0.1373291015625, 0.109375, 0.12158203125, 0.05194091796875, 0.156982421875, 0.003570556640625, 0.004486083984375, 0.0291290283203125, 0.0341796875, 0.05...	embed
9130988_c0	9130988	haskell	0	Title: haskell identifier recognition Problem title: haskell identifier recognition Tags: regular-language, parsing, haskell Problem: haskell identifier recognition my working in file parsing using Haskell, and I'm using both Data.Attoparsec.Char8 and Data.ByteString.Char8 . I want to parse an expression which can cont...	haskell identifier recognition haskell identifier recognition regular-language parsing haskell qualified Data.Attoparsec.Char8 Data.ByteString.Char8 Parser B.ByteString A.takeWhile A.inClass A-Za-z0-9_ A.parse B.pack EMBXSHM-PortClo Done PortClo EMBXSHM AU_D PCMPTask haskell identifier recognition my working in file pa...	[ -0.002716064453125, 0.0032196044921875, 0.01171875, 0.0223388671875, 0.0022430419921875, 0.0303955078125, -0.01544189453125, 0.00146484375, 0.0034027099609375, -0.01031494140625, 0.018310546875, -0.0031280517578125, 0.00518798828125, -0.00677490234375, -0.008544921875, -0.0039367675781...	[ 1556, 142508, 42485, 56, 230466, 20324, 196651, 366, 6953, 217225, 11809, 10628, 2500, 39797, 84068, 1019, 75358, 71713, 2392, 2189, 335, 62, 78219, 979, 73, 140803, 16737, 169, 2389, 15205, 29102, 12689, 1542, 12927, 594, 60006, 365, 984, ...	[ 0.1842041015625, 0.243896484375, 0.2181396484375, 0.119140625, 0.1920166015625, 0.1297607421875, 0.08831787109375, 0.187744140625, 0.044158935546875, 0.1640625, 0.0882568359375, 0.141845703125, 0.1446533203125, 0.1439208984375, 0.10595703125, 0.158935546875, 0.05517578125, 0.092529...	embed
69546661_c0	69546661	haskell	0	Title: How to check if length of a list is not equal to length of a list within a list in haskell Problem title: How to check if length of a list is not equal to length of a list within a list in haskell Tags: haskell, list Problem: How to check if length of a list is not equal to length of a list within a list in hask...	How to check if length of a list is not equal to length of a list within a list in haskell How to check if length of a list is not equal to length of a list within a list in haskell haskell list How Berlin Madrid Krakow Planet City How to check if length of a list is not equal to length of a list within a list in haske...	[ -0.00543212890625, 0.01446533203125, -0.0101318359375, 0.019775390625, -0.0028076171875, 0.003021240234375, 0.00180816650390625, -0.0118408203125, 0.016845703125, 0.03466796875, 0.016845703125, -0.017822265625, 0.03369140625, 0.01165771484375, -0.0140380859375, -0.00135040283203125, ...	[ 11249, 47, 12765, 2174, 140909, 111, 5303, 83, 959, 105950, 28032, 1556, 142508, 10, 23, 10271, 8884, 150221, 40357, 6406, 71263, 31577, 36766, 32354, 103510, 14858, 10644, 2806, 107730, 84751, 140992, 35064, 78680, 126, 115411, 21718, 6295, ...	[ 0.04510498046875, 0.089111328125, 0.196533203125, 0.093505859375, 0.1978759765625, 0.056793212890625, 0.2239990234375, 0.0257568359375, 0.1710205078125, 0.1524658203125, 0.1317138671875, 0.1376953125, 0.228759765625, 0.006072998046875, 0.0288848876953125, 0.19189453125, 0.18298339843...	embed
32700129_c0	32700129	haskell	0	Title: Haskell Strange Operator Problem title: Haskell Strange Operator Tags: haskell Problem: Haskell Strange Operator For an assignment for my functional programming class I am working on an exercise on trees. And more specifically on Rose trees. In the framework that we got the data type 'Rose' is already defined, b...	Haskell Strange Operator Haskell Strange Operator haskell Haskell Strange Operator Rose Show Exercise Haskell Strange Operator For an assignment for my functional programming class I am working on an exercise on trees. And more specifically on Rose trees. In the framework that we got the data type 'Rose' is already def...	[ 0.020751953125, 0.015625, 0.007110595703125, 0.00811767578125, 0.0106201171875, 0.0208740234375, -0.001922607421875, 0.00408935546875, 0.0181884765625, -0.031982421875, -0.0001983642578125, -0.035888671875, 0.01385498046875, 0.0079345703125, -0.022216796875, -0.0245361328125, -0.0038...	[ 20625, 142508, 187791, 150922, 1556, 24009, 17367, 155534, 184, 95486, 759, 123309, 56037, 18507, 20697, 81979, 1360, 90, 170846, 2053, 10644, 108278, 13, 21771, 61924, 39933, 152, 2740, 33938, 28994, 133, 7108, 840, 12830, 40, 944, 74855, 13...	[ 0.1407470703125, 0.212646484375, 0.225830078125, 0.25634765625, 0.119873046875, 0.223876953125, 0.2142333984375, 0.1590576171875, 0.00640869140625, 0.0728759765625, 0.000762939453125, 0.1051025390625, 0.07269287109375, 0.05731201171875, 0.06378173828125, 0.1014404296875, 0.1295166015...	embed
63482853_c1	63482853	haskell	1	/bin the PATH variable (which I did in /etc/paths . On step 2, the script was supposed to pop up a dialog box (and didn't) when installing the necessary command line tools. It also said to rerun the script once complete (which I did). The script also said I should adjust my PATH variable, and source /Users/.../.ghcup/e...	/bin the PATH variable (which I did in /etc/paths . On step 2, the script was supposed to pop up a dialog box (and didn't) when installing the necessary command line tools. It also said to rerun the script once complete (which I did). The script also said I should adjust my PATH variable, and source /Users/.../.ghcup/e...	[ 0.0067138671875, 0.020263671875, -0.01397705078125, 0.0201416015625, -0.00933837890625, 0.01806640625, -0.0120849609375, 0.00189208984375, -0.005126953125, -0.0019989013671875, -0.0002880096435546875, -0.022705078125, -0.0086669921875, -0.01513671875, 0.006195068359375, -0.008483886718...	[ 248, 7568, 70, 436, 139909, 77336, 111879, 128405, 29954, 116, 26499, 134598, 7426, 1257, 26519, 16530, 15935, 18, 20600, 63559, 75101, 13315, 72977, 456, 16428, 24145, 28484, 5608, 126596, 759, 31344, 1062, 7, 9486, 33874, 33, 334, 128019, ...	[ 0.1207275390625, 0.2445068359375, 0.0308074951171875, 0.150146484375, 0.22802734375, 0.307373046875, 0.0987548828125, 0.1861572265625, 0.08843994140625, 0.040496826171875, 0.16455078125, 0.08447265625, 0.11376953125, 0.05364990234375, 0.1514892578125, 0.127685546875, 0.0079345703125,...	embed
1898771_c0	1898771	haskell	0	Title: Adding deriving (Data) to standard types Problem title: Adding deriving (Data) to standard types Tags: typeclass, haskell Problem: Adding deriving (Data) to standard types I would like to add deriving (Data) to standard types. After enabling the StandaloneDeriving , FlexibleContexts , DeriveDataTypeable , and Un...	Adding deriving (Data) to standard types Adding deriving (Data) to standard types typeclass haskell Adding Data StandaloneDeriving FlexibleContexts DeriveDataTypeable UndecidableInstances Day DiffTime TemperatureRecord.hs:30:0 Adding deriving (Data) to standard types I would like to add deriving (Data) to standard type...	[ 0.031982421875, 0.00872802734375, 0.004241943359375, 0.006256103515625, 0.001312255859375, -0.0048828125, -0.00909423828125, 0.01019287109375, -0.004119873046875, -0.053466796875, -0.010009765625, -0.00506591796875, 0.01263427734375, 0.03076171875, -0.0130615234375, -0.0162353515625, ...	[ 62, 59725, 16406, 6496, 137989, 47, 5570, 52895, 10644, 67413, 1556, 142508, 11809, 32487, 51684, 47731, 14, 180842, 2661, 22829, 1310, 5844, 196707, 2886, 79912, 24750, 116071, 10013, 191144, 70059, 61727, 32271, 127, 1197, 53861, 1884, 15190,...	[ 0.09210205078125, 0.09869384765625, 0.2049560546875, 0.16455078125, 0.171875, 0.0772705078125, 0.2388916015625, 0.247314453125, 0.1375732421875, 0.135986328125, 0.102783203125, 0.2235107421875, 0.122314453125, 0.08740234375, 0.082763671875, 0.1114501953125, 0.055389404296875, 0.124...	embed
75835927_c0	75835927	haskell	0	Title: Haskell's equivalence of Rust's GAT? Problem title: Haskell's equivalence of Rust's GAT? Tags: haskell, rust Problem: Haskell's equivalence of Rust's GAT? What is the Haskell's equivalence of the following Rust code: trait Foo { type Bar<T>; fn foo(x: String) -> Self::Bar<String>; } I tried t...	Haskell's equivalence of Rust's GAT? Haskell's equivalence of Rust's GAT? haskell rust Haskell Rust GAT Foo Bar Self::Bar Main.hs:83:5 Couldn Expected Actual AllowAmbiguousTypes When Haskell's equivalence of Rust's GAT? What is the Haskell's equivalence of the following Rust code: I tried to write t...	[ 0.0115966796875, 0.0123291015625, -0.0181884765625, -0.0284423828125, 0.00732421875, -0.0189208984375, 0.00439453125, -0.003814697265625, -0.005706787109375, -0.0040283203125, -0.01422119140625, -0.029052734375, -0.0126953125, 0.00836181640625, -0.0064697265625, -0.022705078125, 0.00...	[ 20625, 142508, 3768, 224743, 3956, 144222, 132819, 1556, 52648, 9572, 31, 3253, 55347, 25267, 12321, 127, 17168, 758, 191147, 60075, 100582, 41566, 150567, 12282, 10821, 196707, 25632, 18151, 37842, 33022, 18499 ]	[ 0.1466064453125, 0.263427734375, 0.0655517578125, 0.1488037109375, 0.06683349609375, 0.2154541015625, 0.198486328125, 0.120361328125, 0.17919921875, 0.101318359375, 0.03143310546875, 0.10107421875, 0.09674072265625, 0.09893798828125, 0.057525634765625, 0.0225067138671875, 0.152465820...	embed
47957645_c0	47957645	haskell	0	Title: scanr3: Why does step, a binary operator, accept [zero] as a parameter? Problem title: scanr3: Why does step, a binary operator, accept [zero] as a parameter? Tags: haskell Problem: scanr3: Why does step, a binary operator, accept [zero] as a parameter? Lists_III Solutions To do: Write your own definition of sca...	scanr3: Why does step, a binary operator, accept [zero] as a parameter? scanr3: Why does step, a binary operator, accept [zero] as a parameter? haskell scanr3 Why Implement x:xs Haskell scanr3: Why does step, a binary operator, accept [zero] as a parameter? Lists_III Solutions To do: Write your own definition of scanr ...	[ -0.01531982421875, 0.007415771484375, 0.007568359375, 0.00518798828125, -0.014892578125, 0.0198974609375, -0.001739501953125, 0.0004444122314453125, 0.000514984130859375, -0.00701904296875, 0.00823974609375, 0.00141143798828125, -0.0185546875, 0.0172119140625, 0.00653076171875, -0.0081...	[ 44954, 42, 363, 44084, 29954, 2394, 6635, 39933, 26946, 80510, 171859, 1556, 142508, 153941, 1022, 12, 425, 20625, 237, 32036, 33747, 109339, 10002, 80934, 18344, 7569, 32354, 12877, 29806, 25, 11782, 62163, 6863, 10750, 35839, 678, 6626, 530...	[ 0.1566162109375, 0.1756591796875, 0.169189453125, 0.09100341796875, 0.2235107421875, 0.109375, 0.0633544921875, 0.169677734375, 0.1309814453125, 0.1961669921875, 0.20947265625, 0.0273895263671875, 0.1785888671875, 0.126708984375, 0.07598876953125, 0.00323486328125, 0.07659912109375, ...	embed
30737397_c1	30737397	haskell	1	threaded to make the event network correctly capture both text from textIn and keypresses from keyPress , which caused issues because it's not safe to modify objects from the gtk package concurrently. At the moment, I have postGUIAsync calls scattered throughout my code, and I've found that using postGUISync causes the...	threaded to make the event network correctly capture both text from textIn and keypresses from keyPress , which caused issues because it's not safe to modify objects from the gtk package concurrently. At the moment, I have postGUIAsync calls scattered throughout my code, and I've found that using postGUISync causes the...	[ 0.010498046875, 0.005035400390625, 0.0157470703125, -0.0009307861328125, 0.01171875, 0.002960205078125, 0.0179443359375, -0.015869140625, -0.00701904296875, -0.046630859375, 0.004364013671875, -0.03369140625, 0.010498046875, -0.0098876953125, -0.00830078125, 0.0040283203125, -0.01635...	[ 86997, 297, 3249, 19732, 33120, 26785, 141621, 15044, 7986, 4153, 22799, 11856, 94753, 143434, 37348, 959, 46002, 2811, 36746, 706, 31472, 98169, 133244, 1305, 43578, 17481, 12654, 238, 11782, 16275, 87420, 18151, 17368, 568, 217835, 113660, 28...	[ 0.2357177734375, 0.090087890625, 0.01080322265625, 0.1697998046875, 0.169921875, 0.0595703125, 0.13037109375, 0.008087158203125, 0.126220703125, 0.13916015625, 0.07611083984375, 0.199462890625, 0.2122802734375, 0.0006103515625, 0.107421875, 0.0008544921875, 0.102294921875, 0.047119...	embed
50439871_c1	50439871	haskell	1	I tried the following: Identity 5 + Identity 6 with the result being 11 Identity 5 + 6 with the result being 11 again However it I try the same with Maybe like so Just 5 + Just 6 Just 5 + 6 I get the following error: <interactive>:2116:1: error: • Non type-variable argument in the constraint: Num (Maybe a) (Use Flexib...	I tried the following: Identity 5 + Identity 6 with the result being 11 Identity 5 + 6 with the result being 11 again However it I try the same with Maybe like so Just 5 + Just 6 Just 5 + 6 I get the following error: <interactive>:2116:1: error: • Non type-variable argument in the constraint: Num (Maybe a) (Use Flexib...	[ -0.0194091796875, 0.00616455078125, 0.0291748046875, 0.00323486328125, 0.01190185546875, 0.0205078125, 0.01007080078125, -0.0028228759765625, 0.00927734375, -0.03466796875, -0.0037994384765625, -0.03271484375, -0.00872802734375, -0.0027313232421875, -0.004974365234375, -0.020751953125,...	[ 37842, 25632, 71257, 2481, 190, 997, 305, 16750, 534, 13438, 33306, 9790, 5701, 83425, 1884, 9563, 18499, 10433, 71232, 25619, 2485, 19721, 768, 3775, 10644, 21690, 2886, 10750, 158, 2816, 52782, 82419, 10, 1062, 180842, 2661, 22829, 28897, ...	[ 0.0970458984375, 0.04595947265625, 0.208740234375, 0.159423828125, 0.1474609375, 0.1322021484375, 0.1478271484375, 0.0985107421875, 0.13623046875, 0.06121826171875, 0.000762939453125, 0.102294921875, 0.05609130859375, 0.314697265625, 0.01287841796875, 0.166015625, 0.17333984375, 0....	embed
74040403_c0	74040403	haskell	0	Title: Haskell, taking a list of pairs (value,index) and making it a single list [Int] Problem title: Haskell, taking a list of pairs (value,index) and making it a single list [Int] Tags: computer-science, haskell, functional-programming Problem: Haskell, taking a list of pairs (value,index) and making it a single list...	Haskell, taking a list of pairs (value,index) and making it a single list [Int] Haskell, taking a list of pairs (value,index) and making it a single list [Int] computer-science haskell functional-programming Haskell Haskell, taking a list of pairs (value,index) and making it a single list [Int] I am fairly new at Haske...	[ 0, 0.01422119140625, -0.0078125, 0.003082275390625, -0.0196533203125, 0.0211181640625, -0.03369140625, -0.00872802734375, 0.00506591796875, -0.0081787109375, 0.006988525390625, -0.019775390625, 0.0093994140625, 0.012939453125, -0.00787353515625, -0.00494384765625, 0.0289306640625, ...	[ 20625, 142508, 35971, 5303, 80836, 7, 27494, 13, 4711, 20662, 11001, 4153, 18, 13909, 175201, 1556, 123309, 28966, 136, 180663, 3525, 99, 31577, 86869, 2809, 5646, 158, 118435, 7565, 47, 27781, 2174, 1902, 5608, 30646, 6528, 5117, 12830, 83...	[ 0.1822509765625, 0.28076171875, 0.1033935546875, 0.233642578125, 0.2548828125, 0.115234375, 0.1787109375, 0.049713134765625, 0.225830078125, 0.06451416015625, 0.15625, 0.06317138671875, 0.10040283203125, 0.010040283203125, 0.032989501953125, 0.124755859375, 0.08978271484375, 0.0576...	embed
60929459_c0	60929459	haskell	0	Title: Similar functions applied to nested list in Haskell Problem title: Similar functions applied to nested list in Haskell Tags: haskell, list Problem: Similar functions applied to nested list in Haskell Here is the problem I encountered. I have some functions that are similar in their bodies (with a slightly differ...	Similar functions applied to nested list in Haskell Similar functions applied to nested list in Haskell haskell list Similar Haskell Similar functions applied to nested list in Haskell Here is the problem I encountered. I have some functions that are similar in their bodies (with a slightly difference), but they have s...	[ -0.0091552734375, 0.01214599609375, 0.007049560546875, 0.0179443359375, 0.006256103515625, 0.021484375, -0.002777099609375, -0.010498046875, 0.01397705078125, 0.0012664794921875, -0.0157470703125, -0.0322265625, 0.00958251953125, 0.0206298828125, -0.0255126953125, -0.0162353515625, -...	[ 209683, 32354, 190659, 47, 8512, 71, 5303, 20625, 142508, 1556, 2967, 190647, 3060, 621, 21373, 2363, 337, 34204, 161549, 60212, 1284, 765, 138256, 41206, 54, 25632, 18151, 36917, 43240, 149016, 8781, 42, 3917, 69307, 903, 105233, 10644, 6741...	[ 0.238525390625, 0.22021484375, 0.1181640625, 0.03863525390625, 0.2220458984375, 0.08697509765625, 0.19091796875, 0.120849609375, 0.2210693359375, 0.1192626953125, 0.06317138671875, 0.039093017578125, 0.0308837890625, 0.0301666259765625, 0.203125, 0.0160675048828125, 0.0662841796875, ...	embed
35280013_c0	35280013	haskell	0	Title: Printing two arguments Problem title: Printing two arguments Tags: haskell Problem: Printing two arguments I am trying to :load file "hello.hs" and keep getting the errors below. I am using WinGHCi 1.0.6. I have printed just one argument and it worked but when I try to print two arguments I get a Not in scope er...	Printing two arguments Printing two arguments haskell System.Environment Printing Not Main Getting Hello args1 hello.hs:6:37 hello.hs:7:13 hello.hs:7:50 Perhaps Printing two arguments I am trying to :load file "hello.hs" and keep getting the errors below. I am using WinGHCi 1.0.6. I have printed just one argument and i...	[ 0.005859375, 0.004669189453125, -0.00860595703125, 0.030517578125, 0.01123046875, 0.0286865234375, -0.00150299072265625, 0.01031494140625, -0.007568359375, -0.01312255859375, 0.0205078125, -0.032958984375, -0.0068359375, -0.0036163330078125, 0.006683349609375, 0.006103515625, 0.01611...	[ 39754, 214, 6626, 10750, 1556, 142508, 12353, 686, 1900, 11205, 12321, 210732, 35378, 79459, 418, 33600, 31, 127, 910, 30225, 966, 22618, 23837, 181799, 7, 31577, 63033, 11435, 13817, 5, 13695, 18499, 35064, 17368, 17686, 41877, 40658, 53855,...	[ 0.223388671875, 0.0193939208984375, 0.20654296875, 0.28662109375, 0.161376953125, 0.24560546875, 0.0804443359375, 0.0675048828125, 0.10296630859375, 0.1602783203125, 0.1080322265625, 0.028045654296875, 0.201904296875, 0.1744384765625, 0.03057861328125, 0.151123046875, 0.1644287109375...	embed
49808794_c0	49808794	haskell	0	Title: Inferred type in data declaration Problem title: Inferred type in data declaration Tags: type-inference, haskell Problem: Inferred type in data declaration On several occasions now I have run into trouble when trying to include a monadic action of an inferred type into an existing, explicitly typed data declarat...	Inferred type in data declaration Inferred type in data declaration type-inference haskell Inferred Thing Maybe Nothing Inferred type in data declaration On several occasions now I have run into trouble when trying to include a monadic action of an inferred type into an existing, explicitly typed data declaration: I do...	[ 0.005706787109375, -0.00408935546875, 0.01495361328125, 0.0177001953125, 0.0074462890625, 0.005828857421875, 0.01470947265625, 0.005035400390625, 0.006256103515625, -0.0174560546875, 0.012451171875, -0.0023193359375, -0.0203857421875, -0.0223388671875, 0.021240234375, -0.01416015625, ...	[ 360, 2875, 2822, 10644, 2053, 21635, 23, 73, 69988, 1556, 142508, 6003, 214, 83425, 182747, 40368, 46505, 63134, 26698, 2667, 11, 18403, 22631, 53498, 3934, 144573, 143726, 3444, 33022, 7565, 28484, 3525, 44457, 37842, 165523, 1528, 8180, 125...	[ 0.06622314453125, 0.197021484375, 0.1507568359375, 0.2127685546875, 0.1251220703125, 0.169921875, 0.021759033203125, 0.024200439453125, 0.160888671875, 0.1041259765625, 0.2008056640625, 0.0928955078125, 0.0452880859375, 0.1278076171875, 0.1317138671875, 0.0159454345703125, 0.03013610...	embed
19479911_c0	19479911	haskell	0	Title: Function giving slightly different answer than expected Problem title: Function giving slightly different answer than expected Tags: monads, haskell Problem: Function giving slightly different answer than expected I'm doing some monad stuff in Haskell and I wrote a function that calculates the probability of win...	Function giving slightly different answer than expected Function giving slightly different answer than expected monads haskell Function giving slightly different answer than expected I'm doing some monad stuff in Haskell and I wrote a function that calculates the probability of winning a gambling game given the game's ...	[ -0.0018768310546875, 0.004180908203125, 0.0089111328125, -0.02197265625, 0.00958251953125, 0.00445556640625, -0.00433349609375, -0.013916015625, 0.0029754638671875, -0.028564453125, 0.00885009765625, 0.006439208984375, 0.0087890625, 0.0023956298828125, 0.002593994140625, 0.006011962890...	[ 28670, 10763, 68772, 161549, 12921, 35166, 3501, 84751, 2667, 712, 1556, 142508, 20594, 41884, 23, 20625, 54397, 32354, 74481, 1636, 37242, 2481, 111, 69986, 208782, 6712, 34475, 51957, 53201, 43240, 1884, 108654, 40494, 68018, 30646, 159, 2151...	[ 0.1683349609375, 0.08294677734375, 0.147705078125, 0.258544921875, 0.251953125, 0.2369384765625, 0.1195068359375, 0.201171875, 0.114013671875, 0.156005859375, 0.1201171875, 0.25830078125, 0.021087646484375, 0.0423583984375, 0.0168609619140625, 0.1370849609375, 0.0672607421875, 0.19...	embed
43854235_c0	43854235	haskell	0	Title: Nix shell: How to list the installed Haskell package versions Problem title: Nix shell: How to list the installed Haskell package versions Tags: haskell, nix Problem: Nix shell: How to list the installed Haskell package versions As a non-nix'er I installed the newest version of https://github.com/reflex-frp/refl...	Nix shell: How to list the installed Haskell package versions Nix shell: How to list the installed Haskell package versions haskell nix Nix How Haskell Nix shell: How to list the installed Haskell package versions As a non-nix'er I installed the newest version of https://github.com/reflex-frp/reflex-platform . I think ...	[ -0.00494384765625, -0.00012969970703125, 0.00946044921875, 0.025634765625, -0.0035552978515625, 0.0250244140625, -0.0028076171875, -0.00628662109375, -0.012451171875, 0.016845703125, -0.0091552734375, -0.0216064453125, 0.0179443359375, 0.0106201171875, -0.0185546875, 0.021484375, 0.0...	[ 1520, 425, 128019, 11249, 5303, 20600, 297, 20625, 142508, 98169, 11389, 1556, 300, 351, 93, 15769, 32102, 44289, 7079, 254, 107, 172121, 20697, 26267, 16981, 3714, 11814, 903, 1663, 33, 334, 75101, 3173, 420, 38988, 9405, 5498, 12236, 2059...	[ 0.120361328125, 0.1663818359375, 0.2073974609375, 0.0275115966796875, 0.17626953125, 0.1866455078125, 0.027099609375, 0.11865234375, 0.239990234375, 0.1680908203125, 0.1683349609375, 0.07611083984375, 0.103515625, 0.0626220703125, 0.038726806640625, 0.0292816162109375, 0.107604980468...	embed
56393471_c0	56393471	haskell	0	Title: What does left arrow <- mean outside a do block? Problem title: What does left arrow <- mean outside a do block? Tags: guard-clause, haskell, pattern-guards, ghc Problem: What does left arrow <- mean outside a do block? I came across with the following code recently and it bothers me a lot lowerSafeForeign...	What does left arrow <- mean outside a do block? What does left arrow <- mean outside a do block? guard-clause haskell pattern-guards ghc What CmmForeignCall Block What does left arrow <- mean outside a do block? I came across with the following code recently and it bothers me a lot This piece of code is from htt...	[ 0.01019287109375, 0.039794921875, 0.0174560546875, -0.00286865234375, -0.003204345703125, 0.008056640625, -0.002166748046875, -0.0128173828125, 0.013427734375, -0.025634765625, 0.005645751953125, -0.002777099609375, -0.008544921875, -0.00830078125, 0.002349853515625, -0.01043701171875,...	[ 4865, 14602, 25737, 118201, 619, 1277, 9, 29459, 50782, 54, 46389, 74, 56050, 18347, 4032, 1556, 142508, 103510, 32116, 31380, 238, 313, 2276, 18537, 38529, 441, 5584, 80231, 4426, 10, 36880, 25632, 18151, 15044, 1314, 73720, 10557, 9969, 3...	[ 0.0634765625, 0.0261383056640625, 0.2159423828125, 0.277587890625, 0.07244873046875, 0.132568359375, 0.1646728515625, 0.155517578125, 0.2469482421875, 0.1431884765625, 0.22119140625, 0.00927734375, 0.2193603515625, 0.0914306640625, 0.09942626953125, 0.09112548828125, 0.213134765625, ...	embed
12712382_c1	12712382	haskell	1	<$> char '{' <*> scan 1 test where test :: Int -> Char -> Maybe Int test 0 _ = Nothing test i '}'= Just (i-1) test i '{' = Just (i+1) test i _ = Just i According to the profiler 58.7% of the time is spent in bracket, 19.6% in keyTo_id, 17.1% in main. Surely there's a better way to return bracketed terms unchanged if t...	<$> char '{' <*> scan 1 test where test :: Int -> Char -> Maybe Int test 0 _ = Nothing test i '}'= Just (i-1) test i '{' = Just (i+1) test i _ = Just i According to the profiler 58.7% of the time is spent in bracket, 19.6% in keyTo_id, 17.1% in main. Surely there's a better way to return bracketed terms unchanged if t...	[ -0.0196533203125, -0.010009765625, -0.0113525390625, -0.00921630859375, 0.006317138671875, 0.00830078125, 0.0147705078125, -0.00579833984375, 0.0159912109375, -0.006072998046875, 0.002288818359375, 0.0064697265625, 0.0040283203125, -0.00482177734375, 0.01220703125, -0.002410888671875, ...	[ 4369, 21441, 24854, 44954, 106, 3034, 360, 18, 21656, 83425, 757, 182747, 17, 9563, 14, 110218, 21748, 105609, 9318, 14427, 1733, 66933, 1620, 27853, 6529, 12187, 22799, 7763, 532, 7076, 13961, 5201, 11522, 3917, 30646, 69407, 152028, 2174, ...	[ 0.0718994140625, 0.2132568359375, 0.046173095703125, 0.19482421875, 0.06365966796875, 0.2261962890625, 0.05767822265625, 0.0809326171875, 0.158447265625, 0.2132568359375, 0.05987548828125, 0.145751953125, 0.1136474609375, 0.1334228515625, 0.031280517578125, 0.1231689453125, 0.1220703...	embed
52547909_c0	52547909	haskell	0	Title: custom higher order function invocation gives Non type-variable argument in the constraint error Problem title: custom higher order function invocation gives Non type-variable argument in the constraint error Tags: higher-order-functions, haskell Problem: custom higher order function invocation gives Non type-va...	custom higher order function invocation gives Non type-variable argument in the constraint error custom higher order function invocation gives Non type-variable argument in the constraint error higher-order-functions haskell Non times3 mapThenComputeV1 Main Num Use FlexibleContexts When custom higher order function inv...	[ -0.01416015625, 0.01141357421875, 0.015625, -0.0064697265625, 0.0189208984375, 0.0019683837890625, -0.0245361328125, 0.00469970703125, -0.00604248046875, -0.0419921875, -0.0107421875, -0.046630859375, 0.00823974609375, -0.000774383544921875, 0.0087890625, -0.02587890625, 0.0056457519...	[ 114122, 77546, 12989, 32354, 23, 202010, 76199, 3775, 10644, 21690, 2886, 10750, 158, 2816, 4288, 18499, 80596, 137175, 1556, 142508, 20028, 363, 22288, 6743, 856, 12321, 52782, 36836, 180842, 2661, 22829, 20625, 67125, 75935, 27781, 159029, 90...	[ 0.196044921875, 0.1541748046875, 0.21630859375, 0.177734375, 0.0552978515625, 0.180419921875, 0.06591796875, 0.170654296875, 0.2283935546875, 0.1551513671875, 0.08544921875, 0.22119140625, 0.06097412109375, 0.1739501953125, 0.110595703125, 0.1854248046875, 0.1929931640625, 0.121337...	embed
52688465_c0	52688465	haskell	0	Title: Haskell: cannot construct the infinite type Problem title: Haskell: cannot construct the infinite type Tags: haskell Problem: Haskell: cannot construct the infinite type I got a list of tuples (day:month) and want to find the month with the biggest amount of days. I made a function that accepts my list of tuples...	Haskell: cannot construct the infinite type Haskell: cannot construct the infinite type haskell Haskell y:ys Haskell: cannot construct the infinite type I got a list of tuples (day:month) and want to find the month with the biggest amount of days. I made a function that accepts my list of tuples and list of months (or ...	[ 0.00037384033203125, -0.00066375732421875, 0.02294921875, 0.0250244140625, -0.024658203125, -0.006378173828125, -0.0052490234375, 0.01007080078125, 0.01287841796875, -0.009765625, 0.0023651123046875, -0.0021820068359375, 0.0196533203125, -0.01263427734375, 0.0228271484375, -0.010681152...	[ 20625, 142508, 53418, 64549, 54241, 13, 10644, 1556, 113, 4778, 12, 70, 4163, 5303, 370, 99726, 5636, 15477, 3444, 7413, 31150, 678, 129058, 41170, 13312, 32354, 26946, 21775, 4879, 12765, 30646, 38132, 112474, 1632, 58735, 14922, 54397, 8781...	[ 0.141357421875, 0.22705078125, 0.183349609375, 0.2205810546875, 0.1763916015625, 0.06805419921875, 0.2181396484375, 0.1414794921875, 0.1009521484375, 0.10302734375, 0.0130615234375, 0.016143798828125, 0.009246826171875, 0.0919189453125, 0.0826416015625, 0.165283203125, 0.078186035156...	embed
21563428_c0	21563428	haskell	0	Title: Haskell syntax, parse errors for dummies Problem title: Haskell syntax, parse errors for dummies Tags: haskell, parsing, string, syntax Problem: Haskell syntax, parse errors for dummies today I read a lot about Haskell but this formating is driving me crazy. I want to understand my basic errors as soon as possib...	Haskell syntax, parse errors for dummies Haskell syntax, parse errors for dummies haskell parsing string syntax Haskell Haskell syntax, parse errors for dummies today I read a lot about Haskell but this formating is driving me crazy. I want to understand my basic errors as soon as possible so I can start coding normall...	[ 0.01141357421875, 0.02783203125, -0.037841796875, 0.011474609375, -0.000667572021484375, 0.03564453125, -0.0026702880859375, -0.00872802734375, 0.00628662109375, -0.0223388671875, 0.0126953125, -0.03515625, -0.0166015625, -0.020751953125, 0.0037689208984375, 0.01025390625, -0.0038604...	[ 20625, 142508, 6002, 86531, 366, 184, 18499, 100, 8473, 32747, 1556, 79315, 18925, 12301, 5915, 9384, 132442, 116666, 28219, 62822, 552, 3638, 32354, 3688, 5608, 30646, 4034, 11737, 125458, 48838, 27781, 4700, 38164, 6468, 1328, 162, 71, 8539...	[ 0.1273193359375, 0.238525390625, 0.122802734375, 0.164306640625, 0.1614990234375, 0.1163330078125, 0.2252197265625, 0.021209716796875, 0.1019287109375, 0.06182861328125, 0.1041259765625, 0.206298828125, 0.020538330078125, 0.01251220703125, 0.045379638671875, 0.1136474609375, 0.052429...	embed
71236676_c0	71236676	haskell	0	Title: Is it possible to program GPU in pure Haskell? Problem title: Is it possible to program GPU in pure Haskell? Tags: haskell-ffi, hardware-acceleration, gpu, haskell Problem: Is it possible to program GPU in pure Haskell? I wonder, whether I can write code, which ought to be evaluated by GPU, in pure Haskell. For ...	Is it possible to program GPU in pure Haskell? Is it possible to program GPU in pure Haskell? haskell-ffi hardware-acceleration gpu haskell GPU Haskell Is it possible to program GPU in pure Haskell? I wonder, whether I can write code, which ought to be evaluated by GPU, in pure Haskell. For example, a function for mult...	[ -0.00750732421875, 0.014404296875, 0.0177001953125, -0.007537841796875, 0.0020294189453125, 0.0064697265625, -0.00147247314453125, -0.0185546875, -0.00909423828125, -0.036376953125, -0.00909423828125, -0.0274658203125, -0.01177978515625, -0.0004367828369140625, 0.0019989013671875, 0.01...	[ 2071, 442, 7722, 47, 1528, 162808, 23, 34166, 20625, 142508, 32, 1556, 24500, 76407, 151932, 706, 1766, 32195, 36766, 831, 33022, 18151, 46526, 151575, 390, 32354, 100, 127664, 6626, 21334, 50944, 765, 2347, 31, 110, 5609, 93425, 13648, 117...	[ 0.079345703125, 0.104248046875, 0.216064453125, 0.095947265625, 0.243896484375, 0.301513671875, 0.1502685546875, 0.208740234375, 0.1771240234375, 0.306396484375, 0.008148193359375, 0.1348876953125, 0.151123046875, 0.07684326171875, 0.1212158203125, 0.0207977294921875, 0.1859130859375...	embed
75697510_c2	75697510	haskell	2	, directory-1.2.5.0, directory-1.2.4.0, directory-1.2.3.1, directory-1.2.3.0, directory-1.2.2.1, directory-1.2.2.0, directory-1.2.1.0, directory-1.2.0.1, directory-1.2.0.0, directory-1.1.0.2, directory-1.1.0.1, directory-1.1.0.0, directory-1.0.1.2, directory-1.0.1.1, Code signals: user, project, v2-install, v2-build, N...	, directory-1.2.5.0, directory-1.2.4.0, directory-1.2.3.1, directory-1.2.3.0, directory-1.2.2.1, directory-1.2.2.0, directory-1.2.1.0, directory-1.2.0.1, directory-1.2.0.0, directory-1.1.0.2, directory-1.1.0.1, directory-1.1.0.0, directory-1.0.1.2, directory-1.0.1.1, Code signals: user, project, v2-install, v2-build, N...	[ -0.0040283203125, -0.007293701171875, 0.021728515625, -0.00070953369140625, -0.0003662109375, -0.00151824951171875, -0.0196533203125, 0.022216796875, 0.01708984375, 0.03515625, -0.0081787109375, -0.0111083984375, -0.00848388671875, 0.01239013671875, 0.00927734375, 0.01470947265625, -...	[ 6, 4, 14364, 53, 9, 48400, 5, 187461, 151152, 97109, 132265, 68107, 73011, 102107, 102014, 99929, 92134, 133684, 83783, 28864, 26073, 7, 12, 38937, 13452, 81, 18504, 80383, 177149, 1520, 425, 7285, 39718, 18, 2852, 159065, 19309, 12321, 127...	[ 0.070068359375, 0.1197509765625, 0.22802734375, 0.1728515625, 0.099609375, 0.187255859375, 0.0982666015625, 0.2626953125, 0.217529296875, 0.15966796875, 0.16162109375, 0.1558837890625, 0.133056640625, 0.155029296875, 0.1900634765625, 0.189208984375, 0.1231689453125, 0.120361328125,...	embed
77675020_c0	77675020	haskell	0	Title: Factorial Creation in Haskell Problem title: Factorial Creation in Haskell Tags: haskell, factorial Problem: Factorial Creation in Haskell I was recently reading a paper where the defintion for a factorial is given as such: fac 0 = 1 fac (n + 1) = (n + 1) ∗ fac n I implemented the program from the paper as below...	Factorial Creation in Haskell Factorial Creation in Haskell haskell factorial Factorial Creation Haskell Integer Num Factorial.hs:5:6 Parse Factorial Creation in Haskell I was recently reading a paper where the defintion for a factorial is given as such: I implemented the program from the paper as below: I then tried t...	[ -0.0009002685546875, 0.01025390625, -0.005584716796875, 0.0206298828125, 0.024658203125, -0.0125732421875, -0.010986328125, -0.0135498046875, -0.01153564453125, -0.025146484375, 0.00148773193359375, -0.039794921875, -0.004791259765625, -0.004058837890625, -0.0016021728515625, -0.003585...	[ 117969, 15403, 15678, 2320, 20625, 142508, 23, 1556, 31461, 44401, 52782, 127, 12, 758, 910, 2392, 184, 16454, 15122, 45154, 29479, 1528, 35064, 37842, 4527, 10, 30700, 47644, 10644, 138256, 13648, 2967, 9790, 9969, 1340, 17368, 527, 73265, ...	[ 0.242919921875, 0.2139892578125, 0.1922607421875, 0.058349609375, 0.1605224609375, 0.270751953125, 0.0447998046875, 0.146728515625, 0.2208251953125, 0.1397705078125, 0.190673828125, 0.075439453125, 0.0380859375, 0.05706787109375, 0.1358642578125, 0.09796142578125, 0.053924560546875, ...	embed
6614023_c0	6614023	haskell	0	Title: A good way to avoid "sharing"? Problem title: A good way to avoid "sharing"? Tags: haskell, sharing Problem: A good way to avoid "sharing"? Suppose that someone would translate this simple Python code to Haskell: def important_astrological_calculation(digits): # Get the first 1000000 digits o...	A good way to avoid "sharing"? A good way to avoid "sharing"? haskell sharing important_astrological_calculation Get lucky_numbers calculate_first_digits_of_pi A good way to avoid "sharing"? Suppose that someone would translate this simple Python code to Haskell: Haskell version: After working with ...	[ -0.0093994140625, 0.026123046875, 0.00109100341796875, -0.0084228515625, -0.01373291015625, -0.0079345703125, -0.00616455078125, -0.015869140625, 0.01422119140625, -0.0306396484375, 0.00335693359375, 0.01611328125, -0.004486083984375, 0.010986328125, 0.01904296875, 0.02001953125, 0.0...	[ 4127, 3917, 47, 71864, 2420, 2852, 1556, 142508, 53371, 5526, 9297, 109622, 6827, 238, 72403, 20779, 138009, 2606, 1297, 7, 74481, 13448, 271, 4803, 14481, 4390, 1434, 3900, 19309, 8781, 145581, 18151, 20625, 11389, 20697, 77848, 27706, 10388...	[ 0.0804443359375, 0.051849365234375, 0.063232421875, 0.2227783203125, 0.2177734375, 0.193603515625, 0.11669921875, 0.2432861328125, 0.2381591796875, 0.1484375, 0.1234130859375, 0.103759765625, 0.076904296875, 0.07379150390625, 0.03265380859375, 0.0626220703125, 0.2393798828125, 0.17...	embed
68089246_c0	68089246	haskell	0	Title: What is the difference between AppTy and FunTy in Haskell Core type definitions? Problem title: What is the difference between AppTy and FunTy in Haskell Core type definitions? Tags: haskell Problem: What is the difference between AppTy and FunTy in Haskell Core type definitions? Reading Core Haskell Type , and ...	What is the difference between AppTy and FunTy in Haskell Core type definitions? What is the difference between AppTy and FunTy in Haskell Core type definitions? haskell What AppTy FunTy Haskell Core TyVar Type TyVarTy Application TyConApp TyCon Arrow ForAllTy Polymorphic LitTy TyLit NumTyLit Integer StrTyLit FastStrin...	[ 0.01531982421875, -0.002410888671875, -0.000682830810546875, 0.017578125, 0.00142669677734375, -0.002532958984375, -0.004913330078125, -0.0234375, -0.000056743621826171875, 0.0186767578125, 0.0135498046875, -0.048828125, 0.00116729736328125, 0.010009765625, -0.0030670166015625, 0.02172...	[ 60212, 17721, 5659, 618, 53, 136, 28670, 20625, 142508, 31365, 10644, 80934, 1556, 4865, 8064, 81827, 60457, 104921, 11935, 39179, 1172, 15555, 1326, 43512, 63306, 178851, 27668, 866, 217, 52782, 44401, 23351, 25290, 71713, 104951, 77947, 73342...	[ 0.1717529296875, 0.058837890625, 0.20947265625, 0.2203369140625, 0.241455078125, 0.0704345703125, 0.20263671875, 0.11376953125, 0.2222900390625, 0.1748046875, 0.171142578125, 0.1358642578125, 0.086669921875, 0.021392822265625, 0.1343994140625, 0.15869140625, 0.15869140625, 0.167480...	embed
31196449_c1	31196449	haskell	1	link(name = "fibonacci")] extern { fn fibonacci_hs (n : i32); // c_int = i32 fn fib_init (); // start hs rts fn fib_exit (); // kill hs rts } fn main () { unsafe { fib_init(); for i in 0..100 { println!("{:?}th fibonacci : {:?}", i, fibonacci_hs(i)); } fib_exit(); } } And I compile with rustc main.rs -L . (since shared...	link(name = "fibonacci")] extern { fn fibonacci_hs (n : i32); // c_int = i32 fn fib_init (); // start hs rts fn fib_exit (); // kill hs rts } fn main () { unsafe { fib_init(); for i in 0..100 { println!("{:?}th fibonacci : {:?}", i, fibonacci_hs(i)); } fib_exit(); } } And I compile with rustc main.rs -L . (since shared...	[ 0.0137939453125, 0.0137939453125, -0.0146484375, -0.003631591796875, -0.01007080078125, -0.01214599609375, 0.0020294189453125, -0.000621795654296875, -0.00677490234375, -0.04638671875, -0.0194091796875, -0.028564453125, 0.0042724609375, 0.016357421875, 0.008056640625, -0.0224609375, ...	[ 3126, 11627, 1029, 20990, 52544, 76714, 14783, 809, 127, 7, 19, 91887, 501, 4288, 2203, 6460, 275, 73, 217, 4034, 1096, 933, 13, 23399, 67153, 5201, 51, 115840, 17, 757, 3559, 28412, 927, 14, 9969, 1340, 678, 52648, 238, 4295, 866, 99...	[ 0.2459716796875, 0.107177734375, 0.140869140625, 0.1522216796875, 0.1759033203125, 0.2061767578125, 0.1175537109375, 0.175537109375, 0.0880126953125, 0.07061767578125, 0.0140533447265625, 0.189208984375, 0.0269775390625, 0.14599609375, 0.0003662109375, 0.197509765625, 0.10205078125, ...	embed
33839740_c1	33839740	haskell	1	to run the full game function War_Project_2.hs:138:46: Couldn't match expected type ‘[([Card], [Card])]’ with actual type ‘([Card], [Card]) -> [([Card], [Card])]’ Probable cause: ‘fullGame’ is applied to too few arguments In the second argument of ‘(:)’, namely ‘fullGame (r (x : xs, y : ys))’ In the expression: (x : x...	to run the full game function War_Project_2.hs:138:46: Couldn't match expected type ‘[([Card], [Card])]’ with actual type ‘([Card], [Card]) -> [([Card], [Card])]’ Probable cause: ‘fullGame’ is applied to too few arguments In the second argument of ‘(:)’, namely ‘fullGame (r (x : xs, y : ys))’ In the expression: (x : x...	[ -0.01397705078125, -0.0096435546875, -0.005950927734375, -0.006072998046875, 0.0012664794921875, -0.00078582763671875, -0.0166015625, -0.007720947265625, -0.0001697540283203125, 0.020751953125, 0.0194091796875, 0.025146484375, 0.0096435546875, -0.0024871826171875, -0.0230712890625, 0.0...	[ 47, 11675, 4393, 6712, 32354, 5550, 223353, 5442, 127, 141535, 32909, 191147, 18, 14858, 84751, 10644, 156119, 678, 8561, 1250, 275, 2886, 22304, 25724, 107576, 190659, 5792, 10846, 10750, 17932, 12, 42, 425, 1022, 113, 125195, 35315, 60075, ...	[ 0.047821044921875, 0.147216796875, 0.1971435546875, 0.1834716796875, 0.1717529296875, 0.1636962890625, 0.19482421875, 0.122802734375, 0.032745361328125, 0.0838623046875, 0.1011962890625, 0.1181640625, 0.0489501953125, 0.1993408203125, 0.1849365234375, 0.191162109375, 0.2186279296875,...	embed
27834510_c0	27834510	haskell	0	Title: Not in scope in Haskell Problem title: Not in scope in Haskell Tags: scope, winghci, haskell Problem: Not in scope in Haskell When I try to compile the code from http://michaeldadams.org/papers/scrap_your_zippers/ScrapYourZippers.hs I get: ScrapYourZipper.hs:249:15: Not in scope: type variable ‘hole’ ScrapYourZi...	Not in scope in Haskell Not in scope in Haskell scope winghci haskell Not Haskell ScrapYourZipper.hs:249:15 ScrapYourZipper.hs:251:27 ScrapYourZipper.hs:252:20 ScrapYourZipper.hs:252:25 Context CtxtNull CtxtCons Data Left Right Not in scope in Haskell When I try to compile the code from http://michaeldadams.org/papers/...	[ 0.01422119140625, 0.013671875, -0.0084228515625, 0.031494140625, -0.015869140625, 0.01611328125, -0.027099609375, 0.00016307830810546875, -0.0162353515625, -0.01470947265625, -0.0184326171875, -0.037109375, 0.0030059814453125, 0.0036468505859375, 0.0203857421875, -0.00604248046875, -...	[ 11205, 23, 70820, 20625, 142508, 14775, 127, 318, 1556, 219536, 23562, 60348, 8079, 1126, 12221, 42, 21224, 27592, 16619, 22829, 124326, 18444, 1181, 11935, 11809, 636, 2480, 90911, 9790, 9969, 1340, 18151, 1436, 109235, 6229, 1478, 74377, 13...	[ 0.2025146484375, 0.17724609375, 0.246826171875, 0.1544189453125, 0.236328125, 0.091552734375, 0.0457763671875, 0.0986328125, 0.140625, 0.1968994140625, 0.06866455078125, 0.164306640625, 0.2135009765625, 0.029144287109375, 0.06585693359375, 0.055938720703125, 0.0933837890625, 0.0602...	embed
28054481_c0	28054481	haskell	0	Title: Type-level unification and Value-level pattern-matching with Encapsulated types Problem title: Type-level unification and Value-level pattern-matching with Encapsulated types Tags: pattern-matching, unification, haskell Problem: Type-level unification and Value-level pattern-matching with Encapsulated types I'm ...	Type-level unification and Value-level pattern-matching with Encapsulated types Type-level unification and Value-level pattern-matching with Encapsulated types pattern-matching unification haskell Type-level Value-level Encapsulated Init Wrap WNil WCons Will XExistentialQuantification Type-level unification and Value-l...	[ 0.003082275390625, 0.00592041015625, -0.003631591796875, -0.0035552978515625, -0.01123046875, -0.0203857421875, -0.0159912109375, -0.0228271484375, 0.007415771484375, 0.00439453125, -0.004180908203125, -0.004119873046875, 0.022216796875, -0.004058837890625, 0.001739501953125, -0.003829...	[ 60457, 67919, 51, 41274, 136, 190060, 103510, 98753, 678, 357, 15644, 77593, 52895, 1556, 142508, 360, 217, 13631, 379, 5245, 20255, 1193, 19279, 1419, 80973, 173495, 18, 112892, 18929, 375, 77087, 2053, 10644, 2965, 18151, 2060, 31089, 86681...	[ 0.1785888671875, 0.1673583984375, 0.1610107421875, 0.1212158203125, 0.0111083984375, 0.1463623046875, 0.14599609375, 0.1534423828125, 0.0579833984375, 0.0380859375, 0.153076171875, 0.1519775390625, 0.15771484375, 0.0819091796875, 0.18505859375, 0.0241851806640625, 0.06781005859375, ...	embed
20730518_c0	20730518	haskell	0	Title: Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? Problem title: Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? Tags: haskell, monads Problem: Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? I’ve been playing with Haskell on and off for...	Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? haskell monads Haskell What Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? I’ve been playing with Haskell on and off for several years now; I’m q...	[ 0.019287109375, -0.000438690185546875, 0.0262451171875, 0.0086669921875, -0.00014400482177734375, 0.01513671875, 0.00494384765625, 0.003173828125, -0.010986328125, 0.0128173828125, -0.001007080078125, -0.019775390625, -0.01055908203125, 0.006103515625, 0.0002803802490234375, -0.0032653...	[ 20625, 142508, 2667, 712, 7, 12, 4865, 9351, 100, 2367, 9473, 132, 1230, 5386, 136, 1277, 54, 83, 1556, 30813, 1369, 16093, 2809, 75169, 678, 40368, 5369, 5036, 104577, 3642, 4488, 4527, 2856, 39933, 78690, 7464, 2301, 18, 3714, 22120, ...	[ 0.1522216796875, 0.2822265625, 0.1527099609375, 0.242431640625, 0.1434326171875, 0.046478271484375, 0.0633544921875, 0.1177978515625, 0.0673828125, 0.12060546875, 0.0645751953125, 0.0146484375, 0.07647705078125, 0.1632080078125, 0.19091796875, 0.06927490234375, 0.150634765625, 0.01...	embed
49415310_c0	49415310	haskell	0	Title: Using binary trees in Haskell - Trying to use paths Problem title: Using binary trees in Haskell - Trying to use paths Tags: binary-tree, list, haskell, branch Problem: Using binary trees in Haskell - Trying to use paths I'm struggling to go about this, so basically binary tree can be used as a database. Here, t...	Using binary trees in Haskell - Trying to use paths Using binary trees in Haskell - Trying to use paths binary-tree list haskell branch Using Haskell Trying Btree Data Branch Dir Path Error Using binary trees in Haskell - Trying to use paths I'm struggling to go about this, so basically binary tree can be used as a dat...	[ 0.02294921875, 0.0201416015625, -0.005157470703125, -0.000499725341796875, 0.035888671875, 0.018798828125, -0.0213623046875, -0.0228271484375, 0.003936767578125, -0.046875, -0.018310546875, -0.027099609375, -0.006591796875, 0.010986328125, -0.00689697265625, 0.016845703125, 0.0246582...	[ 345, 2394, 6635, 1360, 90, 20625, 142508, 40858, 4527, 60875, 23, 62600, 5303, 1556, 32845, 335, 11809, 21110, 19946, 108421, 212059, 7, 237875, 53201, 831, 11814, 237, 63399, 31358, 64633, 114141, 110, 2053, 104, 35735, 8337, 47, 95, 2407,...	[ 0.087890625, 0.187744140625, 0.1348876953125, 0.207763671875, 0.059478759765625, 0.1217041015625, 0.2318115234375, 0.09033203125, 0.1004638671875, 0.2017822265625, 0.008331298828125, 0.2425537109375, 0.1195068359375, 0.0950927734375, 0.05810546875, 0.0167694091796875, 0.0889892578125...	embed
59809488_c0	59809488	haskell	0	Title: How to get rid of annoying startup message from stack ghci? Problem title: How to get rid of annoying startup message from stack ghci? Tags: haskell-stack, haskell Problem: How to get rid of annoying startup message from stack ghci? I'm using stack ghci to start my REPL, based on the answer I got for my question...	How to get rid of annoying startup message from stack ghci? How to get rid of annoying startup message from stack ghci? haskell-stack haskell stack How How to get rid of annoying startup message from stack ghci? I'm using stack ghci to start my REPL, based on the answer I got for my question on how to import a module i...	[ -0.01544189453125, 0.01416015625, 0.00836181640625, 0.0194091796875, 0.0001964569091796875, -0.002838134765625, 0.009765625, -0.0030670166015625, -0.008056640625, -0.0299072265625, 0.00128936767578125, -0.014892578125, -0.0198974609375, 0.0185546875, -0.00152587890625, 0.011474609375, ...	[ 11249, 2046, 31351, 8668, 38543, 73882, 26008, 1295, 177261, 31380, 318, 1556, 142508, 590, 2594, 111, 17368, 4034, 9069, 21130, 24927, 88996, 20600, 678, 43240, 5885, 61475, 1631, 438, 4000, 30388, 58735, 111719, 26859, 110, 98169, 1274, 507...	[ 0.051239013671875, 0.0692138671875, 0.1392822265625, 0.1495361328125, 0.1044921875, 0.258056640625, 0.17724609375, 0.050933837890625, 0.2301025390625, 0.1273193359375, 0.176025390625, 0.092041015625, 0.1976318359375, 0.1231689453125, 0.12548828125, 0.055511474609375, 0.06646728515625...	embed
25452490_c1	25452490	haskell	1	see in parseArgs I'd like to bind the results of readFileEither to a lambda which continues to parses the arguments & file data. The value within the result of readFileEither is an Either String String . Since the result of parseArgs' is Either String Parameters I'd like to use Either 's monadic bind to bind the lambd...	see in parseArgs I'd like to bind the results of readFileEither to a lambda which continues to parses the arguments & file data. The value within the result of readFileEither is an Either String String . Since the result of parseArgs' is Either String Parameters I'd like to use Either 's monadic bind to bind the lambd...	[ -0.01446533203125, 0.00445556640625, -0.01141357421875, -0.0034637451171875, 0.007049560546875, 0.03369140625, 0.005401611328125, -0.024658203125, 0.0196533203125, -0.000659942626953125, -0.003692626953125, -0.045166015625, -0.0159912109375, -0.004547119140625, -0.00153350830078125, 0....	[ 1957, 366, 184, 7614, 9405, 1884, 68557, 50339, 12301, 174350, 647, 14, 9319, 47, 21, 6492, 85, 136622, 5908, 10750, 619, 11435, 2053, 34292, 28032, 16750, 4565, 23351, 214, 1720, 29089, 2667, 11, 18403, 107730, 17780, 10422, 10336, 9969, ...	[ 0.1563720703125, 0.116943359375, 0.0654296875, 0.154052734375, 0.179931640625, 0.057525634765625, 0.197998046875, 0.1456298828125, 0.1785888671875, 0.1820068359375, 0.0259552001953125, 0.07061767578125, 0.26904296875, 0.044952392578125, 0.030120849609375, 0.187744140625, 0.138671875,...	embed
31318755_c0	31318755	haskell	0	Title: What is the common workflow of using cabal for personal project? Problem title: What is the common workflow of using cabal for personal project? Tags: cabal, haskell Problem: What is the common workflow of using cabal for personal project? Assume I want to creat my own local library called MyLib , my workflow is...	What is the common workflow of using cabal for personal project? What is the common workflow of using cabal for personal project? cabal haskell cabal MyLib What MyLib.hs What is the common workflow of using cabal for personal project? Assume I want to creat my own local library called MyLib , my workflow is: So my ques...	[ -0.0004749298095703125, -0.000766754150390625, -0.00128936767578125, 0.0201416015625, -0.0181884765625, -0.007720947265625, -0.01031494140625, 0.014892578125, 0.004058837890625, -0.0283203125, 0.0022430419921875, -0.0162353515625, 0.0111083984375, 0.01214599609375, 0.0003070831298828125,...	[ 4865, 39210, 4488, 118664, 17368, 109524, 100, 3357, 13452, 1556, 142508, 2646, 104820, 5, 127, 7, 66596, 3444, 48107, 10002, 4000, 35773, 1294, 9655, 759, 213850, 5809, 11522, 5974, 408, 3571, 43882, 11728, 5612, 4527, 24927, 15700, 37202, ...	[ 0.048675537109375, 0.1656494140625, 0.13330078125, 0.257568359375, 0.138916015625, 0.2978515625, 0.100341796875, 0.1524658203125, 0.1329345703125, 0.097900390625, 0.194091796875, 0.1671142578125, 0.276123046875, 0.01446533203125, 0.1292724609375, 0.050262451171875, 0.0245513916015625...	embed
55421297_c0	55421297	haskell	0	Title: Haskell High Order Functions, Function Declaration Problem title: Haskell High Order Functions, Function Declaration Tags: function, type-declaration, haskell Problem: Haskell High Order Functions, Function Declaration I am studying for an exam and I'm confused at this function. Based on the output how do I know...	Haskell High Order Functions, Function Declaration Haskell High Order Functions, Function Declaration function type-declaration haskell Haskell High Order Functions Declaration x:xs y:ys Haskell High Order Functions, Function Declaration I am studying for an exam and I'm confused at this function. Based on the output h...	[ 0.01336669921875, 0.006256103515625, -0.0054931640625, 0.00372314453125, -0.002197265625, 0.013916015625, -0.0113525390625, -0.0198974609375, 0.00994873046875, 0.0128173828125, 0.004150390625, -0.012939453125, -0.01422119140625, -0.01397705078125, -0.009521484375, 0.0035858154296875, ...	[ 20625, 142508, 19694, 81206, 28670, 10763, 98501, 1363, 32354, 10644, 50718, 320, 1556, 1022, 12, 425, 7, 113, 4778, 35187, 42276, 55681, 99, 903, 140992, 3714, 21635, 83, 11, 33079, 876, 501, 151575, 28219, 11192, 12989, 23, 29459, 5646, ...	[ 0.1322021484375, 0.22119140625, 0.1666259765625, 0.216552734375, 0.1622314453125, 0.0780029296875, 0.211669921875, 0.017852783203125, 0.200439453125, 0.2139892578125, 0.1019287109375, 0.1510009765625, 0.1256103515625, 0.03369140625, 0.036834716796875, 0.0589599609375, 0.027587890625,...	embed
16880577_c0	16880577	haskell	0	Title: What's the history behind the Functor type class? Problem title: What's the history behind the Functor type class? Tags: haskell, category-theory, functor Problem: What's the history behind the Functor type class? I'm trying to gain a really deep understanding of the Monad hierarchy of classes. Part of...	What's the history behind the Functor type class? What's the history behind the Functor type class? haskell category-theory functor What Functor Monad Applicatives What's the history behind the Functor type class? I'm trying to gain a really deep understanding of the Monad hierarchy of classes. Part of that i...	[ 0.0086669921875, 0.011962890625, 0.0078125, 0.01513671875, 0.0184326171875, 0.00159454345703125, -0.000018596649169921875, -0.020263671875, -0.000904083251953125, -0.0208740234375, -0.006866455078125, -0.0537109375, -0.00579833984375, 0.00946044921875, -0.013916015625, 0.00656127929687...	[ 4865, 3768, 32692, 50155, 28670, 18770, 10644, 18507, 7, 1556, 142508, 95487, 2347, 7477, 60331, 71, 5659, 11048, 42991, 70, 100094, 1791, 147, 7668, 61112, 86681, 27781, 6097, 5117, 134053, 98365, 28219, 91, 21449, 1672, 61475, 29806, 17780,...	[ 0.0538330078125, 0.067138671875, 0.169677734375, 0.1627197265625, 0.23046875, 0.250244140625, 0.2191162109375, 0.2308349609375, 0.004791259765625, 0.1002197265625, 0.239501953125, 0.1400146484375, 0.050506591796875, 0.159912109375, 0.225341796875, 0.2257080078125, 0.1962890625, 0.2...	embed
26098313_c0	26098313	haskell	0	Title: How can I test whether integers from one list are divisible by integers from another? Problem title: How can I test whether integers from one list are divisible by integers from another? Tags: list, haskell Problem: How can I test whether integers from one list are divisible by integers from another? I'm trying ...	How can I test whether integers from one list are divisible by integers from another? How can I test whether integers from one list are divisible by integers from another? list haskell one another How addl::Int y:ys Couldn How can I test whether integers from one list are divisible by integers from another? I'm trying ...	[ -0.0294189453125, 0.0008697509765625, 0.0089111328125, -0.01092529296875, -0.01446533203125, 0.01080322265625, 0.005401611328125, -0.00848388671875, 0.013427734375, -0.0218505859375, 0.0230712890625, -0.00927734375, 0.01263427734375, 0.0181884765625, -0.019775390625, -0.0186767578125, ...	[ 11249, 831, 87, 3034, 36766, 892, 26255, 1295, 1632, 5303, 621, 45, 99017, 390, 15700, 1556, 142508, 15190, 141, 4153, 18, 113, 4778, 191147, 19, 31577, 28282, 32354, 51776, 360, 653, 472, 111, 91, 30646, 10554, 756, 101935, 106, 4426, ...	[ 0.0650634765625, 0.073486328125, 0.0338134765625, 0.228271484375, 0.1051025390625, 0.159423828125, 0.138916015625, 0.126953125, 0.0650634765625, 0.1854248046875, 0.03387451171875, 0.1136474609375, 0.216064453125, 0.10382080078125, 0.1275634765625, 0.045440673828125, 0.155029296875, ...	embed
37900415_c0	37900415	haskell	0	Title: Passing a source with ExceptT to a sink Problem title: Passing a source with ExceptT to a sink Tags: conduit, haskell Problem: Passing a source with ExceptT to a sink Given a conduit source with following type signature: sourceMsg :: MonadIO m => ExceptT Err (ConduitM () ByteString m) () how can it be passed to ...	Passing a source with ExceptT to a sink Passing a source with ExceptT to a sink conduit haskell Passing ExceptT MonadIO Err ConduitM ByteString Data.Conduit.List.mapM_ Either mapM_ Warning Couldn Expected Source Actual Passing a source with ExceptT to a sink Given a conduit source with following type signature: how can...	[ 0.01031494140625, 0.025390625, -0.0014495849609375, 0.009521484375, 0.00445556640625, 0.00982666015625, 0.00010442733764648438, 0.004241943359375, -0.00225830078125, -0.03271484375, 0.0042724609375, -0.0264892578125, 0.0302734375, 0.0150146484375, 0.002593994140625, 0.00049591064453125...	[ 28872, 31344, 678, 218288, 618, 47, 880, 92, 120565, 1556, 142508, 60331, 17780, 1004, 1657, 112061, 594, 3311, 67, 71713, 11809, 154663, 62346, 22288, 454, 5550, 191147, 60075, 13, 89829, 77641, 100582, 25632, 10644, 138256, 3642, 831, 11508...	[ 0.1263427734375, 0.2021484375, 0.007965087890625, 0.2117919921875, 0.1839599609375, 0.075439453125, 0.1566162109375, 0.0870361328125, 0.2120361328125, 0.075439453125, 0.2021484375, 0.076416015625, 0.1365966796875, 0.0631103515625, 0.051513671875, 0.1531982421875, 0.13037109375, 0.0...	embed
52973009_c1	52973009	haskell	1	If I use existential type classes, I could get away with making both Test and Suite derive "Node_" and then have Suite own a List of said Node s. Coproducts would allow something similar, where I'd essentially do the same Either strategy without the verbosity of the tags. Allow me to expand now with a more complex exa...	If I use existential type classes, I could get away with making both Test and Suite derive "Node_" and then have Suite own a List of said Node s. Coproducts would allow something similar, where I'd essentially do the same Either strategy without the verbosity of the tags. Allow me to expand now with a more complex exa...	[ -0.016845703125, 0.002349853515625, 0.0013427734375, -0.01409912109375, 0.01043701171875, -0.015869140625, 0.010498046875, -0.009033203125, 0.042724609375, 0.0130615234375, -0.007049560546875, -0.0130615234375, -0.0267333984375, 0.012939453125, 0.0048828125, -0.0006256103515625, -0.0...	[ 4527, 99707, 15403, 10644, 61112, 5809, 16065, 20662, 8647, 136, 74899, 122, 5844, 5021, 112, 454, 10002, 32036, 438, 91, 1311, 57877, 7, 63769, 85590, 5701, 4565, 9319, 113857, 15490, 57823, 69141, 27140, 27781, 50339, 109921, 831, 40101, ...	[ 0.037506103515625, 0.1737060546875, 0.08740234375, 0.2049560546875, 0.1822509765625, 0.0164947509765625, 0.0982666015625, 0.009613037109375, 0.179931640625, 0.01971435546875, 0.214111328125, 0.0546875, 0.045501708984375, 0.1214599609375, 0.1239013671875, 0.034942626953125, 0.12194824...	embed
29089117_c0	29089117	haskell	0	Title: Haskell new line not working Problem title: Haskell new line not working Tags: newline, haskell Problem: Haskell new line not working Been messing around for about 20 minutes now trying to get the new line working however it always shows in GHCI as a single line. Here is what I enter into GHCi: displayFilm ("Sky...	Haskell new line not working Haskell new line not working newline haskell Haskell Skyfall Daniel Craig Judi Dench Ralph Fiennes Bill Olga Zoe Paula Megan Sam Wally Cast Year Fans x:xs Film Haskell new line not working Been messing around for about 20 minutes now trying to get the new line working however it always show...	[ 0.01446533203125, -0.0216064453125, 0.0157470703125, 0.0084228515625, -0.00958251953125, 0.01239013671875, 0.017578125, -0.00006961822509765625, -0.0034332275390625, 0.0260009765625, -0.0067138671875, -0.048828125, 0.004150390625, -0.0025177001953125, -0.0235595703125, 0.020263671875, ...	[ 20625, 142508, 3525, 13315, 959, 20697, 2256, 1556, 17689, 9146, 11555, 156201, 31625, 1575, 206, 179322, 563, 58258, 7, 19893, 129695, 5880, 13, 73212, 26842, 3362, 23706, 53, 32301, 42552, 105426, 425, 3847, 163, 38001, 10932, 387, 14633, ...	[ 0.17822265625, 0.3037109375, 0.165283203125, 0.2509765625, 0.05560302734375, 0.189697265625, 0.1822509765625, 0.1539306640625, 0.167724609375, 0.2685546875, 0.116455078125, 0.20361328125, 0.157470703125, 0.1119384765625, 0.14599609375, 0.123779296875, 0.028289794921875, 0.156005859...	embed
77413933_c1	77413933	haskell	1	to modify this (for example, we probably want deriving Eq on the Weekday data type). An attempt to solve this problem might look like import Data.Time.Calendar (Day, fromGregorian, dayOfWeek) {- Get all [Mondays\|Tuesdays\|..\|Sundays] in the month -} allWeekdayOfMonth :: DayOfWeek -> Integer -> Int -> [Day] allWeekdayOf...	to modify this (for example, we probably want deriving Eq on the Weekday data type). An attempt to solve this problem might look like import Data.Time.Calendar (Day, fromGregorian, dayOfWeek) {- Get all [Mondays\|Tuesdays\|..\|Sundays] in the month -} allWeekdayOfMonth :: DayOfWeek -> Integer -> Int -> [Day] allWeekdayOf...	[ 0.00982666015625, -0.007720947265625, 0.00738525390625, -0.0086669921875, -0.0203857421875, 0.0107421875, -0.009521484375, 0.00191497802734375, 0.0022125244140625, -0.01416015625, 0.004425048828125, 0.025146484375, -0.01092529296875, 0.0179443359375, 0.00066375732421875, -0.00066375732...	[ 2811, 40383, 903, 31895, 3444, 16406, 6496, 241, 864, 98, 58417, 5636, 2053, 10644, 81887, 86869, 2967, 13648, 24927, 11809, 70059, 94553, 33, 1506, 97141, 1295, 91127, 519, 9893, 5155, 132887, 12137, 343, 20779, 756, 46674, 15665, 66279, 2...	[ 0.1383056640625, 0.128173828125, 0.03509521484375, 0.037445068359375, 0.04949951171875, 0.12158203125, 0.08447265625, 0.055419921875, 0.204345703125, 0.012298583984375, 0.1788330078125, 0.1922607421875, 0.1419677734375, 0.1593017578125, 0.09588623046875, 0.109619140625, 0.13220214843...	embed
7928005_c1	7928005	haskell	1	of f(f(a)), it will be recomputed rather than taken from the second list item because the state has changed. I also realize I could avoid this in my real-life application by putting my accumulating list inside the state. Nevertheless, there are two reasons for posting this. First, the point is that iterate is frequent...	of f(f(a)), it will be recomputed rather than taken from the second list item because the state has changed. I also realize I could avoid this in my real-life application by putting my accumulating list inside the state. Nevertheless, there are two reasons for posting this. First, the point is that iterate is frequent...	[ 0.0011749267578125, -0.025146484375, 0.01373291015625, 0.0191650390625, -0.01275634765625, 0.0281982421875, 0.0020599365234375, 0.0198974609375, 0.026123046875, -0.000469207763671875, 0.014892578125, 0.0023956298828125, 0.00439453125, 0.0233154296875, -0.00244140625, 0.00494384765625, ...	[ 111, 1238, 132, 420, 11, 442, 1221, 186, 33844, 65970, 297, 43257, 39958, 1295, 17932, 5303, 35735, 6637, 11341, 1556, 98816, 92154, 71864, 2773, 24804, 38415, 183278, 1916, 46132, 70, 6626, 89397, 75220, 17, 8560, 67, 195409, 189050, 1239,...	[ 0.1114501953125, 0.122802734375, 0.03759765625, 0.121826171875, 0.10302734375, 0.01385498046875, 0.060150146484375, 0.041656494140625, 0.110107421875, 0.193115234375, 0.05279541015625, 0.03790283203125, 0.0888671875, 0.036102294921875, 0.1241455078125, 0.1754150390625, 0.136474609375...	embed
10286301_c0	10286301	haskell	0	Title: Overlapping instances error for Yesod and EclipseFP application Problem title: Overlapping instances error for Yesod and EclipseFP application Tags: eclipse-fp, eclipse, haskell, yesod Problem: Overlapping instances error for Yesod and EclipseFP application I created an application with EclipseFP, the yesod appl...	Overlapping instances error for Yesod and EclipseFP application Overlapping instances error for Yesod and EclipseFP application eclipse-fp eclipse haskell yesod Overlapping Yesod EclipseFP What Here Could OverlappingInstances Use Failed Prelude Overlapping instances error for Yesod and EclipseFP application I created a...	[ 0.006378173828125, 0.00701904296875, 0.0052490234375, -0.0152587890625, -0.01129150390625, 0.0216064453125, -0.0108642578125, -0.00750732421875, -0.006103515625, -0.0299072265625, -0.00799560546875, -0.0294189453125, -0.001861572265625, 0.01171875, 0.0024566650390625, -0.00698852539062...	[ 9578, 143, 26783, 110527, 7, 18499, 32635, 2199, 136, 234962, 51006, 38415, 106371, 184, 420, 254, 1556, 142508, 2422, 23722, 11853, 191147, 116071, 36836, 190355, 297, 1914, 822, 75935, 678, 1810, 16530, 53550, 9790, 11675, 24931, 5, 127, ...	[ 0.139404296875, 0.2218017578125, 0.15625, 0.2210693359375, 0.01226806640625, 0.169677734375, 0.1241455078125, 0.212158203125, 0.0631103515625, 0.2099609375, 0.2095947265625, 0.124267578125, 0.1607666015625, 0.1004638671875, 0.06304931640625, 0.09619140625, 0.0772705078125, 0.210937...	embed
27667546_c1	27667546	haskell	1	Action (Action c) = c -- Make an Action out of a Pure liftComp :: Computation a -> Computation a liftComp (Pure c) = Action $ return . c liftComp a@(Action _) = a So the only missing part is the givesPure function and I'm not sure if it's even possible to implement it. I once had an implementation like this: givesPure ...	Action (Action c) = c -- Make an Action out of a Pure liftComp :: Computation a -> Computation a liftComp (Pure c) = Action $ return . c liftComp a@(Action _) = a So the only missing part is the givesPure function and I'm not sure if it's even possible to implement it. I once had an implementation like this: givesPure ...	[ -0.03271484375, 0.012451171875, 0.0184326171875, 0.00061798095703125, -0.0013885498046875, 0.033203125, 0.001190185546875, -0.0045166015625, 0.003387451171875, -0.0184326171875, -0.0172119140625, 0.01287841796875, -0.001220703125, 0.025634765625, 0.0021209716796875, 0.00579833984375, ...	[ 57945, 284, 10763, 501, 2203, 26176, 1810, 111, 118233, 60520, 108161, 1984, 159415, 2320, 10, 683, 3408, 3650, 30646, 981, 101, 4734, 132283, 2831, 76199, 32354, 9077, 3853, 7722, 29479, 24145, 208124, 1884, 903, 876, 2460, 929, 1238, 83, ...	[ 0.23486328125, 0.137451171875, 0.171630859375, 0.1531982421875, 0.0621337890625, 0.1004638671875, 0.08935546875, 0.0435791015625, 0.23388671875, 0.2310791015625, 0.21044921875, 0.008148193359375, 0.1864013671875, 0.083984375, 0.0859375, 0.1229248046875, 0.23095703125, 0.07458496093...	embed
73120032_c0	73120032	haskell	0	Title: Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? Problem title: Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? Tags: hackage, ffi, haskell, c, c-preprocessor Problem: Haskell FFI includes: is there a difference ...	Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? hackage ffi haskell c c-preprocessor Haskell FFI xx.hs stdio.h HsFFI.h qhull_ra.h Haskell FFI includes: is there a differe...	[ 0.017578125, 0.0033111572265625, -0.00823974609375, -0.0031890869140625, -0.0145263671875, -0.01239013671875, 0.0081787109375, 0.00013446807861328125, -0.006805419921875, 0.006622314453125, 0.017578125, -0.0205078125, -0.006927490234375, 0.0118408203125, -0.000946044921875, -0.00172424...	[ 20625, 142508, 563, 22724, 96853, 83, 2685, 10, 60212, 17721, 26719, 1277, 52219, 5, 127, 7, 5386, 136, 41502, 85526, 4588, 24500, 1556, 501, 4692, 63923, 113664, 6138, 5670, 572, 30110, 568, 8096, 63758, 219, 4488, 18151, 765, 959, 59121...	[ 0.1182861328125, 0.2076416015625, 0.09027099609375, 0.2080078125, 0.2164306640625, 0.004547119140625, 0.00970458984375, 0.0216522216796875, 0.19140625, 0.078857421875, 0.269287109375, 0.05023193359375, 0.1883544921875, 0.1300048828125, 0.176025390625, 0.154052734375, 0.06671142578125...	embed
6528770_c0	6528770	haskell	0	Title: Haskell typeclass hierarchy issue Problem title: Haskell typeclass hierarchy issue Tags: typeclass, haskell Problem: Haskell typeclass hierarchy issue I have a scenario that involves type classes and I'm not quite sure how to go about solving it. I have class Event a where timestamp :: a -> UTCTime rawData :: a ...	Haskell typeclass hierarchy issue Haskell typeclass hierarchy issue typeclass haskell Haskell Event UTCTime ByteString Something SomethingElse Haskell typeclass hierarchy issue I have a scenario that involves type classes and I'm not quite sure how to go about solving it. I have In my code, I want to create an object t...	[ -0.00103759765625, 0.0064697265625, 0.004119873046875, 0.0146484375, -0.014892578125, 0.004913330078125, -0.010498046875, 0.0020599365234375, 0.00860595703125, -0.02197265625, -0.00726318359375, -0.03564453125, 0.0004673004150390625, 0.01116943359375, -0.01708984375, -0.0234375, -0.0...	[ 20625, 142508, 10644, 67413, 1791, 147, 7668, 31089, 1556, 36943, 99577, 70059, 3311, 67, 71713, 200905, 7623, 87, 106117, 83687, 61112, 9077, 3115, 6496, 765, 18151, 3444, 28282, 36746, 29479, 15044, 136, 24233, 50218, 70, 32354, 9844, 3871,...	[ 0.1375732421875, 0.22509765625, 0.2059326171875, 0.245849609375, 0.1378173828125, 0.15869140625, 0.1165771484375, 0.1656494140625, 0.1270751953125, 0.1824951171875, 0.12109375, 0.1295166015625, 0.0452880859375, 0.045166015625, 0.09344482421875, 0.1700439453125, 0.15283203125, 0.009...	embed
68117958_c0	68117958	haskell	0	Title: VS Code Haskell extension - Couldn't figure out what GHC version the project is using Problem title: VS Code Haskell extension - Couldn't figure out what GHC version the project is using Tags: visual-studio-code, haskell-stack, haskell Problem: VS Code Haskell extension - Couldn't figure out what GHC v...	VS Code Haskell extension - Couldn't figure out what GHC version the project is using VS Code Haskell extension - Couldn't figure out what GHC version the project is using visual-studio-code haskell-stack haskell Haskell Couldn GHC metadata.json package.yaml README.md ResistorColors.hs stack.yaml Tests.hs VS ...	[ 0.000797271728515625, 0.02392578125, 0.0086669921875, 0.0142822265625, 0.00555419921875, -0.0025482177734375, -0.0341796875, 0.00830078125, -0.0211181640625, -0.006927490234375, -0.010498046875, -0.034912109375, -0.0000782012939453125, 0.0081787109375, -0.00872802734375, 0.011108398437...	[ 44160, 28864, 20625, 142508, 111938, 191147, 3768, 18, 26366, 1810, 2367, 527, 73265, 11389, 13452, 83, 17368, 21176, 52629, 40899, 1556, 23550, 10135, 170, 1681, 98169, 14520, 141, 188300, 54686, 9624, 164, 78457, 127, 177261, 8647, 9803, 26...	[ 0.1845703125, 0.199951171875, 0.1246337890625, 0.22412109375, 0.1485595703125, 0.05780029296875, 0.0186309814453125, 0.0214996337890625, 0.1390380859375, 0.059173583984375, 0.072998046875, 0.1278076171875, 0.223876953125, 0.1776123046875, 0.1412353515625, 0.0262908935546875, 0.110473...	embed
36090261_c0	36090261	haskell	0	Title: Hoogle and yesod - how to easily find functions in non-default packages Problem title: Hoogle and yesod - how to easily find functions in non-default packages Tags: haskell, ghci, hoogle, terminal, yesod Problem: Hoogle and yesod - how to easily find functions in non-default packages I installed hoogle, using st...	Hoogle and yesod - how to easily find functions in non-default packages Hoogle and yesod - how to easily find functions in non-default packages haskell ghci hoogle terminal yesod Hoogle MonadHandler Text Warning Unknown Hoogle and yesod - how to easily find functions in non-default packages I installed hoogle, using st...	[ -0.021240234375, 0.0013580322265625, 0.00148773193359375, 0.0185546875, -0.0255126953125, 0.02001953125, 0.0034942626953125, -0.0244140625, -0.0030517578125, -0.026611328125, -0.00970458984375, -0.058837890625, -0.0037841796875, -0.010009765625, 0.006011962890625, -0.01226806640625, ...	[ 152488, 133, 136, 2422, 23722, 3642, 72546, 7413, 32354, 23, 351, 214810, 98169, 1556, 142508, 31380, 318, 28994, 33949, 60331, 71, 135679, 603, 24129, 5550, 69723, 20600, 177261, 831, 33938, 100, 17368, 75101, 1884, 903, 1295, 74855, 14364, ...	[ 0.20263671875, 0.25927734375, 0.0740966796875, 0.1253662109375, 0.2039794921875, 0.05206298828125, 0.15673828125, 0.1776123046875, 0.2164306640625, 0.09503173828125, 0.16015625, 0.220458984375, 0.1923828125, 0.07403564453125, 0.1851806640625, 0.0888671875, 0.147216796875, 0.1760253...	embed
23840774_c0	23840774	haskell	0	Title: haskell how to print when function doesn't return IO monad? Problem title: haskell how to print when function doesn't return IO monad? Tags: haskell, io, monads Problem: haskell how to print when function doesn't return IO monad? I following type and monad based on it: data Err a = Ok a \| Bad String de...	haskell how to print when function doesn't return IO monad? haskell how to print when function doesn't return IO monad? haskell io monads Err Bad Read Show Ord Monad Functor Stm State s:_ PrintStmt haskell how to print when function doesn't return IO monad? I following type and monad based on it: I've also fu...	[ -0.0225830078125, -0.0057373046875, -0.004364013671875, 0.00299072265625, 0.0213623046875, 0.0048828125, -0.0009307861328125, -0.0272216796875, -0.01385498046875, -0.003814697265625, 0.010498046875, -0.051025390625, 0.003173828125, -0.00836181640625, 0.009765625, -0.01031494140625, -...	[ 1556, 142508, 3642, 47, 28412, 3229, 32354, 22027, 3768, 18, 30646, 17780, 2667, 712, 22995, 1004, 42, 12745, 4764, 17367, 35379, 60331, 71, 28670, 18770, 2907, 39, 22836, 39754, 37455, 25632, 10644, 35509, 162, 420, 49119, 3564, 18499, 142...	[ 0.110595703125, 0.2080078125, 0.09368896484375, 0.05889892578125, 0.236083984375, 0.1685791015625, 0.187744140625, 0.160400390625, 0.0628662109375, 0.1727294921875, 0.1961669921875, 0.2078857421875, 0.12255859375, 0.1749267578125, 0.19970703125, 0.044189453125, 0.008544921875, 0.11...	embed
22008198_c1	22008198	haskell	1	return value like "finished" or whatever. The explanation should be in very basic, practical, plain-spoken, matter of fact terms, spoken in an almost unsophisticated or juvenile way. The explanation should not focus on how it does what it does, why it does what it does, or what goes on inside this operator or operator...	return value like "finished" or whatever. The explanation should be in very basic, practical, plain-spoken, matter of fact terms, spoken in an almost unsophisticated or juvenile way. The explanation should not focus on how it does what it does, why it does what it does, or what goes on inside this operator or operator...	[ -0.004119873046875, 0.00775146484375, 0.0159912109375, 0.02880859375, -0.0022125244140625, 0.0191650390625, -0.01446533203125, -0.0341796875, 0.0015411376953125, -0.00013828277587890625, 0.02001953125, -0.0019378662109375, -0.005126953125, -0.01123046875, 0.0169677734375, 0.00799560546...	[ 30646, 34292, 1884, 48310, 67175, 89778, 581, 187136, 5608, 186, 23, 4552, 62822, 138155, 111719, 11955, 26866, 15824, 69407, 113091, 146459, 959, 32153, 3642, 14602, 15400, 46132, 39933, 4527, 12665, 136, 6044, 27781, 35133, 36716, 26785, 1883...	[ 0.230712890625, 0.2340087890625, 0.1220703125, 0.1934814453125, 0.198486328125, 0.046142578125, 0.04559326171875, 0.28857421875, 0.114501953125, 0.023101806640625, 0.011199951171875, 0.00323486328125, 0.138427734375, 0.162353515625, 0.040985107421875, 0.054779052734375, 0.03439331054...	embed
7349186_c0	7349186	haskell	0	Title: Why is [1..n] not handled the same way as [n..1] in Haskell? Problem title: Why is [1..n] not handled the same way as [n..1] in Haskell? Tags: haskell, list Problem: Why is [1..n] not handled the same way as [n..1] in Haskell? I was trying to solve a problem that required the maximum value of a list after being ...	Why is [1..n] not handled the same way as [n..1] in Haskell? Why is [1..n] not handled the same way as [n..1] in Haskell? haskell list Why n..1 Haskell a..b Prelude.maximum foldl1 Why is [1..n] not handled the same way as [n..1] in Haskell? I was trying to solve a problem that required the maximum value of a list after...	[ -0.015625, -0.009521484375, 0.0166015625, -0.00173187255859375, -0.00970458984375, 0.02099609375, 0.00286865234375, -0.0283203125, 0.0026397705078125, 0.005126953125, 0.004852294921875, -0.006500244140625, -0.00115203857421875, 0.0098876953125, 0.013671875, -0.00823974609375, 0.01611...	[ 44084, 83, 68252, 5, 19, 959, 34831, 71, 5701, 3917, 237, 76172, 20625, 142508, 23, 1556, 5303, 653, 418, 10, 275, 1914, 822, 112, 192, 53950, 316, 18344, 20469, 86869, 2967, 56065, 38132, 34292, 291, 645, 32354, 37457, 1295, 47, 876, ...	[ 0.12890625, 0.034912109375, 0.1434326171875, 0.06671142578125, 0.140380859375, 0.1116943359375, 0.146484375, 0.050140380859375, 0.0748291015625, 0.0606689453125, 0.05157470703125, 0.09918212890625, 0.1549072265625, 0.249267578125, 0.044830322265625, 0.1318359375, 0.1810302734375, 0...	embed
42589612_c1	42589612	haskell	1	ActionF s) a } deriving (Functor, Applicative, Monad) liftActionF :: ActionF s next -> Action s next liftActionF = Action . liftF instance MonadState s (Action s) where state = liftActionF . StateAction . state liftAction :: Action AppState a -> Action s a liftAction = liftActionF . LiftAction execApp :: Action AppStat...	ActionF s) a } deriving (Functor, Applicative, Monad) liftActionF :: ActionF s next -> Action s next liftActionF = Action . liftF instance MonadState s (Action s) where state = liftActionF . StateAction . state liftAction :: Action AppState a -> Action s a liftAction = liftActionF . LiftAction execApp :: Action AppStat...	[ -0.01904296875, 0.0003948211669921875, -0.004974365234375, -0.01116943359375, -0.01104736328125, 0.000507354736328125, -0.0172119140625, -0.00445556640625, 0.0024871826171875, -0.00081634521484375, 0.0186767578125, 0.0147705078125, -0.01470947265625, 0.02880859375, -0.0174560546875, -0...	[ 57945, 919, 91, 10, 51912, 16406, 6496, 97249, 18770, 5659, 11048, 4935, 60331, 71, 60520, 284, 10763, 1984, 11737, 33079, 2203, 5, 110527, 135206, 13, 7440, 11341, 22836, 166562, 1119, 3240, 39179, 618, 17780, 22631, 42822, 81437, 47, 9506...	[ 0.296630859375, 0.258056640625, 0.1629638671875, 0.10888671875, 0.0628662109375, 0.1982421875, 0.18701171875, 0.1644287109375, 0.169921875, 0.1517333984375, 0.1529541015625, 0.1282958984375, 0.185791015625, 0.13037109375, 0.26025390625, 0.12060546875, 0.2274169921875, 0.05050659179...	embed
33065965_c0	33065965	haskell	0	Title: Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? Problem title: Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? Tags: haskell, agda, idris, type-theory, dependent-type ...	Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? haskell agda idris type-theory dependent-type Dependent But List SortedList De...	[ 0.000591278076171875, 0.0106201171875, 0.00090789794921875, -0.005096435546875, -0.0106201171875, -0.0093994140625, -0.01043701171875, 0.00592041015625, 0.01513671875, -0.00677490234375, -0.0167236328125, -0.001953125, 0.00640869140625, 0.015869140625, -0.00144195556640625, -0.00212097...	[ 262, 26885, 660, 52895, 831, 23534, 18151, 83, 26785, 1257, 47, 29458, 2320, 4966, 3642, 54, 398, 1556, 142508, 1377, 85, 3679, 10644, 2347, 30675, 108750, 50986, 32036, 53666, 297, 154663, 935, 27983, 200316, 3917, 2886, 33657, 1528, 37170...	[ 0.1485595703125, 0.2144775390625, 0.146240234375, 0.2587890625, 0.05377197265625, 0.195068359375, 0.1695556640625, 0.073486328125, 0.1961669921875, 0.081298828125, 0.09539794921875, 0.218017578125, 0.09588623046875, 0.08392333984375, 0.063232421875, 0.033660888671875, 0.0360412597656...	embed
24236244_c0	24236244	haskell	0	Title: Using `Maybe` with Data Constructor Problem title: Using `Maybe` with Data Constructor Tags: haskell Problem: Using `Maybe` with Data Constructor I'm working on implementing a todo command-line app in Haskell. Thanks for Learn You a Haskell for the challenge. In particular, I'm curious about my Action data const...	Using `Maybe` with Data Constructor Using `Maybe` with Data Constructor haskell Using Maybe Data Constructor Action Add View Delete Just None Not Using `Maybe` with Data Constructor I'm working on implementing a todo command-line app in Haskell. Thanks for Learn You a Haskell for the challenge. In particular, I'm curio...	[ -0.0244140625, -0.00067138671875, 0.0107421875, 0.0076904296875, 0.01104736328125, 0.0213623046875, 0.0074462890625, 0.000843048095703125, -0.0030364990234375, -0.006195068359375, -0.0033111572265625, -0.0274658203125, 0.0196533203125, 0.00421142578125, -0.01318359375, -0.0104370117187...	[ 345, 6953, 9473, 82419, 372, 678, 11809, 82084, 18770, 1556, 142508, 83425, 57945, 29117, 29805, 262, 46485, 9563, 438, 11205, 20697, 29479, 1973, 75101, 2256, 4027, 20625, 134031, 2583, 66801, 193844, 2053, 64549, 748, 189085, 198343, 10644, ...	[ 0.1517333984375, 0.0894775390625, 0.007049560546875, 0.2249755859375, 0.26611328125, 0.142822265625, 0.15771484375, 0.2249755859375, 0.1895751953125, 0.108154296875, 0.2108154296875, 0.349365234375, 0.240966796875, 0.1165771484375, 0.2413330078125, 0.1192626953125, 0.181884765625, ...	embed
20769183_c0	20769183	haskell	0	Title: `cabal update` failed due to `out of memory` Problem title: `cabal update` failed due to `out of memory` Tags: haskell, haskell-platform, cabal Problem: `cabal update` failed due to `out of memory` Here is what cabal update outputs: Downloading the latest package list from hackage.haskell.org cabal: out of memor...	`cabal update` failed due to `out of memory` `cabal update` failed due to `out of memory` haskell haskell-platform cabal hackage.haskell.org version Downloading index.cache index.tar.gz index.tar Cabal `cabal update` failed due to `out of memory` Here is what cabal update outputs: The reason may be shortage of memory. ...	[ 0.00579833984375, 0.0177001953125, 0.0191650390625, 0.0103759765625, 0.01025390625, 0.0069580078125, -0.0267333984375, 0.01806640625, 0.004638671875, 0.01177978515625, 0.01422119140625, -0.045654296875, -0.00162506103515625, 0.01202392578125, 0.032470703125, 0.0034942626953125, 0.025...	[ 408, 3571, 28350, 165523, 4743, 47, 6056, 111, 98323, 1556, 142508, 172121, 109524, 85526, 4588, 10557, 1478, 11389, 4857, 63262, 5, 1430, 867, 177, 30438, 289, 11853, 140992, 31635, 1543, 186, 16610, 4865, 46741, 7227, 4711, 831, 7026, 725...	[ 0.156494140625, 0.25244140625, 0.2183837890625, 0.206787109375, 0.104736328125, 0.0220184326171875, 0.21826171875, 0.186767578125, 0.221435546875, 0.115478515625, 0.2098388671875, 0.103515625, 0.28857421875, 0.1669921875, 0.1202392578125, 0.07904052734375, 0.0703125, 0.086242675781...	embed
45735186_c0	45735186	haskell	0	Title: Where can I see how Haskell modules have been restructured? Problem title: Where can I see how Haskell modules have been restructured? Tags: haskell Problem: Where can I see how Haskell modules have been restructured? Since the recent update of Haskell on my system, I'm getting numerous import errors. For exampl...	Where can I see how Haskell modules have been restructured? Where can I see how Haskell modules have been restructured? haskell Data.List.Split Data.String.Utils Where Haskell Crypto Enigma.hs:64:1 Could Use Enigma.hs:70:1 Where can I see how Haskell modules have been restructured? Since the recent update of Haskell on...	[ -0.01202392578125, 0.00732421875, 0.0023040771484375, 0.0125732421875, 0.00531005859375, 0.035400390625, 0.004791259765625, -0.0022735595703125, 0.00714111328125, 0.0279541015625, -0.0031890869140625, -0.044921875, 0.0213623046875, 0.004730224609375, 0.006439208984375, -0.0005416870117...	[ 78662, 831, 1957, 3642, 20625, 142508, 88996, 7, 765, 2809, 456, 137656, 71, 87, 1556, 11809, 154663, 4353, 71713, 106742, 7870, 201543, 357, 872, 192, 127, 13307, 19721, 191147, 36836, 5757, 17309, 28350, 5426, 183851, 24927, 18499, 3687, ...	[ 0.042236328125, 0.0672607421875, 0.14697265625, 0.05145263671875, 0.1488037109375, 0.266845703125, 0.2088623046875, 0.04705810546875, 0.0404052734375, 0.04412841796875, 0.123291015625, 0.2347412109375, 0.0899658203125, 0.003814697265625, 0.116455078125, 0.07037353515625, 0.0660400390...	embed
49156644_c0	49156644	haskell	0	Title: How to use assocs with HashMap in Haskell Problem title: How to use assocs with HashMap in Haskell Tags: dictionary, haskell Problem: How to use assocs with HashMap in Haskell Currently I'm trying to use the Map's assocs method, but unable to figure out how to get it to work for a HashMap. For a regular Map the ...	How to use assocs with HashMap in Haskell How to use assocs with HashMap in Haskell dictionary haskell qualified How HashMap Haskell Data.Map M.fromList M.assocs M.lookup Data.HashMap.Lazy Not How to use assocs with HashMap in Haskell Currently I'm trying to use the Map's assocs method, but unable to figure out how to ...	[ -0.0230712890625, -0.009033203125, 0.009521484375, 0.01708984375, 0.00433349609375, -0.00213623046875, 0.00958251953125, -0.0009918212890625, 0.003936767578125, -0.044189453125, -0.01202392578125, -0.016845703125, 0.002532958984375, 0.005828857421875, 0.017578125, -0.010498046875, -0...	[ 11249, 4527, 63927, 4439, 678, 162087, 166179, 20625, 142508, 23, 10763, 1556, 217225, 11809, 276, 161063, 154663, 73395, 64747, 2037, 6495, 1495, 2729, 3285, 11205, 42719, 55300, 4488, 20324, 25632, 43240, 5885, 9790, 18, 24927, 35782, 18499, ...	[ 0.0231475830078125, 0.129638671875, 0.199462890625, 0.225341796875, 0.09625244140625, 0.1871337890625, 0.2283935546875, 0.1357421875, 0.2239990234375, 0.0273590087890625, 0.05615234375, 0.1282958984375, 0.163330078125, 0.059814453125, 0.1123046875, 0.06085205078125, 0.06689453125, ...	embed
66506311_c1	66506311	haskell	1	basic basic.hs [1 of 1] Compiling Main ( basic.hs, basic.o ) basic.hs:4:5: error: • Could not deduce (MultiAgentEnvironment e s a0) from the context: MultiAgentEnvironment e s a bound by the type signature for: baseState :: forall e s a. MultiAgentEnvironment e s a => e -> s at basic.hs:4:5-23 The type variable ‘a0’ i...	basic basic.hs [1 of 1] Compiling Main ( basic.hs, basic.o ) basic.hs:4:5: error: • Could not deduce (MultiAgentEnvironment e s a0) from the context: MultiAgentEnvironment e s a bound by the type signature for: baseState :: forall e s a. MultiAgentEnvironment e s a => e -> s at basic.hs:4:5-23 The type variable ‘a0’ i...	[ -0.0230712890625, -0.00127410888671875, 0.0024871826171875, 0.028076171875, -0.00086212158203125, 0.0079345703125, -0.0306396484375, 0.003326416015625, -0.017822265625, -0.007720947265625, -0.021240234375, -0.0244140625, -0.00665283203125, 0.00787353515625, -0.01544189453125, -0.015441...	[ 62822, 127, 7, 15612, 49725, 12321, 5, 31, 617, 758, 18499, 768, 191147, 959, 8, 106357, 50657, 118, 284, 46825, 7768, 686, 1900, 674, 28, 91, 10, 77495, 1295, 43701, 19335, 99091, 10644, 138256, 3647, 135206, 100, 5584, 33079, 37620, 7...	[ 0.226806640625, 0.138916015625, 0.1019287109375, 0.1048583984375, 0.16259765625, 0.1268310546875, 0.001220703125, 0.1153564453125, 0.0845947265625, 0.1123046875, 0.15380859375, 0.001434326171875, 0.1549072265625, 0.0814208984375, 0.14892578125, 0.1929931640625, 0.10125732421875, 0....	embed
67551971_c0	67551971	haskell	0	Title: create a haskell function that returns the definition of a Haskell function that implements the expression Problem title: create a haskell function that returns the definition of a Haskell function that implements the expression Tags: haskell Problem: create a haskell function that returns the definition of a Ha...	create a haskell function that returns the definition of a Haskell function that implements the expression create a haskell function that returns the definition of a Haskell function that implements the expression haskell Haskell Exp Num Integer OpExp Plus Times Minus Lib create a haskell function that returns the defi...	[ 0.0235595703125, -0.0059814453125, -0.00860595703125, 0.0244140625, 0.001495361328125, 0.0301513671875, 0.00775146484375, -0.008544921875, -0.00138092041015625, 0.002777099609375, -0.0033111572265625, -0.01446533203125, 0.00982666015625, 0.00970458984375, 0.003875732421875, 0.008544921...	[ 28282, 1556, 142508, 32354, 30646, 80934, 20625, 29479, 125195, 60075, 52782, 44401, 2331, 19279, 254, 8183, 19114, 24169, 43278, 450, 25632, 2053, 10644, 1884, 18151, 51776, 9351, 136, 134381, 70541, 77336, 707, 53, 27781, 31577, 163846, 3584,...	[ 0.10107421875, 0.1396484375, 0.252197265625, 0.210205078125, 0.165283203125, 0.18505859375, 0.1363525390625, 0.1802978515625, 0.2279052734375, 0.2137451171875, 0.1339111328125, 0.094482421875, 0.0841064453125, 0.1002197265625, 0.0948486328125, 0.1141357421875, 0.1146240234375, 0.15...	embed
58211077_c1	58211077	haskell	1	the function such that the type of the arguments matches up with the resulting function type. In an impredicative system, the type being substituted may be any type whatsoever, including a type that is itself polymorphic; thus append can be applied to pairs of lists with elements of any type—even to lists of polymorph...	the function such that the type of the arguments matches up with the resulting function type. In an impredicative system, the type being substituted may be any type whatsoever, including a type that is itself polymorphic; thus append can be applied to pairs of lists with elements of any type—even to lists of polymorph...	[ -0.005340576171875, 0.0047607421875, 0.01513671875, 0.004180908203125, 0.015869140625, 0.03759765625, -0.00970458984375, 0.0067138671875, 0.016357421875, -0.00885009765625, 0.03076171875, -0.031982421875, -0.0189208984375, -0.005462646484375, 0.00396728515625, -0.018798828125, 0.0185...	[ 70, 32354, 6044, 10644, 10750, 7, 14858, 90, 1257, 678, 16750, 73340, 18601, 4935, 5426, 8035, 161740, 297, 1543, 186, 2499, 2367, 68034, 35874, 178851, 1771, 114689, 71, 831, 190659, 80836, 5303, 80854, 63306, 8780, 23, 46876, 39456, 83, ...	[ 0.00091552734375, 0.1824951171875, 0.08447265625, 0.260986328125, 0.2086181640625, 0.016815185546875, 0.11328125, 0.00250244140625, 0.0140380859375, 0.0164031982421875, 0.03277587890625, 0.1929931640625, 0.22705078125, 0.1326904296875, 0.189208984375, 0.0146484375, 0.1951904296875, ...	embed
14333570_c0	14333570	haskell	0	Title: How to properly optimize MArray functions for speed? Problem title: How to properly optimize MArray functions for speed? Tags: haskell, marray, performance, ghc, arrays Problem: How to properly optimize MArray functions for speed? I'm working on a sorting library for MArrays . Speed is important, so I want to op...	How to properly optimize MArray functions for speed? How to properly optimize MArray functions for speed? haskell marray performance ghc arrays How MArray How to properly optimize MArray functions for speed? I'm working on a sorting library for MArrays . Speed is important, so I want to optimize it as much as possible....	[ 0.0111083984375, 0.0037994384765625, 0.0186767578125, -0.01904296875, -0.020263671875, -0.00811767578125, -0.007293701171875, -0.022705078125, 0.021728515625, 0.006195068359375, 0.0003986358642578125, 0.00457763671875, 0.01141357421875, -0.01177978515625, -0.01422119140625, -0.01586914...	[ 11249, 155965, 15572, 20650, 9267, 42, 7092, 32354, 7, 100, 38352, 1556, 142508, 1108, 23718, 31380, 238, 10298, 4778, 47, 20697, 12096, 214, 35773, 1294, 16461, 63349, 5526, 3444, 42856, 5881, 57339, 1257, 18151, 209, 20028, 154186, 351, 1...	[ 0.0875244140625, 0.1370849609375, 0.2174072265625, 0.10986328125, 0.078125, 0.1031494140625, 0.318603515625, 0.2213134765625, 0.0662841796875, 0.0556640625, 0.2098388671875, 0.10186767578125, 0.2271728515625, 0.1160888671875, 0.1468505859375, 0.05615234375, 0.05596923828125, 0.1120...	embed
23882519_c0	23882519	haskell	0	Title: Applicative something operator in Haskell Problem title: Applicative something operator in Haskell Tags: haskell, javascript Problem: Applicative something operator in Haskell I've been trying to implement a Promise in Haskell based on some JavaScript videos. While I already did it like this data Promise a = Pen...	Applicative something operator in Haskell Applicative something operator in Haskell haskell javascript Applicative Haskell Promise PendingPromise ResolvedPromise BrokenPromise Show Future Just Applicative something operator in Haskell I've been trying to implement a Promise in Haskell based on some JavaScript videos. W...	[ 0.0004367828369140625, 0.01434326171875, -0.00628662109375, 0.0272216796875, 0.01416015625, 0.0238037109375, 0.00848388671875, -0.007781982421875, 0.000026226043701171875, -0.018798828125, -0.006439208984375, -0.02490234375, 0.0137939453125, 0.00933837890625, 0.00372314453125, -0.02453...	[ 5659, 11048, 4935, 9844, 39933, 20625, 142508, 23, 1556, 136951, 1250, 5453, 4267, 6238, 10752, 86918, 13177, 1098, 17367, 94724, 9563, 31577, 29479, 35509, 17925, 21930, 21771, 442, 1884, 903, 149016, 18507, 58735, 14432, 55300, 3853, 11522, ...	[ 0.148193359375, 0.202392578125, 0.12890625, 0.171142578125, 0.266845703125, 0.151123046875, 0.2310791015625, 0.0350341796875, 0.1453857421875, 0.1497802734375, 0.173583984375, 0.2220458984375, 0.1611328125, 0.1285400390625, 0.1595458984375, 0.1785888671875, 0.1295166015625, 0.09350...	embed
25262734_c1	25262734	haskell	1	3 total), using -N1) SPARKS: 11 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 11 fizzled) INIT time 0.00s ( 0.00s elapsed) MUT time 10.13s ( 10.13s elapsed) GC time 0.11s ( 0.11s elapsed) EXIT time 0.00s ( 0.00s elapsed) Total time 10.25s ( 10.25s elapsed) Alloc rate 266,683,731 bytes per MUT second Productivity 98.9% of ...	3 total), using -N1) SPARKS: 11 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 11 fizzled) INIT time 0.00s ( 0.00s elapsed) MUT time 10.13s ( 10.13s elapsed) GC time 0.11s ( 0.11s elapsed) EXIT time 0.00s ( 0.00s elapsed) Total time 10.25s ( 10.25s elapsed) Alloc rate 266,683,731 bytes per MUT second Productivity 98.9% of ...	[ -0.02490234375, 0.010986328125, -0.0115966796875, -0.019287109375, 0.0098876953125, -0.01318359375, -0.01434326171875, -0.004119873046875, -0.005401611328125, -0.0179443359375, 0.0052490234375, -0.01129150390625, 0.001068115234375, -0.007476806640625, 0.00408935546875, 0.002685546875, ...	[ 138, 3622, 247, 17368, 20, 839, 17727, 159, 60436, 20113, 12, 534, 22085, 117176, 71, 757, 645, 118664, 297, 115, 69657, 17148, 169, 6259, 16, 87, 157684, 1733, 6, 37509, 7, 127966, 276, 17632, 4068, 2681, 107754, 418, 29426, 6371, 15, ...	[ 0.1998291015625, 0.1575927734375, 0.0286102294921875, 0.140625, 0.0816650390625, 0.126220703125, 0.1436767578125, 0.0252838134765625, 0.2208251953125, 0.194580078125, 0.04541015625, 0.091552734375, 0.037109375, 0.1727294921875, 0.0379638671875, 0.0869140625, 0.055419921875, 0.12634...	embed
39182947_c0	39182947	haskell	0	Title: Haskell Pipes and testing with HSpec Problem title: Haskell Pipes and testing with HSpec Tags: hspec, haskell, haskell-pipes Problem: Haskell Pipes and testing with HSpec I have written a program for a project that uses Pipes, which I love! I'm struggling to unit test my code however. I have a series of function...	Haskell Pipes and testing with HSpec Haskell Pipes and testing with HSpec hspec haskell haskell-pipes Haskell Pipes HSpec Pipe Out Person Unknown Show Classification Friend Foe Undecided Alex Bob How Haskell Pipes and testing with HSpec I have written a program for a project that uses Pipes, which I love! I'm strugglin...	[ 0.0029449462890625, -0.013427734375, -0.00787353515625, 0.012451171875, -0.029296875, 0.004638671875, -0.01275634765625, -0.02197265625, -0.01190185546875, -0.00714111328125, 0.003936767578125, 0.0062255859375, 0.005828857421875, -0.00102996826171875, 0.0012359619140625, 0.00244140625,...	[ 20625, 142508, 93128, 90, 136, 134234, 678, 39718, 47107, 1096, 16711, 1556, 1434, 13569, 13, 13538, 15270, 992, 69723, 17367, 237777, 128938, 9572, 79912, 104024, 20984, 25027, 11249, 765, 59121, 1528, 100, 13452, 4527, 3129, 87, 5161, 38, ...	[ 0.1695556640625, 0.2467041015625, 0.2242431640625, 0.1636962890625, 0.0853271484375, 0.25732421875, 0.134033203125, 0.1602783203125, 0.265380859375, 0.1142578125, 0.2099609375, 0.14892578125, 0.16357421875, 0.013427734375, 0.130126953125, 0.2127685546875, 0.109619140625, 0.03063964...	embed
27414511_c0	27414511	haskell	0	Title: Applying multiplication across lists in haskell list comprehension Problem title: Applying multiplication across lists in haskell list comprehension Tags: list-comprehension, haskell Problem: Applying multiplication across lists in haskell list comprehension haskell noob here. I'm doing Learn you a Haskell and c...	Applying multiplication across lists in haskell list comprehension Applying multiplication across lists in haskell list comprehension list-comprehension haskell a Applying Num Possible Applying multiplication across lists in haskell list comprehension haskell noob here. I'm doing Learn you a Haskell and came across thi...	[ -0.033203125, 0.0169677734375, 0.01348876953125, 0.004791259765625, 0.005126953125, 0.025634765625, 0.003662109375, 0.0111083984375, 0.0037689208984375, -0.00994873046875, -0.0118408203125, -0.00860595703125, 0.00604248046875, -0.003387451171875, -0.0277099609375, -0.0224609375, 0.00...	[ 5659, 538, 127664, 1363, 36880, 5303, 7, 1556, 142508, 46683, 3220, 23, 4692, 52782, 115861, 110, 3522, 134031, 398, 20625, 2967, 456, 5429, 22904, 28960, 9969, 34759, 1909, 12225, 163, 31895, 31577, 48716, 26548, 15700, 36663, 195625, 5844, ...	[ 0.1177978515625, 0.111083984375, 0.198486328125, 0.07000732421875, 0.2047119140625, 0.2003173828125, 0.060791015625, 0.1317138671875, 0.2017822265625, 0.0947265625, 0.099365234375, 0.0113525390625, 0.08416748046875, 0.0960693359375, 0.093505859375, 0.00732421875, 0.0736083984375, 0...	embed
27824509_c0	27824509	haskell	0	Title: ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists Problem title: ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists Tags: cabal, haskell Problem: ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists I've ju...	ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists cabal haskell package.conf.inplace Configuring creatur-wains-4.1.1 Building dist-sandbox-5cb45741 ghc-pkg: cannot create: dist/dist-sandbox-XXXXXX...	[ 0.0107421875, 0.0045166015625, 0.0244140625, -0.0081787109375, -0.006591796875, -0.0213623046875, -0.0018768310546875, 0.016845703125, -0.0015869140625, -0.01177978515625, -0.0021820068359375, -0.002227783203125, 0.004425048828125, -0.01507568359375, 0.0084228515625, 0.017333984375, ...	[ 31380, 238, 254, 8517, 53418, 28282, 45, 271, 46295, 43882, 11728, 205378, 29102, 4588, 70547, 73, 23935, 21771, 32316, 109524, 1556, 142508, 98169, 59994, 48107, 474, 634, 5425, 11565, 83783, 104919, 10342, 4633, 16360, 116086, 71, 615, 4015...	[ 0.1383056640625, 0.1224365234375, 0.013824462890625, 0.19482421875, 0.1405029296875, 0.159912109375, 0.118408203125, 0.146240234375, 0.168701171875, 0.1279296875, 0.213134765625, 0.1456298828125, 0.1900634765625, 0.022125244140625, 0.186767578125, 0.061676025390625, 0.1474609375, 0...	embed
46303752_c1	46303752	haskell	1	evalQ x y) [1 ..] where lastUnique (x0:x1:xs) \| x0 == x1 = x0 \| otherwise = lastUnique (x1:xs) evalQ :: Int -> Int -> Int -> [Int] evalQ x y n = startEvalMemo . startEvalMemoT $ fqmon x y n fqmon :: Int -> Int -> Int -> MemoQV [Int] fqmon _ _ 0 = return [0,0,0,0] fqmon x y n = do let pts = neighbours (x, y) let v = for...	evalQ x y) [1 ..] where lastUnique (x0:x1:xs) \| x0 == x1 = x0 \| otherwise = lastUnique (x1:xs) evalQ :: Int -> Int -> Int -> [Int] evalQ x y n = startEvalMemo . startEvalMemoT $ fqmon x y n fqmon :: Int -> Int -> Int -> MemoQV [Int] fqmon _ _ 0 = return [0,0,0,0] fqmon x y n = do let pts = neighbours (x, y) let v = for...	[ -0.0291748046875, 0.01263427734375, 0.005828857421875, -0.0115966796875, 0.006195068359375, -0.0166015625, 0.0284423828125, -0.002349853515625, 0.0228271484375, -0.018310546875, 0.00738525390625, 0.02783203125, 0.038818359375, -0.003570556640625, -0.0177001953125, -0.0030059814453125, ...	[ 28, 1405, 2737, 1022, 113, 16, 68252, 1468, 7440, 4568, 1062, 45602, 2389, 12, 82825, 425, 69112, 418, 120262, 360, 18, 653, 4034, 647, 6696, 432, 618, 3650, 1238, 864, 3796, 17443, 31, 856, 30646, 63527, 2633, 27037, 108, 6958, 38648, ...	[ 0.1220703125, 0.253173828125, 0.2232666015625, 0.1142578125, 0.1842041015625, 0.008026123046875, 0.014129638671875, 0.0311279296875, 0.044891357421875, 0.1641845703125, 0.075927734375, 0.2408447265625, 0.108642578125, 0.006927490234375, 0.06878662109375, 0.07989501953125, 0.023605346...	embed
5735544_c0	5735544	haskell	0	Title: How to convert a Date to an Int in Haskell Problem title: How to convert a Date to an Int in Haskell Tags: haskell, date Problem: How to convert a Date to an Int in Haskell I'm having a bit of a problem with converting the output of these functions below to an Int date :: IO (Integer,Int,Int) date = getCurrentTi...	How to convert a Date to an Int in Haskell How to convert a Date to an Int in Haskell haskell date How Date Haskell Integer How to convert a Date to an Int in Haskell I'm having a bit of a problem with converting the output of these functions below to an Int Basically I want to take the output from either (not fussed w...	[ -0.00909423828125, -0.0014495849609375, -0.005767822265625, 0.015625, 0.007568359375, 0.0191650390625, -0.01953125, 0.00811767578125, 0.00189971923828125, -0.019287109375, -0.032958984375, -0.00970458984375, 0.005035400390625, 0.0196533203125, 0.0096435546875, -0.0106201171875, -0.01...	[ 11249, 47, 96760, 10, 25512, 142, 360, 18, 23, 20625, 142508, 1556, 5622, 44401, 4785, 2967, 140992, 6097, 32354, 35064, 3444, 5646, 40101, 57574, 4989, 7722, 15504, 3934, 38396, 387, 17357, 21553, 8337, 10680, 617, 73419, 25, 163406, 15770...	[ 0.08331298828125, 0.131591796875, 0.1864013671875, 0.060455322265625, 0.2437744140625, 0.10498046875, 0.1824951171875, 0.223876953125, 0.110595703125, 0.17333984375, 0.281005859375, 0.14208984375, 0.191162109375, 0.2158203125, 0.024444580078125, 0.0635986328125, 0.1715087890625, 0....	embed
14167560_c0	14167560	haskell	0	Title: Couldn't match expected type `IO b0' with actual type `Float' Problem title: Couldn't match expected type `IO b0' with actual type `Float' Tags: compiler-errors, haskell Problem: Couldn't match expected type `IO b0' with actual type `Float' I wanted to make a simple unit converter, ...	Couldn't match expected type `IO b0' with actual type `Float' Couldn't match expected type `IO b0' with actual type `Float' compiler-errors haskell Couldn Float jedn.hs:16:16 Couldn't match expected type `IO b0' with actual type `Float' I wanted to make a simple unit converter, I wrote: bu...	[ -0.01251220703125, -0.0078125, 0.0009918212890625, -0.005523681640625, -0.0081787109375, -0.011474609375, -0.01220703125, -0.003326416015625, 0.000583648681640625, -0.00555419921875, -0.0081787109375, -0.00738525390625, 0.01324462890625, -0.0218505859375, 0.00933837890625, -0.006805419...	[ 191147, 3768, 18, 14858, 84751, 10644, 17780, 876, 2389, 678, 8561, 919, 365, 257, 9969, 34759, 188800, 1556, 142508, 38699, 127, 22354, 25, 36663, 8781, 25072, 172127, 54397, 68772, 163, 18499, 18822, 70, 2967, 151134, 142424, 1884, 6063, ...	[ 0.07818603515625, 0.119873046875, 0.0677490234375, 0.1883544921875, 0.1630859375, 0.1649169921875, 0.1962890625, 0.061309814453125, 0.167236328125, 0.06317138671875, 0.2071533203125, 0.08502197265625, 0.1807861328125, 0.147216796875, 0.10748291015625, 0.083740234375, 0.14013671875, ...	embed
27557629_c0	27557629	haskell	0	Title: Making Haskell Code faster Problem title: Making Haskell Code faster Tags: haskell Problem: Making Haskell Code faster Does anyone know how to make this Haskell code fun faster? I am doing Project Euler #14 . This code runs in 4.029 seconds: collatz :: Int -> Int64 -> Int collatz c 1 = c collatz c k \| even k = c...	Making Haskell Code faster Making Haskell Code faster haskell Making Haskell Int64 Making Haskell Code faster Does anyone know how to make this Haskell code fun faster? I am doing Project Euler #14 . This code runs in 4.029 seconds: Memoizing the collatz function actually increases the runtime, so I did not do any memo...	[ 0.006561279296875, -0.00182342529296875, 0.017822265625, 0.000644683837890625, 0.00701904296875, 0.00970458984375, -0.00011777877807617188, -0.005950927734375, 0.00439453125, -0.038818359375, 0.0087890625, -0.0269775390625, -0.01513671875, 0.006500244140625, 0.006103515625, 0.000968933...	[ 13676, 214, 20625, 142508, 28864, 4271, 56, 1556, 360, 18, 13307, 35672, 3714, 3642, 47, 3249, 903, 18151, 7477, 20594, 27331, 5177, 603, 2592, 3293, 127877, 23, 40401, 4235, 94131, 17443, 31, 84382, 65780, 9136, 32354, 20653, 51312, 11675,...	[ 0.127685546875, 0.0518798828125, 0.1959228515625, 0.303955078125, 0.2298583984375, 0.166259765625, 0.1195068359375, 0.1866455078125, 0.052001953125, 0.0958251953125, 0.2183837890625, 0.044403076171875, 0.0809326171875, 0.05548095703125, 0.003387451171875, 0.1207275390625, 0.021636962...	embed
74770880_c1	74770880	haskell	1	to consume all lines after a $ ls until the next line starting with $ (but without consuming it, because otherwise the following parser will fail). The parser partly works, but only if there is at most one ls command in it and only if it's the last command in the input. When I run the parser with debug mode, I get the...	to consume all lines after a $ ls until the next line starting with $ (but without consuming it, because otherwise the following parser will fail). The parser partly works, but only if there is at most one ls command in it and only if it's the last command in the input. When I run the parser with debug mode, I get the...	[ -0.0242919921875, 0.0277099609375, 0.00060272216796875, 0.0244140625, -0.01385498046875, 0.0225830078125, -0.01190185546875, 0.000637054443359375, 0.0189208984375, -0.01220703125, -0.0145263671875, 0.0361328125, 0.00701904296875, 0.0181884765625, -0.006805419921875, 0.0184326171875, ...	[ 47, 18588, 13, 756, 124519, 7103, 3650, 96, 7, 24189, 11737, 13315, 72134, 678, 8789, 15490, 25632, 366, 2189, 35782, 2831, 43240, 4734, 2684, 1632, 75101, 4568, 107730, 11675, 8, 85779, 13736, 18499, 5881, 56329, 54936, 2256, 936, 150, 5...	[ 0.107666015625, 0.2181396484375, 0.08056640625, 0.126220703125, 0.2135009765625, 0.1536865234375, 0.1563720703125, 0.1097412109375, 0.137939453125, 0.089111328125, 0.1224365234375, 0.1309814453125, 0.04656982421875, 0.038848876953125, 0.0224456787109375, 0.075927734375, 0.06628417968...	embed
44689767_c0	44689767	haskell	0	Title: Haskell compile: the interface to load is a member of the hidden package (which is itself) Problem title: Haskell compile: the interface to load is a member of the hidden package (which is itself) Tags: haskell, xmonad Problem: Haskell compile: the interface to load is a member of the hidden package (which is it...	Haskell compile: the interface to load is a member of the hidden package (which is itself) Haskell compile: the interface to load is a member of the hidden package (which is itself) haskell xmonad Haskell Configuration taffybar.hs Recompiling Error taffybar.hs:26:1 Failed System.Taffybar.ToggleMonitor taffybar-0.4.6 Us...	[ -0.007110595703125, 0.000667572021484375, -0.00970458984375, 0.0208740234375, -0.0031585693359375, 0.0172119140625, 0.0031585693359375, 0.00225830078125, -0.00897216796875, -0.017578125, -0.01165771484375, -0.00927734375, -0.0084228515625, -0.004150390625, 0.01416015625, -0.02221679687...	[ 20625, 142508, 9969, 1340, 101758, 47, 72367, 83, 32786, 204105, 98169, 143321, 68034, 1556, 1022, 3796, 712, 59994, 308, 76195, 1299, 127, 89002, 11368, 212059, 28194, 19721, 190355, 12353, 9874, 7763, 129384, 46674, 26111, 115459, 36836, 5962...	[ 0.131103515625, 0.2568359375, 0.1588134765625, 0.16357421875, 0.220947265625, 0.1019287109375, 0.2052001953125, 0.043731689453125, 0.1453857421875, 0.2291259765625, 0.1944580078125, 0.0150146484375, 0.138427734375, 0.10009765625, 0.000396728515625, 0.077392578125, 0.08612060546875, ...	embed
29877714_c0	29877714	haskell	0	Title: Do GHC REWRITE pragmas have to be type preserving? Problem title: Do GHC REWRITE pragmas have to be type preserving? Tags: ghc, haskell, pragma Problem: Do GHC REWRITE pragmas have to be type preserving? import Data.Void (Void,absurd) Say I have a small term language: data Term c v where Var :: v -> Term c v Con...	Do GHC REWRITE pragmas have to be type preserving? Do GHC REWRITE pragmas have to be type preserving? ghc haskell pragma Data.Void GHC REWRITE Term Con NOINLINE RULES Do GHC REWRITE pragmas have to be type preserving? Say I have a small term language: If I want to combine terms of the type Term c Void and Term c Int , ...	[ -0.004638671875, 0.023681640625, 0.00994873046875, 0.017578125, 0.0201416015625, 0.0184326171875, -0.020263671875, 0.00555419921875, 0.0028228759765625, -0.0106201171875, 0.00653076171875, -0.007354736328125, -0.006622314453125, 0.00537109375, -0.002716064453125, 0.007232666015625, 0...	[ 527, 73265, 9069, 115055, 25216, 58827, 1510, 765, 10644, 9498, 56, 6496, 31380, 238, 1556, 142508, 192, 11809, 36635, 532, 2994, 1657, 9520, 57339, 46845, 47138, 19336, 13579, 46876, 3444, 70163, 69407, 39, 501, 22591, 136, 360, 18, 7722, ...	[ 0.0911865234375, 0.2000732421875, 0.152587890625, 0.2022705078125, 0.149169921875, 0.2080078125, 0.13916015625, 0.05718994140625, 0.240234375, 0.08740234375, 0.08123779296875, 0.0928955078125, 0.101806640625, 0.0948486328125, 0.1021728515625, 0.2169189453125, 0.100341796875, 0.0698...	embed
34156241_c0	34156241	haskell	0	Title: Haskell - Accepting different types and acting accordingly Problem title: Haskell - Accepting different types and acting accordingly Tags: haskell Problem: Haskell - Accepting different types and acting accordingly Lets say I got the following very basic example: f :: Either Int String -> IO () as well as a func...	Haskell - Accepting different types and acting accordingly Haskell - Accepting different types and acting accordingly haskell Haskell Accepting Either Haskell - Accepting different types and acting accordingly Lets say I got the following very basic example: as well as a function g :: Int -> IO () and a function g' :: ...	[ -0.00885009765625, -0.005889892578125, -0.00653076171875, 0.0002536773681640625, -0.0087890625, 0.0026702880859375, -0.019287109375, -0.00677490234375, 0.0020294189453125, -0.00174713134765625, 0.01806640625, -0.0260009765625, -0.0089111328125, 0.005950927734375, -0.005035400390625, -0...	[ 20625, 142508, 111383, 12921, 52895, 136, 1030, 1916, 59499, 1556, 4565, 9319, 4163, 70, 25632, 4552, 62822, 27781, 5299, 32354, 706, 1984, 360, 18, 33079, 17780, 10, 25, 23351, 198343, 3444, 29479, 1238, 237, 184, 187075, 11782, 707, 96819...	[ 0.1575927734375, 0.2685546875, 0.197509765625, 0.1932373046875, 0.2108154296875, 0.0293121337890625, 0.1275634765625, 0.041900634765625, 0.1171875, 0.1319580078125, 0.119873046875, 0.260498046875, 0.011444091796875, 0.005523681640625, 0.03265380859375, 0.01385498046875, 0.11987304687...	embed
25184659_c0	25184659	haskell	0	Title: Wait for keyboard press without blocking Problem title: Wait for keyboard press without blocking Tags: haskell Problem: Wait for keyboard press without blocking My current simple TCP echo server code looks like this import Network.Socket main :: IO () main = setup setup :: IO () setup = do sock <- socket AF_INET...	Wait for keyboard press without blocking Wait for keyboard press without blocking haskell Network.Socket Wait AF_INET Stream SockAddrInet iNADDR_ANY Socket SockAddr Handling Wait for keyboard press without blocking My current simple TCP echo server code looks like this The loop runs forever. I tried few methods to list...	[ 0.004302978515625, 0.01483154296875, 0.00160980224609375, 0.0006256103515625, -0.0021514892578125, 0.00167083740234375, 0.0164794921875, -0.0289306640625, 0.000705718994140625, -0.03662109375, 0.01611328125, -0.0206298828125, -0.006805419921875, 0.003997802734375, -0.01397705078125, 0....	[ 175254, 100, 149186, 24234, 15490, 46389, 1556, 142508, 28997, 8912, 27853, 28211, 17777, 115061, 1061, 7569, 126, 23498, 93333, 193237, 43581, 8781, 17854, 3089, 10723, 18151, 33342, 40956, 127877, 136993, 10846, 150624, 44632, 82230, 5201, 3564...	[ 0.2435302734375, 0.1082763671875, 0.23681640625, 0.1864013671875, 0.0723876953125, 0.1805419921875, 0.0679931640625, 0.1807861328125, 0.06689453125, 0.01123046875, 0.1162109375, 0.056121826171875, 0.06573486328125, 0.1365966796875, 0.033660888671875, 0.05059814453125, 0.0356140136718...	embed
54700916_c0	54700916	haskell	0	Title: What is the Purpose of the Item type in Foundation Problem title: What is the Purpose of the Item type in Foundation Tags: types, haskell Problem: What is the Purpose of the Item type in Foundation Both the following compile fine with Foundation (and Prelude as qualified import P) and return the expected string....	What is the Purpose of the Item type in Foundation What is the Purpose of the Item type in Foundation types haskell What Purpose Item Foundation Char P.head blahh2 Should What is the Purpose of the Item type in Foundation Both the following compile fine with Foundation (and Prelude as qualified import P) and return the...	[ -0.0152587890625, -0.01336669921875, 0.011962890625, 0.000019073486328125, -0.0067138671875, 0.004608154296875, -0.005584716796875, -0.0145263671875, 0.0201416015625, 0.005645751953125, 0.01080322265625, -0.033935546875, -0.005096435546875, 0.0001316070556640625, -0.0201416015625, -0.0...	[ 4865, 83, 70, 16915, 78381, 111, 78426, 10644, 23, 32807, 52895, 1556, 142508, 21656, 436, 31251, 9932, 51659, 304, 151117, 25632, 9969, 1340, 5885, 678, 1914, 822, 112, 217225, 24927, 30646, 84751, 79315, 55681, 2053, 103510, 14858, 26548, ...	[ 0.06854248046875, 0.04962158203125, 0.0494384765625, 0.19873046875, 0.1871337890625, 0.06134033203125, 0.253662109375, 0.2457275390625, 0.0758056640625, 0.277587890625, 0.182373046875, 0.13037109375, 0.21337890625, 0.173095703125, 0.06976318359375, 0.1072998046875, 0.058807373046875,...	embed

40928558_c0

40928558

haskell

0

Title: filter hangs on infinite List Problem title: filter hangs on infinite List Tags: haskell Problem: filter hangs on infinite List I have this code isPrime x = x > 0 && filter divisible [1..x] == [1,x] where divisible y = x `mod` y == 0 primes = filter isPrime [1..] that defines an infinite List of primes. All thes...

filter hangs on infinite List filter hangs on infinite List haskell List Main Program Files Haskell Platform package.conf.d Cabal-1.24.0.0 GLURaw-2.0.0.1 GLUT-2.7.0.7 HTTP-4000.3.3 HUnit-1.3.1.1 ObjectName-1.1.0.1 OpenGL-3.0.0.2 OpenGLRaw-3.1.0.0 QuickCheck-2.8.2 StateVar-1.1.0.4 Win32-2.3.1.1 array-0.5.1.1 async-2.1.0...

[ -0.01104736328125, 0.0223388671875, 0.0024871826171875, -0.028564453125, 0.00616455078125, -0.022216796875, 0.02392578125, -0.00823974609375, 0.0137939453125, -0.0137939453125, 0.00138092041015625, -0.000446319580078125, 0.01068115234375, -0.0103759765625, 0.00494384765625, 0.021972656...

[ 46312, 10756, 7, 98, 54241, 13, 32036, 1556, 142508, 12321, 7663, 42724, 20625, 70968, 98169, 5, 70547, 71, 30438, 289, 5759, 20682, 99929, 90799, 14503, 15519, 73011, 102014, 527, 143662, 5428, 53489, 134926, 135913, 68037, 134693, 22438, 67...

[ 0.317138671875, 0.28076171875, 0.1175537109375, 0.1763916015625, 0.2210693359375, 0.1236572265625, 0.248779296875, 0.169677734375, 0.302978515625, 0.14892578125, 0.2301025390625, 0.222412109375, 0.187255859375, 0.2073974609375, 0.2425537109375, 0.065185546875, 0.2076416015625, 0.12...

embed

28388715_c1

28388715

haskell

1

, JSBool True, JSProp aref "b"] What goes in the place of ??? for the type? A similar problem occurs when I want to build out a constructor for JSObject's and JSFunctionCall's, as these are also expressions. Idris's soultion In Idris ??? would look something like this. data JSExp : Bool -> Type where JSArray : List (JS...

[ -0.0034637451171875, 0.0220947265625, -0.000713348388671875, 0.001678466796875, -0.00101470947265625, 0.021728515625, -0.007598876953125, 0.0140380859375, 0.01336669921875, 0.0181884765625, 0.0031280517578125, -0.0022125244140625, -0.01373291015625, 0.01055908203125, -0.00189971923828125...

[ 821, 36474, 43386, 87599, 28437, 621, 420, 275, 4865, 60899, 23, 3687, 37336, 100, 10644, 2967, 45367, 64549, 748, 13055, 75161, 309, 10763, 441, 5584, 125195, 181545, 25, 57289, 1363, 360, 2806, 6713, 1884, 903, 2053, 64977, 19279, 254, ...

[ 0.13916015625, 0.0498046875, 0.234375, 0.14453125, 0.1932373046875, 0.087890625, 0.101318359375, 0.1324462890625, 0.0144805908203125, 0.065185546875, 0.0631103515625, 0.1365966796875, 0.2445068359375, 0.011199951171875, 0.20947265625, 0.033477783203125, 0.03173828125, 0.10485839843...

embed

19863790_c0

19863790

haskell

0

Title: How do phantom types work with newtype? Problem title: How do phantom types work with newtype? Tags: newtype, haskell, phantom-types Problem: How do phantom types work with newtype? My understanding of newtypes is that they are compiled out by GHC. However, this can't be the whole story because phantom types can...

How do phantom types work with newtype? How do phantom types work with newtype? newtype haskell phantom-types How Modulus How do phantom types work with newtype? My understanding of newtypes is that they are compiled out by GHC. However, this can't be the whole story because phantom types can hold information. From her...

[ -0.01348876953125, 0.00104522705078125, 0.0045166015625, 0.007293701171875, -0.01348876953125, 0.0311279296875, 0.01348876953125, 0.0179443359375, 0.02001953125, 0.004486083984375, -0.00274658203125, -0.01483154296875, 0.0130615234375, -0.0242919921875, -0.0191650390625, 0.01513671875,...

[ 11249, 54, 68743, 5928, 52895, 4488, 678, 3525, 50986, 1556, 142508, 63014, 223, 100094, 7, 375, 5974, 1810, 390, 527, 73265, 831, 16401, 4677, 28987, 33636, 8962, 140807, 8096, 15190, 1511, 864, 18, 7565, 10422, 297, 7440, 10644, 2046, 4...

[ 0.0771484375, 0.05133056640625, 0.1553955078125, 0.196533203125, 0.258056640625, 0.1302490234375, 0.1312255859375, 0.1632080078125, 0.32080078125, 0.083251953125, 0.2120361328125, 0.1417236328125, 0.073486328125, 0.07049560546875, 0.050384521484375, 0.046905517578125, 0.17431640625, ...

embed

22162566_c0

22162566

haskell

0

Title: Haskell - Tree traversal: preorder Problem title: Haskell - Tree traversal: preorder Tags: preorder, tree, types, haskell Problem: Haskell - Tree traversal: preorder I am fairly new to Haskell, and is trying to work on an assignment from my class. I am trying to create a preorder function to traverse through a t...

Haskell - Tree traversal: preorder Haskell - Tree traversal: preorder preorder tree types haskell Haskell Tree Empty Leaf Branch Couldn Haskell - Tree traversal: preorder I am fairly new to Haskell, and is trying to work on an assignment from my class. I am trying to create a preorder function to traverse through a tre...

[ 0.0145263671875, -0.0035858154296875, -0.00616455078125, -0.005340576171875, 0.015380859375, 0.0150146484375, -0.0146484375, -0.01708984375, 0.0035247802734375, -0.047119140625, -0.0028533935546875, -0.01080322265625, -0.017822265625, -0.0291748046875, -0.003509521484375, 0.00369262695...

[ 20625, 142508, 101344, 37317, 289, 479, 80596, 53201, 52895, 1556, 31678, 939, 636, 2407, 21110, 191147, 180663, 3525, 31577, 95486, 18507, 28282, 32354, 8305, 36746, 25632, 9384, 2646, 237, 13204, 18499, 127887, 35064, 74918, 2822, 99, 4568, ...

[ 0.1148681640625, 0.2196044921875, 0.2244873046875, 0.184326171875, 0.059783935546875, 0.1553955078125, 0.2509765625, 0.20361328125, 0.1488037109375, 0.109130859375, 0.123779296875, 0.048431396484375, 0.032470703125, 0.1181640625, 0.1141357421875, 0.099365234375, 0.0159149169921875, ...

embed

44737623_c1

44737623

haskell

1

the benchmark, run these commands: git submodule init && git submodule update cabal new-build bench && ./dist-newstyle/build/btree-0.1.0.0/build/bench/bench When I run the benchmark as is, there is a part of the output that reads: Off-heap tree, Amount of time taken to build: 0.293197796 If I uncomment line 151 of BTr...

[ -0.00262451171875, 0.003204345703125, 0.0196533203125, -0.0123291015625, 0.0157470703125, 0.0037841796875, -0.01531982421875, -0.004058837890625, 0.0027313232421875, -0.00110626220703125, -0.005126953125, 0.0005950927734375, 0.00732421875, 0.0181884765625, 0.0026092529296875, 0.0166015...

[ 240057, 11675, 6097, 75101, 62270, 1614, 83279, 217, 28350, 109524, 3525, 177149, 1585, 206, 40946, 62600, 102014, 99929, 776, 237, 83, 2831, 140992, 12301, 9791, 1106, 2631, 53201, 121147, 1733, 39958, 47, 45367, 126175, 11591, 124168, 11648, ...

[ 0.29833984375, 0.109619140625, 0.007049560546875, 0.196044921875, 0.223876953125, 0.115966796875, 0.099365234375, 0.030242919921875, 0.05926513671875, 0.1644287109375, 0.018218994140625, 0.1158447265625, 0.10791015625, 0.04730224609375, 0.1551513671875, 0.257080078125, 0.097290039062...

embed

8185282_c0

8185282

haskell

0

Title: Haskell vs JVM performance Problem title: Haskell vs JVM performance Tags: jvm, java, scala, haskell Problem: Haskell vs JVM performance I want to write a backend system for a web site (it'll be a custom search-style service). It needs to be highly concurrent and fast. Given my wish for concurrency, I was planni...

Haskell vs JVM performance Haskell vs JVM performance jvm java scala haskell Haskell JVM Haskell vs JVM performance I want to write a backend system for a web site (it'll be a custom search-style service). It needs to be highly concurrent and fast. Given my wish for concurrency, I was planning on using a functional lan...

[ 0.0135498046875, 0.019775390625, -0.006256103515625, -0.00089263916015625, 0.0069580078125, -0.0233154296875, -0.0020599365234375, 0.0113525390625, -0.01397705078125, -0.015869140625, -0.01251220703125, -0.004852294921875, 0.0145263671875, 0.01055908203125, -0.002960205078125, -0.00402...

[ 20625, 142508, 20209, 821, 47599, 23718, 1647, 334, 39, 79, 330, 146232, 1556, 3444, 33022, 4420, 3611, 5426, 100, 1467, 1764, 217, 114122, 33938, 9, 40946, 4516, 27117, 103210, 133244, 4271, 19, 32599, 108636, 982, 2408, 4, 58136, 17368, ...

[ 0.1875, 0.298095703125, 0.16259765625, 0.1668701171875, 0.299560546875, 0.2154541015625, 0.056884765625, 0.1412353515625, 0.05535888671875, 0.1129150390625, 0.16162109375, 0.2442626953125, 0.1776123046875, 0.0950927734375, 0.1197509765625, 0.1085205078125, 0.125244140625, 0.1171875...

embed

15164180_c0

15164180

haskell

0

Title: Simplify code by distributing [] Problem title: Simplify code by distributing [] Tags: haskell, list, monads Problem: Simplify code by distributing [] I have the following function type Assignment = [(Ref, Val)] predi2 :: [(Val,Val)] -> Ref -> Ref -> (Maybe Assignment -> [Maybe Assignment]) predi2 f k1 k2 = \ma ...

Simplify code by distributing [] Simplify code by distributing [] haskell list monads Simplify Assignment Ref Val predi2 Maybe Nothing Just Simplify code by distributing [] I have the following function Given all the instances of Maybe, I thought I could simplify it to something more simple inside the Maybe monad: But ...

[ 0.00408935546875, -0.000888824462890625, 0.0146484375, 0.0038299560546875, 0.008056640625, 0.00396728515625, -0.00982666015625, 0.00628662109375, 0.00439453125, 0.006011962890625, 0.02880859375, 0.00323486328125, -0.01123046875, -0.0230712890625, -0.007476806640625, -0.005340576171875,...

[ 55331, 28574, 53, 18151, 390, 15917, 1916, 378, 1556, 142508, 5303, 2667, 712, 1301, 31304, 53295, 4769, 1653, 304, 83425, 182747, 70, 25632, 32354, 756, 110527, 17569, 112892, 18929, 47, 1286, 8781, 46132, 2967, 2704, 37076, 3871, 30646, 3...

[ 0.170166015625, 0.192138671875, 0.1116943359375, 0.193359375, 0.037750244140625, 0.2152099609375, 0.109130859375, 0.0772705078125, 0.1099853515625, 0.2318115234375, 0.1513671875, 0.09442138671875, 0.1356201171875, 0.002899169921875, 0.1495361328125, 0.14111328125, 0.116943359375, 0...

embed

27602281_c1

27602281

haskell

1

} [leaf 8] deleteNode :: Int -> [CustomTree] -> [CustomTree] deleteNode _ [] = [] deleteNode n (x:xs) = if isNodeInTree n x then deleteNodeFromTree n x ++ xs else deleteNode n xs --below is the fixed line as per the answer below --deleteNode n (x:xs) = if isNodeInTree n x then deleteNodeFromTree n x ++ xs else x : dele...

[ 0.00469970703125, 0.0135498046875, -0.01495361328125, -0.00122833251953125, 0.0078125, 0.00830078125, 0.01068115234375, -0.033447265625, 0.0035552978515625, -0.02490234375, 0.01055908203125, 0.000850677490234375, 0.000820159912109375, -0.015869140625, -0.00390625, -0.006622314453125, ...

[ 51912, 2407, 382, 154109, 5021, 112, 1984, 360, 18, 223, 5928, 62731, 13, 653, 425, 12, 2174, 83, 4153, 1022, 168407, 37223, 37076, 7, 17336, 188347, 13315, 35064, 8520, 67, 130664, 42485, 501, 2460, 929, 87599, 18537, 22225, 525, 4358, ...

[ 0.009521484375, 0.111083984375, 0.107666015625, 0.243896484375, 0.218994140625, 0.1610107421875, 0.001495361328125, 0.070068359375, 0.05499267578125, 0.1343994140625, 0.1390380859375, 0.18115234375, 0.041473388671875, 0.1964111328125, 0.1627197265625, 0.0816650390625, 0.0615844726562...

embed

19461227_c0

19461227

haskell

0

Title: Simulating a spring/damper system in Yampa Problem title: Simulating a spring/damper system in Yampa Tags: yampa, physics, frp, haskell Problem: Simulating a spring/damper system in Yampa I'm trying to use Yampa for some basic system simulation like I'd do in Simulink. In this case I want to simulate a spring an...

Simulating a spring/damper system in Yampa Simulating a spring/damper system in Yampa yampa physics frp haskell Simulating Yampa Simulating a spring/damper system in Yampa I'm trying to use Yampa for some basic system simulation like I'd do in Simulink. In this case I want to simulate a spring and damper system, introd...

[ 0.0130615234375, 0.028564453125, -0.007568359375, 0.024658203125, 0.001220703125, 0.01409912109375, 0.0040283203125, 0.003936767578125, -0.00531005859375, -0.04345703125, 0.005218505859375, -0.0013275146484375, -0.01239013671875, 0.0198974609375, -0.01287841796875, -0.0198974609375, ...

[ 144814, 1916, 31576, 64, 85, 41577, 5426, 2369, 15293, 151, 34053, 27744, 14119, 254, 1556, 142508, 4527, 62822, 40226, 602, 561, 10187, 67, 136, 48, 65508, 35902, 14068, 57143, 59121, 25632, 26073, 32354, 33636, 58269, 28282, 40956, 29479, ...

[ 0.2279052734375, 0.0139617919921875, 0.202880859375, 0.014373779296875, 0.106201171875, 0.2137451171875, 0.16845703125, 0.1712646484375, 0.26318359375, 0.1221923828125, 0.0472412109375, 0.04095458984375, 0.002288818359375, 0.05926513671875, 0.08111572265625, 0.1995849609375, 0.023635...

embed

2246323_c0

2246323

haskell

0

Title: Iterate over list in haskell? Problem title: Iterate over list in haskell? Tags: functional-programming, portaudio, haskell Problem: Iterate over list in haskell? I'm writing an audio program in Haskell using Portaudio. I have a function that generates a list of samples I'd like to play, and I'm trying to play t...

Iterate over list in haskell? Iterate over list in haskell? functional-programming portaudio haskell NoError Iterate Right Iterate over list in haskell? I'm writing an audio program in Haskell using Portaudio. I have a function that generates a list of samples I'd like to play, and I'm trying to play them using the fol...

[ -0.00045013427734375, 0.0087890625, -0.004058837890625, 0.00714111328125, -0.01263427734375, 0.0035552978515625, 0.0120849609375, -0.0260009765625, 0.0034027099609375, -0.0419921875, 0.0184326171875, -0.022216796875, 0.0286865234375, -0.01324462890625, -0.004974365234375, 0.00110626220...

[ 87, 8560, 67, 645, 5303, 23, 1556, 142508, 32, 123309, 28966, 4898, 43521, 18468, 90911, 32562, 18215, 1528, 20625, 57979, 32354, 139392, 121413, 71, 1884, 11301, 93, 46132, 5201, 6634, 22489, 272, 75935, 54241, 18, 2485, 634, 58735, 12478,...

[ 0.0533447265625, 0.27294921875, 0.0938720703125, 0.1912841796875, 0.250244140625, 0.0755615234375, 0.151123046875, 0.25830078125, 0.007080078125, 0.1312255859375, 0.09295654296875, 0.0936279296875, 0.2115478515625, 0.00457763671875, 0.065185546875, 0.0594482421875, 0.1796875, 0.093...

embed

7509245_c1

7509245

haskell

1

vi And this code works; I've tried plugging in the SPOJ sample test case and it produces the correct result. But when I submit this solution to SPOJ (instead of importing Luke Palmer's MemoCombinators, I simply copy and paste the necessary parts into the submitted source), it exceeds the time limit. =/ I don't underst...

[ -0.01806640625, 0.0294189453125, -0.0096435546875, -0.005126953125, 0.006622314453125, 0.0064697265625, 0.006103515625, 0.0123291015625, 0.0133056640625, -0.01336669921875, 0.02099609375, -0.021240234375, 0.00787353515625, 0.022216796875, 0.02099609375, 0.01708984375, 0.0122680664062...

[ 279, 903, 18151, 43240, 37842, 12266, 140195, 1375, 121413, 3034, 7225, 27489, 26785, 16750, 4966, 137447, 29806, 47, 24927, 97702, 39287, 56, 17443, 31, 10770, 19155, 22230, 43658, 71099, 63559, 63920, 230121, 31344, 442, 204839, 7, 1733, 17...

[ 0.1845703125, 0.060882568359375, 0.187255859375, 0.1195068359375, 0.042938232421875, 0.058258056640625, 0.170654296875, 0.2349853515625, 0.17431640625, 0.1737060546875, 0.074951171875, 0.053009033203125, 0.1033935546875, 0.084228515625, 0.0091552734375, 0.1585693359375, 0.16174316406...

embed

41655218_c0

41655218

haskell

0

Title: Printing Timestamps while Debugging in Haskell Problem title: Printing Timestamps while Debugging in Haskell Tags: bind, haskell, io Problem: Printing Timestamps while Debugging in Haskell I'm still learning Haskell and debugging some functions, and usually have a timestamp function to get a sense of when certai...

Printing Timestamps while Debugging in Haskell Printing Timestamps while Debugging in Haskell bind haskell io Printing Timestamps Debugging Haskell arg1 ZonedTime Doing Printing Timestamps while Debugging in Haskell I'm still learning Haskell and debugging some functions, and usually have a timestamp function to get a ...

[ -0.01611328125, -0.00119781494140625, 0.0185546875, -0.00775146484375, 0.01458740234375, 0.006256103515625, -0.008056640625, -0.00970458984375, -0.00555419921875, -0.033935546875, 0.020263671875, -0.0277099609375, -0.0021209716796875, -0.013916015625, 0.00124359130859375, 0.01574707031...

[ 39754, 19114, 2537, 6423, 12960, 262, 978, 36659, 20625, 142508, 68557, 1556, 22995, 79459, 418, 81597, 71, 70059, 7464, 52080, 8, 32354, 1733, 590, 2676, 10422, 41018, 4034, 136, 7279, 759, 2203, 16093, 7440, 70731, 70541, 4426, 4369, 1690...

[ 0.173583984375, 0.1199951171875, 0.2103271484375, 0.1103515625, 0.07513427734375, 0.1005859375, 0.1793212890625, 0.03619384765625, 0.10302734375, 0.2203369140625, 0.141845703125, 0.09130859375, 0.151123046875, 0.0521240234375, 0.027008056640625, 0.1202392578125, 0.002685546875, 0.1...

embed

59071644_c1

59071644

haskell

1

GHC appears to treat () exactly as any other type, i.e. as if there was a question about which regular value inhabiting the type should be returned from a function. The fact that there's only one such value does not seem to be (ab)used by the optimization algorithms. ETA3: when I say Haskell, I mean Haskell-as-defined...

[ -0.0014190673828125, -0.00115966796875, 0.0159912109375, -0.01953125, -0.01324462890625, 0.01171875, -0.00006961822509765625, -0.038818359375, -0.00159454345703125, 0.006744384765625, -0.00653076171875, -0.01483154296875, -0.0026397705078125, -0.015380859375, 0.015625, -0.0005950927734...

[ 527, 73265, 135179, 85689, 66161, 237, 2499, 3789, 10644, 9655, 20324, 34292, 54815, 5608, 176377, 1295, 32354, 4734, 1632, 6044, 959, 48903, 33740, 87235, 234873, 53958, 363, 5154, 20625, 142508, 29459, 162, 112, 5983, 56829, 2347, 841, 4187...

[ 0.147216796875, 0.243408203125, 0.078857421875, 0.133056640625, 0.104736328125, 0.06475830078125, 0.02593994140625, 0.05596923828125, 0.1929931640625, 0.1685791015625, 0.1533203125, 0.124267578125, 0.102783203125, 0.0308837890625, 0.166015625, 0.006866455078125, 0.20703125, 0.04339...

embed

26556447_c0

26556447

haskell

0

Title: Can I selectively remove .cabal file's `ghc-options` in particular files? Problem title: Can I selectively remove .cabal file's `ghc-options` in particular files? Tags: haskell Problem: Can I selectively remove .cabal file's `ghc-options` in particular files? I am using ghc-options: -Wall in my .cabal ...

Can I selectively remove .cabal file's `ghc-options` in particular files? Can I selectively remove .cabal file's `ghc-options` in particular files? haskell Can Wall Constants.hs numDogs::Int numCats::Int OPTIONS_GHC Can I selectively remove .cabal file's `ghc-options` in particular files? I am using in my .ca...

[ 0.0174560546875, 0.005584716796875, 0.0159912109375, 0.0098876953125, -0.0169677734375, -0.02001953125, -0.0172119140625, 0.00946044921875, -0.0091552734375, 0.017333984375, -0.0191650390625, -0.0029296875, -0.000301361083984375, 0.0108642578125, -0.0142822265625, 0.0166015625, 0.007...

[ 4171, 36849, 5844, 87388, 408, 3571, 11435, 3768, 9486, 238, 109585, 7, 17311, 102158, 1556, 142508, 23706, 148416, 127, 13269, 8331, 9405, 18, 76775, 28023, 165117, 41877, 441, 87, 17368, 5, 5161, 442, 35463, 33342, 1884, 903, 198076, 1869...

[ 0.07037353515625, 0.1185302734375, 0.06683349609375, 0.1627197265625, 0.104248046875, 0.1859130859375, 0.1446533203125, 0.0234832763671875, 0.124267578125, 0.1051025390625, 0.2301025390625, 0.0780029296875, 0.08026123046875, 0.1644287109375, 0.10614013671875, 0.1881103515625, 0.16101...

embed

41779339_c0

41779339

haskell

0

Title: Haskell euclid algorithm greatest common divisors of two integers Problem title: Haskell euclid algorithm greatest common divisors of two integers Tags: haskell Problem: Haskell euclid algorithm greatest common divisors of two integers Write a Haskell program egcd using Euclid's algorithm to to determine the gre...

Haskell euclid algorithm greatest common divisors of two integers Haskell euclid algorithm greatest common divisors of two integers haskell Haskell Integer Prelude HaskellProject egcd.hs egcd.hs:3:36 Syntax Perhaps TemplateHaskell TemplateHaskellQuotes Template Compiling Main Failed Haskell euclid algorithm greatest co...

[ -0.00077056884765625, 0.003204345703125, 0.0166015625, -0.0029449462890625, 0.0111083984375, 0.025146484375, -0.0072021484375, -0.016845703125, -0.004608154296875, -0.01708984375, 0.00982666015625, -0.01092529296875, -0.007049560546875, -0.01336669921875, -0.01397705078125, -0.00872802...

[ 20625, 142508, 1175, 238, 12472, 234873, 158036, 39210, 45, 51858, 7, 6626, 892, 26255, 1556, 44401, 1914, 822, 223353, 30046, 71574, 127, 5, 363, 32944, 19010, 181799, 196631, 6495, 31583, 31, 15612, 12321, 190355, 111, 1528, 1284, 3229, 1...

[ 0.152587890625, 0.2384033203125, 0.1123046875, 0.0908203125, 0.2340087890625, 0.19189453125, 0.17138671875, 0.2015380859375, 0.1669921875, 0.2406005859375, 0.0980224609375, 0.1531982421875, 0.1192626953125, 0.01629638671875, 0.1259765625, 0.1270751953125, 0.0819091796875, 0.1536865...

embed

64559677_c0

64559677

haskell

0

Title: Haskell: lift a normal function to a lens Problem title: Haskell: lift a normal function to a lens Tags: haskell-lens, haskell Problem: Haskell: lift a normal function to a lens I have a HashMap that contains various things (Value is from Aeson): cs :: Hashmap Text Value cs = fromList [("phone", String "+00"), (...

Haskell: lift a normal function to a lens Haskell: lift a normal function to a lens haskell-lens haskell Data.Aeson.Lens Data.Lens Haskell Hashmap Text Value Number Maybe _Just _String _Number Scientific Integral Bounded Haskell: lift a normal function to a lens I have a HashMap that contains various things (Value is f...

[ -0.0026702880859375, -0.0084228515625, -0.01239013671875, 0.0146484375, 0.010009765625, 0.020263671875, 0.002197265625, -0.0003299713134765625, 0.0036773681640625, -0.049072265625, 0.006744384765625, 0.03955078125, -0.001434326171875, 0.003143310546875, 0.021728515625, -0.025390625, ...

[ 20625, 142508, 60520, 3638, 32354, 47, 3098, 12, 10, 1556, 1977, 11809, 284, 90, 191, 866, 1755, 162087, 62346, 24129, 190060, 103332, 83425, 127794, 71713, 18444, 26278, 210017, 204681, 335, 167457, 7, 166179, 70541, 67842, 8966, 856, 50770,...

[ 0.154052734375, 0.2734375, 0.257080078125, 0.1983642578125, 0.1962890625, 0.1414794921875, 0.2178955078125, 0.000732421875, 0.008056640625, 0.15234375, 0.1693115234375, 0.0867919921875, 0.02496337890625, 0.074462890625, 0.1671142578125, 0.1126708984375, 0.175048828125, 0.1682128906...

embed

39155853_c0

39155853

haskell

0

Title: stack --nix build complains about ghc version mismatch Problem title: stack --nix build complains about ghc version mismatch Tags: haskell-stack, haskell, nix Problem: stack --nix build complains about ghc version mismatch When building threepenny-gui on NixOS with stack --nix build , I got error saying I have t...

stack --nix build complains about ghc version mismatch stack --nix build complains about ghc version mismatch haskell-stack haskell nix config.yaml stack --nix build complains about ghc version mismatch When building threepenny-gui on NixOS with stack --nix build , I got error saying I have the wrong version of ghc. Th...

[ -0.011474609375, -0.00518798828125, 0.006195068359375, -0.0030364990234375, -0.00634765625, 0.004913330078125, -0.0189208984375, -0.00159454345703125, -0.012451171875, 0.0172119140625, 0.007080078125, -0.024169921875, 0.0194091796875, -0.0037384033203125, 0.00982666015625, 0.0092163085...

[ 177261, 4210, 93, 425, 45367, 186992, 31380, 238, 11389, 1239, 98753, 1556, 142508, 590, 2594, 300, 153837, 14520, 141, 33976, 17262, 2278, 299, 17086, 1520, 7285, 18499, 765, 44691, 37842, 169581, 22027, 18, 11675, 87109, 241957, 60875, 8475...

[ 0.21533203125, 0.059478759765625, 0.1422119140625, 0.165283203125, 0.22802734375, 0.1363525390625, 0.1328125, 0.130859375, 0.178955078125, 0.093017578125, 0.2230224609375, 0.0721435546875, 0.17626953125, 0.08917236328125, 0.0654296875, 0.1041259765625, 0.1453857421875, 0.0715942382...

embed

69773999_c0

69773999

haskell

0

Title: How do I get cabal to use a local version of a package as a dependency for a Hackage package? Problem title: How do I get cabal to use a local version of a package as a dependency for a Hackage package? Tags: cabal-install, haskell, cabal Problem: How do I get cabal to use a local version of a package as a depen...

How do I get cabal to use a local version of a package as a dependency for a Hackage package? How do I get cabal to use a local version of a package as a dependency for a Hackage package? cabal-install haskell cabal How Hackage github.com attoparsec.git How do I get cabal to use a local version of a package as a depend...

[ -0.006103515625, 0.010986328125, 0.00799560546875, 0.012939453125, -0.0033111572265625, -0.00579833984375, -0.0084228515625, 0.000949859619140625, 0.00787353515625, -0.02197265625, -0.0028533935546875, -0.0277099609375, 0.008544921875, 0.012451171875, 0.007659912109375, -0.02001953125,...

[ 11249, 2046, 109524, 47, 4527, 4000, 11389, 98169, 237, 42548, 27771, 52922, 4588, 100, 80383, 1556, 142508, 62270, 32102, 243, 31, 2500, 39797, 15769, 31577, 20600, 10, 90, 191, 98, 527, 73265, 3569, 68107, 5117, 13028, 41566, 86, 6488, ...

[ 0.05950927734375, 0.09979248046875, 0.29541015625, 0.0538330078125, 0.1414794921875, 0.1572265625, 0.1737060546875, 0.20068359375, 0.0787353515625, 0.200927734375, 0.118896484375, 0.183349609375, 0.188232421875, 0.0487060546875, 0.1309814453125, 0.0914306640625, 0.2015380859375, 0....

embed

49717000_c0

49717000

haskell

0

Title: Organizing common types in Haskell Problem title: Organizing common types in Haskell Tags: naming, module, haskell Problem: Organizing common types in Haskell I have several Haskell modules (Foo1.hs, Foo2.hs, Foo3.hs) that all depend on the same set of types (Common.hs): ... Foo/Foo1.hs Foo/Foo2.hs Foo/Foo3.hs F...

Organizing common types in Haskell Organizing common types in Haskell naming module haskell Foo.Common Foo.FooCommon Organizing Haskell Foo Foo1.hs Foo2.hs Foo3.hs Common.hs Bar Bar1.hs Bar2.hs Organizing common types in Haskell I have several Haskell modules (Foo1.hs, Foo2.hs, Foo3.hs) that all depend on the same set ...

[ 0.007110595703125, -0.0113525390625, -0.00738525390625, 0.01092529296875, 0.00775146484375, -0.007537841796875, -0.00347900390625, -0.00640869140625, -0.005218505859375, -0.00885009765625, -0.0025177001953125, 0.000675201416015625, 0.0269775390625, 0.0062255859375, -0.02099609375, -0.0...

[ 43435, 39210, 52895, 20625, 142508, 147453, 88996, 1556, 9572, 31, 10770, 3796, 27591, 127, 5442, 363, 151301, 3253, 23, 40368, 56566, 5701, 5423, 45646, 18151, 12301, 5299, 24927, 203925, 5915, 76, 4806, 7, 102158, 87420, 64194, 13452, 15410...

[ 0.263671875, 0.199951171875, 0.2386474609375, 0.147216796875, 0.218505859375, 0.1341552734375, 0.15380859375, 0.111328125, 0.12744140625, 0.07769775390625, 0.0989990234375, 0.16259765625, 0.0770263671875, 0.148681640625, 0.0192108154296875, 0.0270538330078125, 0.2161865234375, 0.12...

embed

50207475_c0

50207475

haskell

0

Title: How to use recursion for every two elements in the list Problem title: How to use recursion for every two elements in the list Tags: haskell Problem: How to use recursion for every two elements in the list I have already written a function to get a certain number of the coordinates for a line between two points....

How to use recursion for every two elements in the list How to use recursion for every two elements in the list haskell How Coord p1:p2:ps How to use recursion for every two elements in the list I have already written a function to get a certain number of the coordinates for a line between two points. But I faced some ...

[ -0.0322265625, 0.007110595703125, -0.001373291015625, 0.01190185546875, -0.005584716796875, 0.0177001953125, 0.02978515625, 0.01953125, 0.011474609375, -0.044921875, 0.005401611328125, -0.03173828125, 0.01708984375, -0.00897216796875, -0.013916015625, 0.0164794921875, 0.0174560546875...

[ 11249, 47, 4527, 195625, 1830, 100, 11907, 6626, 80854, 23, 5303, 1556, 142508, 1311, 6651, 915, 82825, 254, 304, 6423, 70, 21771, 59121, 32354, 2046, 24233, 14012, 176866, 90, 13315, 17721, 26847, 2577, 71337, 8972, 756, 35874, 6126, 10773...

[ 0.108154296875, 0.082763671875, 0.166748046875, 0.265625, 0.21923828125, 0.1024169921875, 0.168212890625, 0.197509765625, 0.20751953125, 0.04638671875, 0.2208251953125, 0.1343994140625, 0.22216796875, 0.0667724609375, 0.1597900390625, 0.0177001953125, 0.038055419921875, 0.022338867...

embed

47024808_c0

47024808

haskell

0

Title: Is there a corresponding optic for higher-order traversable functors? Problem title: Is there a corresponding optic for higher-order traversable functors? Tags: traversable, haskell, haskell-lens, haskell-hedgehog, category-theory Problem: Is there a corresponding optic for higher-order traversable functors? Hed...

Is there a corresponding optic for higher-order traversable functors? Is there a corresponding optic for higher-order traversable functors? traversable haskell haskell-lens haskell-hedgehog category-theory HTraversable Higher-order Applicative Traversable Is there a corresponding optic for higher-order traversable func...

[ 0.00390625, -0.003631591796875, -0.01226806640625, -0.0179443359375, 0.01312255859375, 0.0054931640625, -0.000408172607421875, -0.0089111328125, 0.007232666015625, -0.04833984375, -0.0024871826171875, 0.000553131103515625, 0.0034027099609375, -0.01324462890625, -0.001190185546875, -0.0...

[ 42518, 214, 233, 9523, 100, 77546, 80596, 37317, 2886, 7477, 18770, 2685, 10, 1556, 142508, 1977, 5252, 60885, 1663, 95487, 2347, 572, 28542, 7864, 19694, 11048, 4937, 87193, 18507, 61924, 11814, 678, 3323, 10644, 171859, 84382, 645, 142424, ...

[ 0.1202392578125, 0.03167724609375, 0.1788330078125, 0.169921875, 0.03173828125, 0.1385498046875, 0.152099609375, 0.1729736328125, 0.17724609375, 0.1387939453125, 0.1246337890625, 0.012725830078125, 0.012054443359375, 0.0869140625, 0.1923828125, 0.10577392578125, 0.049957275390625, ...

embed

32481418_c1

32481418

haskell

1

type family. If I did something that involved typeclass dictionaries instead like this: badEntailment :: Proxy a -> (Show a) :- (Ord a) badEntailment _ = unsafeCoerceConstraint I assume that this would almost certainly be capable of causing a segfault. Is this true? and if so, what makes it different from the original...

[ 0.01312255859375, 0.0072021484375, 0.005340576171875, -0.0035858154296875, -0.0118408203125, -0.00592041015625, -0.007293701171875, -0.00970458984375, 0.001556396484375, -0.01434326171875, -0.01214599609375, -0.010498046875, 0.012939453125, 0.0179443359375, -0.006500244140625, -0.00253...

[ 10644, 14449, 6777, 75412, 67413, 45, 10763, 11, 10484, 64457, 6494, 7768, 46741, 674, 1250, 50878, 10, 168660, 143045, 51, 115840, 56, 329, 2816, 4288, 68782, 87709, 216806, 1931, 1021, 7136, 29568, 12921, 7311, 76615, 60892, 33946, 587, 4...

[ 0.245849609375, 0.1705322265625, 0.01129150390625, 0.0677490234375, 0.1995849609375, 0.0196990966796875, 0.100830078125, 0.042327880859375, 0.00146484375, 0.0518798828125, 0.1141357421875, 0.030914306640625, 0.2120361328125, 0.0789794921875, 0.0927734375, 0.206298828125, 0.0361022949...

embed

10291550_c0

10291550

haskell

0

Title: Pattern matching vs record syntax function for data type field extraction Problem title: Pattern matching vs record syntax function for data type field extraction Tags: haskell Problem: Pattern matching vs record syntax function for data type field extraction Given an example data type with record syntax: data V...

Pattern matching vs record syntax function for data type field extraction Pattern matching vs record syntax function for data type field extraction haskell Pattern VmInfo Show Pattern matching vs record syntax function for data type field extraction Given an example data type with record syntax: and (vmInfo :: String -...

[ -0.0247802734375, -0.009521484375, 0.0101318359375, 0.0322265625, 0.0174560546875, -0.00244140625, -0.016845703125, -0.010009765625, -0.0023956298828125, -0.04052734375, 0.0126953125, -0.01416015625, 0.00150299072265625, -0.01483154296875, -0.01470947265625, -0.01214599609375, 0.0116...

[ 9876, 22766, 14858, 214, 20209, 17164, 6002, 86531, 32354, 2053, 10644, 44457, 4173, 1556, 142508, 310, 39, 93147, 17367, 27781, 334, 23351, 139392, 30646, 36917, 45646, 81, 9351, 237, 79315, 6626, 150624, 125663, 11651, 63920, 103510, 9969, ...

[ 0.185791015625, 0.18017578125, 0.26123046875, 0.061676025390625, 0.1417236328125, 0.2222900390625, 0.1600341796875, 0.2117919921875, 0.1695556640625, 0.10595703125, 0.1580810546875, 0.1505126953125, 0.144775390625, 0.0965576171875, 0.19091796875, 0.1419677734375, 0.125732421875, 0....

embed

47182529_c0

47182529

haskell

0

Title: Haskell Comparing Sorting Algorithms Problem title: Haskell Comparing Sorting Algorithms Tags: sorting, iteration, haskell Problem: Haskell Comparing Sorting Algorithms Basically I want to write a function that takes a single list as an input, applies a list of sorting algorithms to that list, and then returns a...

Haskell Comparing Sorting Algorithms Haskell Comparing Sorting Algorithms sorting iteration haskell Haskell Comparing Sorting Algorithms Ord Bool x:y:xs y:xs Haskell Comparing Sorting Algorithms Basically I want to write a function that takes a single list as an input, applies a list of sorting algorithms to that list,...

[ -0.0091552734375, 0.005401611328125, 0.01556396484375, -0.006500244140625, -0.00099945068359375, 0.0125732421875, -0.0184326171875, -0.0262451171875, 0.0029449462890625, 0.0181884765625, -0.004852294921875, 0.0213623046875, 0.0213623046875, -0.005218505859375, -0.01031494140625, -0.002...

[ 20625, 142508, 113307, 53666, 214, 109847, 2783, 12096, 720, 1556, 35379, 2460, 929, 1022, 53, 425, 113, 18337, 3444, 33022, 32354, 51776, 11001, 5303, 237, 107730, 4027, 234873, 30646, 73783, 34677, 114141, 756, 11180, 19388, 17497, 959, 127...

[ 0.118896484375, 0.21923828125, 0.178955078125, 0.186767578125, 0.09130859375, 0.08184814453125, 0.0831298828125, 0.1846923828125, 0.1373291015625, 0.109375, 0.12158203125, 0.05194091796875, 0.156982421875, 0.003570556640625, 0.004486083984375, 0.0291290283203125, 0.0341796875, 0.05...

embed

9130988_c0

9130988

haskell

0

Title: haskell identifier recognition Problem title: haskell identifier recognition Tags: regular-language, parsing, haskell Problem: haskell identifier recognition my working in file parsing using Haskell, and I'm using both Data.Attoparsec.Char8 and Data.ByteString.Char8 . I want to parse an expression which can cont...

haskell identifier recognition haskell identifier recognition regular-language parsing haskell qualified Data.Attoparsec.Char8 Data.ByteString.Char8 Parser B.ByteString A.takeWhile A.inClass A-Za-z0-9_ A.parse B.pack EMBXSHM-PortClo Done PortClo EMBXSHM AU_D PCMPTask haskell identifier recognition my working in file pa...

[ -0.002716064453125, 0.0032196044921875, 0.01171875, 0.0223388671875, 0.0022430419921875, 0.0303955078125, -0.01544189453125, 0.00146484375, 0.0034027099609375, -0.01031494140625, 0.018310546875, -0.0031280517578125, 0.00518798828125, -0.00677490234375, -0.008544921875, -0.0039367675781...

[ 1556, 142508, 42485, 56, 230466, 20324, 196651, 366, 6953, 217225, 11809, 10628, 2500, 39797, 84068, 1019, 75358, 71713, 2392, 2189, 335, 62, 78219, 979, 73, 140803, 16737, 169, 2389, 15205, 29102, 12689, 1542, 12927, 594, 60006, 365, 984, ...

[ 0.1842041015625, 0.243896484375, 0.2181396484375, 0.119140625, 0.1920166015625, 0.1297607421875, 0.08831787109375, 0.187744140625, 0.044158935546875, 0.1640625, 0.0882568359375, 0.141845703125, 0.1446533203125, 0.1439208984375, 0.10595703125, 0.158935546875, 0.05517578125, 0.092529...

embed

69546661_c0

69546661

haskell

0

Title: How to check if length of a list is not equal to length of a list within a list in haskell Problem title: How to check if length of a list is not equal to length of a list within a list in haskell Tags: haskell, list Problem: How to check if length of a list is not equal to length of a list within a list in hask...

How to check if length of a list is not equal to length of a list within a list in haskell How to check if length of a list is not equal to length of a list within a list in haskell haskell list How Berlin Madrid Krakow Planet City How to check if length of a list is not equal to length of a list within a list in haske...

[ -0.00543212890625, 0.01446533203125, -0.0101318359375, 0.019775390625, -0.0028076171875, 0.003021240234375, 0.00180816650390625, -0.0118408203125, 0.016845703125, 0.03466796875, 0.016845703125, -0.017822265625, 0.03369140625, 0.01165771484375, -0.0140380859375, -0.00135040283203125, ...

[ 11249, 47, 12765, 2174, 140909, 111, 5303, 83, 959, 105950, 28032, 1556, 142508, 10, 23, 10271, 8884, 150221, 40357, 6406, 71263, 31577, 36766, 32354, 103510, 14858, 10644, 2806, 107730, 84751, 140992, 35064, 78680, 126, 115411, 21718, 6295, ...

[ 0.04510498046875, 0.089111328125, 0.196533203125, 0.093505859375, 0.1978759765625, 0.056793212890625, 0.2239990234375, 0.0257568359375, 0.1710205078125, 0.1524658203125, 0.1317138671875, 0.1376953125, 0.228759765625, 0.006072998046875, 0.0288848876953125, 0.19189453125, 0.18298339843...

embed

32700129_c0

32700129

haskell

0

Title: Haskell Strange Operator Problem title: Haskell Strange Operator Tags: haskell Problem: Haskell Strange Operator For an assignment for my functional programming class I am working on an exercise on trees. And more specifically on Rose trees. In the framework that we got the data type 'Rose' is already defined, b...

Haskell Strange Operator Haskell Strange Operator haskell Haskell Strange Operator Rose Show Exercise Haskell Strange Operator For an assignment for my functional programming class I am working on an exercise on trees. And more specifically on Rose trees. In the framework that we got the data type 'Rose' is already def...

[ 0.020751953125, 0.015625, 0.007110595703125, 0.00811767578125, 0.0106201171875, 0.0208740234375, -0.001922607421875, 0.00408935546875, 0.0181884765625, -0.031982421875, -0.0001983642578125, -0.035888671875, 0.01385498046875, 0.0079345703125, -0.022216796875, -0.0245361328125, -0.0038...

[ 20625, 142508, 187791, 150922, 1556, 24009, 17367, 155534, 184, 95486, 759, 123309, 56037, 18507, 20697, 81979, 1360, 90, 170846, 2053, 10644, 108278, 13, 21771, 61924, 39933, 152, 2740, 33938, 28994, 133, 7108, 840, 12830, 40, 944, 74855, 13...

[ 0.1407470703125, 0.212646484375, 0.225830078125, 0.25634765625, 0.119873046875, 0.223876953125, 0.2142333984375, 0.1590576171875, 0.00640869140625, 0.0728759765625, 0.000762939453125, 0.1051025390625, 0.07269287109375, 0.05731201171875, 0.06378173828125, 0.1014404296875, 0.1295166015...

embed

63482853_c1

63482853

haskell

1

/bin the PATH variable (which I did in /etc/paths . On step 2, the script was supposed to pop up a dialog box (and didn't) when installing the necessary command line tools. It also said to rerun the script once complete (which I did). The script also said I should adjust my PATH variable, and source /Users/.../.ghcup/e...

[ 0.0067138671875, 0.020263671875, -0.01397705078125, 0.0201416015625, -0.00933837890625, 0.01806640625, -0.0120849609375, 0.00189208984375, -0.005126953125, -0.0019989013671875, -0.0002880096435546875, -0.022705078125, -0.0086669921875, -0.01513671875, 0.006195068359375, -0.008483886718...

[ 248, 7568, 70, 436, 139909, 77336, 111879, 128405, 29954, 116, 26499, 134598, 7426, 1257, 26519, 16530, 15935, 18, 20600, 63559, 75101, 13315, 72977, 456, 16428, 24145, 28484, 5608, 126596, 759, 31344, 1062, 7, 9486, 33874, 33, 334, 128019, ...

[ 0.1207275390625, 0.2445068359375, 0.0308074951171875, 0.150146484375, 0.22802734375, 0.307373046875, 0.0987548828125, 0.1861572265625, 0.08843994140625, 0.040496826171875, 0.16455078125, 0.08447265625, 0.11376953125, 0.05364990234375, 0.1514892578125, 0.127685546875, 0.0079345703125,...

embed

1898771_c0

1898771

haskell

0

Title: Adding deriving (Data) to standard types Problem title: Adding deriving (Data) to standard types Tags: typeclass, haskell Problem: Adding deriving (Data) to standard types I would like to add deriving (Data) to standard types. After enabling the StandaloneDeriving , FlexibleContexts , DeriveDataTypeable , and Un...

Adding deriving (Data) to standard types Adding deriving (Data) to standard types typeclass haskell Adding Data StandaloneDeriving FlexibleContexts DeriveDataTypeable UndecidableInstances Day DiffTime TemperatureRecord.hs:30:0 Adding deriving (Data) to standard types I would like to add deriving (Data) to standard type...

[ 0.031982421875, 0.00872802734375, 0.004241943359375, 0.006256103515625, 0.001312255859375, -0.0048828125, -0.00909423828125, 0.01019287109375, -0.004119873046875, -0.053466796875, -0.010009765625, -0.00506591796875, 0.01263427734375, 0.03076171875, -0.0130615234375, -0.0162353515625, ...

[ 62, 59725, 16406, 6496, 137989, 47, 5570, 52895, 10644, 67413, 1556, 142508, 11809, 32487, 51684, 47731, 14, 180842, 2661, 22829, 1310, 5844, 196707, 2886, 79912, 24750, 116071, 10013, 191144, 70059, 61727, 32271, 127, 1197, 53861, 1884, 15190,...

[ 0.09210205078125, 0.09869384765625, 0.2049560546875, 0.16455078125, 0.171875, 0.0772705078125, 0.2388916015625, 0.247314453125, 0.1375732421875, 0.135986328125, 0.102783203125, 0.2235107421875, 0.122314453125, 0.08740234375, 0.082763671875, 0.1114501953125, 0.055389404296875, 0.124...

embed

75835927_c0

75835927

haskell

0

Title: Haskell's equivalence of Rust's GAT? Problem title: Haskell's equivalence of Rust's GAT? Tags: haskell, rust Problem: Haskell's equivalence of Rust's GAT? What is the Haskell's equivalence of the following Rust code: trait Foo { type Bar<T>; fn foo(x: String) -> Self::Bar<String>; } I tried t...

Haskell's equivalence of Rust's GAT? Haskell's equivalence of Rust's GAT? haskell rust Haskell Rust GAT Foo Bar Self::Bar Main.hs:83:5 Couldn Expected Actual AllowAmbiguousTypes When Haskell's equivalence of Rust's GAT? What is the Haskell's equivalence of the following Rust code: I tried to write t...

[ 0.0115966796875, 0.0123291015625, -0.0181884765625, -0.0284423828125, 0.00732421875, -0.0189208984375, 0.00439453125, -0.003814697265625, -0.005706787109375, -0.0040283203125, -0.01422119140625, -0.029052734375, -0.0126953125, 0.00836181640625, -0.0064697265625, -0.022705078125, 0.00...

[ 20625, 142508, 3768, 224743, 3956, 144222, 132819, 1556, 52648, 9572, 31, 3253, 55347, 25267, 12321, 127, 17168, 758, 191147, 60075, 100582, 41566, 150567, 12282, 10821, 196707, 25632, 18151, 37842, 33022, 18499 ]

[ 0.1466064453125, 0.263427734375, 0.0655517578125, 0.1488037109375, 0.06683349609375, 0.2154541015625, 0.198486328125, 0.120361328125, 0.17919921875, 0.101318359375, 0.03143310546875, 0.10107421875, 0.09674072265625, 0.09893798828125, 0.057525634765625, 0.0225067138671875, 0.152465820...

embed

47957645_c0

47957645

haskell

0

Title: scanr3: Why does step, a binary operator, accept [zero] as a parameter? Problem title: scanr3: Why does step, a binary operator, accept [zero] as a parameter? Tags: haskell Problem: scanr3: Why does step, a binary operator, accept [zero] as a parameter? Lists_III Solutions To do: Write your own definition of sca...

scanr3: Why does step, a binary operator, accept [zero] as a parameter? scanr3: Why does step, a binary operator, accept [zero] as a parameter? haskell scanr3 Why Implement x:xs Haskell scanr3: Why does step, a binary operator, accept [zero] as a parameter? Lists_III Solutions To do: Write your own definition of scanr ...

[ -0.01531982421875, 0.007415771484375, 0.007568359375, 0.00518798828125, -0.014892578125, 0.0198974609375, -0.001739501953125, 0.0004444122314453125, 0.000514984130859375, -0.00701904296875, 0.00823974609375, 0.00141143798828125, -0.0185546875, 0.0172119140625, 0.00653076171875, -0.0081...

[ 44954, 42, 363, 44084, 29954, 2394, 6635, 39933, 26946, 80510, 171859, 1556, 142508, 153941, 1022, 12, 425, 20625, 237, 32036, 33747, 109339, 10002, 80934, 18344, 7569, 32354, 12877, 29806, 25, 11782, 62163, 6863, 10750, 35839, 678, 6626, 530...

[ 0.1566162109375, 0.1756591796875, 0.169189453125, 0.09100341796875, 0.2235107421875, 0.109375, 0.0633544921875, 0.169677734375, 0.1309814453125, 0.1961669921875, 0.20947265625, 0.0273895263671875, 0.1785888671875, 0.126708984375, 0.07598876953125, 0.00323486328125, 0.07659912109375, ...

embed

30737397_c1

30737397

haskell

1

threaded to make the event network correctly capture both text from textIn and keypresses from keyPress , which caused issues because it's not safe to modify objects from the gtk package concurrently. At the moment, I have postGUIAsync calls scattered throughout my code, and I've found that using postGUISync causes the...

[ 0.010498046875, 0.005035400390625, 0.0157470703125, -0.0009307861328125, 0.01171875, 0.002960205078125, 0.0179443359375, -0.015869140625, -0.00701904296875, -0.046630859375, 0.004364013671875, -0.03369140625, 0.010498046875, -0.0098876953125, -0.00830078125, 0.0040283203125, -0.01635...

[ 86997, 297, 3249, 19732, 33120, 26785, 141621, 15044, 7986, 4153, 22799, 11856, 94753, 143434, 37348, 959, 46002, 2811, 36746, 706, 31472, 98169, 133244, 1305, 43578, 17481, 12654, 238, 11782, 16275, 87420, 18151, 17368, 568, 217835, 113660, 28...

[ 0.2357177734375, 0.090087890625, 0.01080322265625, 0.1697998046875, 0.169921875, 0.0595703125, 0.13037109375, 0.008087158203125, 0.126220703125, 0.13916015625, 0.07611083984375, 0.199462890625, 0.2122802734375, 0.0006103515625, 0.107421875, 0.0008544921875, 0.102294921875, 0.047119...

embed

50439871_c1

50439871

haskell

1

I tried the following: Identity 5 + Identity 6 with the result being 11 Identity 5 + 6 with the result being 11 again However it I try the same with Maybe like so Just 5 + Just 6 Just 5 + 6 I get the following error: <interactive>:2116:1: error: • Non type-variable argument in the constraint: Num (Maybe a) (Use Flexib...

[ -0.0194091796875, 0.00616455078125, 0.0291748046875, 0.00323486328125, 0.01190185546875, 0.0205078125, 0.01007080078125, -0.0028228759765625, 0.00927734375, -0.03466796875, -0.0037994384765625, -0.03271484375, -0.00872802734375, -0.0027313232421875, -0.004974365234375, -0.020751953125,...

[ 37842, 25632, 71257, 2481, 190, 997, 305, 16750, 534, 13438, 33306, 9790, 5701, 83425, 1884, 9563, 18499, 10433, 71232, 25619, 2485, 19721, 768, 3775, 10644, 21690, 2886, 10750, 158, 2816, 52782, 82419, 10, 1062, 180842, 2661, 22829, 28897, ...

[ 0.0970458984375, 0.04595947265625, 0.208740234375, 0.159423828125, 0.1474609375, 0.1322021484375, 0.1478271484375, 0.0985107421875, 0.13623046875, 0.06121826171875, 0.000762939453125, 0.102294921875, 0.05609130859375, 0.314697265625, 0.01287841796875, 0.166015625, 0.17333984375, 0....

embed

74040403_c0

74040403

haskell

0

Title: Haskell, taking a list of pairs (value,index) and making it a single list [Int] Problem title: Haskell, taking a list of pairs (value,index) and making it a single list [Int] Tags: computer-science, haskell, functional-programming Problem: Haskell, taking a list of pairs (value,index) and making it a single list...

Haskell, taking a list of pairs (value,index) and making it a single list [Int] Haskell, taking a list of pairs (value,index) and making it a single list [Int] computer-science haskell functional-programming Haskell Haskell, taking a list of pairs (value,index) and making it a single list [Int] I am fairly new at Haske...

[ 0, 0.01422119140625, -0.0078125, 0.003082275390625, -0.0196533203125, 0.0211181640625, -0.03369140625, -0.00872802734375, 0.00506591796875, -0.0081787109375, 0.006988525390625, -0.019775390625, 0.0093994140625, 0.012939453125, -0.00787353515625, -0.00494384765625, 0.0289306640625, ...

[ 20625, 142508, 35971, 5303, 80836, 7, 27494, 13, 4711, 20662, 11001, 4153, 18, 13909, 175201, 1556, 123309, 28966, 136, 180663, 3525, 99, 31577, 86869, 2809, 5646, 158, 118435, 7565, 47, 27781, 2174, 1902, 5608, 30646, 6528, 5117, 12830, 83...

[ 0.1822509765625, 0.28076171875, 0.1033935546875, 0.233642578125, 0.2548828125, 0.115234375, 0.1787109375, 0.049713134765625, 0.225830078125, 0.06451416015625, 0.15625, 0.06317138671875, 0.10040283203125, 0.010040283203125, 0.032989501953125, 0.124755859375, 0.08978271484375, 0.0576...

embed

60929459_c0

60929459

haskell

0

Title: Similar functions applied to nested list in Haskell Problem title: Similar functions applied to nested list in Haskell Tags: haskell, list Problem: Similar functions applied to nested list in Haskell Here is the problem I encountered. I have some functions that are similar in their bodies (with a slightly differ...

Similar functions applied to nested list in Haskell Similar functions applied to nested list in Haskell haskell list Similar Haskell Similar functions applied to nested list in Haskell Here is the problem I encountered. I have some functions that are similar in their bodies (with a slightly difference), but they have s...

[ -0.0091552734375, 0.01214599609375, 0.007049560546875, 0.0179443359375, 0.006256103515625, 0.021484375, -0.002777099609375, -0.010498046875, 0.01397705078125, 0.0012664794921875, -0.0157470703125, -0.0322265625, 0.00958251953125, 0.0206298828125, -0.0255126953125, -0.0162353515625, -...

[ 209683, 32354, 190659, 47, 8512, 71, 5303, 20625, 142508, 1556, 2967, 190647, 3060, 621, 21373, 2363, 337, 34204, 161549, 60212, 1284, 765, 138256, 41206, 54, 25632, 18151, 36917, 43240, 149016, 8781, 42, 3917, 69307, 903, 105233, 10644, 6741...

[ 0.238525390625, 0.22021484375, 0.1181640625, 0.03863525390625, 0.2220458984375, 0.08697509765625, 0.19091796875, 0.120849609375, 0.2210693359375, 0.1192626953125, 0.06317138671875, 0.039093017578125, 0.0308837890625, 0.0301666259765625, 0.203125, 0.0160675048828125, 0.0662841796875, ...

embed

35280013_c0

35280013

haskell

0

Title: Printing two arguments Problem title: Printing two arguments Tags: haskell Problem: Printing two arguments I am trying to :load file "hello.hs" and keep getting the errors below. I am using WinGHCi 1.0.6. I have printed just one argument and it worked but when I try to print two arguments I get a Not in scope er...

Printing two arguments Printing two arguments haskell System.Environment Printing Not Main Getting Hello args1 hello.hs:6:37 hello.hs:7:13 hello.hs:7:50 Perhaps Printing two arguments I am trying to :load file "hello.hs" and keep getting the errors below. I am using WinGHCi 1.0.6. I have printed just one argument and i...

[ 0.005859375, 0.004669189453125, -0.00860595703125, 0.030517578125, 0.01123046875, 0.0286865234375, -0.00150299072265625, 0.01031494140625, -0.007568359375, -0.01312255859375, 0.0205078125, -0.032958984375, -0.0068359375, -0.0036163330078125, 0.006683349609375, 0.006103515625, 0.01611...

[ 39754, 214, 6626, 10750, 1556, 142508, 12353, 686, 1900, 11205, 12321, 210732, 35378, 79459, 418, 33600, 31, 127, 910, 30225, 966, 22618, 23837, 181799, 7, 31577, 63033, 11435, 13817, 5, 13695, 18499, 35064, 17368, 17686, 41877, 40658, 53855,...

[ 0.223388671875, 0.0193939208984375, 0.20654296875, 0.28662109375, 0.161376953125, 0.24560546875, 0.0804443359375, 0.0675048828125, 0.10296630859375, 0.1602783203125, 0.1080322265625, 0.028045654296875, 0.201904296875, 0.1744384765625, 0.03057861328125, 0.151123046875, 0.1644287109375...

embed

49808794_c0

49808794

haskell

0

Title: Inferred type in data declaration Problem title: Inferred type in data declaration Tags: type-inference, haskell Problem: Inferred type in data declaration On several occasions now I have run into trouble when trying to include a monadic action of an inferred type into an existing, explicitly typed data declarat...

Inferred type in data declaration Inferred type in data declaration type-inference haskell Inferred Thing Maybe Nothing Inferred type in data declaration On several occasions now I have run into trouble when trying to include a monadic action of an inferred type into an existing, explicitly typed data declaration: I do...

[ 0.005706787109375, -0.00408935546875, 0.01495361328125, 0.0177001953125, 0.0074462890625, 0.005828857421875, 0.01470947265625, 0.005035400390625, 0.006256103515625, -0.0174560546875, 0.012451171875, -0.0023193359375, -0.0203857421875, -0.0223388671875, 0.021240234375, -0.01416015625, ...

[ 360, 2875, 2822, 10644, 2053, 21635, 23, 73, 69988, 1556, 142508, 6003, 214, 83425, 182747, 40368, 46505, 63134, 26698, 2667, 11, 18403, 22631, 53498, 3934, 144573, 143726, 3444, 33022, 7565, 28484, 3525, 44457, 37842, 165523, 1528, 8180, 125...

[ 0.06622314453125, 0.197021484375, 0.1507568359375, 0.2127685546875, 0.1251220703125, 0.169921875, 0.021759033203125, 0.024200439453125, 0.160888671875, 0.1041259765625, 0.2008056640625, 0.0928955078125, 0.0452880859375, 0.1278076171875, 0.1317138671875, 0.0159454345703125, 0.03013610...

embed

19479911_c0

19479911

haskell

0

Title: Function giving slightly different answer than expected Problem title: Function giving slightly different answer than expected Tags: monads, haskell Problem: Function giving slightly different answer than expected I'm doing some monad stuff in Haskell and I wrote a function that calculates the probability of win...

Function giving slightly different answer than expected Function giving slightly different answer than expected monads haskell Function giving slightly different answer than expected I'm doing some monad stuff in Haskell and I wrote a function that calculates the probability of winning a gambling game given the game's ...

[ -0.0018768310546875, 0.004180908203125, 0.0089111328125, -0.02197265625, 0.00958251953125, 0.00445556640625, -0.00433349609375, -0.013916015625, 0.0029754638671875, -0.028564453125, 0.00885009765625, 0.006439208984375, 0.0087890625, 0.0023956298828125, 0.002593994140625, 0.006011962890...

[ 28670, 10763, 68772, 161549, 12921, 35166, 3501, 84751, 2667, 712, 1556, 142508, 20594, 41884, 23, 20625, 54397, 32354, 74481, 1636, 37242, 2481, 111, 69986, 208782, 6712, 34475, 51957, 53201, 43240, 1884, 108654, 40494, 68018, 30646, 159, 2151...

[ 0.1683349609375, 0.08294677734375, 0.147705078125, 0.258544921875, 0.251953125, 0.2369384765625, 0.1195068359375, 0.201171875, 0.114013671875, 0.156005859375, 0.1201171875, 0.25830078125, 0.021087646484375, 0.0423583984375, 0.0168609619140625, 0.1370849609375, 0.0672607421875, 0.19...

embed

43854235_c0

43854235

haskell

0

Title: Nix shell: How to list the installed Haskell package versions Problem title: Nix shell: How to list the installed Haskell package versions Tags: haskell, nix Problem: Nix shell: How to list the installed Haskell package versions As a non-nix'er I installed the newest version of https://github.com/reflex-frp/refl...

Nix shell: How to list the installed Haskell package versions Nix shell: How to list the installed Haskell package versions haskell nix Nix How Haskell Nix shell: How to list the installed Haskell package versions As a non-nix'er I installed the newest version of https://github.com/reflex-frp/reflex-platform . I think ...

[ -0.00494384765625, -0.00012969970703125, 0.00946044921875, 0.025634765625, -0.0035552978515625, 0.0250244140625, -0.0028076171875, -0.00628662109375, -0.012451171875, 0.016845703125, -0.0091552734375, -0.0216064453125, 0.0179443359375, 0.0106201171875, -0.0185546875, 0.021484375, 0.0...

[ 1520, 425, 128019, 11249, 5303, 20600, 297, 20625, 142508, 98169, 11389, 1556, 300, 351, 93, 15769, 32102, 44289, 7079, 254, 107, 172121, 20697, 26267, 16981, 3714, 11814, 903, 1663, 33, 334, 75101, 3173, 420, 38988, 9405, 5498, 12236, 2059...

[ 0.120361328125, 0.1663818359375, 0.2073974609375, 0.0275115966796875, 0.17626953125, 0.1866455078125, 0.027099609375, 0.11865234375, 0.239990234375, 0.1680908203125, 0.1683349609375, 0.07611083984375, 0.103515625, 0.0626220703125, 0.038726806640625, 0.0292816162109375, 0.107604980468...

embed

56393471_c0

56393471

haskell

0

Title: What does left arrow <- mean outside a do block? Problem title: What does left arrow <- mean outside a do block? Tags: guard-clause, haskell, pattern-guards, ghc Problem: What does left arrow <- mean outside a do block? I came across with the following code recently and it bothers me a lot lowerSafeForeign...

What does left arrow <- mean outside a do block? What does left arrow <- mean outside a do block? guard-clause haskell pattern-guards ghc What CmmForeignCall Block What does left arrow <- mean outside a do block? I came across with the following code recently and it bothers me a lot This piece of code is from htt...

[ 0.01019287109375, 0.039794921875, 0.0174560546875, -0.00286865234375, -0.003204345703125, 0.008056640625, -0.002166748046875, -0.0128173828125, 0.013427734375, -0.025634765625, 0.005645751953125, -0.002777099609375, -0.008544921875, -0.00830078125, 0.002349853515625, -0.01043701171875,...

[ 4865, 14602, 25737, 118201, 619, 1277, 9, 29459, 50782, 54, 46389, 74, 56050, 18347, 4032, 1556, 142508, 103510, 32116, 31380, 238, 313, 2276, 18537, 38529, 441, 5584, 80231, 4426, 10, 36880, 25632, 18151, 15044, 1314, 73720, 10557, 9969, 3...

[ 0.0634765625, 0.0261383056640625, 0.2159423828125, 0.277587890625, 0.07244873046875, 0.132568359375, 0.1646728515625, 0.155517578125, 0.2469482421875, 0.1431884765625, 0.22119140625, 0.00927734375, 0.2193603515625, 0.0914306640625, 0.09942626953125, 0.09112548828125, 0.213134765625, ...

embed

12712382_c1

12712382

haskell

1

<$> char '{' <*> scan 1 test where test :: Int -> Char -> Maybe Int test 0 _ = Nothing test i '}'= Just (i-1) test i '{' = Just (i+1) test i _ = Just i According to the profiler 58.7% of the time is spent in bracket, 19.6% in keyTo_id, 17.1% in main. Surely there's a better way to return bracketed terms unchanged if t...

[ -0.0196533203125, -0.010009765625, -0.0113525390625, -0.00921630859375, 0.006317138671875, 0.00830078125, 0.0147705078125, -0.00579833984375, 0.0159912109375, -0.006072998046875, 0.002288818359375, 0.0064697265625, 0.0040283203125, -0.00482177734375, 0.01220703125, -0.002410888671875, ...

[ 4369, 21441, 24854, 44954, 106, 3034, 360, 18, 21656, 83425, 757, 182747, 17, 9563, 14, 110218, 21748, 105609, 9318, 14427, 1733, 66933, 1620, 27853, 6529, 12187, 22799, 7763, 532, 7076, 13961, 5201, 11522, 3917, 30646, 69407, 152028, 2174, ...

[ 0.0718994140625, 0.2132568359375, 0.046173095703125, 0.19482421875, 0.06365966796875, 0.2261962890625, 0.05767822265625, 0.0809326171875, 0.158447265625, 0.2132568359375, 0.05987548828125, 0.145751953125, 0.1136474609375, 0.1334228515625, 0.031280517578125, 0.1231689453125, 0.1220703...

embed

52547909_c0

52547909

haskell

0

Title: custom higher order function invocation gives Non type-variable argument in the constraint error Problem title: custom higher order function invocation gives Non type-variable argument in the constraint error Tags: higher-order-functions, haskell Problem: custom higher order function invocation gives Non type-va...

custom higher order function invocation gives Non type-variable argument in the constraint error custom higher order function invocation gives Non type-variable argument in the constraint error higher-order-functions haskell Non times3 mapThenComputeV1 Main Num Use FlexibleContexts When custom higher order function inv...

[ -0.01416015625, 0.01141357421875, 0.015625, -0.0064697265625, 0.0189208984375, 0.0019683837890625, -0.0245361328125, 0.00469970703125, -0.00604248046875, -0.0419921875, -0.0107421875, -0.046630859375, 0.00823974609375, -0.000774383544921875, 0.0087890625, -0.02587890625, 0.0056457519...

[ 114122, 77546, 12989, 32354, 23, 202010, 76199, 3775, 10644, 21690, 2886, 10750, 158, 2816, 4288, 18499, 80596, 137175, 1556, 142508, 20028, 363, 22288, 6743, 856, 12321, 52782, 36836, 180842, 2661, 22829, 20625, 67125, 75935, 27781, 159029, 90...

[ 0.196044921875, 0.1541748046875, 0.21630859375, 0.177734375, 0.0552978515625, 0.180419921875, 0.06591796875, 0.170654296875, 0.2283935546875, 0.1551513671875, 0.08544921875, 0.22119140625, 0.06097412109375, 0.1739501953125, 0.110595703125, 0.1854248046875, 0.1929931640625, 0.121337...

embed

52688465_c0

52688465

haskell

0

Title: Haskell: cannot construct the infinite type Problem title: Haskell: cannot construct the infinite type Tags: haskell Problem: Haskell: cannot construct the infinite type I got a list of tuples (day:month) and want to find the month with the biggest amount of days. I made a function that accepts my list of tuples...

Haskell: cannot construct the infinite type Haskell: cannot construct the infinite type haskell Haskell y:ys Haskell: cannot construct the infinite type I got a list of tuples (day:month) and want to find the month with the biggest amount of days. I made a function that accepts my list of tuples and list of months (or ...

[ 0.00037384033203125, -0.00066375732421875, 0.02294921875, 0.0250244140625, -0.024658203125, -0.006378173828125, -0.0052490234375, 0.01007080078125, 0.01287841796875, -0.009765625, 0.0023651123046875, -0.0021820068359375, 0.0196533203125, -0.01263427734375, 0.0228271484375, -0.010681152...

[ 20625, 142508, 53418, 64549, 54241, 13, 10644, 1556, 113, 4778, 12, 70, 4163, 5303, 370, 99726, 5636, 15477, 3444, 7413, 31150, 678, 129058, 41170, 13312, 32354, 26946, 21775, 4879, 12765, 30646, 38132, 112474, 1632, 58735, 14922, 54397, 8781...

[ 0.141357421875, 0.22705078125, 0.183349609375, 0.2205810546875, 0.1763916015625, 0.06805419921875, 0.2181396484375, 0.1414794921875, 0.1009521484375, 0.10302734375, 0.0130615234375, 0.016143798828125, 0.009246826171875, 0.0919189453125, 0.0826416015625, 0.165283203125, 0.078186035156...

embed

21563428_c0

21563428

haskell

0

Title: Haskell syntax, parse errors for dummies Problem title: Haskell syntax, parse errors for dummies Tags: haskell, parsing, string, syntax Problem: Haskell syntax, parse errors for dummies today I read a lot about Haskell but this formating is driving me crazy. I want to understand my basic errors as soon as possib...

Haskell syntax, parse errors for dummies Haskell syntax, parse errors for dummies haskell parsing string syntax Haskell Haskell syntax, parse errors for dummies today I read a lot about Haskell but this formating is driving me crazy. I want to understand my basic errors as soon as possible so I can start coding normall...

[ 0.01141357421875, 0.02783203125, -0.037841796875, 0.011474609375, -0.000667572021484375, 0.03564453125, -0.0026702880859375, -0.00872802734375, 0.00628662109375, -0.0223388671875, 0.0126953125, -0.03515625, -0.0166015625, -0.020751953125, 0.0037689208984375, 0.01025390625, -0.0038604...

[ 20625, 142508, 6002, 86531, 366, 184, 18499, 100, 8473, 32747, 1556, 79315, 18925, 12301, 5915, 9384, 132442, 116666, 28219, 62822, 552, 3638, 32354, 3688, 5608, 30646, 4034, 11737, 125458, 48838, 27781, 4700, 38164, 6468, 1328, 162, 71, 8539...

[ 0.1273193359375, 0.238525390625, 0.122802734375, 0.164306640625, 0.1614990234375, 0.1163330078125, 0.2252197265625, 0.021209716796875, 0.1019287109375, 0.06182861328125, 0.1041259765625, 0.206298828125, 0.020538330078125, 0.01251220703125, 0.045379638671875, 0.1136474609375, 0.052429...

embed

71236676_c0

71236676

haskell

0

Title: Is it possible to program GPU in pure Haskell? Problem title: Is it possible to program GPU in pure Haskell? Tags: haskell-ffi, hardware-acceleration, gpu, haskell Problem: Is it possible to program GPU in pure Haskell? I wonder, whether I can write code, which ought to be evaluated by GPU, in pure Haskell. For ...

Is it possible to program GPU in pure Haskell? Is it possible to program GPU in pure Haskell? haskell-ffi hardware-acceleration gpu haskell GPU Haskell Is it possible to program GPU in pure Haskell? I wonder, whether I can write code, which ought to be evaluated by GPU, in pure Haskell. For example, a function for mult...

[ -0.00750732421875, 0.014404296875, 0.0177001953125, -0.007537841796875, 0.0020294189453125, 0.0064697265625, -0.00147247314453125, -0.0185546875, -0.00909423828125, -0.036376953125, -0.00909423828125, -0.0274658203125, -0.01177978515625, -0.0004367828369140625, 0.0019989013671875, 0.01...

[ 2071, 442, 7722, 47, 1528, 162808, 23, 34166, 20625, 142508, 32, 1556, 24500, 76407, 151932, 706, 1766, 32195, 36766, 831, 33022, 18151, 46526, 151575, 390, 32354, 100, 127664, 6626, 21334, 50944, 765, 2347, 31, 110, 5609, 93425, 13648, 117...

[ 0.079345703125, 0.104248046875, 0.216064453125, 0.095947265625, 0.243896484375, 0.301513671875, 0.1502685546875, 0.208740234375, 0.1771240234375, 0.306396484375, 0.008148193359375, 0.1348876953125, 0.151123046875, 0.07684326171875, 0.1212158203125, 0.0207977294921875, 0.1859130859375...

embed

75697510_c2

75697510

haskell

2

, directory-1.2.5.0, directory-1.2.4.0, directory-1.2.3.1, directory-1.2.3.0, directory-1.2.2.1, directory-1.2.2.0, directory-1.2.1.0, directory-1.2.0.1, directory-1.2.0.0, directory-1.1.0.2, directory-1.1.0.1, directory-1.1.0.0, directory-1.0.1.2, directory-1.0.1.1, Code signals: user, project, v2-install, v2-build, N...

[ -0.0040283203125, -0.007293701171875, 0.021728515625, -0.00070953369140625, -0.0003662109375, -0.00151824951171875, -0.0196533203125, 0.022216796875, 0.01708984375, 0.03515625, -0.0081787109375, -0.0111083984375, -0.00848388671875, 0.01239013671875, 0.00927734375, 0.01470947265625, -...

[ 6, 4, 14364, 53, 9, 48400, 5, 187461, 151152, 97109, 132265, 68107, 73011, 102107, 102014, 99929, 92134, 133684, 83783, 28864, 26073, 7, 12, 38937, 13452, 81, 18504, 80383, 177149, 1520, 425, 7285, 39718, 18, 2852, 159065, 19309, 12321, 127...

[ 0.070068359375, 0.1197509765625, 0.22802734375, 0.1728515625, 0.099609375, 0.187255859375, 0.0982666015625, 0.2626953125, 0.217529296875, 0.15966796875, 0.16162109375, 0.1558837890625, 0.133056640625, 0.155029296875, 0.1900634765625, 0.189208984375, 0.1231689453125, 0.120361328125,...

embed

77675020_c0

77675020

haskell

0

Title: Factorial Creation in Haskell Problem title: Factorial Creation in Haskell Tags: haskell, factorial Problem: Factorial Creation in Haskell I was recently reading a paper where the defintion for a factorial is given as such: fac 0 = 1 fac (n + 1) = (n + 1) ∗ fac n I implemented the program from the paper as below...

Factorial Creation in Haskell Factorial Creation in Haskell haskell factorial Factorial Creation Haskell Integer Num Factorial.hs:5:6 Parse Factorial Creation in Haskell I was recently reading a paper where the defintion for a factorial is given as such: I implemented the program from the paper as below: I then tried t...

[ -0.0009002685546875, 0.01025390625, -0.005584716796875, 0.0206298828125, 0.024658203125, -0.0125732421875, -0.010986328125, -0.0135498046875, -0.01153564453125, -0.025146484375, 0.00148773193359375, -0.039794921875, -0.004791259765625, -0.004058837890625, -0.0016021728515625, -0.003585...

[ 117969, 15403, 15678, 2320, 20625, 142508, 23, 1556, 31461, 44401, 52782, 127, 12, 758, 910, 2392, 184, 16454, 15122, 45154, 29479, 1528, 35064, 37842, 4527, 10, 30700, 47644, 10644, 138256, 13648, 2967, 9790, 9969, 1340, 17368, 527, 73265, ...

[ 0.242919921875, 0.2139892578125, 0.1922607421875, 0.058349609375, 0.1605224609375, 0.270751953125, 0.0447998046875, 0.146728515625, 0.2208251953125, 0.1397705078125, 0.190673828125, 0.075439453125, 0.0380859375, 0.05706787109375, 0.1358642578125, 0.09796142578125, 0.053924560546875, ...

embed

6614023_c0

6614023

haskell

0

Title: A good way to avoid "sharing"? Problem title: A good way to avoid "sharing"? Tags: haskell, sharing Problem: A good way to avoid "sharing"? Suppose that someone would translate this simple Python code to Haskell: def important_astrological_calculation(digits): # Get the first 1000000 digits o...

A good way to avoid "sharing"? A good way to avoid "sharing"? haskell sharing important_astrological_calculation Get lucky_numbers calculate_first_digits_of_pi A good way to avoid "sharing"? Suppose that someone would translate this simple Python code to Haskell: Haskell version: After working with ...

[ -0.0093994140625, 0.026123046875, 0.00109100341796875, -0.0084228515625, -0.01373291015625, -0.0079345703125, -0.00616455078125, -0.015869140625, 0.01422119140625, -0.0306396484375, 0.00335693359375, 0.01611328125, -0.004486083984375, 0.010986328125, 0.01904296875, 0.02001953125, 0.0...

[ 4127, 3917, 47, 71864, 2420, 2852, 1556, 142508, 53371, 5526, 9297, 109622, 6827, 238, 72403, 20779, 138009, 2606, 1297, 7, 74481, 13448, 271, 4803, 14481, 4390, 1434, 3900, 19309, 8781, 145581, 18151, 20625, 11389, 20697, 77848, 27706, 10388...

[ 0.0804443359375, 0.051849365234375, 0.063232421875, 0.2227783203125, 0.2177734375, 0.193603515625, 0.11669921875, 0.2432861328125, 0.2381591796875, 0.1484375, 0.1234130859375, 0.103759765625, 0.076904296875, 0.07379150390625, 0.03265380859375, 0.0626220703125, 0.2393798828125, 0.17...

embed

68089246_c0

68089246

haskell

0

Title: What is the difference between AppTy and FunTy in Haskell Core type definitions? Problem title: What is the difference between AppTy and FunTy in Haskell Core type definitions? Tags: haskell Problem: What is the difference between AppTy and FunTy in Haskell Core type definitions? Reading Core Haskell Type , and ...

What is the difference between AppTy and FunTy in Haskell Core type definitions? What is the difference between AppTy and FunTy in Haskell Core type definitions? haskell What AppTy FunTy Haskell Core TyVar Type TyVarTy Application TyConApp TyCon Arrow ForAllTy Polymorphic LitTy TyLit NumTyLit Integer StrTyLit FastStrin...

[ 0.01531982421875, -0.002410888671875, -0.000682830810546875, 0.017578125, 0.00142669677734375, -0.002532958984375, -0.004913330078125, -0.0234375, -0.000056743621826171875, 0.0186767578125, 0.0135498046875, -0.048828125, 0.00116729736328125, 0.010009765625, -0.0030670166015625, 0.02172...

[ 60212, 17721, 5659, 618, 53, 136, 28670, 20625, 142508, 31365, 10644, 80934, 1556, 4865, 8064, 81827, 60457, 104921, 11935, 39179, 1172, 15555, 1326, 43512, 63306, 178851, 27668, 866, 217, 52782, 44401, 23351, 25290, 71713, 104951, 77947, 73342...

[ 0.1717529296875, 0.058837890625, 0.20947265625, 0.2203369140625, 0.241455078125, 0.0704345703125, 0.20263671875, 0.11376953125, 0.2222900390625, 0.1748046875, 0.171142578125, 0.1358642578125, 0.086669921875, 0.021392822265625, 0.1343994140625, 0.15869140625, 0.15869140625, 0.167480...

embed

31196449_c1

31196449

haskell

1

link(name = "fibonacci")] extern { fn fibonacci_hs (n : i32); // c_int = i32 fn fib_init (); // start hs rts fn fib_exit (); // kill hs rts } fn main () { unsafe { fib_init(); for i in 0..100 { println!("{:?}th fibonacci : {:?}", i, fibonacci_hs(i)); } fib_exit(); } } And I compile with rustc main.rs -L . (since shared...

[ 0.0137939453125, 0.0137939453125, -0.0146484375, -0.003631591796875, -0.01007080078125, -0.01214599609375, 0.0020294189453125, -0.000621795654296875, -0.00677490234375, -0.04638671875, -0.0194091796875, -0.028564453125, 0.0042724609375, 0.016357421875, 0.008056640625, -0.0224609375, ...

[ 3126, 11627, 1029, 20990, 52544, 76714, 14783, 809, 127, 7, 19, 91887, 501, 4288, 2203, 6460, 275, 73, 217, 4034, 1096, 933, 13, 23399, 67153, 5201, 51, 115840, 17, 757, 3559, 28412, 927, 14, 9969, 1340, 678, 52648, 238, 4295, 866, 99...

[ 0.2459716796875, 0.107177734375, 0.140869140625, 0.1522216796875, 0.1759033203125, 0.2061767578125, 0.1175537109375, 0.175537109375, 0.0880126953125, 0.07061767578125, 0.0140533447265625, 0.189208984375, 0.0269775390625, 0.14599609375, 0.0003662109375, 0.197509765625, 0.10205078125, ...

embed

33839740_c1

33839740

haskell

1

to run the full game function War_Project_2.hs:138:46: Couldn't match expected type ‘[([Card], [Card])]’ with actual type ‘([Card], [Card]) -> [([Card], [Card])]’ Probable cause: ‘fullGame’ is applied to too few arguments In the second argument of ‘(:)’, namely ‘fullGame (r (x : xs, y : ys))’ In the expression: (x : x...

[ -0.01397705078125, -0.0096435546875, -0.005950927734375, -0.006072998046875, 0.0012664794921875, -0.00078582763671875, -0.0166015625, -0.007720947265625, -0.0001697540283203125, 0.020751953125, 0.0194091796875, 0.025146484375, 0.0096435546875, -0.0024871826171875, -0.0230712890625, 0.0...

[ 47, 11675, 4393, 6712, 32354, 5550, 223353, 5442, 127, 141535, 32909, 191147, 18, 14858, 84751, 10644, 156119, 678, 8561, 1250, 275, 2886, 22304, 25724, 107576, 190659, 5792, 10846, 10750, 17932, 12, 42, 425, 1022, 113, 125195, 35315, 60075, ...

[ 0.047821044921875, 0.147216796875, 0.1971435546875, 0.1834716796875, 0.1717529296875, 0.1636962890625, 0.19482421875, 0.122802734375, 0.032745361328125, 0.0838623046875, 0.1011962890625, 0.1181640625, 0.0489501953125, 0.1993408203125, 0.1849365234375, 0.191162109375, 0.2186279296875,...

embed

27834510_c0

27834510

haskell

0

Title: Not in scope in Haskell Problem title: Not in scope in Haskell Tags: scope, winghci, haskell Problem: Not in scope in Haskell When I try to compile the code from http://michaeldadams.org/papers/scrap_your_zippers/ScrapYourZippers.hs I get: ScrapYourZipper.hs:249:15: Not in scope: type variable ‘hole’ ScrapYourZi...

Not in scope in Haskell Not in scope in Haskell scope winghci haskell Not Haskell ScrapYourZipper.hs:249:15 ScrapYourZipper.hs:251:27 ScrapYourZipper.hs:252:20 ScrapYourZipper.hs:252:25 Context CtxtNull CtxtCons Data Left Right Not in scope in Haskell When I try to compile the code from http://michaeldadams.org/papers/...

[ 0.01422119140625, 0.013671875, -0.0084228515625, 0.031494140625, -0.015869140625, 0.01611328125, -0.027099609375, 0.00016307830810546875, -0.0162353515625, -0.01470947265625, -0.0184326171875, -0.037109375, 0.0030059814453125, 0.0036468505859375, 0.0203857421875, -0.00604248046875, -...

[ 11205, 23, 70820, 20625, 142508, 14775, 127, 318, 1556, 219536, 23562, 60348, 8079, 1126, 12221, 42, 21224, 27592, 16619, 22829, 124326, 18444, 1181, 11935, 11809, 636, 2480, 90911, 9790, 9969, 1340, 18151, 1436, 109235, 6229, 1478, 74377, 13...

[ 0.2025146484375, 0.17724609375, 0.246826171875, 0.1544189453125, 0.236328125, 0.091552734375, 0.0457763671875, 0.0986328125, 0.140625, 0.1968994140625, 0.06866455078125, 0.164306640625, 0.2135009765625, 0.029144287109375, 0.06585693359375, 0.055938720703125, 0.0933837890625, 0.0602...

embed

28054481_c0

28054481

haskell

0

Title: Type-level unification and Value-level pattern-matching with Encapsulated types Problem title: Type-level unification and Value-level pattern-matching with Encapsulated types Tags: pattern-matching, unification, haskell Problem: Type-level unification and Value-level pattern-matching with Encapsulated types I'm ...

Type-level unification and Value-level pattern-matching with Encapsulated types Type-level unification and Value-level pattern-matching with Encapsulated types pattern-matching unification haskell Type-level Value-level Encapsulated Init Wrap WNil WCons Will XExistentialQuantification Type-level unification and Value-l...

[ 0.003082275390625, 0.00592041015625, -0.003631591796875, -0.0035552978515625, -0.01123046875, -0.0203857421875, -0.0159912109375, -0.0228271484375, 0.007415771484375, 0.00439453125, -0.004180908203125, -0.004119873046875, 0.022216796875, -0.004058837890625, 0.001739501953125, -0.003829...

[ 60457, 67919, 51, 41274, 136, 190060, 103510, 98753, 678, 357, 15644, 77593, 52895, 1556, 142508, 360, 217, 13631, 379, 5245, 20255, 1193, 19279, 1419, 80973, 173495, 18, 112892, 18929, 375, 77087, 2053, 10644, 2965, 18151, 2060, 31089, 86681...

[ 0.1785888671875, 0.1673583984375, 0.1610107421875, 0.1212158203125, 0.0111083984375, 0.1463623046875, 0.14599609375, 0.1534423828125, 0.0579833984375, 0.0380859375, 0.153076171875, 0.1519775390625, 0.15771484375, 0.0819091796875, 0.18505859375, 0.0241851806640625, 0.06781005859375, ...

embed

20730518_c0

20730518

haskell

0

Title: Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? Problem title: Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? Tags: haskell, monads Problem: Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? I’ve been playing with Haskell on and off for...

Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? haskell monads Haskell What Haskell monads: What is the name for what `(>>=)` and `(=<<)` do? I’ve been playing with Haskell on and off for several years now; I’m q...

[ 0.019287109375, -0.000438690185546875, 0.0262451171875, 0.0086669921875, -0.00014400482177734375, 0.01513671875, 0.00494384765625, 0.003173828125, -0.010986328125, 0.0128173828125, -0.001007080078125, -0.019775390625, -0.01055908203125, 0.006103515625, 0.0002803802490234375, -0.0032653...

[ 20625, 142508, 2667, 712, 7, 12, 4865, 9351, 100, 2367, 9473, 132, 1230, 5386, 136, 1277, 54, 83, 1556, 30813, 1369, 16093, 2809, 75169, 678, 40368, 5369, 5036, 104577, 3642, 4488, 4527, 2856, 39933, 78690, 7464, 2301, 18, 3714, 22120, ...

[ 0.1522216796875, 0.2822265625, 0.1527099609375, 0.242431640625, 0.1434326171875, 0.046478271484375, 0.0633544921875, 0.1177978515625, 0.0673828125, 0.12060546875, 0.0645751953125, 0.0146484375, 0.07647705078125, 0.1632080078125, 0.19091796875, 0.06927490234375, 0.150634765625, 0.01...

embed

49415310_c0

49415310

haskell

0

Title: Using binary trees in Haskell - Trying to use paths Problem title: Using binary trees in Haskell - Trying to use paths Tags: binary-tree, list, haskell, branch Problem: Using binary trees in Haskell - Trying to use paths I'm struggling to go about this, so basically binary tree can be used as a database. Here, t...

Using binary trees in Haskell - Trying to use paths Using binary trees in Haskell - Trying to use paths binary-tree list haskell branch Using Haskell Trying Btree Data Branch Dir Path Error Using binary trees in Haskell - Trying to use paths I'm struggling to go about this, so basically binary tree can be used as a dat...

[ 0.02294921875, 0.0201416015625, -0.005157470703125, -0.000499725341796875, 0.035888671875, 0.018798828125, -0.0213623046875, -0.0228271484375, 0.003936767578125, -0.046875, -0.018310546875, -0.027099609375, -0.006591796875, 0.010986328125, -0.00689697265625, 0.016845703125, 0.0246582...

[ 345, 2394, 6635, 1360, 90, 20625, 142508, 40858, 4527, 60875, 23, 62600, 5303, 1556, 32845, 335, 11809, 21110, 19946, 108421, 212059, 7, 237875, 53201, 831, 11814, 237, 63399, 31358, 64633, 114141, 110, 2053, 104, 35735, 8337, 47, 95, 2407,...

[ 0.087890625, 0.187744140625, 0.1348876953125, 0.207763671875, 0.059478759765625, 0.1217041015625, 0.2318115234375, 0.09033203125, 0.1004638671875, 0.2017822265625, 0.008331298828125, 0.2425537109375, 0.1195068359375, 0.0950927734375, 0.05810546875, 0.0167694091796875, 0.0889892578125...

embed

59809488_c0

59809488

haskell

0

Title: How to get rid of annoying startup message from stack ghci? Problem title: How to get rid of annoying startup message from stack ghci? Tags: haskell-stack, haskell Problem: How to get rid of annoying startup message from stack ghci? I'm using stack ghci to start my REPL, based on the answer I got for my question...

How to get rid of annoying startup message from stack ghci? How to get rid of annoying startup message from stack ghci? haskell-stack haskell stack How How to get rid of annoying startup message from stack ghci? I'm using stack ghci to start my REPL, based on the answer I got for my question on how to import a module i...

[ -0.01544189453125, 0.01416015625, 0.00836181640625, 0.0194091796875, 0.0001964569091796875, -0.002838134765625, 0.009765625, -0.0030670166015625, -0.008056640625, -0.0299072265625, 0.00128936767578125, -0.014892578125, -0.0198974609375, 0.0185546875, -0.00152587890625, 0.011474609375, ...

[ 11249, 2046, 31351, 8668, 38543, 73882, 26008, 1295, 177261, 31380, 318, 1556, 142508, 590, 2594, 111, 17368, 4034, 9069, 21130, 24927, 88996, 20600, 678, 43240, 5885, 61475, 1631, 438, 4000, 30388, 58735, 111719, 26859, 110, 98169, 1274, 507...

[ 0.051239013671875, 0.0692138671875, 0.1392822265625, 0.1495361328125, 0.1044921875, 0.258056640625, 0.17724609375, 0.050933837890625, 0.2301025390625, 0.1273193359375, 0.176025390625, 0.092041015625, 0.1976318359375, 0.1231689453125, 0.12548828125, 0.055511474609375, 0.06646728515625...

embed

25452490_c1

25452490

haskell

1

see in parseArgs I'd like to bind the results of readFileEither to a lambda which continues to parses the arguments & file data. The value within the result of readFileEither is an Either String String . Since the result of parseArgs' is Either String Parameters I'd like to use Either 's monadic bind to bind the lambd...

[ -0.01446533203125, 0.00445556640625, -0.01141357421875, -0.0034637451171875, 0.007049560546875, 0.03369140625, 0.005401611328125, -0.024658203125, 0.0196533203125, -0.000659942626953125, -0.003692626953125, -0.045166015625, -0.0159912109375, -0.004547119140625, -0.00153350830078125, 0....

[ 1957, 366, 184, 7614, 9405, 1884, 68557, 50339, 12301, 174350, 647, 14, 9319, 47, 21, 6492, 85, 136622, 5908, 10750, 619, 11435, 2053, 34292, 28032, 16750, 4565, 23351, 214, 1720, 29089, 2667, 11, 18403, 107730, 17780, 10422, 10336, 9969, ...

[ 0.1563720703125, 0.116943359375, 0.0654296875, 0.154052734375, 0.179931640625, 0.057525634765625, 0.197998046875, 0.1456298828125, 0.1785888671875, 0.1820068359375, 0.0259552001953125, 0.07061767578125, 0.26904296875, 0.044952392578125, 0.030120849609375, 0.187744140625, 0.138671875,...

embed

31318755_c0

31318755

haskell

0

Title: What is the common workflow of using cabal for personal project? Problem title: What is the common workflow of using cabal for personal project? Tags: cabal, haskell Problem: What is the common workflow of using cabal for personal project? Assume I want to creat my own local library called MyLib , my workflow is...

What is the common workflow of using cabal for personal project? What is the common workflow of using cabal for personal project? cabal haskell cabal MyLib What MyLib.hs What is the common workflow of using cabal for personal project? Assume I want to creat my own local library called MyLib , my workflow is: So my ques...

[ -0.0004749298095703125, -0.000766754150390625, -0.00128936767578125, 0.0201416015625, -0.0181884765625, -0.007720947265625, -0.01031494140625, 0.014892578125, 0.004058837890625, -0.0283203125, 0.0022430419921875, -0.0162353515625, 0.0111083984375, 0.01214599609375, 0.0003070831298828125,...

[ 4865, 39210, 4488, 118664, 17368, 109524, 100, 3357, 13452, 1556, 142508, 2646, 104820, 5, 127, 7, 66596, 3444, 48107, 10002, 4000, 35773, 1294, 9655, 759, 213850, 5809, 11522, 5974, 408, 3571, 43882, 11728, 5612, 4527, 24927, 15700, 37202, ...

[ 0.048675537109375, 0.1656494140625, 0.13330078125, 0.257568359375, 0.138916015625, 0.2978515625, 0.100341796875, 0.1524658203125, 0.1329345703125, 0.097900390625, 0.194091796875, 0.1671142578125, 0.276123046875, 0.01446533203125, 0.1292724609375, 0.050262451171875, 0.0245513916015625...

embed

55421297_c0

55421297

haskell

0

Title: Haskell High Order Functions, Function Declaration Problem title: Haskell High Order Functions, Function Declaration Tags: function, type-declaration, haskell Problem: Haskell High Order Functions, Function Declaration I am studying for an exam and I'm confused at this function. Based on the output how do I know...

Haskell High Order Functions, Function Declaration Haskell High Order Functions, Function Declaration function type-declaration haskell Haskell High Order Functions Declaration x:xs y:ys Haskell High Order Functions, Function Declaration I am studying for an exam and I'm confused at this function. Based on the output h...

[ 0.01336669921875, 0.006256103515625, -0.0054931640625, 0.00372314453125, -0.002197265625, 0.013916015625, -0.0113525390625, -0.0198974609375, 0.00994873046875, 0.0128173828125, 0.004150390625, -0.012939453125, -0.01422119140625, -0.01397705078125, -0.009521484375, 0.0035858154296875, ...

[ 20625, 142508, 19694, 81206, 28670, 10763, 98501, 1363, 32354, 10644, 50718, 320, 1556, 1022, 12, 425, 7, 113, 4778, 35187, 42276, 55681, 99, 903, 140992, 3714, 21635, 83, 11, 33079, 876, 501, 151575, 28219, 11192, 12989, 23, 29459, 5646, ...

[ 0.1322021484375, 0.22119140625, 0.1666259765625, 0.216552734375, 0.1622314453125, 0.0780029296875, 0.211669921875, 0.017852783203125, 0.200439453125, 0.2139892578125, 0.1019287109375, 0.1510009765625, 0.1256103515625, 0.03369140625, 0.036834716796875, 0.0589599609375, 0.027587890625,...

embed

16880577_c0

16880577

haskell

0

Title: What's the history behind the Functor type class? Problem title: What's the history behind the Functor type class? Tags: haskell, category-theory, functor Problem: What's the history behind the Functor type class? I'm trying to gain a really deep understanding of the Monad hierarchy of classes. Part of...

What's the history behind the Functor type class? What's the history behind the Functor type class? haskell category-theory functor What Functor Monad Applicatives What's the history behind the Functor type class? I'm trying to gain a really deep understanding of the Monad hierarchy of classes. Part of that i...

[ 0.0086669921875, 0.011962890625, 0.0078125, 0.01513671875, 0.0184326171875, 0.00159454345703125, -0.000018596649169921875, -0.020263671875, -0.000904083251953125, -0.0208740234375, -0.006866455078125, -0.0537109375, -0.00579833984375, 0.00946044921875, -0.013916015625, 0.00656127929687...

[ 4865, 3768, 32692, 50155, 28670, 18770, 10644, 18507, 7, 1556, 142508, 95487, 2347, 7477, 60331, 71, 5659, 11048, 42991, 70, 100094, 1791, 147, 7668, 61112, 86681, 27781, 6097, 5117, 134053, 98365, 28219, 91, 21449, 1672, 61475, 29806, 17780,...

[ 0.0538330078125, 0.067138671875, 0.169677734375, 0.1627197265625, 0.23046875, 0.250244140625, 0.2191162109375, 0.2308349609375, 0.004791259765625, 0.1002197265625, 0.239501953125, 0.1400146484375, 0.050506591796875, 0.159912109375, 0.225341796875, 0.2257080078125, 0.1962890625, 0.2...

embed

26098313_c0

26098313

haskell

0

Title: How can I test whether integers from one list are divisible by integers from another? Problem title: How can I test whether integers from one list are divisible by integers from another? Tags: list, haskell Problem: How can I test whether integers from one list are divisible by integers from another? I'm trying ...

How can I test whether integers from one list are divisible by integers from another? How can I test whether integers from one list are divisible by integers from another? list haskell one another How addl::Int y:ys Couldn How can I test whether integers from one list are divisible by integers from another? I'm trying ...

[ -0.0294189453125, 0.0008697509765625, 0.0089111328125, -0.01092529296875, -0.01446533203125, 0.01080322265625, 0.005401611328125, -0.00848388671875, 0.013427734375, -0.0218505859375, 0.0230712890625, -0.00927734375, 0.01263427734375, 0.0181884765625, -0.019775390625, -0.0186767578125, ...

[ 11249, 831, 87, 3034, 36766, 892, 26255, 1295, 1632, 5303, 621, 45, 99017, 390, 15700, 1556, 142508, 15190, 141, 4153, 18, 113, 4778, 191147, 19, 31577, 28282, 32354, 51776, 360, 653, 472, 111, 91, 30646, 10554, 756, 101935, 106, 4426, ...

[ 0.0650634765625, 0.073486328125, 0.0338134765625, 0.228271484375, 0.1051025390625, 0.159423828125, 0.138916015625, 0.126953125, 0.0650634765625, 0.1854248046875, 0.03387451171875, 0.1136474609375, 0.216064453125, 0.10382080078125, 0.1275634765625, 0.045440673828125, 0.155029296875, ...

embed

37900415_c0

37900415

haskell

0

Title: Passing a source with ExceptT to a sink Problem title: Passing a source with ExceptT to a sink Tags: conduit, haskell Problem: Passing a source with ExceptT to a sink Given a conduit source with following type signature: sourceMsg :: MonadIO m => ExceptT Err (ConduitM () ByteString m) () how can it be passed to ...

Passing a source with ExceptT to a sink Passing a source with ExceptT to a sink conduit haskell Passing ExceptT MonadIO Err ConduitM ByteString Data.Conduit.List.mapM_ Either mapM_ Warning Couldn Expected Source Actual Passing a source with ExceptT to a sink Given a conduit source with following type signature: how can...

[ 0.01031494140625, 0.025390625, -0.0014495849609375, 0.009521484375, 0.00445556640625, 0.00982666015625, 0.00010442733764648438, 0.004241943359375, -0.00225830078125, -0.03271484375, 0.0042724609375, -0.0264892578125, 0.0302734375, 0.0150146484375, 0.002593994140625, 0.00049591064453125...

[ 28872, 31344, 678, 218288, 618, 47, 880, 92, 120565, 1556, 142508, 60331, 17780, 1004, 1657, 112061, 594, 3311, 67, 71713, 11809, 154663, 62346, 22288, 454, 5550, 191147, 60075, 13, 89829, 77641, 100582, 25632, 10644, 138256, 3642, 831, 11508...

[ 0.1263427734375, 0.2021484375, 0.007965087890625, 0.2117919921875, 0.1839599609375, 0.075439453125, 0.1566162109375, 0.0870361328125, 0.2120361328125, 0.075439453125, 0.2021484375, 0.076416015625, 0.1365966796875, 0.0631103515625, 0.051513671875, 0.1531982421875, 0.13037109375, 0.0...

embed

52973009_c1

52973009

haskell

1

If I use existential type classes, I could get away with making both Test and Suite derive "Node_" and then have Suite own a List of said Node s. Coproducts would allow something similar, where I'd essentially do the same Either strategy without the verbosity of the tags. Allow me to expand now with a more complex exa...

[ -0.016845703125, 0.002349853515625, 0.0013427734375, -0.01409912109375, 0.01043701171875, -0.015869140625, 0.010498046875, -0.009033203125, 0.042724609375, 0.0130615234375, -0.007049560546875, -0.0130615234375, -0.0267333984375, 0.012939453125, 0.0048828125, -0.0006256103515625, -0.0...

[ 4527, 99707, 15403, 10644, 61112, 5809, 16065, 20662, 8647, 136, 74899, 122, 5844, 5021, 112, 454, 10002, 32036, 438, 91, 1311, 57877, 7, 63769, 85590, 5701, 4565, 9319, 113857, 15490, 57823, 69141, 27140, 27781, 50339, 109921, 831, 40101, ...

[ 0.037506103515625, 0.1737060546875, 0.08740234375, 0.2049560546875, 0.1822509765625, 0.0164947509765625, 0.0982666015625, 0.009613037109375, 0.179931640625, 0.01971435546875, 0.214111328125, 0.0546875, 0.045501708984375, 0.1214599609375, 0.1239013671875, 0.034942626953125, 0.12194824...

embed

29089117_c0

29089117

haskell

0

Title: Haskell new line not working Problem title: Haskell new line not working Tags: newline, haskell Problem: Haskell new line not working Been messing around for about 20 minutes now trying to get the new line working however it always shows in GHCI as a single line. Here is what I enter into GHCi: displayFilm ("Sky...

Haskell new line not working Haskell new line not working newline haskell Haskell Skyfall Daniel Craig Judi Dench Ralph Fiennes Bill Olga Zoe Paula Megan Sam Wally Cast Year Fans x:xs Film Haskell new line not working Been messing around for about 20 minutes now trying to get the new line working however it always show...

[ 0.01446533203125, -0.0216064453125, 0.0157470703125, 0.0084228515625, -0.00958251953125, 0.01239013671875, 0.017578125, -0.00006961822509765625, -0.0034332275390625, 0.0260009765625, -0.0067138671875, -0.048828125, 0.004150390625, -0.0025177001953125, -0.0235595703125, 0.020263671875, ...

[ 20625, 142508, 3525, 13315, 959, 20697, 2256, 1556, 17689, 9146, 11555, 156201, 31625, 1575, 206, 179322, 563, 58258, 7, 19893, 129695, 5880, 13, 73212, 26842, 3362, 23706, 53, 32301, 42552, 105426, 425, 3847, 163, 38001, 10932, 387, 14633, ...

[ 0.17822265625, 0.3037109375, 0.165283203125, 0.2509765625, 0.05560302734375, 0.189697265625, 0.1822509765625, 0.1539306640625, 0.167724609375, 0.2685546875, 0.116455078125, 0.20361328125, 0.157470703125, 0.1119384765625, 0.14599609375, 0.123779296875, 0.028289794921875, 0.156005859...

embed

77413933_c1

77413933

haskell

1

to modify this (for example, we probably want deriving Eq on the Weekday data type). An attempt to solve this problem might look like import Data.Time.Calendar (Day, fromGregorian, dayOfWeek) {- Get all [Mondays|Tuesdays|..|Sundays] in the month -} allWeekdayOfMonth :: DayOfWeek -> Integer -> Int -> [Day] allWeekdayOf...

[ 0.00982666015625, -0.007720947265625, 0.00738525390625, -0.0086669921875, -0.0203857421875, 0.0107421875, -0.009521484375, 0.00191497802734375, 0.0022125244140625, -0.01416015625, 0.004425048828125, 0.025146484375, -0.01092529296875, 0.0179443359375, 0.00066375732421875, -0.00066375732...

[ 2811, 40383, 903, 31895, 3444, 16406, 6496, 241, 864, 98, 58417, 5636, 2053, 10644, 81887, 86869, 2967, 13648, 24927, 11809, 70059, 94553, 33, 1506, 97141, 1295, 91127, 519, 9893, 5155, 132887, 12137, 343, 20779, 756, 46674, 15665, 66279, 2...

[ 0.1383056640625, 0.128173828125, 0.03509521484375, 0.037445068359375, 0.04949951171875, 0.12158203125, 0.08447265625, 0.055419921875, 0.204345703125, 0.012298583984375, 0.1788330078125, 0.1922607421875, 0.1419677734375, 0.1593017578125, 0.09588623046875, 0.109619140625, 0.13220214843...

embed

7928005_c1

7928005

haskell

1

of f(f(a)), it will be recomputed rather than taken from the second list item because the state has changed. I also realize I could avoid this in my real-life application by putting my accumulating list inside the state. Nevertheless, there are two reasons for posting this. First, the point is that iterate is frequent...

[ 0.0011749267578125, -0.025146484375, 0.01373291015625, 0.0191650390625, -0.01275634765625, 0.0281982421875, 0.0020599365234375, 0.0198974609375, 0.026123046875, -0.000469207763671875, 0.014892578125, 0.0023956298828125, 0.00439453125, 0.0233154296875, -0.00244140625, 0.00494384765625, ...

[ 111, 1238, 132, 420, 11, 442, 1221, 186, 33844, 65970, 297, 43257, 39958, 1295, 17932, 5303, 35735, 6637, 11341, 1556, 98816, 92154, 71864, 2773, 24804, 38415, 183278, 1916, 46132, 70, 6626, 89397, 75220, 17, 8560, 67, 195409, 189050, 1239,...

[ 0.1114501953125, 0.122802734375, 0.03759765625, 0.121826171875, 0.10302734375, 0.01385498046875, 0.060150146484375, 0.041656494140625, 0.110107421875, 0.193115234375, 0.05279541015625, 0.03790283203125, 0.0888671875, 0.036102294921875, 0.1241455078125, 0.1754150390625, 0.136474609375...

embed

10286301_c0

10286301

haskell

0

Title: Overlapping instances error for Yesod and EclipseFP application Problem title: Overlapping instances error for Yesod and EclipseFP application Tags: eclipse-fp, eclipse, haskell, yesod Problem: Overlapping instances error for Yesod and EclipseFP application I created an application with EclipseFP, the yesod appl...

Overlapping instances error for Yesod and EclipseFP application Overlapping instances error for Yesod and EclipseFP application eclipse-fp eclipse haskell yesod Overlapping Yesod EclipseFP What Here Could OverlappingInstances Use Failed Prelude Overlapping instances error for Yesod and EclipseFP application I created a...

[ 0.006378173828125, 0.00701904296875, 0.0052490234375, -0.0152587890625, -0.01129150390625, 0.0216064453125, -0.0108642578125, -0.00750732421875, -0.006103515625, -0.0299072265625, -0.00799560546875, -0.0294189453125, -0.001861572265625, 0.01171875, 0.0024566650390625, -0.00698852539062...

[ 9578, 143, 26783, 110527, 7, 18499, 32635, 2199, 136, 234962, 51006, 38415, 106371, 184, 420, 254, 1556, 142508, 2422, 23722, 11853, 191147, 116071, 36836, 190355, 297, 1914, 822, 75935, 678, 1810, 16530, 53550, 9790, 11675, 24931, 5, 127, ...

[ 0.139404296875, 0.2218017578125, 0.15625, 0.2210693359375, 0.01226806640625, 0.169677734375, 0.1241455078125, 0.212158203125, 0.0631103515625, 0.2099609375, 0.2095947265625, 0.124267578125, 0.1607666015625, 0.1004638671875, 0.06304931640625, 0.09619140625, 0.0772705078125, 0.210937...

embed

27667546_c1

27667546

haskell

1

Action (Action c) = c -- Make an Action out of a Pure liftComp :: Computation a -> Computation a liftComp (Pure c) = Action $ return . c liftComp a@(Action _) = a So the only missing part is the givesPure function and I'm not sure if it's even possible to implement it. I once had an implementation like this: givesPure ...

[ -0.03271484375, 0.012451171875, 0.0184326171875, 0.00061798095703125, -0.0013885498046875, 0.033203125, 0.001190185546875, -0.0045166015625, 0.003387451171875, -0.0184326171875, -0.0172119140625, 0.01287841796875, -0.001220703125, 0.025634765625, 0.0021209716796875, 0.00579833984375, ...

[ 57945, 284, 10763, 501, 2203, 26176, 1810, 111, 118233, 60520, 108161, 1984, 159415, 2320, 10, 683, 3408, 3650, 30646, 981, 101, 4734, 132283, 2831, 76199, 32354, 9077, 3853, 7722, 29479, 24145, 208124, 1884, 903, 876, 2460, 929, 1238, 83, ...

[ 0.23486328125, 0.137451171875, 0.171630859375, 0.1531982421875, 0.0621337890625, 0.1004638671875, 0.08935546875, 0.0435791015625, 0.23388671875, 0.2310791015625, 0.21044921875, 0.008148193359375, 0.1864013671875, 0.083984375, 0.0859375, 0.1229248046875, 0.23095703125, 0.07458496093...

embed

73120032_c0

73120032

haskell

0

Title: Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? Problem title: Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? Tags: hackage, ffi, haskell, c, c-preprocessor Problem: Haskell FFI includes: is there a difference ...

Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? Haskell FFI includes: is there a difference between including <xx.hs> and "xx.hs"? hackage ffi haskell c c-preprocessor Haskell FFI xx.hs stdio.h HsFFI.h qhull_ra.h Haskell FFI includes: is there a differe...

[ 0.017578125, 0.0033111572265625, -0.00823974609375, -0.0031890869140625, -0.0145263671875, -0.01239013671875, 0.0081787109375, 0.00013446807861328125, -0.006805419921875, 0.006622314453125, 0.017578125, -0.0205078125, -0.006927490234375, 0.0118408203125, -0.000946044921875, -0.00172424...

[ 20625, 142508, 563, 22724, 96853, 83, 2685, 10, 60212, 17721, 26719, 1277, 52219, 5, 127, 7, 5386, 136, 41502, 85526, 4588, 24500, 1556, 501, 4692, 63923, 113664, 6138, 5670, 572, 30110, 568, 8096, 63758, 219, 4488, 18151, 765, 959, 59121...

[ 0.1182861328125, 0.2076416015625, 0.09027099609375, 0.2080078125, 0.2164306640625, 0.004547119140625, 0.00970458984375, 0.0216522216796875, 0.19140625, 0.078857421875, 0.269287109375, 0.05023193359375, 0.1883544921875, 0.1300048828125, 0.176025390625, 0.154052734375, 0.06671142578125...

embed

6528770_c0

6528770

haskell

0

Title: Haskell typeclass hierarchy issue Problem title: Haskell typeclass hierarchy issue Tags: typeclass, haskell Problem: Haskell typeclass hierarchy issue I have a scenario that involves type classes and I'm not quite sure how to go about solving it. I have class Event a where timestamp :: a -> UTCTime rawData :: a ...

Haskell typeclass hierarchy issue Haskell typeclass hierarchy issue typeclass haskell Haskell Event UTCTime ByteString Something SomethingElse Haskell typeclass hierarchy issue I have a scenario that involves type classes and I'm not quite sure how to go about solving it. I have In my code, I want to create an object t...

[ -0.00103759765625, 0.0064697265625, 0.004119873046875, 0.0146484375, -0.014892578125, 0.004913330078125, -0.010498046875, 0.0020599365234375, 0.00860595703125, -0.02197265625, -0.00726318359375, -0.03564453125, 0.0004673004150390625, 0.01116943359375, -0.01708984375, -0.0234375, -0.0...

[ 20625, 142508, 10644, 67413, 1791, 147, 7668, 31089, 1556, 36943, 99577, 70059, 3311, 67, 71713, 200905, 7623, 87, 106117, 83687, 61112, 9077, 3115, 6496, 765, 18151, 3444, 28282, 36746, 29479, 15044, 136, 24233, 50218, 70, 32354, 9844, 3871,...

[ 0.1375732421875, 0.22509765625, 0.2059326171875, 0.245849609375, 0.1378173828125, 0.15869140625, 0.1165771484375, 0.1656494140625, 0.1270751953125, 0.1824951171875, 0.12109375, 0.1295166015625, 0.0452880859375, 0.045166015625, 0.09344482421875, 0.1700439453125, 0.15283203125, 0.009...

embed

68117958_c0

68117958

haskell

0

Title: VS Code Haskell extension - Couldn't figure out what GHC version the project is using Problem title: VS Code Haskell extension - Couldn't figure out what GHC version the project is using Tags: visual-studio-code, haskell-stack, haskell Problem: VS Code Haskell extension - Couldn't figure out what GHC v...

VS Code Haskell extension - Couldn't figure out what GHC version the project is using VS Code Haskell extension - Couldn't figure out what GHC version the project is using visual-studio-code haskell-stack haskell Haskell Couldn GHC metadata.json package.yaml README.md ResistorColors.hs stack.yaml Tests.hs VS ...

[ 0.000797271728515625, 0.02392578125, 0.0086669921875, 0.0142822265625, 0.00555419921875, -0.0025482177734375, -0.0341796875, 0.00830078125, -0.0211181640625, -0.006927490234375, -0.010498046875, -0.034912109375, -0.0000782012939453125, 0.0081787109375, -0.00872802734375, 0.011108398437...

[ 44160, 28864, 20625, 142508, 111938, 191147, 3768, 18, 26366, 1810, 2367, 527, 73265, 11389, 13452, 83, 17368, 21176, 52629, 40899, 1556, 23550, 10135, 170, 1681, 98169, 14520, 141, 188300, 54686, 9624, 164, 78457, 127, 177261, 8647, 9803, 26...

[ 0.1845703125, 0.199951171875, 0.1246337890625, 0.22412109375, 0.1485595703125, 0.05780029296875, 0.0186309814453125, 0.0214996337890625, 0.1390380859375, 0.059173583984375, 0.072998046875, 0.1278076171875, 0.223876953125, 0.1776123046875, 0.1412353515625, 0.0262908935546875, 0.110473...

embed

36090261_c0

36090261

haskell

0

Title: Hoogle and yesod - how to easily find functions in non-default packages Problem title: Hoogle and yesod - how to easily find functions in non-default packages Tags: haskell, ghci, hoogle, terminal, yesod Problem: Hoogle and yesod - how to easily find functions in non-default packages I installed hoogle, using st...

Hoogle and yesod - how to easily find functions in non-default packages Hoogle and yesod - how to easily find functions in non-default packages haskell ghci hoogle terminal yesod Hoogle MonadHandler Text Warning Unknown Hoogle and yesod - how to easily find functions in non-default packages I installed hoogle, using st...

[ -0.021240234375, 0.0013580322265625, 0.00148773193359375, 0.0185546875, -0.0255126953125, 0.02001953125, 0.0034942626953125, -0.0244140625, -0.0030517578125, -0.026611328125, -0.00970458984375, -0.058837890625, -0.0037841796875, -0.010009765625, 0.006011962890625, -0.01226806640625, ...

[ 152488, 133, 136, 2422, 23722, 3642, 72546, 7413, 32354, 23, 351, 214810, 98169, 1556, 142508, 31380, 318, 28994, 33949, 60331, 71, 135679, 603, 24129, 5550, 69723, 20600, 177261, 831, 33938, 100, 17368, 75101, 1884, 903, 1295, 74855, 14364, ...

[ 0.20263671875, 0.25927734375, 0.0740966796875, 0.1253662109375, 0.2039794921875, 0.05206298828125, 0.15673828125, 0.1776123046875, 0.2164306640625, 0.09503173828125, 0.16015625, 0.220458984375, 0.1923828125, 0.07403564453125, 0.1851806640625, 0.0888671875, 0.147216796875, 0.1760253...

embed

23840774_c0

23840774

haskell

0

Title: haskell how to print when function doesn't return IO monad? Problem title: haskell how to print when function doesn't return IO monad? Tags: haskell, io, monads Problem: haskell how to print when function doesn't return IO monad? I following type and monad based on it: data Err a = Ok a | Bad String de...

haskell how to print when function doesn't return IO monad? haskell how to print when function doesn't return IO monad? haskell io monads Err Bad Read Show Ord Monad Functor Stm State s:_ PrintStmt haskell how to print when function doesn't return IO monad? I following type and monad based on it: I've also fu...

[ -0.0225830078125, -0.0057373046875, -0.004364013671875, 0.00299072265625, 0.0213623046875, 0.0048828125, -0.0009307861328125, -0.0272216796875, -0.01385498046875, -0.003814697265625, 0.010498046875, -0.051025390625, 0.003173828125, -0.00836181640625, 0.009765625, -0.01031494140625, -...

[ 1556, 142508, 3642, 47, 28412, 3229, 32354, 22027, 3768, 18, 30646, 17780, 2667, 712, 22995, 1004, 42, 12745, 4764, 17367, 35379, 60331, 71, 28670, 18770, 2907, 39, 22836, 39754, 37455, 25632, 10644, 35509, 162, 420, 49119, 3564, 18499, 142...

[ 0.110595703125, 0.2080078125, 0.09368896484375, 0.05889892578125, 0.236083984375, 0.1685791015625, 0.187744140625, 0.160400390625, 0.0628662109375, 0.1727294921875, 0.1961669921875, 0.2078857421875, 0.12255859375, 0.1749267578125, 0.19970703125, 0.044189453125, 0.008544921875, 0.11...

embed

22008198_c1

22008198

haskell

1

return value like "finished" or whatever. The explanation should be in very basic, practical, plain-spoken, matter of fact terms, spoken in an almost unsophisticated or juvenile way. The explanation should not focus on how it does what it does, why it does what it does, or what goes on inside this operator or operator...

[ -0.004119873046875, 0.00775146484375, 0.0159912109375, 0.02880859375, -0.0022125244140625, 0.0191650390625, -0.01446533203125, -0.0341796875, 0.0015411376953125, -0.00013828277587890625, 0.02001953125, -0.0019378662109375, -0.005126953125, -0.01123046875, 0.0169677734375, 0.00799560546...

[ 30646, 34292, 1884, 48310, 67175, 89778, 581, 187136, 5608, 186, 23, 4552, 62822, 138155, 111719, 11955, 26866, 15824, 69407, 113091, 146459, 959, 32153, 3642, 14602, 15400, 46132, 39933, 4527, 12665, 136, 6044, 27781, 35133, 36716, 26785, 1883...

[ 0.230712890625, 0.2340087890625, 0.1220703125, 0.1934814453125, 0.198486328125, 0.046142578125, 0.04559326171875, 0.28857421875, 0.114501953125, 0.023101806640625, 0.011199951171875, 0.00323486328125, 0.138427734375, 0.162353515625, 0.040985107421875, 0.054779052734375, 0.03439331054...

embed

7349186_c0

7349186

haskell

0

Title: Why is [1..n] not handled the same way as [n..1] in Haskell? Problem title: Why is [1..n] not handled the same way as [n..1] in Haskell? Tags: haskell, list Problem: Why is [1..n] not handled the same way as [n..1] in Haskell? I was trying to solve a problem that required the maximum value of a list after being ...

Why is [1..n] not handled the same way as [n..1] in Haskell? Why is [1..n] not handled the same way as [n..1] in Haskell? haskell list Why n..1 Haskell a..b Prelude.maximum foldl1 Why is [1..n] not handled the same way as [n..1] in Haskell? I was trying to solve a problem that required the maximum value of a list after...

[ -0.015625, -0.009521484375, 0.0166015625, -0.00173187255859375, -0.00970458984375, 0.02099609375, 0.00286865234375, -0.0283203125, 0.0026397705078125, 0.005126953125, 0.004852294921875, -0.006500244140625, -0.00115203857421875, 0.0098876953125, 0.013671875, -0.00823974609375, 0.01611...

[ 44084, 83, 68252, 5, 19, 959, 34831, 71, 5701, 3917, 237, 76172, 20625, 142508, 23, 1556, 5303, 653, 418, 10, 275, 1914, 822, 112, 192, 53950, 316, 18344, 20469, 86869, 2967, 56065, 38132, 34292, 291, 645, 32354, 37457, 1295, 47, 876, ...

[ 0.12890625, 0.034912109375, 0.1434326171875, 0.06671142578125, 0.140380859375, 0.1116943359375, 0.146484375, 0.050140380859375, 0.0748291015625, 0.0606689453125, 0.05157470703125, 0.09918212890625, 0.1549072265625, 0.249267578125, 0.044830322265625, 0.1318359375, 0.1810302734375, 0...

embed

42589612_c1

42589612

haskell

1

ActionF s) a } deriving (Functor, Applicative, Monad) liftActionF :: ActionF s next -> Action s next liftActionF = Action . liftF instance MonadState s (Action s) where state = liftActionF . StateAction . state liftAction :: Action AppState a -> Action s a liftAction = liftActionF . LiftAction execApp :: Action AppStat...

[ -0.01904296875, 0.0003948211669921875, -0.004974365234375, -0.01116943359375, -0.01104736328125, 0.000507354736328125, -0.0172119140625, -0.00445556640625, 0.0024871826171875, -0.00081634521484375, 0.0186767578125, 0.0147705078125, -0.01470947265625, 0.02880859375, -0.0174560546875, -0...

[ 57945, 919, 91, 10, 51912, 16406, 6496, 97249, 18770, 5659, 11048, 4935, 60331, 71, 60520, 284, 10763, 1984, 11737, 33079, 2203, 5, 110527, 135206, 13, 7440, 11341, 22836, 166562, 1119, 3240, 39179, 618, 17780, 22631, 42822, 81437, 47, 9506...

[ 0.296630859375, 0.258056640625, 0.1629638671875, 0.10888671875, 0.0628662109375, 0.1982421875, 0.18701171875, 0.1644287109375, 0.169921875, 0.1517333984375, 0.1529541015625, 0.1282958984375, 0.185791015625, 0.13037109375, 0.26025390625, 0.12060546875, 0.2274169921875, 0.05050659179...

embed

33065965_c0

33065965

haskell

0

Title: Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? Problem title: Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? Tags: haskell, agda, idris, type-theory, dependent-type ...

Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? Dependent types can prove your code is correct up to a specification. But how do you prove the specification is correct? haskell agda idris type-theory dependent-type Dependent But List SortedList De...

[ 0.000591278076171875, 0.0106201171875, 0.00090789794921875, -0.005096435546875, -0.0106201171875, -0.0093994140625, -0.01043701171875, 0.00592041015625, 0.01513671875, -0.00677490234375, -0.0167236328125, -0.001953125, 0.00640869140625, 0.015869140625, -0.00144195556640625, -0.00212097...

[ 262, 26885, 660, 52895, 831, 23534, 18151, 83, 26785, 1257, 47, 29458, 2320, 4966, 3642, 54, 398, 1556, 142508, 1377, 85, 3679, 10644, 2347, 30675, 108750, 50986, 32036, 53666, 297, 154663, 935, 27983, 200316, 3917, 2886, 33657, 1528, 37170...

[ 0.1485595703125, 0.2144775390625, 0.146240234375, 0.2587890625, 0.05377197265625, 0.195068359375, 0.1695556640625, 0.073486328125, 0.1961669921875, 0.081298828125, 0.09539794921875, 0.218017578125, 0.09588623046875, 0.08392333984375, 0.063232421875, 0.033660888671875, 0.0360412597656...

embed

24236244_c0

24236244

haskell

0

Title: Using `Maybe` with Data Constructor Problem title: Using `Maybe` with Data Constructor Tags: haskell Problem: Using `Maybe` with Data Constructor I'm working on implementing a todo command-line app in Haskell. Thanks for Learn You a Haskell for the challenge. In particular, I'm curious about my Action data const...

Using `Maybe` with Data Constructor Using `Maybe` with Data Constructor haskell Using Maybe Data Constructor Action Add View Delete Just None Not Using `Maybe` with Data Constructor I'm working on implementing a todo command-line app in Haskell. Thanks for Learn You a Haskell for the challenge. In particular, I'm curio...

[ -0.0244140625, -0.00067138671875, 0.0107421875, 0.0076904296875, 0.01104736328125, 0.0213623046875, 0.0074462890625, 0.000843048095703125, -0.0030364990234375, -0.006195068359375, -0.0033111572265625, -0.0274658203125, 0.0196533203125, 0.00421142578125, -0.01318359375, -0.0104370117187...

[ 345, 6953, 9473, 82419, 372, 678, 11809, 82084, 18770, 1556, 142508, 83425, 57945, 29117, 29805, 262, 46485, 9563, 438, 11205, 20697, 29479, 1973, 75101, 2256, 4027, 20625, 134031, 2583, 66801, 193844, 2053, 64549, 748, 189085, 198343, 10644, ...

[ 0.1517333984375, 0.0894775390625, 0.007049560546875, 0.2249755859375, 0.26611328125, 0.142822265625, 0.15771484375, 0.2249755859375, 0.1895751953125, 0.108154296875, 0.2108154296875, 0.349365234375, 0.240966796875, 0.1165771484375, 0.2413330078125, 0.1192626953125, 0.181884765625, ...

embed

20769183_c0

20769183

haskell

0

Title: `cabal update` failed due to `out of memory` Problem title: `cabal update` failed due to `out of memory` Tags: haskell, haskell-platform, cabal Problem: `cabal update` failed due to `out of memory` Here is what cabal update outputs: Downloading the latest package list from hackage.haskell.org cabal: out of memor...

`cabal update` failed due to `out of memory` `cabal update` failed due to `out of memory` haskell haskell-platform cabal hackage.haskell.org version Downloading index.cache index.tar.gz index.tar Cabal `cabal update` failed due to `out of memory` Here is what cabal update outputs: The reason may be shortage of memory. ...

[ 0.00579833984375, 0.0177001953125, 0.0191650390625, 0.0103759765625, 0.01025390625, 0.0069580078125, -0.0267333984375, 0.01806640625, 0.004638671875, 0.01177978515625, 0.01422119140625, -0.045654296875, -0.00162506103515625, 0.01202392578125, 0.032470703125, 0.0034942626953125, 0.025...

[ 408, 3571, 28350, 165523, 4743, 47, 6056, 111, 98323, 1556, 142508, 172121, 109524, 85526, 4588, 10557, 1478, 11389, 4857, 63262, 5, 1430, 867, 177, 30438, 289, 11853, 140992, 31635, 1543, 186, 16610, 4865, 46741, 7227, 4711, 831, 7026, 725...

[ 0.156494140625, 0.25244140625, 0.2183837890625, 0.206787109375, 0.104736328125, 0.0220184326171875, 0.21826171875, 0.186767578125, 0.221435546875, 0.115478515625, 0.2098388671875, 0.103515625, 0.28857421875, 0.1669921875, 0.1202392578125, 0.07904052734375, 0.0703125, 0.086242675781...

embed

45735186_c0

45735186

haskell

0

Title: Where can I see how Haskell modules have been restructured? Problem title: Where can I see how Haskell modules have been restructured? Tags: haskell Problem: Where can I see how Haskell modules have been restructured? Since the recent update of Haskell on my system, I'm getting numerous import errors. For exampl...

Where can I see how Haskell modules have been restructured? Where can I see how Haskell modules have been restructured? haskell Data.List.Split Data.String.Utils Where Haskell Crypto Enigma.hs:64:1 Could Use Enigma.hs:70:1 Where can I see how Haskell modules have been restructured? Since the recent update of Haskell on...

[ -0.01202392578125, 0.00732421875, 0.0023040771484375, 0.0125732421875, 0.00531005859375, 0.035400390625, 0.004791259765625, -0.0022735595703125, 0.00714111328125, 0.0279541015625, -0.0031890869140625, -0.044921875, 0.0213623046875, 0.004730224609375, 0.006439208984375, -0.0005416870117...

[ 78662, 831, 1957, 3642, 20625, 142508, 88996, 7, 765, 2809, 456, 137656, 71, 87, 1556, 11809, 154663, 4353, 71713, 106742, 7870, 201543, 357, 872, 192, 127, 13307, 19721, 191147, 36836, 5757, 17309, 28350, 5426, 183851, 24927, 18499, 3687, ...

[ 0.042236328125, 0.0672607421875, 0.14697265625, 0.05145263671875, 0.1488037109375, 0.266845703125, 0.2088623046875, 0.04705810546875, 0.0404052734375, 0.04412841796875, 0.123291015625, 0.2347412109375, 0.0899658203125, 0.003814697265625, 0.116455078125, 0.07037353515625, 0.0660400390...

embed

49156644_c0

49156644

haskell

0

Title: How to use assocs with HashMap in Haskell Problem title: How to use assocs with HashMap in Haskell Tags: dictionary, haskell Problem: How to use assocs with HashMap in Haskell Currently I'm trying to use the Map's assocs method, but unable to figure out how to get it to work for a HashMap. For a regular Map the ...

How to use assocs with HashMap in Haskell How to use assocs with HashMap in Haskell dictionary haskell qualified How HashMap Haskell Data.Map M.fromList M.assocs M.lookup Data.HashMap.Lazy Not How to use assocs with HashMap in Haskell Currently I'm trying to use the Map's assocs method, but unable to figure out how to ...

[ -0.0230712890625, -0.009033203125, 0.009521484375, 0.01708984375, 0.00433349609375, -0.00213623046875, 0.00958251953125, -0.0009918212890625, 0.003936767578125, -0.044189453125, -0.01202392578125, -0.016845703125, 0.002532958984375, 0.005828857421875, 0.017578125, -0.010498046875, -0...

[ 11249, 4527, 63927, 4439, 678, 162087, 166179, 20625, 142508, 23, 10763, 1556, 217225, 11809, 276, 161063, 154663, 73395, 64747, 2037, 6495, 1495, 2729, 3285, 11205, 42719, 55300, 4488, 20324, 25632, 43240, 5885, 9790, 18, 24927, 35782, 18499, ...

[ 0.0231475830078125, 0.129638671875, 0.199462890625, 0.225341796875, 0.09625244140625, 0.1871337890625, 0.2283935546875, 0.1357421875, 0.2239990234375, 0.0273590087890625, 0.05615234375, 0.1282958984375, 0.163330078125, 0.059814453125, 0.1123046875, 0.06085205078125, 0.06689453125, ...

embed

66506311_c1

66506311

haskell

1

basic basic.hs [1 of 1] Compiling Main ( basic.hs, basic.o ) basic.hs:4:5: error: • Could not deduce (MultiAgentEnvironment e s a0) from the context: MultiAgentEnvironment e s a bound by the type signature for: baseState :: forall e s a. MultiAgentEnvironment e s a => e -> s at basic.hs:4:5-23 The type variable ‘a0’ i...

[ -0.0230712890625, -0.00127410888671875, 0.0024871826171875, 0.028076171875, -0.00086212158203125, 0.0079345703125, -0.0306396484375, 0.003326416015625, -0.017822265625, -0.007720947265625, -0.021240234375, -0.0244140625, -0.00665283203125, 0.00787353515625, -0.01544189453125, -0.015441...

[ 62822, 127, 7, 15612, 49725, 12321, 5, 31, 617, 758, 18499, 768, 191147, 959, 8, 106357, 50657, 118, 284, 46825, 7768, 686, 1900, 674, 28, 91, 10, 77495, 1295, 43701, 19335, 99091, 10644, 138256, 3647, 135206, 100, 5584, 33079, 37620, 7...

[ 0.226806640625, 0.138916015625, 0.1019287109375, 0.1048583984375, 0.16259765625, 0.1268310546875, 0.001220703125, 0.1153564453125, 0.0845947265625, 0.1123046875, 0.15380859375, 0.001434326171875, 0.1549072265625, 0.0814208984375, 0.14892578125, 0.1929931640625, 0.10125732421875, 0....

embed

67551971_c0

67551971

haskell

0

Title: create a haskell function that returns the definition of a Haskell function that implements the expression Problem title: create a haskell function that returns the definition of a Haskell function that implements the expression Tags: haskell Problem: create a haskell function that returns the definition of a Ha...

create a haskell function that returns the definition of a Haskell function that implements the expression create a haskell function that returns the definition of a Haskell function that implements the expression haskell Haskell Exp Num Integer OpExp Plus Times Minus Lib create a haskell function that returns the defi...

[ 0.0235595703125, -0.0059814453125, -0.00860595703125, 0.0244140625, 0.001495361328125, 0.0301513671875, 0.00775146484375, -0.008544921875, -0.00138092041015625, 0.002777099609375, -0.0033111572265625, -0.01446533203125, 0.00982666015625, 0.00970458984375, 0.003875732421875, 0.008544921...

[ 28282, 1556, 142508, 32354, 30646, 80934, 20625, 29479, 125195, 60075, 52782, 44401, 2331, 19279, 254, 8183, 19114, 24169, 43278, 450, 25632, 2053, 10644, 1884, 18151, 51776, 9351, 136, 134381, 70541, 77336, 707, 53, 27781, 31577, 163846, 3584,...

[ 0.10107421875, 0.1396484375, 0.252197265625, 0.210205078125, 0.165283203125, 0.18505859375, 0.1363525390625, 0.1802978515625, 0.2279052734375, 0.2137451171875, 0.1339111328125, 0.094482421875, 0.0841064453125, 0.1002197265625, 0.0948486328125, 0.1141357421875, 0.1146240234375, 0.15...

embed

58211077_c1

58211077

haskell

1

the function such that the type of the arguments matches up with the resulting function type. In an impredicative system, the type being substituted may be any type whatsoever, including a type that is itself polymorphic; thus append can be applied to pairs of lists with elements of any type—even to lists of polymorph...

[ -0.005340576171875, 0.0047607421875, 0.01513671875, 0.004180908203125, 0.015869140625, 0.03759765625, -0.00970458984375, 0.0067138671875, 0.016357421875, -0.00885009765625, 0.03076171875, -0.031982421875, -0.0189208984375, -0.005462646484375, 0.00396728515625, -0.018798828125, 0.0185...

[ 70, 32354, 6044, 10644, 10750, 7, 14858, 90, 1257, 678, 16750, 73340, 18601, 4935, 5426, 8035, 161740, 297, 1543, 186, 2499, 2367, 68034, 35874, 178851, 1771, 114689, 71, 831, 190659, 80836, 5303, 80854, 63306, 8780, 23, 46876, 39456, 83, ...

[ 0.00091552734375, 0.1824951171875, 0.08447265625, 0.260986328125, 0.2086181640625, 0.016815185546875, 0.11328125, 0.00250244140625, 0.0140380859375, 0.0164031982421875, 0.03277587890625, 0.1929931640625, 0.22705078125, 0.1326904296875, 0.189208984375, 0.0146484375, 0.1951904296875, ...

embed

14333570_c0

14333570

haskell

0

Title: How to properly optimize MArray functions for speed? Problem title: How to properly optimize MArray functions for speed? Tags: haskell, marray, performance, ghc, arrays Problem: How to properly optimize MArray functions for speed? I'm working on a sorting library for MArrays . Speed is important, so I want to op...

How to properly optimize MArray functions for speed? How to properly optimize MArray functions for speed? haskell marray performance ghc arrays How MArray How to properly optimize MArray functions for speed? I'm working on a sorting library for MArrays . Speed is important, so I want to optimize it as much as possible....

[ 0.0111083984375, 0.0037994384765625, 0.0186767578125, -0.01904296875, -0.020263671875, -0.00811767578125, -0.007293701171875, -0.022705078125, 0.021728515625, 0.006195068359375, 0.0003986358642578125, 0.00457763671875, 0.01141357421875, -0.01177978515625, -0.01422119140625, -0.01586914...

[ 11249, 155965, 15572, 20650, 9267, 42, 7092, 32354, 7, 100, 38352, 1556, 142508, 1108, 23718, 31380, 238, 10298, 4778, 47, 20697, 12096, 214, 35773, 1294, 16461, 63349, 5526, 3444, 42856, 5881, 57339, 1257, 18151, 209, 20028, 154186, 351, 1...

[ 0.0875244140625, 0.1370849609375, 0.2174072265625, 0.10986328125, 0.078125, 0.1031494140625, 0.318603515625, 0.2213134765625, 0.0662841796875, 0.0556640625, 0.2098388671875, 0.10186767578125, 0.2271728515625, 0.1160888671875, 0.1468505859375, 0.05615234375, 0.05596923828125, 0.1120...

embed

23882519_c0

23882519

haskell

0

Title: Applicative something operator in Haskell Problem title: Applicative something operator in Haskell Tags: haskell, javascript Problem: Applicative something operator in Haskell I've been trying to implement a Promise in Haskell based on some JavaScript videos. While I already did it like this data Promise a = Pen...

Applicative something operator in Haskell Applicative something operator in Haskell haskell javascript Applicative Haskell Promise PendingPromise ResolvedPromise BrokenPromise Show Future Just Applicative something operator in Haskell I've been trying to implement a Promise in Haskell based on some JavaScript videos. W...

[ 0.0004367828369140625, 0.01434326171875, -0.00628662109375, 0.0272216796875, 0.01416015625, 0.0238037109375, 0.00848388671875, -0.007781982421875, 0.000026226043701171875, -0.018798828125, -0.006439208984375, -0.02490234375, 0.0137939453125, 0.00933837890625, 0.00372314453125, -0.02453...

[ 5659, 11048, 4935, 9844, 39933, 20625, 142508, 23, 1556, 136951, 1250, 5453, 4267, 6238, 10752, 86918, 13177, 1098, 17367, 94724, 9563, 31577, 29479, 35509, 17925, 21930, 21771, 442, 1884, 903, 149016, 18507, 58735, 14432, 55300, 3853, 11522, ...

[ 0.148193359375, 0.202392578125, 0.12890625, 0.171142578125, 0.266845703125, 0.151123046875, 0.2310791015625, 0.0350341796875, 0.1453857421875, 0.1497802734375, 0.173583984375, 0.2220458984375, 0.1611328125, 0.1285400390625, 0.1595458984375, 0.1785888671875, 0.1295166015625, 0.09350...

embed

25262734_c1

25262734

haskell

1

3 total), using -N1) SPARKS: 11 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 11 fizzled) INIT time 0.00s ( 0.00s elapsed) MUT time 10.13s ( 10.13s elapsed) GC time 0.11s ( 0.11s elapsed) EXIT time 0.00s ( 0.00s elapsed) Total time 10.25s ( 10.25s elapsed) Alloc rate 266,683,731 bytes per MUT second Productivity 98.9% of ...

[ -0.02490234375, 0.010986328125, -0.0115966796875, -0.019287109375, 0.0098876953125, -0.01318359375, -0.01434326171875, -0.004119873046875, -0.005401611328125, -0.0179443359375, 0.0052490234375, -0.01129150390625, 0.001068115234375, -0.007476806640625, 0.00408935546875, 0.002685546875, ...

[ 138, 3622, 247, 17368, 20, 839, 17727, 159, 60436, 20113, 12, 534, 22085, 117176, 71, 757, 645, 118664, 297, 115, 69657, 17148, 169, 6259, 16, 87, 157684, 1733, 6, 37509, 7, 127966, 276, 17632, 4068, 2681, 107754, 418, 29426, 6371, 15, ...

[ 0.1998291015625, 0.1575927734375, 0.0286102294921875, 0.140625, 0.0816650390625, 0.126220703125, 0.1436767578125, 0.0252838134765625, 0.2208251953125, 0.194580078125, 0.04541015625, 0.091552734375, 0.037109375, 0.1727294921875, 0.0379638671875, 0.0869140625, 0.055419921875, 0.12634...

embed

39182947_c0

39182947

haskell

0

Title: Haskell Pipes and testing with HSpec Problem title: Haskell Pipes and testing with HSpec Tags: hspec, haskell, haskell-pipes Problem: Haskell Pipes and testing with HSpec I have written a program for a project that uses Pipes, which I love! I'm struggling to unit test my code however. I have a series of function...

Haskell Pipes and testing with HSpec Haskell Pipes and testing with HSpec hspec haskell haskell-pipes Haskell Pipes HSpec Pipe Out Person Unknown Show Classification Friend Foe Undecided Alex Bob How Haskell Pipes and testing with HSpec I have written a program for a project that uses Pipes, which I love! I'm strugglin...

[ 0.0029449462890625, -0.013427734375, -0.00787353515625, 0.012451171875, -0.029296875, 0.004638671875, -0.01275634765625, -0.02197265625, -0.01190185546875, -0.00714111328125, 0.003936767578125, 0.0062255859375, 0.005828857421875, -0.00102996826171875, 0.0012359619140625, 0.00244140625,...

[ 20625, 142508, 93128, 90, 136, 134234, 678, 39718, 47107, 1096, 16711, 1556, 1434, 13569, 13, 13538, 15270, 992, 69723, 17367, 237777, 128938, 9572, 79912, 104024, 20984, 25027, 11249, 765, 59121, 1528, 100, 13452, 4527, 3129, 87, 5161, 38, ...

[ 0.1695556640625, 0.2467041015625, 0.2242431640625, 0.1636962890625, 0.0853271484375, 0.25732421875, 0.134033203125, 0.1602783203125, 0.265380859375, 0.1142578125, 0.2099609375, 0.14892578125, 0.16357421875, 0.013427734375, 0.130126953125, 0.2127685546875, 0.109619140625, 0.03063964...

embed

27414511_c0

27414511

haskell

0

Title: Applying multiplication across lists in haskell list comprehension Problem title: Applying multiplication across lists in haskell list comprehension Tags: list-comprehension, haskell Problem: Applying multiplication across lists in haskell list comprehension haskell noob here. I'm doing Learn you a Haskell and c...

Applying multiplication across lists in haskell list comprehension Applying multiplication across lists in haskell list comprehension list-comprehension haskell a Applying Num Possible Applying multiplication across lists in haskell list comprehension haskell noob here. I'm doing Learn you a Haskell and came across thi...

[ -0.033203125, 0.0169677734375, 0.01348876953125, 0.004791259765625, 0.005126953125, 0.025634765625, 0.003662109375, 0.0111083984375, 0.0037689208984375, -0.00994873046875, -0.0118408203125, -0.00860595703125, 0.00604248046875, -0.003387451171875, -0.0277099609375, -0.0224609375, 0.00...

[ 5659, 538, 127664, 1363, 36880, 5303, 7, 1556, 142508, 46683, 3220, 23, 4692, 52782, 115861, 110, 3522, 134031, 398, 20625, 2967, 456, 5429, 22904, 28960, 9969, 34759, 1909, 12225, 163, 31895, 31577, 48716, 26548, 15700, 36663, 195625, 5844, ...

[ 0.1177978515625, 0.111083984375, 0.198486328125, 0.07000732421875, 0.2047119140625, 0.2003173828125, 0.060791015625, 0.1317138671875, 0.2017822265625, 0.0947265625, 0.099365234375, 0.0113525390625, 0.08416748046875, 0.0960693359375, 0.093505859375, 0.00732421875, 0.0736083984375, 0...

embed

27824509_c0

27824509

haskell

0

Title: ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists Problem title: ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists Tags: cabal, haskell Problem: ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists I've ju...

ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists ghc-pkg: cannot create: dist/dist-sandbox-XXXXXXXX/package.conf.inplace already exists cabal haskell package.conf.inplace Configuring creatur-wains-4.1.1 Building dist-sandbox-5cb45741 ghc-pkg: cannot create: dist/dist-sandbox-XXXXXX...

[ 0.0107421875, 0.0045166015625, 0.0244140625, -0.0081787109375, -0.006591796875, -0.0213623046875, -0.0018768310546875, 0.016845703125, -0.0015869140625, -0.01177978515625, -0.0021820068359375, -0.002227783203125, 0.004425048828125, -0.01507568359375, 0.0084228515625, 0.017333984375, ...

[ 31380, 238, 254, 8517, 53418, 28282, 45, 271, 46295, 43882, 11728, 205378, 29102, 4588, 70547, 73, 23935, 21771, 32316, 109524, 1556, 142508, 98169, 59994, 48107, 474, 634, 5425, 11565, 83783, 104919, 10342, 4633, 16360, 116086, 71, 615, 4015...

[ 0.1383056640625, 0.1224365234375, 0.013824462890625, 0.19482421875, 0.1405029296875, 0.159912109375, 0.118408203125, 0.146240234375, 0.168701171875, 0.1279296875, 0.213134765625, 0.1456298828125, 0.1900634765625, 0.022125244140625, 0.186767578125, 0.061676025390625, 0.1474609375, 0...

embed

46303752_c1

46303752

haskell

1

evalQ x y) [1 ..] where lastUnique (x0:x1:xs) | x0 == x1 = x0 | otherwise = lastUnique (x1:xs) evalQ :: Int -> Int -> Int -> [Int] evalQ x y n = startEvalMemo . startEvalMemoT $ fqmon x y n fqmon :: Int -> Int -> Int -> MemoQV [Int] fqmon _ _ 0 = return [0,0,0,0] fqmon x y n = do let pts = neighbours (x, y) let v = for...

[ -0.0291748046875, 0.01263427734375, 0.005828857421875, -0.0115966796875, 0.006195068359375, -0.0166015625, 0.0284423828125, -0.002349853515625, 0.0228271484375, -0.018310546875, 0.00738525390625, 0.02783203125, 0.038818359375, -0.003570556640625, -0.0177001953125, -0.0030059814453125, ...

[ 28, 1405, 2737, 1022, 113, 16, 68252, 1468, 7440, 4568, 1062, 45602, 2389, 12, 82825, 425, 69112, 418, 120262, 360, 18, 653, 4034, 647, 6696, 432, 618, 3650, 1238, 864, 3796, 17443, 31, 856, 30646, 63527, 2633, 27037, 108, 6958, 38648, ...

[ 0.1220703125, 0.253173828125, 0.2232666015625, 0.1142578125, 0.1842041015625, 0.008026123046875, 0.014129638671875, 0.0311279296875, 0.044891357421875, 0.1641845703125, 0.075927734375, 0.2408447265625, 0.108642578125, 0.006927490234375, 0.06878662109375, 0.07989501953125, 0.023605346...

embed

5735544_c0

5735544

haskell

0

Title: How to convert a Date to an Int in Haskell Problem title: How to convert a Date to an Int in Haskell Tags: haskell, date Problem: How to convert a Date to an Int in Haskell I'm having a bit of a problem with converting the output of these functions below to an Int date :: IO (Integer,Int,Int) date = getCurrentTi...

How to convert a Date to an Int in Haskell How to convert a Date to an Int in Haskell haskell date How Date Haskell Integer How to convert a Date to an Int in Haskell I'm having a bit of a problem with converting the output of these functions below to an Int Basically I want to take the output from either (not fussed w...

[ -0.00909423828125, -0.0014495849609375, -0.005767822265625, 0.015625, 0.007568359375, 0.0191650390625, -0.01953125, 0.00811767578125, 0.00189971923828125, -0.019287109375, -0.032958984375, -0.00970458984375, 0.005035400390625, 0.0196533203125, 0.0096435546875, -0.0106201171875, -0.01...

[ 11249, 47, 96760, 10, 25512, 142, 360, 18, 23, 20625, 142508, 1556, 5622, 44401, 4785, 2967, 140992, 6097, 32354, 35064, 3444, 5646, 40101, 57574, 4989, 7722, 15504, 3934, 38396, 387, 17357, 21553, 8337, 10680, 617, 73419, 25, 163406, 15770...

[ 0.08331298828125, 0.131591796875, 0.1864013671875, 0.060455322265625, 0.2437744140625, 0.10498046875, 0.1824951171875, 0.223876953125, 0.110595703125, 0.17333984375, 0.281005859375, 0.14208984375, 0.191162109375, 0.2158203125, 0.024444580078125, 0.0635986328125, 0.1715087890625, 0....

embed

14167560_c0

14167560

haskell

0

Title: Couldn't match expected type `IO b0' with actual type `Float' Problem title: Couldn't match expected type `IO b0' with actual type `Float' Tags: compiler-errors, haskell Problem: Couldn't match expected type `IO b0' with actual type `Float' I wanted to make a simple unit converter, ...

Couldn't match expected type `IO b0' with actual type `Float' Couldn't match expected type `IO b0' with actual type `Float' compiler-errors haskell Couldn Float jedn.hs:16:16 Couldn't match expected type `IO b0' with actual type `Float' I wanted to make a simple unit converter, I wrote: bu...

[ -0.01251220703125, -0.0078125, 0.0009918212890625, -0.005523681640625, -0.0081787109375, -0.011474609375, -0.01220703125, -0.003326416015625, 0.000583648681640625, -0.00555419921875, -0.0081787109375, -0.00738525390625, 0.01324462890625, -0.0218505859375, 0.00933837890625, -0.006805419...

[ 191147, 3768, 18, 14858, 84751, 10644, 17780, 876, 2389, 678, 8561, 919, 365, 257, 9969, 34759, 188800, 1556, 142508, 38699, 127, 22354, 25, 36663, 8781, 25072, 172127, 54397, 68772, 163, 18499, 18822, 70, 2967, 151134, 142424, 1884, 6063, ...

[ 0.07818603515625, 0.119873046875, 0.0677490234375, 0.1883544921875, 0.1630859375, 0.1649169921875, 0.1962890625, 0.061309814453125, 0.167236328125, 0.06317138671875, 0.2071533203125, 0.08502197265625, 0.1807861328125, 0.147216796875, 0.10748291015625, 0.083740234375, 0.14013671875, ...

embed

27557629_c0

27557629

haskell

0

Title: Making Haskell Code faster Problem title: Making Haskell Code faster Tags: haskell Problem: Making Haskell Code faster Does anyone know how to make this Haskell code fun faster? I am doing Project Euler #14 . This code runs in 4.029 seconds: collatz :: Int -> Int64 -> Int collatz c 1 = c collatz c k | even k = c...

Making Haskell Code faster Making Haskell Code faster haskell Making Haskell Int64 Making Haskell Code faster Does anyone know how to make this Haskell code fun faster? I am doing Project Euler #14 . This code runs in 4.029 seconds: Memoizing the collatz function actually increases the runtime, so I did not do any memo...

[ 0.006561279296875, -0.00182342529296875, 0.017822265625, 0.000644683837890625, 0.00701904296875, 0.00970458984375, -0.00011777877807617188, -0.005950927734375, 0.00439453125, -0.038818359375, 0.0087890625, -0.0269775390625, -0.01513671875, 0.006500244140625, 0.006103515625, 0.000968933...

[ 13676, 214, 20625, 142508, 28864, 4271, 56, 1556, 360, 18, 13307, 35672, 3714, 3642, 47, 3249, 903, 18151, 7477, 20594, 27331, 5177, 603, 2592, 3293, 127877, 23, 40401, 4235, 94131, 17443, 31, 84382, 65780, 9136, 32354, 20653, 51312, 11675,...

[ 0.127685546875, 0.0518798828125, 0.1959228515625, 0.303955078125, 0.2298583984375, 0.166259765625, 0.1195068359375, 0.1866455078125, 0.052001953125, 0.0958251953125, 0.2183837890625, 0.044403076171875, 0.0809326171875, 0.05548095703125, 0.003387451171875, 0.1207275390625, 0.021636962...

embed

74770880_c1

74770880

haskell

1

to consume all lines after a $ ls until the next line starting with $ (but without consuming it, because otherwise the following parser will fail). The parser partly works, but only if there is at most one ls command in it and only if it's the last command in the input. When I run the parser with debug mode, I get the...

[ -0.0242919921875, 0.0277099609375, 0.00060272216796875, 0.0244140625, -0.01385498046875, 0.0225830078125, -0.01190185546875, 0.000637054443359375, 0.0189208984375, -0.01220703125, -0.0145263671875, 0.0361328125, 0.00701904296875, 0.0181884765625, -0.006805419921875, 0.0184326171875, ...

[ 47, 18588, 13, 756, 124519, 7103, 3650, 96, 7, 24189, 11737, 13315, 72134, 678, 8789, 15490, 25632, 366, 2189, 35782, 2831, 43240, 4734, 2684, 1632, 75101, 4568, 107730, 11675, 8, 85779, 13736, 18499, 5881, 56329, 54936, 2256, 936, 150, 5...

[ 0.107666015625, 0.2181396484375, 0.08056640625, 0.126220703125, 0.2135009765625, 0.1536865234375, 0.1563720703125, 0.1097412109375, 0.137939453125, 0.089111328125, 0.1224365234375, 0.1309814453125, 0.04656982421875, 0.038848876953125, 0.0224456787109375, 0.075927734375, 0.06628417968...

embed

44689767_c0

44689767

haskell

0

Title: Haskell compile: the interface to load is a member of the hidden package (which is itself) Problem title: Haskell compile: the interface to load is a member of the hidden package (which is itself) Tags: haskell, xmonad Problem: Haskell compile: the interface to load is a member of the hidden package (which is it...

Haskell compile: the interface to load is a member of the hidden package (which is itself) Haskell compile: the interface to load is a member of the hidden package (which is itself) haskell xmonad Haskell Configuration taffybar.hs Recompiling Error taffybar.hs:26:1 Failed System.Taffybar.ToggleMonitor taffybar-0.4.6 Us...

[ -0.007110595703125, 0.000667572021484375, -0.00970458984375, 0.0208740234375, -0.0031585693359375, 0.0172119140625, 0.0031585693359375, 0.00225830078125, -0.00897216796875, -0.017578125, -0.01165771484375, -0.00927734375, -0.0084228515625, -0.004150390625, 0.01416015625, -0.02221679687...

[ 20625, 142508, 9969, 1340, 101758, 47, 72367, 83, 32786, 204105, 98169, 143321, 68034, 1556, 1022, 3796, 712, 59994, 308, 76195, 1299, 127, 89002, 11368, 212059, 28194, 19721, 190355, 12353, 9874, 7763, 129384, 46674, 26111, 115459, 36836, 5962...

[ 0.131103515625, 0.2568359375, 0.1588134765625, 0.16357421875, 0.220947265625, 0.1019287109375, 0.2052001953125, 0.043731689453125, 0.1453857421875, 0.2291259765625, 0.1944580078125, 0.0150146484375, 0.138427734375, 0.10009765625, 0.000396728515625, 0.077392578125, 0.08612060546875, ...

embed

29877714_c0

29877714

haskell

0

Title: Do GHC REWRITE pragmas have to be type preserving? Problem title: Do GHC REWRITE pragmas have to be type preserving? Tags: ghc, haskell, pragma Problem: Do GHC REWRITE pragmas have to be type preserving? import Data.Void (Void,absurd) Say I have a small term language: data Term c v where Var :: v -> Term c v Con...

Do GHC REWRITE pragmas have to be type preserving? Do GHC REWRITE pragmas have to be type preserving? ghc haskell pragma Data.Void GHC REWRITE Term Con NOINLINE RULES Do GHC REWRITE pragmas have to be type preserving? Say I have a small term language: If I want to combine terms of the type Term c Void and Term c Int , ...

[ -0.004638671875, 0.023681640625, 0.00994873046875, 0.017578125, 0.0201416015625, 0.0184326171875, -0.020263671875, 0.00555419921875, 0.0028228759765625, -0.0106201171875, 0.00653076171875, -0.007354736328125, -0.006622314453125, 0.00537109375, -0.002716064453125, 0.007232666015625, 0...

[ 527, 73265, 9069, 115055, 25216, 58827, 1510, 765, 10644, 9498, 56, 6496, 31380, 238, 1556, 142508, 192, 11809, 36635, 532, 2994, 1657, 9520, 57339, 46845, 47138, 19336, 13579, 46876, 3444, 70163, 69407, 39, 501, 22591, 136, 360, 18, 7722, ...

[ 0.0911865234375, 0.2000732421875, 0.152587890625, 0.2022705078125, 0.149169921875, 0.2080078125, 0.13916015625, 0.05718994140625, 0.240234375, 0.08740234375, 0.08123779296875, 0.0928955078125, 0.101806640625, 0.0948486328125, 0.1021728515625, 0.2169189453125, 0.100341796875, 0.0698...

embed

34156241_c0

34156241

haskell

0

Title: Haskell - Accepting different types and acting accordingly Problem title: Haskell - Accepting different types and acting accordingly Tags: haskell Problem: Haskell - Accepting different types and acting accordingly Lets say I got the following very basic example: f :: Either Int String -> IO () as well as a func...

Haskell - Accepting different types and acting accordingly Haskell - Accepting different types and acting accordingly haskell Haskell Accepting Either Haskell - Accepting different types and acting accordingly Lets say I got the following very basic example: as well as a function g :: Int -> IO () and a function g' :: ...

[ -0.00885009765625, -0.005889892578125, -0.00653076171875, 0.0002536773681640625, -0.0087890625, 0.0026702880859375, -0.019287109375, -0.00677490234375, 0.0020294189453125, -0.00174713134765625, 0.01806640625, -0.0260009765625, -0.0089111328125, 0.005950927734375, -0.005035400390625, -0...

[ 20625, 142508, 111383, 12921, 52895, 136, 1030, 1916, 59499, 1556, 4565, 9319, 4163, 70, 25632, 4552, 62822, 27781, 5299, 32354, 706, 1984, 360, 18, 33079, 17780, 10, 25, 23351, 198343, 3444, 29479, 1238, 237, 184, 187075, 11782, 707, 96819...

[ 0.1575927734375, 0.2685546875, 0.197509765625, 0.1932373046875, 0.2108154296875, 0.0293121337890625, 0.1275634765625, 0.041900634765625, 0.1171875, 0.1319580078125, 0.119873046875, 0.260498046875, 0.011444091796875, 0.005523681640625, 0.03265380859375, 0.01385498046875, 0.11987304687...

embed

25184659_c0

25184659

haskell

0

Title: Wait for keyboard press without blocking Problem title: Wait for keyboard press without blocking Tags: haskell Problem: Wait for keyboard press without blocking My current simple TCP echo server code looks like this import Network.Socket main :: IO () main = setup setup :: IO () setup = do sock <- socket AF_INET...

Wait for keyboard press without blocking Wait for keyboard press without blocking haskell Network.Socket Wait AF_INET Stream SockAddrInet iNADDR_ANY Socket SockAddr Handling Wait for keyboard press without blocking My current simple TCP echo server code looks like this The loop runs forever. I tried few methods to list...

[ 0.004302978515625, 0.01483154296875, 0.00160980224609375, 0.0006256103515625, -0.0021514892578125, 0.00167083740234375, 0.0164794921875, -0.0289306640625, 0.000705718994140625, -0.03662109375, 0.01611328125, -0.0206298828125, -0.006805419921875, 0.003997802734375, -0.01397705078125, 0....

[ 175254, 100, 149186, 24234, 15490, 46389, 1556, 142508, 28997, 8912, 27853, 28211, 17777, 115061, 1061, 7569, 126, 23498, 93333, 193237, 43581, 8781, 17854, 3089, 10723, 18151, 33342, 40956, 127877, 136993, 10846, 150624, 44632, 82230, 5201, 3564...

[ 0.2435302734375, 0.1082763671875, 0.23681640625, 0.1864013671875, 0.0723876953125, 0.1805419921875, 0.0679931640625, 0.1807861328125, 0.06689453125, 0.01123046875, 0.1162109375, 0.056121826171875, 0.06573486328125, 0.1365966796875, 0.033660888671875, 0.05059814453125, 0.0356140136718...

embed

54700916_c0

54700916

haskell

0

Title: What is the Purpose of the Item type in Foundation Problem title: What is the Purpose of the Item type in Foundation Tags: types, haskell Problem: What is the Purpose of the Item type in Foundation Both the following compile fine with Foundation (and Prelude as qualified import P) and return the expected string....

What is the Purpose of the Item type in Foundation What is the Purpose of the Item type in Foundation types haskell What Purpose Item Foundation Char P.head blahh2 Should What is the Purpose of the Item type in Foundation Both the following compile fine with Foundation (and Prelude as qualified import P) and return the...

[ -0.0152587890625, -0.01336669921875, 0.011962890625, 0.000019073486328125, -0.0067138671875, 0.004608154296875, -0.005584716796875, -0.0145263671875, 0.0201416015625, 0.005645751953125, 0.01080322265625, -0.033935546875, -0.005096435546875, 0.0001316070556640625, -0.0201416015625, -0.0...

[ 4865, 83, 70, 16915, 78381, 111, 78426, 10644, 23, 32807, 52895, 1556, 142508, 21656, 436, 31251, 9932, 51659, 304, 151117, 25632, 9969, 1340, 5885, 678, 1914, 822, 112, 217225, 24927, 30646, 84751, 79315, 55681, 2053, 103510, 14858, 26548, ...

[ 0.06854248046875, 0.04962158203125, 0.0494384765625, 0.19873046875, 0.1871337890625, 0.06134033203125, 0.253662109375, 0.2457275390625, 0.0758056640625, 0.277587890625, 0.182373046875, 0.13037109375, 0.21337890625, 0.173095703125, 0.06976318359375, 0.1072998046875, 0.058807373046875,...

embed