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
50050431_c0	50050431	haskell	0	Title: Persistent `upsert` isn't working Problem title: Persistent `upsert` isn't working Tags: yesod, haskell Problem: Persistent `upsert` isn't working I am apparently confused about Persistent's upsert function and how it works with Postgres 9.5. I am writing a Yesod app that takes in a JSON value, parses ...	Persistent `upsert` isn't working Persistent `upsert` isn't working yesod haskell Persistent Handler TypedContent IntensiveTreatmentClient ClientId UniqueIntensiveTreatmentClientClientId POST Params Request Body Accept Status Persistent `upsert` isn't working I am apparently confused about Persistent's upsert...	[ -0.0140380859375, 0.04052734375, 0.015625, -0.0101318359375, -0.01275634765625, 0.027099609375, -0.0194091796875, -0.020751953125, 0.0035552978515625, -0.024169921875, 0.0126953125, 0.015380859375, -0.008544921875, -0.01416015625, -0.00098419189453125, 0.00034332275390625, -0.0019683...	[ 57309, 2581, 18, 2037, 33657, 56112, 3768, 20697, 2422, 23722, 1556, 142508, 10639, 603, 60457, 25352, 221149, 62731, 257, 150, 91732, 11789, 41745, 75616, 43960, 111383, 56504, 55681, 1257, 32354, 43240, 678, 2795, 17562, 117878, 32562, 32635,...	[ 0.172607421875, 0.1875, 0.1705322265625, 0.1805419921875, 0.287353515625, 0.0869140625, 0.075927734375, 0.19580078125, 0.13037109375, 0.2001953125, 0.115478515625, 0.201416015625, 0.124755859375, 0.1177978515625, 0.1134033203125, 0.0799560546875, 0.09808349609375, 0.046600341796875...	embed
52751564_c0	52751564	haskell	0	Title: Haskell Function Composition with Map Function Problem title: Haskell Function Composition with Map Function Tags: proof, haskell, function-composition, map-function, equality Problem: Haskell Function Composition with Map Function I'm going through the Richard Bird's "Thinking Functionally with Haskell" book an...	Haskell Function Composition with Map Function Haskell Function Composition with Map Function proof haskell function-composition map-function equality Haskell Composition Map Bool Haskell Function Composition with Map Function I'm going through the Richard Bird's "Thinking Functionally with Haskell" book and there is a...	[ 0.0019683837890625, 0.000370025634765625, 0.006805419921875, 0.0184326171875, -0.00958251953125, -0.005615234375, -0.00482177734375, 0.0037994384765625, 0.00147247314453125, -0.00225830078125, -0.005889892578125, 0.01519775390625, -0.006927490234375, 0.0076904296875, 0.003997802734375, ...	[ 20625, 142508, 28670, 3288, 40322, 678, 42719, 10763, 98869, 1556, 32354, 277, 22288, 137175, 28, 161789, 2460, 929, 8305, 22758, 72607, 20800, 73, 6048, 25958, 12877, 40059, 831, 18, 28219, 502, 57266, 46312, 55300, 6422, 61924, 237, 23534, ...	[ 0.15234375, 0.250732421875, 0.134033203125, 0.13330078125, 0.1217041015625, 0.10546875, 0.2060546875, 0.07275390625, 0.1551513671875, 0.16748046875, 0.167236328125, 0.1458740234375, 0.21484375, 0.181396484375, 0.07891845703125, 0.1866455078125, 0.0899658203125, 0.137939453125, 0....	embed
53378431_c0	53378431	haskell	0	Title: How to catch Exception from IO and print its error. Problem title: How to catch Exception from IO and print its error. Tags: haskell Problem: How to catch Exception from IO and print its error. I'd like to catch exceptions from the IO and inspect what kind of exception was raised with typeOf and then use the spe...	How to catch Exception from IO and print its error. How to catch Exception from IO and print its error. haskell Control.Exception SomeException MonadError IO Data.Typeable System.Environment How Exception MISSING_ENV How to catch Exception from IO and print its error. I'd like to catch exceptions from the IO and inspec...	[ -0.004852294921875, 0.012939453125, -0.0235595703125, 0.0086669921875, 0.0096435546875, 0.0093994140625, -0.0152587890625, -0.01251220703125, -0.004608154296875, 0.01080322265625, 0.009521484375, -0.04736328125, 0.0118408203125, -0.01611328125, 0.0159912109375, 0.004730224609375, -0....	[ 11249, 47, 105556, 5443, 63928, 1295, 17780, 136, 28412, 6863, 18499, 1556, 142508, 27131, 19279, 31384, 60331, 71, 18468, 31611, 11809, 196707, 2886, 12353, 686, 1900, 53695, 111848, 11572, 856, 1884, 131527, 134071, 8562, 165249, 678, 10644, ...	[ 0.07977294921875, 0.03192138671875, 0.23046875, 0.1783447265625, 0.272705078125, 0.1610107421875, 0.2476806640625, 0.06689453125, 0.209716796875, 0.080078125, 0.2078857421875, 0.1029052734375, 0.2236328125, 0.1783447265625, 0.13134765625, 0.093505859375, 0.1634521484375, 0.07043457...	embed
27436894_c0	27436894	haskell	0	Title: How to expect exceptions with QuickCheck2 Problem title: How to expect exceptions with QuickCheck2 Tags: haskell Problem: How to expect exceptions with QuickCheck2 I've been trying to pick up Haskell recently, but I am having some difficulty with QuickCheck2 (which I'm trying to learn while coding up the 99 prob...	How to expect exceptions with QuickCheck2 How to expect exceptions with QuickCheck2 haskell How QuickCheck2 prop_myLast Bool Property How to expect exceptions with QuickCheck2 I've been trying to pick up Haskell recently, but I am having some difficulty with QuickCheck2 (which I'm trying to learn while coding up the 99...	[ -0.00836181640625, -0.0028076171875, -0.01263427734375, -0.0086669921875, 0.00567626953125, 0.0126953125, 0.00921630859375, -0.01513671875, 0.0098876953125, -0.00445556640625, 0.0213623046875, 0.0081787109375, 0.00201416015625, -0.037841796875, 0.01165771484375, -0.00238037109375, -0...	[ 11249, 41206, 131527, 7, 678, 89038, 202567, 304, 1556, 142508, 25793, 1176, 2729, 271, 2460, 929, 206984, 39580, 20625, 34844, 552, 10078, 44402, 7722, 11389, 18151, 3034, 759, 32354, 30646, 4568, 12830, 5303, 10644, 78292, 17647, 379, 3408,...	[ 0.06878662109375, 0.2099609375, 0.2481689453125, 0.1019287109375, 0.107666015625, 0.153076171875, 0.2486572265625, 0.1854248046875, 0.09051513671875, 0.1846923828125, 0.163818359375, 0.1077880859375, 0.1727294921875, 0.1474609375, 0.06854248046875, 0.1435546875, 0.1539306640625, 0....	embed
49130389_c0	49130389	haskell	0	Title: Has anyone been able to integrate liquidhaskell with nixos? Problem title: Has anyone been able to integrate liquidhaskell with nixos? Tags: nixos, liquid-haskell, haskell Problem: Has anyone been able to integrate liquidhaskell with nixos? I'm trying to use liquidhaskell on NixOS. I can install the package (liq...	Has anyone been able to integrate liquidhaskell with nixos? Has anyone been able to integrate liquidhaskell with nixos? nixos liquid-haskell haskell containers-0.5.10.2 Has pdbzl0p6k1klmajx969b6vvwyw9w0s6b-ghc-8.2.2-with-packages proclib:1 ghc-8.2.2 text-1.2.2.2 Jan nix.hs LiquidHaskell Version Copyright Regents Univer...	[ 0.006866455078125, -0.0128173828125, 0.0152587890625, 0.0166015625, -0.0133056640625, 0.025390625, -0.007537841796875, 0.00421142578125, -0.01544189453125, -0.01251220703125, -0.008544921875, -0.014404296875, 0.00299072265625, -0.006622314453125, 0.00872802734375, -0.00927734375, -0....	[ 20625, 35672, 2809, 19048, 78779, 13, 41931, 10557, 142508, 678, 300, 47436, 1556, 116419, 93645, 10179, 304, 48073, 201985, 9486, 17376, 70147, 76228, 29102, 10402, 5612, 31380, 238, 7986, 48400, 3342, 425, 127, 170527, 6495, 7, 40647, 68744...	[ 0.006072998046875, 0.08544921875, 0.049102783203125, 0.117431640625, 0.2333984375, 0.046875, 0.222412109375, 0.1373291015625, 0.2252197265625, 0.125, 0.10028076171875, 0.196533203125, 0.1248779296875, 0.17578125, 0.0963134765625, 0.1151123046875, 0.0396728515625, 0.0220794677734375...	embed
64646107_c0	64646107	haskell	0	Title: How to increment elements in list by another character Problem title: How to increment elements in list by another character Tags: list, haskell Problem: How to increment elements in list by another character I have string "* * * " and I want to get "2210001*" but my function can change only one side and I d...	How to increment elements in list by another character How to increment elements in list by another character list haskell How Char x:xs newVal:xs x:replaceNth n-1 x-1 How to increment elements in list by another character I have string "* * * " and I want to get "2210001*" but my function can change only one side ...	[ -0.0242919921875, -0.00830078125, 0.0108642578125, 0.0274658203125, 0.0021514892578125, 0.0030670166015625, 0.00872802734375, -0.00823974609375, 0.01129150390625, 0.025390625, 0.0174560546875, -0.01312255859375, 0.00034332275390625, 0.01904296875, -0.01416015625, -0.00811767578125, 0...	[ 11249, 47, 158661, 80854, 23, 5303, 390, 15700, 62816, 1556, 142508, 21656, 1022, 425, 3525, 42272, 107, 23935, 927, 5759, 79315, 1639, 661, 3444, 2046, 304, 14105, 418, 32354, 831, 15549, 4734, 1632, 5609, 3714, 3642, 27289, 86531, 9014, ...	[ 0.06683349609375, 0.0257720947265625, 0.259765625, 0.20556640625, 0.0540771484375, 0.204833984375, 0.103515625, 0.148193359375, 0.219482421875, 0.1417236328125, 0.2169189453125, 0.1917724609375, 0.036529541015625, 0.0565185546875, 0.0927734375, 0.169677734375, 0.0241546630859375, 0...	embed
13293465_c0	13293465	haskell	0	Title: Replacing element in a list of lists in Haskell Problem title: Replacing element in a list of lists in Haskell Tags: search, haskell, list Problem: Replacing element in a list of lists in Haskell I have a list of lists like so: [["BBBBBBBB", "BWFFFPFGB", "BWFFFPFGB", "BWFFMPFGB", "BWFFFPF_B", "BWFFFPF6B", "BBBBB...	Replacing element in a list of lists in Haskell Replacing element in a list of lists in Haskell search haskell list Replacing Haskell BBBBBBBB BWFFFPFGB BWFFMPFGB BWFFFPF_B BWFFFPF6B BBBBBBB x:xs Prelude Not Replacing element in a list of lists in Haskell I have a list of lists like so: I've done a little research and ...	[ -0.01019287109375, 0.026123046875, 0.002471923828125, 0.005859375, 0.00128936767578125, 0.0137939453125, 0.002960205078125, -0.00732421875, -0.000476837158203125, 0.01275634765625, 0.02685546875, 0.00408935546875, 0.01361083984375, -0.0036163330078125, -0.01904296875, -0.00251770019531...	[ 853, 133266, 214, 12830, 23, 5303, 7, 20625, 142508, 33938, 1556, 40746, 22312, 168437, 30110, 41265, 8359, 1022, 12, 425, 1914, 822, 112, 11205, 25188, 17203, 11651, 80854, 17368, 70, 6506, 39933, 157318, 100, 24233, 594, 9077, 3642, 1672,...	[ 0.0966796875, 0.18408203125, 0.017547607421875, 0.2125244140625, 0.0618896484375, 0.2384033203125, 0.057708740234375, 0.1572265625, 0.252197265625, 0.152587890625, 0.1280517578125, 0.034332275390625, 0.045623779296875, 0.063720703125, 0.02899169921875, 0.0587158203125, 0.083862304687...	embed
39121458_c1	39121458	haskell	1	: {-# LANGUAGE ForeignFunctionInterface #-} foreign import ccall "basler_init" baslerInit :: IO () main :: IO () main = baslerInit I compile and run this as: $ ghc --make Test2.hs -o Test2-haskell -Llib -lbasler -optl-Wl,--enable-new-dtags -optl-Wl,-rpath,pylon5/lib64 -optl-Wl,-E -lpylonbase $ PYLON_CAMEMU=1 LD_LIBRARY...	. The camera comes with a C++ library that makes it fairly straight forward. The following code can be used to acquire a camera source: I've used this source code to build a shared library - libbasler.so . To confirm it works, here's a basic C program that links against it and confirms everything is working: I compile ...	[ 0.00970458984375, 0.0018310546875, -0.0091552734375, 0.0013427734375, -0.02197265625, 0.0162353515625, 0.00811767578125, -0.026611328125, -0.0034942626953125, -0.04296875, 0.005767822265625, -0.0205078125, -0.0174560546875, -0.002044677734375, 0.012451171875, -0.008056640625, 0.01721...	[ 6, 5, 581, 15593, 32497, 678, 10, 313, 37223, 35773, 1294, 450, 30482, 442, 180663, 80560, 40225, 25632, 18151, 831, 186, 11814, 47, 163629, 31344, 903, 45367, 99764, 25474, 5918, 603, 991, 39563, 43240, 3688, 62822, 1528, 22317, 26548, 7...	[ 0.0841064453125, 0.06597900390625, 0.120361328125, 0.30810546875, 0.1505126953125, 0.122314453125, 0.06903076171875, 0.129638671875, 0.26611328125, 0.196044921875, 0.11474609375, 0.00286865234375, 0.048004150390625, 0.0673828125, 0.1103515625, 0.1204833984375, 0.1602783203125, 0.08...	embed
9425437_c1	9425437	haskell	1	Maybe.fromJust: Nothing error exactly where I would expect newHs to return Nothing . I was asked for more code. I am trying to come up with a minimum situation that reproduces the error, but in the mean time, here is the complete problematic callerFunc code. -- Given a list of residues and an aromatic, find instances ...	Maybe.fromJust: Nothing error exactly where I would expect newHs to return Nothing . I was asked for more code. I am trying to come up with a minimum situation that reproduces the error, but in the mean time, here is the complete problematic callerFunc code. -- Given a list of residues and an aromatic, find instances ...	[ -0.006011962890625, -0.0027313232421875, -0.0103759765625, -0.01068115234375, -0.000263214111328125, 0.00811767578125, 0.01531982421875, -0.016845703125, 0.0108642578125, -0.01953125, 0.00004410743713378906, 0.00015163421630859375, 0.0191650390625, -0.0166015625, 0.00634765625, -0.0247...	[ 83425, 161063, 127794, 182747, 18499, 66161, 7440, 2806, 41206, 3525, 841, 7, 30646, 1286, 18151, 15440, 16648, 42238, 28484, 186560, 11782, 56, 97249, 238, 5303, 99996, 85792, 7413, 110527, 126442, 1409, 71052, 17721, 1771, 20583, 48130, 19, ...	[ 0.254638671875, 0.190673828125, 0.2198486328125, 0.243896484375, 0.2261962890625, 0.076904296875, 0.0254669189453125, 0.049224853515625, 0.1630859375, 0.1485595703125, 0.17333984375, 0.06683349609375, 0.1761474609375, 0.034637451171875, 0.1676025390625, 0.11767578125, 0.0657958984375...	embed
18570937_c0	18570937	haskell	0	Title: Haskell lazy Bytestring words not lazy? Problem title: Haskell lazy Bytestring words not lazy? Tags: long-lines, lazy-io, haskell, bytestring Problem: Haskell lazy Bytestring words not lazy? I have the following Haskell program for computing a maximum sum substring of a string of integers: {-# LANGUAGE BangPatte...	Haskell lazy Bytestring words not lazy? Haskell lazy Bytestring words not lazy? long-lines lazy-io haskell bytestring Data.Functor Data.Maybe Data.ByteString.Lazy.Char8 Prelude Haskell Bytestring LANGUAGE BangPatterns OPTIONS_GHC fst.fromJust.readInt Haskell lazy Bytestring words not lazy? I have the following Haskell ...	[ 0.0027923583984375, -0.005584716796875, 0.0026397705078125, 0.0030670166015625, -0.01007080078125, 0.0283203125, 0.01171875, 0.01104736328125, -0.002471923828125, -0.01263427734375, -0.01007080078125, 0.0002079010009765625, 0, -0.002197265625, 0.00811767578125, 0.013671875, -0.004882...	[ 20625, 142508, 21, 3285, 3311, 67, 91693, 34153, 959, 4989, 59801, 846, 1556, 390, 11809, 97249, 18770, 75358, 71713, 214, 2729, 84068, 1019, 1914, 822, 98064, 26387, 8335, 3055, 28023, 41877, 441, 271, 161063, 127794, 39116, 4153, 25632, 1...	[ 0.1304931640625, 0.243408203125, 0.1529541015625, 0.191650390625, 0.1004638671875, 0.1236572265625, 0.2197265625, 0.1890869140625, 0.1192626953125, 0.05450439453125, 0.130615234375, 0.137939453125, 0.11865234375, 0.079345703125, 0.06060791015625, 0.037567138671875, 0.03125, 0.04232...	embed
52385447_c1	52385447	haskell	1	Text w h r = (writeText <> roundedRect w h r) # lwL 0.02 # fontSize (local 0.2) --terminalInput = (text "Input Data" <> roundedRect 1 0.3 0.3) # lwL 0.02 # fontSize (local 0.2) --process txt w h = (text txt <> rect w h) # lwL 0.02 # fontSize (local 0.2) process writeText w h = (writeText <> rect w h) # lwL 0.02 # fontS...	Text w h r = (writeText <> roundedRect w h r) # lwL 0.02 # fontSize (local 0.2) --terminalInput = (text "Input Data" <> roundedRect 1 0.3 0.3) # lwL 0.02 # fontSize (local 0.2) --process txt w h = (text txt <> rect w h) # lwL 0.02 # fontSize (local 0.2) process writeText w h = (writeText <> rect w h) # lwL 0.02 # fontS...	[ -0.003326416015625, 0.0167236328125, -0.027099609375, 0.0196533203125, 0.00396728515625, 0.0067138671875, 0.02001953125, -0.0177001953125, 0.01531982421875, 0.035888671875, -0.0026702880859375, 0.0294189453125, 0.00732421875, 0.0067138671875, -0.0103759765625, 0.01373291015625, 0.012...	[ 24129, 148, 1096, 1690, 2203, 434, 18781, 174379, 68807, 297, 1052, 24762, 468, 866, 89678, 304, 12401, 127167, 98908, 126175, 30524, 289, 4153, 7077, 22829, 11809, 127089, 4210, 63923, 124326, 173247, 9433, 33022, 2053, 188, 4512, 25561, 335...	[ 0.26806640625, 0.1708984375, 0.1925048828125, 0.0889892578125, 0.06488037109375, 0.064453125, 0.14453125, 0.25146484375, 0.1270751953125, 0.0867919921875, 0.036529541015625, 0.10601806640625, 0.010223388671875, 0.06024169921875, 0.07318115234375, 0.066650390625, 0.1536865234375, 0....	embed
46337988_c0	46337988	haskell	0	Title: Human readable numbers with Haskell Charts Problem title: Human readable numbers with Haskell Charts Tags: haskell, haskell-chart Problem: Human readable numbers with Haskell Charts I'm trying to use Haskell-Charts ( http://hackage.haskell.org/package/Chart ) to generate some graphs. It works fine and I get a ni...	Human readable numbers with Haskell Charts Human readable numbers with Haskell Charts haskell haskell-chart Graphics.Rendering.Chart.Easy Graphics.Rendering.Chart.Axis.LocalTime Graphics.Rendering.Chart.Backend.Diagrams Data.Time.LocalTime Human Haskell Charts Get test.svg layout_title Active L.map LocalTime V.toList H...	[ -0.01318359375, -0.0084228515625, 0.0224609375, -0.0089111328125, 0.01806640625, -0.00830078125, 0.0059814453125, -0.00136566162109375, 0.00885009765625, -0.0040283203125, -0.0137939453125, -0.022705078125, -0.004608154296875, 0.01141357421875, 0.0189208984375, 0.00860595703125, -0.0...	[ 28076, 12301, 2886, 101935, 678, 20625, 142508, 110373, 1556, 9254, 18, 189682, 33, 111747, 84068, 162, 33102, 203758, 70059, 152470, 3611, 72838, 25561, 11809, 20779, 3034, 67756, 108802, 5440, 88441, 339, 62346, 24172, 310, 188, 154663, 31577...	[ 0.16259765625, 0.23095703125, 0.1800537109375, 0.203857421875, 0.09375, 0.1405029296875, 0.2266845703125, 0.2445068359375, 0.108642578125, 0.1903076171875, 0.0701904296875, 0.1806640625, 0.0479736328125, 0.06195068359375, 0.2296142578125, 0.0693359375, 0.0853271484375, 0.0870361328...	embed
6080200_c0	6080200	haskell	0	Title: Creating cookies with Network.Browser Problem title: Creating cookies with Network.Browser Tags: haskell Problem: Creating cookies with Network.Browser So I'm trying to use the Network.Browser library to store cookie sessions. Here's what I have so far: main = do args <- getArgs [user, pass] <- if not (null args...	Creating cookies with Network.Browser Creating cookies with Network.Browser haskell Creating Network.Browser www.plurk.com API Users api_key FVXhr06sHbbp7Lv2rezPVw8rhpl7fNnX Right Just fans_count Enter Sending GET saiko_chriskun XXXXXXXXXX HTTP Host Content-Length User-Agent hs-HTTP-4000.0.9 Received Server Date Sat Ma...	[ -0.00653076171875, 0.029052734375, 0.002899169921875, -0.01080322265625, 0.0101318359375, -0.006011962890625, -0.0184326171875, 0.005096435546875, 0.005126953125, -0.0235595703125, 0.0137939453125, -0.005401611328125, -0.0030670166015625, -0.0172119140625, -0.00201416015625, -0.0151367...	[ 56781, 4136, 678, 28997, 5, 571, 15555, 2189, 1556, 142508, 62821, 7190, 277, 61687, 53400, 31470, 19770, 9016, 1542, 90911, 35992, 71013, 60816, 24044, 79794, 57, 5696, 309, 205378, 135913, 100932, 70870, 449, 46825, 68037, 143161, 22687, 20...	[ 0.140869140625, 0.259765625, 0.09375, 0.14892578125, 0.0283966064453125, 0.0154571533203125, 0.15966796875, 0.1416015625, 0.10540771484375, 0.214111328125, 0.1278076171875, 0.1641845703125, 0.0229034423828125, 0.1363525390625, 0.1099853515625, 0.10302734375, 0.1669921875, 0.0552978...	embed
53972750_c0	53972750	haskell	0	Title: Multiple regex matches not a [String] in Haskell Problem title: Multiple regex matches not a [String] in Haskell Tags: haskell, regex Problem: Multiple regex matches not a [String] in Haskell I'm looking at the RWH tutorial here , which suggests, but has an error on, the usage of [String] to return multiple resu...	Multiple regex matches not a [String] in Haskell Multiple regex matches not a [String] in Haskell haskell regex a Multiple Haskell Bool RegexContext Regex Multiple regex matches not a [String] in Haskell I'm looking at the RWH tutorial here , which suggests, but has an error on, the usage of [String] to return multiple...	[ -0.01324462890625, 0.00250244140625, 0.01556396484375, 0.036865234375, -0.0166015625, 0.012451171875, -0.006439208984375, 0.006805419921875, 0.0164794921875, 0.00592041015625, -0.002960205078125, -0.0015106201171875, 0.006439208984375, -0.00567626953125, -0.010498046875, 0.012573242187...	[ 19335, 8705, 6835, 3355, 14858, 959, 10, 71713, 214, 20625, 142508, 23, 1556, 2460, 929, 11678, 22829, 90, 78691, 841, 57143, 42459, 18499, 127689, 30646, 48716, 50339, 27489, 107013, 170198, 26458, 132283, 5062, 10644, 199015, 16487, 100, 15...	[ 0.16064453125, 0.13671875, 0.1541748046875, 0.2183837890625, 0.2100830078125, 0.182861328125, 0.1197509765625, 0.1729736328125, 0.056671142578125, 0.130615234375, 0.2279052734375, 0.038482666015625, 0.11865234375, 0.042083740234375, 0.117431640625, 0.1231689453125, 0.117919921875, ...	embed
48631939_c0	48631939	haskell	0	Title: A concise way to factor out multiple typeclasses in Haskell? Problem title: A concise way to factor out multiple typeclasses in Haskell? Tags: typeclass, haskell Problem: A concise way to factor out multiple typeclasses in Haskell? In my Haskell codebase, I have many functions that take polymorphic arguments. Th...	A concise way to factor out multiple typeclasses in Haskell? A concise way to factor out multiple typeclasses in Haskell? typeclass haskell Haskell RealFloat Floating Real Show Ord Typeable NiceFloating A concise way to factor out multiple typeclasses in Haskell? In my Haskell codebase, I have many functions that take ...	[ -0.0003070831298828125, -0.001129150390625, -0.00007772445678710938, -0.0022125244140625, 0.0234375, -0.00390625, -0.002716064453125, -0.026611328125, 0.00604248046875, -0.007354736328125, -0.004974365234375, -0.0263671875, 0.015625, -0.01397705078125, -0.0225830078125, 0.0027770996093...	[ 158, 318, 184, 3917, 31461, 1810, 48716, 10644, 67413, 90, 20625, 142508, 62, 23, 1556, 5120, 919, 365, 257, 38699, 26518, 17367, 35379, 60457, 2886, 73398, 18151, 37382, 5941, 32354, 5646, 35874, 178851, 10750, 3871, 40407, 5701, 5423, 10,...	[ 0.0726318359375, 0.178955078125, 0.089111328125, 0.072021484375, 0.2257080078125, 0.1668701171875, 0.24267578125, 0.2215576171875, 0.287841796875, 0.0897216796875, 0.139404296875, 0.25634765625, 0.030548095703125, 0.0626220703125, 0.09619140625, 0.148681640625, 0.039306640625, 0.11...	embed
36626313_c0	36626313	haskell	0	Title: Haskell does not support the C++ overloading style in which functions with different types share a common name Problem title: Haskell does not support the C++ overloading style in which functions with different types share a common name Tags: haskell Problem: Haskell does not support the C++ overloading style in...	Haskell does not support the C++ overloading style in which functions with different types share a common name Haskell does not support the C++ overloading style in which functions with different types share a common name haskell Haskell Equal Bool Name Employee Engineer Student emp1 emp2 stud1 stud2 Haskell does not s...	[ 0.022216796875, 0.015869140625, 0.00592041015625, 0.007049560546875, -0.01141357421875, -0.004180908203125, -0.0074462890625, -0.0155029296875, -0.003173828125, -0.002197265625, 0.00830078125, -0.046630859375, 0.008056640625, -0.01239013671875, -0.00830078125, 0.0038909912109375, -0....	[ 20625, 142508, 14602, 959, 8060, 313, 37223, 645, 63033, 20623, 32354, 678, 12921, 52895, 12008, 39210, 9351, 1556, 241, 71723, 2460, 929, 15757, 365, 1033, 90125, 26696, 20244, 418, 304, 27938, 214, 52080, 209806, 10557, 77275, 67413, 6495, ...	[ 0.1722412109375, 0.27197265625, 0.0251312255859375, 0.1234130859375, 0.22802734375, 0.0168304443359375, 0.2481689453125, 0.140869140625, 0.2105712890625, 0.2232666015625, 0.2003173828125, 0.050262451171875, 0.15087890625, 0.2401123046875, 0.1463623046875, 0.173583984375, 0.1652832031...	embed
40562437_c2	40562437	haskell	2	.9.0.0.a(iconv.o) (maybe you meant: _hs_iconv_open) "_locale_charset", referenced from: _localeEncoding in libHSbase-4.9.0.0.a(PrelIOUtils.o) ld: symbol(s) not found for architecture x86_64 clang: error: Code signals: Link, Preprocessing, hoogle-5.0.1, Compiling, Main, Main.hs, x86_64-osx, Cabal-1.24.0.0, Main.o, Linki...	.9.0.0.a(iconv.o) (maybe you meant: _hs_iconv_open) "_locale_charset", referenced from: _localeEncoding in libHSbase-4.9.0.0.a(PrelIOUtils.o) ld: symbol(s) not found for architecture x86_64 clang: error: Code signals: Link, Preprocessing, hoogle-5.0.1, Compiling, Main, Main.hs, x86_64-osx, Cabal-1.24.0.0, Main.o, Linki...	[ -0.0264892578125, -0.01531982421875, 0.0004673004150390625, 0.01202392578125, -0.0024261474609375, 0.0081787109375, -0.00531005859375, -0.005828857421875, -0.0172119140625, -0.000682830810546875, 0.00089263916015625, -0.038330078125, 0.0283203125, 0.01336669921875, 0.00750732421875, -0...	[ 38331, 99929, 11, 14, 2271, 334, 5, 31, 11354, 131148, 101, 127, 7, 59636, 98908, 13, 9254, 3509, 91067, 7768, 587, 6238, 25474, 38131, 37382, 156982, 19273, 141, 17780, 106742, 7870, 71, 26582, 132, 959, 14037, 100, 6, 159958, 1022, 15...	[ 0.1956787109375, 0.1910400390625, 0.113525390625, 0.06317138671875, 0.1751708984375, 0.2467041015625, 0.0300445556640625, 0.1907958984375, 0.023834228515625, 0.04571533203125, 0.01068115234375, 0.0906982421875, 0.0927734375, 0.210693359375, 0.156005859375, 0.083740234375, 0.185058593...	embed
52021594_c1	52021594	haskell	1	version (latest matching version is 1.19.1) hlint must match <2.1 && >=2.0.8, but the stack configuration has no specified version (latest matching version is 2.0.15) monad-control must match >=1 && <1.1, but the stack configuration has no specified version (latest matching version is 1.0.2.3) monad-journal must match...	4.1.1 exceptions-0.10.0 haskell-src-exts-util-0.2.3 hscolour-1.24.4 mmorph-1.1.2 old-locale-1.0.0.7 refact-0.3.0.2 stm-2.4.5.0 transformers-compat-0.6.2 uniplate-1.6.12 unordered-containers-0.2.9.0 utf8-string-1.0.1.1 vector-0.12.0.1 void-0.7.2 yaml-0.10.0 cabal-doctest-1.0.6 comonad-5.0.4 contravariant-1.5 distributiv...	[ -0.0263671875, 0.01385498046875, 0.00286865234375, 0.00299072265625, -0.00616455078125, 0.0181884765625, -0.01434326171875, -0.0103759765625, 0.00067901611328125, 0.046875, 0.00021457672119140625, -0.050048828125, 0.0205078125, -0.004425048828125, 0.015869140625, 0.00689697265625, -0...	[ 201, 83783, 131527, 7, 9, 102014, 99929, 1556, 142508, 19437, 3355, 933, 3675, 23320, 5, 120883, 1096, 22796, 474, 48400, 180874, 347, 178851, 5759, 10332, 98908, 13, 102107, 134926, 456, 114700, 170179, 133684, 6138, 39, 116591, 187461, 2719...	[ 0.1207275390625, 0.1878662109375, 0.2548828125, 0.032257080078125, 0.0218505859375, 0.10369873046875, 0.1365966796875, 0.111083984375, 0.2261962890625, 0.1160888671875, 0.10595703125, 0.129150390625, 0.09423828125, 0.0142059326171875, 0.005706787109375, 0.0909423828125, 0.06951904296...	embed
6870483_c0	6870483	haskell	0	Title: Translating G-Machine source to LLVM IR Problem title: Translating G-Machine source to LLVM IR Tags: compiler-construction, haskell, llvm, translation Problem: Translating G-Machine source to LLVM IR I'm implementing a simple lazy functional language with LLVM as its backend in Haskell. I've read two books writt...	Translating G-Machine source to LLVM IR Translating G-Machine source to LLVM IR compiler-construction haskell llvm translation Translating G-Machine LLVM Translating G-Machine source to LLVM IR I'm implementing a simple lazy functional language with LLVM as its backend in Haskell. I've read two books written by Simon P...	[ -0.0028839111328125, 0.00128173828125, 0.00634765625, 0.01220703125, 0.0234375, 0.01397705078125, -0.003326416015625, -0.033935546875, -0.00145721435546875, -0.04345703125, 0.005584716796875, -0.0145263671875, -0.0002841949462890625, -0.0079345703125, 0.00958251953125, 0.01275634765625...	[ 11062, 143, 1916, 527, 9, 4613, 99326, 31344, 47, 99954, 47599, 32863, 9969, 34759, 238478, 1556, 142508, 96, 3723, 39, 153648, 29479, 8781, 21, 3285, 123309, 46876, 4420, 3611, 20625, 12301, 6626, 42840, 59121, 26328, 129420, 1507, 29304, ...	[ 0.1241455078125, 0.1497802734375, 0.011383056640625, 0.1951904296875, 0.0753173828125, 0.15087890625, 0.20654296875, 0.19287109375, 0.07373046875, 0.1466064453125, 0.27685546875, 0.2298583984375, 0.0831298828125, 0.10699462890625, 0.091064453125, 0.0933837890625, 0.220703125, 0.045...	embed
58559840_c0	58559840	haskell	0	Title: Cabal / Stack ignores ghc-options for custom Setup scripts Problem title: Cabal / Stack ignores ghc-options for custom Setup scripts Tags: haskell, haskell-stack Problem: Cabal / Stack ignores ghc-options for custom Setup scripts I'm trying to get Stack working on an Arch system. I've done the usual: pacman -S g...	Cabal / Stack ignores ghc-options for custom Setup scripts Cabal / Stack ignores ghc-options for custom Setup scripts haskell haskell-stack Cabal Stack Setup config.yaml ghc-8.6.5 StackSetupShim.mainOverride Cabal-2.4.0.1 setup-mPHDZzAJ.hs setup-shim-mPHDZzAJ.hs x86_64-linux tmp-Cabal-simple_mPHDZzAJ_2.4.0.1_ghc-8.6.5 ...	[ 0.005950927734375, 0.0169677734375, 0.00567626953125, -0.004852294921875, -0.0341796875, -0.0177001953125, -0.0159912109375, -0.00653076171875, -0.01068115234375, 0.006195068359375, -0.0174560546875, -0.0142822265625, -0.0019073486328125, 0.005706787109375, -0.01068115234375, 0.03125, ...	[ 30438, 289, 248, 6512, 2594, 124962, 31380, 238, 109585, 114122, 19943, 2037, 26499, 1556, 142508, 590, 153837, 14520, 141, 17376, 136473, 126, 78567, 39, 416, 116591, 102014, 169581, 54259, 80633, 25582, 127, 10706, 15276, 13307, 2397, 6077, ...	[ 0.17431640625, 0.153076171875, 0.052825927734375, 0.178955078125, 0.1612548828125, 0.11962890625, 0.126953125, 0.09210205078125, 0.1575927734375, 0.145751953125, 0.136474609375, 0.07989501953125, 0.1654052734375, 0.0848388671875, 0.15771484375, 0.1480712890625, 0.1353759765625, 0.1...	embed
13126741_c0	13126741	haskell	0	Title: When debugging my State Monad, reverses order depending on where trace is Problem title: When debugging my State Monad, reverses order depending on where trace is Tags: haskell Problem: When debugging my State Monad, reverses order depending on where trace is So I was building a State Monad and ran into some pro...	When debugging my State Monad, reverses order depending on where trace is When debugging my State Monad, reverses order depending on where trace is haskell Control.Monad.State Debug.Trace When State Monad Main cur:xs When debugging my State Monad, reverses order depending on where trace is So I was building a State Mon...	[ -0.00494384765625, 0.0084228515625, 0.0031585693359375, 0.01153564453125, -0.0079345703125, 0.01953125, 0.00830078125, 0.009765625, 0.0029754638671875, -0.0147705078125, 0.0181884765625, 0.030029296875, 0.002593994140625, -0.01190185546875, -0.0023040771484375, 0.00148773193359375, -...	[ 14847, 8, 978, 36659, 22836, 60331, 71, 39531, 5908, 12989, 96819, 7440, 144851, 83, 759, 98, 1556, 142508, 27131, 46674, 712, 135206, 262, 85779, 28542, 329, 12321, 9709, 425, 33976, 44402, 21, 3285, 31425, 7941, 2667, 160404, 20949, 5303,...	[ 0.05938720703125, 0.1317138671875, 0.201904296875, 0.10125732421875, 0.1573486328125, 0.1773681640625, 0.13720703125, 0.18359375, 0.1107177734375, 0.201904296875, 0.1168212890625, 0.086669921875, 0.2352294921875, 0.049835205078125, 0.011688232421875, 0.001312255859375, 0.072326660156...	embed
3676773_c0	3676773	haskell	0	Title: If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? Problem title: If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? Tags: lazy-evaluation, tail-recursion, haskell, recursion Problem: If I have an expression, which ...	If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? lazy-evaluation tail-recursion haskell recursion Integral Bool If I have an expression, which is partitially evaluable, ...	[ -0.016357421875, 0.004974365234375, 0.0126953125, 0.00025177001953125, 0.0089111328125, 0.0262451171875, -0.00799560546875, -0.0289306640625, 0.0032958984375, -0.0225830078125, 0.0023651123046875, 0.006378173828125, 0.00396728515625, 0.0181884765625, 0.035400390625, -0.01025390625, 0...	[ 765, 125195, 2878, 118, 25958, 159258, 2661, 4127, 6528, 71864, 46741, 107, 48650, 1830, 21, 3285, 1556, 142508, 195625, 204681, 2460, 929, 9, 204629, 27781, 162520, 3917, 32354, 959, 5844, 5809, 33022, 15673, 2685, 33720, 1900, 11400, 4505, ...	[ 0.06494140625, 0.2491455078125, 0.1395263671875, 0.0799560546875, 0.0433349609375, 0.2255859375, 0.1446533203125, 0.091796875, 0.0853271484375, 0.177001953125, 0.25390625, 0.10235595703125, 0.1937255859375, 0.1119384765625, 0.039794921875, 0.1468505859375, 0.1124267578125, 0.231445...	embed
14820699_c0	14820699	haskell	0	Title: Truncating to Word type Problem title: Truncating to Word type Tags: haskell Problem: Truncating to Word type The following code truncates a number of type Double to one in the type Word16 (although I suspect any other word type behaves similarly, I had to choose one for the example). truncate1 :: Double -> Word...	Truncating to Word type Truncating to Word type haskell Truncating Word Double Word16 truncate1 truncate2 Truncating to Word type The following code truncates a number of type Double to one in the type Word16 (although I suspect any other word type behaves similarly, I had to choose one for the example). As you can rea...	[ 0.0020599365234375, -0.03369140625, 0.01068115234375, -0.0164794921875, -0.0004730224609375, -0.003662109375, -0.0169677734375, -0.00469970703125, 0.006927490234375, -0.00958251953125, -0.024658203125, 0.01171875, -0.0037841796875, -0.00592041015625, 0.00799560546875, 0.0166015625, 0...	[ 19419, 16336, 1916, 47, 22543, 10644, 1556, 142508, 107172, 2485, 14617, 19, 33478, 418, 304, 25632, 18151, 14012, 1632, 92610, 2565, 68991, 55076, 27781, 5117, 360, 18, 37702, 240057, 32354, 8951, 120639, 11389, 51339, 5045, 11522, 17932, 12...	[ 0.156494140625, 0.1590576171875, 0.022186279296875, 0.120361328125, 0.1539306640625, 0.21630859375, 0.1041259765625, 0.1710205078125, 0.1361083984375, 0.173583984375, 0.1671142578125, 0.1019287109375, 0.1556396484375, 0.0165863037109375, 0.1090087890625, 0.005401611328125, 0.11682128...	embed
53075768_c1	53075768	haskell	1	Expected type: Sum Int (a0, b0, c0) Actual type: Sum Int Int • In the first argument of ‘functor’, namely ‘trigger’ In the second argument of ‘($)’, namely ‘functor trigger’ In a stmt of a 'do' block: quickBatch $ functor trigger \| 100 \| quickBatch $ functor trigger \| ^^^^^^^ src/eithermonad.hs:101:28: error: • Couldn...	Expected type: Sum Int (a0, b0, c0) Actual type: Sum Int Int • In the first argument of ‘functor’, namely ‘trigger’ In the second argument of ‘($)’, namely ‘functor trigger’ In a stmt of a 'do' block: quickBatch $ functor trigger \| 100 \| quickBatch $ functor trigger \| ^^^^^^^ src/eithermonad.hs:101:28: error: • Couldn...	[ -0.017578125, 0.006683349609375, -0.01129150390625, 0.00732421875, -0.00494384765625, 0.00238037109375, -0.006500244140625, 0.005401611328125, 0.00927734375, 0.000774383544921875, -0.028076171875, -0.006378173828125, -0.00063323974609375, -0.01312255859375, 0.005645751953125, -0.019409...	[ 60075, 13, 89829, 10644, 36335, 360, 18, 11, 2389, 876, 501, 77495, 100582, 5117, 10750, 16498, 18770, 110987, 3996, 21407, 17932, 4369, 185553, 6138, 111, 246, 46389, 63773, 571, 257, 206, 3650, 7477, 805, 19437, 9319, 712, 127, 35046, 2...	[ 0.151611328125, 0.15771484375, 0.111328125, 0.2086181640625, 0.21630859375, 0.1575927734375, 0.2037353515625, 0.071533203125, 0.110107421875, 0.0352783203125, 0.012969970703125, 0.11962890625, 0.193115234375, 0.0892333984375, 0.2100830078125, 0.1336669921875, 0.1903076171875, 0.043...	embed
56103618_c0	56103618	haskell	0	Title: recursive selection sort proof of correctness Problem title: recursive selection sort proof of correctness Tags: induction, proof-of-correctness, haskell Problem: recursive selection sort proof of correctness I need to prove that the following selection sort code (in Haskell) is always sorting: import Data.List ...	recursive selection sort proof of correctness recursive selection sort proof of correctness induction proof-of-correctness haskell Data.List Ord recursive selection sort proof of correctness I need to prove that the following selection sort code (in Haskell) is always sorting: We can assume that we have a function call...	[ -0.0206298828125, 0.024658203125, 0.01483154296875, 0.00537109375, -0.0179443359375, -0.0208740234375, -0.0086669921875, -0.0289306640625, 0.0045166015625, 0.01806640625, -0.00142669677734375, 0.0113525390625, -0.022705078125, -0.0032958984375, 0.01385498046875, -0.0064697265625, 0.0...	[ 195625, 5844, 132216, 12096, 98869, 111, 26785, 7432, 23, 77391, 4390, 32399, 15390, 1556, 142508, 11809, 154663, 35379, 3871, 23534, 25632, 18151, 20625, 83, 11343, 214, 831, 41591, 32354, 17497, 71, 12765, 3229, 5303, 22836, 118990, 132, 62...	[ 0.21435546875, 0.1182861328125, 0.1812744140625, 0.1947021484375, 0.169677734375, 0.058349609375, 0.1566162109375, 0.0382080078125, 0.08172607421875, 0.1434326171875, 0.063232421875, 0.083251953125, 0.05224609375, 0.107177734375, 0.2008056640625, 0.05517578125, 0.08172607421875, 0....	embed
5277563_c0	5277563	haskell	0	Title: How to find type signatures of multiple imported methods in GHCI Problem title: How to find type signatures of multiple imported methods in GHCI Tags: haskell, ghci, types Problem: How to find type signatures of multiple imported methods in GHCI I'm using a library, which I've loaded into GHCI. From the names of...	How to find type signatures of multiple imported methods in GHCI How to find type signatures of multiple imported methods in GHCI haskell ghci types How GHCI How to find type signatures of multiple imported methods in GHCI I'm using a library, which I've loaded into GHCI. From the names of the functions is not obvious ...	[ 0.01025390625, -0.00787353515625, -0.017333984375, 0.034423828125, -0.0205078125, -0.0032806396484375, -0.0081787109375, -0.00823974609375, -0.01007080078125, -0.029296875, -0.0021514892578125, -0.055419921875, 0.007415771484375, -0.00004673004150390625, -0.0093994140625, 0.00135040283...	[ 11249, 7413, 10644, 138256, 7, 48716, 76242, 71, 150624, 41877, 17304, 23, 1556, 142508, 31380, 318, 52895, 47, 111, 17368, 35773, 1294, 72367, 32354, 162520, 163, 32316, 3444, 1957, 5303, 19882, 3714, 2046, 756, 31255, 11417, 88996, 20928, ...	[ 0.074951171875, 0.1395263671875, 0.259765625, 0.25732421875, 0.10528564453125, 0.2142333984375, 0.2220458984375, 0.0712890625, 0.1845703125, 0.1610107421875, 0.18603515625, 0.030792236328125, 0.134521484375, 0.221923828125, 0.1317138671875, 0.167236328125, 0.208984375, 0.0012817382...	embed
77922671_c1	77922671	haskell	1	twice should give the original list. propertyReverseTwice :: [Int] -> Bool propertyReverseTwice xs = reverse (reverse xs) == xs -- Property 2: The length of the reversed list should be the same as the original list. propertyReverseLengthFail :: [Int] -> Bool propertyReverseLengthFail xs = length (reverse xs) == length...	twice should give the original list. propertyReverseTwice :: [Int] -> Bool propertyReverseTwice xs = reverse (reverse xs) == xs -- Property 2: The length of the reversed list should be the same as the original list. propertyReverseLengthFail :: [Int] -> Bool propertyReverseLengthFail xs = length (reverse xs) == length...	[ -0.00701904296875, 0.031982421875, 0.0225830078125, 0.0262451171875, 0.0003376007080078125, 0.0108642578125, 0.0196533203125, -0.00726318359375, 0.00762939453125, 0.0091552734375, -0.002288818359375, 0.04443359375, 0.0157470703125, 0.01153564453125, -0.00726318359375, 0.03076171875, ...	[ 186351, 5608, 8337, 7311, 5303, 57266, 4332, 37676, 618, 2452, 329, 18, 2460, 929, 1022, 7, 39531, 184, 107, 69112, 206984, 15573, 140909, 5281, 5701, 449, 17647, 379, 997, 106, 22408, 106935, 5117, 6626, 183871, 25793, 7568, 30646, 5201, ...	[ 0.2471923828125, 0.072265625, 0.1134033203125, 0.1243896484375, 0.1923828125, 0.21728515625, 0.072509765625, 0.2666015625, 0.0550537109375, 0.22509765625, 0.1507568359375, 0.0252227783203125, 0.070068359375, 0.1351318359375, 0.09716796875, 0.049835205078125, 0.234375, 0.14282226562...	embed
69184999_c0	69184999	haskell	0	Title: How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? Problem title: How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? Tags: haskell Problem: How to use Atomics Counter for counting operation order...	How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? haskell How Atomics Counter IORef How to use Atomics Counter for counting operation order of randoml...	[ -0.0032806396484375, -0.00909423828125, 0.003875732421875, 0.01153564453125, 0.0133056640625, 0.01080322265625, 0.00750732421875, 0.007659912109375, -0.005584716796875, -0.03662109375, 0.0052490234375, -0.006744384765625, 0.0272216796875, 0.00665283203125, 0.0164794921875, -0.007598876...	[ 11249, 4527, 69728, 28021, 197956, 100, 54529, 214, 41018, 12989, 96759, 74918, 12921, 86997, 1556, 142508, 123435, 4240, 1884, 11907, 1733, 28412, 61972, 114419, 105416, 63284, 11737, 221419, 22631, 11343, 765, 26785, 7722, 1543, 36880, 48716, ...	[ 0.09588623046875, 0.1490478515625, 0.1966552734375, 0.1898193359375, 0.284912109375, 0.02362060546875, 0.1632080078125, 0.0472412109375, 0.190185546875, 0.2103271484375, 0.148193359375, 0.1302490234375, 0.1710205078125, 0.210693359375, 0.093017578125, 0.2010498046875, 0.1336669921875...	embed
78281251_c0	78281251	haskell	0	Title: Example of Massiv Multidimensional Array from a lazy ByteString? Problem title: Example of Massiv Multidimensional Array from a lazy ByteString? Tags: haskell, massiv, arrays, bytestring Problem: Example of Massiv Multidimensional Array from a lazy ByteString? I'm working with large data arrays in the sciences, ...	Example of Massiv Multidimensional Array from a lazy ByteString? Example of Massiv Multidimensional Array from a lazy ByteString? haskell massiv arrays bytestring a Example Massiv Multidimensional Array ByteString BL.readFile myfile.fits Ix2 Float Data.Massiv.Vector Example of Massiv Multidimensional Array from a lazy ...	[ 0.025390625, 0.0162353515625, -0.0162353515625, 0.0218505859375, 0.00518798828125, 0.0205078125, 0.018798828125, 0.00104522705078125, 0.01116943359375, -0.04345703125, -0.001556396484375, -0.0242919921875, -0.0111083984375, 0.00634765625, -0.0157470703125, 0.013916015625, -0.01000976...	[ 89536, 8705, 74227, 4371, 19335, 157955, 69253, 53, 1295, 21, 3285, 3311, 67, 71713, 214, 1556, 142508, 127123, 10298, 4778, 390, 91693, 68170, 39116, 174350, 759, 29822, 16086, 87, 425, 304, 38699, 257, 11809, 53049, 7, 26455, 18770, 20697...	[ 0.1622314453125, 0.0706787109375, 0.1080322265625, 0.2529296875, 0.1240234375, 0.1790771484375, 0.177978515625, 0.141845703125, 0.085205078125, 0.1092529296875, 0.1614990234375, 0.0999755859375, 0.12451171875, 0.1951904296875, 0.08905029296875, 0.08074951171875, 0.2039794921875, 0....	embed
10593435_c1	10593435	haskell	1	zipWith (+) r1 r2 where r1 = map (z0) $ fromJust (IntMap.lookup a arr) r2 = map ((1-z0)) $ fromJust (IntMap.lookup b arr) let logA = if val > 0 then 0 else val where val = logP_proposal + logL_proposal - (lp `index` (a - 1)) - (ll `index` (a - 1)) + ((fromIntegral n - 1) * log z0) logP_proposal = logPrior proposal l...	zipWith (+) r1 r2 where r1 = map (z0) $ fromJust (IntMap.lookup a arr) r2 = map ((1-z0)) $ fromJust (IntMap.lookup b arr) let logA = if val > 0 then 0 else val where val = logP_proposal + logL_proposal - (lp `index` (a - 1)) - (ll `index` (a - 1)) + ((fromIntegral n - 1) * log z0) logP_proposal = logPrior proposal l...	[ -0.005340576171875, 0.01055908203125, -0.0225830078125, -0.007293701171875, -0.01171875, -0.0010223388671875, -0.0045166015625, -0.0133056640625, 0.010498046875, -0.01129150390625, 0.0166015625, 0.047607421875, -0.00830078125, -0.0140380859375, 0.017822265625, -0.0189208984375, -0.00...	[ 68330, 194583, 22183, 1690, 418, 304, 7440, 22288, 169, 77495, 3650, 1295, 127794, 4153, 18, 166179, 64747, 187, 42, 2203, 2633, 12684, 284, 2174, 3502, 977, 757, 7068, 37076, 683, 189461, 997, 866, 26775, 4711, 1181, 161063, 67, 33163, 1...	[ 0.275146484375, 0.271484375, 0.2430419921875, 0.1058349609375, 0.08856201171875, 0.1612548828125, 0.043792724609375, 0.1510009765625, 0.034912109375, 0.0908203125, 0.079833984375, 0.1177978515625, 0.15478515625, 0.028594970703125, 0.08172607421875, 0.195556640625, 0.0650634765625, ...	embed
25803632_c0	25803632	haskell	0	Title: Cabal: where does `cabal update` store its package list? Problem title: Cabal: where does `cabal update` store its package list? Tags: haskell, cabal Problem: Cabal: where does `cabal update` store its package list? (I'm on OS X 10.9) I run this: $ cabal update $ cabal install haskell-platform cabal: There is no...	Cabal: where does `cabal update` store its package list? Cabal: where does `cabal update` store its package list? haskell cabal Cabal There You Users Library Frameworks GHC.framework HaskellPlatform.framework Haskell man1 ghc.1 org.haskell.HaskellPlatform GHC HaskellPlatform Cabal: where does `cabal update` store its p...	[ 0.014404296875, 0.011962890625, 0.015869140625, 0.01116943359375, -0.00445556640625, 0.02490234375, -0.0031890869140625, 0.0164794921875, 0.0167236328125, 0.026123046875, 0.00077056884765625, -0.03173828125, -0.00238037109375, -0.0294189453125, 0.007232666015625, 0.0031890869140625, ...	[ 30438, 289, 7440, 14602, 408, 3571, 28350, 4343, 98169, 5303, 6863, 1556, 142508, 109524, 8622, 2583, 53400, 103835, 202220, 527, 73265, 160328, 18244, 20625, 117231, 5037, 332, 418, 31380, 238, 30910, 10557, 6495, 7, 11787, 1193, 4068, 1126,...	[ 0.2103271484375, 0.219970703125, 0.130126953125, 0.037445068359375, 0.15966796875, 0.2445068359375, 0.2156982421875, 0.1951904296875, 0.228759765625, 0.1871337890625, 0.050384521484375, 0.1134033203125, 0.2440185546875, 0.27490234375, 0.1162109375, 0.1090087890625, 0.12548828125, 0...	embed
26846708_c0	26846708	haskell	0	Title: Failed to install http-conduit-1.9.6 Problem title: Failed to install http-conduit-1.9.6 Tags: haskell, http-conduit, network-programming Problem: Failed to install http-conduit-1.9.6 I'm trying to install http-conduit-1.9.6, and running cabal install http-conduit-1.9.6 gives me the following error: Network/HTTP...	Failed to install http-conduit-1.9.6 Failed to install http-conduit-1.9.6 haskell http-conduit network-programming Failed http-conduit-1.9.6 Network HTTP Conduit Request.hs:43:8 Could Network.URI network-2.5.0.0 Perhaps network-2.4.1.2 Use World Error ExitFailure package.conf.d x86_64-linux-7.6.3 network-2.6.0.2 Failed...	[ -0.00921630859375, 0.01165771484375, 0.016357421875, 0.0208740234375, -0.0035400390625, -0.0079345703125, -0.018798828125, -0.01080322265625, -0.0005340576171875, 0.00408935546875, 0.0028228759765625, -0.05419921875, -0.004486083984375, -0.0150146484375, -0.005279541015625, -0.00683593...	[ 190355, 297, 20600, 1621, 2271, 112061, 5759, 201464, 1556, 142508, 33120, 28966, 28997, 135913, 1657, 75616, 127, 33210, 1019, 191147, 46492, 48413, 5, 99929, 181799, 116591, 48400, 36836, 6661, 212059, 5443, 217, 17647, 379, 98169, 70547, 152...	[ 0.21044921875, 0.059112548828125, 0.185546875, 0.2144775390625, 0.120361328125, 0.2235107421875, 0.0914306640625, 0.27783203125, 0.1298828125, 0.25048828125, 0.14892578125, 0.0726318359375, 0.1190185546875, 0.178955078125, 0.1129150390625, 0.0997314453125, 0.042510986328125, 0.0949...	embed
71993568_c0	71993568	haskell	0	Title: Avoiding conflicting entries in Haskell associative list Problem title: Avoiding conflicting entries in Haskell associative list Tags: haskell Problem: Avoiding conflicting entries in Haskell associative list I have the following associative list: myList :: [(myConcept, String)] myList = [ (myInput, "get_input")...	Avoiding conflicting entries in Haskell associative list Avoiding conflicting entries in Haskell associative list haskell Avoiding Haskell get_input get_output get_values Data Bool x:xs Avoiding conflicting entries in Haskell associative list I have the following associative list: I want to ensure that the list does no...	[ -0.00032806396484375, 0.007415771484375, -0.0022735595703125, -0.0106201171875, -0.005126953125, -0.029541015625, 0.0035247802734375, 0.00262451171875, 0.01385498046875, 0.00701904296875, 0.017333984375, 0.016845703125, 0.031494140625, -0.00213623046875, -0.00191497802734375, 0.0109863...	[ 84361, 86675, 79612, 214, 112820, 90, 20625, 142508, 166027, 272, 5303, 1556, 2046, 73, 6056, 27494, 11809, 2460, 929, 1022, 425, 23, 25632, 3444, 63284, 959, 2499, 49814, 7722, 42719, 759, 11935, 19462, 23351, 71864, 32354, 56282, 22799, 1...	[ 0.1964111328125, 0.02935791015625, 0.2242431640625, 0.129638671875, 0.1856689453125, 0.040618896484375, 0.1273193359375, 0.2193603515625, 0.1649169921875, 0.0972900390625, 0.1854248046875, 0.1064453125, 0.030364990234375, 0.014892578125, 0.051727294921875, 0.079345703125, 0.037536621...	embed
8172548_c0	8172548	haskell	0	Title: Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? Problem title: Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? Tags: haskell, pattern-matching Problem: Is it possible to export constructors for pat...	Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? haskell pattern-matching Haskell Modules Is it possible to export constructors for pattern matching, but not...	[ 0.0002803802490234375, 0.0106201171875, -0.0017242431640625, 0.0135498046875, -0.005523681640625, 0.0103759765625, -0.00775146484375, 0.004974365234375, -0.002471923828125, -0.009033203125, -0.00909423828125, -0.01153564453125, 0.008544921875, 0.01434326171875, -0.008056640625, -0.0057...	[ 7722, 31255, 64549, 25251, 100, 103510, 14858, 1284, 959, 50961, 20625, 142508, 63014, 214, 23, 1556, 98753, 131, 2298, 2053, 10644, 45234, 707, 1286, 11301, 6626, 31486, 125195, 8060, 39864, 6863, 32354, 10750, 27169, 47, 83425, 52895, 88996...	[ 0.1475830078125, 0.2381591796875, 0.2047119140625, 0.1739501953125, 0.03594970703125, 0.1939697265625, 0.1875, 0.049468994140625, 0.0811767578125, 0.181884765625, 0.123291015625, 0.2249755859375, 0.1728515625, 0.055145263671875, 0.0313720703125, 0.07049560546875, 0.1673583984375, 0...	embed
907306_c0	907306	haskell	0	Title: Confusion about currying and point free style in Haskell Problem title: Confusion about currying and point free style in Haskell Tags: currying, pointfree, haskell Problem: Confusion about currying and point free style in Haskell I was trying to implement the function every :: (a -> IO Bool) -> [a] -> IO Bool wh...	Confusion about currying and point free style in Haskell Confusion about currying and point free style in Haskell currying pointfree haskell Confusion Haskell Bool Compiling Main stk.hs stk.hs:53:42 Couldn Failed Confusion about currying and point free style in Haskell I was trying to implement the function which was t...	[ 0.0054931640625, 0.0093994140625, -0.00144195556640625, -0.003753662109375, 0.00081634521484375, 0.01416015625, 0.0186767578125, -0.01190185546875, 0.0172119140625, -0.03515625, -0.007080078125, -0.027587890625, -0.003631591796875, 0.0033721923828125, -0.00634765625, 0.0008621215820312...	[ 92105, 198555, 214, 6275, 4092, 20623, 20625, 142508, 32087, 1556, 2460, 929, 15612, 49725, 12321, 55188, 127, 191147, 190355, 1657, 136, 29479, 32354, 37842, 15490, 143726, 195625, 18151, 18, 4488, 21, 3285, 56065, 110, 965, 16610, 21185, 10...	[ 0.15283203125, 0.2362060546875, 0.152099609375, 0.165771484375, 0.166748046875, 0.203369140625, 0.1302490234375, 0.236328125, 0.1971435546875, 0.123046875, 0.05352783203125, 0.144775390625, 0.0241851806640625, 0.019073486328125, 0.041168212890625, 0.0643310546875, 0.034393310546875, ...	embed
61440490_c0	61440490	haskell	0	Title: Using a typeclass for variadic argument pattern in Haskell Problem title: Using a typeclass for variadic argument pattern in Haskell Tags: recursion, typeclass, haskell Problem: Using a typeclass for variadic argument pattern in Haskell Let's say I have a convention in Haskell where I define a series of function...	Using a typeclass for variadic argument pattern in Haskell Using a typeclass for variadic argument pattern in Haskell recursion typeclass haskell Using Haskell Node MkNode NAble Using a typeclass for variadic argument pattern in Haskell Let's say I have a convention in Haskell where I define a series of functions like ...	[ -0.017578125, 0.002471923828125, -0.015380859375, 0.006561279296875, 0.005218505859375, 0.013427734375, -0.019287109375, 0.00811767578125, 0.0084228515625, -0.038330078125, -0.004730224609375, -0.040771484375, -0.01214599609375, 0.0031890869140625, 0.00872802734375, -0.0157470703125, ...	[ 345, 10644, 67413, 100, 16757, 18403, 10750, 103510, 20625, 142508, 195625, 1830, 1556, 438, 112, 92, 5021, 3076, 2661, 101805, 61924, 36549, 32354, 1884, 903, 4263, 7722, 5161, 91, 19, 51776, 77336, 14012, 11343, 678, 51592, 8108, 17368, 2...	[ 0.044464111328125, 0.209716796875, 0.297119140625, 0.008636474609375, 0.2408447265625, 0.107421875, 0.2308349609375, 0.22314453125, 0.1162109375, 0.2200927734375, 0.2039794921875, 0.01263427734375, 0.1007080078125, 0.0784912109375, 0.060699462890625, 0.0299072265625, 0.1173095703125,...	embed
16116313_c0	16116313	haskell	0	Title: How best to type "Any monad transformer stack containing m" Problem title: How best to type "Any monad transformer stack containing m" Tags: monad-transformers, haskell Problem: How best to type "Any monad transformer stack containing m" I'd like to write the function fixProxy :: (Monad m, Pr...	How best to type "Any monad transformer stack containing m" How best to type "Any monad transformer stack containing m" monad-transformers haskell How Any Monad Proxy Num RandomSource MonadRandom WriterT RVarT Data.Random.Lift.Lift Lift RVar StdUniform How best to type "Any monad transformer stack c...	[ 0.00087738037109375, 0.0223388671875, 0.0033416748046875, -0.0162353515625, 0.0245361328125, -0.0089111328125, -0.003326416015625, -0.02490234375, 0.006011962890625, -0.033935546875, 0.0277099609375, 0.00099945068359375, 0.007171630859375, -0.003631591796875, 0.0234375, -0.000926971435...	[ 11249, 2965, 10644, 299, 2667, 712, 27198, 56, 177261, 70541, 347, 214, 215175, 1314, 1556, 142508, 28541, 60331, 71, 1250, 50878, 52782, 39643, 211235, 126525, 3815, 2783, 618, 627, 81827, 11809, 9506, 2480, 166562, 2907, 85600, 5037, 33022,...	[ 0.00634765625, 0.111572265625, 0.2353515625, 0.10595703125, 0.1103515625, 0.1524658203125, 0.19384765625, 0.08966064453125, 0.1763916015625, 0.115234375, 0.1673583984375, 0.0243072509765625, 0.1800537109375, 0.0723876953125, 0.031463623046875, 0.1607666015625, 0.0916748046875, 0.11...	embed
25831370_c0	25831370	haskell	0	Title: Understanding Wikipedia's example of Haskell's Maybe monad Problem title: Understanding Wikipedia's example of Haskell's Maybe monad Tags: haskell, option-type, monads Problem: Understanding Wikipedia's example of Haskell's Maybe monad I think I understand the monad concept in Haskell, i.e., ...	Understanding Wikipedia's example of Haskell's Maybe monad Understanding Wikipedia's example of Haskell's Maybe monad haskell option-type monads Understanding Wikipedia Haskell Maybe Adds Nothing Extracts Wraps Just Then What Understanding Wikipedia's example of Haskell's Maybe monad I think I under...	[ -0.0029754638671875, 0.002349853515625, 0.035400390625, 0.0113525390625, 0.007659912109375, 0.0216064453125, 0.017578125, -0.01202392578125, 0.002471923828125, -0.000629425048828125, 0.0157470703125, -0.01708984375, -0.0186767578125, 0.0009002685546875, 0.00787353515625, -0.00071716308...	[ 9626, 144057, 8162, 3768, 27781, 20625, 142508, 83425, 2667, 712, 1556, 35829, 50986, 29117, 182747, 31501, 13631, 9563, 28219, 23755, 31486, 6396, 1369, 136, 30646, 10176, 55681, 6002, 86531, 38415, 2856, 78091, 32354, 12989, 219836, 4347, 356...	[ 0.07666015625, 0.052398681640625, 0.1710205078125, 0.042572021484375, 0.178955078125, 0.12158203125, 0.2470703125, 0.2275390625, 0.1611328125, 0.225341796875, 0.0784912109375, 0.1663818359375, 0.09893798828125, 0.1036376953125, 0.1444091796875, 0.1363525390625, 0.164794921875, 0.05...	embed
37310232_c0	37310232	haskell	0	Title: How to resolve issue with building stream-fusion Problem title: How to resolve issue with building stream-fusion Tags: haskell Problem: How to resolve issue with building stream-fusion I'm trying to bring in the stream-fusion library into my project. I am using Stack (LTS 5.16). I added the stream-fusion-0.1.2.5...	How to resolve issue with building stream-fusion How to resolve issue with building stream-fusion haskell of module How stream-fusion-0.1.2.5 While Users x86_64-osx setup-Simple-Cabal-1.22.5.0-ghc-7.10.3 Cabal-1.22.5.0 Process ExitFailure Logs Haskell stream-fusion-0.1.2.5.log Configuring Building Preprocessing Compili...	[ -0.0230712890625, 0.00811767578125, 0.00946044921875, -0.02099609375, -0.00775146484375, -0.0169677734375, -0.01519775390625, -0.0291748046875, -0.00860595703125, 0.01153564453125, 0.00634765625, -0.03173828125, 0.0145263671875, 0.01416015625, 0.016845703125, -0.00518798828125, -0.00...	[ 11249, 47, 103608, 31089, 678, 33976, 75973, 9, 92105, 1556, 142508, 111, 88996, 102014, 5, 48413, 53400, 15276, 13307, 232, 425, 169581, 8859, 33209, 20370, 3571, 4015, 187461, 10179, 30438, 289, 123996, 5443, 17647, 379, 13146, 20625, 4867,...	[ 0.07470703125, 0.0155792236328125, 0.2255859375, 0.1680908203125, 0.042266845703125, 0.2103271484375, 0.2158203125, 0.0304107666015625, 0.285400390625, 0.1441650390625, 0.260009765625, 0.031280517578125, 0.1947021484375, 0.1644287109375, 0.03839111328125, 0.25146484375, 0.05633544921...	embed
26502434_c0	26502434	haskell	0	Title: How to test the homomorphism law of an Applicative instance? Problem title: How to test the homomorphism law of an Applicative instance? Tags: homomorphism, proof, typeclass, haskell, applicative Problem: How to test the homomorphism law of an Applicative instance? I'm doing the exercises from Typeclassopedia ; ...	How to test the homomorphism law of an Applicative instance? How to test the homomorphism law of an Applicative instance? homomorphism proof typeclass haskell applicative How Applicative ZipList MZipList Show Functor Main How to test the homomorphism law of an Applicative instance? I'm doing the exercises from Typeclas...	[ 0.00130462646484375, 0.0068359375, 0.00173187255859375, 0.0194091796875, -0.0167236328125, 0.0380859375, 0.0006866455078125, -0.00408935546875, -0.00135040283203125, -0.01806640625, 0.008544921875, -0.0284423828125, -0.00640869140625, 0.014404296875, -0.00127410888671875, -0.0047607421...	[ 11249, 3034, 12840, 178851, 8780, 27165, 5659, 11048, 4935, 110527, 47, 98869, 10644, 67413, 1556, 142508, 41816, 162150, 154663, 119114, 3442, 17367, 28670, 18770, 12321, 70, 81979, 60457, 76994, 33022, 34166, 32354, 12765, 28960, 36293, 182324,...	[ 0.07000732421875, 0.2529296875, 0.2486572265625, 0.2490234375, 0.108642578125, 0.181396484375, 0.13720703125, 0.172607421875, 0.16357421875, 0.1953125, 0.048980712890625, 0.1202392578125, 0.10479736328125, 0.14892578125, 0.07293701171875, 0.1781005859375, 0.13671875, 0.177368164062...	embed
77999890_c2	77999890	haskell	2	] fail (backjumping, conflict set: diagrams-cairo, pango)\nAfter searching the rest of the dependency tree exhaustively, these were the\ngoals I've had most trouble fulfilling: base, pango, diagrams-cairo,\nyampa-gloss, yampa-gloss:examples\nTry running with --minimize-conflict-set to improve the error message.\n\n" ]}...	] fail (backjumping, conflict set: diagrams-cairo, pango)\nAfter searching the rest of the dependency tree exhaustively, these were the\ngoals I've had most trouble fulfilling: base, pango, diagrams-cairo,\nyampa-gloss, yampa-gloss:examples\nTry running with --minimize-conflict-set to improve the error message.\n\n" ]}...	[ -0.0126953125, -0.000682830810546875, 0.019775390625, 0.0299072265625, 0.000972747802734375, -0.0034637451171875, -0.00750732421875, -0.0020599365234375, -0.00946044921875, 0.05224609375, 0.017578125, -0.015869140625, 0.01275634765625, -0.0146484375, 0.001983642578125, 0.0147705078125,...	[ 10114, 35782, 12620, 461, 44287, 79612, 5423, 117233, 7, 102241, 31, 8743, 157318, 42548, 27771, 53201, 146353, 19120, 16765, 2684, 63134, 211394, 3647, 273, 15293, 38869, 151, 302, 1294, 51042, 678, 4210, 1249, 77651, 2271, 134225, 3509, 522...	[ 0.02923583984375, 0.2379150390625, 0.140380859375, 0.1766357421875, 0.1519775390625, 0.259521484375, 0.1422119140625, 0.18115234375, 0.02874755859375, 0.1102294921875, 0.2208251953125, 0.18115234375, 0.000152587890625, 0.20947265625, 0.06964111328125, 0.1451416015625, 0.0045776367187...	embed
66290022_c0	66290022	haskell	0	Title: What are the correct type annotations for a function to find prime numbers using square root? Problem title: What are the correct type annotations for a function to find prime numbers using square root? Tags: haskell Problem: What are the correct type annotations for a function to find prime numbers using square...	What are the correct type annotations for a function to find prime numbers using square root? What are the correct type annotations for a function to find prime numbers using square root? haskell square a being What Ambiguous Show Probable These Ordering Defined GHC.Show Integer Maybe What are the correct type annotati...	[ -0.01483154296875, 0.003387451171875, 0.023193359375, 0.01470947265625, 0.0169677734375, -0.00384521484375, 0.00927734375, -0.0166015625, -0.006988525390625, 0.00518798828125, 0.004119873046875, -0.0284423828125, 0.0005645751953125, -0.0166015625, -0.021240234375, -0.0020294189453125, ...	[ 26785, 10644, 8668, 22062, 32354, 7413, 20809, 101935, 17368, 108047, 74855, 1556, 142508, 10, 8035, 4865, 10250, 12282, 10821, 17367, 1250, 275, 2886, 32255, 81206, 5983, 527, 73265, 168660, 44401, 83425, 52295, 71924, 1733, 175199, 36766, 140...	[ 0.1324462890625, 0.207763671875, 0.1611328125, 0.1119384765625, 0.17578125, 0.118896484375, 0.2138671875, 0.17431640625, 0.0703125, 0.1783447265625, 0.2353515625, 0.11328125, 0.2298583984375, 0.0498046875, 0.2139892578125, 0.001190185546875, 0.058349609375, 0.1234130859375, 0.016...	embed
32724130_c1	32724130	haskell	1	0, base-4.2.0.2, base-4.2.0.1, base-4.2.0.0, base-4.1.0.0, base-4.0.0.0, base-3.0.3.2, base-3.0.3.1 (constraint from non-upgradeable package requires installed instance) Dependency tree exhaustively searched. Note: when using a sandbox, all packages are required to have consistent dependencies. Try reinstalling/unregis...	0, base-4.2.0.2, base-4.2.0.1, base-4.2.0.0, base-4.1.0.0, base-4.0.0.0, base-3.0.3.2, base-3.0.3.1 (constraint from non-upgradeable package requires installed instance) Dependency tree exhaustively searched. Note: when using a sandbox, all packages are required to have consistent dependencies. Try reinstalling/unregis...	[ -0.006378173828125, -0.003143310546875, 0.022216796875, 0.002227783203125, -0.0045166015625, 0.01214599609375, -0.010986328125, -0.0018768310546875, 0.004180908203125, 0.041748046875, 0.0079345703125, -0.01397705078125, 0.0147705078125, 0.01104736328125, 0.0164794921875, 0.011962890625...	[ 757, 3647, 117904, 5, 133684, 102014, 99929, 9, 120518, 151152, 4, 132265, 107033, 97109, 2271, 2816, 351, 2037, 44286, 2886, 98169, 144570, 20600, 297, 110527, 262, 26885, 27771, 53201, 146353, 5844, 538, 33938, 18622, 17368, 19096, 11728, 7...	[ 0.1275634765625, 0.2078857421875, 0.2088623046875, 0.0655517578125, 0.173828125, 0.150146484375, 0.1793212890625, 0.0245819091796875, 0.2054443359375, 0.1990966796875, 0.0042724609375, 0.155029296875, 0.1435546875, 0.155517578125, 0.0287933349609375, 0.1475830078125, 0.1080322265625,...	embed
25347542_c0	25347542	haskell	0	Title: Typeclass for list <-> tuple conversion Problem title: Typeclass for list <-> tuple conversion Tags: haskell, typeclass Problem: Typeclass for list <-> tuple conversion I have a set of functions to convert between tuples and lists: pack2 :: [a] -> (a, a) pack2 (a:b:_) = (a, b) unpack2 :: (a, a) -> [a...	Typeclass for list <-> tuple conversion Typeclass for list <-> tuple conversion haskell typeclass the Typeclass pack2 a:b:_ unpack2 pack3 a:b:c:_ unpack3 Pack MultiParamTypeClasses FlexibleInstances Could Num When Probable Typeclass for list <-> tuple conversion I have a set of functions to convert between ...	[ 0.00634765625, 0.003875732421875, 0.007537841796875, 0.0103759765625, -0.01055908203125, 0.02294921875, 0.002349853515625, -0.006927490234375, 0.01373291015625, 0.01416015625, -0.00927734375, -0.0093994140625, 0.001220703125, 0.0157470703125, -0.02587890625, 0.00958251953125, 0.00337...	[ 60457, 67413, 100, 5303, 5386, 370, 8705, 142477, 1556, 142508, 10644, 43824, 304, 51, 29102, 363, 56607, 19335, 55292, 196707, 140803, 180842, 2661, 116071, 191147, 52782, 14847, 1250, 275, 2886, 5423, 32354, 96760, 17721, 99726, 136, 3444, ...	[ 0.2086181640625, 0.29541015625, 0.05999755859375, 0.2197265625, 0.0615234375, 0.1329345703125, 0.20263671875, 0.18310546875, 0.1212158203125, 0.2132568359375, 0.1585693359375, 0.140869140625, 0.045562744140625, 0.041290283203125, 0.155029296875, 0.071044921875, 0.1143798828125, 0.1...	embed
27470887_c0	27470887	haskell	0	Title: Sorting records by dates represented as tuples Problem title: Sorting records by dates represented as tuples Tags: quicksort, haskell Problem: Sorting records by dates represented as tuples I am trying to make a function that sorts a List of Person (which is a tuple of (Name, Date), whereby date is a tuple of (I...	Sorting records by dates represented as tuples Sorting records by dates represented as tuples quicksort haskell Sorting Person x:xs x:y:xs y:xs Sorting records by dates represented as tuples I am trying to make a function that sorts a List of Person (which is a tuple of (Name, Date), whereby date is a tuple of (Int, In...	[ -0.00098419189453125, -0.0103759765625, 0.0054931640625, -0.000031948089599609375, -0.02734375, 0.003662109375, -0.030517578125, 0.0167236328125, 0.00433349609375, 0.01171875, -0.017822265625, 0.017333984375, 0.00089263916015625, -0.0067138671875, 0.0023651123046875, -0.01611328125, ...	[ 53666, 214, 115923, 390, 112474, 33636, 237, 370, 99726, 63773, 62351, 1556, 142508, 15270, 1022, 425, 113, 31577, 32354, 12096, 7, 32036, 111, 8705, 163612, 25512, 5622, 18, 15236, 24057, 25590, 108354, 10176, 2046, 20800, 4216, 2208, 919, ...	[ 0.216796875, 0.0501708984375, 0.17236328125, 0.09442138671875, 0.160888671875, 0.1949462890625, 0.0865478515625, 0.1256103515625, 0.2196044921875, 0.1329345703125, 0.244384765625, 0.1055908203125, 0.203369140625, 0.1373291015625, 0.024505615234375, 0.03240966796875, 0.033843994140625...	embed
12133932_c0	12133932	haskell	0	Title: Numbers as multiplicative functions (weird but entertaining) Problem title: Numbers as multiplicative functions (weird but entertaining) Tags: haskell Problem: Numbers as multiplicative functions (weird but entertaining) In the comments of the question Tacit function composition in Haskell , people mentioned mak...	Numbers as multiplicative functions (weird but entertaining) Numbers as multiplicative functions (weird but entertaining) haskell Control.Applicative Numbers Num LANGUAGE TypeFamilies Show GHC Haskell liftA2 Main Numbers as multiplicative functions (weird but entertaining) In the comments of the question Tacit function...	[ -0.0169677734375, -0.0008697509765625, 0.0120849609375, 0.0103759765625, 0.003814697265625, 0.0211181640625, 0.0096435546875, -0.0087890625, 0.004486083984375, -0.0296630859375, -0.0198974609375, 0.004913330078125, 0.01171875, 0.011474609375, -0.00543212890625, -0.0125732421875, -0.0...	[ 103332, 7, 237, 127664, 4935, 32354, 1177, 82249, 1284, 187507, 214, 1556, 142508, 27131, 39179, 11048, 52782, 98064, 60457, 1191, 17367, 527, 73265, 20625, 60520, 284, 304, 12321, 24626, 1218, 12645, 166577, 20662, 110527, 100, 10, 33079, 16...	[ 0.1920166015625, 0.0406494140625, 0.1279296875, 0.2083740234375, 0.125, 0.19140625, 0.045013427734375, 0.160888671875, 0.112548828125, 0.207275390625, 0.1121826171875, 0.125, 0.2315673828125, 0.1678466796875, 0.07855224609375, 0.1519775390625, 0.2230224609375, 0.072021484375, 0.0...	embed
65540771_c1	65540771	haskell	1	-0.1.0.0\doc\html\testcabal1\testcabal1.haddock doesn't exist or isn't a file testcabal1-0.1.0.0: Warning: haddock-html: C:\projects\haskell\testcabal1\dist-newstyle\build\x86_64-windows\ghc-8.10.2\testcabal1-0.1.0.0\doc\html\testcabal1 doesn't exist or isn't a directory testcabal1-0.1.0.0: library-dirs: Files\Haskell ...	-0.1.0.0\doc\html\testcabal1\testcabal1.haddock doesn't exist or isn't a file testcabal1-0.1.0.0: Warning: haddock-html: C:\projects\haskell\testcabal1\dist-newstyle\build\x86_64-windows\ghc-8.10.2\testcabal1-0.1.0.0\doc\html\testcabal1 doesn't exist or isn't a directory testcabal1-0.1.0.0: library-dirs: Files\Haskell ...	[ 0.006072998046875, -0.0023956298828125, 0.01116943359375, 0.002349853515625, -0.0052490234375, 0.00408935546875, -0.0272216796875, -0.0037078857421875, -0.00958251953125, 0.031494140625, -0.005859375, -0.03466796875, -0.01336669921875, -0.0023345947265625, 0.00732421875, -0.00720214843...	[ 20, 102014, 99929, 29713, 7693, 6954, 408, 3571, 418, 5, 8408, 138414, 22027, 18, 32316, 707, 56112, 11435, 3034, 180033, 22892, 5550, 592, 1902, 313, 12, 95322, 10557, 142508, 46295, 54936, 40946, 177149, 15276, 13307, 229792, 9486, 238, 1...	[ 0.0037841796875, 0.14404296875, 0.175048828125, 0.151123046875, 0.1988525390625, 0.253662109375, 0.155029296875, 0.26220703125, 0.1553955078125, 0.01959228515625, 0.1964111328125, 0.306640625, 0.04608154296875, 0.0888671875, 0.212890625, 0.030609130859375, 0.056884765625, 0.1950683...	embed
58465452_c0	58465452	haskell	0	Title: Return the first iteration of a sequence from a list in Haskell Problem title: Return the first iteration of a sequence from a list in Haskell Tags: functional-programming, haskell, math Problem: Return the first iteration of a sequence from a list in Haskell I have an array of sequences, with infinite iteration...	Return the first iteration of a sequence from a list in Haskell Return the first iteration of a sequence from a list in Haskell functional-programming haskell math a Haskell Integral Return the first iteration of a sequence from a list in Haskell I have an array of sequences, with infinite iterations (e.g. [6,6,6,6,6] ...	[ -0.0057373046875, 0.006378173828125, -0.01116943359375, 0.00872802734375, -0.01434326171875, -0.000644683837890625, 0.018310546875, 0.01275634765625, -0.0218505859375, -0.041015625, -0.0008392333984375, 0.0224609375, -0.0076904296875, 0.02978515625, 0.01190185546875, -0.0113525390625, ...	[ 173340, 5117, 17, 720, 2320, 40, 944, 3956, 1295, 5303, 20625, 142508, 23, 123309, 28966, 1556, 48909, 204681, 10298, 26513, 678, 54241, 910, 140447, 3742, 744, 24645, 138, 201, 11249, 8560, 67, 8305, 12638, 6044, 30646, 4734, 7225, 36917, ...	[ 0.212646484375, 0.1964111328125, 0.106689453125, 0.263671875, 0.1112060546875, 0.08209228515625, 0.139892578125, 0.056976318359375, 0.094482421875, 0.21826171875, 0.1611328125, 0.242431640625, 0.02886962890625, 0.1087646484375, 0.04736328125, 0.1390380859375, 0.0687255859375, 0.135...	embed
24973253_c0	24973253	haskell	0	Title: Trying to get rid of nested expressions Problem title: Trying to get rid of nested expressions Tags: haskell Problem: Trying to get rid of nested expressions I have a yaml file: base123: key1: "key1" key2: "key2" key3: "key3" and code which is suppoused to read all 3 values from it: read123 :: IO (String, String...	Trying to get rid of nested expressions Trying to get rid of nested expressions haskell Trying base123 key1 key2 key3 read123 Y.decodeFile config.yml Maybe Y.Value Just res1 Object res2 LHashMap.lookup res3 Nothing error123 Couldn Expected Value Actual Trying to get rid of nested expressions I have a yaml file: and cod...	[ -0.01153564453125, -0.0093994140625, -0.006378173828125, -0.005157470703125, 0.038330078125, 0.000537872314453125, 0.00186920166015625, -0.02392578125, -0.004119873046875, -0.002593994140625, 0.0009002685546875, -0.009765625, -0.01165771484375, -0.01611328125, 0.0126953125, -0.00683593...	[ 40858, 2046, 31351, 8512, 71, 125195, 111, 1556, 142508, 3647, 48636, 22799, 363, 12301, 990, 112, 40899, 174350, 153837, 53, 7237, 856, 50770, 3332, 134549, 6495, 1495, 166179, 64747, 182747, 18499, 191147, 60075, 13, 190060, 100582, 151, 11...	[ 0.07373046875, 0.059234619140625, 0.151123046875, 0.26123046875, 0.1617431640625, 0.2322998046875, 0.0340576171875, 0.120361328125, 0.19580078125, 0.1324462890625, 0.1783447265625, 0.12841796875, 0.057952880859375, 0.135009765625, 0.09765625, 0.1134033203125, 0.1248779296875, 0.065...	embed
49912173_c0	49912173	haskell	0	Title: Is it possible to compute with high accuracy if a series converges using Haskell? Problem title: Is it possible to compute with high accuracy if a series converges using Haskell? Tags: haskell, math, functional-programming Problem: Is it possible to compute with high accuracy if a series converges using Haskell?...	Is it possible to compute with high accuracy if a series converges using Haskell? Is it possible to compute with high accuracy if a series converges using Haskell? haskell math functional-programming Haskell Expr Bool Map.fromList Is it possible to compute with high accuracy if a series converges using Haskell? I am tr...	[ -0.017822265625, -0.00008535385131835938, -0.002227783203125, 0.005767822265625, -0.009521484375, 0.01708984375, -0.0027923583984375, 0.01611328125, 0.01007080078125, -0.00506591796875, 0.0011444091796875, 0.023681640625, -0.005157470703125, -0.007720947265625, -0.00885009765625, 0.013...	[ 2071, 442, 7722, 9969, 6743, 678, 11192, 61689, 219, 2408, 2174, 36549, 158, 74789, 7, 17368, 20625, 142508, 10, 1556, 48909, 123309, 28966, 60075, 42, 2460, 929, 42719, 161063, 154663, 47, 85493, 114122, 35773, 1294, 23, 22, 40899, 125195,...	[ 0.048980712890625, 0.028656005859375, 0.1805419921875, 0.17626953125, 0.19189453125, 0.109375, 0.1533203125, 0.166015625, 0.161376953125, 0.107421875, 0.101318359375, 0.2479248046875, 0.141845703125, 0.27783203125, 0.0931396484375, 0.14794921875, 0.1591796875, 0.307373046875, 0.0...	embed
43452514_c0	43452514	haskell	0	Title: Customizing the fields generated by automatic derivation of ToSchema Problem title: Customizing the fields generated by automatic derivation of ToSchema Tags: haskell, servant, derived-instances Problem: Customizing the fields generated by automatic derivation of ToSchema I have the following type: data Device =...	Customizing the fields generated by automatic derivation of ToSchema Customizing the fields generated by automatic derivation of ToSchema haskell servant derived-instances Customizing ToSchema Device _deviceId DeviceId _deviceName Text _deviceDtype DType Show Generic _device Make JSON Options Customizing the fields gen...	[ 0.01025390625, 0.0235595703125, -0.00311279296875, 0.02001953125, 0.00823974609375, -0.0025177001953125, -0.001495361328125, 0.0074462890625, -0.00494384765625, -0.00439453125, -0.001251220703125, 0.0238037109375, -0.005401611328125, 0.005706787109375, -0.0186767578125, -0.004821777343...	[ 130664, 84382, 44457, 139392, 101038, 30057, 717, 25452, 11883, 1556, 142508, 187646, 16406, 116071, 174842, 112, 20375, 568, 163612, 24129, 50986, 391, 196707, 17367, 88342, 26176, 821, 58627, 152448, 25632, 10644, 4527, 122, 5844, 1375, 64457, ...	[ 0.210205078125, 0.0413818359375, 0.19677734375, 0.131103515625, 0.1942138671875, 0.1905517578125, 0.1954345703125, 0.157470703125, 0.179931640625, 0.119873046875, 0.2235107421875, 0.2095947265625, 0.1190185546875, 0.110595703125, 0.1822509765625, 0.061279296875, 0.147216796875, 0.0...	embed
46357747_c0	46357747	haskell	0	Title: Haddock - Data record fields names not being generated Problem title: Haddock - Data record fields names not being generated Tags: haskell, haddock, hackage Problem: Haddock - Data record fields names not being generated I'm having trouble getting haddock to display the field names of my data records. Some of my...	Haddock - Data record fields names not being generated Haddock - Data record fields names not being generated haskell haddock hackage Haddock Data API PriceHistoryResponse PriceHistoryResponseData Maybe Integer Show Generic DuplicateRecordFields Haddock - Data record fields names not being generated I'm having trouble ...	[ 0, 0.00811767578125, 0.0013427734375, 0.00174713134765625, 0.00933837890625, 0.02880859375, 0.0125732421875, -0.00848388671875, 0.00164031982421875, 0.02783203125, -0.008056640625, -0.021240234375, -0.007720947265625, 0.004180908203125, 0.0057373046875, -0.01263427734375, 0.028442382...	[ 28129, 138414, 11809, 17164, 44457, 123055, 959, 8035, 139392, 1556, 142508, 1902, 85526, 61687, 48025, 20861, 86385, 94399, 137989, 83425, 44401, 17367, 88342, 786, 52721, 67, 32271, 6159, 19388, 63134, 44116, 2053, 115923, 52895, 5941, 12921, ...	[ 0.2039794921875, 0.26953125, 0.12060546875, 0.2049560546875, 0.2247314453125, 0.1611328125, 0.122802734375, 0.08251953125, 0.192626953125, 0.1109619140625, 0.173095703125, 0.1719970703125, 0.1708984375, 0.112548828125, 0.12353515625, 0.010406494140625, 0.0149688720703125, 0.1029052...	embed
70218909_c0	70218909	haskell	0	Title: Haskell PolyKinds extension and type families Problem title: Haskell PolyKinds extension and type families Tags: polykinds, functional-programming, haskell, types, data-kinds Problem: Haskell PolyKinds extension and type families I working on type families in Haskell to get deeper inside this topic, and trying t...	Haskell PolyKinds extension and type families Haskell PolyKinds extension and type families polykinds functional-programming haskell types data-kinds Haskell PolyKinds LANGUAGE TypeFamilies StandaloneKindSignatures RankNTypes DataKinds TypeOperators TypeApplications KindSignatures ScopedTypeVariables UndecidableInstanc...	[ 0.01434326171875, 0.007049560546875, -0.0023193359375, -0.01080322265625, -0.009521484375, -0.01104736328125, 0.0087890625, -0.01446533203125, -0.0140380859375, -0.00897216796875, 0.0162353515625, -0.0419921875, 0.0038604736328125, 0.00811767578125, -0.0079345703125, -0.005126953125, ...	[ 20625, 142508, 63306, 605, 7250, 111938, 136, 10644, 87143, 35874, 68347, 123309, 28966, 1556, 52895, 2053, 98064, 60457, 919, 1191, 32487, 51684, 218723, 134405, 196707, 11809, 156823, 47677, 182867, 27435, 182783, 81827, 79912, 24750, 116071, 1...	[ 0.1358642578125, 0.2332763671875, 0.185302734375, 0.1180419921875, 0.2022705078125, 0.1787109375, 0.031494140625, 0.195068359375, 0.18359375, 0.1502685546875, 0.1832275390625, 0.0919189453125, 0.078369140625, 0.1168212890625, 0.1744384765625, 0.039276123046875, 0.0872802734375, 0.1...	embed
32921132_c0	32921132	haskell	0	Title: Using GHC as library Problem title: Using GHC as library Tags: api, ghci, haskell Problem: Using GHC as library What would be the simplest example of sending an expression to ghci via its api for evaluation and printing the result? I am not able to find a complete example that would work. Yes, I have tried https...	Using GHC as library Using GHC as library api ghci haskell GHC GHC.Paths GhcMonad Debugger DynFlags Outputable Language.Haskell.HsColour Language.Haskell.HsColour.Colourise Using GHC.setSessionDynFlags TTY Just RunToCompletion RunOk mapM_ AnId Using GHC as library What would be the simplest example of sending an expres...	[ -0.007415771484375, 0.0002536773681640625, 0.0091552734375, 0.005950927734375, 0.0032501220703125, 0.007293701171875, 0.005615234375, -0.00421142578125, -0.00848388671875, -0.033935546875, 0.004119873046875, -0.01226806640625, -0.0089111328125, -0.0177001953125, -0.0009765625, 0.007263...	[ 345, 527, 73265, 237, 35773, 1294, 31470, 31380, 318, 1556, 142508, 10519, 55112, 46674, 712, 262, 978, 21407, 9865, 19, 919, 3668, 13538, 7077, 83658, 6495, 841, 78457, 58944, 3509, 294, 90, 6889, 3371, 27143, 9563, 28398, 7763, 108161, ...	[ 0.055328369140625, 0.1370849609375, 0.26904296875, 0.06695556640625, 0.2225341796875, 0.0265960693359375, 0.1832275390625, 0.12353515625, 0.172119140625, 0.124267578125, 0.2247314453125, 0.08575439453125, 0.10577392578125, 0.07403564453125, 0.0728759765625, 0.056243896484375, 0.13220...	embed
11003535_c0	11003535	haskell	0	Title: What is going on with the types in this ghci session? Problem title: What is going on with the types in this ghci session? Tags: ghci, haskell Problem: What is going on with the types in this ghci session? I'm learning Haskell, and I was playing around in ghci when I came across something very puzzling. First, c...	What is going on with the types in this ghci session? What is going on with the types in this ghci session? ghci haskell the What Prelude Fractional Integer Possible Num What is going on with the types in this ghci session? I'm learning Haskell, and I was playing around in ghci when I came across something very puzzlin...	[ 0.0135498046875, -0.0009307861328125, 0.0142822265625, 0.004241943359375, 0.0130615234375, 0.0137939453125, -0.014404296875, -0.0015411376953125, 0.0157470703125, -0.01202392578125, -0.00238037109375, -0.03125, -0.00958251953125, -0.017578125, 0.00153350830078125, -0.001678466796875, ...	[ 4865, 7730, 98, 678, 52895, 23, 903, 31380, 318, 56002, 1556, 142508, 1914, 822, 112, 7868, 10763, 44401, 115861, 2661, 52782, 52080, 20625, 75169, 36880, 4552, 2638, 13894, 2069, 28282, 10, 8781, 15190, 32354, 43240, 933, 21917, 9821, 5991...	[ 0.09454345703125, 0.0234527587890625, 0.03497314453125, 0.0640869140625, 0.25927734375, 0.056671142578125, 0.083740234375, 0.110595703125, 0.1671142578125, 0.175537109375, 0.0992431640625, 0.2193603515625, 0.08984375, 0.1563720703125, 0.07037353515625, 0.1168212890625, 0.043029785156...	embed
45773761_c0	45773761	haskell	0	Title: parList vs parTraversable Problem title: parList vs parTraversable Tags: haskell, parallel-processing Problem: parList vs parTraversable I found a "strange" behavior here. I got this: {-# LANGUAGE BangPatterns #-} import Data.List import Control.Parallel import Control.Parallel.Strategies fib 0 = 1 fib 1 = 1 fib...	parList vs parTraversable parList vs parTraversable haskell parallel-processing Data.List Control.Parallel Control.Parallel.Strategies LANGUAGE BangPatterns n-1 n-2 Strategy SPARKS Control Parallel Strategies.hs Traversable parlist2.hs parList2 RTS parList vs parTraversable I found a "strange" behavior here. I got this...	[ -0.0206298828125, 0.0277099609375, -0.01544189453125, -0.0174560546875, 0.0228271484375, -0.008056640625, 0.01068115234375, -0.00341796875, 0.0118408203125, -0.025390625, 0.01239013671875, 0.01171875, 0.027099609375, 0.01470947265625, 0.0091552734375, 0.01214599609375, 0.013488769531...	[ 366, 154663, 20209, 28542, 7864, 2886, 1556, 142508, 95103, 63923, 11809, 27131, 55292, 1229, 31828, 98064, 26387, 8335, 3055, 5759, 5428, 7832, 67, 60436, 20113, 211485, 141075, 127, 4937, 6562, 5442, 304, 27389, 294, 14037, 27254, 429, 1231...	[ 0.202392578125, 0.26220703125, 0.1103515625, 0.1048583984375, 0.1845703125, 0.1981201171875, 0.0806884765625, 0.1683349609375, 0.1734619140625, 0.05511474609375, 0.0226287841796875, 0.1802978515625, 0.06298828125, 0.0838623046875, 0.0943603515625, 0.0279541015625, 0.1029052734375, ...	embed
47529478_c0	47529478	haskell	0	Title: How does GHC know how to cache one function but not the others? Problem title: How does GHC know how to cache one function but not the others? Tags: benchmarking, haskell, memoization Problem: How does GHC know how to cache one function but not the others? I'm reading Learn You a Haskell (loving it so far) and i...	How does GHC know how to cache one function but not the others? How does GHC know how to cache one function but not the others? benchmarking haskell memoization qualified a How GHC Data.Set Set Data.List List LYAH elem1 Bool When elem2 Set.toList Set.fromList Then elem3 List.nub How does GHC know how to cache one funct...	[ 0.00836181640625, 0.001373291015625, 0.029052734375, -0.0194091796875, 0.004852294921875, 0.0162353515625, 0.00099945068359375, -0.000476837158203125, 0.00005507469177246094, 0.002044677734375, -0.0026092529296875, 0.0030517578125, 0.000377655029296875, -0.008056640625, 0.01446533203125,...	[ 11249, 527, 73265, 3714, 3642, 82365, 1632, 32354, 1284, 959, 27060, 240057, 1556, 142508, 163, 432, 47691, 217225, 11809, 294, 126, 19943, 154663, 32036, 339, 192583, 88, 195, 418, 2460, 929, 304, 363, 5829, 47, 16454, 134031, 20625, 7182,...	[ 0.030303955078125, 0.0972900390625, 0.2281494140625, 0.1298828125, 0.0684814453125, 0.244140625, 0.09130859375, 0.1988525390625, 0.07244873046875, 0.0804443359375, 0.08489990234375, 0.185791015625, 0.0953369140625, 0.2344970703125, 0.0999755859375, 0.1217041015625, 0.10540771484375, ...	embed
58793029_c0	58793029	haskell	0	Title: Minesweeper board labels (beginner level) Problem title: Minesweeper board labels (beginner level) Tags: minesweeper, list, haskell Problem: Minesweeper board labels (beginner level) We were given a homework, where we get a sample minesweeper-like board, with blank spaces instead of numbers (board is in [String]...	Minesweeper board labels (beginner level) Minesweeper board labels (beginner level) minesweeper list haskell Data.Char Minesweeper Result Prelude Minesweeper board labels (beginner level) We were given a homework, where we get a sample minesweeper-like board, with blank spaces instead of numbers (board is in [String] f...	[ -0.00421142578125, -0.00909423828125, -0.005706787109375, 0.019775390625, 0.006805419921875, -0.00396728515625, 0.0189208984375, -0.00604248046875, 0.00299072265625, 0.008544921875, -0.005828857421875, -0.0194091796875, 0.0225830078125, 0.0145263671875, -0.0157470703125, -0.01300048828...	[ 56713, 7, 1177, 13, 1264, 45443, 67967, 82089, 17366, 56, 5665, 5303, 1556, 142508, 11809, 84068, 126684, 1914, 822, 34475, 5368, 18244, 121413, 5062, 44237, 32628, 64457, 101935, 24351, 71713, 3173, 21771, 158012, 3871, 28282, 32354, 91995, ...	[ 0.1536865234375, 0.037322998046875, 0.139892578125, 0.09600830078125, 0.1513671875, 0.1883544921875, 0.2310791015625, 0.07708740234375, 0.140380859375, 0.0191497802734375, 0.207763671875, 0.10186767578125, 0.06591796875, 0.1741943359375, 0.0582275390625, 0.1298828125, 0.1075439453125...	embed
37318611_c0	37318611	haskell	0	Title: Reader-Writer Lock in Haskell Problem title: Reader-Writer Lock in Haskell Tags: haskell, concurrency, readerwriterlock, locking Problem: Reader-Writer Lock in Haskell I am implementing a web-app that holds some data in memory. Some requests read this data for processing and some requests update this data. In th...	Reader-Writer Lock in Haskell Reader-Writer Lock in Haskell haskell concurrency readerwriterlock locking Reader-Writer Lock Haskell MVar Reader-Writer Lock in Haskell I am implementing a web-app that holds some data in memory. Some requests read this data for processing and some requests update this data. In this scena...	[ -0.00537109375, 0.0234375, -0.00860595703125, -0.0252685546875, -0.0002613067626953125, -0.0211181640625, 0.0025787353515625, 0.01422119140625, 0.0023040771484375, -0.0032806396484375, -0.0135498046875, -0.00102996826171875, 0.01287841796875, 0.0033416748046875, 0.013916015625, 0.01031...	[ 122636, 9, 1456, 2783, 56, 80002, 20625, 142508, 23, 1556, 108636, 982, 155255, 70035, 21135, 56776, 66160, 147, 29479, 1467, 9007, 16401, 2053, 98323, 50336, 12301, 28350, 106117, 48716, 120709, 831, 133244, 160404, 27117, 97629, 17203, 3444, ...	[ 0.28759765625, 0.0572509765625, 0.137939453125, 0.206298828125, 0.09814453125, 0.238525390625, 0.1607666015625, 0.2310791015625, 0.01434326171875, 0.1240234375, 0.1700439453125, 0.1485595703125, 0.288818359375, 0.279052734375, 0.2191162109375, 0.23876953125, 0.0142974853515625, 0.1...	embed
70567840_c0	70567840	haskell	0	Title: How to disable certificate validation in stack? Problem title: How to disable certificate validation in stack? Tags: haskell-stack, haskell Problem: How to disable certificate validation in stack? I am trying to set up CI on GitLab. It's only meant to verify the project can build, run and tests are passing. No a...	How to disable certificate validation in stack? How to disable certificate validation in stack? haskell-stack haskell InternalException How Cabal regex-posix-0.96.0.0 sha256:bd870f983a21bb474bd96449736f011c599981ce70da808a21ec1a28292e5481 Selected hackage.haskell.org Downloading HttpExceptionRequest Request Accept-Enco...	[ -0.00433349609375, 0.00555419921875, 0.0181884765625, -0.00872802734375, 0.00146484375, -0.01019287109375, -0.009521484375, -0.014404296875, 0.0059814453125, 0.0177001953125, 0.01513671875, -0.001678466796875, 0.0242919921875, 0.00775146484375, -0.0159912109375, -0.005126953125, 0.00...	[ 11249, 47, 2837, 2886, 163769, 44622, 1363, 23, 177261, 1556, 142508, 590, 2594, 106745, 19279, 63928, 30438, 289, 6835, 3355, 67890, 425, 23320, 11648, 99929, 9638, 127892, 132067, 16665, 172725, 136485, 65040, 174859, 51620, 85526, 4588, 1055...	[ 0.093017578125, 0.030303955078125, 0.137939453125, 0.2147216796875, 0.250244140625, 0.2587890625, 0.06683349609375, 0.0750732421875, 0.23828125, 0.10498046875, 0.2320556640625, 0.1033935546875, 0.0985107421875, 0.10357666015625, 0.00885009765625, 0.1168212890625, 0.1361083984375, 0...	embed
44851035_c0	44851035	haskell	0	Title: Type parameter in context which cause some ambiguity Problem title: Type parameter in context which cause some ambiguity Tags: haskell Problem: Type parameter in context which cause some ambiguity I have the following error for the cadr1 below, which makes sense Could not deduce (BoolEq n ('Succ ('Succ n'0)) ~ '...	Type parameter in context which cause some ambiguity Type parameter in context which cause some ambiguity haskell Type cadr1 LANGUAGE DataKinds GADTs KindSignatures RankNTypes TypeFamilies DecidablePropositionalEquality Nat Zero Succ Vec VNil VCons Greater Bool Type parameter in context which cause some ambiguity I hav...	[ 0.00262451171875, 0.0191650390625, -0.006439208984375, 0.0130615234375, 0.00640869140625, -0.0274658203125, -0.0027313232421875, 0.01312255859375, -0.018798828125, -0.0218505859375, -0.00054931640625, -0.0189208984375, 0.004302978515625, -0.00982666015625, 0.0023040771484375, 0.0032806...	[ 60457, 171859, 43701, 22304, 920, 12282, 3129, 3060, 1556, 142508, 19630, 42, 418, 98064, 11809, 7250, 23749, 41072, 27435, 218723, 134405, 196707, 1191, 49132, 40322, 161789, 68875, 83947, 1832, 10060, 52884, 379, 310, 11935, 2460, 929, 2481, ...	[ 0.222900390625, 0.19775390625, 0.19677734375, 0.10107421875, 0.1287841796875, 0.1802978515625, 0.0273895263671875, 0.0130615234375, 0.103759765625, 0.20947265625, 0.0960693359375, 0.09814453125, 0.0254974365234375, 0.055938720703125, 0.012725830078125, 0.09173583984375, 0.02735900878...	embed
49386033_c0	49386033	haskell	0	Title: Haskell: Name multiple arguments in a nice way Problem title: Haskell: Name multiple arguments in a nice way Tags: haskell Problem: Haskell: Name multiple arguments in a nice way I am working on a virtual stack machine for my school project. Everything works fine, but this is what I have as the control function ...	Haskell: Name multiple arguments in a nice way Haskell: Name multiple arguments in a nice way haskell Haskell Name Program SubprogramDir Memory ComputerStack Input Output EOP Marks Then Stack.push Left Right Haskell: Name multiple arguments in a nice way I am working on a virtual stack machine for my school project. Ev...	[ -0.01080322265625, -0.0152587890625, 0.0113525390625, 0.0299072265625, 0.003814697265625, 0.03125, -0.025146484375, -0.020263671875, 0.00341796875, -0.0234375, -0.00037384033203125, 0.0238037109375, -0.006317138671875, 0.007080078125, -0.0157470703125, 0.005859375, 0.01904296875, -...	[ 20625, 142508, 15757, 48716, 10750, 7, 26267, 3917, 1556, 7663, 8273, 18749, 397, 481, 172681, 40139, 42378, 2594, 360, 13538, 241, 20880, 7880, 6512, 7332, 127, 2480, 90911, 20697, 20513, 177261, 36279, 10696, 13452, 171581, 43240, 5885, 765...	[ 0.14013671875, 0.245849609375, 0.22314453125, 0.2379150390625, 0.261474609375, 0.0501708984375, 0.147216796875, 0.085205078125, 0.139892578125, 0.17431640625, 0.1571044921875, 0.1854248046875, 0.04718017578125, 0.1474609375, 0.146484375, 0.0216064453125, 0.10223388671875, 0.1187744...	embed
6797902_c0	6797902	haskell	0	Title: Haskell source encoding Problem title: Haskell source encoding Tags: haskell, encoding Problem: Haskell source encoding The Haskell 2010 Language Report says: Haskell uses the Unicode [2] character set. However, source programs are currently biased toward the ASCII character set used in earlier versions of Haske...	Haskell source encoding Haskell source encoding haskell encoding Haskell x05 Trick Alex Unicode See white_no_nl x03 ToDo x04 x01 A-Z x02 x06 Haskell source encoding The Haskell 2010 Language Report says: Does this mean UTF-8? In ghc-7.0.4/compiler/parser/Lexer.x.source: ...I'm not sure what to make of this. alexGetChar...	[ 0.00408935546875, 0.00537109375, 0.018310546875, -0.0052490234375, -0.01544189453125, 0.0186767578125, 0.0011749267578125, 0.0157470703125, -0.0074462890625, 0.021728515625, 0.00103759765625, -0.030029296875, 0.00823974609375, -0.01385498046875, -0.005950927734375, 0.015625, 0.009521...	[ 20625, 142508, 31344, 22, 587, 6238, 1556, 8194, 141362, 20984, 219778, 6872, 35011, 157, 13169, 9513, 717, 8331, 7709, 6746, 62, 1511, 9550, 9016, 1532, 83658, 34798, 903, 29459, 345, 30992, 17376, 31380, 238, 129884, 77212, 58875, 2500, 5...	[ 0.1512451171875, 0.2626953125, 0.224365234375, 0.07806396484375, 0.208984375, 0.040069580078125, 0.1383056640625, 0.1800537109375, 0.1798095703125, 0.1624755859375, 0.21435546875, 0.0229949951171875, 0.1689453125, 0.1409912109375, 0.1253662109375, 0.085693359375, 0.10577392578125, ...	embed
59909561_c0	59909561	haskell	0	Title: HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none Problem title: HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none Tags: haskell, type-mismatch, lambda, arguments, types Problem: HASKELL The lambda expression ‘\ xs -> ...’ has ...	HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none haskell type-mismatch lambda arguments types HASKELL x:xs y:ys Bool Couldn HASKELL The lambda expression ‘\ xs -> ...’ has one argumen...	[ 0.01129150390625, 0.034912109375, 0.00091552734375, -0.0179443359375, 0.0126953125, -0.006011962890625, 0.00628662109375, 0.0211181640625, 0.0103759765625, 0.010986328125, 0.001983642578125, -0.033935546875, 0.0172119140625, -0.00653076171875, -0.007080078125, 0.000021219253540039062, ...	[ 11666, 10762, 56051, 21, 6492, 85, 125195, 41872, 1022, 7, 20, 1230, 5386, 153, 1556, 1632, 10750, 1284, 10644, 18, 351, 13, 142508, 2179, 98753, 52895, 425, 113, 4778, 2460, 929, 191147, 33079, 33022, 32354, 20625, 11343, 45831, 18499, 4...	[ 0.1102294921875, 0.1248779296875, 0.1546630859375, 0.0797119140625, 0.1966552734375, 0.157470703125, 0.19677734375, 0.044647216796875, 0.126220703125, 0.129150390625, 0.067626953125, 0.06707763671875, 0.1458740234375, 0.07525634765625, 0.124755859375, 0.0938720703125, 0.2113037109375...	embed
16426463_c0	16426463	haskell	0	Title: What constitutes a fold for types other than list? Problem title: What constitutes a fold for types other than list? Tags: terminology, haskell, functional-programming, fold Problem: What constitutes a fold for types other than list? Consider a single-linked list. It looks something like data List x = Node x (Li...	What constitutes a fold for types other than list? What constitutes a fold for types other than list? terminology haskell functional-programming fold What List Node End Tree Leaf Branch What constitutes a fold for types other than list? Consider a single-linked list. It looks something like It is natural to define a fo...	[ -0.00170135498046875, -0.0019378662109375, 0.006256103515625, 0.00555419921875, -0.00445556640625, -0.00390625, -0.03271484375, -0.00469970703125, 0.00506591796875, -0.0223388671875, -0.004058837890625, -0.047119140625, -0.00555419921875, 0.0108642578125, -0.006622314453125, -0.0039978...	[ 11764, 10, 42822, 100, 52895, 3789, 3501, 5303, 1556, 142508, 123309, 28966, 32036, 438, 112, 18878, 101344, 2407, 21110, 206, 1636, 11001, 10187, 33342, 6083, 61924, 18344, 6238, 32354, 34390, 1238, 1022, 2389, 91995, 11907, 678, 1914, 822, ...	[ 0.1868896484375, 0.04608154296875, 0.2998046875, 0.03851318359375, 0.205078125, 0.116943359375, 0.110107421875, 0.1571044921875, 0.07147216796875, 0.1888427734375, 0.1112060546875, 0.0831298828125, 0.107421875, 0.10491943359375, 0.12060546875, 0.11865234375, 0.0936279296875, 0.0447...	embed
54149543_c0	54149543	haskell	0	Title: Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") Problem title: Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") Tags: haskell Problem: Installation of Haskell package hs_gchart fails ("Non type-va...	Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") haskell Installation Haskell hs_gchart Non MonadState Chart Use FlexibleContexts XFlexibleContexts Compili...	[ -0.0157470703125, 0.004425048828125, 0.02294921875, -0.00244140625, 0.01165771484375, -0.0137939453125, -0.0198974609375, -0.017822265625, -0.00909423828125, 0.02001953125, 0.005035400390625, -0.05517578125, 0.0029144287109375, -0.0029296875, -0.0098876953125, 0.0155029296875, -0.005...	[ 145323, 20625, 142508, 98169, 1096, 7, 177, 9254, 18, 35782, 59881, 10644, 21690, 2886, 10750, 23, 158, 2816, 4288, 1556, 3775, 60331, 135206, 110373, 180842, 2661, 22829, 1193, 919, 74070, 28236, 189682, 87590, 84068, 2982, 51193, 127, 63473...	[ 0.1309814453125, 0.1153564453125, 0.2198486328125, 0.145751953125, 0.06005859375, 0.0679931640625, 0.029052734375, 0.17138671875, 0.0986328125, 0.1436767578125, 0.1270751953125, 0.1834716796875, 0.126953125, 0.0753173828125, 0.175537109375, 0.072509765625, 0.056396484375, 0.1508789...	embed
28427524_c0	28427524	haskell	0	Title: How to process / summarise a list into a "different" list Problem title: How to process / summarise a list into a "different" list Tags: fold, haskell Problem: How to process / summarise a list into a "different" list I think I need something like a fold or maybe a foldt but the examples I've...	How to process / summarise a list into a "different" list How to process / summarise a list into a "different" list fold haskell How order1 item1 item2 item3 order2 item4 Order Text OrderItem OrderTuple x:xs y:ys Bool How to process / summarise a list into a "different" list I think I need something...	[ 0.0023345947265625, -0.0096435546875, 0.0031280517578125, 0.00750732421875, 0.0023345947265625, 0.019287109375, -0.004058837890625, -0.010009765625, 0.0205078125, 0.024658203125, -0.001739501953125, 0.00994873046875, -0.002716064453125, 0.000492095947265625, -0.017333984375, 0.00543212...	[ 11249, 47, 9433, 248, 29334, 58944, 5303, 3934, 10, 238778, 42822, 1556, 142508, 12989, 418, 35735, 304, 363, 617, 81206, 24129, 2982, 15665, 8705, 1022, 425, 113, 4778, 2460, 929, 3871, 1884, 18, 27781, 375, 11856, 8781, 146232, 42, 3429...	[ 0.076904296875, 0.0386962890625, 0.1876220703125, 0.0894775390625, 0.2047119140625, 0.1787109375, 0.23876953125, 0.1583251953125, 0.06158447265625, 0.27197265625, 0.185791015625, 0.1217041015625, 0.213623046875, 0.2164306640625, 0.048553466796875, 0.124755859375, 0.037322998046875, ...	embed
43244755_c0	43244755	haskell	0	Title: Reflexive Closure Problem title: Reflexive Closure Tags: math, haskell Problem: Reflexive Closure I have been working on a question about reflexive closure: The reflexive closure of a relation R is the smallest relation bigger than R which is reflexive. In other words, it is R with whatever pairs added to make R...	Reflexive Closure Reflexive Closure math haskell Reflexive Closure QUESTION Functions x:xs Bool TEST SET Your NOT WORRY ABOUT ORDER WHICH PAIRS APPEAR LIST Reflexive Closure I have been working on a question about reflexive closure: I came up with this solution but it seems quite sloppy and lack neatness. Is there an e...	[ -0.01177978515625, 0.01483154296875, 0.0242919921875, -0.003143310546875, 0.00885009765625, -0.0087890625, -0.00970458984375, 0.00012874603271484375, 0.01611328125, 0.0033721923828125, 0.007537841796875, 0.01708984375, 0.01123046875, 0.01043701171875, 0.0072021484375, 0.008544921875, ...	[ 179043, 5844, 51053, 56851, 48909, 1556, 142508, 21389, 294, 28670, 10763, 1022, 12, 425, 2460, 929, 384, 21828, 128565, 14804, 86725, 601, 24638, 34388, 52001, 33172, 18044, 436, 126546, 66440, 127427, 195977, 20697, 9655, 71181, 170224, 1257,...	[ 0.2275390625, 0.1851806640625, 0.188232421875, 0.13623046875, 0.15234375, 0.1024169921875, 0.2015380859375, 0.04547119140625, 0.0399169921875, 0.08380126953125, 0.037811279296875, 0.029876708984375, 0.0171661376953125, 0.0556640625, 0.087646484375, 0.1912841796875, 0.1339111328125, ...	embed
43716497_c0	43716497	haskell	0	Title: Scotty web service Problem title: Scotty web service Tags: web, service, haskell, scotty, frameworks Problem: Scotty web service I need to create a web service to convert between different currencies using the scotty web framework in Haskell. The web service should respond to get requests such as /convert/15?to=...	Scotty web service Scotty web service web service haskell scotty frameworks Web.Scotty Data.Monoid Data.Text.Lazy Scotty LANGUAGE OverloadedStrings Text Double Scotty web service I need to create a web service to convert between different currencies using the scotty web framework in Haskell. The web service should resp...	[ 0.00032806396484375, 0.0174560546875, 0.0002498626708984375, -0.003997802734375, -0.0181884765625, 0.0166015625, -0.002716064453125, 0.00787353515625, -0.00020694732666015625, -0.0269775390625, 0.005615234375, -0.0203857421875, -0.01544189453125, -0.0036468505859375, 0.01513671875, 0.0...	[ 50695, 53, 1467, 4516, 1556, 142508, 14753, 15145, 170846, 4002, 587, 11809, 46674, 48899, 174379, 2729, 3285, 3358, 98064, 9578, 63033, 71713, 24129, 107172, 87, 3871, 28282, 96760, 17721, 12921, 9709, 107, 117538, 17368, 23, 20625, 35644, 2...	[ 0.2374267578125, 0.22998046875, 0.1328125, 0.144775390625, 0.102783203125, 0.2646484375, 0.1551513671875, 0.2100830078125, 0.18212890625, 0.0399169921875, 0.1407470703125, 0.061279296875, 0.05059814453125, 0.1263427734375, 0.05908203125, 0.08599853515625, 0.102294921875, 0.00411987...	embed
48992971_c0	48992971	haskell	0	Title: Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' Problem title: Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' Tags: haskell, yesod Problem: Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' I Scaffolded my site in Stac...	Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' haskell yesod Yesod Couldn WidgetT site0 HandlerT App Compiling Handler.Vendita Handler Vendita.hs x86_64-freebsd Cabal-2.0.1.0 Vendita.o Lavori Vendi...	[ -0.00836181640625, 0.011962890625, 0.005645751953125, 0.010498046875, -0.01409912109375, -0.01141357421875, -0.0277099609375, -0.026123046875, 0.00011777877807617188, -0.0478515625, 0.004302978515625, -0.03759765625, 0.00360107421875, -0.01385498046875, 0.0031585693359375, -0.004028320...	[ 32635, 2199, 191147, 3768, 18, 14858, 10644, 1456, 532, 3794, 618, 1764, 2389, 678, 135679, 603, 5659, 17780, 1556, 142508, 2422, 23722, 58302, 10639, 15612, 49725, 85512, 53298, 154967, 102, 15276, 13307, 32087, 16145, 30438, 289, 73011, 102...	[ 0.197265625, 0.265625, 0.09832763671875, 0.072509765625, 0.06121826171875, 0.203369140625, 0.1851806640625, 0.0263824462890625, 0.095947265625, 0.132080078125, 0.1827392578125, 0.120849609375, 0.1231689453125, 0.053253173828125, 0.1602783203125, 0.200927734375, 0.1739501953125, 0.1...	embed
70180423_c0	70180423	haskell	0	Title: Deriving Show when a type family is present (without writing manual constraints) Problem title: Deriving Show when a type family is present (without writing manual constraints) Tags: haskell Problem: Deriving Show when a type family is present (without writing manual constraints) I want to create an ADT that is ...	Deriving Show when a type family is present (without writing manual constraints) Deriving Show when a type family is present (without writing manual constraints) haskell Data.Kind Prelude Deriving Show LANGUAGE StandaloneDeriving KindSignatures TypeFamilies Test Switchable Type TextName Same Foo Deriving Show when a ty...	[ 0.00653076171875, -0.007415771484375, -0.004974365234375, 0.0026397705078125, -0.01019287109375, -0.0172119140625, 0.0006103515625, 0.003692626953125, 0.00128173828125, -0.0037078857421875, -0.0220947265625, 0.00074005126953125, 0.005645751953125, 0.021484375, -0.0185546875, -0.0147705...	[ 1310, 14, 6496, 17367, 3229, 10644, 14449, 13379, 6056, 32562, 23009, 2816, 4288, 1556, 142508, 11809, 7250, 1914, 822, 98064, 32487, 51684, 47731, 27435, 218723, 60457, 1191, 8647, 106101, 24129, 163612, 99908, 9572, 31, 3444, 28282, 62, 410...	[ 0.1328125, 0.0927734375, 0.128173828125, 0.256591796875, 0.079833984375, 0.2066650390625, 0.1385498046875, 0.1407470703125, 0.0294189453125, 0.0814208984375, 0.1239013671875, 0.154541015625, 0.10638427734375, 0.0714111328125, 0.2027587890625, 0.0750732421875, 0.093994140625, 0.0382...	embed
12941625_c0	12941625	haskell	0	Title: IDs from State Monad in Haskell Problem title: IDs from State Monad in Haskell Tags: monads, uniqueidentifier, haskell, state-monad Problem: IDs from State Monad in Haskell Possible Duplicate: Creating unique labels in Haskell I've got a datatype Person and some input data from which I will create the Persons. I...	IDs from State Monad in Haskell IDs from State Monad in Haskell monads uniqueidentifier haskell state-monad State Control.Monad.State IDs Monad Haskell Person Show MyState Adam Barney Charlie IDs from State Monad in Haskell I've got a datatype Person and some input data from which I will create the Persons. I'd like to...	[ -0.0216064453125, -0.003204345703125, 0.01177978515625, -0.00433349609375, -0.00138092041015625, 0.015869140625, 0.005126953125, 0.0047607421875, -0.005035400390625, -0.0693359375, -0.00299072265625, 0.0167236328125, -0.006927490234375, 0.017333984375, 0.00457763671875, -0.019653320312...	[ 11338, 1295, 22836, 60331, 71, 23, 20625, 142508, 2667, 712, 36998, 42485, 56, 1556, 11341, 3796, 27131, 46674, 135206, 15270, 17367, 2646, 13, 16173, 71876, 53, 71305, 4163, 2053, 50986, 107730, 1221, 28282, 70, 1884, 765, 12638, 6863, 100...	[ 0.2320556640625, 0.09979248046875, 0.216796875, 0.2205810546875, 0.189453125, 0.04144287109375, 0.1492919921875, 0.25927734375, 0.1617431640625, 0.2198486328125, 0.1800537109375, 0.199462890625, 0.0143280029296875, 0.12158203125, 0.154052734375, 0.122802734375, 0.148193359375, 0.10...	embed
43163491_c0	43163491	haskell	0	Title: Could not load exported module using stack Problem title: Could not load exported module using stack Tags: haskell, haskell-stack, module Problem: Could not load exported module using stack I get an error when getting a Shape module within the same directory as the Main module inside the Main module when I do st...	Could not load exported module using stack Could not load exported module using stack haskell haskell-stack module stack -optP/tmp/vamsi/ghci11211/cabal_macros.h System.IO Data.Time Data.Aeson Shapes Could Shape Main Main.hs:5:1 Failed Use Run x86_64-linux Cabal-1.24.2.0 base-4.9.1.0 time-1.6.0.1 aeson-1.0.2.1-CYngHPh1...	[ 0.004791259765625, 0.012939453125, -0.0157470703125, 0.01275634765625, -0.008056640625, 0.0087890625, -0.002410888671875, -0.00543212890625, -0.01275634765625, -0.024169921875, 0.0021514892578125, -0.01129150390625, 0.0184326171875, -0.01043701171875, 0.017333984375, 0.0184326171875, ...	[ 191147, 959, 72367, 31255, 297, 88996, 17368, 177261, 1556, 142508, 590, 2594, 2146, 683, 2676, 12648, 172, 9486, 318, 88438, 1662, 408, 3571, 3666, 127, 12353, 17780, 70059, 90, 191, 7224, 13569, 1081, 12321, 758, 19721, 190355, 36836, 283...	[ 0.060638427734375, 0.1033935546875, 0.2008056640625, 0.2264404296875, 0.03955078125, 0.2315673828125, 0.05328369140625, 0.23681640625, 0.09539794921875, 0.20458984375, 0.121337890625, 0.140380859375, 0.00152587890625, 0.008819580078125, 0.0572509765625, 0.113525390625, 0.08837890625,...	embed
47359416_c0	47359416	haskell	0	Title: Extracting values from Haskell type synonyms Problem title: Extracting values from Haskell type synonyms Tags: haskell Problem: Extracting values from Haskell type synonyms I'm writing a Dominoes game for class and can't wrap my head around custom types. I have: type DomsPlayer = Hand -> Board -> (Domino,End) .....	Extracting values from Haskell type synonyms Extracting values from Haskell type synonyms haskell Haskell Extracting DomsPlayer Hand Board Domino End hand1 board1 hand2 board2 Extracting values from Haskell type synonyms I'm writing a Dominoes game for class and can't wrap my head around custom types. I have: Trying to...	[ -0.0054931640625, 0.001617431640625, 0.000339508056640625, 0.009765625, -0.009033203125, 0.01251220703125, -0.01068115234375, -0.0001392364501953125, 0.005828857421875, -0.02685546875, -0.012939453125, -0.002288818359375, -0.0069580078125, -0.01507568359375, -0.0159912109375, -0.004364...	[ 31501, 238, 142424, 1295, 20625, 142508, 10644, 164661, 1916, 1556, 9343, 7, 142581, 10639, 62554, 62687, 18878, 3535, 418, 45443, 304, 32562, 90, 6712, 18507, 137565, 10336, 114122, 52895, 40858, 72367, 18499, 3996, 3134 ]	[ 0.1451416015625, 0.029083251953125, 0.1868896484375, 0.045013427734375, 0.1031494140625, 0.217529296875, 0.15185546875, 0.203125, 0.000579833984375, 0.0809326171875, 0.1634521484375, 0.0892333984375, 0.234375, 0.0823974609375, 0.1290283203125, 0.21533203125, 0.08209228515625, 0.104...	embed
67733939_c0	67733939	haskell	0	Title: Haskell: accumulator with length, summation, summation of square of a list Problem title: Haskell: accumulator with length, summation, summation of square of a list Tags: accumulator, haskell Problem: Haskell: accumulator with length, summation, summation of square of a list I am new to Haskell and am trying to ...	Haskell: accumulator with length, summation, summation of square of a list Haskell: accumulator with length, summation, summation of square of a list accumulator haskell Haskell stats1 x:xs stats2 Couldn Integer Haskell: accumulator with length, summation, summation of square of a list I am new to Haskell and am trying...	[ -0.0035247802734375, 0.0185546875, 0.006500244140625, 0.017333984375, -0.021240234375, 0.0157470703125, -0.005584716796875, 0.00732421875, 0.00579833984375, -0.01318359375, 0.01483154296875, -0.0118408203125, 0.027099609375, -0.0062255859375, 0, -0.008544921875, -0.0052490234375, -...	[ 20625, 142508, 183278, 1290, 678, 140909, 29334, 1363, 108047, 111, 5303, 1556, 63841, 418, 1022, 425, 7, 304, 191147, 44401, 3525, 29479, 32354, 26785, 4527, 17368, 101935, 30646, 162738, 4153, 18, 360, 10554, 88303, 73, 3917, 18499, 26008, ...	[ 0.15576171875, 0.250244140625, 0.27392578125, 0.22021484375, 0.1043701171875, 0.2186279296875, 0.20458984375, 0.004638671875, 0.196533203125, 0.109619140625, 0.2164306640625, 0.1292724609375, 0.181884765625, 0.08648681640625, 0.04119873046875, 0.05987548828125, 0.00604248046875, 0....	embed
48791549_c0	48791549	haskell	0	Title: Is there any practical difference between these two definitions of type-level Peano Natural number summation? Problem title: Is there any practical difference between these two definitions of type-level Peano Natural number summation? Tags: typechecking, dependent-type, haskell, types Problem: Is there any pract...	Is there any practical difference between these two definitions of type-level Peano Natural number summation? Is there any practical difference between these two definitions of type-level Peano Natural number summation? typechecking dependent-type haskell types Peano Natural Nat Zero Succ UndecidableInstances Typecheck...	[ -0.01080322265625, 0.01470947265625, 0.0059814453125, 0.0201416015625, 0.00133514404296875, -0.005401611328125, 0.007293701171875, 0.004150390625, 0.0206298828125, -0.00677490234375, 0.01055908203125, -0.021728515625, 0.007171630859375, 0.017333984375, 0.0255126953125, 0.0013427734375,...	[ 2499, 138155, 60212, 17721, 6097, 6626, 80934, 10644, 67919, 1460, 3922, 24955, 14012, 29334, 1363, 78292, 108750, 50986, 1556, 142508, 52895, 68875, 83947, 1832, 10060, 79912, 24750, 2661, 116071, 60457, 3525, 17366, 56037, 7808, 41159, 31635, ...	[ 0.040771484375, 0.2293701171875, 0.2098388671875, 0.1072998046875, 0.050689697265625, 0.103515625, 0.182373046875, 0.1881103515625, 0.1697998046875, 0.1484375, 0.2296142578125, 0.1915283203125, 0.181640625, 0.2015380859375, 0.06109619140625, 0.260009765625, 0.1544189453125, 0.14245...	embed
49699485_c0	49699485	haskell	0	Title: simple function that shifts specific element of a list Problem title: simple function that shifts specific element of a list Tags: list, haskell Problem: simple function that shifts specific element of a list I am new to Haskell and I am trying to figure out how to make a function: shift:: Eq a => a -> [a] -> In...	simple function that shifts specific element of a list simple function that shifts specific element of a list list haskell h:t Main factor.bit fact.orbit simple function that shifts specific element of a list I am new to Haskell and I am trying to figure out how to make a function: Keep in mind that i have completed my...	[ -0.01513671875, 0.027587890625, -0.00531005859375, -0.0038299560546875, -0.006072998046875, -0.015380859375, -0.00118255615234375, -0.005401611328125, 0.00982666015625, 0.01904296875, 0.0211181640625, -0.0172119140625, 0.005615234375, -0.003448486328125, -0.00396728515625, 0.0152587890...	[ 8781, 32354, 450, 122925, 7, 29458, 12830, 111, 5303, 1556, 142508, 1096, 12, 18, 12321, 31461, 3137, 15824, 748, 3525, 20625, 31577, 26366, 3249, 83041, 7086, 140528, 154109, 7413, 5117, 170894, 104851, 8, 74635, 5809, 4527, 46132, 57767, ...	[ 0.1885986328125, 0.2349853515625, 0.0589599609375, 0.259765625, 0.1011962890625, 0.2325439453125, 0.1824951171875, 0.0268402099609375, 0.1934814453125, 0.11962890625, 0.2142333984375, 0.074951171875, 0.0255279541015625, 0.099365234375, 0.04791259765625, 0.169677734375, 0.171875, 0....	embed
27115894_c1	27115894	haskell	1	) . group . sort . words . Prelude.map toLower combineWordCountMaps :: Map.Map String Int -> Map.Map String Int -> Map.Map String Int combineWordCountMaps map1 map2 = Map.unionWith (+) map1 map2 reduceWordCountMaps :: [Map.Map String Int] -> Map.Map String Int reduceWordCountMaps (x:[]) = x reduceWordCountMaps (x:xs) =...	) . group . sort . words . Prelude.map toLower combineWordCountMaps :: Map.Map String Int -> Map.Map String Int -> Map.Map String Int combineWordCountMaps map1 map2 = Map.unionWith (+) map1 map2 reduceWordCountMaps :: [Map.Map String Int] -> Map.Map String Int reduceWordCountMaps (x:[]) = x reduceWordCountMaps (x:xs) =...	[ -0.005462646484375, 0.00860595703125, -0.0213623046875, 0.001983642578125, -0.0072021484375, 0.0047607421875, 0.006072998046875, -0.014892578125, 0.019287109375, -0.0101318359375, -0.01275634765625, 0.01611328125, 0.0272216796875, 0.00848388671875, -0.01239013671875, -0.00439453125, ...	[ 21115, 12096, 34153, 1914, 822, 112, 62346, 47, 15363, 6488, 70163, 164805, 108210, 166179, 42719, 23351, 360, 22288, 304, 87046, 194583, 22183, 34390, 1022, 107, 106357, 5201, 54, 29822, 2046, 7614, 9405, 11435, 19279, 64370, 14602, 174350, ...	[ 0.16943359375, 0.17578125, 0.1749267578125, 0.0814208984375, 0.1600341796875, 0.093994140625, 0.160888671875, 0.114990234375, 0.1368408203125, 0.190673828125, 0.1619873046875, 0.1434326171875, 0.1573486328125, 0.1571044921875, 0.1468505859375, 0.1092529296875, 0.045196533203125, 0....	embed
7140617_c0	7140617	haskell	0	Title: GHC linking problem Problem title: GHC linking problem Tags: haskell, compiler-errors, ghc Problem: GHC linking problem I'm trying to compile the following code. import Data.List import Data.Ord import qualified Data.MemoCombinators as Memo collatzLength :: Int -> Int collatzLength = Memo.arrayRange (1, 1000000)...	GHC linking problem GHC linking problem haskell compiler-errors ghc Data.List Data.Ord qualified GHC Data.MemoCombinators Memo Memo.arrayRange euler14.o s1pw_info __stginit_datazmmemocombinatorszm0zi4zi1_DataziMemoCombinators_ rfX_info datazmmemocombinatorszm0zi4zi1_DataziMemoCombinators_arrayRange_info rfX_srt datazmm...	[ 0.0003337860107421875, 0.00836181640625, 0.003204345703125, -0.0030517578125, -0.00154876708984375, 0.021728515625, -0.01092529296875, 0.01177978515625, -0.006988525390625, -0.023193359375, -0.01556396484375, -0.0257568359375, 0.0159912109375, -0.004486083984375, 0.016845703125, -0.005...	[ 527, 73265, 3126, 214, 2967, 1556, 142508, 9969, 34759, 188800, 31380, 238, 11809, 154663, 143045, 217225, 6696, 432, 10770, 19155, 22230, 17443, 31, 19305, 1052, 51459, 1175, 603, 2592, 434, 7319, 39402, 18, 10135, 277, 1290, 708, 137989, ...	[ 0.1282958984375, 0.2373046875, 0.188232421875, 0.047576904296875, 0.1658935546875, 0.1297607421875, 0.258544921875, 0.1527099609375, 0.1541748046875, 0.19873046875, 0.1326904296875, 0.1112060546875, 0.0980224609375, 0.096923828125, 0.1240234375, 0.1572265625, 0.05242919921875, 0.06...	embed
18518828_c0	18518828	haskell	0	Title: Haskell Deriving Show Instance Problem title: Haskell Deriving Show Instance Tags: haskell, deriving, show Problem: Haskell Deriving Show Instance I am playing with a Red-Black tree: -- Taken from Okasaki 1999 module RedBlackTree where --node coloring data --a node is R (red) or B (black) data Color = R \| B --tr...	Haskell Deriving Show Instance Haskell Deriving Show Instance haskell deriving show Okasaki a Haskell Deriving Show Instance Taken RedBlackTree Color RBT Set Sees Ord Bool Insert BST RedBlackTree.insert RedBlackTree.T Char Possible GHCi red-black-tree.hs:54:11 Not red-black-tree.hs:54:15 red-black-tree.hs:54:28 Failed ...	[ 0.0162353515625, 0.00104522705078125, 0.0027313232421875, -0.0174560546875, 0.0216064453125, 0.013916015625, -0.0027618408203125, -0.0030364990234375, 0.01153564453125, 0.037841796875, -0.007354736328125, -0.0233154296875, 0.036376953125, -0.000377655029296875, -0.003936767578125, 0.00...	[ 20625, 142508, 1310, 14, 6496, 17367, 360, 116071, 1556, 16406, 7639, 180, 64036, 301, 2561, 6096, 97732, 62731, 51193, 52681, 19943, 6872, 35379, 2460, 929, 33657, 8545, 13, 618, 21656, 115861, 527, 73265, 4842, 151675, 62600, 34417, 11205, ...	[ 0.133544921875, 0.25732421875, 0.1134033203125, 0.1341552734375, 0.10040283203125, 0.248779296875, 0.021636962890625, 0.1651611328125, 0.1177978515625, 0.1171875, 0.218017578125, 0.035919189453125, 0.112548828125, 0.10552978515625, 0.03900146484375, 0.11865234375, 0.1578369140625, ...	embed
26194180_c0	26194180	haskell	0	Title: LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? Problem title: LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? Tags: haskell, monads, category-theory, applicative Problem:...	LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? haskell monads category-theory applicative LYHFGG Monads LYHFGG: "Monads are just ...	[ -0.0000743865966796875, 0.01116943359375, 0.01434326171875, 0.022705078125, -0.0014190673828125, 0.0022735595703125, 0.0030364990234375, -0.0126953125, 0.01116943359375, -0.01263427734375, 0.001373291015625, -0.03076171875, -0.01446533203125, 0.0086669921875, 0.013671875, 0.00045013427...	[ 19917, 66882, 46754, 46674, 712, 7, 621, 1660, 41816, 4935, 7477, 18770, 450, 8060, 5386, 10422, 83, 903, 63805, 29568, 1556, 142508, 2667, 95487, 2347, 60331, 6468, 6396, 42179, 29569, 35064, 1957, 80934, 71, 10644, 18507, 37202, 110, 4191...	[ 0.132568359375, 0.115966796875, 0.178466796875, 0.1893310546875, 0.236328125, 0.1248779296875, 0.058807373046875, 0.078125, 0.21630859375, 0.1131591796875, 0.1807861328125, 0.14892578125, 0.044891357421875, 0.21533203125, 0.0141143798828125, 0.045989990234375, 0.012603759765625, 0....	embed
52744890_c0	52744890	haskell	0	Title: How can I manually kill a thread? Problem title: How can I manually kill a thread? Tags: haskell Problem: How can I manually kill a thread? I'm in ghci testing some functions that fork threads, kinda like this: myForkingFunction = do tid <- forkIO (workerFunction) putStrLn ("Worker thread: " ++ show tid) putStrL...	How can I manually kill a thread? How can I manually kill a thread? haskell How Worker ThreadId GHC.Conc.Sync Couldn When Integer GHC.Prim.ThreadId TYPE GHC.Types.UnliftedRep How can I manually kill a thread? I'm in ghci testing some functions that fork threads, kinda like this: This results in: (and so on) Then as I'm...	[ 0.003387451171875, 0.01324462890625, 0.01177978515625, -0.01220703125, -0.0078125, 0.0126953125, -0.01312255859375, -0.0018157958984375, -0.00311279296875, -0.0654296875, -0.01177978515625, -0.006927490234375, -0.0196533203125, -0.0101318359375, 0.006134033203125, 0.002899169921875, ...	[ 11249, 831, 23009, 538, 67153, 86997, 87, 10, 1556, 142508, 27985, 56, 136719, 568, 71, 527, 73265, 11935, 238, 217835, 44401, 145111, 39116, 95267, 196707, 14256, 104501, 4332, 254, 31380, 318, 134234, 32354, 100, 92, 50339, 42, 214, 67, ...	[ 0.054534912109375, 0.08880615234375, 0.2183837890625, 0.1180419921875, 0.256591796875, 0.26904296875, 0.0228424072265625, 0.063720703125, 0.083984375, 0.19677734375, 0.1219482421875, 0.0751953125, 0.1707763671875, 0.06719970703125, 0.0958251953125, 0.022491455078125, 0.12646484375, ...	embed
49585262_c0	49585262	haskell	0	Title: Mutate only focus of Store Comonad? Problem title: Mutate only focus of Store Comonad? Tags: representable, haskell, comonad Problem: Mutate only focus of Store Comonad? I'm using Control.Comonad.Representable.Store to represent a grid object for a game; the grid is: type Grid = Store (Compose Vector Vector) a ;...	Mutate only focus of Store Comonad? Mutate only focus of Store Comonad? representable haskell comonad Mutate Store Comonad Grid Compose Vector Representable ComonadStore Rep Mutate only focus of Store Comonad? I'm using Control.Comonad.Representable.Store to represent a grid object for a game; the grid is: type Grid = ...	[ -0.013427734375, -0.002593994140625, -0.0091552734375, 0.0015869140625, -0.006744384765625, -0.00982666015625, -0.01336669921875, -0.0191650390625, 0.01025390625, -0.007293701171875, 0.00335693359375, 0.035400390625, 0.019775390625, 0.005950927734375, -0.01214599609375, -0.001083374023...	[ 118756, 67, 4734, 32153, 111, 14934, 6646, 9169, 18811, 2661, 1556, 142508, 533, 31945, 71, 15612, 8364, 2609, 18770, 130877, 165248, 33742, 17368, 27131, 10770, 191, 712, 4332, 55247, 2886, 33636, 120067, 36746, 6712, 10644, 78381, 110527, 6...	[ 0.196533203125, 0.148681640625, 0.1163330078125, 0.257568359375, 0.05682373046875, 0.2340087890625, 0.177734375, 0.23095703125, 0.2095947265625, 0.152099609375, 0.1070556640625, 0.2138671875, 0.1475830078125, 0.1444091796875, 0.011688232421875, 0.1173095703125, 0.109619140625, 0.16...	embed
18366389_c1	18366389	haskell	1	= merge x1 x2 : mergePairs xs mergePairs xs = xs -- expects two sorted lists and returns one sorted list. merge :: [Int] -> [Int] -> [Int] merge [] ys = ys merge xs [] = xs merge (x:xs) (y:ys) = if x <= y then x : merge xs (y:ys) else y : merge (x:xs) ys -- Slow version: takes 350 seconds to sort a 100,000 integer lis...	= merge x1 x2 : mergePairs xs mergePairs xs = xs -- expects two sorted lists and returns one sorted list. merge :: [Int] -> [Int] -> [Int] merge [] ys = ys merge xs [] = xs merge (x:xs) (y:ys) = if x <= y then x : merge xs (y:ys) else y : merge (x:xs) ys -- Slow version: takes 350 seconds to sort a 100,000 integer lis...	[ -0.006072998046875, 0.0240478515625, 0.01318359375, -0.005401611328125, -0.00921630859375, 0.01129150390625, -0.0279541015625, 0.000812530517578125, 0.006866455078125, 0.0106201171875, 0.0166015625, 0.016845703125, 0.02685546875, 0.007598876953125, 0.0120849609375, -0.010986328125, 0...	[ 2203, 42564, 1022, 418, 304, 152, 8335, 481, 7, 4210, 41206, 6626, 17497, 5303, 30646, 1632, 4153, 113, 425, 4778, 2174, 53, 148507, 11389, 51776, 14877, 94131, 12096, 805, 4, 9508, 892, 1505, 72803, 30248, 429, 158240, 10336, 54, 3650, ...	[ 0.06683349609375, 0.29296875, 0.1590576171875, 0.1153564453125, 0.2015380859375, 0.0223236083984375, 0.11572265625, 0.1024169921875, 0.11669921875, 0.0230712890625, 0.17578125, 0.1219482421875, 0.1748046875, 0.14501953125, 0.0904541015625, 0.0975341796875, 0.00140380859375, 0.12451...	embed
65466313_c0	65466313	haskell	0	Title: reading files in Haskell IO Monads Problem title: reading files in Haskell IO Monads Tags: monads, haskell, image-processing, io Problem: reading files in Haskell IO Monads Hello everyone I am beginner in Haskell, I have a dat file that contains [("img0.bmp", [0,0]) ,("img1.bmp", [0,1]) ,("img2.bmp", [1,0]) ,("i...	reading files in Haskell IO Monads reading files in Haskell IO Monads monads haskell image-processing io Haskell Monads img0.bmp img1.bmp img2.bmp img3.bmp Prelude.read Double Prelude.unzip Prelude.map Prelude.zip Vector Word8 FilePath Right reading files in Haskell IO Monads Hello everyone I am beginner in Haskell, I ...	[ 0.0057373046875, 0.0028228759765625, -0.0159912109375, 0.028564453125, 0.01446533203125, 0.0225830078125, 0.004974365234375, -0.005218505859375, -0.0022430419921875, -0.037109375, 0.00250244140625, -0.0218505859375, -0.00023174285888671875, -0.0115966796875, -0.01904296875, -0.00848388...	[ 16454, 102158, 23, 20625, 142508, 17780, 60331, 6468, 2667, 712, 1556, 29569, 63923, 22995, 566, 2389, 2676, 5442, 363, 1914, 822, 39116, 107172, 112, 50836, 62346, 2609, 18770, 22543, 1019, 42724, 683, 10519, 90911, 35378, 30309, 9842, 1679,...	[ 0.21240234375, 0.1690673828125, 0.039398193359375, 0.156494140625, 0.2587890625, 0.2364501953125, 0.1820068359375, 0.1395263671875, 0.09332275390625, 0.11962890625, 0.14404296875, 0.156005859375, 0.0748291015625, 0.2088623046875, 0.11474609375, 0.0606689453125, 0.1517333984375, 0.0...	embed
37999771_c0	37999771	haskell	0	Title: Haskell foldr algrebraic datatypes Problem title: Haskell foldr algrebraic datatypes Tags: haskell, algebraic-data-types Problem: Haskell foldr algrebraic datatypes I have solved all issues I had with functions but one is left. The foldr function works from last element to the first one and I need to get the dat...	Haskell foldr algrebraic datatypes Haskell foldr algrebraic datatypes haskell algebraic-data-types Test.HUnit Data.Char Prelude Data.Foldable Haskell QueueFunctor Test TestLabel TestList TestCase Foldable DQueue Empty Enqueue Show Read Tests sample1 sample2 DQueueTest Failure DQueueTest:1 QueueFunctors.hs:56 Haskell fo...	[ 0.00347900390625, -0.00787353515625, -0.0010223388671875, 0.0130615234375, -0.007415771484375, 0.00714111328125, 0.0164794921875, -0.0233154296875, -0.0177001953125, 0.01007080078125, -0.00958251953125, -0.01251220703125, 0.006072998046875, 0.00144195556640625, -0.01422119140625, -0.00...	[ 20625, 142508, 18344, 7569, 144, 53631, 219, 1771, 2053, 50986, 1556, 429, 2844, 10135, 8647, 27204, 6773, 11809, 84068, 822, 18345, 2886, 5813, 13388, 97249, 18770, 4063, 154663, 30077, 41732, 31678, 944, 17367, 4764, 121413, 391, 111337, 19...	[ 0.09246826171875, 0.22314453125, 0.141357421875, 0.22705078125, 0.04791259765625, 0.0281982421875, 0.1151123046875, 0.0267791748046875, 0.1463623046875, 0.187744140625, 0.079833984375, 0.04779052734375, 0.08770751953125, 0.06134033203125, 0.150146484375, 0.002777099609375, 0.13610839...	embed
28531685_c0	28531685	haskell	0	Title: Memoize Project Euler 116 in Haskell Problem title: Memoize Project Euler 116 in Haskell Tags: haskell, dynamic-programming Problem: Memoize Project Euler 116 in Haskell Below is my first attempt at this problem. It is basically a transliteration of my C++ solution, minus a global hash table used to memoize the ...	Memoize Project Euler 116 in Haskell Memoize Project Euler 116 in Haskell haskell dynamic-programming Memoize Project Euler Haskell fIter2 Memoize Project Euler 116 in Haskell Below is my first attempt at this problem. It is basically a transliteration of my C++ solution, minus a global hash table used to memoize the r...	[ -0.018310546875, -0.0194091796875, 0.0172119140625, -0.0201416015625, -0.00897216796875, 0.0003643035888671875, 0.00579833984375, 0.0050048828125, 0.006561279296875, -0.001983642578125, 0.031494140625, -0.0025177001953125, 0.0128173828125, -0.00341796875, -0.0026092529296875, 0.0129394...	[ 17443, 31, 20650, 27331, 5177, 603, 45773, 20625, 142508, 23, 1556, 84079, 28966, 1238, 720, 304, 17336, 5117, 81887, 2967, 198343, 3900, 39798, 313, 37223, 29806, 26948, 7964, 127, 23180, 163, 432, 50339, 32354, 28219, 62822, 6528, 105233, ...	[ 0.16064453125, 0.1280517578125, 0.1173095703125, 0.1502685546875, 0.1514892578125, 0.188232421875, 0.26953125, 0.1669921875, 0.225341796875, 0.0209197998046875, 0.162841796875, 0.1844482421875, 0.1004638671875, 0.1448974609375, 0.103515625, 0.09783935546875, 0.03924560546875, 0.023...	embed
70820367_c0	70820367	haskell	0	Title: Haskell Beginner, Calling Functions by their Names Problem title: Haskell Beginner, Calling Functions by their Names Tags: haskell, reflection Problem: Haskell Beginner, Calling Functions by their Names Trying the 99 puzzles to learning Haskell. A quality-of-life problem that I have is that every time I test a s...	Haskell Beginner, Calling Functions by their Names Haskell Beginner, Calling Functions by their Names haskell reflection Haskell Beginner Calling Functions Names mySolutionForQuestion12 testMySolutionForQuestion12 myInput1 myInput2 Haskell Beginner, Calling Functions by their Names Trying the 99 puzzles to learning Has...	[ 0.005126953125, 0.00274658203125, 0.0018310546875, 0.026611328125, -0.002899169921875, -0.009033203125, 0.00994873046875, -0.0140380859375, 0.00787353515625, -0.0125732421875, -0.0034027099609375, -0.00439453125, -0.015625, 0.0038299560546875, 0.006591796875, -0.004791259765625, 0.00...	[ 20625, 142508, 67053, 56, 26265, 28670, 10763, 390, 2363, 15757, 214, 1556, 44961, 759, 102588, 34, 18537, 195136, 1530, 3034, 31852, 4153, 7077, 418, 304, 40858, 10078, 104192, 52080, 31897, 4390, 24804, 2967, 765, 11907, 1733, 29806, 2806, ...	[ 0.184814453125, 0.23681640625, 0.1441650390625, 0.05322265625, 0.1510009765625, 0.17529296875, 0.07537841796875, 0.097900390625, 0.084716796875, 0.1541748046875, 0.0187530517578125, 0.136474609375, 0.1683349609375, 0.101318359375, 0.0880126953125, 0.0909423828125, 0.1153564453125, ...	embed
67655017_c1	67655017	haskell	1	{ pointerFV :: Ptr CInt , lengthFV :: CULong } instance Storable ForeignVector where sizeOf _ = {#sizeof CVector #} alignment _ = {#alignof CVector #} peek p = ForeignVector <$> {#get CVector->pointer #} p <*> {#get CVector->length #} p poke p (ForeignVector vecP l) = do {#set CVector.pointer #} p (castPtr vecP) {#set...	4aG8UE4NetrysPAD4QHBzzhdj5TCzbg Gs4ZWwoiN0w9AdvuZcYw2mWMeTgCZn3emX1nAN8glkGUCHV4DrC5CWgU7HfRTYA1CEU0TEZEIdL ZFOKsiV0Bpyn3BBdDB7 LEhx5q rZEL9KH Zxn6QYZ0L1hNMa45jzmfZ4pFuICYtjB R7jjAbXt17s4diiSYpy1m7uFAiAuuFbucGUeFkyxvBCopzrrC8b0FMJart6T5MlUhn1bEVRdrhOK IQ2q5XrnBtzSCSFj5NzHKEgoxNPEws6uyUW1BtYudE ATxl3soDYkCtj7NuSn0bgKsET...	[ 0.0177001953125, 0.0291748046875, -0.0301513671875, -0.005584716796875, -0.000865936279296875, -0.0157470703125, -0.0130615234375, -0.003326416015625, -0.00099945068359375, -0.0225830078125, -0.0013885498046875, -0.00110626220703125, 0.004608154296875, 0.0230712890625, -0.021484375, -0...	[ 201, 24447, 34368, 116908, 841, 571, 20257, 170, 758, 169, 11821, 527, 617, 1511, 1456, 14, 839, 2389, 434, 1126, 22409, 238, 1723, 304, 39, 13, 618, 177, 52215, 19, 363, 195, 1542, 418, 9330, 1019, 11016, 92, 724, 856, 441, 129781, ...	[ 0.054046630859375, 0.02337646484375, 0.06878662109375, 0.08502197265625, 0.00537109375, 0.00555419921875, 0.00384521484375, 0.0057373046875, 0.0057373046875, 0.005706787109375, 0.0050048828125, 0.0166778564453125, 0.006011962890625, 0.005767822265625, 0.005615234375, 0.005767822265625,...	embed
37556296_c0	37556296	haskell	0	Title: How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type Problem title: How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type Tags: haskell, type-inference Problem: How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as ph...	How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type haskell type-inference the How Proxy MyType Char LANGUAGE ScopedTypeVariables Could AllowAmbiguousTypes How to use replace `Proxy :: Proxy a...	[ -0.015380859375, 0.0023345947265625, -0.007293701171875, -0.00390625, -0.0093994140625, 0.004058837890625, 0.00592041015625, 0.0225830078125, 0.007293701171875, -0.0185546875, -0.002532958984375, 0.00119781494140625, -0.0033416748046875, -0.01531982421875, 0.006256103515625, 0.00561523...	[ 4527, 91995, 10752, 50878, 1984, 1250, 10, 50986, 2646, 196707, 360, 18, 11, 68743, 5928, 10644, 237, 1556, 142508, 69988, 21656, 98064, 182783, 297, 81827, 41566, 150567, 12282, 10821, 2203, 678, 75169, 52895, 20625, 43240, 84751, 6528, 3235...	[ 0.0880126953125, 0.1441650390625, 0.15869140625, 0.26708984375, 0.031982421875, 0.1524658203125, 0.1197509765625, 0.1881103515625, 0.1258544921875, 0.2373046875, 0.091552734375, 0.1055908203125, 0.12451171875, 0.0888671875, 0.1136474609375, 0.1783447265625, 0.0148468017578125, 0.06...	embed
7084090_c0	7084090	haskell	0	Title: What is the naming convention for typeclasses in Scala? Problem title: What is the naming convention for typeclasses in Scala? Tags: typeclass, scala, naming-conventions, haskell Problem: What is the naming convention for typeclasses in Scala? In Java world, the naming conventions for interfaces are pretty much ...	What is the naming convention for typeclasses in Scala? What is the naming convention for typeclasses in Scala? typeclass scala naming-conventions haskell What Scala Comparable Numeric Ordering Equal Show What is the naming convention for typeclasses in Scala? In Java world, the naming conventions for interfaces are pr...	[ 0.0135498046875, -0.00127410888671875, -0.00640869140625, 0.0186767578125, 0.01336669921875, 0.0052490234375, 0.00048828125, 0.00482177734375, -0.0152587890625, 0.017578125, -0.007537841796875, -0.0205078125, -0.01422119140625, -0.016357421875, -0.01007080078125, 0.00189208984375, -0...	[ 4865, 83, 70, 147453, 101805, 100, 10644, 67413, 90, 23, 152653, 11, 146232, 2271, 57241, 1556, 142508, 113307, 2886, 93511, 1771, 81206, 214, 241, 71723, 17367, 41925, 8999, 101758, 170920, 18507, 29479, 5154, 36746, 215667, 360, 18, 165164,...	[ 0.031951904296875, 0.0911865234375, 0.01849365234375, 0.2130126953125, 0.216552734375, 0.0308837890625, 0.229736328125, 0.268310546875, 0.1214599609375, 0.0755615234375, 0.197998046875, 0.15673828125, 0.196044921875, 0.010589599609375, 0.1182861328125, 0.0653076171875, 0.18896484375,...	embed
38462563_c0	38462563	haskell	0	Title: How to work with AST with Cofree annotation? Problem title: How to work with AST with Cofree annotation? Tags: recursion-schemes, haskell, abstract-syntax-tree, catamorphism, comonad Problem: How to work with AST with Cofree annotation? I have this simple Expr AST and I can easily convert it to String . import P...	How to work with AST with Cofree annotation? How to work with AST with Cofree annotation? recursion-schemes haskell abstract-syntax-tree catamorphism comonad Prelude qualified Data.Foldable Data.Functor.Foldable Data.Monoid Control.Comonad.Cofree How AST Cofree Expr Foldable ExprF Add Show Ord Functor Prelude.Foldable ...	[ -0.0225830078125, -0.0189208984375, 0.0047607421875, 0.01495361328125, 0.0036773681640625, 0.01141357421875, -0.019775390625, -0.002685546875, -0.001495361328125, -0.02734375, 0.00408935546875, -0.0255126953125, 0.0029449462890625, 0.0225830078125, 0.006805419921875, -0.0198974609375, ...	[ 11249, 4488, 678, 48963, 1311, 32087, 8668, 22062, 195625, 7560, 1556, 142508, 164789, 86531, 62600, 178851, 533, 9169, 822, 217225, 11809, 18345, 2886, 18770, 48899, 27131, 712, 10625, 60075, 42, 30077, 71, 919, 29117, 17367, 35379, 28670, 1...	[ 0.024871826171875, 0.0987548828125, 0.1041259765625, 0.1771240234375, 0.12939453125, 0.295654296875, 0.148193359375, 0.08740234375, 0.06256103515625, 0.0155792236328125, 0.007537841796875, 0.1439208984375, 0.0830078125, 0.0478515625, 0.06317138671875, 0.058349609375, 0.02537536621093...	embed
40970726_c0	40970726	haskell	0	Title: Using newtype in Data.Array.Unboxed with ghc 7.10 Problem title: Using newtype in Data.Array.Unboxed with ghc 7.10 Tags: coercion, haskell, types Problem: Using newtype in Data.Array.Unboxed with ghc 7.10 This worked fine in ghc 7.8.4, but fails in 7.10.3: {-# LANGUAGE DeriveGeneric #-} {-# LANGUAGE GeneralizedN...	Using newtype in Data.Array.Unboxed with ghc 7.10 Using newtype in Data.Array.Unboxed with ghc 7.10 coercion haskell types qualified GHC.Generics the type Using Data.Array.Unboxed LANGUAGE DeriveGeneric GeneralizedNewtypeDeriving Foo Generic Elt Ord Show Num Integral Real Enum A.IArray A.UArray MyArr my.hs:9:75 Couldn ...	[ -0.00189971923828125, 0.0022735595703125, 0.0277099609375, -0.004486083984375, -0.00122833251953125, 0.0047607421875, -0.011474609375, -0.006622314453125, 0.000171661376953125, 0.003570556640625, -0.006988525390625, -0.01007080078125, 0.0123291015625, -0.01806640625, -0.0029144287109375,...	[ 345, 3525, 50986, 23, 11809, 7614, 7092, 14256, 11728, 297, 31380, 238, 2861, 963, 552, 56, 6447, 1556, 142508, 52895, 217225, 527, 73265, 135932, 10644, 3358, 98064, 1310, 5844, 9082, 46568, 47731, 9572, 88342, 540, 18, 35379, 17367, 52782...	[ 0.111572265625, 0.18115234375, 0.33544921875, 0.021026611328125, 0.125244140625, 0.140869140625, 0.1748046875, 0.0880126953125, 0.196533203125, 0.01654052734375, 0.1102294921875, 0.1090087890625, 0.1241455078125, 0.21142578125, 0.0628662109375, 0.1361083984375, 0.0771484375, 0.1086...	embed
39799887_c0	39799887	haskell	0	Title: haskell initial accumulator 'null' value Problem title: haskell initial accumulator 'null' value Tags: haskell Problem: haskell initial accumulator 'null' value I have a seemingly simple Haskell problem and with my limited knowledge I'm not sure what terms to search for in order to solve it. ...	haskell initial accumulator 'null' value haskell initial accumulator 'null' value haskell x:xs Nothing Just haskell initial accumulator 'null' value I have a seemingly simple Haskell problem and with my limited knowledge I'm not sure what terms to search for in order to solve it. I've tried to solve...	[ -0.0130615234375, 0.02392578125, 0.0218505859375, 0.0272216796875, -0.0011749267578125, 0.0245361328125, 0.025634765625, -0.004608154296875, -0.0030364990234375, 0.0033416748046875, 0.00982666015625, 0.027099609375, 0.0216064453125, 0.0205078125, -0.00518798828125, -0.013427734375, 0...	[ 1556, 142508, 61475, 183278, 1290, 3768, 139550, 34292, 1022, 12, 425, 182747, 9563, 48903, 8781, 20625, 2967, 69407, 33938, 86869, 382, 10078, 44402, 148390, 171763, 5303, 7273, 1660, 3687, 31958, 51646, 93, 58134, 179140, 4488, 19777, 83, 1...	[ 0.1702880859375, 0.2196044921875, 0.222900390625, 0.2218017578125, 0.1497802734375, 0.096923828125, 0.2357177734375, 0.200927734375, 0.099609375, 0.06500244140625, 0.09521484375, 0.1016845703125, 0.04327392578125, 0.0229949951171875, 0.0155181884765625, 0.100341796875, 0.087524414062...	embed
4653102_c0	4653102	haskell	0	Title: I can't seem to figure out type variables mixed with classes Problem title: I can't seem to figure out type variables mixed with classes Tags: haskell Problem: I can't seem to figure out type variables mixed with classes I pretty much understand 3/4 the rest of the language, but every time I dip my fee...	I can't seem to figure out type variables mixed with classes I can't seem to figure out type variables mixed with classes haskell Room Show HasArea Num Couldn Dungeon.hs:11:16 Dungeon.hs:13:14 I can't seem to figure out type variables mixed with classes I pretty much understand 3/4 the rest of the language, b...	[ -0.007568359375, 0.0235595703125, 0.015625, -0.00799560546875, -0.00262451171875, 0.014892578125, -0.0250244140625, -0.007049560546875, 0.017578125, -0.032958984375, -0.01239013671875, -0.033203125, 0.0172119140625, -0.0224609375, -0.040283203125, 0.0040283203125, -0.0029449462890625...	[ 831, 3768, 48903, 26366, 1810, 10644, 77336, 17664, 297, 678, 61112, 1556, 142508, 38484, 17367, 20625, 284, 1283, 52782, 191147, 19, 125669, 13, 191, 127, 19993, 22354, 22618, 22635, 18, 28219, 83849, 10588, 46876, 11907, 45, 74261, 91084, ...	[ 0.03314208984375, 0.053863525390625, 0.04241943359375, 0.07781982421875, 0.01300048828125, 0.2293701171875, 0.278076171875, 0.1898193359375, 0.0460205078125, 0.1104736328125, 0.2364501953125, 0.133056640625, 0.213623046875, 0.1817626953125, 0.147705078125, 0.1358642578125, 0.01034545...	embed
32196993_c0	32196993	haskell	0	Title: Why does this code run slower on spoj, triggering the timeout? Problem title: Why does this code run slower on spoj, triggering the timeout? Tags: haskell Problem: Why does this code run slower on spoj, triggering the timeout? I was trying to solve this problem on spoj: http://www.spoj.com/problems/PALIN/ My cod...	Why does this code run slower on spoj, triggering the timeout? Why does this code run slower on spoj, triggering the timeout? haskell Control.Monad Why l:ls Integer x:xs Bool Why does this code run slower on spoj, triggering the timeout? I was trying to solve this problem on spoj: http://www.spoj.com/problems/PALIN/ My...	[ -0.03564453125, 0.01806640625, -0.006317138671875, 0.0028228759765625, -0.00151824951171875, 0.0225830078125, 0.01171875, -0.0093994140625, -0.00689697265625, -0.0400390625, 0.026123046875, -0.0205078125, -0.0272216796875, -0.00677490234375, 0.009765625, 0.004638671875, 0.02429199218...	[ 44084, 14602, 903, 18151, 11675, 72803, 56, 98, 36976, 185553, 1733, 6056, 1556, 142508, 27131, 46674, 712, 96, 12, 8080, 44401, 1022, 425, 7, 2460, 929, 86869, 2967, 26549, 64, 38953, 12236, 46610, 43240, 5885, 4271, 26367, 1766, 87344, ...	[ 0.1241455078125, 0.0178070068359375, 0.07672119140625, 0.1739501953125, 0.0987548828125, 0.2308349609375, 0.1531982421875, 0.0928955078125, 0.25537109375, 0.1627197265625, 0.17431640625, 0.1717529296875, 0.1295166015625, 0.225830078125, 0.2218017578125, 0.1456298828125, 0.16650390625...	embed
51848587_c0	51848587	haskell	0	Title: List constructor names using generics in haskell Problem title: List constructor names using generics in haskell Tags: haskell Problem: List constructor names using generics in haskell I know how to list constructor names in the following way: {-# LANGUAGE DeriveGeneric #-} {-# LANGUAGE FlexibleContexts #-} {-# ...	List constructor names using generics in haskell List constructor names using generics in haskell haskell generics Data.Proxy GHC.Generics List LANGUAGE DeriveGeneric FlexibleContexts FlexibleInstances PolyKinds ScopedTypeVariables TypeApplications TypeOperators Names Proxy Constructor Test Foo Bar Baz Generic Rep List...	[ 0.00015735626220703125, -0.013916015625, -0.01007080078125, 0.004913330078125, 0.01422119140625, 0.0108642578125, -0.0030059814453125, 0.0185546875, 0.00982666015625, -0.0167236328125, -0.01043701171875, -0.032958984375, 0.0107421875, 0.004058837890625, -0.0194091796875, 0.01025390625,...	[ 32036, 64549, 748, 123055, 17368, 189534, 7, 1556, 142508, 23, 11809, 10752, 50878, 527, 73265, 135932, 12259, 98064, 1310, 5844, 180842, 2661, 22829, 116071, 63306, 7250, 182783, 196707, 81827, 60457, 182867, 156823, 22230, 15757, 1250, 82084, ...	[ 0.1583251953125, 0.1778564453125, 0.1348876953125, 0.1641845703125, 0.05181884765625, 0.248046875, 0.0576171875, 0.1280517578125, 0.2218017578125, 0.01190185546875, 0.023956298828125, 0.087158203125, 0.25439453125, 0.0179595947265625, 0.1134033203125, 0.049591064453125, 0.08386230468...	embed
43918789_c0	43918789	haskell	0	Title: What is wrong with pattern matching of existential types in Haskell? Problem title: What is wrong with pattern matching of existential types in Haskell? Tags: pattern-matching, haskell, existential-type Problem: What is wrong with pattern matching of existential types in Haskell? Why it is not possible to patter...	What is wrong with pattern matching of existential types in Haskell? What is wrong with pattern matching of existential types in Haskell? pattern-matching haskell existential-type Control.Monad.Identity What Haskell GADT Instead LANGUAGE ExistentialQuantification MyClass Char What is wrong with pattern matching of exis...	[ -0.0166015625, 0.0172119140625, -0.00066375732421875, 0.005859375, 0.00531005859375, 0.00421142578125, -0.015625, 0.0115966796875, 0.003082275390625, -0.02197265625, 0.0294189453125, -0.009521484375, 0.01190185546875, -0.0234375, 0.0145263671875, -0.00872802734375, 0.0005950927734375...	[ 4865, 83, 44691, 678, 103510, 14858, 214, 99707, 15403, 52895, 20625, 142508, 111, 23, 98753, 1556, 50986, 27131, 46674, 712, 37379, 41072, 175399, 98064, 122688, 118, 18, 41274, 2646, 140803, 21656, 44084, 959, 7722, 2633, 248, 7440, 2886, ...	[ 0.03363037109375, 0.03857421875, 0.1568603515625, 0.0660400390625, 0.2156982421875, 0.2149658203125, 0.06744384765625, 0.1949462890625, 0.1279296875, 0.193115234375, 0.1343994140625, 0.2283935546875, 0.01153564453125, 0.038970947265625, 0.2017822265625, 0.110595703125, 0.157104492187...	embed
8647977_c0	8647977	haskell	0	Title: Composite type with extractor type functions Problem title: Composite type with extractor type functions Tags: types, haskell Problem: Composite type with extractor type functions Let's say I want to create a complex data structure consisting of multiple mutually recursive data types, with multiple type variable...	Composite type with extractor type functions Composite type with extractor type functions types haskell Composite Foo FooA FooB Bar FooC FooD Baz BarA BarB BarC BarD BazA BazB BazC BazD GetX GetY GetZ Composite type with extractor type functions Let's say I want to create a complex data structure consisting of multiple...	[ 0.00102996826171875, -0.004486083984375, -0.0026397705078125, 0.028076171875, 0.0037994384765625, -0.00142669677734375, -0.00946044921875, -0.000110626220703125, 0.01348876953125, -0.00860595703125, -0.01416015625, -0.01165771484375, -0.007781982421875, 0.0203857421875, -0.0101318359375,...	[ 3288, 77087, 10644, 678, 4173, 18770, 32354, 13, 52895, 1556, 142508, 9572, 31, 284, 571, 3253, 441, 397, 36490, 20779, 1542, 1723, 1511, 3444, 28282, 27140, 2053, 45646, 58055, 48716, 199849, 195625, 77336, 160404, 3917, 831, 57134, 133, 1...	[ 0.1343994140625, 0.25146484375, 0.240234375, 0.1270751953125, 0.2412109375, 0.2188720703125, 0.2135009765625, 0.06610107421875, 0.2308349609375, 0.156005859375, 0.260009765625, 0.12646484375, 0.058837890625, 0.059600830078125, 0.097900390625, 0.1470947265625, 0.05426025390625, 0.07...	embed
31659975_c1	31659975	haskell	1	arr, StaticDraw) enableAttribLocations [0, 1] setAttribPointers return bufferObject vertexNumComponents :: NumComponents vertexNumComponents = 4 colorNumComponents :: NumComponents colorNumComponents = 4 initializeState :: IO State initializeState = do bufferObject <- createVertexBuffer triangleVertexes program <- ini...	arr, StaticDraw) enableAttribLocations [0, 1] setAttribPointers return bufferObject vertexNumComponents :: NumComponents vertexNumComponents = 4 colorNumComponents :: NumComponents colorNumComponents = 4 initializeState :: IO State initializeState = do bufferObject <- createVertexBuffer triangleVertexes program <- ini...	[ -0.005615234375, -0.00335693359375, -0.002777099609375, -0.00628662109375, -0.02001953125, 0.007293701171875, 0.00726318359375, 0.000698089599609375, -0.00897216796875, -0.00433349609375, -0.0262451171875, -0.01806640625, 0.0024566650390625, -0.01953125, -0.017822265625, -0.01043701171...	[ 187, 42, 71465, 238, 397, 81456, 22, 2886, 28848, 18, 11049, 15363, 120639, 2389, 5423, 147534, 1314, 30646, 373, 18234, 75161, 493, 24371, 316, 10770, 54137, 1984, 52782, 7, 2203, 201, 10576, 61475, 20650, 135206, 13, 17780, 22836, 54, 2...	[ 0.078369140625, 0.10546875, 0.198974609375, 0.06671142578125, 0.037567138671875, 0.2127685546875, 0.0911865234375, 0.135986328125, 0.028045654296875, 0.0670166015625, 0.1903076171875, 0.148193359375, 0.1259765625, 0.0313720703125, 0.160888671875, 0.1319580078125, 0.0657958984375, 0...	embed

50050431_c0

50050431

haskell

0

Title: Persistent `upsert` isn't working Problem title: Persistent `upsert` isn't working Tags: yesod, haskell Problem: Persistent `upsert` isn't working I am apparently confused about Persistent's upsert function and how it works with Postgres 9.5. I am writing a Yesod app that takes in a JSON value, parses ...

Persistent `upsert` isn't working Persistent `upsert` isn't working yesod haskell Persistent Handler TypedContent IntensiveTreatmentClient ClientId UniqueIntensiveTreatmentClientClientId POST Params Request Body Accept Status Persistent `upsert` isn't working I am apparently confused about Persistent's upsert...

[ -0.0140380859375, 0.04052734375, 0.015625, -0.0101318359375, -0.01275634765625, 0.027099609375, -0.0194091796875, -0.020751953125, 0.0035552978515625, -0.024169921875, 0.0126953125, 0.015380859375, -0.008544921875, -0.01416015625, -0.00098419189453125, 0.00034332275390625, -0.0019683...

[ 57309, 2581, 18, 2037, 33657, 56112, 3768, 20697, 2422, 23722, 1556, 142508, 10639, 603, 60457, 25352, 221149, 62731, 257, 150, 91732, 11789, 41745, 75616, 43960, 111383, 56504, 55681, 1257, 32354, 43240, 678, 2795, 17562, 117878, 32562, 32635,...

[ 0.172607421875, 0.1875, 0.1705322265625, 0.1805419921875, 0.287353515625, 0.0869140625, 0.075927734375, 0.19580078125, 0.13037109375, 0.2001953125, 0.115478515625, 0.201416015625, 0.124755859375, 0.1177978515625, 0.1134033203125, 0.0799560546875, 0.09808349609375, 0.046600341796875...

embed

52751564_c0

52751564

haskell

0

Title: Haskell Function Composition with Map Function Problem title: Haskell Function Composition with Map Function Tags: proof, haskell, function-composition, map-function, equality Problem: Haskell Function Composition with Map Function I'm going through the Richard Bird's "Thinking Functionally with Haskell" book an...

Haskell Function Composition with Map Function Haskell Function Composition with Map Function proof haskell function-composition map-function equality Haskell Composition Map Bool Haskell Function Composition with Map Function I'm going through the Richard Bird's "Thinking Functionally with Haskell" book and there is a...

[ 0.0019683837890625, 0.000370025634765625, 0.006805419921875, 0.0184326171875, -0.00958251953125, -0.005615234375, -0.00482177734375, 0.0037994384765625, 0.00147247314453125, -0.00225830078125, -0.005889892578125, 0.01519775390625, -0.006927490234375, 0.0076904296875, 0.003997802734375, ...

[ 20625, 142508, 28670, 3288, 40322, 678, 42719, 10763, 98869, 1556, 32354, 277, 22288, 137175, 28, 161789, 2460, 929, 8305, 22758, 72607, 20800, 73, 6048, 25958, 12877, 40059, 831, 18, 28219, 502, 57266, 46312, 55300, 6422, 61924, 237, 23534, ...

[ 0.15234375, 0.250732421875, 0.134033203125, 0.13330078125, 0.1217041015625, 0.10546875, 0.2060546875, 0.07275390625, 0.1551513671875, 0.16748046875, 0.167236328125, 0.1458740234375, 0.21484375, 0.181396484375, 0.07891845703125, 0.1866455078125, 0.0899658203125, 0.137939453125, 0....

embed

53378431_c0

53378431

haskell

0

Title: How to catch Exception from IO and print its error. Problem title: How to catch Exception from IO and print its error. Tags: haskell Problem: How to catch Exception from IO and print its error. I'd like to catch exceptions from the IO and inspect what kind of exception was raised with typeOf and then use the spe...

How to catch Exception from IO and print its error. How to catch Exception from IO and print its error. haskell Control.Exception SomeException MonadError IO Data.Typeable System.Environment How Exception MISSING_ENV How to catch Exception from IO and print its error. I'd like to catch exceptions from the IO and inspec...

[ -0.004852294921875, 0.012939453125, -0.0235595703125, 0.0086669921875, 0.0096435546875, 0.0093994140625, -0.0152587890625, -0.01251220703125, -0.004608154296875, 0.01080322265625, 0.009521484375, -0.04736328125, 0.0118408203125, -0.01611328125, 0.0159912109375, 0.004730224609375, -0....

[ 11249, 47, 105556, 5443, 63928, 1295, 17780, 136, 28412, 6863, 18499, 1556, 142508, 27131, 19279, 31384, 60331, 71, 18468, 31611, 11809, 196707, 2886, 12353, 686, 1900, 53695, 111848, 11572, 856, 1884, 131527, 134071, 8562, 165249, 678, 10644, ...

[ 0.07977294921875, 0.03192138671875, 0.23046875, 0.1783447265625, 0.272705078125, 0.1610107421875, 0.2476806640625, 0.06689453125, 0.209716796875, 0.080078125, 0.2078857421875, 0.1029052734375, 0.2236328125, 0.1783447265625, 0.13134765625, 0.093505859375, 0.1634521484375, 0.07043457...

embed

27436894_c0

27436894

haskell

0

Title: How to expect exceptions with QuickCheck2 Problem title: How to expect exceptions with QuickCheck2 Tags: haskell Problem: How to expect exceptions with QuickCheck2 I've been trying to pick up Haskell recently, but I am having some difficulty with QuickCheck2 (which I'm trying to learn while coding up the 99 prob...

How to expect exceptions with QuickCheck2 How to expect exceptions with QuickCheck2 haskell How QuickCheck2 prop_myLast Bool Property How to expect exceptions with QuickCheck2 I've been trying to pick up Haskell recently, but I am having some difficulty with QuickCheck2 (which I'm trying to learn while coding up the 99...

[ -0.00836181640625, -0.0028076171875, -0.01263427734375, -0.0086669921875, 0.00567626953125, 0.0126953125, 0.00921630859375, -0.01513671875, 0.0098876953125, -0.00445556640625, 0.0213623046875, 0.0081787109375, 0.00201416015625, -0.037841796875, 0.01165771484375, -0.00238037109375, -0...

[ 11249, 41206, 131527, 7, 678, 89038, 202567, 304, 1556, 142508, 25793, 1176, 2729, 271, 2460, 929, 206984, 39580, 20625, 34844, 552, 10078, 44402, 7722, 11389, 18151, 3034, 759, 32354, 30646, 4568, 12830, 5303, 10644, 78292, 17647, 379, 3408,...

[ 0.06878662109375, 0.2099609375, 0.2481689453125, 0.1019287109375, 0.107666015625, 0.153076171875, 0.2486572265625, 0.1854248046875, 0.09051513671875, 0.1846923828125, 0.163818359375, 0.1077880859375, 0.1727294921875, 0.1474609375, 0.06854248046875, 0.1435546875, 0.1539306640625, 0....

embed

49130389_c0

49130389

haskell

0

Title: Has anyone been able to integrate liquidhaskell with nixos? Problem title: Has anyone been able to integrate liquidhaskell with nixos? Tags: nixos, liquid-haskell, haskell Problem: Has anyone been able to integrate liquidhaskell with nixos? I'm trying to use liquidhaskell on NixOS. I can install the package (liq...

Has anyone been able to integrate liquidhaskell with nixos? Has anyone been able to integrate liquidhaskell with nixos? nixos liquid-haskell haskell containers-0.5.10.2 Has pdbzl0p6k1klmajx969b6vvwyw9w0s6b-ghc-8.2.2-with-packages proclib:1 ghc-8.2.2 text-1.2.2.2 Jan nix.hs LiquidHaskell Version Copyright Regents Univer...

[ 0.006866455078125, -0.0128173828125, 0.0152587890625, 0.0166015625, -0.0133056640625, 0.025390625, -0.007537841796875, 0.00421142578125, -0.01544189453125, -0.01251220703125, -0.008544921875, -0.014404296875, 0.00299072265625, -0.006622314453125, 0.00872802734375, -0.00927734375, -0....

[ 20625, 35672, 2809, 19048, 78779, 13, 41931, 10557, 142508, 678, 300, 47436, 1556, 116419, 93645, 10179, 304, 48073, 201985, 9486, 17376, 70147, 76228, 29102, 10402, 5612, 31380, 238, 7986, 48400, 3342, 425, 127, 170527, 6495, 7, 40647, 68744...

[ 0.006072998046875, 0.08544921875, 0.049102783203125, 0.117431640625, 0.2333984375, 0.046875, 0.222412109375, 0.1373291015625, 0.2252197265625, 0.125, 0.10028076171875, 0.196533203125, 0.1248779296875, 0.17578125, 0.0963134765625, 0.1151123046875, 0.0396728515625, 0.0220794677734375...

embed

64646107_c0

64646107

haskell

0

Title: How to increment elements in list by another character Problem title: How to increment elements in list by another character Tags: list, haskell Problem: How to increment elements in list by another character I have string "* * * *" and I want to get "*2*2*10001*" but my function can change only one side and I d...

How to increment elements in list by another character How to increment elements in list by another character list haskell How Char x:xs newVal:xs x:replaceNth n-1 x-1 How to increment elements in list by another character I have string "* * * *" and I want to get "*2*2*10001*" but my function can change only one side ...

[ -0.0242919921875, -0.00830078125, 0.0108642578125, 0.0274658203125, 0.0021514892578125, 0.0030670166015625, 0.00872802734375, -0.00823974609375, 0.01129150390625, 0.025390625, 0.0174560546875, -0.01312255859375, 0.00034332275390625, 0.01904296875, -0.01416015625, -0.00811767578125, 0...

[ 11249, 47, 158661, 80854, 23, 5303, 390, 15700, 62816, 1556, 142508, 21656, 1022, 425, 3525, 42272, 107, 23935, 927, 5759, 79315, 1639, 661, 3444, 2046, 304, 14105, 418, 32354, 831, 15549, 4734, 1632, 5609, 3714, 3642, 27289, 86531, 9014, ...

[ 0.06683349609375, 0.0257720947265625, 0.259765625, 0.20556640625, 0.0540771484375, 0.204833984375, 0.103515625, 0.148193359375, 0.219482421875, 0.1417236328125, 0.2169189453125, 0.1917724609375, 0.036529541015625, 0.0565185546875, 0.0927734375, 0.169677734375, 0.0241546630859375, 0...

embed

13293465_c0

13293465

haskell

0

Title: Replacing element in a list of lists in Haskell Problem title: Replacing element in a list of lists in Haskell Tags: search, haskell, list Problem: Replacing element in a list of lists in Haskell I have a list of lists like so: [["BBBBBBBB", "BWFFFPFGB", "BWFFFPFGB", "BWFFMPFGB", "BWFFFPF_B", "BWFFFPF6B", "BBBBB...

Replacing element in a list of lists in Haskell Replacing element in a list of lists in Haskell search haskell list Replacing Haskell BBBBBBBB BWFFFPFGB BWFFMPFGB BWFFFPF_B BWFFFPF6B BBBBBBB x:xs Prelude Not Replacing element in a list of lists in Haskell I have a list of lists like so: I've done a little research and ...

[ -0.01019287109375, 0.026123046875, 0.002471923828125, 0.005859375, 0.00128936767578125, 0.0137939453125, 0.002960205078125, -0.00732421875, -0.000476837158203125, 0.01275634765625, 0.02685546875, 0.00408935546875, 0.01361083984375, -0.0036163330078125, -0.01904296875, -0.00251770019531...

[ 853, 133266, 214, 12830, 23, 5303, 7, 20625, 142508, 33938, 1556, 40746, 22312, 168437, 30110, 41265, 8359, 1022, 12, 425, 1914, 822, 112, 11205, 25188, 17203, 11651, 80854, 17368, 70, 6506, 39933, 157318, 100, 24233, 594, 9077, 3642, 1672,...

[ 0.0966796875, 0.18408203125, 0.017547607421875, 0.2125244140625, 0.0618896484375, 0.2384033203125, 0.057708740234375, 0.1572265625, 0.252197265625, 0.152587890625, 0.1280517578125, 0.034332275390625, 0.045623779296875, 0.063720703125, 0.02899169921875, 0.0587158203125, 0.083862304687...

embed

39121458_c1

39121458

haskell

1

: {-# LANGUAGE ForeignFunctionInterface #-} foreign import ccall "basler_init" baslerInit :: IO () main :: IO () main = baslerInit I compile and run this as: $ ghc --make Test2.hs -o Test2-haskell -Llib -lbasler -optl-Wl,--enable-new-dtags -optl-Wl,-rpath,pylon5/lib64 -optl-Wl,-E -lpylonbase $ PYLON_CAMEMU=1 LD_LIBRARY...

. The camera comes with a C++ library that makes it fairly straight forward. The following code can be used to acquire a camera source: I've used this source code to build a shared library - libbasler.so . To confirm it works, here's a basic C program that links against it and confirms everything is working: I compile ...

[ 0.00970458984375, 0.0018310546875, -0.0091552734375, 0.0013427734375, -0.02197265625, 0.0162353515625, 0.00811767578125, -0.026611328125, -0.0034942626953125, -0.04296875, 0.005767822265625, -0.0205078125, -0.0174560546875, -0.002044677734375, 0.012451171875, -0.008056640625, 0.01721...

[ 6, 5, 581, 15593, 32497, 678, 10, 313, 37223, 35773, 1294, 450, 30482, 442, 180663, 80560, 40225, 25632, 18151, 831, 186, 11814, 47, 163629, 31344, 903, 45367, 99764, 25474, 5918, 603, 991, 39563, 43240, 3688, 62822, 1528, 22317, 26548, 7...

[ 0.0841064453125, 0.06597900390625, 0.120361328125, 0.30810546875, 0.1505126953125, 0.122314453125, 0.06903076171875, 0.129638671875, 0.26611328125, 0.196044921875, 0.11474609375, 0.00286865234375, 0.048004150390625, 0.0673828125, 0.1103515625, 0.1204833984375, 0.1602783203125, 0.08...

embed

9425437_c1

9425437

haskell

1

Maybe.fromJust: Nothing error exactly where I would expect newHs to return Nothing . I was asked for more code. I am trying to come up with a minimum situation that reproduces the error, but in the mean time, here is the complete problematic callerFunc code. -- Given a list of residues and an aromatic, find instances ...

[ -0.006011962890625, -0.0027313232421875, -0.0103759765625, -0.01068115234375, -0.000263214111328125, 0.00811767578125, 0.01531982421875, -0.016845703125, 0.0108642578125, -0.01953125, 0.00004410743713378906, 0.00015163421630859375, 0.0191650390625, -0.0166015625, 0.00634765625, -0.0247...

[ 83425, 161063, 127794, 182747, 18499, 66161, 7440, 2806, 41206, 3525, 841, 7, 30646, 1286, 18151, 15440, 16648, 42238, 28484, 186560, 11782, 56, 97249, 238, 5303, 99996, 85792, 7413, 110527, 126442, 1409, 71052, 17721, 1771, 20583, 48130, 19, ...

[ 0.254638671875, 0.190673828125, 0.2198486328125, 0.243896484375, 0.2261962890625, 0.076904296875, 0.0254669189453125, 0.049224853515625, 0.1630859375, 0.1485595703125, 0.17333984375, 0.06683349609375, 0.1761474609375, 0.034637451171875, 0.1676025390625, 0.11767578125, 0.0657958984375...

embed

18570937_c0

18570937

haskell

0

Title: Haskell lazy Bytestring words not lazy? Problem title: Haskell lazy Bytestring words not lazy? Tags: long-lines, lazy-io, haskell, bytestring Problem: Haskell lazy Bytestring words not lazy? I have the following Haskell program for computing a maximum sum substring of a string of integers: {-# LANGUAGE BangPatte...

Haskell lazy Bytestring words not lazy? Haskell lazy Bytestring words not lazy? long-lines lazy-io haskell bytestring Data.Functor Data.Maybe Data.ByteString.Lazy.Char8 Prelude Haskell Bytestring LANGUAGE BangPatterns OPTIONS_GHC fst.fromJust.readInt Haskell lazy Bytestring words not lazy? I have the following Haskell ...

[ 0.0027923583984375, -0.005584716796875, 0.0026397705078125, 0.0030670166015625, -0.01007080078125, 0.0283203125, 0.01171875, 0.01104736328125, -0.002471923828125, -0.01263427734375, -0.01007080078125, 0.0002079010009765625, 0, -0.002197265625, 0.00811767578125, 0.013671875, -0.004882...

[ 20625, 142508, 21, 3285, 3311, 67, 91693, 34153, 959, 4989, 59801, 846, 1556, 390, 11809, 97249, 18770, 75358, 71713, 214, 2729, 84068, 1019, 1914, 822, 98064, 26387, 8335, 3055, 28023, 41877, 441, 271, 161063, 127794, 39116, 4153, 25632, 1...

[ 0.1304931640625, 0.243408203125, 0.1529541015625, 0.191650390625, 0.1004638671875, 0.1236572265625, 0.2197265625, 0.1890869140625, 0.1192626953125, 0.05450439453125, 0.130615234375, 0.137939453125, 0.11865234375, 0.079345703125, 0.06060791015625, 0.037567138671875, 0.03125, 0.04232...

embed

52385447_c1

52385447

haskell

1

Text w h r = (writeText <> roundedRect w h r) # lwL 0.02 # fontSize (local 0.2) --terminalInput = (text "Input Data" <> roundedRect 1 0.3 0.3) # lwL 0.02 # fontSize (local 0.2) --process txt w h = (text txt <> rect w h) # lwL 0.02 # fontSize (local 0.2) process writeText w h = (writeText <> rect w h) # lwL 0.02 # fontS...

[ -0.003326416015625, 0.0167236328125, -0.027099609375, 0.0196533203125, 0.00396728515625, 0.0067138671875, 0.02001953125, -0.0177001953125, 0.01531982421875, 0.035888671875, -0.0026702880859375, 0.0294189453125, 0.00732421875, 0.0067138671875, -0.0103759765625, 0.01373291015625, 0.012...

[ 24129, 148, 1096, 1690, 2203, 434, 18781, 174379, 68807, 297, 1052, 24762, 468, 866, 89678, 304, 12401, 127167, 98908, 126175, 30524, 289, 4153, 7077, 22829, 11809, 127089, 4210, 63923, 124326, 173247, 9433, 33022, 2053, 188, 4512, 25561, 335...

[ 0.26806640625, 0.1708984375, 0.1925048828125, 0.0889892578125, 0.06488037109375, 0.064453125, 0.14453125, 0.25146484375, 0.1270751953125, 0.0867919921875, 0.036529541015625, 0.10601806640625, 0.010223388671875, 0.06024169921875, 0.07318115234375, 0.066650390625, 0.1536865234375, 0....

embed

46337988_c0

46337988

haskell

0

Title: Human readable numbers with Haskell Charts Problem title: Human readable numbers with Haskell Charts Tags: haskell, haskell-chart Problem: Human readable numbers with Haskell Charts I'm trying to use Haskell-Charts ( http://hackage.haskell.org/package/Chart ) to generate some graphs. It works fine and I get a ni...

Human readable numbers with Haskell Charts Human readable numbers with Haskell Charts haskell haskell-chart Graphics.Rendering.Chart.Easy Graphics.Rendering.Chart.Axis.LocalTime Graphics.Rendering.Chart.Backend.Diagrams Data.Time.LocalTime Human Haskell Charts Get test.svg layout_title Active L.map LocalTime V.toList H...

[ -0.01318359375, -0.0084228515625, 0.0224609375, -0.0089111328125, 0.01806640625, -0.00830078125, 0.0059814453125, -0.00136566162109375, 0.00885009765625, -0.0040283203125, -0.0137939453125, -0.022705078125, -0.004608154296875, 0.01141357421875, 0.0189208984375, 0.00860595703125, -0.0...

[ 28076, 12301, 2886, 101935, 678, 20625, 142508, 110373, 1556, 9254, 18, 189682, 33, 111747, 84068, 162, 33102, 203758, 70059, 152470, 3611, 72838, 25561, 11809, 20779, 3034, 67756, 108802, 5440, 88441, 339, 62346, 24172, 310, 188, 154663, 31577...

[ 0.16259765625, 0.23095703125, 0.1800537109375, 0.203857421875, 0.09375, 0.1405029296875, 0.2266845703125, 0.2445068359375, 0.108642578125, 0.1903076171875, 0.0701904296875, 0.1806640625, 0.0479736328125, 0.06195068359375, 0.2296142578125, 0.0693359375, 0.0853271484375, 0.0870361328...

embed

6080200_c0

6080200

haskell

0

Title: Creating cookies with Network.Browser Problem title: Creating cookies with Network.Browser Tags: haskell Problem: Creating cookies with Network.Browser So I'm trying to use the Network.Browser library to store cookie sessions. Here's what I have so far: main = do args <- getArgs [user, pass] <- if not (null args...

Creating cookies with Network.Browser Creating cookies with Network.Browser haskell Creating Network.Browser www.plurk.com API Users api_key FVXhr06sHbbp7Lv2rezPVw8rhpl7fNnX Right Just fans_count Enter Sending GET saiko_chriskun XXXXXXXXXX HTTP Host Content-Length User-Agent hs-HTTP-4000.0.9 Received Server Date Sat Ma...

[ -0.00653076171875, 0.029052734375, 0.002899169921875, -0.01080322265625, 0.0101318359375, -0.006011962890625, -0.0184326171875, 0.005096435546875, 0.005126953125, -0.0235595703125, 0.0137939453125, -0.005401611328125, -0.0030670166015625, -0.0172119140625, -0.00201416015625, -0.0151367...

[ 56781, 4136, 678, 28997, 5, 571, 15555, 2189, 1556, 142508, 62821, 7190, 277, 61687, 53400, 31470, 19770, 9016, 1542, 90911, 35992, 71013, 60816, 24044, 79794, 57, 5696, 309, 205378, 135913, 100932, 70870, 449, 46825, 68037, 143161, 22687, 20...

[ 0.140869140625, 0.259765625, 0.09375, 0.14892578125, 0.0283966064453125, 0.0154571533203125, 0.15966796875, 0.1416015625, 0.10540771484375, 0.214111328125, 0.1278076171875, 0.1641845703125, 0.0229034423828125, 0.1363525390625, 0.1099853515625, 0.10302734375, 0.1669921875, 0.0552978...

embed

53972750_c0

53972750

haskell

0

Title: Multiple regex matches not a [String] in Haskell Problem title: Multiple regex matches not a [String] in Haskell Tags: haskell, regex Problem: Multiple regex matches not a [String] in Haskell I'm looking at the RWH tutorial here , which suggests, but has an error on, the usage of [String] to return multiple resu...

Multiple regex matches not a [String] in Haskell Multiple regex matches not a [String] in Haskell haskell regex a Multiple Haskell Bool RegexContext Regex Multiple regex matches not a [String] in Haskell I'm looking at the RWH tutorial here , which suggests, but has an error on, the usage of [String] to return multiple...

[ -0.01324462890625, 0.00250244140625, 0.01556396484375, 0.036865234375, -0.0166015625, 0.012451171875, -0.006439208984375, 0.006805419921875, 0.0164794921875, 0.00592041015625, -0.002960205078125, -0.0015106201171875, 0.006439208984375, -0.00567626953125, -0.010498046875, 0.012573242187...

[ 19335, 8705, 6835, 3355, 14858, 959, 10, 71713, 214, 20625, 142508, 23, 1556, 2460, 929, 11678, 22829, 90, 78691, 841, 57143, 42459, 18499, 127689, 30646, 48716, 50339, 27489, 107013, 170198, 26458, 132283, 5062, 10644, 199015, 16487, 100, 15...

[ 0.16064453125, 0.13671875, 0.1541748046875, 0.2183837890625, 0.2100830078125, 0.182861328125, 0.1197509765625, 0.1729736328125, 0.056671142578125, 0.130615234375, 0.2279052734375, 0.038482666015625, 0.11865234375, 0.042083740234375, 0.117431640625, 0.1231689453125, 0.117919921875, ...

embed

48631939_c0

48631939

haskell

0

Title: A concise way to factor out multiple typeclasses in Haskell? Problem title: A concise way to factor out multiple typeclasses in Haskell? Tags: typeclass, haskell Problem: A concise way to factor out multiple typeclasses in Haskell? In my Haskell codebase, I have many functions that take polymorphic arguments. Th...

A concise way to factor out multiple typeclasses in Haskell? A concise way to factor out multiple typeclasses in Haskell? typeclass haskell Haskell RealFloat Floating Real Show Ord Typeable NiceFloating A concise way to factor out multiple typeclasses in Haskell? In my Haskell codebase, I have many functions that take ...

[ -0.0003070831298828125, -0.001129150390625, -0.00007772445678710938, -0.0022125244140625, 0.0234375, -0.00390625, -0.002716064453125, -0.026611328125, 0.00604248046875, -0.007354736328125, -0.004974365234375, -0.0263671875, 0.015625, -0.01397705078125, -0.0225830078125, 0.0027770996093...

[ 158, 318, 184, 3917, 31461, 1810, 48716, 10644, 67413, 90, 20625, 142508, 62, 23, 1556, 5120, 919, 365, 257, 38699, 26518, 17367, 35379, 60457, 2886, 73398, 18151, 37382, 5941, 32354, 5646, 35874, 178851, 10750, 3871, 40407, 5701, 5423, 10,...

[ 0.0726318359375, 0.178955078125, 0.089111328125, 0.072021484375, 0.2257080078125, 0.1668701171875, 0.24267578125, 0.2215576171875, 0.287841796875, 0.0897216796875, 0.139404296875, 0.25634765625, 0.030548095703125, 0.0626220703125, 0.09619140625, 0.148681640625, 0.039306640625, 0.11...

embed

36626313_c0

36626313

haskell

0

Title: Haskell does not support the C++ overloading style in which functions with different types share a common name Problem title: Haskell does not support the C++ overloading style in which functions with different types share a common name Tags: haskell Problem: Haskell does not support the C++ overloading style in...

Haskell does not support the C++ overloading style in which functions with different types share a common name Haskell does not support the C++ overloading style in which functions with different types share a common name haskell Haskell Equal Bool Name Employee Engineer Student emp1 emp2 stud1 stud2 Haskell does not s...

[ 0.022216796875, 0.015869140625, 0.00592041015625, 0.007049560546875, -0.01141357421875, -0.004180908203125, -0.0074462890625, -0.0155029296875, -0.003173828125, -0.002197265625, 0.00830078125, -0.046630859375, 0.008056640625, -0.01239013671875, -0.00830078125, 0.0038909912109375, -0....

[ 20625, 142508, 14602, 959, 8060, 313, 37223, 645, 63033, 20623, 32354, 678, 12921, 52895, 12008, 39210, 9351, 1556, 241, 71723, 2460, 929, 15757, 365, 1033, 90125, 26696, 20244, 418, 304, 27938, 214, 52080, 209806, 10557, 77275, 67413, 6495, ...

[ 0.1722412109375, 0.27197265625, 0.0251312255859375, 0.1234130859375, 0.22802734375, 0.0168304443359375, 0.2481689453125, 0.140869140625, 0.2105712890625, 0.2232666015625, 0.2003173828125, 0.050262451171875, 0.15087890625, 0.2401123046875, 0.1463623046875, 0.173583984375, 0.1652832031...

embed

40562437_c2

40562437

haskell

2

.9.0.0.a(iconv.o) (maybe you meant: _hs_iconv_open) "_locale_charset", referenced from: _localeEncoding in libHSbase-4.9.0.0.a(PrelIOUtils.o) ld: symbol(s) not found for architecture x86_64 clang: error: Code signals: Link, Preprocessing, hoogle-5.0.1, Compiling, Main, Main.hs, x86_64-osx, Cabal-1.24.0.0, Main.o, Linki...

[ -0.0264892578125, -0.01531982421875, 0.0004673004150390625, 0.01202392578125, -0.0024261474609375, 0.0081787109375, -0.00531005859375, -0.005828857421875, -0.0172119140625, -0.000682830810546875, 0.00089263916015625, -0.038330078125, 0.0283203125, 0.01336669921875, 0.00750732421875, -0...

[ 38331, 99929, 11, 14, 2271, 334, 5, 31, 11354, 131148, 101, 127, 7, 59636, 98908, 13, 9254, 3509, 91067, 7768, 587, 6238, 25474, 38131, 37382, 156982, 19273, 141, 17780, 106742, 7870, 71, 26582, 132, 959, 14037, 100, 6, 159958, 1022, 15...

[ 0.1956787109375, 0.1910400390625, 0.113525390625, 0.06317138671875, 0.1751708984375, 0.2467041015625, 0.0300445556640625, 0.1907958984375, 0.023834228515625, 0.04571533203125, 0.01068115234375, 0.0906982421875, 0.0927734375, 0.210693359375, 0.156005859375, 0.083740234375, 0.185058593...

embed

52021594_c1

52021594

haskell

1

version (latest matching version is 1.19.1) hlint must match <2.1 && >=2.0.8, but the stack configuration has no specified version (latest matching version is 2.0.15) monad-control must match >=1 && <1.1, but the stack configuration has no specified version (latest matching version is 1.0.2.3) monad-journal must match...

4.1.1 exceptions-0.10.0 haskell-src-exts-util-0.2.3 hscolour-1.24.4 mmorph-1.1.2 old-locale-1.0.0.7 refact-0.3.0.2 stm-2.4.5.0 transformers-compat-0.6.2 uniplate-1.6.12 unordered-containers-0.2.9.0 utf8-string-1.0.1.1 vector-0.12.0.1 void-0.7.2 yaml-0.10.0 cabal-doctest-1.0.6 comonad-5.0.4 contravariant-1.5 distributiv...

[ -0.0263671875, 0.01385498046875, 0.00286865234375, 0.00299072265625, -0.00616455078125, 0.0181884765625, -0.01434326171875, -0.0103759765625, 0.00067901611328125, 0.046875, 0.00021457672119140625, -0.050048828125, 0.0205078125, -0.004425048828125, 0.015869140625, 0.00689697265625, -0...

[ 201, 83783, 131527, 7, 9, 102014, 99929, 1556, 142508, 19437, 3355, 933, 3675, 23320, 5, 120883, 1096, 22796, 474, 48400, 180874, 347, 178851, 5759, 10332, 98908, 13, 102107, 134926, 456, 114700, 170179, 133684, 6138, 39, 116591, 187461, 2719...

[ 0.1207275390625, 0.1878662109375, 0.2548828125, 0.032257080078125, 0.0218505859375, 0.10369873046875, 0.1365966796875, 0.111083984375, 0.2261962890625, 0.1160888671875, 0.10595703125, 0.129150390625, 0.09423828125, 0.0142059326171875, 0.005706787109375, 0.0909423828125, 0.06951904296...

embed

6870483_c0

6870483

haskell

0

Title: Translating G-Machine source to LLVM IR Problem title: Translating G-Machine source to LLVM IR Tags: compiler-construction, haskell, llvm, translation Problem: Translating G-Machine source to LLVM IR I'm implementing a simple lazy functional language with LLVM as its backend in Haskell. I've read two books writt...

Translating G-Machine source to LLVM IR Translating G-Machine source to LLVM IR compiler-construction haskell llvm translation Translating G-Machine LLVM Translating G-Machine source to LLVM IR I'm implementing a simple lazy functional language with LLVM as its backend in Haskell. I've read two books written by Simon P...

[ -0.0028839111328125, 0.00128173828125, 0.00634765625, 0.01220703125, 0.0234375, 0.01397705078125, -0.003326416015625, -0.033935546875, -0.00145721435546875, -0.04345703125, 0.005584716796875, -0.0145263671875, -0.0002841949462890625, -0.0079345703125, 0.00958251953125, 0.01275634765625...

[ 11062, 143, 1916, 527, 9, 4613, 99326, 31344, 47, 99954, 47599, 32863, 9969, 34759, 238478, 1556, 142508, 96, 3723, 39, 153648, 29479, 8781, 21, 3285, 123309, 46876, 4420, 3611, 20625, 12301, 6626, 42840, 59121, 26328, 129420, 1507, 29304, ...

[ 0.1241455078125, 0.1497802734375, 0.011383056640625, 0.1951904296875, 0.0753173828125, 0.15087890625, 0.20654296875, 0.19287109375, 0.07373046875, 0.1466064453125, 0.27685546875, 0.2298583984375, 0.0831298828125, 0.10699462890625, 0.091064453125, 0.0933837890625, 0.220703125, 0.045...

embed

58559840_c0

58559840

haskell

0

Title: Cabal / Stack ignores ghc-options for custom Setup scripts Problem title: Cabal / Stack ignores ghc-options for custom Setup scripts Tags: haskell, haskell-stack Problem: Cabal / Stack ignores ghc-options for custom Setup scripts I'm trying to get Stack working on an Arch system. I've done the usual: pacman -S g...

Cabal / Stack ignores ghc-options for custom Setup scripts Cabal / Stack ignores ghc-options for custom Setup scripts haskell haskell-stack Cabal Stack Setup config.yaml ghc-8.6.5 StackSetupShim.mainOverride Cabal-2.4.0.1 setup-mPHDZzAJ.hs setup-shim-mPHDZzAJ.hs x86_64-linux tmp-Cabal-simple_mPHDZzAJ_2.4.0.1_ghc-8.6.5 ...

[ 0.005950927734375, 0.0169677734375, 0.00567626953125, -0.004852294921875, -0.0341796875, -0.0177001953125, -0.0159912109375, -0.00653076171875, -0.01068115234375, 0.006195068359375, -0.0174560546875, -0.0142822265625, -0.0019073486328125, 0.005706787109375, -0.01068115234375, 0.03125, ...

[ 30438, 289, 248, 6512, 2594, 124962, 31380, 238, 109585, 114122, 19943, 2037, 26499, 1556, 142508, 590, 153837, 14520, 141, 17376, 136473, 126, 78567, 39, 416, 116591, 102014, 169581, 54259, 80633, 25582, 127, 10706, 15276, 13307, 2397, 6077, ...

[ 0.17431640625, 0.153076171875, 0.052825927734375, 0.178955078125, 0.1612548828125, 0.11962890625, 0.126953125, 0.09210205078125, 0.1575927734375, 0.145751953125, 0.136474609375, 0.07989501953125, 0.1654052734375, 0.0848388671875, 0.15771484375, 0.1480712890625, 0.1353759765625, 0.1...

embed

13126741_c0

13126741

haskell

0

Title: When debugging my State Monad, reverses order depending on where trace is Problem title: When debugging my State Monad, reverses order depending on where trace is Tags: haskell Problem: When debugging my State Monad, reverses order depending on where trace is So I was building a State Monad and ran into some pro...

When debugging my State Monad, reverses order depending on where trace is When debugging my State Monad, reverses order depending on where trace is haskell Control.Monad.State Debug.Trace When State Monad Main cur:xs When debugging my State Monad, reverses order depending on where trace is So I was building a State Mon...

[ -0.00494384765625, 0.0084228515625, 0.0031585693359375, 0.01153564453125, -0.0079345703125, 0.01953125, 0.00830078125, 0.009765625, 0.0029754638671875, -0.0147705078125, 0.0181884765625, 0.030029296875, 0.002593994140625, -0.01190185546875, -0.0023040771484375, 0.00148773193359375, -...

[ 14847, 8, 978, 36659, 22836, 60331, 71, 39531, 5908, 12989, 96819, 7440, 144851, 83, 759, 98, 1556, 142508, 27131, 46674, 712, 135206, 262, 85779, 28542, 329, 12321, 9709, 425, 33976, 44402, 21, 3285, 31425, 7941, 2667, 160404, 20949, 5303,...

[ 0.05938720703125, 0.1317138671875, 0.201904296875, 0.10125732421875, 0.1573486328125, 0.1773681640625, 0.13720703125, 0.18359375, 0.1107177734375, 0.201904296875, 0.1168212890625, 0.086669921875, 0.2352294921875, 0.049835205078125, 0.011688232421875, 0.001312255859375, 0.072326660156...

embed

3676773_c0

3676773

haskell

0

Title: If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? Problem title: If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? Tags: lazy-evaluation, tail-recursion, haskell, recursion Problem: If I have an expression, which ...

If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? If I have an expression, which is partitially evaluable, is it a good idea to avoid tail-recursion? lazy-evaluation tail-recursion haskell recursion Integral Bool If I have an expression, which is partitially evaluable, ...

[ -0.016357421875, 0.004974365234375, 0.0126953125, 0.00025177001953125, 0.0089111328125, 0.0262451171875, -0.00799560546875, -0.0289306640625, 0.0032958984375, -0.0225830078125, 0.0023651123046875, 0.006378173828125, 0.00396728515625, 0.0181884765625, 0.035400390625, -0.01025390625, 0...

[ 765, 125195, 2878, 118, 25958, 159258, 2661, 4127, 6528, 71864, 46741, 107, 48650, 1830, 21, 3285, 1556, 142508, 195625, 204681, 2460, 929, 9, 204629, 27781, 162520, 3917, 32354, 959, 5844, 5809, 33022, 15673, 2685, 33720, 1900, 11400, 4505, ...

[ 0.06494140625, 0.2491455078125, 0.1395263671875, 0.0799560546875, 0.0433349609375, 0.2255859375, 0.1446533203125, 0.091796875, 0.0853271484375, 0.177001953125, 0.25390625, 0.10235595703125, 0.1937255859375, 0.1119384765625, 0.039794921875, 0.1468505859375, 0.1124267578125, 0.231445...

embed

14820699_c0

14820699

haskell

0

Title: Truncating to Word type Problem title: Truncating to Word type Tags: haskell Problem: Truncating to Word type The following code truncates a number of type Double to one in the type Word16 (although I suspect any other word type behaves similarly, I had to choose one for the example). truncate1 :: Double -> Word...

Truncating to Word type Truncating to Word type haskell Truncating Word Double Word16 truncate1 truncate2 Truncating to Word type The following code truncates a number of type Double to one in the type Word16 (although I suspect any other word type behaves similarly, I had to choose one for the example). As you can rea...

[ 0.0020599365234375, -0.03369140625, 0.01068115234375, -0.0164794921875, -0.0004730224609375, -0.003662109375, -0.0169677734375, -0.00469970703125, 0.006927490234375, -0.00958251953125, -0.024658203125, 0.01171875, -0.0037841796875, -0.00592041015625, 0.00799560546875, 0.0166015625, 0...

[ 19419, 16336, 1916, 47, 22543, 10644, 1556, 142508, 107172, 2485, 14617, 19, 33478, 418, 304, 25632, 18151, 14012, 1632, 92610, 2565, 68991, 55076, 27781, 5117, 360, 18, 37702, 240057, 32354, 8951, 120639, 11389, 51339, 5045, 11522, 17932, 12...

[ 0.156494140625, 0.1590576171875, 0.022186279296875, 0.120361328125, 0.1539306640625, 0.21630859375, 0.1041259765625, 0.1710205078125, 0.1361083984375, 0.173583984375, 0.1671142578125, 0.1019287109375, 0.1556396484375, 0.0165863037109375, 0.1090087890625, 0.005401611328125, 0.11682128...

embed

53075768_c1

53075768

haskell

1

Expected type: Sum Int (a0, b0, c0) Actual type: Sum Int Int • In the first argument of ‘functor’, namely ‘trigger’ In the second argument of ‘($)’, namely ‘functor trigger’ In a stmt of a 'do' block: quickBatch $ functor trigger | 100 | quickBatch $ functor trigger | ^^^^^^^ src/eithermonad.hs:101:28: error: • Couldn...

[ -0.017578125, 0.006683349609375, -0.01129150390625, 0.00732421875, -0.00494384765625, 0.00238037109375, -0.006500244140625, 0.005401611328125, 0.00927734375, 0.000774383544921875, -0.028076171875, -0.006378173828125, -0.00063323974609375, -0.01312255859375, 0.005645751953125, -0.019409...

[ 60075, 13, 89829, 10644, 36335, 360, 18, 11, 2389, 876, 501, 77495, 100582, 5117, 10750, 16498, 18770, 110987, 3996, 21407, 17932, 4369, 185553, 6138, 111, 246, 46389, 63773, 571, 257, 206, 3650, 7477, 805, 19437, 9319, 712, 127, 35046, 2...

[ 0.151611328125, 0.15771484375, 0.111328125, 0.2086181640625, 0.21630859375, 0.1575927734375, 0.2037353515625, 0.071533203125, 0.110107421875, 0.0352783203125, 0.012969970703125, 0.11962890625, 0.193115234375, 0.0892333984375, 0.2100830078125, 0.1336669921875, 0.1903076171875, 0.043...

embed

56103618_c0

56103618

haskell

0

Title: recursive selection sort proof of correctness Problem title: recursive selection sort proof of correctness Tags: induction, proof-of-correctness, haskell Problem: recursive selection sort proof of correctness I need to prove that the following selection sort code (in Haskell) is always sorting: import Data.List ...

recursive selection sort proof of correctness recursive selection sort proof of correctness induction proof-of-correctness haskell Data.List Ord recursive selection sort proof of correctness I need to prove that the following selection sort code (in Haskell) is always sorting: We can assume that we have a function call...

[ -0.0206298828125, 0.024658203125, 0.01483154296875, 0.00537109375, -0.0179443359375, -0.0208740234375, -0.0086669921875, -0.0289306640625, 0.0045166015625, 0.01806640625, -0.00142669677734375, 0.0113525390625, -0.022705078125, -0.0032958984375, 0.01385498046875, -0.0064697265625, 0.0...

[ 195625, 5844, 132216, 12096, 98869, 111, 26785, 7432, 23, 77391, 4390, 32399, 15390, 1556, 142508, 11809, 154663, 35379, 3871, 23534, 25632, 18151, 20625, 83, 11343, 214, 831, 41591, 32354, 17497, 71, 12765, 3229, 5303, 22836, 118990, 132, 62...

[ 0.21435546875, 0.1182861328125, 0.1812744140625, 0.1947021484375, 0.169677734375, 0.058349609375, 0.1566162109375, 0.0382080078125, 0.08172607421875, 0.1434326171875, 0.063232421875, 0.083251953125, 0.05224609375, 0.107177734375, 0.2008056640625, 0.05517578125, 0.08172607421875, 0....

embed

5277563_c0

5277563

haskell

0

Title: How to find type signatures of multiple imported methods in GHCI Problem title: How to find type signatures of multiple imported methods in GHCI Tags: haskell, ghci, types Problem: How to find type signatures of multiple imported methods in GHCI I'm using a library, which I've loaded into GHCI. From the names of...

How to find type signatures of multiple imported methods in GHCI How to find type signatures of multiple imported methods in GHCI haskell ghci types How GHCI How to find type signatures of multiple imported methods in GHCI I'm using a library, which I've loaded into GHCI. From the names of the functions is not obvious ...

[ 0.01025390625, -0.00787353515625, -0.017333984375, 0.034423828125, -0.0205078125, -0.0032806396484375, -0.0081787109375, -0.00823974609375, -0.01007080078125, -0.029296875, -0.0021514892578125, -0.055419921875, 0.007415771484375, -0.00004673004150390625, -0.0093994140625, 0.00135040283...

[ 11249, 7413, 10644, 138256, 7, 48716, 76242, 71, 150624, 41877, 17304, 23, 1556, 142508, 31380, 318, 52895, 47, 111, 17368, 35773, 1294, 72367, 32354, 162520, 163, 32316, 3444, 1957, 5303, 19882, 3714, 2046, 756, 31255, 11417, 88996, 20928, ...

[ 0.074951171875, 0.1395263671875, 0.259765625, 0.25732421875, 0.10528564453125, 0.2142333984375, 0.2220458984375, 0.0712890625, 0.1845703125, 0.1610107421875, 0.18603515625, 0.030792236328125, 0.134521484375, 0.221923828125, 0.1317138671875, 0.167236328125, 0.208984375, 0.0012817382...

embed

77922671_c1

77922671

haskell

1

twice should give the original list. propertyReverseTwice :: [Int] -> Bool propertyReverseTwice xs = reverse (reverse xs) == xs -- Property 2: The length of the reversed list should be the same as the original list. propertyReverseLengthFail :: [Int] -> Bool propertyReverseLengthFail xs = length (reverse xs) == length...

[ -0.00701904296875, 0.031982421875, 0.0225830078125, 0.0262451171875, 0.0003376007080078125, 0.0108642578125, 0.0196533203125, -0.00726318359375, 0.00762939453125, 0.0091552734375, -0.002288818359375, 0.04443359375, 0.0157470703125, 0.01153564453125, -0.00726318359375, 0.03076171875, ...

[ 186351, 5608, 8337, 7311, 5303, 57266, 4332, 37676, 618, 2452, 329, 18, 2460, 929, 1022, 7, 39531, 184, 107, 69112, 206984, 15573, 140909, 5281, 5701, 449, 17647, 379, 997, 106, 22408, 106935, 5117, 6626, 183871, 25793, 7568, 30646, 5201, ...

[ 0.2471923828125, 0.072265625, 0.1134033203125, 0.1243896484375, 0.1923828125, 0.21728515625, 0.072509765625, 0.2666015625, 0.0550537109375, 0.22509765625, 0.1507568359375, 0.0252227783203125, 0.070068359375, 0.1351318359375, 0.09716796875, 0.049835205078125, 0.234375, 0.14282226562...

embed

69184999_c0

69184999

haskell

0

Title: How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? Problem title: How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? Tags: haskell Problem: How to use Atomics Counter for counting operation order...

How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? How to use Atomics Counter for counting operation order of randomly occuring operations on different threads? haskell How Atomics Counter IORef How to use Atomics Counter for counting operation order of randoml...

[ -0.0032806396484375, -0.00909423828125, 0.003875732421875, 0.01153564453125, 0.0133056640625, 0.01080322265625, 0.00750732421875, 0.007659912109375, -0.005584716796875, -0.03662109375, 0.0052490234375, -0.006744384765625, 0.0272216796875, 0.00665283203125, 0.0164794921875, -0.007598876...

[ 11249, 4527, 69728, 28021, 197956, 100, 54529, 214, 41018, 12989, 96759, 74918, 12921, 86997, 1556, 142508, 123435, 4240, 1884, 11907, 1733, 28412, 61972, 114419, 105416, 63284, 11737, 221419, 22631, 11343, 765, 26785, 7722, 1543, 36880, 48716, ...

[ 0.09588623046875, 0.1490478515625, 0.1966552734375, 0.1898193359375, 0.284912109375, 0.02362060546875, 0.1632080078125, 0.0472412109375, 0.190185546875, 0.2103271484375, 0.148193359375, 0.1302490234375, 0.1710205078125, 0.210693359375, 0.093017578125, 0.2010498046875, 0.1336669921875...

embed

78281251_c0

78281251

haskell

0

Title: Example of Massiv Multidimensional Array from a lazy ByteString? Problem title: Example of Massiv Multidimensional Array from a lazy ByteString? Tags: haskell, massiv, arrays, bytestring Problem: Example of Massiv Multidimensional Array from a lazy ByteString? I'm working with large data arrays in the sciences, ...

Example of Massiv Multidimensional Array from a lazy ByteString? Example of Massiv Multidimensional Array from a lazy ByteString? haskell massiv arrays bytestring a Example Massiv Multidimensional Array ByteString BL.readFile myfile.fits Ix2 Float Data.Massiv.Vector Example of Massiv Multidimensional Array from a lazy ...

[ 0.025390625, 0.0162353515625, -0.0162353515625, 0.0218505859375, 0.00518798828125, 0.0205078125, 0.018798828125, 0.00104522705078125, 0.01116943359375, -0.04345703125, -0.001556396484375, -0.0242919921875, -0.0111083984375, 0.00634765625, -0.0157470703125, 0.013916015625, -0.01000976...

[ 89536, 8705, 74227, 4371, 19335, 157955, 69253, 53, 1295, 21, 3285, 3311, 67, 71713, 214, 1556, 142508, 127123, 10298, 4778, 390, 91693, 68170, 39116, 174350, 759, 29822, 16086, 87, 425, 304, 38699, 257, 11809, 53049, 7, 26455, 18770, 20697...

[ 0.1622314453125, 0.0706787109375, 0.1080322265625, 0.2529296875, 0.1240234375, 0.1790771484375, 0.177978515625, 0.141845703125, 0.085205078125, 0.1092529296875, 0.1614990234375, 0.0999755859375, 0.12451171875, 0.1951904296875, 0.08905029296875, 0.08074951171875, 0.2039794921875, 0....

embed

10593435_c1

10593435

haskell

1

zipWith (+) r1 r2 where r1 = map (*z0) $ fromJust (IntMap.lookup a arr) r2 = map (*(1-z0)) $ fromJust (IntMap.lookup b arr) let logA = if val > 0 then 0 else val where val = logP_proposal + logL_proposal - (lp `index` (a - 1)) - (ll `index` (a - 1)) + ((fromIntegral n - 1) * log z0) logP_proposal = logPrior proposal l...

[ -0.005340576171875, 0.01055908203125, -0.0225830078125, -0.007293701171875, -0.01171875, -0.0010223388671875, -0.0045166015625, -0.0133056640625, 0.010498046875, -0.01129150390625, 0.0166015625, 0.047607421875, -0.00830078125, -0.0140380859375, 0.017822265625, -0.0189208984375, -0.00...

[ 68330, 194583, 22183, 1690, 418, 304, 7440, 22288, 169, 77495, 3650, 1295, 127794, 4153, 18, 166179, 64747, 187, 42, 2203, 2633, 12684, 284, 2174, 3502, 977, 757, 7068, 37076, 683, 189461, 997, 866, 26775, 4711, 1181, 161063, 67, 33163, 1...

[ 0.275146484375, 0.271484375, 0.2430419921875, 0.1058349609375, 0.08856201171875, 0.1612548828125, 0.043792724609375, 0.1510009765625, 0.034912109375, 0.0908203125, 0.079833984375, 0.1177978515625, 0.15478515625, 0.028594970703125, 0.08172607421875, 0.195556640625, 0.0650634765625, ...

embed

25803632_c0

25803632

haskell

0

Title: Cabal: where does `cabal update` store its package list? Problem title: Cabal: where does `cabal update` store its package list? Tags: haskell, cabal Problem: Cabal: where does `cabal update` store its package list? (I'm on OS X 10.9) I run this: $ cabal update $ cabal install haskell-platform cabal: There is no...

Cabal: where does `cabal update` store its package list? Cabal: where does `cabal update` store its package list? haskell cabal Cabal There You Users Library Frameworks GHC.framework HaskellPlatform.framework Haskell man1 ghc.1 org.haskell.HaskellPlatform GHC HaskellPlatform Cabal: where does `cabal update` store its p...

[ 0.014404296875, 0.011962890625, 0.015869140625, 0.01116943359375, -0.00445556640625, 0.02490234375, -0.0031890869140625, 0.0164794921875, 0.0167236328125, 0.026123046875, 0.00077056884765625, -0.03173828125, -0.00238037109375, -0.0294189453125, 0.007232666015625, 0.0031890869140625, ...

[ 30438, 289, 7440, 14602, 408, 3571, 28350, 4343, 98169, 5303, 6863, 1556, 142508, 109524, 8622, 2583, 53400, 103835, 202220, 527, 73265, 160328, 18244, 20625, 117231, 5037, 332, 418, 31380, 238, 30910, 10557, 6495, 7, 11787, 1193, 4068, 1126,...

[ 0.2103271484375, 0.219970703125, 0.130126953125, 0.037445068359375, 0.15966796875, 0.2445068359375, 0.2156982421875, 0.1951904296875, 0.228759765625, 0.1871337890625, 0.050384521484375, 0.1134033203125, 0.2440185546875, 0.27490234375, 0.1162109375, 0.1090087890625, 0.12548828125, 0...

embed

26846708_c0

26846708

haskell

0

Title: Failed to install http-conduit-1.9.6 Problem title: Failed to install http-conduit-1.9.6 Tags: haskell, http-conduit, network-programming Problem: Failed to install http-conduit-1.9.6 I'm trying to install http-conduit-1.9.6, and running cabal install http-conduit-1.9.6 gives me the following error: Network/HTTP...

Failed to install http-conduit-1.9.6 Failed to install http-conduit-1.9.6 haskell http-conduit network-programming Failed http-conduit-1.9.6 Network HTTP Conduit Request.hs:43:8 Could Network.URI network-2.5.0.0 Perhaps network-2.4.1.2 Use World Error ExitFailure package.conf.d x86_64-linux-7.6.3 network-2.6.0.2 Failed...

[ -0.00921630859375, 0.01165771484375, 0.016357421875, 0.0208740234375, -0.0035400390625, -0.0079345703125, -0.018798828125, -0.01080322265625, -0.0005340576171875, 0.00408935546875, 0.0028228759765625, -0.05419921875, -0.004486083984375, -0.0150146484375, -0.005279541015625, -0.00683593...

[ 190355, 297, 20600, 1621, 2271, 112061, 5759, 201464, 1556, 142508, 33120, 28966, 28997, 135913, 1657, 75616, 127, 33210, 1019, 191147, 46492, 48413, 5, 99929, 181799, 116591, 48400, 36836, 6661, 212059, 5443, 217, 17647, 379, 98169, 70547, 152...

[ 0.21044921875, 0.059112548828125, 0.185546875, 0.2144775390625, 0.120361328125, 0.2235107421875, 0.0914306640625, 0.27783203125, 0.1298828125, 0.25048828125, 0.14892578125, 0.0726318359375, 0.1190185546875, 0.178955078125, 0.1129150390625, 0.0997314453125, 0.042510986328125, 0.0949...

embed

71993568_c0

71993568

haskell

0

Title: Avoiding conflicting entries in Haskell associative list Problem title: Avoiding conflicting entries in Haskell associative list Tags: haskell Problem: Avoiding conflicting entries in Haskell associative list I have the following associative list: myList :: [(myConcept, String)] myList = [ (myInput, "get_input")...

Avoiding conflicting entries in Haskell associative list Avoiding conflicting entries in Haskell associative list haskell Avoiding Haskell get_input get_output get_values Data Bool x:xs Avoiding conflicting entries in Haskell associative list I have the following associative list: I want to ensure that the list does no...

[ -0.00032806396484375, 0.007415771484375, -0.0022735595703125, -0.0106201171875, -0.005126953125, -0.029541015625, 0.0035247802734375, 0.00262451171875, 0.01385498046875, 0.00701904296875, 0.017333984375, 0.016845703125, 0.031494140625, -0.00213623046875, -0.00191497802734375, 0.0109863...

[ 84361, 86675, 79612, 214, 112820, 90, 20625, 142508, 166027, 272, 5303, 1556, 2046, 73, 6056, 27494, 11809, 2460, 929, 1022, 425, 23, 25632, 3444, 63284, 959, 2499, 49814, 7722, 42719, 759, 11935, 19462, 23351, 71864, 32354, 56282, 22799, 1...

[ 0.1964111328125, 0.02935791015625, 0.2242431640625, 0.129638671875, 0.1856689453125, 0.040618896484375, 0.1273193359375, 0.2193603515625, 0.1649169921875, 0.0972900390625, 0.1854248046875, 0.1064453125, 0.030364990234375, 0.014892578125, 0.051727294921875, 0.079345703125, 0.037536621...

embed

8172548_c0

8172548

haskell

0

Title: Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? Problem title: Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? Tags: haskell, pattern-matching Problem: Is it possible to export constructors for pat...

Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? Is it possible to export constructors for pattern matching, but not for construction, in Haskell Modules? haskell pattern-matching Haskell Modules Is it possible to export constructors for pattern matching, but not...

[ 0.0002803802490234375, 0.0106201171875, -0.0017242431640625, 0.0135498046875, -0.005523681640625, 0.0103759765625, -0.00775146484375, 0.004974365234375, -0.002471923828125, -0.009033203125, -0.00909423828125, -0.01153564453125, 0.008544921875, 0.01434326171875, -0.008056640625, -0.0057...

[ 7722, 31255, 64549, 25251, 100, 103510, 14858, 1284, 959, 50961, 20625, 142508, 63014, 214, 23, 1556, 98753, 131, 2298, 2053, 10644, 45234, 707, 1286, 11301, 6626, 31486, 125195, 8060, 39864, 6863, 32354, 10750, 27169, 47, 83425, 52895, 88996...

[ 0.1475830078125, 0.2381591796875, 0.2047119140625, 0.1739501953125, 0.03594970703125, 0.1939697265625, 0.1875, 0.049468994140625, 0.0811767578125, 0.181884765625, 0.123291015625, 0.2249755859375, 0.1728515625, 0.055145263671875, 0.0313720703125, 0.07049560546875, 0.1673583984375, 0...

embed

907306_c0

907306

haskell

0

Title: Confusion about currying and point free style in Haskell Problem title: Confusion about currying and point free style in Haskell Tags: currying, pointfree, haskell Problem: Confusion about currying and point free style in Haskell I was trying to implement the function every :: (a -> IO Bool) -> [a] -> IO Bool wh...

Confusion about currying and point free style in Haskell Confusion about currying and point free style in Haskell currying pointfree haskell Confusion Haskell Bool Compiling Main stk.hs stk.hs:53:42 Couldn Failed Confusion about currying and point free style in Haskell I was trying to implement the function which was t...

[ 0.0054931640625, 0.0093994140625, -0.00144195556640625, -0.003753662109375, 0.00081634521484375, 0.01416015625, 0.0186767578125, -0.01190185546875, 0.0172119140625, -0.03515625, -0.007080078125, -0.027587890625, -0.003631591796875, 0.0033721923828125, -0.00634765625, 0.0008621215820312...

[ 92105, 198555, 214, 6275, 4092, 20623, 20625, 142508, 32087, 1556, 2460, 929, 15612, 49725, 12321, 55188, 127, 191147, 190355, 1657, 136, 29479, 32354, 37842, 15490, 143726, 195625, 18151, 18, 4488, 21, 3285, 56065, 110, 965, 16610, 21185, 10...

[ 0.15283203125, 0.2362060546875, 0.152099609375, 0.165771484375, 0.166748046875, 0.203369140625, 0.1302490234375, 0.236328125, 0.1971435546875, 0.123046875, 0.05352783203125, 0.144775390625, 0.0241851806640625, 0.019073486328125, 0.041168212890625, 0.0643310546875, 0.034393310546875, ...

embed

61440490_c0

61440490

haskell

0

Title: Using a typeclass for variadic argument pattern in Haskell Problem title: Using a typeclass for variadic argument pattern in Haskell Tags: recursion, typeclass, haskell Problem: Using a typeclass for variadic argument pattern in Haskell Let's say I have a convention in Haskell where I define a series of function...

Using a typeclass for variadic argument pattern in Haskell Using a typeclass for variadic argument pattern in Haskell recursion typeclass haskell Using Haskell Node MkNode NAble Using a typeclass for variadic argument pattern in Haskell Let's say I have a convention in Haskell where I define a series of functions like ...

[ -0.017578125, 0.002471923828125, -0.015380859375, 0.006561279296875, 0.005218505859375, 0.013427734375, -0.019287109375, 0.00811767578125, 0.0084228515625, -0.038330078125, -0.004730224609375, -0.040771484375, -0.01214599609375, 0.0031890869140625, 0.00872802734375, -0.0157470703125, ...

[ 345, 10644, 67413, 100, 16757, 18403, 10750, 103510, 20625, 142508, 195625, 1830, 1556, 438, 112, 92, 5021, 3076, 2661, 101805, 61924, 36549, 32354, 1884, 903, 4263, 7722, 5161, 91, 19, 51776, 77336, 14012, 11343, 678, 51592, 8108, 17368, 2...

[ 0.044464111328125, 0.209716796875, 0.297119140625, 0.008636474609375, 0.2408447265625, 0.107421875, 0.2308349609375, 0.22314453125, 0.1162109375, 0.2200927734375, 0.2039794921875, 0.01263427734375, 0.1007080078125, 0.0784912109375, 0.060699462890625, 0.0299072265625, 0.1173095703125,...

embed

16116313_c0

16116313

haskell

0

Title: How best to type "Any monad transformer stack containing m" Problem title: How best to type "Any monad transformer stack containing m" Tags: monad-transformers, haskell Problem: How best to type "Any monad transformer stack containing m" I'd like to write the function fixProxy :: (Monad m, Pr...

How best to type "Any monad transformer stack containing m" How best to type "Any monad transformer stack containing m" monad-transformers haskell How Any Monad Proxy Num RandomSource MonadRandom WriterT RVarT Data.Random.Lift.Lift Lift RVar StdUniform How best to type "Any monad transformer stack c...

[ 0.00087738037109375, 0.0223388671875, 0.0033416748046875, -0.0162353515625, 0.0245361328125, -0.0089111328125, -0.003326416015625, -0.02490234375, 0.006011962890625, -0.033935546875, 0.0277099609375, 0.00099945068359375, 0.007171630859375, -0.003631591796875, 0.0234375, -0.000926971435...

[ 11249, 2965, 10644, 299, 2667, 712, 27198, 56, 177261, 70541, 347, 214, 215175, 1314, 1556, 142508, 28541, 60331, 71, 1250, 50878, 52782, 39643, 211235, 126525, 3815, 2783, 618, 627, 81827, 11809, 9506, 2480, 166562, 2907, 85600, 5037, 33022,...

[ 0.00634765625, 0.111572265625, 0.2353515625, 0.10595703125, 0.1103515625, 0.1524658203125, 0.19384765625, 0.08966064453125, 0.1763916015625, 0.115234375, 0.1673583984375, 0.0243072509765625, 0.1800537109375, 0.0723876953125, 0.031463623046875, 0.1607666015625, 0.0916748046875, 0.11...

embed

25831370_c0

25831370

haskell

0

Title: Understanding Wikipedia's example of Haskell's Maybe monad Problem title: Understanding Wikipedia's example of Haskell's Maybe monad Tags: haskell, option-type, monads Problem: Understanding Wikipedia's example of Haskell's Maybe monad I think I understand the monad concept in Haskell, i.e., ...

Understanding Wikipedia's example of Haskell's Maybe monad Understanding Wikipedia's example of Haskell's Maybe monad haskell option-type monads Understanding Wikipedia Haskell Maybe Adds Nothing Extracts Wraps Just Then What Understanding Wikipedia's example of Haskell's Maybe monad I think I under...

[ -0.0029754638671875, 0.002349853515625, 0.035400390625, 0.0113525390625, 0.007659912109375, 0.0216064453125, 0.017578125, -0.01202392578125, 0.002471923828125, -0.000629425048828125, 0.0157470703125, -0.01708984375, -0.0186767578125, 0.0009002685546875, 0.00787353515625, -0.00071716308...

[ 9626, 144057, 8162, 3768, 27781, 20625, 142508, 83425, 2667, 712, 1556, 35829, 50986, 29117, 182747, 31501, 13631, 9563, 28219, 23755, 31486, 6396, 1369, 136, 30646, 10176, 55681, 6002, 86531, 38415, 2856, 78091, 32354, 12989, 219836, 4347, 356...

[ 0.07666015625, 0.052398681640625, 0.1710205078125, 0.042572021484375, 0.178955078125, 0.12158203125, 0.2470703125, 0.2275390625, 0.1611328125, 0.225341796875, 0.0784912109375, 0.1663818359375, 0.09893798828125, 0.1036376953125, 0.1444091796875, 0.1363525390625, 0.164794921875, 0.05...

embed

37310232_c0

37310232

haskell

0

Title: How to resolve issue with building stream-fusion Problem title: How to resolve issue with building stream-fusion Tags: haskell Problem: How to resolve issue with building stream-fusion I'm trying to bring in the stream-fusion library into my project. I am using Stack (LTS 5.16). I added the stream-fusion-0.1.2.5...

How to resolve issue with building stream-fusion How to resolve issue with building stream-fusion haskell of module How stream-fusion-0.1.2.5 While Users x86_64-osx setup-Simple-Cabal-1.22.5.0-ghc-7.10.3 Cabal-1.22.5.0 Process ExitFailure Logs Haskell stream-fusion-0.1.2.5.log Configuring Building Preprocessing Compili...

[ -0.0230712890625, 0.00811767578125, 0.00946044921875, -0.02099609375, -0.00775146484375, -0.0169677734375, -0.01519775390625, -0.0291748046875, -0.00860595703125, 0.01153564453125, 0.00634765625, -0.03173828125, 0.0145263671875, 0.01416015625, 0.016845703125, -0.00518798828125, -0.00...

[ 11249, 47, 103608, 31089, 678, 33976, 75973, 9, 92105, 1556, 142508, 111, 88996, 102014, 5, 48413, 53400, 15276, 13307, 232, 425, 169581, 8859, 33209, 20370, 3571, 4015, 187461, 10179, 30438, 289, 123996, 5443, 17647, 379, 13146, 20625, 4867,...

[ 0.07470703125, 0.0155792236328125, 0.2255859375, 0.1680908203125, 0.042266845703125, 0.2103271484375, 0.2158203125, 0.0304107666015625, 0.285400390625, 0.1441650390625, 0.260009765625, 0.031280517578125, 0.1947021484375, 0.1644287109375, 0.03839111328125, 0.25146484375, 0.05633544921...

embed

26502434_c0

26502434

haskell

0

Title: How to test the homomorphism law of an Applicative instance? Problem title: How to test the homomorphism law of an Applicative instance? Tags: homomorphism, proof, typeclass, haskell, applicative Problem: How to test the homomorphism law of an Applicative instance? I'm doing the exercises from Typeclassopedia ; ...

How to test the homomorphism law of an Applicative instance? How to test the homomorphism law of an Applicative instance? homomorphism proof typeclass haskell applicative How Applicative ZipList MZipList Show Functor Main How to test the homomorphism law of an Applicative instance? I'm doing the exercises from Typeclas...

[ 0.00130462646484375, 0.0068359375, 0.00173187255859375, 0.0194091796875, -0.0167236328125, 0.0380859375, 0.0006866455078125, -0.00408935546875, -0.00135040283203125, -0.01806640625, 0.008544921875, -0.0284423828125, -0.00640869140625, 0.014404296875, -0.00127410888671875, -0.0047607421...

[ 11249, 3034, 12840, 178851, 8780, 27165, 5659, 11048, 4935, 110527, 47, 98869, 10644, 67413, 1556, 142508, 41816, 162150, 154663, 119114, 3442, 17367, 28670, 18770, 12321, 70, 81979, 60457, 76994, 33022, 34166, 32354, 12765, 28960, 36293, 182324,...

[ 0.07000732421875, 0.2529296875, 0.2486572265625, 0.2490234375, 0.108642578125, 0.181396484375, 0.13720703125, 0.172607421875, 0.16357421875, 0.1953125, 0.048980712890625, 0.1202392578125, 0.10479736328125, 0.14892578125, 0.07293701171875, 0.1781005859375, 0.13671875, 0.177368164062...

embed

77999890_c2

77999890

haskell

2

] fail (backjumping, conflict set: diagrams-cairo, pango)\nAfter searching the rest of the dependency tree exhaustively, these were the\ngoals I've had most trouble fulfilling: base, pango, diagrams-cairo,\nyampa-gloss, yampa-gloss:examples\nTry running with --minimize-conflict-set to improve the error message.\n\n" ]}...

[ -0.0126953125, -0.000682830810546875, 0.019775390625, 0.0299072265625, 0.000972747802734375, -0.0034637451171875, -0.00750732421875, -0.0020599365234375, -0.00946044921875, 0.05224609375, 0.017578125, -0.015869140625, 0.01275634765625, -0.0146484375, 0.001983642578125, 0.0147705078125,...

[ 10114, 35782, 12620, 461, 44287, 79612, 5423, 117233, 7, 102241, 31, 8743, 157318, 42548, 27771, 53201, 146353, 19120, 16765, 2684, 63134, 211394, 3647, 273, 15293, 38869, 151, 302, 1294, 51042, 678, 4210, 1249, 77651, 2271, 134225, 3509, 522...

[ 0.02923583984375, 0.2379150390625, 0.140380859375, 0.1766357421875, 0.1519775390625, 0.259521484375, 0.1422119140625, 0.18115234375, 0.02874755859375, 0.1102294921875, 0.2208251953125, 0.18115234375, 0.000152587890625, 0.20947265625, 0.06964111328125, 0.1451416015625, 0.0045776367187...

embed

66290022_c0

66290022

haskell

0

Title: What are the correct type annotations for a function to find prime numbers using square root? Problem title: What are the correct type annotations for a function to find prime numbers using square root? Tags: haskell Problem: What are the correct type annotations for a function to find prime numbers using square...

What are the correct type annotations for a function to find prime numbers using square root? What are the correct type annotations for a function to find prime numbers using square root? haskell square a being What Ambiguous Show Probable These Ordering Defined GHC.Show Integer Maybe What are the correct type annotati...

[ -0.01483154296875, 0.003387451171875, 0.023193359375, 0.01470947265625, 0.0169677734375, -0.00384521484375, 0.00927734375, -0.0166015625, -0.006988525390625, 0.00518798828125, 0.004119873046875, -0.0284423828125, 0.0005645751953125, -0.0166015625, -0.021240234375, -0.0020294189453125, ...

[ 26785, 10644, 8668, 22062, 32354, 7413, 20809, 101935, 17368, 108047, 74855, 1556, 142508, 10, 8035, 4865, 10250, 12282, 10821, 17367, 1250, 275, 2886, 32255, 81206, 5983, 527, 73265, 168660, 44401, 83425, 52295, 71924, 1733, 175199, 36766, 140...

[ 0.1324462890625, 0.207763671875, 0.1611328125, 0.1119384765625, 0.17578125, 0.118896484375, 0.2138671875, 0.17431640625, 0.0703125, 0.1783447265625, 0.2353515625, 0.11328125, 0.2298583984375, 0.0498046875, 0.2139892578125, 0.001190185546875, 0.058349609375, 0.1234130859375, 0.016...

embed

32724130_c1

32724130

haskell

1

0, base-4.2.0.2, base-4.2.0.1, base-4.2.0.0, base-4.1.0.0, base-4.0.0.0, base-3.0.3.2, base-3.0.3.1 (constraint from non-upgradeable package requires installed instance) Dependency tree exhaustively searched. Note: when using a sandbox, all packages are required to have consistent dependencies. Try reinstalling/unregis...

[ -0.006378173828125, -0.003143310546875, 0.022216796875, 0.002227783203125, -0.0045166015625, 0.01214599609375, -0.010986328125, -0.0018768310546875, 0.004180908203125, 0.041748046875, 0.0079345703125, -0.01397705078125, 0.0147705078125, 0.01104736328125, 0.0164794921875, 0.011962890625...

[ 757, 3647, 117904, 5, 133684, 102014, 99929, 9, 120518, 151152, 4, 132265, 107033, 97109, 2271, 2816, 351, 2037, 44286, 2886, 98169, 144570, 20600, 297, 110527, 262, 26885, 27771, 53201, 146353, 5844, 538, 33938, 18622, 17368, 19096, 11728, 7...

[ 0.1275634765625, 0.2078857421875, 0.2088623046875, 0.0655517578125, 0.173828125, 0.150146484375, 0.1793212890625, 0.0245819091796875, 0.2054443359375, 0.1990966796875, 0.0042724609375, 0.155029296875, 0.1435546875, 0.155517578125, 0.0287933349609375, 0.1475830078125, 0.1080322265625,...

embed

25347542_c0

25347542

haskell

0

Title: Typeclass for list <-> tuple conversion Problem title: Typeclass for list <-> tuple conversion Tags: haskell, typeclass Problem: Typeclass for list <-> tuple conversion I have a set of functions to convert between tuples and lists: pack2 :: [a] -> (a, a) pack2 (a:b:_) = (a, b) unpack2 :: (a, a) -> [a...

Typeclass for list <-> tuple conversion Typeclass for list <-> tuple conversion haskell typeclass the Typeclass pack2 a:b:_ unpack2 pack3 a:b:c:_ unpack3 Pack MultiParamTypeClasses FlexibleInstances Could Num When Probable Typeclass for list <-> tuple conversion I have a set of functions to convert between ...

[ 0.00634765625, 0.003875732421875, 0.007537841796875, 0.0103759765625, -0.01055908203125, 0.02294921875, 0.002349853515625, -0.006927490234375, 0.01373291015625, 0.01416015625, -0.00927734375, -0.0093994140625, 0.001220703125, 0.0157470703125, -0.02587890625, 0.00958251953125, 0.00337...

[ 60457, 67413, 100, 5303, 5386, 370, 8705, 142477, 1556, 142508, 10644, 43824, 304, 51, 29102, 363, 56607, 19335, 55292, 196707, 140803, 180842, 2661, 116071, 191147, 52782, 14847, 1250, 275, 2886, 5423, 32354, 96760, 17721, 99726, 136, 3444, ...

[ 0.2086181640625, 0.29541015625, 0.05999755859375, 0.2197265625, 0.0615234375, 0.1329345703125, 0.20263671875, 0.18310546875, 0.1212158203125, 0.2132568359375, 0.1585693359375, 0.140869140625, 0.045562744140625, 0.041290283203125, 0.155029296875, 0.071044921875, 0.1143798828125, 0.1...

embed

27470887_c0

27470887

haskell

0

Title: Sorting records by dates represented as tuples Problem title: Sorting records by dates represented as tuples Tags: quicksort, haskell Problem: Sorting records by dates represented as tuples I am trying to make a function that sorts a List of Person (which is a tuple of (Name, Date), whereby date is a tuple of (I...

Sorting records by dates represented as tuples Sorting records by dates represented as tuples quicksort haskell Sorting Person x:xs x:y:xs y:xs Sorting records by dates represented as tuples I am trying to make a function that sorts a List of Person (which is a tuple of (Name, Date), whereby date is a tuple of (Int, In...

[ -0.00098419189453125, -0.0103759765625, 0.0054931640625, -0.000031948089599609375, -0.02734375, 0.003662109375, -0.030517578125, 0.0167236328125, 0.00433349609375, 0.01171875, -0.017822265625, 0.017333984375, 0.00089263916015625, -0.0067138671875, 0.0023651123046875, -0.01611328125, ...

[ 53666, 214, 115923, 390, 112474, 33636, 237, 370, 99726, 63773, 62351, 1556, 142508, 15270, 1022, 425, 113, 31577, 32354, 12096, 7, 32036, 111, 8705, 163612, 25512, 5622, 18, 15236, 24057, 25590, 108354, 10176, 2046, 20800, 4216, 2208, 919, ...

[ 0.216796875, 0.0501708984375, 0.17236328125, 0.09442138671875, 0.160888671875, 0.1949462890625, 0.0865478515625, 0.1256103515625, 0.2196044921875, 0.1329345703125, 0.244384765625, 0.1055908203125, 0.203369140625, 0.1373291015625, 0.024505615234375, 0.03240966796875, 0.033843994140625...

embed

12133932_c0

12133932

haskell

0

Title: Numbers as multiplicative functions (weird but entertaining) Problem title: Numbers as multiplicative functions (weird but entertaining) Tags: haskell Problem: Numbers as multiplicative functions (weird but entertaining) In the comments of the question Tacit function composition in Haskell , people mentioned mak...

Numbers as multiplicative functions (weird but entertaining) Numbers as multiplicative functions (weird but entertaining) haskell Control.Applicative Numbers Num LANGUAGE TypeFamilies Show GHC Haskell liftA2 Main Numbers as multiplicative functions (weird but entertaining) In the comments of the question Tacit function...

[ -0.0169677734375, -0.0008697509765625, 0.0120849609375, 0.0103759765625, 0.003814697265625, 0.0211181640625, 0.0096435546875, -0.0087890625, 0.004486083984375, -0.0296630859375, -0.0198974609375, 0.004913330078125, 0.01171875, 0.011474609375, -0.00543212890625, -0.0125732421875, -0.0...

[ 103332, 7, 237, 127664, 4935, 32354, 1177, 82249, 1284, 187507, 214, 1556, 142508, 27131, 39179, 11048, 52782, 98064, 60457, 1191, 17367, 527, 73265, 20625, 60520, 284, 304, 12321, 24626, 1218, 12645, 166577, 20662, 110527, 100, 10, 33079, 16...

[ 0.1920166015625, 0.0406494140625, 0.1279296875, 0.2083740234375, 0.125, 0.19140625, 0.045013427734375, 0.160888671875, 0.112548828125, 0.207275390625, 0.1121826171875, 0.125, 0.2315673828125, 0.1678466796875, 0.07855224609375, 0.1519775390625, 0.2230224609375, 0.072021484375, 0.0...

embed

65540771_c1

65540771

haskell

1

-0.1.0.0\doc\html\testcabal1\testcabal1.haddock doesn't exist or isn't a file testcabal1-0.1.0.0: Warning: haddock-html: C:\projects\haskell\testcabal1\dist-newstyle\build\x86_64-windows\ghc-8.10.2\testcabal1-0.1.0.0\doc\html\testcabal1 doesn't exist or isn't a directory testcabal1-0.1.0.0: library-dirs: Files\Haskell ...

[ 0.006072998046875, -0.0023956298828125, 0.01116943359375, 0.002349853515625, -0.0052490234375, 0.00408935546875, -0.0272216796875, -0.0037078857421875, -0.00958251953125, 0.031494140625, -0.005859375, -0.03466796875, -0.01336669921875, -0.0023345947265625, 0.00732421875, -0.00720214843...

[ 20, 102014, 99929, 29713, 7693, 6954, 408, 3571, 418, 5, 8408, 138414, 22027, 18, 32316, 707, 56112, 11435, 3034, 180033, 22892, 5550, 592, 1902, 313, 12, 95322, 10557, 142508, 46295, 54936, 40946, 177149, 15276, 13307, 229792, 9486, 238, 1...

[ 0.0037841796875, 0.14404296875, 0.175048828125, 0.151123046875, 0.1988525390625, 0.253662109375, 0.155029296875, 0.26220703125, 0.1553955078125, 0.01959228515625, 0.1964111328125, 0.306640625, 0.04608154296875, 0.0888671875, 0.212890625, 0.030609130859375, 0.056884765625, 0.1950683...

embed

58465452_c0

58465452

haskell

0

Title: Return the first iteration of a sequence from a list in Haskell Problem title: Return the first iteration of a sequence from a list in Haskell Tags: functional-programming, haskell, math Problem: Return the first iteration of a sequence from a list in Haskell I have an array of sequences, with infinite iteration...

Return the first iteration of a sequence from a list in Haskell Return the first iteration of a sequence from a list in Haskell functional-programming haskell math a Haskell Integral Return the first iteration of a sequence from a list in Haskell I have an array of sequences, with infinite iterations (e.g. [6,6,6,6,6] ...

[ -0.0057373046875, 0.006378173828125, -0.01116943359375, 0.00872802734375, -0.01434326171875, -0.000644683837890625, 0.018310546875, 0.01275634765625, -0.0218505859375, -0.041015625, -0.0008392333984375, 0.0224609375, -0.0076904296875, 0.02978515625, 0.01190185546875, -0.0113525390625, ...

[ 173340, 5117, 17, 720, 2320, 40, 944, 3956, 1295, 5303, 20625, 142508, 23, 123309, 28966, 1556, 48909, 204681, 10298, 26513, 678, 54241, 910, 140447, 3742, 744, 24645, 138, 201, 11249, 8560, 67, 8305, 12638, 6044, 30646, 4734, 7225, 36917, ...

[ 0.212646484375, 0.1964111328125, 0.106689453125, 0.263671875, 0.1112060546875, 0.08209228515625, 0.139892578125, 0.056976318359375, 0.094482421875, 0.21826171875, 0.1611328125, 0.242431640625, 0.02886962890625, 0.1087646484375, 0.04736328125, 0.1390380859375, 0.0687255859375, 0.135...

embed

24973253_c0

24973253

haskell

0

Title: Trying to get rid of nested expressions Problem title: Trying to get rid of nested expressions Tags: haskell Problem: Trying to get rid of nested expressions I have a yaml file: base123: key1: "key1" key2: "key2" key3: "key3" and code which is suppoused to read all 3 values from it: read123 :: IO (String, String...

Trying to get rid of nested expressions Trying to get rid of nested expressions haskell Trying base123 key1 key2 key3 read123 Y.decodeFile config.yml Maybe Y.Value Just res1 Object res2 LHashMap.lookup res3 Nothing error123 Couldn Expected Value Actual Trying to get rid of nested expressions I have a yaml file: and cod...

[ -0.01153564453125, -0.0093994140625, -0.006378173828125, -0.005157470703125, 0.038330078125, 0.000537872314453125, 0.00186920166015625, -0.02392578125, -0.004119873046875, -0.002593994140625, 0.0009002685546875, -0.009765625, -0.01165771484375, -0.01611328125, 0.0126953125, -0.00683593...

[ 40858, 2046, 31351, 8512, 71, 125195, 111, 1556, 142508, 3647, 48636, 22799, 363, 12301, 990, 112, 40899, 174350, 153837, 53, 7237, 856, 50770, 3332, 134549, 6495, 1495, 166179, 64747, 182747, 18499, 191147, 60075, 13, 190060, 100582, 151, 11...

[ 0.07373046875, 0.059234619140625, 0.151123046875, 0.26123046875, 0.1617431640625, 0.2322998046875, 0.0340576171875, 0.120361328125, 0.19580078125, 0.1324462890625, 0.1783447265625, 0.12841796875, 0.057952880859375, 0.135009765625, 0.09765625, 0.1134033203125, 0.1248779296875, 0.065...

embed

49912173_c0

49912173

haskell

0

Title: Is it possible to compute with high accuracy if a series converges using Haskell? Problem title: Is it possible to compute with high accuracy if a series converges using Haskell? Tags: haskell, math, functional-programming Problem: Is it possible to compute with high accuracy if a series converges using Haskell?...

Is it possible to compute with high accuracy if a series converges using Haskell? Is it possible to compute with high accuracy if a series converges using Haskell? haskell math functional-programming Haskell Expr Bool Map.fromList Is it possible to compute with high accuracy if a series converges using Haskell? I am tr...

[ -0.017822265625, -0.00008535385131835938, -0.002227783203125, 0.005767822265625, -0.009521484375, 0.01708984375, -0.0027923583984375, 0.01611328125, 0.01007080078125, -0.00506591796875, 0.0011444091796875, 0.023681640625, -0.005157470703125, -0.007720947265625, -0.00885009765625, 0.013...

[ 2071, 442, 7722, 9969, 6743, 678, 11192, 61689, 219, 2408, 2174, 36549, 158, 74789, 7, 17368, 20625, 142508, 10, 1556, 48909, 123309, 28966, 60075, 42, 2460, 929, 42719, 161063, 154663, 47, 85493, 114122, 35773, 1294, 23, 22, 40899, 125195,...

[ 0.048980712890625, 0.028656005859375, 0.1805419921875, 0.17626953125, 0.19189453125, 0.109375, 0.1533203125, 0.166015625, 0.161376953125, 0.107421875, 0.101318359375, 0.2479248046875, 0.141845703125, 0.27783203125, 0.0931396484375, 0.14794921875, 0.1591796875, 0.307373046875, 0.0...

embed

43452514_c0

43452514

haskell

0

Title: Customizing the fields generated by automatic derivation of ToSchema Problem title: Customizing the fields generated by automatic derivation of ToSchema Tags: haskell, servant, derived-instances Problem: Customizing the fields generated by automatic derivation of ToSchema I have the following type: data Device =...

Customizing the fields generated by automatic derivation of ToSchema Customizing the fields generated by automatic derivation of ToSchema haskell servant derived-instances Customizing ToSchema Device _deviceId DeviceId _deviceName Text _deviceDtype DType Show Generic _device Make JSON Options Customizing the fields gen...

[ 0.01025390625, 0.0235595703125, -0.00311279296875, 0.02001953125, 0.00823974609375, -0.0025177001953125, -0.001495361328125, 0.0074462890625, -0.00494384765625, -0.00439453125, -0.001251220703125, 0.0238037109375, -0.005401611328125, 0.005706787109375, -0.0186767578125, -0.004821777343...

[ 130664, 84382, 44457, 139392, 101038, 30057, 717, 25452, 11883, 1556, 142508, 187646, 16406, 116071, 174842, 112, 20375, 568, 163612, 24129, 50986, 391, 196707, 17367, 88342, 26176, 821, 58627, 152448, 25632, 10644, 4527, 122, 5844, 1375, 64457, ...

[ 0.210205078125, 0.0413818359375, 0.19677734375, 0.131103515625, 0.1942138671875, 0.1905517578125, 0.1954345703125, 0.157470703125, 0.179931640625, 0.119873046875, 0.2235107421875, 0.2095947265625, 0.1190185546875, 0.110595703125, 0.1822509765625, 0.061279296875, 0.147216796875, 0.0...

embed

46357747_c0

46357747

haskell

0

Title: Haddock - Data record fields names not being generated Problem title: Haddock - Data record fields names not being generated Tags: haskell, haddock, hackage Problem: Haddock - Data record fields names not being generated I'm having trouble getting haddock to display the field names of my data records. Some of my...

Haddock - Data record fields names not being generated Haddock - Data record fields names not being generated haskell haddock hackage Haddock Data API PriceHistoryResponse PriceHistoryResponseData Maybe Integer Show Generic DuplicateRecordFields Haddock - Data record fields names not being generated I'm having trouble ...

[ 0, 0.00811767578125, 0.0013427734375, 0.00174713134765625, 0.00933837890625, 0.02880859375, 0.0125732421875, -0.00848388671875, 0.00164031982421875, 0.02783203125, -0.008056640625, -0.021240234375, -0.007720947265625, 0.004180908203125, 0.0057373046875, -0.01263427734375, 0.028442382...

[ 28129, 138414, 11809, 17164, 44457, 123055, 959, 8035, 139392, 1556, 142508, 1902, 85526, 61687, 48025, 20861, 86385, 94399, 137989, 83425, 44401, 17367, 88342, 786, 52721, 67, 32271, 6159, 19388, 63134, 44116, 2053, 115923, 52895, 5941, 12921, ...

[ 0.2039794921875, 0.26953125, 0.12060546875, 0.2049560546875, 0.2247314453125, 0.1611328125, 0.122802734375, 0.08251953125, 0.192626953125, 0.1109619140625, 0.173095703125, 0.1719970703125, 0.1708984375, 0.112548828125, 0.12353515625, 0.010406494140625, 0.0149688720703125, 0.1029052...

embed

70218909_c0

70218909

haskell

0

Title: Haskell PolyKinds extension and type families Problem title: Haskell PolyKinds extension and type families Tags: polykinds, functional-programming, haskell, types, data-kinds Problem: Haskell PolyKinds extension and type families I working on type families in Haskell to get deeper inside this topic, and trying t...

Haskell PolyKinds extension and type families Haskell PolyKinds extension and type families polykinds functional-programming haskell types data-kinds Haskell PolyKinds LANGUAGE TypeFamilies StandaloneKindSignatures RankNTypes DataKinds TypeOperators TypeApplications KindSignatures ScopedTypeVariables UndecidableInstanc...

[ 0.01434326171875, 0.007049560546875, -0.0023193359375, -0.01080322265625, -0.009521484375, -0.01104736328125, 0.0087890625, -0.01446533203125, -0.0140380859375, -0.00897216796875, 0.0162353515625, -0.0419921875, 0.0038604736328125, 0.00811767578125, -0.0079345703125, -0.005126953125, ...

[ 20625, 142508, 63306, 605, 7250, 111938, 136, 10644, 87143, 35874, 68347, 123309, 28966, 1556, 52895, 2053, 98064, 60457, 919, 1191, 32487, 51684, 218723, 134405, 196707, 11809, 156823, 47677, 182867, 27435, 182783, 81827, 79912, 24750, 116071, 1...

[ 0.1358642578125, 0.2332763671875, 0.185302734375, 0.1180419921875, 0.2022705078125, 0.1787109375, 0.031494140625, 0.195068359375, 0.18359375, 0.1502685546875, 0.1832275390625, 0.0919189453125, 0.078369140625, 0.1168212890625, 0.1744384765625, 0.039276123046875, 0.0872802734375, 0.1...

embed

32921132_c0

32921132

haskell

0

Title: Using GHC as library Problem title: Using GHC as library Tags: api, ghci, haskell Problem: Using GHC as library What would be the simplest example of sending an expression to ghci via its api for evaluation and printing the result? I am not able to find a complete example that would work. Yes, I have tried https...

Using GHC as library Using GHC as library api ghci haskell GHC GHC.Paths GhcMonad Debugger DynFlags Outputable Language.Haskell.HsColour Language.Haskell.HsColour.Colourise Using GHC.setSessionDynFlags TTY Just RunToCompletion RunOk mapM_ AnId Using GHC as library What would be the simplest example of sending an expres...

[ -0.007415771484375, 0.0002536773681640625, 0.0091552734375, 0.005950927734375, 0.0032501220703125, 0.007293701171875, 0.005615234375, -0.00421142578125, -0.00848388671875, -0.033935546875, 0.004119873046875, -0.01226806640625, -0.0089111328125, -0.0177001953125, -0.0009765625, 0.007263...

[ 345, 527, 73265, 237, 35773, 1294, 31470, 31380, 318, 1556, 142508, 10519, 55112, 46674, 712, 262, 978, 21407, 9865, 19, 919, 3668, 13538, 7077, 83658, 6495, 841, 78457, 58944, 3509, 294, 90, 6889, 3371, 27143, 9563, 28398, 7763, 108161, ...

[ 0.055328369140625, 0.1370849609375, 0.26904296875, 0.06695556640625, 0.2225341796875, 0.0265960693359375, 0.1832275390625, 0.12353515625, 0.172119140625, 0.124267578125, 0.2247314453125, 0.08575439453125, 0.10577392578125, 0.07403564453125, 0.0728759765625, 0.056243896484375, 0.13220...

embed

11003535_c0

11003535

haskell

0

Title: What is going on with the types in this ghci session? Problem title: What is going on with the types in this ghci session? Tags: ghci, haskell Problem: What is going on with the types in this ghci session? I'm learning Haskell, and I was playing around in ghci when I came across something very puzzling. First, c...

What is going on with the types in this ghci session? What is going on with the types in this ghci session? ghci haskell the What Prelude Fractional Integer Possible Num What is going on with the types in this ghci session? I'm learning Haskell, and I was playing around in ghci when I came across something very puzzlin...

[ 0.0135498046875, -0.0009307861328125, 0.0142822265625, 0.004241943359375, 0.0130615234375, 0.0137939453125, -0.014404296875, -0.0015411376953125, 0.0157470703125, -0.01202392578125, -0.00238037109375, -0.03125, -0.00958251953125, -0.017578125, 0.00153350830078125, -0.001678466796875, ...

[ 4865, 7730, 98, 678, 52895, 23, 903, 31380, 318, 56002, 1556, 142508, 1914, 822, 112, 7868, 10763, 44401, 115861, 2661, 52782, 52080, 20625, 75169, 36880, 4552, 2638, 13894, 2069, 28282, 10, 8781, 15190, 32354, 43240, 933, 21917, 9821, 5991...

[ 0.09454345703125, 0.0234527587890625, 0.03497314453125, 0.0640869140625, 0.25927734375, 0.056671142578125, 0.083740234375, 0.110595703125, 0.1671142578125, 0.175537109375, 0.0992431640625, 0.2193603515625, 0.08984375, 0.1563720703125, 0.07037353515625, 0.1168212890625, 0.043029785156...

embed

45773761_c0

45773761

haskell

0

Title: parList vs parTraversable Problem title: parList vs parTraversable Tags: haskell, parallel-processing Problem: parList vs parTraversable I found a "strange" behavior here. I got this: {-# LANGUAGE BangPatterns #-} import Data.List import Control.Parallel import Control.Parallel.Strategies fib 0 = 1 fib 1 = 1 fib...

parList vs parTraversable parList vs parTraversable haskell parallel-processing Data.List Control.Parallel Control.Parallel.Strategies LANGUAGE BangPatterns n-1 n-2 Strategy SPARKS Control Parallel Strategies.hs Traversable parlist2.hs parList2 RTS parList vs parTraversable I found a "strange" behavior here. I got this...

[ -0.0206298828125, 0.0277099609375, -0.01544189453125, -0.0174560546875, 0.0228271484375, -0.008056640625, 0.01068115234375, -0.00341796875, 0.0118408203125, -0.025390625, 0.01239013671875, 0.01171875, 0.027099609375, 0.01470947265625, 0.0091552734375, 0.01214599609375, 0.013488769531...

[ 366, 154663, 20209, 28542, 7864, 2886, 1556, 142508, 95103, 63923, 11809, 27131, 55292, 1229, 31828, 98064, 26387, 8335, 3055, 5759, 5428, 7832, 67, 60436, 20113, 211485, 141075, 127, 4937, 6562, 5442, 304, 27389, 294, 14037, 27254, 429, 1231...

[ 0.202392578125, 0.26220703125, 0.1103515625, 0.1048583984375, 0.1845703125, 0.1981201171875, 0.0806884765625, 0.1683349609375, 0.1734619140625, 0.05511474609375, 0.0226287841796875, 0.1802978515625, 0.06298828125, 0.0838623046875, 0.0943603515625, 0.0279541015625, 0.1029052734375, ...

embed

47529478_c0

47529478

haskell

0

Title: How does GHC know how to cache one function but not the others? Problem title: How does GHC know how to cache one function but not the others? Tags: benchmarking, haskell, memoization Problem: How does GHC know how to cache one function but not the others? I'm reading Learn You a Haskell (loving it so far) and i...

How does GHC know how to cache one function but not the others? How does GHC know how to cache one function but not the others? benchmarking haskell memoization qualified a How GHC Data.Set Set Data.List List LYAH elem1 Bool When elem2 Set.toList Set.fromList Then elem3 List.nub How does GHC know how to cache one funct...

[ 0.00836181640625, 0.001373291015625, 0.029052734375, -0.0194091796875, 0.004852294921875, 0.0162353515625, 0.00099945068359375, -0.000476837158203125, 0.00005507469177246094, 0.002044677734375, -0.0026092529296875, 0.0030517578125, 0.000377655029296875, -0.008056640625, 0.01446533203125,...

[ 11249, 527, 73265, 3714, 3642, 82365, 1632, 32354, 1284, 959, 27060, 240057, 1556, 142508, 163, 432, 47691, 217225, 11809, 294, 126, 19943, 154663, 32036, 339, 192583, 88, 195, 418, 2460, 929, 304, 363, 5829, 47, 16454, 134031, 20625, 7182,...

[ 0.030303955078125, 0.0972900390625, 0.2281494140625, 0.1298828125, 0.0684814453125, 0.244140625, 0.09130859375, 0.1988525390625, 0.07244873046875, 0.0804443359375, 0.08489990234375, 0.185791015625, 0.0953369140625, 0.2344970703125, 0.0999755859375, 0.1217041015625, 0.10540771484375, ...

embed

58793029_c0

58793029

haskell

0

Title: Minesweeper board labels (beginner level) Problem title: Minesweeper board labels (beginner level) Tags: minesweeper, list, haskell Problem: Minesweeper board labels (beginner level) We were given a homework, where we get a sample minesweeper-like board, with blank spaces instead of numbers (board is in [String]...

Minesweeper board labels (beginner level) Minesweeper board labels (beginner level) minesweeper list haskell Data.Char Minesweeper Result Prelude Minesweeper board labels (beginner level) We were given a homework, where we get a sample minesweeper-like board, with blank spaces instead of numbers (board is in [String] f...

[ -0.00421142578125, -0.00909423828125, -0.005706787109375, 0.019775390625, 0.006805419921875, -0.00396728515625, 0.0189208984375, -0.00604248046875, 0.00299072265625, 0.008544921875, -0.005828857421875, -0.0194091796875, 0.0225830078125, 0.0145263671875, -0.0157470703125, -0.01300048828...

[ 56713, 7, 1177, 13, 1264, 45443, 67967, 82089, 17366, 56, 5665, 5303, 1556, 142508, 11809, 84068, 126684, 1914, 822, 34475, 5368, 18244, 121413, 5062, 44237, 32628, 64457, 101935, 24351, 71713, 3173, 21771, 158012, 3871, 28282, 32354, 91995, ...

[ 0.1536865234375, 0.037322998046875, 0.139892578125, 0.09600830078125, 0.1513671875, 0.1883544921875, 0.2310791015625, 0.07708740234375, 0.140380859375, 0.0191497802734375, 0.207763671875, 0.10186767578125, 0.06591796875, 0.1741943359375, 0.0582275390625, 0.1298828125, 0.1075439453125...

embed

37318611_c0

37318611

haskell

0

Title: Reader-Writer Lock in Haskell Problem title: Reader-Writer Lock in Haskell Tags: haskell, concurrency, readerwriterlock, locking Problem: Reader-Writer Lock in Haskell I am implementing a web-app that holds some data in memory. Some requests read this data for processing and some requests update this data. In th...

Reader-Writer Lock in Haskell Reader-Writer Lock in Haskell haskell concurrency readerwriterlock locking Reader-Writer Lock Haskell MVar Reader-Writer Lock in Haskell I am implementing a web-app that holds some data in memory. Some requests read this data for processing and some requests update this data. In this scena...

[ -0.00537109375, 0.0234375, -0.00860595703125, -0.0252685546875, -0.0002613067626953125, -0.0211181640625, 0.0025787353515625, 0.01422119140625, 0.0023040771484375, -0.0032806396484375, -0.0135498046875, -0.00102996826171875, 0.01287841796875, 0.0033416748046875, 0.013916015625, 0.01031...

[ 122636, 9, 1456, 2783, 56, 80002, 20625, 142508, 23, 1556, 108636, 982, 155255, 70035, 21135, 56776, 66160, 147, 29479, 1467, 9007, 16401, 2053, 98323, 50336, 12301, 28350, 106117, 48716, 120709, 831, 133244, 160404, 27117, 97629, 17203, 3444, ...

[ 0.28759765625, 0.0572509765625, 0.137939453125, 0.206298828125, 0.09814453125, 0.238525390625, 0.1607666015625, 0.2310791015625, 0.01434326171875, 0.1240234375, 0.1700439453125, 0.1485595703125, 0.288818359375, 0.279052734375, 0.2191162109375, 0.23876953125, 0.0142974853515625, 0.1...

embed

70567840_c0

70567840

haskell

0

Title: How to disable certificate validation in stack? Problem title: How to disable certificate validation in stack? Tags: haskell-stack, haskell Problem: How to disable certificate validation in stack? I am trying to set up CI on GitLab. It's only meant to verify the project can build, run and tests are passing. No a...

How to disable certificate validation in stack? How to disable certificate validation in stack? haskell-stack haskell InternalException How Cabal regex-posix-0.96.0.0 sha256:bd870f983a21bb474bd96449736f011c599981ce70da808a21ec1a28292e5481 Selected hackage.haskell.org Downloading HttpExceptionRequest Request Accept-Enco...

[ -0.00433349609375, 0.00555419921875, 0.0181884765625, -0.00872802734375, 0.00146484375, -0.01019287109375, -0.009521484375, -0.014404296875, 0.0059814453125, 0.0177001953125, 0.01513671875, -0.001678466796875, 0.0242919921875, 0.00775146484375, -0.0159912109375, -0.005126953125, 0.00...

[ 11249, 47, 2837, 2886, 163769, 44622, 1363, 23, 177261, 1556, 142508, 590, 2594, 106745, 19279, 63928, 30438, 289, 6835, 3355, 67890, 425, 23320, 11648, 99929, 9638, 127892, 132067, 16665, 172725, 136485, 65040, 174859, 51620, 85526, 4588, 1055...

[ 0.093017578125, 0.030303955078125, 0.137939453125, 0.2147216796875, 0.250244140625, 0.2587890625, 0.06683349609375, 0.0750732421875, 0.23828125, 0.10498046875, 0.2320556640625, 0.1033935546875, 0.0985107421875, 0.10357666015625, 0.00885009765625, 0.1168212890625, 0.1361083984375, 0...

embed

44851035_c0

44851035

haskell

0

Title: Type parameter in context which cause some ambiguity Problem title: Type parameter in context which cause some ambiguity Tags: haskell Problem: Type parameter in context which cause some ambiguity I have the following error for the cadr1 below, which makes sense Could not deduce (BoolEq n ('Succ ('Succ n'0)) ~ '...

Type parameter in context which cause some ambiguity Type parameter in context which cause some ambiguity haskell Type cadr1 LANGUAGE DataKinds GADTs KindSignatures RankNTypes TypeFamilies DecidablePropositionalEquality Nat Zero Succ Vec VNil VCons Greater Bool Type parameter in context which cause some ambiguity I hav...

[ 0.00262451171875, 0.0191650390625, -0.006439208984375, 0.0130615234375, 0.00640869140625, -0.0274658203125, -0.0027313232421875, 0.01312255859375, -0.018798828125, -0.0218505859375, -0.00054931640625, -0.0189208984375, 0.004302978515625, -0.00982666015625, 0.0023040771484375, 0.0032806...

[ 60457, 171859, 43701, 22304, 920, 12282, 3129, 3060, 1556, 142508, 19630, 42, 418, 98064, 11809, 7250, 23749, 41072, 27435, 218723, 134405, 196707, 1191, 49132, 40322, 161789, 68875, 83947, 1832, 10060, 52884, 379, 310, 11935, 2460, 929, 2481, ...

[ 0.222900390625, 0.19775390625, 0.19677734375, 0.10107421875, 0.1287841796875, 0.1802978515625, 0.0273895263671875, 0.0130615234375, 0.103759765625, 0.20947265625, 0.0960693359375, 0.09814453125, 0.0254974365234375, 0.055938720703125, 0.012725830078125, 0.09173583984375, 0.02735900878...

embed

49386033_c0

49386033

haskell

0

Title: Haskell: Name multiple arguments in a nice way Problem title: Haskell: Name multiple arguments in a nice way Tags: haskell Problem: Haskell: Name multiple arguments in a nice way I am working on a virtual stack machine for my school project. Everything works fine, but this is what I have as the control function ...

Haskell: Name multiple arguments in a nice way Haskell: Name multiple arguments in a nice way haskell Haskell Name Program SubprogramDir Memory ComputerStack Input Output EOP Marks Then Stack.push Left Right Haskell: Name multiple arguments in a nice way I am working on a virtual stack machine for my school project. Ev...

[ -0.01080322265625, -0.0152587890625, 0.0113525390625, 0.0299072265625, 0.003814697265625, 0.03125, -0.025146484375, -0.020263671875, 0.00341796875, -0.0234375, -0.00037384033203125, 0.0238037109375, -0.006317138671875, 0.007080078125, -0.0157470703125, 0.005859375, 0.01904296875, -...

[ 20625, 142508, 15757, 48716, 10750, 7, 26267, 3917, 1556, 7663, 8273, 18749, 397, 481, 172681, 40139, 42378, 2594, 360, 13538, 241, 20880, 7880, 6512, 7332, 127, 2480, 90911, 20697, 20513, 177261, 36279, 10696, 13452, 171581, 43240, 5885, 765...

[ 0.14013671875, 0.245849609375, 0.22314453125, 0.2379150390625, 0.261474609375, 0.0501708984375, 0.147216796875, 0.085205078125, 0.139892578125, 0.17431640625, 0.1571044921875, 0.1854248046875, 0.04718017578125, 0.1474609375, 0.146484375, 0.0216064453125, 0.10223388671875, 0.1187744...

embed

6797902_c0

6797902

haskell

0

Title: Haskell source encoding Problem title: Haskell source encoding Tags: haskell, encoding Problem: Haskell source encoding The Haskell 2010 Language Report says: Haskell uses the Unicode [2] character set. However, source programs are currently biased toward the ASCII character set used in earlier versions of Haske...

Haskell source encoding Haskell source encoding haskell encoding Haskell x05 Trick Alex Unicode See white_no_nl x03 ToDo x04 x01 A-Z x02 x06 Haskell source encoding The Haskell 2010 Language Report says: Does this mean UTF-8? In ghc-7.0.4/compiler/parser/Lexer.x.source: ...I'm not sure what to make of this. alexGetChar...

[ 0.00408935546875, 0.00537109375, 0.018310546875, -0.0052490234375, -0.01544189453125, 0.0186767578125, 0.0011749267578125, 0.0157470703125, -0.0074462890625, 0.021728515625, 0.00103759765625, -0.030029296875, 0.00823974609375, -0.01385498046875, -0.005950927734375, 0.015625, 0.009521...

[ 20625, 142508, 31344, 22, 587, 6238, 1556, 8194, 141362, 20984, 219778, 6872, 35011, 157, 13169, 9513, 717, 8331, 7709, 6746, 62, 1511, 9550, 9016, 1532, 83658, 34798, 903, 29459, 345, 30992, 17376, 31380, 238, 129884, 77212, 58875, 2500, 5...

[ 0.1512451171875, 0.2626953125, 0.224365234375, 0.07806396484375, 0.208984375, 0.040069580078125, 0.1383056640625, 0.1800537109375, 0.1798095703125, 0.1624755859375, 0.21435546875, 0.0229949951171875, 0.1689453125, 0.1409912109375, 0.1253662109375, 0.085693359375, 0.10577392578125, ...

embed

59909561_c0

59909561

haskell

0

Title: HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none Problem title: HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none Tags: haskell, type-mismatch, lambda, arguments, types Problem: HASKELL The lambda expression ‘\ xs -> ...’ has ...

HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none HASKELL The lambda expression ‘\ xs -> ...’ has one argument, but its type ‘[t]’ has none haskell type-mismatch lambda arguments types HASKELL x:xs y:ys Bool Couldn HASKELL The lambda expression ‘\ xs -> ...’ has one argumen...

[ 0.01129150390625, 0.034912109375, 0.00091552734375, -0.0179443359375, 0.0126953125, -0.006011962890625, 0.00628662109375, 0.0211181640625, 0.0103759765625, 0.010986328125, 0.001983642578125, -0.033935546875, 0.0172119140625, -0.00653076171875, -0.007080078125, 0.000021219253540039062, ...

[ 11666, 10762, 56051, 21, 6492, 85, 125195, 41872, 1022, 7, 20, 1230, 5386, 153, 1556, 1632, 10750, 1284, 10644, 18, 351, 13, 142508, 2179, 98753, 52895, 425, 113, 4778, 2460, 929, 191147, 33079, 33022, 32354, 20625, 11343, 45831, 18499, 4...

[ 0.1102294921875, 0.1248779296875, 0.1546630859375, 0.0797119140625, 0.1966552734375, 0.157470703125, 0.19677734375, 0.044647216796875, 0.126220703125, 0.129150390625, 0.067626953125, 0.06707763671875, 0.1458740234375, 0.07525634765625, 0.124755859375, 0.0938720703125, 0.2113037109375...

embed

16426463_c0

16426463

haskell

0

Title: What constitutes a fold for types other than list? Problem title: What constitutes a fold for types other than list? Tags: terminology, haskell, functional-programming, fold Problem: What constitutes a fold for types other than list? Consider a single-linked list. It looks something like data List x = Node x (Li...

What constitutes a fold for types other than list? What constitutes a fold for types other than list? terminology haskell functional-programming fold What List Node End Tree Leaf Branch What constitutes a fold for types other than list? Consider a single-linked list. It looks something like It is natural to define a fo...

[ -0.00170135498046875, -0.0019378662109375, 0.006256103515625, 0.00555419921875, -0.00445556640625, -0.00390625, -0.03271484375, -0.00469970703125, 0.00506591796875, -0.0223388671875, -0.004058837890625, -0.047119140625, -0.00555419921875, 0.0108642578125, -0.006622314453125, -0.0039978...

[ 11764, 10, 42822, 100, 52895, 3789, 3501, 5303, 1556, 142508, 123309, 28966, 32036, 438, 112, 18878, 101344, 2407, 21110, 206, 1636, 11001, 10187, 33342, 6083, 61924, 18344, 6238, 32354, 34390, 1238, 1022, 2389, 91995, 11907, 678, 1914, 822, ...

[ 0.1868896484375, 0.04608154296875, 0.2998046875, 0.03851318359375, 0.205078125, 0.116943359375, 0.110107421875, 0.1571044921875, 0.07147216796875, 0.1888427734375, 0.1112060546875, 0.0831298828125, 0.107421875, 0.10491943359375, 0.12060546875, 0.11865234375, 0.0936279296875, 0.0447...

embed

54149543_c0

54149543

haskell

0

Title: Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") Problem title: Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") Tags: haskell Problem: Installation of Haskell package hs_gchart fails ("Non type-va...

Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") Installation of Haskell package hs_gchart fails ("Non type-variable argument in the constraint") haskell Installation Haskell hs_gchart Non MonadState Chart Use FlexibleContexts XFlexibleContexts Compili...

[ -0.0157470703125, 0.004425048828125, 0.02294921875, -0.00244140625, 0.01165771484375, -0.0137939453125, -0.0198974609375, -0.017822265625, -0.00909423828125, 0.02001953125, 0.005035400390625, -0.05517578125, 0.0029144287109375, -0.0029296875, -0.0098876953125, 0.0155029296875, -0.005...

[ 145323, 20625, 142508, 98169, 1096, 7, 177, 9254, 18, 35782, 59881, 10644, 21690, 2886, 10750, 23, 158, 2816, 4288, 1556, 3775, 60331, 135206, 110373, 180842, 2661, 22829, 1193, 919, 74070, 28236, 189682, 87590, 84068, 2982, 51193, 127, 63473...

[ 0.1309814453125, 0.1153564453125, 0.2198486328125, 0.145751953125, 0.06005859375, 0.0679931640625, 0.029052734375, 0.17138671875, 0.0986328125, 0.1436767578125, 0.1270751953125, 0.1834716796875, 0.126953125, 0.0753173828125, 0.175537109375, 0.072509765625, 0.056396484375, 0.1508789...

embed

28427524_c0

28427524

haskell

0

Title: How to process / summarise a list into a "different" list Problem title: How to process / summarise a list into a "different" list Tags: fold, haskell Problem: How to process / summarise a list into a "different" list I think I need something like a fold or maybe a foldt but the examples I've...

How to process / summarise a list into a "different" list How to process / summarise a list into a "different" list fold haskell How order1 item1 item2 item3 order2 item4 Order Text OrderItem OrderTuple x:xs y:ys Bool How to process / summarise a list into a "different" list I think I need something...

[ 0.0023345947265625, -0.0096435546875, 0.0031280517578125, 0.00750732421875, 0.0023345947265625, 0.019287109375, -0.004058837890625, -0.010009765625, 0.0205078125, 0.024658203125, -0.001739501953125, 0.00994873046875, -0.002716064453125, 0.000492095947265625, -0.017333984375, 0.00543212...

[ 11249, 47, 9433, 248, 29334, 58944, 5303, 3934, 10, 238778, 42822, 1556, 142508, 12989, 418, 35735, 304, 363, 617, 81206, 24129, 2982, 15665, 8705, 1022, 425, 113, 4778, 2460, 929, 3871, 1884, 18, 27781, 375, 11856, 8781, 146232, 42, 3429...

[ 0.076904296875, 0.0386962890625, 0.1876220703125, 0.0894775390625, 0.2047119140625, 0.1787109375, 0.23876953125, 0.1583251953125, 0.06158447265625, 0.27197265625, 0.185791015625, 0.1217041015625, 0.213623046875, 0.2164306640625, 0.048553466796875, 0.124755859375, 0.037322998046875, ...

embed

43244755_c0

43244755

haskell

0

Title: Reflexive Closure Problem title: Reflexive Closure Tags: math, haskell Problem: Reflexive Closure I have been working on a question about reflexive closure: The reflexive closure of a relation R is the smallest relation bigger than R which is reflexive. In other words, it is R with whatever pairs added to make R...

Reflexive Closure Reflexive Closure math haskell Reflexive Closure QUESTION Functions x:xs Bool TEST SET Your NOT WORRY ABOUT ORDER WHICH PAIRS APPEAR LIST Reflexive Closure I have been working on a question about reflexive closure: I came up with this solution but it seems quite sloppy and lack neatness. Is there an e...

[ -0.01177978515625, 0.01483154296875, 0.0242919921875, -0.003143310546875, 0.00885009765625, -0.0087890625, -0.00970458984375, 0.00012874603271484375, 0.01611328125, 0.0033721923828125, 0.007537841796875, 0.01708984375, 0.01123046875, 0.01043701171875, 0.0072021484375, 0.008544921875, ...

[ 179043, 5844, 51053, 56851, 48909, 1556, 142508, 21389, 294, 28670, 10763, 1022, 12, 425, 2460, 929, 384, 21828, 128565, 14804, 86725, 601, 24638, 34388, 52001, 33172, 18044, 436, 126546, 66440, 127427, 195977, 20697, 9655, 71181, 170224, 1257,...

[ 0.2275390625, 0.1851806640625, 0.188232421875, 0.13623046875, 0.15234375, 0.1024169921875, 0.2015380859375, 0.04547119140625, 0.0399169921875, 0.08380126953125, 0.037811279296875, 0.029876708984375, 0.0171661376953125, 0.0556640625, 0.087646484375, 0.1912841796875, 0.1339111328125, ...

embed

43716497_c0

43716497

haskell

0

Title: Scotty web service Problem title: Scotty web service Tags: web, service, haskell, scotty, frameworks Problem: Scotty web service I need to create a web service to convert between different currencies using the scotty web framework in Haskell. The web service should respond to get requests such as /convert/15?to=...

Scotty web service Scotty web service web service haskell scotty frameworks Web.Scotty Data.Monoid Data.Text.Lazy Scotty LANGUAGE OverloadedStrings Text Double Scotty web service I need to create a web service to convert between different currencies using the scotty web framework in Haskell. The web service should resp...

[ 0.00032806396484375, 0.0174560546875, 0.0002498626708984375, -0.003997802734375, -0.0181884765625, 0.0166015625, -0.002716064453125, 0.00787353515625, -0.00020694732666015625, -0.0269775390625, 0.005615234375, -0.0203857421875, -0.01544189453125, -0.0036468505859375, 0.01513671875, 0.0...

[ 50695, 53, 1467, 4516, 1556, 142508, 14753, 15145, 170846, 4002, 587, 11809, 46674, 48899, 174379, 2729, 3285, 3358, 98064, 9578, 63033, 71713, 24129, 107172, 87, 3871, 28282, 96760, 17721, 12921, 9709, 107, 117538, 17368, 23, 20625, 35644, 2...

[ 0.2374267578125, 0.22998046875, 0.1328125, 0.144775390625, 0.102783203125, 0.2646484375, 0.1551513671875, 0.2100830078125, 0.18212890625, 0.0399169921875, 0.1407470703125, 0.061279296875, 0.05059814453125, 0.1263427734375, 0.05908203125, 0.08599853515625, 0.102294921875, 0.00411987...

embed

48992971_c0

48992971

haskell

0

Title: Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' Problem title: Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' Tags: haskell, yesod Problem: Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' I Scaffolded my site in Stac...

Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' Yesod - Couldn't match type `WidgetT site0 m0' with `HandlerT App IO' haskell yesod Yesod Couldn WidgetT site0 HandlerT App Compiling Handler.Vendita Handler Vendita.hs x86_64-freebsd Cabal-2.0.1.0 Vendita.o Lavori Vendi...

[ -0.00836181640625, 0.011962890625, 0.005645751953125, 0.010498046875, -0.01409912109375, -0.01141357421875, -0.0277099609375, -0.026123046875, 0.00011777877807617188, -0.0478515625, 0.004302978515625, -0.03759765625, 0.00360107421875, -0.01385498046875, 0.0031585693359375, -0.004028320...

[ 32635, 2199, 191147, 3768, 18, 14858, 10644, 1456, 532, 3794, 618, 1764, 2389, 678, 135679, 603, 5659, 17780, 1556, 142508, 2422, 23722, 58302, 10639, 15612, 49725, 85512, 53298, 154967, 102, 15276, 13307, 32087, 16145, 30438, 289, 73011, 102...

[ 0.197265625, 0.265625, 0.09832763671875, 0.072509765625, 0.06121826171875, 0.203369140625, 0.1851806640625, 0.0263824462890625, 0.095947265625, 0.132080078125, 0.1827392578125, 0.120849609375, 0.1231689453125, 0.053253173828125, 0.1602783203125, 0.200927734375, 0.1739501953125, 0.1...

embed

70180423_c0

70180423

haskell

0

Title: Deriving Show when a type family is present (without writing manual constraints) Problem title: Deriving Show when a type family is present (without writing manual constraints) Tags: haskell Problem: Deriving Show when a type family is present (without writing manual constraints) I want to create an ADT that is ...

Deriving Show when a type family is present (without writing manual constraints) Deriving Show when a type family is present (without writing manual constraints) haskell Data.Kind Prelude Deriving Show LANGUAGE StandaloneDeriving KindSignatures TypeFamilies Test Switchable Type TextName Same Foo Deriving Show when a ty...

[ 0.00653076171875, -0.007415771484375, -0.004974365234375, 0.0026397705078125, -0.01019287109375, -0.0172119140625, 0.0006103515625, 0.003692626953125, 0.00128173828125, -0.0037078857421875, -0.0220947265625, 0.00074005126953125, 0.005645751953125, 0.021484375, -0.0185546875, -0.0147705...

[ 1310, 14, 6496, 17367, 3229, 10644, 14449, 13379, 6056, 32562, 23009, 2816, 4288, 1556, 142508, 11809, 7250, 1914, 822, 98064, 32487, 51684, 47731, 27435, 218723, 60457, 1191, 8647, 106101, 24129, 163612, 99908, 9572, 31, 3444, 28282, 62, 410...

[ 0.1328125, 0.0927734375, 0.128173828125, 0.256591796875, 0.079833984375, 0.2066650390625, 0.1385498046875, 0.1407470703125, 0.0294189453125, 0.0814208984375, 0.1239013671875, 0.154541015625, 0.10638427734375, 0.0714111328125, 0.2027587890625, 0.0750732421875, 0.093994140625, 0.0382...

embed

12941625_c0

12941625

haskell

0

Title: IDs from State Monad in Haskell Problem title: IDs from State Monad in Haskell Tags: monads, uniqueidentifier, haskell, state-monad Problem: IDs from State Monad in Haskell Possible Duplicate: Creating unique labels in Haskell I've got a datatype Person and some input data from which I will create the Persons. I...

IDs from State Monad in Haskell IDs from State Monad in Haskell monads uniqueidentifier haskell state-monad State Control.Monad.State IDs Monad Haskell Person Show MyState Adam Barney Charlie IDs from State Monad in Haskell I've got a datatype Person and some input data from which I will create the Persons. I'd like to...

[ -0.0216064453125, -0.003204345703125, 0.01177978515625, -0.00433349609375, -0.00138092041015625, 0.015869140625, 0.005126953125, 0.0047607421875, -0.005035400390625, -0.0693359375, -0.00299072265625, 0.0167236328125, -0.006927490234375, 0.017333984375, 0.00457763671875, -0.019653320312...

[ 11338, 1295, 22836, 60331, 71, 23, 20625, 142508, 2667, 712, 36998, 42485, 56, 1556, 11341, 3796, 27131, 46674, 135206, 15270, 17367, 2646, 13, 16173, 71876, 53, 71305, 4163, 2053, 50986, 107730, 1221, 28282, 70, 1884, 765, 12638, 6863, 100...

[ 0.2320556640625, 0.09979248046875, 0.216796875, 0.2205810546875, 0.189453125, 0.04144287109375, 0.1492919921875, 0.25927734375, 0.1617431640625, 0.2198486328125, 0.1800537109375, 0.199462890625, 0.0143280029296875, 0.12158203125, 0.154052734375, 0.122802734375, 0.148193359375, 0.10...

embed

43163491_c0

43163491

haskell

0

Title: Could not load exported module using stack Problem title: Could not load exported module using stack Tags: haskell, haskell-stack, module Problem: Could not load exported module using stack I get an error when getting a Shape module within the same directory as the Main module inside the Main module when I do st...

Could not load exported module using stack Could not load exported module using stack haskell haskell-stack module stack -optP/tmp/vamsi/ghci11211/cabal_macros.h System.IO Data.Time Data.Aeson Shapes Could Shape Main Main.hs:5:1 Failed Use Run x86_64-linux Cabal-1.24.2.0 base-4.9.1.0 time-1.6.0.1 aeson-1.0.2.1-CYngHPh1...

[ 0.004791259765625, 0.012939453125, -0.0157470703125, 0.01275634765625, -0.008056640625, 0.0087890625, -0.002410888671875, -0.00543212890625, -0.01275634765625, -0.024169921875, 0.0021514892578125, -0.01129150390625, 0.0184326171875, -0.01043701171875, 0.017333984375, 0.0184326171875, ...

[ 191147, 959, 72367, 31255, 297, 88996, 17368, 177261, 1556, 142508, 590, 2594, 2146, 683, 2676, 12648, 172, 9486, 318, 88438, 1662, 408, 3571, 3666, 127, 12353, 17780, 70059, 90, 191, 7224, 13569, 1081, 12321, 758, 19721, 190355, 36836, 283...

[ 0.060638427734375, 0.1033935546875, 0.2008056640625, 0.2264404296875, 0.03955078125, 0.2315673828125, 0.05328369140625, 0.23681640625, 0.09539794921875, 0.20458984375, 0.121337890625, 0.140380859375, 0.00152587890625, 0.008819580078125, 0.0572509765625, 0.113525390625, 0.08837890625,...

embed

47359416_c0

47359416

haskell

0

Title: Extracting values from Haskell type synonyms Problem title: Extracting values from Haskell type synonyms Tags: haskell Problem: Extracting values from Haskell type synonyms I'm writing a Dominoes game for class and can't wrap my head around custom types. I have: type DomsPlayer = Hand -> Board -> (Domino,End) .....

Extracting values from Haskell type synonyms Extracting values from Haskell type synonyms haskell Haskell Extracting DomsPlayer Hand Board Domino End hand1 board1 hand2 board2 Extracting values from Haskell type synonyms I'm writing a Dominoes game for class and can't wrap my head around custom types. I have: Trying to...

[ -0.0054931640625, 0.001617431640625, 0.000339508056640625, 0.009765625, -0.009033203125, 0.01251220703125, -0.01068115234375, -0.0001392364501953125, 0.005828857421875, -0.02685546875, -0.012939453125, -0.002288818359375, -0.0069580078125, -0.01507568359375, -0.0159912109375, -0.004364...

[ 31501, 238, 142424, 1295, 20625, 142508, 10644, 164661, 1916, 1556, 9343, 7, 142581, 10639, 62554, 62687, 18878, 3535, 418, 45443, 304, 32562, 90, 6712, 18507, 137565, 10336, 114122, 52895, 40858, 72367, 18499, 3996, 3134 ]

[ 0.1451416015625, 0.029083251953125, 0.1868896484375, 0.045013427734375, 0.1031494140625, 0.217529296875, 0.15185546875, 0.203125, 0.000579833984375, 0.0809326171875, 0.1634521484375, 0.0892333984375, 0.234375, 0.0823974609375, 0.1290283203125, 0.21533203125, 0.08209228515625, 0.104...

embed

67733939_c0

67733939

haskell

0

Title: Haskell: accumulator with length, summation, summation of square of a list Problem title: Haskell: accumulator with length, summation, summation of square of a list Tags: accumulator, haskell Problem: Haskell: accumulator with length, summation, summation of square of a list I am new to Haskell and am trying to ...

Haskell: accumulator with length, summation, summation of square of a list Haskell: accumulator with length, summation, summation of square of a list accumulator haskell Haskell stats1 x:xs stats2 Couldn Integer Haskell: accumulator with length, summation, summation of square of a list I am new to Haskell and am trying...

[ -0.0035247802734375, 0.0185546875, 0.006500244140625, 0.017333984375, -0.021240234375, 0.0157470703125, -0.005584716796875, 0.00732421875, 0.00579833984375, -0.01318359375, 0.01483154296875, -0.0118408203125, 0.027099609375, -0.0062255859375, 0, -0.008544921875, -0.0052490234375, -...

[ 20625, 142508, 183278, 1290, 678, 140909, 29334, 1363, 108047, 111, 5303, 1556, 63841, 418, 1022, 425, 7, 304, 191147, 44401, 3525, 29479, 32354, 26785, 4527, 17368, 101935, 30646, 162738, 4153, 18, 360, 10554, 88303, 73, 3917, 18499, 26008, ...

[ 0.15576171875, 0.250244140625, 0.27392578125, 0.22021484375, 0.1043701171875, 0.2186279296875, 0.20458984375, 0.004638671875, 0.196533203125, 0.109619140625, 0.2164306640625, 0.1292724609375, 0.181884765625, 0.08648681640625, 0.04119873046875, 0.05987548828125, 0.00604248046875, 0....

embed

48791549_c0

48791549

haskell

0

Title: Is there any practical difference between these two definitions of type-level Peano Natural number summation? Problem title: Is there any practical difference between these two definitions of type-level Peano Natural number summation? Tags: typechecking, dependent-type, haskell, types Problem: Is there any pract...

Is there any practical difference between these two definitions of type-level Peano Natural number summation? Is there any practical difference between these two definitions of type-level Peano Natural number summation? typechecking dependent-type haskell types Peano Natural Nat Zero Succ UndecidableInstances Typecheck...

[ -0.01080322265625, 0.01470947265625, 0.0059814453125, 0.0201416015625, 0.00133514404296875, -0.005401611328125, 0.007293701171875, 0.004150390625, 0.0206298828125, -0.00677490234375, 0.01055908203125, -0.021728515625, 0.007171630859375, 0.017333984375, 0.0255126953125, 0.0013427734375,...

[ 2499, 138155, 60212, 17721, 6097, 6626, 80934, 10644, 67919, 1460, 3922, 24955, 14012, 29334, 1363, 78292, 108750, 50986, 1556, 142508, 52895, 68875, 83947, 1832, 10060, 79912, 24750, 2661, 116071, 60457, 3525, 17366, 56037, 7808, 41159, 31635, ...

[ 0.040771484375, 0.2293701171875, 0.2098388671875, 0.1072998046875, 0.050689697265625, 0.103515625, 0.182373046875, 0.1881103515625, 0.1697998046875, 0.1484375, 0.2296142578125, 0.1915283203125, 0.181640625, 0.2015380859375, 0.06109619140625, 0.260009765625, 0.1544189453125, 0.14245...

embed

49699485_c0

49699485

haskell

0

Title: simple function that shifts specific element of a list Problem title: simple function that shifts specific element of a list Tags: list, haskell Problem: simple function that shifts specific element of a list I am new to Haskell and I am trying to figure out how to make a function: shift:: Eq a => a -> [a] -> In...

simple function that shifts specific element of a list simple function that shifts specific element of a list list haskell h:t Main factor.bit fact.orbit simple function that shifts specific element of a list I am new to Haskell and I am trying to figure out how to make a function: Keep in mind that i have completed my...

[ -0.01513671875, 0.027587890625, -0.00531005859375, -0.0038299560546875, -0.006072998046875, -0.015380859375, -0.00118255615234375, -0.005401611328125, 0.00982666015625, 0.01904296875, 0.0211181640625, -0.0172119140625, 0.005615234375, -0.003448486328125, -0.00396728515625, 0.0152587890...

[ 8781, 32354, 450, 122925, 7, 29458, 12830, 111, 5303, 1556, 142508, 1096, 12, 18, 12321, 31461, 3137, 15824, 748, 3525, 20625, 31577, 26366, 3249, 83041, 7086, 140528, 154109, 7413, 5117, 170894, 104851, 8, 74635, 5809, 4527, 46132, 57767, ...

[ 0.1885986328125, 0.2349853515625, 0.0589599609375, 0.259765625, 0.1011962890625, 0.2325439453125, 0.1824951171875, 0.0268402099609375, 0.1934814453125, 0.11962890625, 0.2142333984375, 0.074951171875, 0.0255279541015625, 0.099365234375, 0.04791259765625, 0.169677734375, 0.171875, 0....

embed

27115894_c1

27115894

haskell

1

) . group . sort . words . Prelude.map toLower combineWordCountMaps :: Map.Map String Int -> Map.Map String Int -> Map.Map String Int combineWordCountMaps map1 map2 = Map.unionWith (+) map1 map2 reduceWordCountMaps :: [Map.Map String Int] -> Map.Map String Int reduceWordCountMaps (x:[]) = x reduceWordCountMaps (x:xs) =...

[ -0.005462646484375, 0.00860595703125, -0.0213623046875, 0.001983642578125, -0.0072021484375, 0.0047607421875, 0.006072998046875, -0.014892578125, 0.019287109375, -0.0101318359375, -0.01275634765625, 0.01611328125, 0.0272216796875, 0.00848388671875, -0.01239013671875, -0.00439453125, ...

[ 21115, 12096, 34153, 1914, 822, 112, 62346, 47, 15363, 6488, 70163, 164805, 108210, 166179, 42719, 23351, 360, 22288, 304, 87046, 194583, 22183, 34390, 1022, 107, 106357, 5201, 54, 29822, 2046, 7614, 9405, 11435, 19279, 64370, 14602, 174350, ...

[ 0.16943359375, 0.17578125, 0.1749267578125, 0.0814208984375, 0.1600341796875, 0.093994140625, 0.160888671875, 0.114990234375, 0.1368408203125, 0.190673828125, 0.1619873046875, 0.1434326171875, 0.1573486328125, 0.1571044921875, 0.1468505859375, 0.1092529296875, 0.045196533203125, 0....

embed

7140617_c0

7140617

haskell

0

Title: GHC linking problem Problem title: GHC linking problem Tags: haskell, compiler-errors, ghc Problem: GHC linking problem I'm trying to compile the following code. import Data.List import Data.Ord import qualified Data.MemoCombinators as Memo collatzLength :: Int -> Int collatzLength = Memo.arrayRange (1, 1000000)...

GHC linking problem GHC linking problem haskell compiler-errors ghc Data.List Data.Ord qualified GHC Data.MemoCombinators Memo Memo.arrayRange euler14.o s1pw_info __stginit_datazmmemocombinatorszm0zi4zi1_DataziMemoCombinators_ rfX_info datazmmemocombinatorszm0zi4zi1_DataziMemoCombinators_arrayRange_info rfX_srt datazmm...

[ 0.0003337860107421875, 0.00836181640625, 0.003204345703125, -0.0030517578125, -0.00154876708984375, 0.021728515625, -0.01092529296875, 0.01177978515625, -0.006988525390625, -0.023193359375, -0.01556396484375, -0.0257568359375, 0.0159912109375, -0.004486083984375, 0.016845703125, -0.005...

[ 527, 73265, 3126, 214, 2967, 1556, 142508, 9969, 34759, 188800, 31380, 238, 11809, 154663, 143045, 217225, 6696, 432, 10770, 19155, 22230, 17443, 31, 19305, 1052, 51459, 1175, 603, 2592, 434, 7319, 39402, 18, 10135, 277, 1290, 708, 137989, ...

[ 0.1282958984375, 0.2373046875, 0.188232421875, 0.047576904296875, 0.1658935546875, 0.1297607421875, 0.258544921875, 0.1527099609375, 0.1541748046875, 0.19873046875, 0.1326904296875, 0.1112060546875, 0.0980224609375, 0.096923828125, 0.1240234375, 0.1572265625, 0.05242919921875, 0.06...

embed

18518828_c0

18518828

haskell

0

Title: Haskell Deriving Show Instance Problem title: Haskell Deriving Show Instance Tags: haskell, deriving, show Problem: Haskell Deriving Show Instance I am playing with a Red-Black tree: -- Taken from Okasaki 1999 module RedBlackTree where --node coloring data --a node is R (red) or B (black) data Color = R | B --tr...

Haskell Deriving Show Instance Haskell Deriving Show Instance haskell deriving show Okasaki a Haskell Deriving Show Instance Taken RedBlackTree Color RBT Set Sees Ord Bool Insert BST RedBlackTree.insert RedBlackTree.T Char Possible GHCi red-black-tree.hs:54:11 Not red-black-tree.hs:54:15 red-black-tree.hs:54:28 Failed ...

[ 0.0162353515625, 0.00104522705078125, 0.0027313232421875, -0.0174560546875, 0.0216064453125, 0.013916015625, -0.0027618408203125, -0.0030364990234375, 0.01153564453125, 0.037841796875, -0.007354736328125, -0.0233154296875, 0.036376953125, -0.000377655029296875, -0.003936767578125, 0.00...

[ 20625, 142508, 1310, 14, 6496, 17367, 360, 116071, 1556, 16406, 7639, 180, 64036, 301, 2561, 6096, 97732, 62731, 51193, 52681, 19943, 6872, 35379, 2460, 929, 33657, 8545, 13, 618, 21656, 115861, 527, 73265, 4842, 151675, 62600, 34417, 11205, ...

[ 0.133544921875, 0.25732421875, 0.1134033203125, 0.1341552734375, 0.10040283203125, 0.248779296875, 0.021636962890625, 0.1651611328125, 0.1177978515625, 0.1171875, 0.218017578125, 0.035919189453125, 0.112548828125, 0.10552978515625, 0.03900146484375, 0.11865234375, 0.1578369140625, ...

embed

26194180_c0

26194180

haskell

0

Title: LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? Problem title: LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? Tags: haskell, monads, category-theory, applicative Problem:...

LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? LYHFGG: "Monads are just applicative functors that support >>=". In what sense is this statement true? haskell monads category-theory applicative LYHFGG Monads LYHFGG: "Monads are just ...

[ -0.0000743865966796875, 0.01116943359375, 0.01434326171875, 0.022705078125, -0.0014190673828125, 0.0022735595703125, 0.0030364990234375, -0.0126953125, 0.01116943359375, -0.01263427734375, 0.001373291015625, -0.03076171875, -0.01446533203125, 0.0086669921875, 0.013671875, 0.00045013427...

[ 19917, 66882, 46754, 46674, 712, 7, 621, 1660, 41816, 4935, 7477, 18770, 450, 8060, 5386, 10422, 83, 903, 63805, 29568, 1556, 142508, 2667, 95487, 2347, 60331, 6468, 6396, 42179, 29569, 35064, 1957, 80934, 71, 10644, 18507, 37202, 110, 4191...

[ 0.132568359375, 0.115966796875, 0.178466796875, 0.1893310546875, 0.236328125, 0.1248779296875, 0.058807373046875, 0.078125, 0.21630859375, 0.1131591796875, 0.1807861328125, 0.14892578125, 0.044891357421875, 0.21533203125, 0.0141143798828125, 0.045989990234375, 0.012603759765625, 0....

embed

52744890_c0

52744890

haskell

0

Title: How can I manually kill a thread? Problem title: How can I manually kill a thread? Tags: haskell Problem: How can I manually kill a thread? I'm in ghci testing some functions that fork threads, kinda like this: myForkingFunction = do tid <- forkIO (workerFunction) putStrLn ("Worker thread: " ++ show tid) putStrL...

How can I manually kill a thread? How can I manually kill a thread? haskell How Worker ThreadId GHC.Conc.Sync Couldn When Integer GHC.Prim.ThreadId TYPE GHC.Types.UnliftedRep How can I manually kill a thread? I'm in ghci testing some functions that fork threads, kinda like this: This results in: (and so on) Then as I'm...

[ 0.003387451171875, 0.01324462890625, 0.01177978515625, -0.01220703125, -0.0078125, 0.0126953125, -0.01312255859375, -0.0018157958984375, -0.00311279296875, -0.0654296875, -0.01177978515625, -0.006927490234375, -0.0196533203125, -0.0101318359375, 0.006134033203125, 0.002899169921875, ...

[ 11249, 831, 23009, 538, 67153, 86997, 87, 10, 1556, 142508, 27985, 56, 136719, 568, 71, 527, 73265, 11935, 238, 217835, 44401, 145111, 39116, 95267, 196707, 14256, 104501, 4332, 254, 31380, 318, 134234, 32354, 100, 92, 50339, 42, 214, 67, ...

[ 0.054534912109375, 0.08880615234375, 0.2183837890625, 0.1180419921875, 0.256591796875, 0.26904296875, 0.0228424072265625, 0.063720703125, 0.083984375, 0.19677734375, 0.1219482421875, 0.0751953125, 0.1707763671875, 0.06719970703125, 0.0958251953125, 0.022491455078125, 0.12646484375, ...

embed

49585262_c0

49585262

haskell

0

Title: Mutate only focus of Store Comonad? Problem title: Mutate only focus of Store Comonad? Tags: representable, haskell, comonad Problem: Mutate only focus of Store Comonad? I'm using Control.Comonad.Representable.Store to represent a grid object for a game; the grid is: type Grid = Store (Compose Vector Vector) a ;...

Mutate only focus of Store Comonad? Mutate only focus of Store Comonad? representable haskell comonad Mutate Store Comonad Grid Compose Vector Representable ComonadStore Rep Mutate only focus of Store Comonad? I'm using Control.Comonad.Representable.Store to represent a grid object for a game; the grid is: type Grid = ...

[ -0.013427734375, -0.002593994140625, -0.0091552734375, 0.0015869140625, -0.006744384765625, -0.00982666015625, -0.01336669921875, -0.0191650390625, 0.01025390625, -0.007293701171875, 0.00335693359375, 0.035400390625, 0.019775390625, 0.005950927734375, -0.01214599609375, -0.001083374023...

[ 118756, 67, 4734, 32153, 111, 14934, 6646, 9169, 18811, 2661, 1556, 142508, 533, 31945, 71, 15612, 8364, 2609, 18770, 130877, 165248, 33742, 17368, 27131, 10770, 191, 712, 4332, 55247, 2886, 33636, 120067, 36746, 6712, 10644, 78381, 110527, 6...

[ 0.196533203125, 0.148681640625, 0.1163330078125, 0.257568359375, 0.05682373046875, 0.2340087890625, 0.177734375, 0.23095703125, 0.2095947265625, 0.152099609375, 0.1070556640625, 0.2138671875, 0.1475830078125, 0.1444091796875, 0.011688232421875, 0.1173095703125, 0.109619140625, 0.16...

embed

18366389_c1

18366389

haskell

1

= merge x1 x2 : mergePairs xs mergePairs xs = xs -- expects two sorted lists and returns one sorted list. merge :: [Int] -> [Int] -> [Int] merge [] ys = ys merge xs [] = xs merge (x:xs) (y:ys) = if x <= y then x : merge xs (y:ys) else y : merge (x:xs) ys -- Slow version: takes 350 seconds to sort a 100,000 integer lis...

[ -0.006072998046875, 0.0240478515625, 0.01318359375, -0.005401611328125, -0.00921630859375, 0.01129150390625, -0.0279541015625, 0.000812530517578125, 0.006866455078125, 0.0106201171875, 0.0166015625, 0.016845703125, 0.02685546875, 0.007598876953125, 0.0120849609375, -0.010986328125, 0...

[ 2203, 42564, 1022, 418, 304, 152, 8335, 481, 7, 4210, 41206, 6626, 17497, 5303, 30646, 1632, 4153, 113, 425, 4778, 2174, 53, 148507, 11389, 51776, 14877, 94131, 12096, 805, 4, 9508, 892, 1505, 72803, 30248, 429, 158240, 10336, 54, 3650, ...

[ 0.06683349609375, 0.29296875, 0.1590576171875, 0.1153564453125, 0.2015380859375, 0.0223236083984375, 0.11572265625, 0.1024169921875, 0.11669921875, 0.0230712890625, 0.17578125, 0.1219482421875, 0.1748046875, 0.14501953125, 0.0904541015625, 0.0975341796875, 0.00140380859375, 0.12451...

embed

65466313_c0

65466313

haskell

0

Title: reading files in Haskell IO Monads Problem title: reading files in Haskell IO Monads Tags: monads, haskell, image-processing, io Problem: reading files in Haskell IO Monads Hello everyone I am beginner in Haskell, I have a dat file that contains [("img0.bmp", [0,0]) ,("img1.bmp", [0,1]) ,("img2.bmp", [1,0]) ,("i...

reading files in Haskell IO Monads reading files in Haskell IO Monads monads haskell image-processing io Haskell Monads img0.bmp img1.bmp img2.bmp img3.bmp Prelude.read Double Prelude.unzip Prelude.map Prelude.zip Vector Word8 FilePath Right reading files in Haskell IO Monads Hello everyone I am beginner in Haskell, I ...

[ 0.0057373046875, 0.0028228759765625, -0.0159912109375, 0.028564453125, 0.01446533203125, 0.0225830078125, 0.004974365234375, -0.005218505859375, -0.0022430419921875, -0.037109375, 0.00250244140625, -0.0218505859375, -0.00023174285888671875, -0.0115966796875, -0.01904296875, -0.00848388...

[ 16454, 102158, 23, 20625, 142508, 17780, 60331, 6468, 2667, 712, 1556, 29569, 63923, 22995, 566, 2389, 2676, 5442, 363, 1914, 822, 39116, 107172, 112, 50836, 62346, 2609, 18770, 22543, 1019, 42724, 683, 10519, 90911, 35378, 30309, 9842, 1679,...

[ 0.21240234375, 0.1690673828125, 0.039398193359375, 0.156494140625, 0.2587890625, 0.2364501953125, 0.1820068359375, 0.1395263671875, 0.09332275390625, 0.11962890625, 0.14404296875, 0.156005859375, 0.0748291015625, 0.2088623046875, 0.11474609375, 0.0606689453125, 0.1517333984375, 0.0...

embed

37999771_c0

37999771

haskell

0

Title: Haskell foldr algrebraic datatypes Problem title: Haskell foldr algrebraic datatypes Tags: haskell, algebraic-data-types Problem: Haskell foldr algrebraic datatypes I have solved all issues I had with functions but one is left. The foldr function works from last element to the first one and I need to get the dat...

Haskell foldr algrebraic datatypes Haskell foldr algrebraic datatypes haskell algebraic-data-types Test.HUnit Data.Char Prelude Data.Foldable Haskell QueueFunctor Test TestLabel TestList TestCase Foldable DQueue Empty Enqueue Show Read Tests sample1 sample2 DQueueTest Failure DQueueTest:1 QueueFunctors.hs:56 Haskell fo...

[ 0.00347900390625, -0.00787353515625, -0.0010223388671875, 0.0130615234375, -0.007415771484375, 0.00714111328125, 0.0164794921875, -0.0233154296875, -0.0177001953125, 0.01007080078125, -0.00958251953125, -0.01251220703125, 0.006072998046875, 0.00144195556640625, -0.01422119140625, -0.00...

[ 20625, 142508, 18344, 7569, 144, 53631, 219, 1771, 2053, 50986, 1556, 429, 2844, 10135, 8647, 27204, 6773, 11809, 84068, 822, 18345, 2886, 5813, 13388, 97249, 18770, 4063, 154663, 30077, 41732, 31678, 944, 17367, 4764, 121413, 391, 111337, 19...

[ 0.09246826171875, 0.22314453125, 0.141357421875, 0.22705078125, 0.04791259765625, 0.0281982421875, 0.1151123046875, 0.0267791748046875, 0.1463623046875, 0.187744140625, 0.079833984375, 0.04779052734375, 0.08770751953125, 0.06134033203125, 0.150146484375, 0.002777099609375, 0.13610839...

embed

28531685_c0

28531685

haskell

0

Title: Memoize Project Euler 116 in Haskell Problem title: Memoize Project Euler 116 in Haskell Tags: haskell, dynamic-programming Problem: Memoize Project Euler 116 in Haskell Below is my first attempt at this problem. It is basically a transliteration of my C++ solution, minus a global hash table used to memoize the ...

Memoize Project Euler 116 in Haskell Memoize Project Euler 116 in Haskell haskell dynamic-programming Memoize Project Euler Haskell fIter2 Memoize Project Euler 116 in Haskell Below is my first attempt at this problem. It is basically a transliteration of my C++ solution, minus a global hash table used to memoize the r...

[ -0.018310546875, -0.0194091796875, 0.0172119140625, -0.0201416015625, -0.00897216796875, 0.0003643035888671875, 0.00579833984375, 0.0050048828125, 0.006561279296875, -0.001983642578125, 0.031494140625, -0.0025177001953125, 0.0128173828125, -0.00341796875, -0.0026092529296875, 0.0129394...

[ 17443, 31, 20650, 27331, 5177, 603, 45773, 20625, 142508, 23, 1556, 84079, 28966, 1238, 720, 304, 17336, 5117, 81887, 2967, 198343, 3900, 39798, 313, 37223, 29806, 26948, 7964, 127, 23180, 163, 432, 50339, 32354, 28219, 62822, 6528, 105233, ...

[ 0.16064453125, 0.1280517578125, 0.1173095703125, 0.1502685546875, 0.1514892578125, 0.188232421875, 0.26953125, 0.1669921875, 0.225341796875, 0.0209197998046875, 0.162841796875, 0.1844482421875, 0.1004638671875, 0.1448974609375, 0.103515625, 0.09783935546875, 0.03924560546875, 0.023...

embed

70820367_c0

70820367

haskell

0

Title: Haskell Beginner, Calling Functions by their Names Problem title: Haskell Beginner, Calling Functions by their Names Tags: haskell, reflection Problem: Haskell Beginner, Calling Functions by their Names Trying the 99 puzzles to learning Haskell. A quality-of-life problem that I have is that every time I test a s...

Haskell Beginner, Calling Functions by their Names Haskell Beginner, Calling Functions by their Names haskell reflection Haskell Beginner Calling Functions Names mySolutionForQuestion12 testMySolutionForQuestion12 myInput1 myInput2 Haskell Beginner, Calling Functions by their Names Trying the 99 puzzles to learning Has...

[ 0.005126953125, 0.00274658203125, 0.0018310546875, 0.026611328125, -0.002899169921875, -0.009033203125, 0.00994873046875, -0.0140380859375, 0.00787353515625, -0.0125732421875, -0.0034027099609375, -0.00439453125, -0.015625, 0.0038299560546875, 0.006591796875, -0.004791259765625, 0.00...

[ 20625, 142508, 67053, 56, 26265, 28670, 10763, 390, 2363, 15757, 214, 1556, 44961, 759, 102588, 34, 18537, 195136, 1530, 3034, 31852, 4153, 7077, 418, 304, 40858, 10078, 104192, 52080, 31897, 4390, 24804, 2967, 765, 11907, 1733, 29806, 2806, ...

[ 0.184814453125, 0.23681640625, 0.1441650390625, 0.05322265625, 0.1510009765625, 0.17529296875, 0.07537841796875, 0.097900390625, 0.084716796875, 0.1541748046875, 0.0187530517578125, 0.136474609375, 0.1683349609375, 0.101318359375, 0.0880126953125, 0.0909423828125, 0.1153564453125, ...

embed

67655017_c1

67655017

haskell

1

{ pointerFV :: Ptr CInt , lengthFV :: CULong } instance Storable ForeignVector where sizeOf _ = {#sizeof CVector #} alignment _ = {#alignof CVector #} peek p = ForeignVector <$> {#get CVector->pointer #} p <*> {#get CVector->length #} p poke p (ForeignVector vecP l) = do {#set CVector.pointer #} p (castPtr vecP) {#set...

4aG8UE4NetrysPAD4QHBzzhdj5TCzbg Gs4ZWwoiN0w9AdvuZcYw2mWMeTgCZn3emX1nAN8glkGUCHV4DrC5CWgU7HfRTYA1CEU0TEZEIdL ZFOKsiV0Bpyn3BBdDB7 LEhx5q rZEL9KH Zxn6QYZ0L1hNMa45jzmfZ4pFuICYtjB R7jjAbXt17s4diiSYpy1m7uFAiAuuFbucGUeFkyxvBCopzrrC8b0FMJart6T5MlUhn1bEVRdrhOK IQ2q5XrnBtzSCSFj5NzHKEgoxNPEws6uyUW1BtYudE ATxl3soDYkCtj7NuSn0bgKsET...

[ 0.0177001953125, 0.0291748046875, -0.0301513671875, -0.005584716796875, -0.000865936279296875, -0.0157470703125, -0.0130615234375, -0.003326416015625, -0.00099945068359375, -0.0225830078125, -0.0013885498046875, -0.00110626220703125, 0.004608154296875, 0.0230712890625, -0.021484375, -0...

[ 201, 24447, 34368, 116908, 841, 571, 20257, 170, 758, 169, 11821, 527, 617, 1511, 1456, 14, 839, 2389, 434, 1126, 22409, 238, 1723, 304, 39, 13, 618, 177, 52215, 19, 363, 195, 1542, 418, 9330, 1019, 11016, 92, 724, 856, 441, 129781, ...

[ 0.054046630859375, 0.02337646484375, 0.06878662109375, 0.08502197265625, 0.00537109375, 0.00555419921875, 0.00384521484375, 0.0057373046875, 0.0057373046875, 0.005706787109375, 0.0050048828125, 0.0166778564453125, 0.006011962890625, 0.005767822265625, 0.005615234375, 0.005767822265625,...

embed

37556296_c0

37556296

haskell

0

Title: How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type Problem title: How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type Tags: haskell, type-inference Problem: How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as ph...

How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type How to use replace `Proxy :: Proxy a` with `type MyType a = Int` with `a` as phantom type haskell type-inference the How Proxy MyType Char LANGUAGE ScopedTypeVariables Could AllowAmbiguousTypes How to use replace `Proxy :: Proxy a...

[ -0.015380859375, 0.0023345947265625, -0.007293701171875, -0.00390625, -0.0093994140625, 0.004058837890625, 0.00592041015625, 0.0225830078125, 0.007293701171875, -0.0185546875, -0.002532958984375, 0.00119781494140625, -0.0033416748046875, -0.01531982421875, 0.006256103515625, 0.00561523...

[ 4527, 91995, 10752, 50878, 1984, 1250, 10, 50986, 2646, 196707, 360, 18, 11, 68743, 5928, 10644, 237, 1556, 142508, 69988, 21656, 98064, 182783, 297, 81827, 41566, 150567, 12282, 10821, 2203, 678, 75169, 52895, 20625, 43240, 84751, 6528, 3235...

[ 0.0880126953125, 0.1441650390625, 0.15869140625, 0.26708984375, 0.031982421875, 0.1524658203125, 0.1197509765625, 0.1881103515625, 0.1258544921875, 0.2373046875, 0.091552734375, 0.1055908203125, 0.12451171875, 0.0888671875, 0.1136474609375, 0.1783447265625, 0.0148468017578125, 0.06...

embed

7084090_c0

7084090

haskell

0

Title: What is the naming convention for typeclasses in Scala? Problem title: What is the naming convention for typeclasses in Scala? Tags: typeclass, scala, naming-conventions, haskell Problem: What is the naming convention for typeclasses in Scala? In Java world, the naming conventions for interfaces are pretty much ...

What is the naming convention for typeclasses in Scala? What is the naming convention for typeclasses in Scala? typeclass scala naming-conventions haskell What Scala Comparable Numeric Ordering Equal Show What is the naming convention for typeclasses in Scala? In Java world, the naming conventions for interfaces are pr...

[ 0.0135498046875, -0.00127410888671875, -0.00640869140625, 0.0186767578125, 0.01336669921875, 0.0052490234375, 0.00048828125, 0.00482177734375, -0.0152587890625, 0.017578125, -0.007537841796875, -0.0205078125, -0.01422119140625, -0.016357421875, -0.01007080078125, 0.00189208984375, -0...

[ 4865, 83, 70, 147453, 101805, 100, 10644, 67413, 90, 23, 152653, 11, 146232, 2271, 57241, 1556, 142508, 113307, 2886, 93511, 1771, 81206, 214, 241, 71723, 17367, 41925, 8999, 101758, 170920, 18507, 29479, 5154, 36746, 215667, 360, 18, 165164,...

[ 0.031951904296875, 0.0911865234375, 0.01849365234375, 0.2130126953125, 0.216552734375, 0.0308837890625, 0.229736328125, 0.268310546875, 0.1214599609375, 0.0755615234375, 0.197998046875, 0.15673828125, 0.196044921875, 0.010589599609375, 0.1182861328125, 0.0653076171875, 0.18896484375,...

embed

38462563_c0

38462563

haskell

0

Title: How to work with AST with Cofree annotation? Problem title: How to work with AST with Cofree annotation? Tags: recursion-schemes, haskell, abstract-syntax-tree, catamorphism, comonad Problem: How to work with AST with Cofree annotation? I have this simple Expr AST and I can easily convert it to String . import P...

How to work with AST with Cofree annotation? How to work with AST with Cofree annotation? recursion-schemes haskell abstract-syntax-tree catamorphism comonad Prelude qualified Data.Foldable Data.Functor.Foldable Data.Monoid Control.Comonad.Cofree How AST Cofree Expr Foldable ExprF Add Show Ord Functor Prelude.Foldable ...

[ -0.0225830078125, -0.0189208984375, 0.0047607421875, 0.01495361328125, 0.0036773681640625, 0.01141357421875, -0.019775390625, -0.002685546875, -0.001495361328125, -0.02734375, 0.00408935546875, -0.0255126953125, 0.0029449462890625, 0.0225830078125, 0.006805419921875, -0.0198974609375, ...

[ 11249, 4488, 678, 48963, 1311, 32087, 8668, 22062, 195625, 7560, 1556, 142508, 164789, 86531, 62600, 178851, 533, 9169, 822, 217225, 11809, 18345, 2886, 18770, 48899, 27131, 712, 10625, 60075, 42, 30077, 71, 919, 29117, 17367, 35379, 28670, 1...

[ 0.024871826171875, 0.0987548828125, 0.1041259765625, 0.1771240234375, 0.12939453125, 0.295654296875, 0.148193359375, 0.08740234375, 0.06256103515625, 0.0155792236328125, 0.007537841796875, 0.1439208984375, 0.0830078125, 0.0478515625, 0.06317138671875, 0.058349609375, 0.02537536621093...

embed

40970726_c0

40970726

haskell

0

Title: Using newtype in Data.Array.Unboxed with ghc 7.10 Problem title: Using newtype in Data.Array.Unboxed with ghc 7.10 Tags: coercion, haskell, types Problem: Using newtype in Data.Array.Unboxed with ghc 7.10 This worked fine in ghc 7.8.4, but fails in 7.10.3: {-# LANGUAGE DeriveGeneric #-} {-# LANGUAGE GeneralizedN...

Using newtype in Data.Array.Unboxed with ghc 7.10 Using newtype in Data.Array.Unboxed with ghc 7.10 coercion haskell types qualified GHC.Generics the type Using Data.Array.Unboxed LANGUAGE DeriveGeneric GeneralizedNewtypeDeriving Foo Generic Elt Ord Show Num Integral Real Enum A.IArray A.UArray MyArr my.hs:9:75 Couldn ...

[ -0.00189971923828125, 0.0022735595703125, 0.0277099609375, -0.004486083984375, -0.00122833251953125, 0.0047607421875, -0.011474609375, -0.006622314453125, 0.000171661376953125, 0.003570556640625, -0.006988525390625, -0.01007080078125, 0.0123291015625, -0.01806640625, -0.0029144287109375,...

[ 345, 3525, 50986, 23, 11809, 7614, 7092, 14256, 11728, 297, 31380, 238, 2861, 963, 552, 56, 6447, 1556, 142508, 52895, 217225, 527, 73265, 135932, 10644, 3358, 98064, 1310, 5844, 9082, 46568, 47731, 9572, 88342, 540, 18, 35379, 17367, 52782...

[ 0.111572265625, 0.18115234375, 0.33544921875, 0.021026611328125, 0.125244140625, 0.140869140625, 0.1748046875, 0.0880126953125, 0.196533203125, 0.01654052734375, 0.1102294921875, 0.1090087890625, 0.1241455078125, 0.21142578125, 0.0628662109375, 0.1361083984375, 0.0771484375, 0.1086...

embed

39799887_c0

39799887

haskell

0

Title: haskell initial accumulator 'null' value Problem title: haskell initial accumulator 'null' value Tags: haskell Problem: haskell initial accumulator 'null' value I have a seemingly simple Haskell problem and with my limited knowledge I'm not sure what terms to search for in order to solve it. ...

haskell initial accumulator 'null' value haskell initial accumulator 'null' value haskell x:xs Nothing Just haskell initial accumulator 'null' value I have a seemingly simple Haskell problem and with my limited knowledge I'm not sure what terms to search for in order to solve it. I've tried to solve...

[ -0.0130615234375, 0.02392578125, 0.0218505859375, 0.0272216796875, -0.0011749267578125, 0.0245361328125, 0.025634765625, -0.004608154296875, -0.0030364990234375, 0.0033416748046875, 0.00982666015625, 0.027099609375, 0.0216064453125, 0.0205078125, -0.00518798828125, -0.013427734375, 0...

[ 1556, 142508, 61475, 183278, 1290, 3768, 139550, 34292, 1022, 12, 425, 182747, 9563, 48903, 8781, 20625, 2967, 69407, 33938, 86869, 382, 10078, 44402, 148390, 171763, 5303, 7273, 1660, 3687, 31958, 51646, 93, 58134, 179140, 4488, 19777, 83, 1...

[ 0.1702880859375, 0.2196044921875, 0.222900390625, 0.2218017578125, 0.1497802734375, 0.096923828125, 0.2357177734375, 0.200927734375, 0.099609375, 0.06500244140625, 0.09521484375, 0.1016845703125, 0.04327392578125, 0.0229949951171875, 0.0155181884765625, 0.100341796875, 0.087524414062...

embed

4653102_c0

4653102

haskell

0

Title: I can't seem to figure out type variables mixed with classes Problem title: I can't seem to figure out type variables mixed with classes Tags: haskell Problem: I can't seem to figure out type variables mixed with classes I pretty much understand 3/4 the rest of the language, but every time I dip my fee...

I can't seem to figure out type variables mixed with classes I can't seem to figure out type variables mixed with classes haskell Room Show HasArea Num Couldn Dungeon.hs:11:16 Dungeon.hs:13:14 I can't seem to figure out type variables mixed with classes I pretty much understand 3/4 the rest of the language, b...

[ -0.007568359375, 0.0235595703125, 0.015625, -0.00799560546875, -0.00262451171875, 0.014892578125, -0.0250244140625, -0.007049560546875, 0.017578125, -0.032958984375, -0.01239013671875, -0.033203125, 0.0172119140625, -0.0224609375, -0.040283203125, 0.0040283203125, -0.0029449462890625...

[ 831, 3768, 48903, 26366, 1810, 10644, 77336, 17664, 297, 678, 61112, 1556, 142508, 38484, 17367, 20625, 284, 1283, 52782, 191147, 19, 125669, 13, 191, 127, 19993, 22354, 22618, 22635, 18, 28219, 83849, 10588, 46876, 11907, 45, 74261, 91084, ...

[ 0.03314208984375, 0.053863525390625, 0.04241943359375, 0.07781982421875, 0.01300048828125, 0.2293701171875, 0.278076171875, 0.1898193359375, 0.0460205078125, 0.1104736328125, 0.2364501953125, 0.133056640625, 0.213623046875, 0.1817626953125, 0.147705078125, 0.1358642578125, 0.01034545...

embed

32196993_c0

32196993

haskell

0

Title: Why does this code run slower on spoj, triggering the timeout? Problem title: Why does this code run slower on spoj, triggering the timeout? Tags: haskell Problem: Why does this code run slower on spoj, triggering the timeout? I was trying to solve this problem on spoj: http://www.spoj.com/problems/PALIN/ My cod...

Why does this code run slower on spoj, triggering the timeout? Why does this code run slower on spoj, triggering the timeout? haskell Control.Monad Why l:ls Integer x:xs Bool Why does this code run slower on spoj, triggering the timeout? I was trying to solve this problem on spoj: http://www.spoj.com/problems/PALIN/ My...

[ -0.03564453125, 0.01806640625, -0.006317138671875, 0.0028228759765625, -0.00151824951171875, 0.0225830078125, 0.01171875, -0.0093994140625, -0.00689697265625, -0.0400390625, 0.026123046875, -0.0205078125, -0.0272216796875, -0.00677490234375, 0.009765625, 0.004638671875, 0.02429199218...

[ 44084, 14602, 903, 18151, 11675, 72803, 56, 98, 36976, 185553, 1733, 6056, 1556, 142508, 27131, 46674, 712, 96, 12, 8080, 44401, 1022, 425, 7, 2460, 929, 86869, 2967, 26549, 64, 38953, 12236, 46610, 43240, 5885, 4271, 26367, 1766, 87344, ...

[ 0.1241455078125, 0.0178070068359375, 0.07672119140625, 0.1739501953125, 0.0987548828125, 0.2308349609375, 0.1531982421875, 0.0928955078125, 0.25537109375, 0.1627197265625, 0.17431640625, 0.1717529296875, 0.1295166015625, 0.225830078125, 0.2218017578125, 0.1456298828125, 0.16650390625...

embed

51848587_c0

51848587

haskell

0

Title: List constructor names using generics in haskell Problem title: List constructor names using generics in haskell Tags: haskell Problem: List constructor names using generics in haskell I know how to list constructor names in the following way: {-# LANGUAGE DeriveGeneric #-} {-# LANGUAGE FlexibleContexts #-} {-# ...

List constructor names using generics in haskell List constructor names using generics in haskell haskell generics Data.Proxy GHC.Generics List LANGUAGE DeriveGeneric FlexibleContexts FlexibleInstances PolyKinds ScopedTypeVariables TypeApplications TypeOperators Names Proxy Constructor Test Foo Bar Baz Generic Rep List...

[ 0.00015735626220703125, -0.013916015625, -0.01007080078125, 0.004913330078125, 0.01422119140625, 0.0108642578125, -0.0030059814453125, 0.0185546875, 0.00982666015625, -0.0167236328125, -0.01043701171875, -0.032958984375, 0.0107421875, 0.004058837890625, -0.0194091796875, 0.01025390625,...

[ 32036, 64549, 748, 123055, 17368, 189534, 7, 1556, 142508, 23, 11809, 10752, 50878, 527, 73265, 135932, 12259, 98064, 1310, 5844, 180842, 2661, 22829, 116071, 63306, 7250, 182783, 196707, 81827, 60457, 182867, 156823, 22230, 15757, 1250, 82084, ...

[ 0.1583251953125, 0.1778564453125, 0.1348876953125, 0.1641845703125, 0.05181884765625, 0.248046875, 0.0576171875, 0.1280517578125, 0.2218017578125, 0.01190185546875, 0.023956298828125, 0.087158203125, 0.25439453125, 0.0179595947265625, 0.1134033203125, 0.049591064453125, 0.08386230468...

embed

43918789_c0

43918789

haskell

0

Title: What is wrong with pattern matching of existential types in Haskell? Problem title: What is wrong with pattern matching of existential types in Haskell? Tags: pattern-matching, haskell, existential-type Problem: What is wrong with pattern matching of existential types in Haskell? Why it is not possible to patter...

What is wrong with pattern matching of existential types in Haskell? What is wrong with pattern matching of existential types in Haskell? pattern-matching haskell existential-type Control.Monad.Identity What Haskell GADT Instead LANGUAGE ExistentialQuantification MyClass Char What is wrong with pattern matching of exis...

[ -0.0166015625, 0.0172119140625, -0.00066375732421875, 0.005859375, 0.00531005859375, 0.00421142578125, -0.015625, 0.0115966796875, 0.003082275390625, -0.02197265625, 0.0294189453125, -0.009521484375, 0.01190185546875, -0.0234375, 0.0145263671875, -0.00872802734375, 0.0005950927734375...

[ 4865, 83, 44691, 678, 103510, 14858, 214, 99707, 15403, 52895, 20625, 142508, 111, 23, 98753, 1556, 50986, 27131, 46674, 712, 37379, 41072, 175399, 98064, 122688, 118, 18, 41274, 2646, 140803, 21656, 44084, 959, 7722, 2633, 248, 7440, 2886, ...

[ 0.03363037109375, 0.03857421875, 0.1568603515625, 0.0660400390625, 0.2156982421875, 0.2149658203125, 0.06744384765625, 0.1949462890625, 0.1279296875, 0.193115234375, 0.1343994140625, 0.2283935546875, 0.01153564453125, 0.038970947265625, 0.2017822265625, 0.110595703125, 0.157104492187...

embed

8647977_c0

8647977

haskell

0

Title: Composite type with extractor type functions Problem title: Composite type with extractor type functions Tags: types, haskell Problem: Composite type with extractor type functions Let's say I want to create a complex data structure consisting of multiple mutually recursive data types, with multiple type variable...

Composite type with extractor type functions Composite type with extractor type functions types haskell Composite Foo FooA FooB Bar FooC FooD Baz BarA BarB BarC BarD BazA BazB BazC BazD GetX GetY GetZ Composite type with extractor type functions Let's say I want to create a complex data structure consisting of multiple...

[ 0.00102996826171875, -0.004486083984375, -0.0026397705078125, 0.028076171875, 0.0037994384765625, -0.00142669677734375, -0.00946044921875, -0.000110626220703125, 0.01348876953125, -0.00860595703125, -0.01416015625, -0.01165771484375, -0.007781982421875, 0.0203857421875, -0.0101318359375,...

[ 3288, 77087, 10644, 678, 4173, 18770, 32354, 13, 52895, 1556, 142508, 9572, 31, 284, 571, 3253, 441, 397, 36490, 20779, 1542, 1723, 1511, 3444, 28282, 27140, 2053, 45646, 58055, 48716, 199849, 195625, 77336, 160404, 3917, 831, 57134, 133, 1...

[ 0.1343994140625, 0.25146484375, 0.240234375, 0.1270751953125, 0.2412109375, 0.2188720703125, 0.2135009765625, 0.06610107421875, 0.2308349609375, 0.156005859375, 0.260009765625, 0.12646484375, 0.058837890625, 0.059600830078125, 0.097900390625, 0.1470947265625, 0.05426025390625, 0.07...

embed

31659975_c1

31659975

haskell

1

arr, StaticDraw) enableAttribLocations [0, 1] setAttribPointers return bufferObject vertexNumComponents :: NumComponents vertexNumComponents = 4 colorNumComponents :: NumComponents colorNumComponents = 4 initializeState :: IO State initializeState = do bufferObject <- createVertexBuffer triangleVertexes program <- ini...

[ -0.005615234375, -0.00335693359375, -0.002777099609375, -0.00628662109375, -0.02001953125, 0.007293701171875, 0.00726318359375, 0.000698089599609375, -0.00897216796875, -0.00433349609375, -0.0262451171875, -0.01806640625, 0.0024566650390625, -0.01953125, -0.017822265625, -0.01043701171...

[ 187, 42, 71465, 238, 397, 81456, 22, 2886, 28848, 18, 11049, 15363, 120639, 2389, 5423, 147534, 1314, 30646, 373, 18234, 75161, 493, 24371, 316, 10770, 54137, 1984, 52782, 7, 2203, 201, 10576, 61475, 20650, 135206, 13, 17780, 22836, 54, 2...

[ 0.078369140625, 0.10546875, 0.198974609375, 0.06671142578125, 0.037567138671875, 0.2127685546875, 0.0911865234375, 0.135986328125, 0.028045654296875, 0.0670166015625, 0.1903076171875, 0.148193359375, 0.1259765625, 0.0313720703125, 0.160888671875, 0.1319580078125, 0.0657958984375, 0...

embed