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
43729170_c1	43729170	haskell	1	so: h :: D t -> ... h = ... f (DWrap _ x) = h x And either way completeness checking should make sure I don't do anything silly. Except this approach won't work. Firstly, because t is not an ordinary type of kind * , it's of kind T . Secondly T1 isn't even of type 'T1 , it's a member of the type T , just like T2 , T3 ...	so: h :: D t -> ... h = ... f (DWrap _ x) = h x And either way completeness checking should make sure I don't do anything silly. Except this approach won't work. Firstly, because t is not an ordinary type of kind * , it's of kind T . Secondly T1 isn't even of type 'T1 , it's a member of the type T , just like T2 , T3 ...	[ -0.01361083984375, 0.0086669921875, -0.00799560546875, -0.0113525390625, 0.0010223388671875, -0.0191650390625, -0.0242919921875, -0.003265380859375, 0.007720947265625, -0.004608154296875, -0.002410888671875, -0.00958251953125, 0.00958251953125, 0.00018405914306640625, -0.0179443359375, ...	[ 1096, 1984, 391, 808, 33079, 2203, 1238, 397, 1456, 13631, 1022, 40101, 28484, 7432, 175199, 12097, 218288, 51515, 23742, 18, 4488, 6637, 959, 23335, 10644, 8562, 661, 111, 384, 418, 3853, 618, 32786, 304, 363, 4527, 9393, 99710, 26518, 1...	[ 0.1337890625, 0.1268310546875, 0.11328125, 0.1785888671875, 0.0654296875, 0.06842041015625, 0.1212158203125, 0.010498046875, 0.054107666015625, 0.20361328125, 0.0906982421875, 0.0157318115234375, 0.178466796875, 0.08642578125, 0.18359375, 0.0440673828125, 0.00775146484375, 0.106567...	embed
65197507_c1	65197507	haskell	1	ghc.mk:973: install_packages] Error 1 make: *** [Makefile:51: install] Error 2 Received ExitFailure 2 when running Raw command: /usr/bin/make install Run from: /home/me/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.2.temp/ghc-8.10.2/ Error: Error encountered while installing GHC with make install run in /home/me/.stack/...	ghc.mk:973: install_packages] Error 1 make: *** [Makefile:51: install] Error 2 Received ExitFailure 2 when running Raw command: /usr/bin/make install Run from: /home/me/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.2.temp/ghc-8.10.2/ Error: Error encountered while installing GHC with make install run in /home/me/.stack/...	[ -0.002899169921875, 0.00189971923828125, 0.02392578125, 0.01104736328125, -0.0004558563232421875, -0.0157470703125, -0.033203125, -0.0478515625, -0.00787353515625, 0.0576171875, 0.00921630859375, -0.0238037109375, 0.004180908203125, -0.00726318359375, -0.0137939453125, 0.011962890625, ...	[ 31380, 238, 19201, 201208, 20600, 29102, 52467, 212059, 106, 3249, 24428, 76978, 29822, 37374, 116, 93908, 14, 5443, 217, 17647, 379, 3408, 51042, 109997, 75101, 42, 64, 7568, 55898, 28398, 1295, 29552, 282, 5, 590, 2594, 18749, 7, 15276, ...	[ 0.15625, 0.17138671875, 0.140380859375, 0.269287109375, 0.2025146484375, 0.1439208984375, 0.017974853515625, 0.1839599609375, 0.065673828125, 0.1563720703125, 0.09356689453125, 0.0933837890625, 0.182861328125, 0.135009765625, 0.10498046875, 0.012969970703125, 0.002410888671875, 0.1...	embed
65859615_c0	65859615	haskell	0	Title: How to add command line parameters to a diagrams animation? Problem title: How to add command line parameters to a diagrams animation? Tags: haskell-diagrams, haskell Problem: How to add command line parameters to a diagrams animation? With "image" diagrams I can just pass a function that expects parameters (her...	How to add command line parameters to a diagrams animation? How to add command line parameters to a diagrams animation? haskell-diagrams haskell Diagrams.Prelude Diagrams.Backend.Cairo.CmdLine a How circle.png DiagramsWithParameters Double Diagram Diagrams.Backend.CmdLine.ToResult QDiagram Any How to add command line p...	[ -0.0152587890625, 0.00946044921875, -0.01385498046875, 0.01141357421875, -0.0152587890625, 0.0079345703125, 0.005279541015625, -0.001617431640625, -0.007049560546875, -0.0230712890625, -0.00286865234375, -0.00921630859375, 0.000492095947265625, 0.001434326171875, -0.0050048828125, -0.0...	[ 11249, 15190, 75101, 13315, 171859, 7, 47, 117233, 114205, 1556, 142508, 3390, 25561, 4512, 822, 8699, 54686, 93232, 42154, 133, 128468, 194583, 55292, 29089, 107172, 7763, 7136, 2396, 72838, 10, 17106, 37926, 27875, 32354, 41206, 177, 5201, ...	[ 0.068359375, 0.1658935546875, 0.2386474609375, 0.181396484375, 0.2509765625, 0.078369140625, 0.08563232421875, 0.249267578125, 0.2401123046875, 0.07598876953125, 0.1800537109375, 0.1392822265625, 0.182373046875, 0.146240234375, 0.0625, 0.117919921875, 0.0780029296875, 0.15368652343...	embed
14084574_c0	14084574	haskell	0	Title: Universal memoization in Haskell Problem title: Universal memoization in Haskell Tags: memoization, haskell Problem: Universal memoization in Haskell Possible Duplicate: When is memoization automatic in GHC Haskell? It looks like Haskell does not memoize all and every function by default - please note, I'm new t...	Universal memoization in Haskell Universal memoization in Haskell memoization haskell Universal Haskell Universal memoization in Haskell It looks like Haskell does not memoize all and every function by default - please note, I'm new to Haskell, so I might have that wrong, and I might be very naive about "universal memo...	[ 0.0025634765625, 0.0179443359375, 0.0264892578125, -0.0216064453125, 0.00128173828125, -0.0040283203125, 0.005950927734375, 0.007049560546875, 0.01007080078125, -0.022705078125, -0.003570556640625, -0.016845703125, 0.0157470703125, 0.0022430419921875, 0.00090789794921875, 0.01586914062...	[ 53900, 163, 432, 47691, 23, 20625, 142508, 1556, 33342, 14602, 959, 20650, 756, 11907, 32354, 114977, 3525, 44691, 13648, 4552, 24, 5844, 49545, 289, 9655, 28219, 2174, 3038, 831, 2499, 46876, 17366, 78, 127125, 51006, 22691, 193844, 37842, ...	[ 0.226806640625, 0.1544189453125, 0.197021484375, 0.1451416015625, 0.05242919921875, 0.16748046875, 0.267822265625, 0.1318359375, 0.0601806640625, 0.0701904296875, 0.1185302734375, 0.1539306640625, 0.1021728515625, 0.1331787109375, 0.2188720703125, 0.24169921875, 0.035125732421875, ...	embed
50195063_c0	50195063	haskell	0	Title: Timestamped values Problem title: Timestamped values Tags: haskell, newtype Problem: Timestamped values I wanted a type for timestamped values that had an appropriate Semigroup instance (latest value wins). It turns out that Max (Arg UTCTime a) does exactly what I want, but is really awkward to work with directl...	Timestamped values Timestamped values haskell newtype Data.Semigroup Data.Thyme Data.Thyme.Clock Timestamped Semigroup Max Arg UTCTime Stamped Show Functor Many TVar STM Timestamped values I wanted a type for timestamped values that had an appropriate Semigroup instance (latest value wins). It turns out that Max (Arg U...	[ -0.0218505859375, 0.01361083984375, 0.0164794921875, 0.0023345947265625, 0.01416015625, -0.00494384765625, -0.01251220703125, 0.007354736328125, 0.01043701171875, -0.0272216796875, 0.0108642578125, 0.0024871826171875, -0.005462646484375, -0.00653076171875, -0.000308990478515625, -0.001...	[ 19114, 2537, 20051, 142424, 1556, 142508, 3525, 50986, 11809, 266, 51588, 53, 282, 21135, 84420, 9920, 1172, 177, 99577, 70059, 159703, 297, 17367, 28670, 18770, 52455, 1910, 147, 10111, 36663, 10644, 20028, 95307, 110527, 143, 6954, 34292, 1...	[ 0.1142578125, 0.2086181640625, 0.133544921875, 0.20068359375, 0.09588623046875, 0.2259521484375, 0.06951904296875, 0.2313232421875, 0.0872802734375, 0.0662841796875, 0.1865234375, 0.00732421875, 0.074951171875, 0.1119384765625, 0.144287109375, 0.216064453125, 0.06146240234375, 0.02...	embed
75384937_c0	75384937	haskell	0	Title: Derive an optimized case-of expression from a function that takes a closed set as its input Problem title: Derive an optimized case-of expression from a function that takes a closed set as its input Tags: haskell Problem: Derive an optimized case-of expression from a function that takes a closed set as its input...	Derive an optimized case-of expression from a function that takes a closed set as its input Derive an optimized case-of expression from a function that takes a closed set as its input haskell a Derive Value Ord Show Derive an optimized case-of expression from a function that takes a closed set as its input I have a clo...	[ 0.0185546875, -0.00909423828125, 0.00823974609375, -0.006805419921875, 0.01446533203125, 0.002227783203125, 0.00171661376953125, -0.01483154296875, 0.0201416015625, -0.0272216796875, 0.001983642578125, 0.011962890625, 0.01214599609375, -0.00836181640625, 0.00286865234375, -0.0216064453...	[ 1310, 5844, 15572, 29367, 7225, 4390, 125195, 1295, 32354, 51776, 155738, 5423, 237, 107730, 1556, 142508, 190060, 35379, 17367, 6863, 142424, 2053, 45646, 33636, 12989, 3871, 96760, 3934, 360, 18, 5809, 1884, 76208, 27140, 2481, 180, 3444, 2...	[ 0.152099609375, 0.17626953125, 0.1778564453125, 0.1103515625, 0.1680908203125, 0.1634521484375, 0.2178955078125, 0.036224365234375, 0.175048828125, 0.047027587890625, 0.19677734375, 0.18359375, 0.0220489501953125, 0.1790771484375, 0.1131591796875, 0.2315673828125, 0.1854248046875, ...	embed
45777703_c0	45777703	haskell	0	Title: Turning on assertions while compiling with Haskell's stack build system Problem title: Turning on assertions while compiling with Haskell's stack build system Tags: haskell-stack, haskell Problem: Turning on assertions while compiling with Haskell's stack build system I am using Stack 9.0 as my Haskell...	Turning on assertions while compiling with Haskell's stack build system Turning on assertions while compiling with Haskell's stack build system haskell-stack haskell Control.Exception Control.Exception.Base Turning Haskell Hello World Version x86_64 hpack-0.14.0 Turning on assertions while compiling with Hask...	[ -0.004486083984375, 0.007476806640625, -0.0106201171875, 0.00592041015625, -0.001190185546875, 0.00116729736328125, -0.0040283203125, 0.0216064453125, -0.01806640625, 0.00958251953125, 0.0059814453125, 0.0020904541015625, -0.009521484375, 0.01519775390625, 0.017578125, 0.025390625, 0...	[ 4252, 98, 10, 16865, 5256, 12960, 9969, 49725, 678, 20625, 142508, 3768, 177261, 45367, 5426, 1556, 590, 2594, 27131, 63928, 63473, 35378, 6661, 40647, 15276, 13307, 1096, 29102, 102014, 151152, 17368, 6512, 3569, 2389, 13452, 156672, 1340, 7...	[ 0.116943359375, 0.188232421875, 0.10308837890625, 0.2347412109375, 0.1343994140625, 0.043548583984375, 0.1546630859375, 0.0889892578125, 0.0859375, 0.1143798828125, 0.1851806640625, 0.020477294921875, 0.1864013671875, 0.152587890625, 0.072021484375, 0.0748291015625, 0.0667724609375, ...	embed
35101844_c0	35101844	haskell	0	Title: Running `cabal repl` as a super-user (on Linux) Problem title: Running `cabal repl` as a super-user (on Linux) Tags: usb, sandbox, haskell, cabal Problem: Running `cabal repl` as a super-user (on Linux) The usb package is not on stackage and I created a cabal sandbox to play with it. Code like the package's exam...	Running `cabal repl` as a super-user (on Linux) Running `cabal repl` as a super-user (on Linux) usb sandbox haskell cabal Running Linux USB Permission Running `cabal repl` as a super-user (on Linux) The usb package is not on stackage and I created a cabal sandbox to play with it. Code like the package's example.hs is n...	[ -0.01324462890625, 0.008056640625, 0.01043701171875, 0.005950927734375, -0.0068359375, -0.00015544891357421875, 0.00494384765625, -0.0001163482666015625, -0.004974365234375, -0.007659912109375, 0.01275634765625, -0.0155029296875, -0.0034027099609375, 0.0118408203125, -0.005645751953125, ...	[ 28398, 408, 3571, 456, 2424, 237, 10, 1601, 9, 65918, 191, 29908, 1821, 275, 19096, 11728, 1556, 142508, 109524, 10273, 908, 21150, 98169, 959, 177261, 4588, 75935, 11301, 28864, 27781, 127, 20697, 75101, 11675, 89554, 3871, 57849, 48993, 1...	[ 0.1383056640625, 0.1199951171875, 0.2293701171875, 0.1488037109375, 0.253662109375, 0.079833984375, 0.0478515625, 0.184814453125, 0.030029296875, 0.2073974609375, 0.055419921875, 0.2015380859375, 0.06982421875, 0.0699462890625, 0.095458984375, 0.16845703125, 0.0850830078125, 0.1879...	embed
29164392_c0	29164392	haskell	0	Title: Is the signal system of Elm available as a Haskell library? Problem title: Is the signal system of Elm available as a Haskell library? Tags: haskell, frp, elm Problem: Is the signal system of Elm available as a Haskell library? For the task I'm working on, the signal system of the Elm programming language seems ...	Is the signal system of Elm available as a Haskell library? Is the signal system of Elm available as a Haskell library? haskell frp elm Elm Haskell Is the signal system of Elm available as a Haskell library? For the task I'm working on, the signal system of the Elm programming language seems to be an appropriate soluti...	[ 0.0019683837890625, 0.0191650390625, 0.007049560546875, 0.0128173828125, -0.0146484375, 0.0224609375, -0.01531982421875, 0.01129150390625, -0.000885009765625, -0.0164794921875, -0.01519775390625, -0.01708984375, 0.00799560546875, 0.03271484375, -0.001129150390625, -0.01416015625, 0.0...	[ 2071, 26073, 5426, 540, 39, 19882, 237, 20625, 142508, 35773, 1294, 70, 10, 1556, 14119, 254, 88, 111, 66211, 20697, 56037, 46876, 37202, 95307, 29806, 759, 34166, 181135, 43315, 32354, 29479, 23, 63769, 64549, 41382, 76228, 110, 43240, 188...	[ 0.034515380859375, 0.2462158203125, 0.1798095703125, 0.2059326171875, 0.216064453125, 0.160888671875, 0.099365234375, 0.1142578125, 0.2255859375, 0.2022705078125, 0.1458740234375, 0.022918701171875, 0.04315185546875, 0.0968017578125, 0.00616455078125, 0.046600341796875, 0.13391113281...	embed
42309713_c1	42309713	haskell	1	import qualified Data.Array.Repa as R import Data.Array.Repa(Z(..), (:.)(..), U, DIM2) array :: R.Array U DIM2 a array = -- ... mappedArray = R.traverse array id (\i (Z :. x :. y) -> unsafePerformIO $ foo x y (i (Z :. x :. y))) result = R.computeP mappedArray Note that R.traverse is not Data.Traversable(traverse) . As...	import qualified Data.Array.Repa as R import Data.Array.Repa(Z(..), (:.)(..), U, DIM2) array :: R.Array U DIM2 a array = -- ... mappedArray = R.traverse array id (\i (Z :. x :. y) -> unsafePerformIO $ foo x y (i (Z :. x :. y))) result = R.computeP mappedArray Note that R.traverse is not Data.Traversable(traverse) . As...	[ -0.01611328125, 0.021484375, -0.0201416015625, 0.0076904296875, 0.00183868408203125, 0.0086669921875, 0.0050048828125, -0.01953125, 0.0128173828125, -0.050048828125, 0.01068115234375, 0.01202392578125, 0.0091552734375, 0.00885009765625, -0.00061798095703125, 0.004974365234375, -0.014...	[ 24927, 217225, 11809, 7614, 7092, 4332, 763, 237, 627, 1511, 345, 175546, 10461, 10298, 53, 304, 291, 48398, 1517, 37676, 3447, 113, 51, 115840, 15277, 5037, 17780, 3650, 5775, 1022, 16750, 58875, 6743, 683, 959, 28542, 7864, 2886, 33742, ...	[ 0.1754150390625, 0.206787109375, 0.1317138671875, 0.1197509765625, 0.181396484375, 0.173583984375, 0.2213134765625, 0.030059814453125, 0.16455078125, 0.0765380859375, 0.0787353515625, 0.138671875, 0.0963134765625, 0.1226806640625, 0.047882080078125, 0.121826171875, 0.07489013671875, ...	embed
9509350_c0	9509350	haskell	0	Title: What's preferred among liftM, lilftA, etc Problem title: What's preferred among liftM, lilftA, etc Tags: haskell Problem: What's preferred among liftM, lilftA, etc Lately I've been writing FFI code that returns a data structure in the IO monad. For example: peek p = Vec3 <$> (#peek aiVector3D, x) p <*>...	What's preferred among liftM, lilftA, etc What's preferred among liftM, lilftA, etc haskell What Vec3 aiVector3D io1 io2 io3 liftA3 liftM3 Applicative Monad liftA..liftA3 liftM..liftM5 What's preferred among liftM, lilftA, etc Lately I've been writing FFI code that returns a data structure in the IO monad. Fo...	[ -0.01129150390625, 0.01544189453125, -0.01190185546875, 0.01129150390625, 0.0130615234375, 0.004241943359375, -0.00518798828125, 0.000583648681640625, 0.0091552734375, -0.0206298828125, 0.013916015625, -0.0269775390625, 0.00927734375, 0.00909423828125, -0.01251220703125, -0.00369262695...	[ 3768, 12601, 2822, 54940, 60520, 594, 96, 379, 2480, 284, 1556, 142508, 4865, 52884, 363, 1300, 26455, 18770, 397, 22995, 5659, 11048, 4935, 60331, 71, 104501, 758, 32562, 563, 22724, 18151, 30646, 2053, 45646, 17780, 2667, 712, 831, 5351, ...	[ 0.053009033203125, 0.162109375, 0.12158203125, 0.13134765625, 0.2366943359375, 0.2130126953125, 0.034942626953125, 0.0843505859375, 0.1463623046875, 0.1669921875, 0.116455078125, 0.23974609375, 0.019287109375, 0.1351318359375, 0.1185302734375, 0.0938720703125, 0.13916015625, 0.1208...	embed
57580913_c1	57580913	haskell	1	2.3.3) haskell-src-exts-1.20.3 from stack configuration does not match <1.20 && >=1.18 (latest matching version is 1.19.1) hlint-2.1.11 from stack configuration does not match <2.1 && >=2.0.8 (latest matching version is 2.0.15) monad-journal-0.8.1 from stack configuration does not match <0.8 && >=0.4 (latest matching v...	2.3.3) haskell-src-exts-1.20.3 from stack configuration does not match <1.20 && >=1.18 (latest matching version is 1.19.1) hlint-2.1.11 from stack configuration does not match <2.1 && >=2.0.8 (latest matching version is 2.0.15) monad-journal-0.8.1 from stack configuration does not match <0.8 && >=0.4 (latest matching v...	[ -0.018310546875, 0.01556396484375, 0.026611328125, -0.003875732421875, 0.019775390625, 0.007049560546875, -0.0361328125, -0.0062255859375, -0.005584716796875, 0.03955078125, -0.00156402587890625, -0.042236328125, 0.02001953125, 0.01336669921875, 0.01275634765625, 0.018310546875, 0.01...	[ 59811, 21320, 1556, 142508, 19437, 3355, 933, 48400, 170179, 1295, 177261, 180346, 959, 14858, 1549, 1819, 11389, 2947, 75084, 4288, 68107, 1662, 132208, 16655, 62155, 2667, 712, 188131, 206730, 121254, 43922, 2500, 9007, 11048, 4935, 2592, 132...	[ 0.164794921875, 0.1182861328125, 0.1240234375, 0.2479248046875, 0.1654052734375, 0.0947265625, 0.1424560546875, 0.087158203125, 0.1790771484375, 0.01239013671875, 0.1627197265625, 0.1768798828125, 0.080322265625, 0.2069091796875, 0.1099853515625, 0.10064697265625, 0.1195068359375, ...	embed
51736130_c0	51736130	haskell	0	Title: A function for returning part of a product or record depending on parameter and requested return type Problem title: A function for returning part of a product or record depending on parameter and requested return type Tags: haskell, scrap-your-boilerplate, generic-programming Problem: A function for returning p...	A function for returning part of a product or record depending on parameter and requested return type A function for returning part of a product or record depending on parameter and requested return type haskell scrap-your-boilerplate generic-programming MyProduct Bool Boolean Double AnotherProduct Maybe Char Nothing G...	[ -0.00762939453125, -0.00115203857421875, 0.002593994140625, 0.006683349609375, -0.0103759765625, 0.00909423828125, -0.021240234375, -0.0162353515625, 0.0062255859375, -0.0037841796875, 0.005889892578125, -0.0130615234375, -0.02783203125, -0.00180816650390625, 0.0040283203125, -0.012451...	[ 62, 32354, 100, 30646, 214, 2831, 12996, 707, 17164, 96819, 171859, 50336, 297, 10644, 8, 1556, 142508, 120948, 154176, 34759, 92558, 189534, 28966, 2646, 10752, 77193, 2460, 929, 73783, 34677, 107172, 116267, 83425, 21656, 182747, 88342, 136, ...	[ 0.0679931640625, 0.23486328125, 0.0472412109375, 0.248046875, 0.09332275390625, 0.1494140625, 0.2371826171875, 0.0265045166015625, 0.1761474609375, 0.169921875, 0.2027587890625, 0.1776123046875, 0.04095458984375, 0.2032470703125, 0.013916015625, 0.1419677734375, 0.2529296875, 0.141...	embed
28500006_c0	28500006	haskell	0	Title: How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? Problem title: How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? Tags: adhoc-polymorphism, haskell, io, output, string Problem: How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? I use encode (Haskell type via JSON to a string):...	How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? adhoc-polymorphism haskell io output string GHC.Generics Data.Aeson How Data.ByteString.Lazy.Internal.ByteString valencies.lhs:182:22 Couldn Char Expected Actual CALL How do I putStrLn a Data.Byte...	[ 0.00848388671875, 0.01324462890625, -0.005828857421875, 0.00286865234375, 0.0054931640625, 0.0220947265625, 0.01141357421875, -0.0198974609375, -0.0159912109375, -0.00872802734375, 0.002105712890625, -0.0230712890625, 0.0159912109375, 0.001617431640625, -0.00634765625, -0.0058898925781...	[ 11249, 54, 87, 3884, 71713, 866, 19, 11809, 75358, 67, 214, 2729, 3285, 44851, 6236, 606, 497, 238, 135545, 178851, 8780, 1556, 142508, 22995, 140992, 79315, 527, 73265, 135932, 191, 17159, 117538, 24070, 191147, 21656, 60075, 13, 89829, 10...	[ 0.0802001953125, 0.027587890625, 0.034088134765625, 0.2255859375, 0.2113037109375, 0.1397705078125, 0.1461181640625, 0.131103515625, 0.054931640625, 0.093994140625, 0.10052490234375, 0.1357421875, 0.17919921875, 0.1358642578125, 0.119873046875, 0.08856201171875, 0.11669921875, 0.08...	embed
29188217_c1	29188217	haskell	1	= do card <- drawCard "Bob" liftIO $ print card getPlayer :: PlayerHandle -> Lens' GameState Player getPlayer handle f st = fmap put' get' where players = st^.gamePlayers put' player = let g p = case p^.playerHandle == handle of True -> player False -> p in set gamePlayers (map g players) st get' = f $ fromJust $ find...	= do card <- drawCard "Bob" liftIO $ print card getPlayer :: PlayerHandle -> Lens' GameState Player getPlayer handle f st = fmap put' get' where players = st^.gamePlayers put' player = let g p = case p^.playerHandle == handle of True -> player False -> p in set gamePlayers (map g players) st get' = f $ fromJust $ find...	[ -0.02880859375, 0.0034942626953125, -0.001007080078125, -0.017578125, 0.005767822265625, 0.00970458984375, -0.0142822265625, -0.021484375, 0.01007080078125, -0.0172119140625, 0.0252685546875, 0.026611328125, -0.00830078125, 0.000576019287109375, -0.00848388671875, -0.01544189453125, ...	[ 2203, 54, 20596, 79442, 156119, 571, 3522, 60520, 17780, 28412, 2046, 142581, 60560, 135679, 133, 18226, 7, 13547, 135206, 34831, 1238, 6138, 62346, 3884, 92865, 58585, 2633, 706, 915, 7225, 139570, 69112, 87599, 22225, 5423, 6712, 1295, 1277...	[ 0.062042236328125, 0.08624267578125, 0.227783203125, 0.202392578125, 0.269775390625, 0.0889892578125, 0.1505126953125, 0.191162109375, 0.164794921875, 0.16162109375, 0.0987548828125, 0.1951904296875, 0.1650390625, 0.1549072265625, 0.08056640625, 0.1585693359375, 0.01165771484375, 0...	embed
7394433_c0	7394433	haskell	0	Title: Yesod application source in a sub directory Problem title: Yesod application source in a sub directory Tags: haskell, yesod Problem: Yesod application source in a sub directory I generated a Yesod stub website using yesod init and was able to run yesod devel for testing. However, I usually put the actual haskell...	Yesod application source in a sub directory Yesod application source in a sub directory haskell yesod Yesod Model.hs:12:57 Exception Yesod application source in a sub directory I generated a Yesod stub website using yesod init and was able to run yesod devel for testing. However, I usually put the actual haskell source...	[ -0.00421142578125, 0.0162353515625, -0.0045166015625, 0.0023040771484375, -0.01483154296875, 0.01104736328125, -0.017333984375, 0.0038909912109375, -0.01007080078125, -0.057373046875, -0.0107421875, -0.019287109375, -0.002960205078125, 0.01068115234375, 0.0184326171875, -0.011840820312...	[ 32635, 2199, 38415, 31344, 23, 1614, 14364, 1556, 142508, 2422, 23722, 13293, 127, 20927, 35315, 5443, 63928, 53, 139392, 136057, 4165, 217, 8, 2601, 134234, 56104, 3884, 8561, 97264, 80581, 30675, 19437, 5201, 13452, 17366, 35064, 95322, 408...	[ 0.1939697265625, 0.284423828125, 0.1614990234375, 0.2198486328125, 0.0303192138671875, 0.2108154296875, 0.154052734375, 0.118896484375, 0.2174072265625, 0.132080078125, 0.23388671875, 0.158447265625, 0.05389404296875, 0.0303955078125, 0.09161376953125, 0.025909423828125, 0.0998535156...	embed
4512541_c0	4512541	haskell	0	Title: Translate imperative control flow with break-s/continue-s to haskell Problem title: Translate imperative control flow with break-s/continue-s to haskell Tags: imperative-programming, haskell, functional-programming Problem: Translate imperative control flow with break-s/continue-s to haskell Consider the followi...	Translate imperative control flow with break-s/continue-s to haskell Translate imperative control flow with break-s/continue-s to haskell imperative-programming haskell functional-programming Translate i-1 j-1 Translate imperative control flow with break-s/continue-s to haskell Consider the following imperative code wh...	[ -0.00970458984375, -0.0078125, -0.00994873046875, 0.004058837890625, 0.0010986328125, 0.0283203125, 0.0042724609375, -0.01092529296875, 0.003509521484375, -0.0228271484375, 0.0206298828125, 0.00592041015625, -0.018310546875, -0.004791259765625, 0.01361083984375, -0.0028533935546875, ...	[ 11062, 19309, 222530, 13, 6226, 86608, 678, 36356, 7, 133891, 47, 1556, 142508, 9, 28966, 123309, 17, 5759, 1647, 137399, 25632, 18151, 7413, 142105, 17923, 19, 102851, 54940, 38742, 5691, 4803, 101935, 5117, 66211, 223353, 144057, 47148, 337...	[ 0.1263427734375, 0.1968994140625, 0.2449951171875, 0.0467529296875, 0.216796875, 0.2254638671875, 0.014251708984375, 0.1798095703125, 0.1495361328125, 0.1697998046875, 0.1365966796875, 0.138427734375, 0.22900390625, 0.0211944580078125, 0.10205078125, 0.12744140625, 0.03240966796875, ...	embed
76871648_c0	76871648	haskell	0	Title: Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? Problem title: Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? Tags: haskell, http, ihp Problem: Is there an alternative to createTemporaryDownlo...	Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? haskell http ihp file Is there an alternative to createTemporaryDownloadUrl that doesn't require file st...	[ -0.00250244140625, 0.0228271484375, 0.018798828125, 0.0157470703125, 0.01416015625, -0.0128173828125, -0.0303955078125, -0.0181884765625, 0.003326416015625, 0.00048828125, -0.024169921875, -0.00482177734375, 0.0130615234375, 0.0198974609375, 0.0166015625, 0.018310546875, 0.0228271484...	[ 2071, 30700, 28282, 159065, 748, 6635, 144786, 48743, 141, 22027, 3768, 18, 64209, 11435, 132096, 10723, 98, 1556, 142508, 1621, 9633, 254, 2685, 142, 47, 450, 31577, 31255, 79315, 237, 20763, 334, 38937, 19048, 7026, 87, 36599, 32354, 5177...	[ 0.016357421875, 0.1920166015625, 0.1795654296875, 0.1649169921875, 0.15771484375, 0.1422119140625, 0.1888427734375, 0.156494140625, 0.1495361328125, 0.0982666015625, 0.0300140380859375, 0.1251220703125, 0.1494140625, 0.1478271484375, 0.2071533203125, 0.15771484375, 0.059173583984375,...	embed
32916738_c1	32916738	haskell	1	t AppState coreOfTheApp = accumB (AppState 0) events sink output [text :== show <$> coreOfTheApp] sink output2 [text :== show <$> reactimate ( getAnotherRemoteApiValue <@> coreOfTheApp)] network <- compile networkDescription actuate network As you can see what I am trying to do it is using the new state of the applica...	t AppState coreOfTheApp = accumB (AppState 0) events sink output [text :== show <$> coreOfTheApp] sink output2 [text :== show <$> reactimate ( getAnotherRemoteApiValue <@> coreOfTheApp)] network <- compile networkDescription actuate network As you can see what I am trying to do it is using the new state of the applica...	[ -0.0177001953125, 0.0135498046875, -0.00543212890625, 0.00927734375, -0.007415771484375, 0.008544921875, 0.00122833251953125, 0.017822265625, -0.00445556640625, -0.044921875, 0.0128173828125, 0.007110595703125, -0.006561279296875, 0.050537109375, 0.0128173828125, -0.010009765625, 0.0...	[ 808, 5659, 135206, 13, 56458, 132887, 3957, 39179, 2203, 61689, 39, 571, 757, 47353, 880, 92, 140992, 7639, 304, 131300, 1352, 67, 2046, 126340, 432, 1434, 856, 50770, 33120, 9969, 1340, 59478, 103694, 31577, 17368, 3525, 11341, 38415, 4332...	[ 0.1126708984375, 0.1983642578125, 0.221435546875, 0.0928955078125, 0.2012939453125, 0.2130126953125, 0.1336669921875, 0.2083740234375, 0.0072021484375, 0.0809326171875, 0.045654296875, 0.083740234375, 0.119140625, 0.170166015625, 0.165283203125, 0.09613037109375, 0.193115234375, 0....	embed
76910027_c1	76910027	haskell	1	Semigroup (f MyType) where (<>) = bzipWith (<>) instance ApplicativeB f => Monoid (f MyType) where mempty = bpure mempty But this only works if MyType a is a monoid for ALL a . Edit: Workaround Changing the Semigroup definition to the following: semigroupOp :: forall c t. (forall b. c b => Semigroup b) => SomeMaybe c ...	Semigroup (f MyType) where (<>) = bzipWith (<>) instance ApplicativeB f => Monoid (f MyType) where mempty = bpure mempty But this only works if MyType a is a monoid for ALL a . Edit: Workaround Changing the Semigroup definition to the following: semigroupOp :: forall c t. (forall b. c b => Semigroup b) => SomeMaybe c ...	[ -0.00543212890625, -0.0025634765625, 0.004302978515625, 0.0064697265625, -0.01397705078125, 0.0238037109375, 0.007171630859375, -0.007415771484375, 0.01708984375, 0.0035247802734375, -0.0087890625, 0.032470703125, 0.006988525390625, 0.00335693359375, -0.01300048828125, -0.0039367675781...	[ 84420, 51588, 420, 2646, 196707, 2740, 50836, 194583, 110527, 5659, 11048, 4935, 571, 1238, 77879, 532, 163, 2676, 939, 3408, 903, 4734, 43240, 2174, 10, 22460, 100, 58837, 27985, 67688, 108193, 80934, 25632, 36137, 39029, 5584, 808, 31384, ...	[ 0.263671875, 0.290771484375, 0.060028076171875, 0.17822265625, 0.309326171875, 0.0745849609375, 0.143798828125, 0.11279296875, 0.1669921875, 0.09619140625, 0.13525390625, 0.077880859375, 0.051666259765625, 0.10125732421875, 0.1632080078125, 0.159423828125, 0.0198516845703125, 0.049...	embed
78531783_c0	78531783	haskell	0	Title: Why pruning of game tree needed in lazy language Problem title: Why pruning of game tree needed in lazy language Tags: minimax, haskell, lazy-evaluation Problem: Why pruning of game tree needed in lazy language So I was reading the book Programming in Haskell by Graham Hutton. In chapter 11, the game tic-tac-toe...	Why pruning of game tree needed in lazy language Why pruning of game tree needed in lazy language minimax haskell lazy-evaluation Why Tree Node n-1 Why pruning of game tree needed in lazy language So I was reading the book Programming in Haskell by Graham Hutton. In chapter 11, the game tic-tac-toe is implemented. My q...	[ 0.0084228515625, 0.0211181640625, 0.01214599609375, 0.0098876953125, 0.0228271484375, 0.01361083984375, -0.0037994384765625, -0.01226806640625, 0.002105712890625, -0.0208740234375, -0.0133056640625, -0.0027313232421875, 0.008056640625, -0.003326416015625, 0.000957489013671875, 0.003463...	[ 44084, 25230, 592, 6712, 53201, 44841, 21, 3285, 46876, 83818, 425, 1556, 142508, 159258, 101344, 438, 112, 5759, 16454, 12877, 27958, 20625, 147756, 1507, 534, 96212, 102, 238, 51890, 29479, 38730, 2831, 11814, 55681, 86, 32354, 3871, 6044, ...	[ 0.10418701171875, 0.2052001953125, 0.116943359375, 0.1356201171875, 0.23681640625, 0.135009765625, 0.0931396484375, 0.1546630859375, 0.143310546875, 0.1695556640625, 0.130859375, 0.08056640625, 0.2210693359375, 0.0985107421875, 0.17236328125, 0.1080322265625, 0.0830078125, 0.064392...	embed
29905159_c1	29905159	haskell	1	it and help GHC out. So far, I've got this: import Data.Constraint weakenAnd1 :: ((a :&: b) c) :- a c weakenAnd1 = Sub Dict -- not the Dict from vinyl. ekmett's Dict. weakenAnd2 :: ((a :&: b) c) :- b c weakenAnd2 = Sub Dict These work fine. But this is where I am stuck: -- The two Proxy args are to stop GHC from compl...	it and help GHC out. So far, I've got this: import Data.Constraint weakenAnd1 :: ((a :&: b) c) :- a c weakenAnd1 = Sub Dict -- not the Dict from vinyl. ekmett's Dict. weakenAnd2 :: ((a :&: b) c) :- b c weakenAnd2 = Sub Dict These work fine. But this is where I am stuck: -- The two Proxy args are to stop GHC from compl...	[ -0.0022735595703125, -0.0107421875, 0.01348876953125, 0.0186767578125, 0.0224609375, 0.0010528564453125, -0.039306640625, 0.013671875, 0.0177001953125, 0.01416015625, 0.00136566162109375, -0.00171661376953125, 0.003204345703125, 0.0289306640625, 0.01043701171875, -0.003570556640625, ...	[ 442, 4358, 527, 73265, 1810, 2060, 4163, 903, 24927, 11809, 11935, 2816, 4288, 642, 344, 33, 37839, 418, 1230, 10, 501, 8273, 60897, 18, 959, 193289, 1928, 304, 4488, 5885, 179933, 6626, 1250, 50878, 79459, 7279, 1295, 186992, 10250, 1228...	[ 0.099365234375, 0.0697021484375, 0.079345703125, 0.182861328125, 0.0233306884765625, 0.04827880859375, 0.020965576171875, 0.004180908203125, 0.2110595703125, 0.1324462890625, 0.064208984375, 0.1749267578125, 0.149169921875, 0.14013671875, 0.16455078125, 0.1148681640625, 0.15234375, ...	embed
58225776_c0	58225776	haskell	0	Title: Understanding simple functions applied to graphs Problem title: Understanding simple functions applied to graphs Tags: graph, functional-programming, haskell Problem: Understanding simple functions applied to graphs I have a question about how to manipulate a function in Haskell. I have this graph: import Data.M...	Understanding simple functions applied to graphs Understanding simple functions applied to graphs graph functional-programming haskell Data.Map Graphviz Understanding Map Graph Show Ord Adds Understanding simple functions applied to graphs I have a question about how to manipulate a function in Haskell. I have this gra...	[ -0.01373291015625, 0.0233154296875, -0.0118408203125, 0.0155029296875, -0.013916015625, -0.00421142578125, -0.0091552734375, 0.01165771484375, 0.01129150390625, -0.034912109375, 0.0172119140625, -0.01904296875, 0.0093994140625, 0.0380859375, -0.000621795654296875, -0.004913330078125, ...	[ 9626, 144057, 8781, 32354, 190659, 47, 41382, 7, 123309, 28966, 1556, 142508, 11809, 166179, 6524, 11727, 22572, 42719, 17367, 35379, 29117, 9655, 3642, 45258, 67, 20625, 765, 903, 8382, 2967, 9790, 25379, 756, 95378, 5170, 5303, 15190, 15896...	[ 0.1156005859375, 0.0946044921875, 0.1885986328125, 0.2191162109375, 0.1353759765625, 0.0616455078125, 0.2213134765625, 0.039581298828125, 0.1444091796875, 0.082275390625, 0.114990234375, 0.2427978515625, 0.05584716796875, 0.130615234375, 0.1541748046875, 0.133056640625, 0.16821289062...	embed
10946167_c0	10946167	haskell	0	Title: Handling nested variable scopes when implementing an interpreter Problem title: Handling nested variable scopes when implementing an interpreter Tags: interpreter, haskell Problem: Handling nested variable scopes when implementing an interpreter I'm currently writing an interpreter for a simple programming langu...	Handling nested variable scopes when implementing an interpreter Handling nested variable scopes when implementing an interpreter interpreter haskell Handling Env Handling nested variable scopes when implementing an interpreter I'm currently writing an interpreter for a simple programming language and just wanted to as...	[ -0.00445556640625, 0.005096435546875, 0.0029144287109375, 0.0311279296875, 0.005401611328125, 0.018310546875, 0.00836181640625, 0.0169677734375, -0.00078582763671875, -0.022216796875, 0.01507568359375, 0.00750732421875, -0.02001953125, -0.0103759765625, 0.00848388671875, 0.002914428710...	[ 193237, 8512, 71, 77336, 44679, 90, 29479, 29481, 56, 1556, 142508, 357, 334, 32562, 8781, 56037, 46876, 2965, 51515, 36461, 133, 442, 65998, 1528, 18151, 6713, 2037, 136, 28350, 179933, 35142, 70820, 12638, 9842, 46389, 27781, 5117, 14, 17...	[ 0.22265625, 0.259765625, 0.1187744140625, 0.263916015625, 0.18115234375, 0.098388671875, 0.169189453125, 0.221435546875, 0.141357421875, 0.1474609375, 0.2174072265625, 0.103271484375, 0.209228515625, 0.01043701171875, 0.0477294921875, 0.043670654296875, 0.0692138671875, 0.034118652...	embed
28535481_c0	28535481	haskell	0	Title: Writing Parser for JSON String Problem title: Writing Parser for JSON String Tags: parsing, monads, haskell Problem: Writing Parser for JSON String As part of trying to write a JSON Parser, I'm working on parsing a JSON String value. Given the following definition from Prof. Brent Yorgey's Haskell course : -- A ...	Writing Parser for JSON String Writing Parser for JSON String parsing monads haskell Writing Parser JSON Maybe JValue Char Nothing x:xs Just Writing Parser for JSON String As part of trying to write a JSON Parser, I'm working on parsing a JSON String value. Given the following definition from Prof. Brent Yorgey's Haske...	[ -0.0169677734375, 0.026611328125, -0.013916015625, 0.021728515625, -0.0242919921875, 0.022216796875, -0.0019073486328125, -0.01953125, -0.01361083984375, 0.01513671875, -0.0093994140625, 0.0167236328125, -0.006744384765625, -0.0027923583984375, 0.005950927734375, 0.0247802734375, -0....	[ 213185, 2392, 2189, 100, 821, 58627, 23351, 214, 366, 6953, 2667, 712, 7, 1556, 142508, 83425, 856, 50770, 21656, 182747, 1022, 12, 425, 33022, 20697, 34292, 80934, 192050, 27616, 53, 20625, 15411, 51042, 3934, 63134, 17932, 45234, 19060, 1...	[ 0.1710205078125, 0.1605224609375, 0.221435546875, 0.0770263671875, 0.14892578125, 0.2266845703125, 0.1798095703125, 0.08111572265625, 0.1630859375, 0.0394287109375, 0.0758056640625, 0.11328125, 0.05889892578125, 0.1134033203125, 0.2139892578125, 0.0362548828125, 0.1259765625, 0.152...	embed
29830391_c0	29830391	haskell	0	Title: do..while(0) function-like C macro wrapper in c2hs Problem title: do..while(0) function-like C macro wrapper in c2hs Tags: petsc, haskell, c2hs, c, c-preprocessor Problem: do..while(0) function-like C macro wrapper in c2hs I'd like to wrap a function-like C macro in a C function (and in turn wrap it in Haskell w...	do..while(0) function-like C macro wrapper in c2hs do..while(0) function-like C macro wrapper in c2hs petsc haskell c2hs c c-preprocessor PetscError do..while c2hs TestMacro TestF1 c_testF1 TestMacro.chs TestMacro.chs.h:6 ERROR Syntax CHKERRQ petscerror.h PetscUnlikely PETSC_COMM_SELF __LINE__ PETSC_FUNCTION_NAME __FIL...	[ 0.00118255615234375, 0.0189208984375, -0.01397705078125, -0.01171875, 0.01251220703125, 0.0201416015625, -0.0062255859375, -0.0174560546875, 0.0021820068359375, -0.004638671875, -0.0262451171875, -0.0062255859375, -0.033203125, -0.019775390625, 0.023193359375, -0.006500244140625, -0....	[ 54, 204610, 177609, 32354, 5062, 313, 111789, 137565, 1264, 501, 304, 127, 23, 8093, 10382, 1556, 142508, 4692, 63923, 26516, 18468, 31611, 5, 8647, 55450, 6954, 910, 151206, 19010, 14045, 34324, 1052, 2737, 188800, 14256, 82914, 14495, 16113...	[ 0.07891845703125, 0.26318359375, 0.2218017578125, 0.134765625, 0.2115478515625, 0.150634765625, 0.1962890625, 0.176513671875, 0.108154296875, 0.03924560546875, 0.119384765625, 0.144775390625, 0.0201568603515625, 0.16064453125, 0.1146240234375, 0.04962158203125, 0.2222900390625, 0.0...	embed
55123697_c0	55123697	haskell	0	Title: Haskell - find path to value of nodes Problem title: Haskell - find path to value of nodes Tags: tree, nodes, haskell Problem: Haskell - find path to value of nodes The question for this problem is: Tree holds data of type a. Function findpath which given a function f, some data x and a tree t, returns the lists...	Haskell - find path to value of nodes Haskell - find path to value of nodes tree nodes haskell Haskell Btree Data Branch Show Dir Path tree1 tree2 tree3 Throws Haskell - find path to value of nodes The question for this problem is: Declared structure of data types used in this problem: My attempt to solve this function...	[ 0.0047607421875, 0.0133056640625, 0.00341796875, -0.01025390625, 0.00555419921875, 0.028076171875, 0.00067901611328125, -0.00836181640625, -0.00341796875, -0.018798828125, -0.004730224609375, -0.0081787109375, -0.00138092041015625, -0.0021820068359375, 0.009765625, 0.008056640625, 0....	[ 20625, 142508, 7413, 60875, 47, 34292, 111, 110, 988, 53201, 1556, 62600, 11809, 21110, 17367, 19946, 108421, 363, 15555, 9655, 2967, 25755, 320, 297, 45646, 2053, 52895, 11814, 81887, 86869, 32354, 134234, 11782, 3034, 140992, 76199, 4358, 1...	[ 0.1395263671875, 0.2310791015625, 0.150390625, 0.2381591796875, 0.167236328125, 0.21240234375, 0.06390380859375, 0.1383056640625, 0.134521484375, 0.1380615234375, 0.1160888671875, 0.1966552734375, 0.055999755859375, 0.007568359375, 0.086669921875, 0.067626953125, 0.1729736328125, 0...	embed
13193346_c0	13193346	haskell	0	Title: Generate more evenly distributed random sequence Problem title: Generate more evenly distributed random sequence Tags: haskell, random Problem: Generate more evenly distributed random sequence I have read this question and thought that this algorithm is not optimal. For example, 'f 20 100' returns lists like [85...	Generate more evenly distributed random sequence Generate more evenly distributed random sequence haskell random Generate Couldn Generate more evenly distributed random sequence I have read this question and thought that this algorithm is not optimal. For example, 'f 20 100' returns lists like [85,14,1,0,0,0,0,0,0,0,0,...	[ 0.00092315673828125, 0.018798828125, 0.003387451171875, -0.032470703125, 0.0013427734375, 0.004150390625, 0.0019989013671875, -0.01025390625, 0.0023651123046875, -0.0286865234375, 0.00799560546875, 0.0174560546875, -0.00016498565673828125, 0.01324462890625, 0.015380859375, 0.0053710937...	[ 155370, 67, 1286, 3853, 538, 15917, 3674, 96759, 40, 944, 3956, 1556, 142508, 191147, 19, 12301, 17569, 903, 234873, 959, 24087, 27781, 420, 387, 805, 30646, 5303, 1884, 12951, 2592, 206808, 63527, 87, 195409, 4989, 45234, 46741, 16750, 490...	[ 0.198974609375, 0.0965576171875, 0.17822265625, 0.2069091796875, 0.1387939453125, 0.212158203125, 0.04766845703125, 0.2132568359375, 0.0684814453125, 0.1295166015625, 0.0267333984375, 0.17236328125, 0.234375, 0.126953125, 0.0938720703125, 0.00244140625, 0.040191650390625, 0.0256500...	embed
7479948_c0	7479948	haskell	0	Title: Equivalent of Haskell do-notation or F# Computation Expressions in Scala? Problem title: Equivalent of Haskell do-notation or F# Computation Expressions in Scala? Tags: do-notation, monads, scala, haskell, f%23 Problem: Equivalent of Haskell do-notation or F# Computation Expressions in Scala? F# Computation Expr...	Equivalent of Haskell do-notation or F# Computation Expressions in Scala? Equivalent of Haskell do-notation or F# Computation Expressions in Scala? do-notation monads scala haskell f%23 Equivalent Haskell Computation Expressions Scala Future f.get Copy ReadMode WriteMode Done Equivalent of Haskell do-notation or F# Com...	[ -0.0098876953125, 0.01409912109375, 0.00225830078125, 0.00482177734375, -0.0036163330078125, -0.003265380859375, 0.00543212890625, -0.004425048828125, -0.01068115234375, -0.03369140625, -0.0004405975341796875, -0.0118408203125, -0.00127410888671875, 0.0015106201171875, 0.0086669921875, ...	[ 145666, 85540, 111, 20625, 142508, 54, 157, 22062, 563, 4904, 159415, 25129, 17514, 23, 152653, 11, 707, 2667, 712, 7, 146232, 1556, 1238, 3949, 3742, 94724, 3794, 146930, 4764, 9083, 601, 18781, 984, 63769, 1274, 27140, 18403, 6002, 86531,...	[ 0.07757568359375, 0.124267578125, 0.0202484130859375, 0.131103515625, 0.2384033203125, 0.146728515625, 0.1492919921875, 0.077880859375, 0.1304931640625, 0.1968994140625, 0.1768798828125, 0.16162109375, 0.0682373046875, 0.03851318359375, 0.218017578125, 0.1763916015625, 0.003051757812...	embed
8534006_c0	8534006	haskell	0	Title: Type class definition with functions depending on an additional type Problem title: Type class definition with functions depending on an additional type Tags: typeclass, haskell Problem: Type class definition with functions depending on an additional type Still new to Haskell, I have hit a wall with the followin...	Type class definition with functions depending on an additional type Type class definition with functions depending on an additional type typeclass haskell Type Num MixedRing Could Fractional Wrap Type class definition with functions depending on an additional type Still new to Haskell, I have hit a wall with the follo...	[ -0.00775146484375, 0.035400390625, 0.006805419921875, 0.006439208984375, -0.012939453125, 0.00154876708984375, -0.019287109375, -0.005889892578125, 0.00689697265625, 0.000514984130859375, -0.0302734375, 0.00052642822265625, 0.005859375, -0.0012359619140625, -0.0234375, -0.0009613037109...	[ 60457, 18507, 80934, 678, 32354, 96819, 78301, 10644, 67413, 1556, 142508, 52782, 37286, 297, 1052, 214, 191147, 7868, 10763, 13631, 3525, 20625, 5962, 58982, 61924, 61112, 4537, 115497, 39209, 27169, 86869, 192617, 76519, 13722, 5426, 10, 8085...	[ 0.25390625, 0.257080078125, 0.16259765625, 0.0838623046875, 0.1778564453125, 0.131103515625, 0.131103515625, 0.220947265625, 0.202880859375, 0.10205078125, 0.1898193359375, 0.148193359375, 0.13818359375, 0.012176513671875, 0.0726318359375, 0.0635986328125, 0.047271728515625, 0.1475...	embed
1937102_c0	1937102	haskell	0	Title: Is it possible to test the return value of Haskell I/O functions? Problem title: Is it possible to test the return value of Haskell I/O functions? Tags: functional-programming, haskell, unit-testing Problem: Is it possible to test the return value of Haskell I/O functions? Haskell is a pure functional language, ...	Is it possible to test the return value of Haskell I/O functions? Is it possible to test the return value of Haskell I/O functions? functional-programming haskell unit-testing Haskell Hello Is it possible to test the return value of Haskell I/O functions? Haskell is a pure functional language, which means Haskell funct...	[ -0.0172119140625, 0.01123046875, 0.00897216796875, 0.0257568359375, 0.004638671875, 0.0025482177734375, 0.006103515625, -0.03173828125, -0.019775390625, 0.009033203125, 0.006378173828125, -0.0211181640625, -0.011962890625, -0.006744384765625, 0.0002841949462890625, -0.0023345947265625,...	[ 2071, 7722, 3034, 30646, 34292, 20625, 142508, 87, 64, 670, 32354, 47, 123309, 28966, 1556, 25072, 6954, 35378, 442, 70, 34166, 46876, 110, 5609, 52490, 29479, 17368, 2667, 712, 33636, 7839, 181135, 8781, 127, 13817, 8999, 1528, 28282, 182,...	[ 0.0194091796875, 0.1884765625, 0.260009765625, 0.260498046875, 0.2181396484375, 0.1513671875, 0.273193359375, 0.104248046875, 0.2340087890625, 0.204345703125, 0.2130126953125, 0.058837890625, 0.148681640625, 0.057952880859375, 0.097412109375, 0.1282958984375, 0.141845703125, 0.0955...	embed
20038899_c1	20038899	haskell	1	eval val f) && (eval val g) eval val (Imp f g) = eval val (Or (Not f) g) valuations :: [Variable] -> [Valuation] valuations [] = [[]] valuations (v:vs) = map ((v,True):) ds ++ map ((v,False):) ds where ds = valuations vs I now have to write a models function and I worked out that the typeline has to be models :: Prop -...	eval val f) && (eval val g) eval val (Imp f g) = eval val (Or (Not f) g) valuations :: [Variable] -> [Valuation] valuations [] = [[]] valuations (v:vs) = map ((v,True):) ds ++ map ((v,False):) ds where ds = valuations vs I now have to write a models function and I worked out that the typeline has to be models :: Prop -...	[ -0.012451171875, 0.003662109375, -0.00494384765625, -0.00555419921875, -0.005462646484375, 0.0244140625, -0.0052490234375, 0.0032806396484375, 0.01214599609375, -0.03515625, 0.00014972686767578125, -0.00135040283203125, 0.01043701171875, 0.001495361328125, 0.0028076171875, 0.0092163085...	[ 28, 1405, 3502, 1238, 619, 1230, 13, 706, 128878, 2203, 19060, 122116, 55932, 21094, 81827, 2886, 42272, 334, 18043, 22288, 882, 104, 37223, 17647, 20209, 33022, 115774, 32354, 10644, 2256, 1556, 1984, 43796, 34, 27781, 30646, 5303, 4769, 1...	[ 0.0718994140625, 0.272705078125, 0.2607421875, 0.1552734375, 0.054229736328125, 0.09814453125, 0.01373291015625, 0.123291015625, 0.1651611328125, 0.016082763671875, 0.0655517578125, 0.139892578125, 0.2222900390625, 0.0899658203125, 0.0902099609375, 0.01361083984375, 0.1820068359375, ...	embed
46203009_c0	46203009	haskell	0	Title: Partial application of type synonyms Problem title: Partial application of type synonyms Tags: partial-application, haskell, ghc, type-families, type-synonyms Problem: Partial application of type synonyms I'm having trouble with unsaturated type synonyms in the following example: {-# LANGUAGE TypeFamilies #-} {-...	Partial application of type synonyms Partial application of type synonyms partial-application haskell ghc type-families type-synonyms Partial LANGUAGE TypeFamilies LiberalTypeSynonyms TypeFamilyHackery CollectArgTypes MapReturnType MkT Goal BuryT Bool XLiberalTypeSynonyms Partial application of type synonyms I'm having...	[ 0.01007080078125, 0.0230712890625, -0.000942230224609375, 0.005035400390625, -0.02294921875, -0.00909423828125, -0.0033416748046875, -0.03271484375, -0.002166748046875, 0.00567626953125, -0.00445556640625, -0.00811767578125, -0.0029296875, 0.0242919921875, 0.005157470703125, 0.00430297...	[ 9148, 289, 38415, 10644, 164661, 2878, 101687, 1556, 142508, 31380, 238, 69128, 12654, 45757, 98064, 60457, 1191, 91441, 196707, 3371, 6495, 11050, 138521, 42719, 987, 92, 618, 2016, 7362, 53, 2460, 929, 43523, 1297, 7, 63134, 2234, 26690, ...	[ 0.173583984375, 0.087890625, 0.1591796875, 0.217041015625, 0.2393798828125, 0.150390625, 0.141357421875, 0.0623779296875, 0.2010498046875, 0.034210205078125, 0.0249481201171875, 0.06494140625, 0.050140380859375, 0.164306640625, 0.07763671875, 0.18115234375, 0.0306549072265625, 0.15...	embed
33026225_c0	33026225	haskell	0	Title: Data type errors on haskell regarding arguments Problem title: Data type errors on haskell regarding arguments Tags: haskell Problem: Data type errors on haskell regarding arguments So I'm new to haskell and I'm not quite sure how to do certain things Not many online tutorials even address the problem I'm having...	Data type errors on haskell regarding arguments Data type errors on haskell regarding arguments haskell Data PointVal Float Show Extension.lhs:17:3 Couldn Failed Data type errors on haskell regarding arguments So I'm new to haskell and I'm not quite sure how to do certain things Not many online tutorials even address t...	[ 0.0201416015625, 0.032470703125, -0.00506591796875, 0.0101318359375, 0.00537109375, -0.00787353515625, 0.002593994140625, 0.007080078125, -0.0164794921875, -0.0234375, -0.00433349609375, -0.06884765625, 0.01519775390625, -0.0140380859375, -0.0194091796875, -0.013916015625, 0.02941894...	[ 11809, 10644, 18499, 7, 98, 1556, 142508, 118861, 10750, 41097, 42272, 38699, 257, 17367, 224545, 79366, 22950, 363, 191147, 19, 190355, 57143, 18151, 127, 11435, 20949, 31577, 28282, 2053, 201, 21917, 9821, 27992, 237, 1022, 136, 113, 552, ...	[ 0.117431640625, 0.2259521484375, 0.2044677734375, 0.045379638671875, 0.032012939453125, 0.1396484375, 0.219970703125, 0.07366943359375, 0.2156982421875, 0.143798828125, 0.2254638671875, 0.1552734375, 0.02764892578125, 0.1632080078125, 0.15478515625, 0.0802001953125, 0.08612060546875,...	embed
33268280_c0	33268280	haskell	0	Title: Is there a way to use an "unlift" style when writing in a monad transformer do block? Problem title: Is there a way to use an "unlift" style when writing in a monad transformer do block? Tags: haskell, monad-transformers, monads, refactoring Problem: Is there a way to use an "unlift" style wh...	Is there a way to use an "unlift" style when writing in a monad transformer do block? Is there a way to use an "unlift" style when writing in a monad transformer do block? haskell monad-transformers monads refactoring MaybeT ExceptT Producer Consumer Is there a way to use an "unlift" style when writ...	[ -0.00038909912109375, 0.0247802734375, 0.028564453125, -0.00823974609375, -0.0008087158203125, -0.01031494140625, 0.01202392578125, -0.019775390625, 0.01397705078125, -0.01043701171875, 0.01116943359375, -0.002777099609375, 0.01239013671875, -0.01031494140625, 0.000904083251953125, 0.0...	[ 3917, 4527, 309, 104501, 20623, 32562, 2667, 712, 27198, 56, 54, 46389, 1556, 142508, 215175, 1314, 144810, 83425, 618, 218288, 103687, 76980, 23, 20625, 15190, 1632, 11001, 32354, 3647, 17780, 82463, 96704, 56104, 81409, 1884, 26531, 17368, ...	[ 0.068115234375, 0.0948486328125, 0.1463623046875, 0.290283203125, 0.2191162109375, 0.1802978515625, 0.10382080078125, 0.14453125, 0.2064208984375, 0.1029052734375, 0.1376953125, 0.1885986328125, 0.045745849609375, 0.2386474609375, 0.1971435546875, 0.0823974609375, 0.1226806640625, ...	embed
2305370_c1	2305370	haskell	1	is an API function getUrlContents :: String -> IO String that opens HTTP connection and returns an HTML for given URL. UPDATE : why to have state (or may be not)? The API can have more functions, not just single "load-and-parse results". I didn't add them to avoid complexity. Also it could care about HTTP Referer head...	is an API function getUrlContents :: String -> IO String that opens HTTP connection and returns an HTML for given URL. UPDATE : why to have state (or may be not)? The API can have more functions, not just single "load-and-parse results". I didn't add them to avoid complexity. Also it could care about HTTP Referer head...	[ -0.01507568359375, 0.0040283203125, 0.005645751953125, 0.0042724609375, -0.00701904296875, 0.0213623046875, 0.004425048828125, -0.0167236328125, 0.0018768310546875, -0.02880859375, 0.0001373291015625, -0.0205078125, -0.01416015625, -0.0283203125, 0.022705078125, -0.016357421875, 0.01...	[ 83, 142, 61687, 32354, 2046, 48743, 141, 11935, 25352, 7, 1984, 23351, 214, 33079, 17780, 450, 9803, 135913, 94878, 136, 30646, 19097, 100, 34475, 31862, 5, 161521, 15400, 47, 765, 11341, 15, 748, 1543, 186, 959, 32, 581, 831, 1286, 4, ...	[ 0.15087890625, 0.073974609375, 0.2822265625, 0.235107421875, 0.2003173828125, 0.214599609375, 0.1497802734375, 0.1739501953125, 0.29296875, 0.1287841796875, 0.12890625, 0.1971435546875, 0.098876953125, 0.06121826171875, 0.24609375, 0.04779052734375, 0.2005615234375, 0.2325439453125...	embed
18959720_c1	18959720	haskell	1	data PendulumState = PendulumState { omega :: Double -- rad/s Angular Velocity , theta :: Double -- rad Angular Displacement , time :: Double -- s Time } type Time = Double type TIncrement = Double list2State :: [[Double]] -> PendulumState list2State [xs, ys] = PendulumState { theta = (ys !! 0) , omega = (ys !! 1) , t...	data PendulumState = PendulumState { omega :: Double -- rad/s Angular Velocity , theta :: Double -- rad Angular Displacement , time :: Double -- s Time } type Time = Double type TIncrement = Double list2State :: [[Double]] -> PendulumState list2State [xs, ys] = PendulumState { theta = (ys !! 0) , omega = (ys !! 1) , t...	[ -0.0213623046875, -0.00958251953125, -0.01300048828125, -0.0033416748046875, -0.0181884765625, 0.01141357421875, -0.01336669921875, -0.01385498046875, -0.01177978515625, -0.03369140625, -0.00958251953125, -0.0167236328125, 0.00799560546875, -0.0032806396484375, -0.036376953125, -0.0076...	[ 2053, 150034, 95671, 135206, 13, 2203, 99245, 1984, 107172, 4210, 4248, 64, 2393, 35975, 139993, 60089, 70, 102, 6206, 23935, 6, 1733, 91, 19055, 10644, 26906, 19, 7612, 674, 5303, 304, 34, 2661, 86245, 425, 7, 113, 268, 4778, 6506, 757...	[ 0.233642578125, 0.2392578125, 0.281005859375, 0.265869140625, 0.08056640625, 0.0872802734375, 0.255615234375, 0.028778076171875, 0.1488037109375, 0.023468017578125, 0.1298828125, 0.1025390625, 0.103271484375, 0.130859375, 0.161865234375, 0.051116943359375, 0.127197265625, 0.1582031...	embed
43787633_c0	43787633	haskell	0	Title: Structural induction proof on filter infix on filter Problem title: Structural induction proof on filter infix on filter Tags: haskell, induction, proof Problem: Structural induction proof on filter infix on filter I am trying to prove the following: filter p . filter q = filter (and p q) where and p q x = p x &...	Structural induction proof on filter infix on filter Structural induction proof on filter infix on filter haskell induction proof Structural Induction Base Inductive Structural induction proof on filter infix on filter I am trying to prove the following: here is my try, but i am not sure if it is correct, can anyone gi...	[ 0.00616455078125, 0.017333984375, -0.0016937255859375, -0.00714111328125, 0.005035400390625, -0.0030975341796875, -0.000274658203125, -0.00933837890625, 0.0267333984375, -0.007476806640625, -0.01434326171875, 0.01171875, -0.01348876953125, -0.0023040771484375, -0.0079345703125, 0.00933...	[ 63667, 73317, 141, 23, 77391, 98869, 98, 46312, 55923, 1556, 142508, 360, 44978, 39367, 4935, 31577, 23534, 25632, 9790, 9077, 26785, 25647, 135989, 7225, 6275, 151994, 831, 29479, 390, 18344, 7569, 5303, 46683, 3220, 4527, 6889, 3664, 186 ]	[ 0.135009765625, 0.139404296875, 0.03265380859375, 0.102783203125, 0.19970703125, 0.18994140625, 0.0380859375, 0.220947265625, 0.181396484375, 0.10009765625, 0.17431640625, 0.0946044921875, 0.1083984375, 0.1551513671875, 0.122314453125, 0.03167724609375, 0.1474609375, 0.029891967773...	embed
77467489_c1	77467489	haskell	1	sac-0.0 (exe:gsac) (dependency rebuilt) Configuring library for gsdl-0.0.. Preprocessing library for gsdl-0.0.. Building library for gsdl-0.0.. [1 of 1] Compiling GSDL.Core.ReadFile ( hslib/GSDL/Core/ReadFile.hs, dist/build/GSDL/Core/ReadFile.o, dist/build/GSDL/Core/ReadFile.dyn_o ) Installing library in /home/jcast/.c...	sac-0.0 (exe:gsac) (dependency rebuilt) Configuring library for gsdl-0.0.. Preprocessing library for gsdl-0.0.. Building library for gsdl-0.0.. [1 of 1] Compiling GSDL.Core.ReadFile ( hslib/GSDL/Core/ReadFile.hs, dist/build/GSDL/Core/ReadFile.o, dist/build/GSDL/Core/ReadFile.dyn_o ) Installing library in /home/jcast/.c...	[ -0.01055908203125, -0.0120849609375, -0.0185546875, -0.006561279296875, 0.0203857421875, 0.0086669921875, -0.017333984375, 0.003936767578125, -0.00653076171875, 0.0240478515625, 0.007781982421875, -0.037109375, -0.0201416015625, -0.00787353515625, 0.0130615234375, -0.009033203125, -0...	[ 30823, 9, 99929, 46480, 9405, 2263, 105254, 33, 2408, 456, 978, 24908, 59994, 35773, 1294, 706, 7, 20469, 1914, 63923, 104919, 15612, 49725, 74356, 27502, 50886, 31345, 174350, 1096, 5612, 34162, 127, 177149, 31, 107951, 23, 29552, 170, 557...	[ 0.2080078125, 0.024078369140625, 0.2222900390625, 0.105712890625, 0.0999755859375, 0.2056884765625, 0.13671875, 0.0271453857421875, 0.019927978515625, 0.0975341796875, 0.09228515625, 0.105712890625, 0.179443359375, 0.2078857421875, 0.09906005859375, 0.075927734375, 0.08544921875, 0...	embed
53487894_c0	53487894	haskell	0	Title: Haskell IORef - an answer vs. a function to get an answer Problem title: Haskell IORef - an answer vs. a function to get an answer Tags: closures, do-notation, haskell, io, ioref Problem: Haskell IORef - an answer vs. a function to get an answer I'm trying to understand how IORefs are really used, and I'm having...	Haskell IORef - an answer vs. a function to get an answer Haskell IORef - an answer vs. a function to get an answer closures do-notation haskell io ioref Haskell IORef IORefs Haskell IORef - an answer vs. a function to get an answer I'm trying to understand how IORefs are really used, and I'm having trouble following t...	[ -0.005706787109375, 0.0091552734375, 0.0198974609375, 0.011474609375, 0.0098876953125, 0.0126953125, 0.00494384765625, -0.0086669921875, 0.018798828125, -0.0167236328125, -0.00118255615234375, -0.01611328125, 0.0233154296875, 0.01409912109375, 0.00982666015625, -0.0032501220703125, -...	[ 20625, 142508, 123435, 4240, 142, 35166, 20209, 32354, 47, 2046, 170224, 54, 157, 1556, 22995, 29087, 10, 28219, 7, 6183, 11814, 63134, 121413, 18151, 184, 162, 15246, 2947, 79832, 1837, 8996, 22875, 309, 115840, 5, 28412, 108210, 71924, 50...	[ 0.1280517578125, 0.2412109375, 0.20947265625, 0.275634765625, 0.03912353515625, 0.2474365234375, 0.1895751953125, 0.2159423828125, 0.139404296875, 0.17041015625, 0.2120361328125, 0.1480712890625, 0.1334228515625, 0.130615234375, 0.2498779296875, 0.277099609375, 0.00994873046875, 0....	embed
73776527_c0	73776527	haskell	0	Title: How to use equational reasoning to reduce this expression Problem title: How to use equational reasoning to reduce this expression Tags: haskell Problem: How to use equational reasoning to reduce this expression I have the following definitions: fibs = 1 : scanl (+) 1 fibs scanl :: (a -> b -> a) -> a -> [b] -> [...	How to use equational reasoning to reduce this expression How to use equational reasoning to reduce this expression haskell How x:xs n-1 How to use equational reasoning to reduce this expression I have the following definitions: I would like to reduce the following expression: So, I would proceed: How can I continue re...	[ 0.000751495361328125, -0.016357421875, 0.002349853515625, 0.03076171875, -0.0064697265625, -0.009765625, -0.0133056640625, 0.015380859375, 0.0123291015625, -0.03564453125, 0.00665283203125, 0.0218505859375, 0.020263671875, 0.00628662109375, 0.0101318359375, 0.002777099609375, 0.02429...	[ 11249, 4527, 13722, 43315, 31635, 214, 34390, 903, 125195, 47, 28, 1556, 142508, 1022, 12, 425, 7, 653, 5759, 80934, 1884, 25632, 172337, 21342, 136475, 4568, 13315, 214552, 11737, 7077, 3698, 20990, 52544, 14012, 5608, 1892, 86869 ]	[ 0.0806884765625, 0.0921630859375, 0.1700439453125, 0.1170654296875, 0.1759033203125, 0.093017578125, 0.209716796875, 0.033782958984375, 0.1966552734375, 0.0068359375, 0.0266265869140625, 0.1490478515625, 0.2215576171875, 0.1248779296875, 0.04486083984375, 0.134765625, 0.1035766601562...	embed
10093884_c0	10093884	haskell	0	Title: Using referential-transparency to pre-compute values in haskell Problem title: Using referential-transparency to pre-compute values in haskell Tags: haskell, precompute, referential-transparency Problem: Using referential-transparency to pre-compute values in haskell Let's say we have a program like this : list ...	Using referential-transparency to pre-compute values in haskell Using referential-transparency to pre-compute values in haskell haskell precompute referential-transparency Using Using referential-transparency to pre-compute values in haskell Let's say we have a program like this : I want this to be compiled such that t...	[ 0.001007080078125, -0.006103515625, 0.0272216796875, 0.0111083984375, -0.000652313232421875, 0.011474609375, -0.004058837890625, 0.0086669921875, 0.0194091796875, -0.050048828125, -0.01507568359375, 0.0186767578125, 0.00958251953125, -0.001129150390625, 0.0023956298828125, 0.0086669921...	[ 345, 15005, 80973, 30145, 16082, 27771, 47, 479, 58875, 6743, 142424, 1556, 142508, 23, 118562, 65970, 13, 6953, 1528, 1884, 903, 3444, 186, 375, 5974, 297, 6044, 70, 71924, 2886, 1660, 28412, 190, 197094, 4283, 28568, 4, 15490, 35971, 50...	[ 0.0836181640625, 0.2095947265625, 0.17822265625, 0.1583251953125, 0.22021484375, 0.080322265625, 0.089599609375, 0.2069091796875, 0.1583251953125, 0.1307373046875, 0.181884765625, 0.1573486328125, 0.2413330078125, 0.027557373046875, 0.1414794921875, 0.1942138671875, 0.015365600585937...	embed
29580187_c0	29580187	haskell	0	Title: Haskell Language Report: definition of reservedid Problem title: Haskell Language Report: definition of reservedid Tags: haskell, syntax Problem: Haskell Language Report: definition of reservedid OK, so I've spent all day playing with the Haskell Language Report (2010), and finding all sorts of "interesting" edg...	Haskell Language Report: definition of reservedid Haskell Language Report: definition of reservedid haskell syntax Haskell Language Report Haskell Language Report: definition of reservedid OK, so I've spent all day playing with the Haskell Language Report (2010), and finding all sorts of "interesting" edge-cases. Stuff...	[ 0.005859375, -0.0024261474609375, 0.0262451171875, -0.004669189453125, 0.028076171875, 0.005401611328125, -0.00628662109375, 0.00665283203125, -0.0179443359375, -0.005950927734375, 0.01373291015625, -0.008056640625, -0.0186767578125, -0.021484375, 0.007232666015625, 0.0220947265625, ...	[ 20625, 142508, 83658, 34798, 80934, 111, 70488, 532, 1556, 6002, 86531, 75169, 71189, 90791, 50171, 1916, 121303, 58437, 21493, 5351, 5608, 18499, 20653, 107003, 75675, 21533, 91067, 58994, 4068, 10461, 13648, 41206, 1957, 217225, 450, 5303, 49...	[ 0.111328125, 0.2247314453125, 0.1689453125, 0.2081298828125, 0.1490478515625, 0.02801513671875, 0.2462158203125, 0.2298583984375, 0.1026611328125, 0.05889892578125, 0.1490478515625, 0.0572509765625, 0.1029052734375, 0.011810302734375, 0.047149658203125, 0.08074951171875, 0.1494140625...	embed
69876975_c0	69876975	haskell	0	Title: Making a list of strings lowercase in Haskell Problem title: Making a list of strings lowercase in Haskell Tags: haskell Problem: Making a list of strings lowercase in Haskell I have a list of strings ["Hi", "hELLO", "nO"] and I want to convert everything to lowercase. I wrote a function for this: import Data.Ch...	Making a list of strings lowercase in Haskell Making a list of strings lowercase in Haskell haskell Data.Char Making Haskell Couldn Char Making a list of strings lowercase in Haskell I have a list of strings ["Hi", "hELLO", "nO"] and I want to convert everything to lowercase. I wrote a function for this: It compiles, b...	[ -0.000667572021484375, -0.005340576171875, 0.0250244140625, 0.00469970703125, 0.00738525390625, 0.005035400390625, -0.007568359375, -0.009521484375, 0.0078125, 0.032470703125, -0.01214599609375, -0.042724609375, 0.03515625, 0.015869140625, -0.02197265625, -0.002227783203125, 0.024536...	[ 13676, 5303, 79315, 92319, 58437, 20625, 142508, 7, 23, 1556, 11809, 84068, 191147, 19, 21656, 111, 20861, 127, 174444, 670, 3444, 96760, 26818, 47, 54397, 32354, 903, 9969, 1340, 1284, 3249, 69070, 18499, 28219, 4488 ]	[ 0.0958251953125, 0.1953125, 0.233642578125, 0.2099609375, 0.2279052734375, 0.1439208984375, 0.2435302734375, 0.0292205810546875, 0.0199127197265625, 0.1356201171875, 0.07562255859375, 0.148681640625, 0.06231689453125, 0.0745849609375, 0.14697265625, 0.004547119140625, 0.15625, 0.07...	embed
23503702_c0	23503702	haskell	0	Title: Parsec returns [Char] instead of Text Problem title: Parsec returns [Char] instead of Text Tags: type-inference, parsec, haskell Problem: Parsec returns [Char] instead of Text I am trying to create a parser for a custom file format. In the format I am working with, some fields have a closing tag like so: <SOL> <...	Parsec returns [Char] instead of Text Parsec returns [Char] instead of Text type-inference parsec haskell Data.Text Text.Parsec Text.Parsec.Text Parsec Char Text SOL DATE YEAR LANGUAGE NoMonomorphismRestriction OverloadedStrings Parsec returns [Char] instead of Text I am trying to create a parser for a custom file form...	[ 0.0022125244140625, 0.004241943359375, 0.008056640625, 0.0361328125, -0.0198974609375, 0.02490234375, 0.0042724609375, -0.02783203125, 0.000919342041015625, -0.0015869140625, -0.00732421875, -0.01507568359375, -0.0247802734375, -0.0022430419921875, 0.0013275146484375, 0.0322265625, -...	[ 2392, 39797, 30646, 84068, 64457, 111, 24129, 10644, 73, 69988, 366, 1556, 142508, 11809, 174379, 28636, 21656, 78837, 35746, 990, 127427, 98064, 438, 178851, 8780, 7655, 9578, 63033, 71713, 7, 28282, 2189, 114122, 11435, 9384, 20697, 44457, ...	[ 0.164794921875, 0.26171875, 0.2181396484375, 0.241455078125, 0.179931640625, 0.0304718017578125, 0.214111328125, 0.18603515625, 0.03387451171875, 0.1739501953125, 0.1346435546875, 0.1011962890625, 0.1998291015625, 0.085693359375, 0.1959228515625, 0.078857421875, 0.1630859375, 0.105...	embed
76116041_c0	76116041	haskell	0	Title: Exception handling in lambda calculus and functional programming Problem title: Exception handling in lambda calculus and functional programming Tags: lambda-calculus, exception, theory, functional-programming, haskell Problem: Exception handling in lambda calculus and functional programming Is there a way to mo...	Exception handling in lambda calculus and functional programming Exception handling in lambda calculus and functional programming lambda-calculus exception theory functional-programming haskell Control.Exception Exception setjmp.h errno.h signal.h Exception handling in lambda calculus and functional programming Is ther...	[ 0.00958251953125, 0.031982421875, -0.0162353515625, -0.01068115234375, 0.00714111328125, -0.0025177001953125, 0.00836181640625, -0.00250244140625, -0.019775390625, -0.053955078125, -0.003692626953125, -0.03564453125, -0.00567626953125, -0.0032196044921875, 0.0179443359375, 0.0052490234...	[ 5443, 63928, 45064, 21, 6492, 85, 44805, 223, 136, 123309, 56037, 23, 6827, 94739, 131527, 154453, 28966, 1556, 142508, 27131, 19279, 5423, 170, 2676, 127, 72, 37599, 26073, 3917, 3299, 39210, 48716, 48322, 117249, 59158, 46876, 30057, 214709...	[ 0.1378173828125, 0.258056640625, 0.21533203125, 0.03826904296875, 0.1854248046875, 0.1162109375, 0.1885986328125, 0.08001708984375, 0.0001220703125, 0.1700439453125, 0.13818359375, 0.01983642578125, 0.08935546875, 0.084716796875, 0.273193359375, 0.04241943359375, 0.09210205078125, ...	embed
48478292_c0	48478292	haskell	0	Title: Lazy operations with haskell/cryptonite Problem title: Lazy operations with haskell/cryptonite Tags: haskell Problem: Lazy operations with haskell/cryptonite I'm using cryptonite to perform AES256 encryption in CTR mode. So far, everything works fine with ByteStrings, but for better space efficiency (some files ...	Lazy operations with haskell/cryptonite Lazy operations with haskell/cryptonite haskell a Lazy ByteArray memory-0.14.6:Data.ByteArray.Types.ByteArray LBS.ByteString Lazy operations with haskell/cryptonite I'm using cryptonite to perform AES256 encryption in CTR mode. So far, everything works fine with ByteStrings, but ...	[ -0.005645751953125, 0.0074462890625, -0.00848388671875, -0.010498046875, -0.006561279296875, -0.00872802734375, 0.0166015625, 0.0081787109375, -0.002410888671875, -0.0216064453125, 0.0012664794921875, 0.0224609375, 0.0120849609375, 0.0244140625, -0.01434326171875, 0.002899169921875, ...	[ 239, 3285, 41018, 678, 1556, 142508, 136791, 191, 1486, 3311, 67, 7614, 7092, 98323, 102014, 115459, 137989, 75358, 196707, 20429, 71713, 215637, 17094, 51339, 62, 6706, 127892, 28981, 13736, 26818, 43240, 5885, 5180, 11522, 32628, 227066, 1021...	[ 0.190673828125, 0.225830078125, 0.182373046875, 0.04913330078125, 0.10699462890625, 0.2391357421875, 0.203369140625, 0.0469970703125, 0.159423828125, 0.10699462890625, 0.1319580078125, 0.128173828125, 0.2027587890625, 0.1278076171875, 0.10137939453125, 0.1907958984375, 0.059997558593...	embed
30694244_c0	30694244	haskell	0	Title: Non-exhaustive patterns in function combadd1 Problem title: Non-exhaustive patterns in function combadd1 Tags: haskell Problem: Non-exhaustive patterns in function combadd1 already added count - 1 > 0 terminate it , no infinity loop, do not know why it has this pattern ./hello hello: main.hs:(95,1)-(102,9): Non-...	Non-exhaustive patterns in function combadd1 Non-exhaustive patterns in function combadd1 haskell Non-exhaustive combadd1 main.hs count-1 comb0 mapM_ Non-exhaustive patterns in function combadd1 already added count - 1 > 0 terminate it , no infinity loop, do not know why it has this pattern expect to add one of combina...	[ -0.02294921875, 0.01544189453125, -0.0089111328125, 0.015869140625, -0.0028839111328125, 0.003448486328125, -0.006927490234375, 0.0078125, 0.021240234375, 0.01513671875, -0.000904083251953125, -0.03125, 0.053955078125, 0.0179443359375, 0.0072021484375, -0.00640869140625, -0.000549316...	[ 3775, 3355, 18391, 4935, 103510, 32354, 375, 12283, 71, 418, 1556, 142508, 5201, 127, 7, 54529, 5759, 275, 2389, 22288, 594, 21771, 49814, 106, 977, 757, 121011, 110, 54241, 40956, 3714, 41206, 15190, 1632, 162515, 140992, 62775, 23180, 959...	[ 0.16650390625, 0.020782470703125, 0.1385498046875, 0.0748291015625, 0.21435546875, 0.139404296875, 0.1268310546875, 0.1138916015625, 0.1220703125, 0.10546875, 0.1239013671875, 0.2098388671875, 0.0853271484375, 0.09149169921875, 0.03857421875, 0.1817626953125, 0.1181640625, 0.039581...	embed
54946242_c0	54946242	haskell	0	Title: Can not return maybe result in the IO Monad Problem title: Can not return maybe result in the IO Monad Tags: haskell, io-monad Problem: Can not return maybe result in the IO Monad I do not understand why this sample of code does not work and in RWH book it works: module Monads where import Data.Maybe import Cont...	Can not return maybe result in the IO Monad Can not return maybe result in the IO Monad haskell io-monad Data.Maybe Control.Monad Can Monad Monads f::String Maybe Couldn Expected Integer Actual Can not return maybe result in the IO Monad I do not understand why this sample of code does not work and in RWH book it works...	[ -0.02587890625, -0.0019073486328125, 0.00970458984375, 0.00933837890625, 0.01226806640625, 0.009521484375, 0.00171661376953125, -0.0167236328125, -0.00531005859375, 0.00860595703125, 0.01007080078125, -0.0169677734375, -0.004730224609375, -0.00128173828125, 0.015869140625, -0.015075683...	[ 4171, 959, 30646, 51139, 16750, 23, 17780, 60331, 71, 1556, 142508, 22995, 3796, 712, 11809, 82419, 372, 27131, 46674, 6468, 1238, 12, 71713, 83425, 191147, 19, 60075, 13, 44401, 100582, 28219, 903, 121413, 18151, 14602, 4488, 78691, 841, 1...	[ 0.09521484375, 0.16552734375, 0.29345703125, 0.293212890625, 0.2261962890625, 0.04754638671875, 0.249755859375, 0.2110595703125, 0.1513671875, 0.1063232421875, 0.2039794921875, 0.2276611328125, 0.138671875, 0.10302734375, 0.07110595703125, 0.1409912109375, 0.095458984375, 0.2199707...	embed
35689193_c0	35689193	haskell	0	Title: Console Output of bytestrings - deletes first character of next line Problem title: Console Output of bytestrings - deletes first character of next line Tags: unicode, haskell, bytestring Problem: Console Output of bytestrings - deletes first character of next line Answering haskell-convert-unicode-sequence-to-u...	Console Output of bytestrings - deletes first character of next line Console Output of bytestrings - deletes first character of next line unicode haskell bytestring Data.Text Data.ByteString qualified Console Output ByteString.putStrLn LANGUAGE OverloadedStrings Main Text ByteString Data.ByteString.Char8 B.putStrLn DC4...	[ 0.0087890625, 0.0206298828125, 0.01129150390625, 0.022216796875, -0.00457763671875, -0.0017852783203125, 0.011962890625, -0.00131988525390625, -0.0089111328125, 0.047119140625, 0.00164794921875, -0.00083160400390625, 0.0157470703125, -0.011962890625, -0.00408935546875, 0.0115966796875,...	[ 1657, 40777, 13538, 7077, 111, 390, 6954, 46828, 8, 74635, 5117, 62816, 11737, 13315, 60347, 112, 1556, 142508, 67, 91693, 11809, 174379, 75358, 71713, 217225, 3311, 214, 866, 3358, 98064, 9578, 63033, 12321, 24129, 84068, 1019, 335, 31455, ...	[ 0.0452880859375, 0.1944580078125, 0.1290283203125, 0.10504150390625, 0.0304718017578125, 0.094970703125, 0.169677734375, 0.1927490234375, 0.123291015625, 0.1656494140625, 0.1275634765625, 0.1898193359375, 0.11767578125, 0.1434326171875, 0.1490478515625, 0.080322265625, 0.110717773437...	embed
53689919_c0	53689919	haskell	0	Title: ApplicativeDo pragma and Applicative Functor in Haskell Problem title: ApplicativeDo pragma and Applicative Functor in Haskell Tags: applicative, haskell, functor, monads Problem: ApplicativeDo pragma and Applicative Functor in Haskell An example from Functor, Applicative, and Monad slightly changed: {-# LANGUAG...	ApplicativeDo pragma and Applicative Functor in Haskell ApplicativeDo pragma and Applicative Functor in Haskell applicative haskell functor monads Safe Control.Applicative ApplicativeDo Applicative Functor Haskell LANGUAGE Nothing You Just Please ApplicativeDo pragma and Applicative Functor in Haskell An example from F...	[ -0.00119781494140625, 0.01446533203125, 0.001007080078125, 0.023193359375, -0.01263427734375, 0.04248046875, 0.00543212890625, -0.001983642578125, 0.0012664794921875, -0.01483154296875, 0.01556396484375, -0.0208740234375, -0.004425048828125, 0.004150390625, -0.005615234375, -0.02453613...	[ 5659, 11048, 4935, 8331, 58827, 192, 136, 28670, 18770, 23, 20625, 142508, 41816, 1556, 7477, 2667, 712, 115527, 27131, 39179, 3358, 98064, 182747, 2583, 9563, 30607, 27781, 60331, 71, 161549, 98816, 51139, 284, 429, 678, 54, 87, 11814, 644...	[ 0.142333984375, 0.18115234375, 0.19189453125, 0.2008056640625, 0.1639404296875, 0.123779296875, 0.08282470703125, 0.138427734375, 0.23486328125, 0.0143280029296875, 0.156494140625, 0.25927734375, 0.18896484375, 0.124267578125, 0.1414794921875, 0.08837890625, 0.10137939453125, 0.150...	embed
42529206_c0	42529206	haskell	0	Title: How do I modify a Haskell list without entering an infinite loop? Problem title: How do I modify a Haskell list without entering an infinite loop? Tags: recursion, lazy-evaluation, infinite-loop, debugging, haskell Problem: How do I modify a Haskell list without entering an infinite loop? I am writing a piece of...	How do I modify a Haskell list without entering an infinite loop? How do I modify a Haskell list without entering an infinite loop? recursion lazy-evaluation infinite-loop debugging haskell How Haskell How do I modify a Haskell list without entering an infinite loop? I am writing a piece of code in Haskell, where I hav...	[ -0.01092529296875, 0.028564453125, 0.01116943359375, 0.00836181640625, 0.0068359375, 0.00146484375, -0.005859375, 0.0045166015625, 0.01434326171875, -0.0264892578125, 0.027587890625, -0.02734375, 0.005462646484375, -0.004150390625, 0.0128173828125, 0.005584716796875, 0.031982421875, ...	[ 11249, 2811, 40383, 20625, 142508, 5303, 15490, 22, 33558, 54241, 40956, 13, 195625, 21, 3285, 159258, 28354, 8, 978, 1556, 54, 10, 32562, 18151, 13315, 3871, 32354, 1884, 154107, 3525, 95378, 5170, 493, 24371, 41382, 2053, 45646, 29479, 11...	[ 0.043975830078125, 0.1864013671875, 0.1624755859375, 0.1591796875, 0.25390625, 0.218994140625, 0.1650390625, 0.044769287109375, 0.0731201171875, 0.1558837890625, 0.195556640625, 0.04119873046875, 0.0755615234375, 0.0849609375, 0.127197265625, 0.0947265625, 0.1153564453125, 0.014465...	embed
7656767_c0	7656767	haskell	0	Title: Should I always prefer more general types to specific types? Problem title: Should I always prefer more general types to specific types? Tags: polymorphism, haskell, ghc Problem: Should I always prefer more general types to specific types? Compiled with ghc --make , these two programs produce the exact same bina...	Should I always prefer more general types to specific types? Should I always prefer more general types to specific types? polymorphism haskell ghc Should id1a.hs id1b.hs Char Should I always prefer more general types to specific types? Compiled with ghc --make , these two programs produce the exact same binaries: Is th...	[ 0.01214599609375, 0.0029144287109375, 0.00885009765625, 0.00738525390625, 0.0091552734375, -0.00579833984375, 0.00457763671875, -0.0137939453125, -0.00634765625, -0.0135498046875, 0.00140380859375, -0.0361328125, -0.0032806396484375, -0.0133056640625, -0.0172119140625, 0.00396728515625...	[ 151117, 11343, 12601, 1286, 4537, 52895, 29458, 35874, 178851, 8780, 1556, 142508, 31380, 238, 3447, 11, 127, 275, 21656, 15612, 678, 55898, 6626, 103391, 27489, 24763, 5701, 23035, 10484, 686, 27781, 29568, 2046, 27140, 31635, 71864, 20662, ...	[ 0.07012939453125, 0.089599609375, 0.12548828125, 0.0899658203125, 0.1917724609375, 0.2496337890625, 0.2071533203125, 0.09423828125, 0.1778564453125, 0.000213623046875, 0.1029052734375, 0.2034912109375, 0.10675048828125, 0.099365234375, 0.07244873046875, 0.0206298828125, 0.05645751953...	embed
64823382_c0	64823382	haskell	0	Title: Haskell: List all common factors Problem title: Haskell: List all common factors Tags: sorting, haskell, list Problem: Haskell: List all common factors I am learning Haskell and am currently creating a program that finds all common divisors from 3 different Int:s. I have a working program but the evaluation time...	Haskell: List all common factors Haskell: List all common factors sorting haskell list Data.List Haskell List Ord Merge x:xs y:ys xs1 xs2 Haskell: List all common factors I am learning Haskell and am currently creating a program that finds all common divisors from 3 different Int:s. I have a working program but the eva...	[ 0.00151824951171875, 0.01239013671875, 0.01300048828125, -0.0164794921875, -0.00909423828125, -0.0157470703125, -0.0186767578125, -0.029541015625, 0.005523681640625, -0.0162353515625, 0.00628662109375, 0.0025787353515625, 0.025146484375, -0.0072021484375, -0.029052734375, -0.0103149414...	[ 20625, 142508, 32036, 756, 39210, 120103, 12, 12096, 214, 1556, 5303, 11809, 154663, 35379, 6035, 429, 1022, 425, 113, 4778, 418, 7, 304, 52080, 82424, 105233, 1528, 7413, 45, 51858, 1295, 138, 12921, 360, 18, 20697, 1284, 219836, 1733, 4...	[ 0.1727294921875, 0.27490234375, 0.2197265625, 0.185302734375, 0.22607421875, 0.272705078125, 0.03759765625, 0.17919921875, 0.024169921875, 0.172119140625, 0.1748046875, 0.08953857421875, 0.1512451171875, 0.166259765625, 0.1767578125, 0.062469482421875, 0.036895751953125, 0.05187988...	embed
69848165_c0	69848165	haskell	0	Title: Fibonacci infinite list performance (Higher order functions vs. Standard recursion) Problem title: Fibonacci infinite list performance (Higher order functions vs. Standard recursion) Tags: haskell, higher-order-functions, fibonacci, infinite, list-comprehension Problem: Fibonacci infinite list performance (Highe...	Fibonacci infinite list performance (Higher order functions vs. Standard recursion) Fibonacci infinite list performance (Higher order functions vs. Standard recursion) haskell higher-order-functions fibonacci infinite list-comprehension Fibonacci Higher Standard Integer Num Ord Fibonacci infinite list performance (High...	[ 0.0027313232421875, -0.013916015625, 0.002044677734375, -0.0072021484375, -0.005706787109375, -0.018798828125, 0.0032501220703125, -0.01275634765625, 0.01373291015625, -0.02490234375, 0.00933837890625, 0.0021514892578125, -0.0017852783203125, 0.003082275390625, 0.00421142578125, -0.001...	[ 3698, 20990, 52544, 54241, 13, 5303, 23718, 163025, 56, 12989, 32354, 20209, 20744, 195625, 1830, 1556, 142508, 77546, 80596, 137175, 809, 4692, 3220, 19694, 44401, 35379, 166635, 20625, 25632, 208124, 17368, 68330, 194583, 60818, 4552, 27571, ...	[ 0.1519775390625, 0.1666259765625, 0.199462890625, 0.1417236328125, 0.0657958984375, 0.1810302734375, 0.17041015625, 0.08905029296875, 0.02288818359375, 0.171630859375, 0.1748046875, 0.076904296875, 0.1407470703125, 0.1826171875, 0.0477294921875, 0.081298828125, 0.2257080078125, 0.1...	embed
31238766_c0	31238766	haskell	0	Title: Haskell: Finding the source of incomplete record construction Problem title: Haskell: Finding the source of incomplete record construction Tags: haskell, ghci, debugging, ghc Problem: Haskell: Finding the source of incomplete record construction I'm trying to debug a large, complicated program in Haskell, which ...	Haskell: Finding the source of incomplete record construction Haskell: Finding the source of incomplete record construction haskell ghci debugging ghc Haskell Finding Prelude.undefined Haskell: Finding the source of incomplete record construction I'm trying to debug a large, complicated program in Haskell, which I didn...	[ -0.000797271728515625, 0.005645751953125, -0.003814697265625, 0.0274658203125, -0.00775146484375, 0.016845703125, -0.00482177734375, 0.006683349609375, 0.00897216796875, -0.01348876953125, 0.010009765625, -0.04296875, 0.036865234375, -0.000629425048828125, 0.018798828125, -0.0016326904...	[ 20625, 142508, 26040, 31344, 82940, 46485, 17164, 50961, 1556, 31380, 318, 8, 978, 238, 1914, 822, 112, 59437, 5983, 111, 31577, 85779, 96704, 1528, 15935, 18, 167969, 33022, 35978, 28412, 2053, 45646, 99219, 54608, 25632, 18499, 5, 111531, ...	[ 0.1319580078125, 0.26416015625, 0.08880615234375, 0.1865234375, 0.128173828125, 0.1546630859375, 0.189697265625, 0.1322021484375, 0.07000732421875, 0.061187744140625, 0.088134765625, 0.13525390625, 0.151123046875, 0.031341552734375, 0.13916015625, 0.2445068359375, 0.19189453125, 0....	embed
56548719_c0	56548719	haskell	0	Title: How to run a specific number of tests in QuickCheck? Problem title: How to run a specific number of tests in QuickCheck? Tags: haskell, quickcheck Problem: How to run a specific number of tests in QuickCheck? I am trying to learn Haskell and specifically QuickCheck. While Haskell has a lot of information online ...	How to run a specific number of tests in QuickCheck? How to run a specific number of tests in QuickCheck? haskell quickcheck Test.QuickCheck 1 How QuickCheck Bool age1 age2 age3 age4 Failed Falsifiable How to run a specific number of tests in QuickCheck? I am trying to learn Haskell and specifically QuickCheck. While H...	[ -0.00860595703125, 0.01141357421875, -0.000225067138671875, 0.00518798828125, 0.006622314453125, 0.0142822265625, -0.006866455078125, -0.021240234375, 0.0023956298828125, -0.00970458984375, 0.0045166015625, -0.00823974609375, 0.008544921875, 0.0206298828125, 0.006591796875, 0.005859375...	[ 11249, 47, 11675, 29458, 14012, 109921, 23, 89038, 202567, 1556, 142508, 63773, 78292, 8647, 96010, 2594, 106, 2460, 929, 32070, 418, 304, 363, 617, 190355, 22225, 7, 27430, 2886, 30698, 20625, 237875, 28282, 96759, 3034, 678, 26499, 45831, ...	[ 0.0760498046875, 0.0198211669921875, 0.197509765625, 0.1949462890625, 0.172607421875, 0.27490234375, 0.06097412109375, 0.1702880859375, 0.296630859375, 0.07421875, 0.178955078125, 0.13232421875, 0.26171875, 0.1591796875, 0.0743408203125, 0.0888671875, 0.0185394287109375, 0.06231689...	embed
39002342_c0	39002342	haskell	0	Title: Adding an Ord instance to 'singleton' package generated naturals Problem title: Adding an Ord instance to 'singleton' package generated naturals Tags: dependent-type, haskell, singleton-type, template-haskell Problem: Adding an Ord instance to 'singleton' package generated naturals I am using...	Adding an Ord instance to 'singleton' package generated naturals Adding an Ord instance to 'singleton' package generated naturals dependent-type haskell singleton-type template-haskell Data.Singletons Data.Singletons.TH Data.Singletons.Prelude Data.Promotion.Prelude n_a9na a the Adding Ord LANGUAGE ...	[ -0.01214599609375, -0.00262451171875, -0.0024566650390625, -0.031494140625, 0.00537109375, 0.005767822265625, 0.0189208984375, -0.00150299072265625, 0.0179443359375, -0.023193359375, 0.006591796875, -0.00836181640625, -0.003936767578125, -0.0036468505859375, 0.00061798095703125, 0.0019...	[ 62, 59725, 142, 35379, 110527, 47, 3768, 6953, 133, 1507, 98169, 139392, 6083, 7, 108750, 50986, 1556, 142508, 11001, 110934, 10557, 11809, 213039, 67772, 23415, 822, 10752, 105401, 19273, 76, 98064, 19335, 196707, 140803, 196631, 6495, 27435, ...	[ 0.1231689453125, 0.1153564453125, 0.021942138671875, 0.2548828125, 0.26611328125, 0.117919921875, 0.035247802734375, 0.12255859375, 0.07159423828125, 0.1943359375, 0.1904296875, 0.129150390625, 0.197998046875, 0.02667236328125, 0.154052734375, 0.110595703125, 0.084228515625, 0.1862...	embed
51098495_c0	51098495	haskell	0	Title: Efficient way of printing property names in Haskell Problem title: Efficient way of printing property names in Haskell Tags: haskell, typeclass Problem: Efficient way of printing property names in Haskell Hello i am new to Haskell and i was wondering : For every new defined type constructor even if it is somethi...	Efficient way of printing property names in Haskell Efficient way of printing property names in Haskell haskell typeclass Efficient Haskell Letter Show Type ToString Person Male Female IsMarried Yes Worker person::Person status::IsMarried Efficient way of printing property names in Haskell Hello i am new to Haskell and...	[ -0.003631591796875, 0.0005035400390625, 0.01300048828125, 0.0235595703125, -0.003753662109375, 0.010009765625, -0.0089111328125, -0.002410888671875, 0.0023956298828125, -0.0059814453125, -0.0081787109375, -0.03125, 0.0123291015625, 0.01251220703125, -0.01312255859375, 0.0169677734375, ...	[ 24500, 45964, 3917, 2448, 1916, 57266, 123055, 20625, 142508, 1556, 10644, 67413, 105451, 17367, 60457, 717, 71713, 214, 15270, 35220, 213342, 2071, 16305, 46572, 32635, 27985, 3445, 160054, 10778, 29598, 23, 3525, 149016, 11907, 61924, 64549, ...	[ 0.1783447265625, 0.06494140625, 0.07977294921875, 0.1785888671875, 0.097412109375, 0.239990234375, 0.223876953125, 0.1500244140625, 0.2418212890625, 0.130859375, 0.1920166015625, 0.16259765625, 0.1588134765625, 0.235107421875, 0.1976318359375, 0.164794921875, 0.1466064453125, 0.105...	embed
19086408_c1	19086408	haskell	1	when defined as newtype Set' = Set' (Int -> Bool) . {-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-} import Data.List (intercalate) bound = 1000 -- ALTERNATE #1 type Set = Int -> Bool contains :: Set -> Int -> Bool contains s elem = s elem intersect :: Set -> Set -> Set intersect s t = \x -> s x && t x toStrin...	when defined as newtype Set' = Set' (Int -> Bool) . {-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-} import Data.List (intercalate) bound = 1000 -- ALTERNATE #1 type Set = Int -> Bool contains :: Set -> Int -> Bool contains s elem = s elem intersect :: Set -> Set -> Set intersect s t = \x -> s x && t x toStrin...	[ 0.00567626953125, 0.005096435546875, 0.0216064453125, 0.00811767578125, -0.004974365234375, 0.031494140625, -0.0005950927734375, -0.0198974609375, 0.004119873046875, 0.0267333984375, -0.024658203125, 0.0242919921875, 0.00689697265625, 0.01416015625, -0.00860595703125, 0.021728515625, ...	[ 3229, 61924, 71, 237, 3525, 50986, 19943, 25, 2203, 4153, 18, 33079, 2460, 929, 3358, 98064, 75930, 60457, 3371, 45757, 116071, 180842, 2661, 24927, 11809, 5, 154663, 10433, 62309, 67, 99091, 4382, 100019, 104105, 35746, 41766, 10644, 360, ...	[ 0.11083984375, 0.223388671875, 0.052825927734375, 0.053558349609375, 0.177734375, 0.326416015625, 0.286376953125, 0.1512451171875, 0.06396484375, 0.1121826171875, 0.1019287109375, 0.049346923828125, 0.106201171875, 0.2000732421875, 0.019866943359375, 0.107177734375, 0.07763671875, ...	embed
21328537_c0	21328537	haskell	0	Title: RequestBody is applied to too many type arguments Problem title: RequestBody is applied to too many type arguments Tags: http-conduit, haskell Problem: RequestBody is applied to too many type arguments What doesn't the following function doesn't typecheck: import qualified Control.Exception as E import Data.Cond...	RequestBody is applied to too many type arguments RequestBody is applied to too many type arguments http-conduit haskell Control.Exception E.SomeException qualified Data.Conduit Network.HTTP.Types Network.HTTP.Conduit RequestBody ResourceT Method Status Data.ByteString.Lazy.Char8 LBS Maybe Either Response LBS.ByteStrin...	[ 0.00799560546875, 0.043212890625, -0.0030517578125, -0.007476806640625, -0.01007080078125, 0.002685546875, 0.005035400390625, -0.017333984375, -0.0010833740234375, -0.0023651123046875, 0.003265380859375, -0.04345703125, -0.00531005859375, -0.01544189453125, -0.004180908203125, -0.00982...	[ 853, 75616, 12647, 1459, 190659, 47, 5792, 5941, 10644, 10750, 1621, 2271, 112061, 1556, 142508, 27131, 19279, 63928, 241, 217225, 11809, 28997, 23658, 5, 196707, 18544, 152055, 618, 74644, 56504, 71713, 2729, 3285, 84068, 1019, 20429, 83425, ...	[ 0.087890625, 0.17236328125, 0.161865234375, 0.1368408203125, 0.154052734375, 0.0703125, 0.140625, 0.141845703125, 0.23046875, 0.20703125, 0.10198974609375, 0.014617919921875, 0.1201171875, 0.1065673828125, 0.2181396484375, 0.19287109375, 0.002166748046875, 0.049652099609375, 0.02...	embed
45024640_c1	45024640	haskell	1	uzzy_fn(p_license_number VARCHAR) RETURNS TABLE (id INT ,license_number VARCHAR ,full_name TEXT ) AS $$ SELECT id, license_number, full_name FROM names WHERE license_number LIKE '%' \|\| p_license_number \|\| '%' $$ LANGUAGE sql; By 'fuzzy search', I mean it searches for any row with a licence number containing as a substr...	uzzy_fn(p_license_number VARCHAR) RETURNS TABLE (id INT ,license_number VARCHAR ,full_name TEXT ) AS $$ SELECT id, license_number, full_name FROM names WHERE license_number LIKE '%' \|\| p_license_number \|\| '%' $$ LANGUAGE sql; By 'fuzzy search', I mean it searches for any row with a licence number containing as a substr...	[ -0.01202392578125, -0.0252685546875, -0.00787353515625, 0.01177978515625, -0.0218505859375, 0.004058837890625, 0.034912109375, -0.0164794921875, 0.0037689208984375, -0.017822265625, 0.00860595703125, -0.012939453125, -0.00653076171875, 0.0079345703125, -0.0247802734375, 0.0116577148437...	[ 958, 3285, 14783, 254, 150, 147881, 2606, 1297, 310, 169243, 11909, 9069, 56943, 384, 183057, 532, 59537, 25724, 11627, 13018, 70981, 1388, 6483, 4369, 6755, 144832, 3447, 86872, 4393, 563, 61607, 123055, 339, 57692, 3949, 25, 915, 454, 335...	[ 0.096435546875, 0.234130859375, 0.1600341796875, 0.0679931640625, 0.073974609375, 0.1583251953125, 0.1182861328125, 0.06988525390625, 0.04803466796875, 0.038330078125, 0.09814453125, 0.0265045166015625, 0.106201171875, 0.087890625, 0.13037109375, 0.011260986328125, 0.0565185546875, ...	embed
31090228_c0	31090228	haskell	0	Title: Is it correct to use the Reader monad in this turn-based game? Problem title: Is it correct to use the Reader monad in this turn-based game? Tags: monads, haskell Problem: Is it correct to use the Reader monad in this turn-based game? I need to learn to use the Reader monad. (And also the Writer and State). The ...	Is it correct to use the Reader monad in this turn-based game? Is it correct to use the Reader monad in this turn-based game? monads haskell Reader Game AllNeeded StrategicPositions AndGameRelatedStuffs Turn PlayersPositions AndTurnDependentStuffs Is it correct to use the Reader monad in this turn-based game? I need to...	[ -0.021728515625, 0.004974365234375, 0.0167236328125, -0.00689697265625, -0.01019287109375, -0.0096435546875, -0.005645751953125, -0.007537841796875, -0.0098876953125, -0.041015625, 0.00457763671875, 0.0223388671875, -0.0047607421875, 0.0024871826171875, -0.01080322265625, -0.0185546875...	[ 26785, 4527, 70, 122636, 2667, 712, 23, 903, 15504, 77007, 6712, 7, 1556, 142508, 13547, 3164, 6433, 297, 37008, 7192, 172, 107576, 21493, 41961, 60560, 42671, 26885, 30698, 2783, 136, 22836, 6954, 11343, 58055, 7964, 171859, 35604, 87420, ...	[ 0.1845703125, 0.1212158203125, 0.028289794921875, 0.291015625, 0.1424560546875, 0.1854248046875, 0.031341552734375, 0.0841064453125, 0.1575927734375, 0.1507568359375, 0.11279296875, 0.055572509765625, 0.1083984375, 0.220947265625, 0.111083984375, 0.012908935546875, 0.07781982421875, ...	embed
51069951_c0	51069951	haskell	0	Title: Using closed type families to write functions "if type A, then X, else type Y" Problem title: Using closed type families to write functions "if type A, then X, else type Y" Tags: haskell Problem: Using closed type families to write functions "if type A, then X, else type Y" I want to define a...	Using closed type families to write functions "if type A, then X, else type Y" Using closed type families to write functions "if type A, then X, else type Y" haskell Using IORef Ptr Specialized Foo Bar Baz Using closed type families to write functions "if type A, then X, else type Y" I want to defin...	[ 0.00787353515625, -0.0067138671875, 0.000804901123046875, -0.00799560546875, -0.0023956298828125, -0.00872802734375, -0.0177001953125, 0.011962890625, 0.0025482177734375, 0.0390625, -0.0118408203125, -0.0225830078125, -0.0108642578125, 0.017333984375, 0.005096435546875, 0.0143432617187...	[ 345, 155738, 10644, 87143, 33022, 32354, 3190, 62, 7068, 1193, 37076, 990, 47, 1556, 142508, 6953, 123435, 4240, 436, 4448, 25132, 29367, 9572, 31, 3253, 36490, 3444, 61924, 5361, 208124, 3060, 52895, 4537, 756, 3789, 1286, 49846, 224343, 5...	[ 0.041107177734375, 0.2310791015625, 0.22119140625, 0.18896484375, 0.1669921875, 0.2080078125, 0.1888427734375, 0.1265869140625, 0.09710693359375, 0.09393310546875, 0.17333984375, 0.1466064453125, 0.00665283203125, 0.0970458984375, 0.211181640625, 0.007354736328125, 0.09130859375, 0...	embed
43233599_c1	43233599	haskell	1	type ‘(Label, Potential)’ • Possible cause: ‘fst’ is applied to too many arguments In the second argument of ‘(.)’, namely ‘fst x’ In the first argument of ‘VariableNode’, namely ‘(fst . fst x)’ In the first argument of ‘(:)’, namely ‘(VariableNode (fst . fst x) (snd . fst x) (snd x))’ Graph.hs:14:47: error: • Couldn'...	type ‘(Label, Potential)’ • Possible cause: ‘fst’ is applied to too many arguments In the second argument of ‘(.)’, namely ‘fst x’ In the first argument of ‘VariableNode’, namely ‘(fst . fst x)’ In the first argument of ‘(:)’, namely ‘(VariableNode (fst . fst x) (snd . fst x) (snd x))’ Graph.hs:14:47: error: • Couldn'...	[ 0.0002346038818359375, 0.0130615234375, -0.0150146484375, 0.006011962890625, 0.00982666015625, 0.017578125, -0.032470703125, -0.00787353515625, 0.003753662109375, -0.0302734375, -0.014404296875, -0.031494140625, 0.0106201171875, -0.01171875, -0.004730224609375, -0.004852294921875, 0....	[ 10644, 2729, 4063, 229677, 768, 115861, 2661, 22304, 420, 271, 83, 190659, 47, 5792, 5941, 10750, 17932, 5, 1022, 5117, 81827, 14, 2886, 5021, 112, 1238, 132, 12, 2208, 6524, 127, 22635, 33573, 18499, 191147, 18, 14858, 11, 418, 33079, ...	[ 0.2259521484375, 0.089599609375, 0.2047119140625, 0.265625, 0.041168212890625, 0.1212158203125, 0.118408203125, 0.160888671875, 0.1043701171875, 0.1602783203125, 0.0086669921875, 0.14501953125, 0.047454833984375, 0.1363525390625, 0.154541015625, 0.2327880859375, 0.13525390625, 0.07...	embed
5709183_c1	5709183	haskell	1	-version-min=10.6 -framework Cocoa "/Users/rcl/TestXCodeProjects/FFI Test/FFI Test/ForeignExportCost.a" -o "/Users/rcl/TestXCodeProjects/FFI Test/build/Debug/FFI Test.app/ Contents/MacOS/FFI Test" Undefined symbols for architecture i386: "_hs_init", referenced from: -[FFI_TestAppDelegate applicationDidFinishLaunching:]...	-version-min=10.6 -framework Cocoa "/Users/rcl/TestXCodeProjects/FFI Test/FFI Test/ForeignExportCost.a" -o "/Users/rcl/TestXCodeProjects/FFI Test/build/Debug/FFI Test.app/ Contents/MacOS/FFI Test" Undefined symbols for architecture i386: "_hs_init", referenced from: -[FFI_TestAppDelegate applicationDidFinishLaunching:]...	[ 0.0157470703125, 0.0167236328125, -0.0181884765625, 0.00238037109375, -0.004852294921875, -0.01953125, 0.0184326171875, 0.0005950927734375, 0.00299072265625, -0.0142822265625, 0.00069427490234375, -0.0498046875, 0.0025634765625, 0.0159912109375, 0.00506591796875, -0.029296875, 0.0156...	[ 46354, 1249, 122887, 160328, 18244, 80573, 11, 1062, 7, 34937, 111337, 1542, 114211, 223353, 30110, 568, 8647, 18537, 38529, 19279, 6982, 441, 5510, 31, 177149, 4657, 85779, 9007, 70870, 55450, 7285, 79912, 5983, 26582, 159958, 17, 105742, 45...	[ 0.07379150390625, 0.1788330078125, 0.16064453125, 0.078857421875, 0.01812744140625, 0.1800537109375, 0.135986328125, 0.003631591796875, 0.01824951171875, 0.06207275390625, 0.116455078125, 0.056884765625, 0.173828125, 0.0732421875, 0.1220703125, 0.119384765625, 0.1727294921875, 0.07...	embed
12906937_c1	12906937	haskell	1	,j) mat)) fim (decrementaPosicao (i,j) mat) else 0 matrizFinal:: Pos->Pos->Matrix matrizFinal (m,n) p = [[if (y,x)==p then 1 else 0 \| x<-[1..n]]\| y<-[1..m]] movimentos::Pos->[Pos] movimentos (i,j)= [(i+1,j),(i+2,j),(i-1,j),(i-2,j),(i,j+1),(i,j+2),(i,j-1),(i,j-2)] decrementaPosicao:: Pos->Matrix->Matrix decrementaPosica...	,j) mat)) fim (decrementaPosicao (i,j) mat) else 0 matrizFinal:: Pos->Pos->Matrix matrizFinal (m,n) p = [[if (y,x)==p then 1 else 0 \| x<-[1..n]]\| y<-[1..m]] movimentos::Pos->[Pos] movimentos (i,j)= [(i+1,j),(i+2,j),(i-1,j),(i-2,j),(i,j+1),(i,j+2),(i,j-1),(i,j-2)] decrementaPosicao:: Pos->Matrix->Matrix decrementaPosica...	[ 0.003753662109375, 0.031494140625, 0.00045013427734375, 0.00115203857421875, 0.00823974609375, -0.01287841796875, -0.00921630859375, 0.0059814453125, 0.035400390625, -0.0072021484375, -0.006195068359375, 0.002105712890625, 0.0240478515625, -0.006103515625, -0.0206298828125, -0.00090408...	[ 6, 4, 170, 2589, 16, 20342, 112, 7612, 32125, 7192, 172, 123142, 14, 37076, 757, 50944, 169, 6159, 6236, 13498, 7, 4613, 87427, 39, 19, 915, 3190, 53, 425, 254, 106, 1022, 113, 39712, 21748, 54651, 5759, 5428, 110218, 10461, 8, 238, ...	[ 0.022613525390625, 0.04510498046875, 0.17578125, 0.1986083984375, 0.04559326171875, 0.167236328125, 0.162841796875, 0.1964111328125, 0.1632080078125, 0.08306884765625, 0.142333984375, 0.1556396484375, 0.0877685546875, 0.0548095703125, 0.09454345703125, 0.1536865234375, 0.048675537109...	embed
42983879_c0	42983879	haskell	0	Title: Sum Of Two Squares: Where's My Error? Problem title: Sum Of Two Squares: Where's My Error? Tags: number-theory, haskell, algorithm Problem: Sum Of Two Squares: Where's My Error? I'm trying to calculate the number of ways to write a natural number as the sum of two squares. I'm working from the definiti...	Sum Of Two Squares: Where's My Error? Sum Of Two Squares: Where's My Error? number-theory haskell algorithm Sum Two Squares Where Error Integer d1_test d3_test Bool Main Numbers.SumOfSquares Sum Of Two Squares: Where's My Error? I'm trying to calculate the number of ways to write a natural number as the sum o...	[ -0.0027618408203125, -0.000934600830078125, 0.000827789306640625, -0.006195068359375, -0.0050048828125, -0.016357421875, -0.02685546875, 0.00799560546875, 0.01153564453125, -0.01287841796875, 0.00921630859375, -0.018310546875, 0.015869140625, 0.0019073486328125, 0.0021209716796875, 0.0...	[ 36335, 6619, 32964, 68305, 7, 78662, 3768, 2646, 212059, 14012, 2347, 1556, 142508, 234873, 44401, 104, 418, 6954, 363, 2460, 929, 12321, 103332, 316, 132887, 94727, 12, 31577, 74481, 48322, 33022, 6083, 237, 10554, 111, 6626, 108047, 20697, ...	[ 0.25146484375, 0.181396484375, 0.23974609375, 0.2154541015625, 0.037109375, 0.1580810546875, 0.09051513671875, 0.143310546875, 0.2744140625, 0.146728515625, 0.02166748046875, 0.1007080078125, 0.21142578125, 0.128173828125, 0.1695556640625, 0.07147216796875, 0.0751953125, 0.12622070...	embed
79209073_c0	79209073	haskell	0	Title: Stack tried to find libgmp then failed, even with no dependencies at all Problem title: Stack tried to find libgmp then failed, even with no dependencies at all Tags: nix, gmp, nix-darwin, haskell, haskell-stack Problem: Stack tried to find libgmp then failed, even with no dependencies at all I use nix-darwin an...	Stack tried to find libgmp then failed, even with no dependencies at all Stack tried to find libgmp then failed, even with no dependencies at all nix gmp nix-darwin haskell haskell-stack Stack config.yaml Library lac8fhiz0pmif1bmrkkry3w4slc9wg47-gmp-with-cxx-6.3.0 libgmp.10.dylib Referenced A379-2BC393A601C5 Users aarc...	[ -0.0198974609375, 0.01324462890625, -0.00872802734375, 0.0111083984375, -0.00024127960205078125, 0.011474609375, 0.00469970703125, -0.006378173828125, 0.00732421875, -0.01251220703125, 0.000545501708984375, -0.007720947265625, 0.00885009765625, 0.0052490234375, 0.00689697265625, 0.0025...	[ 6512, 2594, 37842, 7413, 25474, 177, 2676, 165523, 110, 42548, 117538, 678, 300, 425, 706, 9494, 1556, 142508, 590, 153837, 14520, 141, 103835, 76228, 52219, 13545, 132265, 10179, 1459, 5612, 141520, 128877, 139024, 53400, 59438, 13307, 232, ...	[ 0.183837890625, 0.15771484375, 0.0216827392578125, 0.1375732421875, 0.12744140625, 0.0880126953125, 0.2496337890625, 0.147216796875, 0.049041748046875, 0.15478515625, 0.058837890625, 0.0089111328125, 0.104248046875, 0.13525390625, 0.0928955078125, 0.16650390625, 0.117919921875, 0.1...	embed
69686123_c0	69686123	haskell	0	Title: Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number Problem title: Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number Tags: haskell, recursion, pattern-matching Problem: Functi...	Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number haskell recursion pattern-matching Hungary Japan Iceland United States Mongolia ...	[ -0.00897216796875, -0.00244140625, 0.0130615234375, 0.0159912109375, -0.01190185546875, 0.011962890625, 0.01324462890625, -0.00157928466796875, 0.00836181640625, 0.025634765625, 0.03515625, -0.0279541015625, 0.0026397705078125, -0.0201416015625, 0.01226806640625, -0.0159912109375, 0....	[ 28670, 10763, 30646, 5303, 79315, 7, 2174, 3768, 80836, 297, 14012, 83, 164917, 3501, 171859, 450, 111, 1556, 142508, 195625, 1830, 103510, 98753, 175055, 15758, 114749, 14098, 46684, 187434, 3775, 3355, 18391, 4935, 2060, 37842, 130078, 22027,...	[ 0.1605224609375, 0.0963134765625, 0.18798828125, 0.1767578125, 0.232421875, 0.0230255126953125, 0.1085205078125, 0.0931396484375, 0.20751953125, 0.07879638671875, 0.13037109375, 0.04876708984375, 0.203369140625, 0.1138916015625, 0.2149658203125, 0.0147857666015625, 0.024169921875, ...	embed
54470002_c1	54470002	haskell	1	't visible from the type of foo or a and GHC can't unify them, because it has nothing that guarantees that b and b0 are really always exactly the same and this is not such an unexpected error when working with ambiguous types. Normally when I encounter such errors, I'm able to solve them using TypeApplications and Scop...	't visible from the type of foo or a and GHC can't unify them, because it has nothing that guarantees that b and b0 are really always exactly the same and this is not such an unexpected error when working with ambiguous types. Normally when I encounter such errors, I'm able to solve them using TypeApplications and Scop...	[ 0.01123046875, -0.0005340576171875, -0.00138092041015625, 0.004180908203125, 0.00836181640625, -0.0024871826171875, -0.00872802734375, 0.00927734375, -0.000732421875, 0.004486083984375, -0.005340576171875, 0.00494384765625, 0.0125732421875, 0.0184326171875, -0.010498046875, -0.05273437...	[ 18, 75693, 1295, 10644, 5775, 31, 10, 136, 527, 73265, 831, 51, 40383, 2856, 33720, 142027, 876, 2389, 6183, 11343, 66161, 5701, 241957, 18499, 20697, 920, 12282, 10821, 52895, 28723, 190647, 86869, 60457, 47677, 182867, 182783, 297, 196707, ...	[ 0.083740234375, 0.25048828125, 0.04437255859375, 0.1558837890625, 0.16162109375, 0.1307373046875, 0.08905029296875, 0.0267486572265625, 0.06915283203125, 0.1727294921875, 0.051513671875, 0.1375732421875, 0.1566162109375, 0.033203125, 0.04669189453125, 0.0911865234375, 0.1363525390625...	embed
14825543_c0	14825543	haskell	0	Title: What does the double-backslash \\ mean in Haskell? Problem title: What does the double-backslash \\ mean in Haskell? Tags: haskell, syntax Problem: What does the double-backslash \\ mean in Haskell? I'm trying to figure out what \\ means in Haskell? I've got a program that runs perfectly when compiled, implying ...	What does the double-backslash \\ mean in Haskell? What does the double-backslash \\ mean in Haskell? haskell syntax Data.List What Haskell Main Number Integer Run Bool What does the double-backslash \\ mean in Haskell? I'm trying to figure out what \\ means in Haskell? I've got a program that runs perfectly when compi...	[ 0.0106201171875, 0.0201416015625, 0.0274658203125, 0.0078125, -0.003265380859375, 0.0250244140625, -0.00994873046875, -0.005584716796875, 0.0184326171875, -0.01806640625, 0.010009765625, 0.00384521484375, -0.004669189453125, -0.0145263671875, -0.019287109375, 0.002410888671875, 0.012...	[ 4865, 14602, 70, 41929, 12620, 7, 5544, 18991, 29459, 23, 20625, 142508, 1556, 6002, 86531, 11809, 154663, 12321, 103332, 44401, 28398, 2460, 929, 9, 31577, 26366, 2367, 26950, 1528, 127877, 169123, 375, 5974, 21980, 83, 88303, 73, 32354, 9...	[ 0.0872802734375, 0.08056640625, 0.043914794921875, 0.202880859375, 0.197998046875, 0.06591796875, 0.2177734375, 0.26708984375, 0.1817626953125, 0.115966796875, 0.1610107421875, 0.26513671875, 0.1353759765625, 0.03515625, 0.060577392578125, 0.058837890625, 0.09765625, 0.114624023437...	embed
19215851_c0	19215851	haskell	0	Title: Haskell - Return item from custom type Problem title: Haskell - Return item from custom type Tags: haskell, types Problem: Haskell - Return item from custom type I'm working on a Haskell problem for a class, and I can't seem to get the syntax right for pulling an item out of a custom type. Here's the type: -- Fi...	Haskell - Return item from custom type Haskell - Return item from custom type haskell types custom Haskell Finite State Machine FSM Char Couldn t10 t20 t30 Expected Actual Haskell - Return item from custom type I'm working on a Haskell problem for a class, and I can't seem to get the syntax right for pulling an item ou...	[ -0.0189208984375, -0.0091552734375, 0.005340576171875, 0.012939453125, -0.00439453125, 0.00982666015625, -0.01318359375, -0.00360107421875, -0.0133056640625, -0.0020751953125, 0.028076171875, -0.0220947265625, -0.0152587890625, -0.0032958984375, -0.01470947265625, -0.0030059814453125, ...	[ 20625, 142508, 173340, 35735, 1295, 114122, 10644, 20, 1556, 52895, 13316, 1486, 22836, 68311, 563, 18148, 21656, 191147, 808, 963, 1549, 1197, 60075, 13, 100582, 20697, 2967, 18507, 6002, 86531, 7108, 50065, 1810, 3034, 34292, 3444, 19048, 1...	[ 0.1392822265625, 0.23291015625, 0.2208251953125, 0.1737060546875, 0.1007080078125, 0.1993408203125, 0.2110595703125, 0.0010986328125, 0.12158203125, 0.1851806640625, 0.108642578125, 0.04547119140625, 0.0823974609375, 0.085693359375, 0.08685302734375, 0.185791015625, 0.1451416015625, ...	embed
16383396_c0	16383396	haskell	0	Title: How to replace more than one element at the same time in a String (Haskell) Problem title: How to replace more than one element at the same time in a String (Haskell) Tags: string, replace, haskell, list Problem: How to replace more than one element at the same time in a String (Haskell) i want to take 2 lists f...	How to replace more than one element at the same time in a String (Haskell) How to replace more than one element at the same time in a String (Haskell) string replace haskell list How Haskell Hou House Mouse Mou Bird How to replace more than one element at the same time in a String (Haskell) i want to take 2 lists for ...	[ -0.00677490234375, -0.00811767578125, -0.01055908203125, 0.033447265625, -0.00921630859375, 0.0091552734375, -0.004547119140625, -0.00958251953125, 0.024658203125, 0.0089111328125, 0.0155029296875, -0.00811767578125, 0.0167236328125, -0.02294921875, 0.004638671875, -0.0030059814453125,...	[ 11249, 47, 91995, 1286, 3501, 1632, 12830, 5701, 1733, 23351, 214, 6495, 7, 142508, 23, 79315, 1556, 5303, 20625, 45471, 13038, 174799, 45709, 72607, 3444, 5646, 116, 27781, 1884, 903, 8337, 7986, 450, 13538, 7077, 5608, 30646, 18, 4488, ...	[ 0.07550048828125, 0.0618896484375, 0.198486328125, 0.1927490234375, 0.1805419921875, 0.1427001953125, 0.200927734375, 0.11865234375, 0.1556396484375, 0.1900634765625, 0.1290283203125, 0.08331298828125, 0.0694580078125, 0.2108154296875, 0.05218505859375, 0.194580078125, 0.117919921875...	embed
26763855_c0	26763855	haskell	0	Title: HXT ignoring HTML DTD, replacing it with XML DTD Problem title: HXT ignoring HTML DTD, replacing it with XML DTD Tags: hxt, doctype, haskell Problem: HXT ignoring HTML DTD, replacing it with XML DTD I'm having a bit of trouble figuring out why HXT is replacing my DTD's. Firstly, here is my input file to be parse...	HXT ignoring HTML DTD, replacing it with XML DTD HXT ignoring HTML DTD, replacing it with XML DTD hxt doctype haskell HXT HTML DTD XML DOCTYPE US-ASCII App UTF-8 HXT ignoring HTML DTD, replacing it with XML DTD I'm having a bit of trouble figuring out why HXT is replacing my DTD's. Firstly, here is my input file to be ...	[ 0.00238037109375, 0.0247802734375, -0.0047607421875, -0.01165771484375, 0.00811767578125, -0.008544921875, -0.005401611328125, -0.0113525390625, -0.006195068359375, 0.004638671875, 0.003204345703125, -0.009033203125, -0.0277099609375, -0.0032806396484375, -0.01507568359375, -0.00503540...	[ 572, 70981, 47438, 19097, 391, 100045, 456, 133266, 92537, 678, 1096, 29062, 51584, 50986, 1556, 142508, 120959, 27143, 7082, 134165, 568, 5659, 30992, 17376, 4785, 63134, 26747, 15400, 759, 107730, 11435, 366, 5281, 140992, 112892, 11389, 1182...	[ 0.1380615234375, 0.275390625, 0.1590576171875, 0.2403564453125, 0.07421875, 0.24560546875, 0.040924072265625, 0.1224365234375, 0.2261962890625, 0.065673828125, 0.06842041015625, 0.250244140625, 0.122802734375, 0.2120361328125, 0.10986328125, 0.1845703125, 0.10748291015625, 0.142822...	embed
26948201_c0	26948201	haskell	0	Title: Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type Problem title: Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type Tags: ghci, haskell Problem: Infinite Square Roots : Couldn't match expected type & cannot construct...	Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type ghci haskell infisqrt xs Infinite Square Roots Couldn Float isq.hs:1:24 Relevant isq.hs:1:1 isq.hs:5:33 Occurs isq.hs:5:13...	[ 0.00860595703125, -0.003448486328125, -0.0037078857421875, -0.00396728515625, -0.004486083984375, -0.01177978515625, 0.0093994140625, 0.0010833740234375, -0.0028228759765625, -0.0257568359375, 0.0205078125, -0.013671875, 0.00994873046875, -0.01104736328125, -0.01104736328125, 0.0095825...	[ 134322, 13, 68305, 150948, 7, 191147, 3768, 18, 14858, 84751, 10644, 25133, 53418, 64549, 54241, 31380, 318, 1556, 142508, 23, 31916, 3198, 1022, 38699, 83, 864, 127, 25732, 133, 19721, 758, 31191, 48650, 22618, 19993, 619, 68649, 20625, 31...	[ 0.1627197265625, 0.08837890625, 0.132080078125, 0.2254638671875, 0.011260986328125, 0.090087890625, 0.0792236328125, 0.0924072265625, 0.1473388671875, 0.126220703125, 0.153564453125, 0.004547119140625, 0.1177978515625, 0.12255859375, 0.148681640625, 0.038360595703125, 0.062255859375,...	embed
28386117_c0	28386117	haskell	0	Title: XMonad: how to bind Super (Win key) + Space to keyboard layout switch? Problem title: XMonad: how to bind Super (Win key) + Space to keyboard layout switch? Tags: emacs, haskell, key-bindings, xmonad, keyboard-layout Problem: XMonad: how to bind Super (Win key) + Space to keyboard layout switch? I used to switch...	XMonad: how to bind Super (Win key) + Space to keyboard layout switch? XMonad: how to bind Super (Win key) + Space to keyboard layout switch? emacs haskell key-bindings xmonad keyboard-layout XMonad Super Win Space XMonad: how to bind Super (Win key) + Space to keyboard layout switch? I used to switch keyboard layout p...	[ -0.025146484375, 0.0186767578125, -0.00897216796875, -0.004302978515625, -0.0003299713134765625, 0.0021209716796875, 0.01080322265625, -0.004058837890625, 0.01141357421875, 0.01080322265625, 0.040771484375, 0.0191650390625, -0.005523681640625, -0.00360107421875, -0.0250244140625, 0.008...	[ 1193, 46674, 712, 3642, 68557, 4265, 92049, 22799, 997, 43045, 47, 149186, 108802, 101089, 352, 2263, 7, 1556, 142508, 128239, 1022, 3796, 5259, 17686, 24234, 244749, 19916, 32628, 1299, 3773, 382, 247452, 11787, 29908, 171332, 237, 24367, 12...	[ 0.10162353515625, 0.177978515625, 0.18017578125, 0.0780029296875, 0.2386474609375, 0.2142333984375, 0.181640625, 0.2127685546875, 0.13232421875, 0.280517578125, 0.1138916015625, 0.210693359375, 0.2291259765625, 0.219482421875, 0.0338134765625, 0.0625, 0.031341552734375, 0.032348632...	embed
45523507_c0	45523507	haskell	0	Title: Haskell: last digit of a very large number Problem title: Haskell: last digit of a very large number Tags: haskell Problem: Haskell: last digit of a very large number I'm trying to work out the last digit of a very large number. The challenge is that I'm getting the error *** Exception: Prelude.!!: negative inde...	Haskell: last digit of a very large number Haskell: last digit of a very large number haskell Haskell Exception Prelude Integer x:y:ys y:ys foldr1 Haskell: last digit of a very large number I'm trying to work out the last digit of a very large number. The challenge is that I'm getting the error which I don't think shou...	[ -0.013916015625, 0.023681640625, 0.0027008056640625, -0.0145263671875, -0.005615234375, -0.0084228515625, -0.0009918212890625, 0.0024871826171875, 0.01031494140625, -0.03076171875, 0.0169677734375, -0.019287109375, -0.01422119140625, 0.0011749267578125, 0.003173828125, -0.0191650390625...	[ 20625, 142508, 4568, 153939, 111, 4552, 21334, 14012, 1556, 5443, 63928, 1914, 822, 44401, 1022, 12, 53, 4778, 113, 18344, 7569, 418, 31577, 4488, 1810, 66801, 20949, 18499, 18, 5351, 5608, 7722, 96276, 9790, 759, 18151, 35509, 162076, 1369...	[ 0.1630859375, 0.261962890625, 0.263427734375, 0.2486572265625, 0.0946044921875, 0.156982421875, 0.14990234375, 0.14453125, 0.1531982421875, 0.045654296875, 0.1563720703125, 0.0750732421875, 0.161376953125, 0.1583251953125, 0.072998046875, 0.08013916015625, 0.108642578125, 0.1726074...	embed
24432341_c0	24432341	haskell	0	Title: Preserving comments in `Text.Parsec.Token` tokenizers Problem title: Preserving comments in `Text.Parsec.Token` tokenizers Tags: comments, haskell, parsec, parsing, code-translation Problem: Preserving comments in `Text.Parsec.Token` tokenizers I'm writing a source-to-source transformation using parsec , So I ha...	Preserving comments in `Text.Parsec.Token` tokenizers Preserving comments in `Text.Parsec.Token` tokenizers comments haskell parsec parsing code-translation Preserving Text.Parsec.Token LanguageDef TokenParser Text.Parsec.Token.makeTokenParser Preserving comments in `Text.Parsec.Token` tokenizers I'm writing a source-t...	[ 0.01385498046875, 0.0294189453125, -0.00396728515625, 0.0242919921875, -0.00885009765625, 0.01904296875, 0.006561279296875, -0.0006561279296875, 0.004241943359375, -0.029052734375, -0.0021209716796875, 0.040771484375, 0.0024261474609375, -0.010986328125, -0.017822265625, 0.011901855468...	[ 20703, 56, 24626, 23, 174379, 28636, 39797, 7763, 1098, 47, 52825, 1556, 142508, 366, 18151, 30145, 24129, 83658, 187423, 717, 2189, 55898, 31344, 188, 60427, 167201, 46876, 45367, 61924, 6868, 126597, 136, 152378, 12638, 22321, 22230, 75675, ...	[ 0.0792236328125, 0.116943359375, 0.2431640625, 0.00836181640625, 0.1590576171875, 0.12841796875, 0.16162109375, 0.0845947265625, 0.1678466796875, 0.07708740234375, 0.134033203125, 0.0263519287109375, 0.146484375, 0.1051025390625, 0.06640625, 0.03387451171875, 0.1383056640625, 0.116...	embed
50083476_c0	50083476	haskell	0	Title: Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns Problem title: Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns Tags: haskell, list, recursion Problem: Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns i try to write a function [int] -...	Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns haskell list recursion Haskell Beginner Error Non-exhaustive uebung1.lhs:20:2 Wincomplete-patterns Pattern Patterns _:_:_ Main Exception uebung1.lhs Haskell Beginner, rec...	[ -0.0157470703125, 0.01287841796875, 0.00616455078125, 0.006744384765625, -0.0113525390625, -0.0023040771484375, -0.008056640625, 0.0198974609375, 0.00982666015625, -0.0057373046875, 0.0084228515625, -0.022216796875, 0.014404296875, 0.00897216796875, 0.023193359375, 0.0167236328125, 0...	[ 20625, 142508, 67053, 56, 195625, 5844, 32354, 5303, 212059, 3775, 18391, 4935, 103510, 1556, 75, 21463, 79366, 16619, 17686, 277, 131801, 4453, 22766, 9876, 12321, 5443, 63928, 418, 3355, 17, 9790, 33022, 4288, 23, 18, 54529, 10554, 892, 2...	[ 0.1253662109375, 0.2362060546875, 0.1177978515625, 0.07208251953125, 0.1727294921875, 0.073974609375, 0.1383056640625, 0.1407470703125, 0.1785888671875, 0.140380859375, 0.124267578125, 0.060028076171875, 0.1885986328125, 0.0819091796875, 0.0279083251953125, 0.16259765625, 0.096435546...	embed
50672527_c0	50672527	haskell	0	Title: Haskell Servant: GET Requests with arbitrary request data Problem title: Haskell Servant: GET Requests with arbitrary request data Tags: servant, haskell, haskell-snap-framework Problem: Haskell Servant: GET Requests with arbitrary request data I'm serving an API using Servant, all managed by Snap. In Servant, i...	Haskell Servant: GET Requests with arbitrary request data Haskell Servant: GET Requests with arbitrary request data servant haskell haskell-snap-framework Haskell Servant GET Requests FromJSON ReqBody JSON RequestData Post ResponseData QueryParam FromHttpApiData Haskell Servant: GET Requests with arbitrary request data...	[ -0.0037078857421875, 0.033935546875, 0.01495361328125, -0.007415771484375, -0.0140380859375, 0.00262451171875, -0.0057373046875, -0.004791259765625, -0.0126953125, -0.041748046875, 0.01171875, -0.032470703125, -0.036376953125, -0.00537109375, -0.0185546875, 0.01397705078125, -0.00399...	[ 20625, 142508, 5406, 30624, 79794, 853, 75616, 678, 61799, 1294, 50336, 2053, 187646, 1556, 10957, 160328, 18244, 28090, 1375, 58627, 864, 12647, 1459, 821, 137989, 2795, 92748, 58836, 55292, 3062, 1434, 520, 61687, 145755, 121190, 23468, 26698...	[ 0.1519775390625, 0.2264404296875, 0.1934814453125, 0.24169921875, 0.1947021484375, 0.091552734375, 0.2222900390625, 0.09783935546875, 0.195556640625, 0.11767578125, 0.22509765625, 0.156005859375, 0.22314453125, 0.10760498046875, 0.1529541015625, 0.1058349609375, 0.007537841796875, ...	embed
20872825_c0	20872825	haskell	0	Title: Trying to render fields in threepenny-gui with special behaviour Problem title: Trying to render fields in threepenny-gui with special behaviour Tags: threepenny-gui, haskell, user-interface Problem: Trying to render fields in threepenny-gui with special behaviour What I want to do is set up fields which show de...	Trying to render fields in threepenny-gui with special behaviour Trying to render fields in threepenny-gui with special behaviour threepenny-gui haskell user-interface Trying Map Element UI.input UI.blur UI.value UI.focus Trying to render fields in threepenny-gui with special behaviour What I want to do is set up field...	[ -0.037353515625, -0.01263427734375, -0.006072998046875, -0.0220947265625, 0.0018310546875, -0.004302978515625, 0.01904296875, -0.014404296875, 0.0089111328125, -0.005828857421875, 0.006500244140625, 0.0264892578125, -0.0020599365234375, 0.0059814453125, 0.0048828125, -0.004638671875, ...	[ 40858, 89159, 44457, 17262, 2278, 299, 17086, 5361, 224833, 7, 23, 1556, 142508, 38937, 10433, 42719, 48325, 111481, 47491, 42, 27494, 3584, 11680, 3444, 54, 5423, 1257, 7639, 22443, 3229, 32153, 1284, 177074, 1836, 959, 10, 388, 90, 3794, ...	[ 0.1077880859375, 0.2017822265625, 0.214111328125, 0.182373046875, 0.17431640625, 0.1898193359375, 0.201904296875, 0.1485595703125, 0.1861572265625, 0.0237884521484375, 0.03997802734375, 0.08935546875, 0.2091064453125, 0.05987548828125, 0.036041259765625, 0.1639404296875, 0.1247558593...	embed
44976769_c0	44976769	haskell	0	Title: I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong Problem title: I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong Tags: haskell Prob...	I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong haskell Haskell Name Test f_name t:ts o:...	[ 0.0091552734375, -0.00799560546875, -0.01300048828125, 0.00927734375, 0.00726318359375, 0.01019287109375, -0.00927734375, -0.0062255859375, 0.007232666015625, 0.001007080078125, 0.01312255859375, -0.004364013671875, 0.000743865966796875, -0.015869140625, 0.0087890625, 0.000812530517578...	[ 3768, 20625, 142508, 2500, 184, 18499, 7522, 172, 214552, 18597, 22062, 707, 1239, 98753, 1620, 27853, 53418, 1957, 44691, 2367, 1556, 15757, 8647, 1238, 11627, 808, 933, 36, 232, 2970, 142484, 190355, 53400, 141423, 123254, 43731, 105376, 56...	[ 0.04644775390625, 0.1405029296875, 0.2249755859375, 0.1466064453125, 0.1141357421875, 0.1624755859375, 0.09912109375, 0.0860595703125, 0.1533203125, 0.17333984375, 0.1107177734375, 0.0703125, 0.10394287109375, 0.2340087890625, 0.1595458984375, 0.1885986328125, 0.0966796875, 0.11401...	embed
24376521_c1	24376521	haskell	1	.b. I've tried using Traversable.mapAccumL and Vector.unfoldrN instead of State and they end up being about the same speed and clarity. It's still a very overcomplicated way of solving this problem. import Criterion.Config import Criterion.Main import Control.DeepSeq import Control.Monad.State import Data.Maybe import ...	.b. I've tried using Traversable.mapAccumL and Vector.unfoldrN instead of State and they end up being about the same speed and clarity. It's still a very overcomplicated way of solving this problem. import Criterion.Config import Criterion.Main import Control.DeepSeq import Control.Monad.State import Data.Maybe import ...	[ -0.025634765625, 0.004669189453125, -0.0029449462890625, -0.006011962890625, 0.01214599609375, 0.01397705078125, 0.00054931640625, -0.0028228759765625, 0.00482177734375, -0.0233154296875, 0.01220703125, 0.040283203125, -0.005859375, 0.0233154296875, 0.012939453125, 0.00701904296875, ...	[ 6, 5, 275, 37842, 17368, 4937, 7864, 2886, 62346, 10591, 866, 2609, 18770, 309, 42822, 839, 64457, 22836, 1836, 3564, 8035, 1672, 5701, 38352, 136, 17306, 2481, 7464, 4552, 645, 52721, 3115, 6496, 903, 2967, 24927, 26315, 720, 1830, 83671...	[ 0.033233642578125, 0.12060546875, 0.05523681640625, 0.05889892578125, 0.054107666015625, 0.1099853515625, 0.1754150390625, 0.19775390625, 0.1199951171875, 0.1802978515625, 0.115478515625, 0.178955078125, 0.2186279296875, 0.0850830078125, 0.173095703125, 0.105224609375, 0.082763671875...	embed
73158909_c0	73158909	haskell	0	Title: Elegant way to access the value of a record in haskell which is inside a monad Problem title: Elegant way to access the value of a record in haskell which is inside a monad Tags: pointfree, record, monads, haskell, functional-programming Problem: Elegant way to access the value of a record in haskell which is in...	Elegant way to access the value of a record in haskell which is inside a monad Elegant way to access the value of a record in haskell which is inside a monad pointfree record monads haskell functional-programming Elegant MonadIO Wave Elegant way to access the value of a record in haskell which is inside a monad General...	[ -0.0118408203125, -0.01043701171875, -0.0038299560546875, -0.006744384765625, 0.0033111572265625, 0.0028076171875, 0.00848388671875, -0.00848388671875, 0.0162353515625, -0.0284423828125, 0.025390625, -0.00750732421875, -0.003509521484375, -0.038818359375, -0.00445556640625, -0.01147460...	[ 161231, 3917, 17203, 34292, 17164, 1556, 142508, 46132, 2667, 712, 23, 6275, 32087, 123309, 28966, 60331, 71, 17780, 148529, 10, 43581, 2967, 32354, 10644, 80934, 1238, 347, 33079, 335, 114122, 2053, 50986, 97, 3642, 831, 32786, 6044, 237, ...	[ 0.261962890625, 0.07513427734375, 0.21142578125, 0.196533203125, 0.2083740234375, 0.1402587890625, 0.26953125, 0.1693115234375, 0.1427001953125, 0.2010498046875, 0.043670654296875, 0.0855712890625, 0.19140625, 0.1331787109375, 0.08251953125, 0.161865234375, 0.11962890625, 0.2292480...	embed
48269226_c0	48269226	haskell	0	Title: Unified interface for pure and constrained monadic functions Problem title: Unified interface for pure and constrained monadic functions Tags: polymorphism, overloading, typeclass, haskell Problem: Unified interface for pure and constrained monadic functions I want to create overloaded function by x type variabl...	Unified interface for pure and constrained monadic functions Unified interface for pure and constrained monadic functions polymorphism overloading typeclass haskell Unified MonadThrow MyClasss MonadConstraint Constraint Identity MyClass Illegal Text Reason Un-determined Unified interface for pure and constrained monadi...	[ -0.01251220703125, 0.0196533203125, 0.02734375, 0.005218505859375, 0.0267333984375, 0.009033203125, 0.0006256103515625, -0.000255584716796875, 0.01025390625, -0.0189208984375, -0.00194549560546875, -0.035400390625, -0.001495361328125, -0.01171875, 0.006561279296875, -0.021240234375, ...	[ 992, 47314, 101758, 34166, 136, 158, 9297, 2667, 11, 18403, 32354, 100, 35874, 178851, 8780, 645, 63033, 10644, 67413, 1556, 142508, 60331, 71, 15555, 2646, 140803, 2816, 71257, 891, 86966, 24129, 236267, 112, 30524, 122009, 3444, 28282, 297,...	[ 0.127197265625, 0.187255859375, 0.2156982421875, 0.1199951171875, 0.05792236328125, 0.04144287109375, 0.136474609375, 0.109619140625, 0.052734375, 0.057525634765625, 0.182861328125, 0.011444091796875, 0.09613037109375, 0.1787109375, 0.026275634765625, 0.117919921875, 0.2125244140625,...	embed
31226073_c0	31226073	haskell	0	Title: Using cubes in postgresql-simple results in error of "syntax error in multi-row template" Problem title: Using cubes in postgresql-simple results in error of "syntax error in multi-row template" Tags: postgresql, haskell, cube Problem: Using cubes in postgresql-simple results in error of "syn...	Using cubes in postgresql-simple results in error of "syntax error in multi-row template" Using cubes in postgresql-simple results in error of "syntax error in multi-row template" postgresql haskell cube Using SELECT WHERE ORDER cube_distance ASC INSERT INTO VALUES Float mapM_ Cube Using cubes in po...	[ 0.0111083984375, -0.0026702880859375, -0.01312255859375, 0.01153564453125, 0.002197265625, 0.00439453125, -0.0022735595703125, -0.022216796875, 0.0224609375, -0.0244140625, 0.0240478515625, -0.03955078125, -0.002655029296875, -0.0198974609375, -0.02978515625, 0.0030059814453125, -0.0...	[ 345, 314, 7438, 1305, 17562, 99247, 191560, 18499, 12654, 86531, 6024, 15555, 110934, 1556, 142508, 372, 6755, 144832, 33172, 18044, 56883, 125429, 64083, 56263, 213354, 310, 89994, 38699, 22288, 594, 3003, 131148, 4527, 91, 678, 3129, 43240, ...	[ 0.054931640625, 0.1632080078125, 0.1849365234375, 0.02545166015625, 0.114501953125, 0.1353759765625, 0.2044677734375, 0.1295166015625, 0.07061767578125, 0.1192626953125, 0.06134033203125, 0.1077880859375, 0.2021484375, 0.02020263671875, 0.1287841796875, 0.1729736328125, 0.01536560058...	embed
35820970_c0	35820970	haskell	0	Title: Using the map/mapM function to return a String ready for putStrLn to separate list elements Problem title: Using the map/mapM function to return a String ready for putStrLn to separate list elements Tags: newline, haskell, dictionary Problem: Using the map/mapM function to return a String ready for putStrLn to s...	Using the map/mapM function to return a String ready for putStrLn to separate list elements Using the map/mapM function to return a String ready for putStrLn to separate list elements newline haskell dictionary Using Car Ford Mondeo Autotrader Parkers Golf mapM_ Using the map/mapM function to return a String ready for ...	[ 0.003021240234375, -0.0162353515625, -0.005889892578125, 0.0111083984375, -0.0234375, 0.0052490234375, 0.024169921875, 0.00604248046875, 0.0169677734375, -0.00823974609375, -0.01251220703125, -0.0137939453125, 0.00177764892578125, 0.0172119140625, 0.0087890625, 0.000274658203125, -0....	[ 345, 22288, 64, 62346, 594, 32354, 30646, 23351, 214, 43542, 3884, 71713, 866, 19, 47, 84797, 5303, 80854, 3525, 2256, 1556, 142508, 45, 10763, 3980, 17652, 111651, 31, 4396, 1517, 820, 119109, 7, 23426, 454, 100, 31577, 28282, 10644, 159...	[ 0.064208984375, 0.224365234375, 0.035552978515625, 0.156982421875, 0.1876220703125, 0.1766357421875, 0.17626953125, 0.19189453125, 0.0936279296875, 0.16845703125, 0.1163330078125, 0.12744140625, 0.05194091796875, 0.029296875, 0.05584716796875, 0.203857421875, 0.1883544921875, 0.125...	embed
51878873_c0	51878873	haskell	0	Title: Storing IO action result in a LET clause Problem title: Storing IO action result in a LET clause Tags: haskell Problem: Storing IO action result in a LET clause Hello can someone please explain me how do you store in haskell the result of an action in a let block if you know you are going to use it from that poi...	Storing IO action result in a LET clause Storing IO action result in a LET clause haskell System.IO System.Directory DB Company Storing Main main::IO Insert Created Existed Already makeDir::String Bool Directory Storing IO action result in a LET clause Hello can someone please explain me how do you store in haskell the...	[ 0.00081634521484375, 0.0047607421875, 0.00970458984375, 0.0294189453125, 0.00604248046875, 0.0185546875, -0.00107574462890625, -0.000614166259765625, 0.0103759765625, -0.01409912109375, -0.00225830078125, 0.01904296875, 0.015869140625, 0.020751953125, 0.006683349609375, 0.0023956298828...	[ 23604, 214, 17780, 22631, 16750, 23, 27089, 70731, 13, 1556, 142508, 12353, 184911, 30675, 57976, 33734, 12321, 5201, 33657, 151313, 99068, 1283, 3249, 481, 71713, 2460, 929, 31068, 73342, 3642, 54, 398, 4343, 2633, 46389, 4527, 6275, 3871, ...	[ 0.2022705078125, 0.047637939453125, 0.2252197265625, 0.204345703125, 0.2186279296875, 0.054931640625, 0.2164306640625, 0.1937255859375, 0.0360107421875, 0.15087890625, 0.25048828125, 0.069580078125, 0.1640625, 0.1048583984375, 0.102294921875, 0.0869140625, 0.037872314453125, 0.0549...	embed
75518923_c2	75518923	haskell	2	.0.0.0, process-1.6.13.0 (constraint from user target requires ==1.6.16.0) [__1] fail (backjumping, conflict set: ghc, process) After searching the rest of the dependency tree exhaustively, these were the goals I've had most trouble fulfilling: process, ghc I tried to installing it with both GHC 9.4.4 and GHC 8.8.4. Al...	.0.0.0, process-1.6.13.0 (constraint from user target requires ==1.6.16.0) [__1] fail (backjumping, conflict set: ghc, process) After searching the rest of the dependency tree exhaustively, these were the goals I've had most trouble fulfilling: process, ghc I tried to installing it with both GHC 9.4.4 and GHC 8.8.4. Al...	[ 0.001739501953125, -0.005828857421875, 0.0106201171875, -0.000606536865234375, -0.002960205078125, 0.00017833709716796875, -0.02783203125, -0.005096435546875, 0.0023193359375, 0.016357421875, -0.004547119140625, -0.0224609375, 0.00421142578125, -0.0013427734375, 0.01495361328125, 0.004...	[ 2389, 99929, 9433, 5759, 173245, 132265, 2271, 2816, 4288, 1295, 38937, 30388, 144570, 69112, 122336, 2485, 35782, 12620, 461, 44287, 79612, 5423, 31380, 238, 42548, 27771, 53201, 109458, 2684, 63134, 211394, 37842, 20600, 527, 73265, 3569, 180...	[ 0.1087646484375, 0.1790771484375, 0.191162109375, 0.0258636474609375, 0.1119384765625, 0.1357421875, 0.034271240234375, 0.1649169921875, 0.072998046875, 0.04925537109375, 0.1287841796875, 0.1947021484375, 0.192626953125, 0.0048828125, 0.171142578125, 0.139892578125, 0.20751953125, ...	embed
7866375_c0	7866375	haskell	0	Title: Why does GHC think that this type variable is not injective? Problem title: Why does GHC think that this type variable is not injective? Tags: ghc, haskell Problem: Why does GHC think that this type variable is not injective? I have this piece of code: {-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies, ...	Why does GHC think that this type variable is not injective? Why does GHC think that this type variable is not injective? ghc haskell CatchError the Why GHC LANGUAGE MultiParamTypeClasses FunctionalDependencies KindSignatures GADTs FlexibleInstances FlexibleContexts Monad Effect ErrorEff Could Why does GHC think that t...	[ -0.01129150390625, 0.0045166015625, 0.00830078125, 0.00543212890625, -0.0130615234375, 0.0145263671875, -0.020263671875, -0.000362396240234375, -0.0068359375, -0.0130615234375, -0.01336669921875, -0.0255126953125, -0.004058837890625, 0.006683349609375, 0.017822265625, 0.007415771484375...	[ 44084, 527, 73265, 5351, 903, 10644, 77336, 83, 959, 115049, 5844, 31380, 238, 1556, 142508, 18826, 206, 18468, 31611, 98064, 19335, 55292, 196707, 140803, 26885, 27435, 218723, 23749, 41072, 180842, 2661, 116071, 22829, 60331, 71, 129297, 2120...	[ 0.1024169921875, 0.0916748046875, 0.2080078125, 0.109375, 0.07489013671875, 0.200439453125, 0.254638671875, 0.07940673828125, 0.181884765625, 0.21728515625, 0.151611328125, 0.10467529296875, 0.112548828125, 0.1029052734375, 0.2081298828125, 0.105224609375, 0.0211639404296875, 0.080...	embed
30175974_c0	30175974	haskell	0	Title: Haskell function to check if two values are identical Problem title: Haskell function to check if two values are identical Tags: haskell Problem: Haskell function to check if two values are identical In Haskell we have the function (==) :: Eq a => a->a->Bool which is fine for the large number of datatypes for wh...	Haskell function to check if two values are identical Haskell function to check if two values are identical haskell Haskell Bool Foo Haskell function to check if two values are identical In Haskell we have the function (==) :: Eq a => a->a->Bool which is fine for the large number of datatypes for which an instance of E...	[ -0.000827789306640625, 0.0067138671875, -0.01007080078125, 0.011962890625, 0.02001953125, 0.011474609375, -0.004608154296875, -0.005462646484375, 0.002105712890625, -0.0162353515625, 0.00946044921875, 0.01611328125, -0.004058837890625, 0.0068359375, 0.000293731689453125, -0.01440429687...	[ 20625, 142508, 32354, 47, 12765, 2174, 6626, 142424, 621, 31943, 6827, 1556, 2460, 929, 9572, 31, 69112, 1984, 241, 864, 10, 103607, 11, 12647, 5885, 2053, 50986, 110527, 61924, 52895, 110, 169022, 27781, 8781, 10644, 275, 16487, 1221, 1419...	[ 0.1417236328125, 0.250244140625, 0.19384765625, 0.05169677734375, 0.2200927734375, 0.118896484375, 0.16259765625, 0.20166015625, 0.0875244140625, 0.2247314453125, 0.1695556640625, 0.1328125, 0.0841064453125, 0.1685791015625, 0.1724853515625, 0.13720703125, 0.17236328125, 0.06112670...	embed
74527112_c0	74527112	haskell	0	Title: Matching on a particular type of a parametric type Problem title: Matching on a particular type of a parametric type Tags: typeclass, haskell Problem: Matching on a particular type of a parametric type I'm trying to work with an external library that has provided a parametric type like this: data ParametricType ...	Matching on a particular type of a parametric type Matching on a particular type of a parametric type typeclass haskell Matching ParametricType TypeConstructor GetsString HoldsString Illegal All Couldn Matching on a particular type of a parametric type I'm trying to work with an external library that has provided a par...	[ -0.01361083984375, 0.00051116943359375, -0.0047607421875, -0.01025390625, -0.00537109375, 0.003082275390625, -0.00518798828125, -0.00176239013671875, 0.0067138671875, 0.001312255859375, 0.017822265625, -0.050048828125, -0.015869140625, -0.0017852783203125, -0.012451171875, -0.030883789...	[ 67407, 214, 98, 17311, 10644, 121, 186518, 67413, 1556, 142508, 1720, 196707, 60457, 36716, 748, 20779, 71713, 41656, 891, 86966, 3164, 191147, 173591, 35773, 71924, 18151, 10, 29458, 18304, 34648, 18499, 110527, 21635, 724, 7831, 55292, 43512,...	[ 0.24169921875, 0.111572265625, 0.11572265625, 0.1385498046875, 0.172607421875, 0.1051025390625, 0.146484375, 0.170166015625, 0.1170654296875, 0.197509765625, 0.103271484375, 0.1639404296875, 0.166259765625, 0.09063720703125, 0.010650634765625, 0.043426513671875, 0.1578369140625, 0....	embed
4364657_c0	4364657	haskell	0	Title: Why the boilerplates when writing new Monad Transformers Problem title: Why the boilerplates when writing new Monad Transformers Tags: haskell, boilerplate, monads, monad-transformers Problem: Why the boilerplates when writing new Monad Transformers This section http://book.realworldhaskell.org/read/monad-transf...	Why the boilerplates when writing new Monad Transformers Why the boilerplates when writing new Monad Transformers haskell boilerplate monads monad-transformers Why Monad Transformers MonadState MonadIO MaybeT Maybe MonadTrans Just Why the boilerplates when writing new Monad Transformers This section http://book.realwor...	[ -0.0091552734375, -0.00089263916015625, 0.014892578125, -0.00830078125, 0.01165771484375, -0.0224609375, -0.010986328125, -0.000232696533203125, -0.0167236328125, -0.01513671875, 0.00193023681640625, -0.00677490234375, -0.0029449462890625, -0.000762939453125, 0.000888824462890625, -0.0...	[ 44084, 337, 34759, 92558, 7, 3229, 32562, 3525, 60331, 71, 11062, 82772, 1556, 142508, 2667, 712, 215175, 1314, 135206, 17780, 83425, 618, 62624, 14137, 30544, 32554, 10557, 39116, 3796, 12877, 5120, 6661, 20625, 122, 110527, 100, 23009, 5974...	[ 0.115234375, 0.099853515625, 0.1497802734375, 0.255126953125, 0.02685546875, 0.0187530517578125, 0.1768798828125, 0.1473388671875, 0.1910400390625, 0.1568603515625, 0.157470703125, 0.2462158203125, 0.1099853515625, 0.226318359375, 0.1280517578125, 0.1484375, 0.232666015625, 0.09838...	embed
65590600_c1	65590600	haskell	1	TooBig Int deriving Show choose :: MonadPlus m => [a] -> m a choose = msum . map return ex1 :: (MonadPlus m, MonadError TooBig m) => m Int ex1 = do x <- choose [5,7,1] if x > 5 then throwError (TooBig x) `catchError` handler else return x where handler (TooBig x) = if x > 7 then throwError (TooBig x) else return x ex3...	TooBig Int deriving Show choose :: MonadPlus m => [a] -> m a choose = msum . map return ex1 :: (MonadPlus m, MonadError TooBig m) => m Int ex1 = do x <- choose [5,7,1] if x > 5 then throwError (TooBig x) `catchError` handler else return x where handler (TooBig x) = if x > 7 then throwError (TooBig x) else return x ex3...	[ -0.0167236328125, 0.01019287109375, 0.0224609375, 0.010498046875, 0.00144195556640625, 0.0009002685546875, -0.01361083984375, -0.0164794921875, 0.0184326171875, -0.0103759765625, 0.0093994140625, -0.0068359375, 0.014404296875, -0.02197265625, 0.01458740234375, 0.0026092529296875, -0....	[ 56374, 129933, 360, 18, 16406, 17367, 55076, 60331, 71, 88225, 347, 11, 10, 11832, 22288, 30646, 1119, 418, 46674, 712, 18468, 31611, 1022, 135461, 2174, 190, 104250, 7763, 31, 4460, 35863, 361, 363, 4153, 11675, 37379, 19462, 154663, 618, ...	[ 0.1845703125, 0.27490234375, 0.1182861328125, 0.1346435546875, 0.0953369140625, 0.2288818359375, 0.1783447265625, 0.1470947265625, 0.07781982421875, 0.2037353515625, 0.0826416015625, 0.006195068359375, 0.023223876953125, 0.1500244140625, 0.08062744140625, 0.093994140625, 0.1055297851...	embed
55716502_c1	55716502	haskell	1	ex.PCRE Yields <no location info>: error: Ambiguous module name ‘Text.Regex.PCRE’: it was found in multiple packages: regex-pcre-0.94.4 regex-pcre-builtin-0.94.4.8.8.35 I would like to revert my installation to the earlier state such that code on my machine that imports Text.Regex.PCRE without qualification continues t...	ex.PCRE Yields <no location info>: error: Ambiguous module name ‘Text.Regex.PCRE’: it was found in multiple packages: regex-pcre-0.94.4 regex-pcre-builtin-0.94.4.8.8.35 I would like to revert my installation to the earlier state such that code on my machine that imports Text.Regex.PCRE without qualification continues t...	[ -0.007049560546875, -0.015869140625, 0.00933837890625, 0.04248046875, 0.01251220703125, 0.00927734375, -0.00592041015625, 0.002105712890625, -0.0191650390625, -0.006500244140625, 0.0037841796875, 0.0023956298828125, -0.00555419921875, -0.0306396484375, 0.0166015625, 0.0118408203125, ...	[ 1119, 12233, 11766, 42341, 19388, 7, 157, 31913, 3004, 18499, 10250, 12282, 10821, 88996, 9351, 174379, 54601, 3355, 14037, 23, 48716, 98169, 6835, 254, 7612, 143161, 180874, 978, 379, 2311, 200701, 5843, 1884, 47, 39531, 18, 59720, 110680, ...	[ 0.1495361328125, 0.1077880859375, 0.25537109375, 0.13232421875, 0.200927734375, 0.036590576171875, 0.0367431640625, 0.19189453125, 0.0665283203125, 0.153564453125, 0.1373291015625, 0.1783447265625, 0.080810546875, 0.224853515625, 0.06134033203125, 0.1990966796875, 0.1683349609375, ...	embed
38791455_c1	38791455	haskell	1	_hsc_make.o -fno-stack-protector -D__GLASGOW_HASKELL__=710 -Dlinux_BUILD_OS=1 -Dx86_64_BUILD_ARCH=1 -Dlinux_HOST_OS=1 -Dx86_64_HOST_ARCH=1 -Icbits -Idist/build/autogen -include dist/build/autogen/cabal_macros.h -I/usr/local/haskell/ghc-7.10.2-x86_64/lib/ghc-7.10.2/base_GDytRqRVSUX7zckgKqJjgw/include -I/usr/local/haskel...	_hsc_make.o -fno-stack-protector -D__GLASGOW_HASKELL__=710 -Dlinux_BUILD_OS=1 -Dx86_64_BUILD_ARCH=1 -Dlinux_HOST_OS=1 -Dx86_64_HOST_ARCH=1 -Icbits -Idist/build/autogen -include dist/build/autogen/cabal_macros.h -I/usr/local/haskell/ghc-7.10.2-x86_64/lib/ghc-7.10.2/base_GDytRqRVSUX7zckgKqJjgw/include -I/usr/local/haskel...	[ -0.013671875, 0.015380859375, 0.00933837890625, -0.0079345703125, 0.00012493133544921875, 0.01123046875, -0.02783203125, -0.006988525390625, -0.0086669921875, -0.001251220703125, -0.025634765625, -0.031005859375, 0.000576019287109375, -0.00958251953125, 0.0084228515625, 0.0125122070312...	[ 101, 127, 10382, 55898, 31, 420, 157, 590, 2594, 208202, 1290, 46705, 19930, 1456, 101413, 605, 56051, 966, 963, 397, 2397, 6077, 15639, 16444, 7285, 33000, 15276, 13307, 169243, 34274, 3137, 46295, 177149, 8913, 1409, 217028, 408, 3571, 36...	[ 0.030059814453125, 0.1298828125, 0.1597900390625, 0.1248779296875, 0.1649169921875, 0.046661376953125, 0.2095947265625, 0.12109375, 0.1461181640625, 0.2239990234375, 0.1654052734375, 0.09588623046875, 0.167724609375, 0.1224365234375, 0.14599609375, 0.12939453125, 0.2138671875, 0.03...	embed
43551745_c0	43551745	haskell	0	Title: Missing C library: Problem title: Missing C library: Tags: haskell, ffi Problem: Missing C library: I have written some simplistic code to call a function in a C library. The code compiles (and a similar piece works for a standard C library) but when I compile and link, ghc cannot find the C library. My cabal fi...	Missing C library: Missing C library: haskell ffi ccall Missing MainFFI4TT.hs Haskell2010 Include-dirs Includes tagger-api.h libtreetagger.so init_treetagger c_initTreeTagger CString param_file_name german-utf8.par Missing C library: I have written some simplistic code to call a function in a C library. The code compil...	[ 0.0147705078125, 0.003814697265625, 0.011962890625, -0.004791259765625, 0.00811767578125, -0.021484375, 0.00787353515625, -0.00628662109375, -0.00341796875, -0.041259765625, -0.00171661376953125, -0.041259765625, -0.0059814453125, 0.0274658203125, 0.01519775390625, -0.0086669921875, ...	[ 16771, 214, 313, 35773, 1294, 1556, 142508, 24500, 85763, 12321, 30110, 568, 617, 13739, 127, 20625, 11436, 822, 936, 308, 21407, 40897, 25474, 62600, 102, 991, 217, 62731, 66448, 1505, 2852, 121, 29822, 42712, 1019, 2500, 59121, 112892, 28...	[ 0.1500244140625, 0.063232421875, 0.14697265625, 0.23583984375, 0.146728515625, 0.139892578125, 0.2318115234375, 0.15380859375, 0.1934814453125, 0.0821533203125, 0.095703125, 0.0279083251953125, 0.07537841796875, 0.140380859375, 0.07379150390625, 0.1365966796875, 0.1611328125, 0.063...	embed
32959661_c0	32959661	haskell	0	Title: How to avoid needless rebuilds with stack? Problem title: How to avoid needless rebuilds with stack? Tags: haskell-stack, haskell Problem: How to avoid needless rebuilds with stack? Stack usually caches package dependency builds to save time in future builds, but I've noticed many cases in practice where this do...	How to avoid needless rebuilds with stack? How to avoid needless rebuilds with stack? haskell-stack haskell Network.Haskoin.Internals How lts-2.15 haskoin-0.1.0.2 json-rpc-0.2.1.6 pbkdf-1.1.1.1 text-1.1.1.4 Main.hs Haskell2010 How to avoid needless rebuilds with stack? Stack usually caches package dependency builds to ...	[ -0.0012969970703125, 0.003326416015625, -0.005096435546875, 0.01318359375, -0.0235595703125, 0.005096435546875, -0.0230712890625, 0.00628662109375, -0.01214599609375, -0.015869140625, 0.01495361328125, -0.0228271484375, 0.024169921875, 0.0191650390625, 0.013916015625, 0.02001953125, ...	[ 11249, 71864, 3871, 9393, 456, 177149, 7, 678, 177261, 1556, 142508, 590, 2594, 28997, 6495, 1579, 73, 44851, 933, 1837, 256, 102014, 133684, 1647, 1681, 57095, 122336, 420, 83783, 7986, 92134, 91977, 12321, 127, 20625, 11436, 6512, 56104, ...	[ 0.0171966552734375, 0.1702880859375, 0.1005859375, 0.1556396484375, 0.1483154296875, 0.23583984375, 0.03668212890625, 0.0989990234375, 0.257568359375, 0.1041259765625, 0.197021484375, 0.1324462890625, 0.17333984375, 0.037261962890625, 0.08599853515625, 0.1373291015625, 0.108642578125...	embed
59550775_c0	59550775	haskell	0	Title: How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? Problem title: How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? Tags: semigroup, haskell, monoids Problem: How to solve a Haskell code error...	How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? semigroup haskell monoids Data.Monoid How Haskell Monoid RevList Nil RCons Show Semigroup RNil How...	[ -0.031005859375, 0.0224609375, 0.01708984375, 0.02783203125, 0.01214599609375, 0.02587890625, -0.0029296875, 0.003814697265625, 0.004241943359375, -0.0040283203125, -0.0108642578125, -0.0034027099609375, 0.01470947265625, 0.004058837890625, -0.0072021484375, -0.025390625, -0.00720214...	[ 11249, 86869, 20625, 142508, 18151, 18499, 5386, 3768, 959, 99017, 55300, 18507, 46674, 48899, 83, 36137, 51588, 1556, 22460, 30185, 11809, 77879, 532, 80893, 154663, 77175, 81135, 5245, 17367, 84420, 379, 16093, 2740, 10, 21635, 3525, 2053, ...	[ 0.00726318359375, 0.16357421875, 0.127197265625, 0.2454833984375, 0.1727294921875, 0.2073974609375, 0.043182373046875, 0.094970703125, 0.165771484375, 0.239501953125, 0.2015380859375, 0.162353515625, 0.1500244140625, 0.2261962890625, 0.0271453857421875, 0.1297607421875, 0.17456054687...	embed

43729170_c1

43729170

haskell

1

so: h :: D t -> ... h = ... f (DWrap _ x) = h x And either way completeness checking should make sure I don't do anything silly. Except this approach won't work. Firstly, because t is not an ordinary type of kind * , it's of kind T . Secondly T1 isn't even of type 'T1 , it's a member of the type T , just like T2 , T3 ...

[ -0.01361083984375, 0.0086669921875, -0.00799560546875, -0.0113525390625, 0.0010223388671875, -0.0191650390625, -0.0242919921875, -0.003265380859375, 0.007720947265625, -0.004608154296875, -0.002410888671875, -0.00958251953125, 0.00958251953125, 0.00018405914306640625, -0.0179443359375, ...

[ 1096, 1984, 391, 808, 33079, 2203, 1238, 397, 1456, 13631, 1022, 40101, 28484, 7432, 175199, 12097, 218288, 51515, 23742, 18, 4488, 6637, 959, 23335, 10644, 8562, 661, 111, 384, 418, 3853, 618, 32786, 304, 363, 4527, 9393, 99710, 26518, 1...

[ 0.1337890625, 0.1268310546875, 0.11328125, 0.1785888671875, 0.0654296875, 0.06842041015625, 0.1212158203125, 0.010498046875, 0.054107666015625, 0.20361328125, 0.0906982421875, 0.0157318115234375, 0.178466796875, 0.08642578125, 0.18359375, 0.0440673828125, 0.00775146484375, 0.106567...

embed

65197507_c1

65197507

haskell

1

ghc.mk:973: install_packages] Error 1 make: *** [Makefile:51: install] Error 2 Received ExitFailure 2 when running Raw command: /usr/bin/make install Run from: /home/me/.stack/programs/x86_64-linux/ghc-tinfo6-8.10.2.temp/ghc-8.10.2/ Error: Error encountered while installing GHC with make install run in /home/me/.stack/...

[ -0.002899169921875, 0.00189971923828125, 0.02392578125, 0.01104736328125, -0.0004558563232421875, -0.0157470703125, -0.033203125, -0.0478515625, -0.00787353515625, 0.0576171875, 0.00921630859375, -0.0238037109375, 0.004180908203125, -0.00726318359375, -0.0137939453125, 0.011962890625, ...

[ 31380, 238, 19201, 201208, 20600, 29102, 52467, 212059, 106, 3249, 24428, 76978, 29822, 37374, 116, 93908, 14, 5443, 217, 17647, 379, 3408, 51042, 109997, 75101, 42, 64, 7568, 55898, 28398, 1295, 29552, 282, 5, 590, 2594, 18749, 7, 15276, ...

[ 0.15625, 0.17138671875, 0.140380859375, 0.269287109375, 0.2025146484375, 0.1439208984375, 0.017974853515625, 0.1839599609375, 0.065673828125, 0.1563720703125, 0.09356689453125, 0.0933837890625, 0.182861328125, 0.135009765625, 0.10498046875, 0.012969970703125, 0.002410888671875, 0.1...

embed

65859615_c0

65859615

haskell

0

Title: How to add command line parameters to a diagrams animation? Problem title: How to add command line parameters to a diagrams animation? Tags: haskell-diagrams, haskell Problem: How to add command line parameters to a diagrams animation? With "image" diagrams I can just pass a function that expects parameters (her...

How to add command line parameters to a diagrams animation? How to add command line parameters to a diagrams animation? haskell-diagrams haskell Diagrams.Prelude Diagrams.Backend.Cairo.CmdLine a How circle.png DiagramsWithParameters Double Diagram Diagrams.Backend.CmdLine.ToResult QDiagram Any How to add command line p...

[ -0.0152587890625, 0.00946044921875, -0.01385498046875, 0.01141357421875, -0.0152587890625, 0.0079345703125, 0.005279541015625, -0.001617431640625, -0.007049560546875, -0.0230712890625, -0.00286865234375, -0.00921630859375, 0.000492095947265625, 0.001434326171875, -0.0050048828125, -0.0...

[ 11249, 15190, 75101, 13315, 171859, 7, 47, 117233, 114205, 1556, 142508, 3390, 25561, 4512, 822, 8699, 54686, 93232, 42154, 133, 128468, 194583, 55292, 29089, 107172, 7763, 7136, 2396, 72838, 10, 17106, 37926, 27875, 32354, 41206, 177, 5201, ...

[ 0.068359375, 0.1658935546875, 0.2386474609375, 0.181396484375, 0.2509765625, 0.078369140625, 0.08563232421875, 0.249267578125, 0.2401123046875, 0.07598876953125, 0.1800537109375, 0.1392822265625, 0.182373046875, 0.146240234375, 0.0625, 0.117919921875, 0.0780029296875, 0.15368652343...

embed

14084574_c0

14084574

haskell

0

Title: Universal memoization in Haskell Problem title: Universal memoization in Haskell Tags: memoization, haskell Problem: Universal memoization in Haskell Possible Duplicate: When is memoization automatic in GHC Haskell? It looks like Haskell does not memoize all and every function by default - please note, I'm new t...

Universal memoization in Haskell Universal memoization in Haskell memoization haskell Universal Haskell Universal memoization in Haskell It looks like Haskell does not memoize all and every function by default - please note, I'm new to Haskell, so I might have that wrong, and I might be very naive about "universal memo...

[ 0.0025634765625, 0.0179443359375, 0.0264892578125, -0.0216064453125, 0.00128173828125, -0.0040283203125, 0.005950927734375, 0.007049560546875, 0.01007080078125, -0.022705078125, -0.003570556640625, -0.016845703125, 0.0157470703125, 0.0022430419921875, 0.00090789794921875, 0.01586914062...

[ 53900, 163, 432, 47691, 23, 20625, 142508, 1556, 33342, 14602, 959, 20650, 756, 11907, 32354, 114977, 3525, 44691, 13648, 4552, 24, 5844, 49545, 289, 9655, 28219, 2174, 3038, 831, 2499, 46876, 17366, 78, 127125, 51006, 22691, 193844, 37842, ...

[ 0.226806640625, 0.1544189453125, 0.197021484375, 0.1451416015625, 0.05242919921875, 0.16748046875, 0.267822265625, 0.1318359375, 0.0601806640625, 0.0701904296875, 0.1185302734375, 0.1539306640625, 0.1021728515625, 0.1331787109375, 0.2188720703125, 0.24169921875, 0.035125732421875, ...

embed

50195063_c0

50195063

haskell

0

Title: Timestamped values Problem title: Timestamped values Tags: haskell, newtype Problem: Timestamped values I wanted a type for timestamped values that had an appropriate Semigroup instance (latest value wins). It turns out that Max (Arg UTCTime a) does exactly what I want, but is really awkward to work with directl...

Timestamped values Timestamped values haskell newtype Data.Semigroup Data.Thyme Data.Thyme.Clock Timestamped Semigroup Max Arg UTCTime Stamped Show Functor Many TVar STM Timestamped values I wanted a type for timestamped values that had an appropriate Semigroup instance (latest value wins). It turns out that Max (Arg U...

[ -0.0218505859375, 0.01361083984375, 0.0164794921875, 0.0023345947265625, 0.01416015625, -0.00494384765625, -0.01251220703125, 0.007354736328125, 0.01043701171875, -0.0272216796875, 0.0108642578125, 0.0024871826171875, -0.005462646484375, -0.00653076171875, -0.000308990478515625, -0.001...

[ 19114, 2537, 20051, 142424, 1556, 142508, 3525, 50986, 11809, 266, 51588, 53, 282, 21135, 84420, 9920, 1172, 177, 99577, 70059, 159703, 297, 17367, 28670, 18770, 52455, 1910, 147, 10111, 36663, 10644, 20028, 95307, 110527, 143, 6954, 34292, 1...

[ 0.1142578125, 0.2086181640625, 0.133544921875, 0.20068359375, 0.09588623046875, 0.2259521484375, 0.06951904296875, 0.2313232421875, 0.0872802734375, 0.0662841796875, 0.1865234375, 0.00732421875, 0.074951171875, 0.1119384765625, 0.144287109375, 0.216064453125, 0.06146240234375, 0.02...

embed

75384937_c0

75384937

haskell

0

Title: Derive an optimized case-of expression from a function that takes a closed set as its input Problem title: Derive an optimized case-of expression from a function that takes a closed set as its input Tags: haskell Problem: Derive an optimized case-of expression from a function that takes a closed set as its input...

Derive an optimized case-of expression from a function that takes a closed set as its input Derive an optimized case-of expression from a function that takes a closed set as its input haskell a Derive Value Ord Show Derive an optimized case-of expression from a function that takes a closed set as its input I have a clo...

[ 0.0185546875, -0.00909423828125, 0.00823974609375, -0.006805419921875, 0.01446533203125, 0.002227783203125, 0.00171661376953125, -0.01483154296875, 0.0201416015625, -0.0272216796875, 0.001983642578125, 0.011962890625, 0.01214599609375, -0.00836181640625, 0.00286865234375, -0.0216064453...

[ 1310, 5844, 15572, 29367, 7225, 4390, 125195, 1295, 32354, 51776, 155738, 5423, 237, 107730, 1556, 142508, 190060, 35379, 17367, 6863, 142424, 2053, 45646, 33636, 12989, 3871, 96760, 3934, 360, 18, 5809, 1884, 76208, 27140, 2481, 180, 3444, 2...

[ 0.152099609375, 0.17626953125, 0.1778564453125, 0.1103515625, 0.1680908203125, 0.1634521484375, 0.2178955078125, 0.036224365234375, 0.175048828125, 0.047027587890625, 0.19677734375, 0.18359375, 0.0220489501953125, 0.1790771484375, 0.1131591796875, 0.2315673828125, 0.1854248046875, ...

embed

45777703_c0

45777703

haskell

0

Title: Turning on assertions while compiling with Haskell's stack build system Problem title: Turning on assertions while compiling with Haskell's stack build system Tags: haskell-stack, haskell Problem: Turning on assertions while compiling with Haskell's stack build system I am using Stack 9.0 as my Haskell...

Turning on assertions while compiling with Haskell's stack build system Turning on assertions while compiling with Haskell's stack build system haskell-stack haskell Control.Exception Control.Exception.Base Turning Haskell Hello World Version x86_64 hpack-0.14.0 Turning on assertions while compiling with Hask...

[ -0.004486083984375, 0.007476806640625, -0.0106201171875, 0.00592041015625, -0.001190185546875, 0.00116729736328125, -0.0040283203125, 0.0216064453125, -0.01806640625, 0.00958251953125, 0.0059814453125, 0.0020904541015625, -0.009521484375, 0.01519775390625, 0.017578125, 0.025390625, 0...

[ 4252, 98, 10, 16865, 5256, 12960, 9969, 49725, 678, 20625, 142508, 3768, 177261, 45367, 5426, 1556, 590, 2594, 27131, 63928, 63473, 35378, 6661, 40647, 15276, 13307, 1096, 29102, 102014, 151152, 17368, 6512, 3569, 2389, 13452, 156672, 1340, 7...

[ 0.116943359375, 0.188232421875, 0.10308837890625, 0.2347412109375, 0.1343994140625, 0.043548583984375, 0.1546630859375, 0.0889892578125, 0.0859375, 0.1143798828125, 0.1851806640625, 0.020477294921875, 0.1864013671875, 0.152587890625, 0.072021484375, 0.0748291015625, 0.0667724609375, ...

embed

35101844_c0

35101844

haskell

0

Title: Running `cabal repl` as a super-user (on Linux) Problem title: Running `cabal repl` as a super-user (on Linux) Tags: usb, sandbox, haskell, cabal Problem: Running `cabal repl` as a super-user (on Linux) The usb package is not on stackage and I created a cabal sandbox to play with it. Code like the package's exam...

Running `cabal repl` as a super-user (on Linux) Running `cabal repl` as a super-user (on Linux) usb sandbox haskell cabal Running Linux USB Permission Running `cabal repl` as a super-user (on Linux) The usb package is not on stackage and I created a cabal sandbox to play with it. Code like the package's example.hs is n...

[ -0.01324462890625, 0.008056640625, 0.01043701171875, 0.005950927734375, -0.0068359375, -0.00015544891357421875, 0.00494384765625, -0.0001163482666015625, -0.004974365234375, -0.007659912109375, 0.01275634765625, -0.0155029296875, -0.0034027099609375, 0.0118408203125, -0.005645751953125, ...

[ 28398, 408, 3571, 456, 2424, 237, 10, 1601, 9, 65918, 191, 29908, 1821, 275, 19096, 11728, 1556, 142508, 109524, 10273, 908, 21150, 98169, 959, 177261, 4588, 75935, 11301, 28864, 27781, 127, 20697, 75101, 11675, 89554, 3871, 57849, 48993, 1...

[ 0.1383056640625, 0.1199951171875, 0.2293701171875, 0.1488037109375, 0.253662109375, 0.079833984375, 0.0478515625, 0.184814453125, 0.030029296875, 0.2073974609375, 0.055419921875, 0.2015380859375, 0.06982421875, 0.0699462890625, 0.095458984375, 0.16845703125, 0.0850830078125, 0.1879...

embed

29164392_c0

29164392

haskell

0

Title: Is the signal system of Elm available as a Haskell library? Problem title: Is the signal system of Elm available as a Haskell library? Tags: haskell, frp, elm Problem: Is the signal system of Elm available as a Haskell library? For the task I'm working on, the signal system of the Elm programming language seems ...

Is the signal system of Elm available as a Haskell library? Is the signal system of Elm available as a Haskell library? haskell frp elm Elm Haskell Is the signal system of Elm available as a Haskell library? For the task I'm working on, the signal system of the Elm programming language seems to be an appropriate soluti...

[ 0.0019683837890625, 0.0191650390625, 0.007049560546875, 0.0128173828125, -0.0146484375, 0.0224609375, -0.01531982421875, 0.01129150390625, -0.000885009765625, -0.0164794921875, -0.01519775390625, -0.01708984375, 0.00799560546875, 0.03271484375, -0.001129150390625, -0.01416015625, 0.0...

[ 2071, 26073, 5426, 540, 39, 19882, 237, 20625, 142508, 35773, 1294, 70, 10, 1556, 14119, 254, 88, 111, 66211, 20697, 56037, 46876, 37202, 95307, 29806, 759, 34166, 181135, 43315, 32354, 29479, 23, 63769, 64549, 41382, 76228, 110, 43240, 188...

[ 0.034515380859375, 0.2462158203125, 0.1798095703125, 0.2059326171875, 0.216064453125, 0.160888671875, 0.099365234375, 0.1142578125, 0.2255859375, 0.2022705078125, 0.1458740234375, 0.022918701171875, 0.04315185546875, 0.0968017578125, 0.00616455078125, 0.046600341796875, 0.13391113281...

embed

42309713_c1

42309713

haskell

1

import qualified Data.Array.Repa as R import Data.Array.Repa(Z(..), (:.)(..), U, DIM2) array :: R.Array U DIM2 a array = -- ... mappedArray = R.traverse array id (\i (Z :. x :. y) -> unsafePerformIO $ foo x y (i (Z :. x :. y))) result = R.computeP mappedArray Note that R.traverse is not Data.Traversable(traverse) . As...

[ -0.01611328125, 0.021484375, -0.0201416015625, 0.0076904296875, 0.00183868408203125, 0.0086669921875, 0.0050048828125, -0.01953125, 0.0128173828125, -0.050048828125, 0.01068115234375, 0.01202392578125, 0.0091552734375, 0.00885009765625, -0.00061798095703125, 0.004974365234375, -0.014...

[ 24927, 217225, 11809, 7614, 7092, 4332, 763, 237, 627, 1511, 345, 175546, 10461, 10298, 53, 304, 291, 48398, 1517, 37676, 3447, 113, 51, 115840, 15277, 5037, 17780, 3650, 5775, 1022, 16750, 58875, 6743, 683, 959, 28542, 7864, 2886, 33742, ...

[ 0.1754150390625, 0.206787109375, 0.1317138671875, 0.1197509765625, 0.181396484375, 0.173583984375, 0.2213134765625, 0.030059814453125, 0.16455078125, 0.0765380859375, 0.0787353515625, 0.138671875, 0.0963134765625, 0.1226806640625, 0.047882080078125, 0.121826171875, 0.07489013671875, ...

embed

9509350_c0

9509350

haskell

0

Title: What's preferred among liftM, lilftA, etc Problem title: What's preferred among liftM, lilftA, etc Tags: haskell Problem: What's preferred among liftM, lilftA, etc Lately I've been writing FFI code that returns a data structure in the IO monad. For example: peek p = Vec3 <$> (#peek aiVector3D, x) p <*>...

What's preferred among liftM, lilftA, etc What's preferred among liftM, lilftA, etc haskell What Vec3 aiVector3D io1 io2 io3 liftA3 liftM3 Applicative Monad liftA..liftA3 liftM..liftM5 What's preferred among liftM, lilftA, etc Lately I've been writing FFI code that returns a data structure in the IO monad. Fo...

[ -0.01129150390625, 0.01544189453125, -0.01190185546875, 0.01129150390625, 0.0130615234375, 0.004241943359375, -0.00518798828125, 0.000583648681640625, 0.0091552734375, -0.0206298828125, 0.013916015625, -0.0269775390625, 0.00927734375, 0.00909423828125, -0.01251220703125, -0.00369262695...

[ 3768, 12601, 2822, 54940, 60520, 594, 96, 379, 2480, 284, 1556, 142508, 4865, 52884, 363, 1300, 26455, 18770, 397, 22995, 5659, 11048, 4935, 60331, 71, 104501, 758, 32562, 563, 22724, 18151, 30646, 2053, 45646, 17780, 2667, 712, 831, 5351, ...

[ 0.053009033203125, 0.162109375, 0.12158203125, 0.13134765625, 0.2366943359375, 0.2130126953125, 0.034942626953125, 0.0843505859375, 0.1463623046875, 0.1669921875, 0.116455078125, 0.23974609375, 0.019287109375, 0.1351318359375, 0.1185302734375, 0.0938720703125, 0.13916015625, 0.1208...

embed

57580913_c1

57580913

haskell

1

2.3.3) haskell-src-exts-1.20.3 from stack configuration does not match <1.20 && >=1.18 (latest matching version is 1.19.1) hlint-2.1.11 from stack configuration does not match <2.1 && >=2.0.8 (latest matching version is 2.0.15) monad-journal-0.8.1 from stack configuration does not match <0.8 && >=0.4 (latest matching v...

[ -0.018310546875, 0.01556396484375, 0.026611328125, -0.003875732421875, 0.019775390625, 0.007049560546875, -0.0361328125, -0.0062255859375, -0.005584716796875, 0.03955078125, -0.00156402587890625, -0.042236328125, 0.02001953125, 0.01336669921875, 0.01275634765625, 0.018310546875, 0.01...

[ 59811, 21320, 1556, 142508, 19437, 3355, 933, 48400, 170179, 1295, 177261, 180346, 959, 14858, 1549, 1819, 11389, 2947, 75084, 4288, 68107, 1662, 132208, 16655, 62155, 2667, 712, 188131, 206730, 121254, 43922, 2500, 9007, 11048, 4935, 2592, 132...

[ 0.164794921875, 0.1182861328125, 0.1240234375, 0.2479248046875, 0.1654052734375, 0.0947265625, 0.1424560546875, 0.087158203125, 0.1790771484375, 0.01239013671875, 0.1627197265625, 0.1768798828125, 0.080322265625, 0.2069091796875, 0.1099853515625, 0.10064697265625, 0.1195068359375, ...

embed

51736130_c0

51736130

haskell

0

Title: A function for returning part of a product or record depending on parameter and requested return type Problem title: A function for returning part of a product or record depending on parameter and requested return type Tags: haskell, scrap-your-boilerplate, generic-programming Problem: A function for returning p...

A function for returning part of a product or record depending on parameter and requested return type A function for returning part of a product or record depending on parameter and requested return type haskell scrap-your-boilerplate generic-programming MyProduct Bool Boolean Double AnotherProduct Maybe Char Nothing G...

[ -0.00762939453125, -0.00115203857421875, 0.002593994140625, 0.006683349609375, -0.0103759765625, 0.00909423828125, -0.021240234375, -0.0162353515625, 0.0062255859375, -0.0037841796875, 0.005889892578125, -0.0130615234375, -0.02783203125, -0.00180816650390625, 0.0040283203125, -0.012451...

[ 62, 32354, 100, 30646, 214, 2831, 12996, 707, 17164, 96819, 171859, 50336, 297, 10644, 8, 1556, 142508, 120948, 154176, 34759, 92558, 189534, 28966, 2646, 10752, 77193, 2460, 929, 73783, 34677, 107172, 116267, 83425, 21656, 182747, 88342, 136, ...

[ 0.0679931640625, 0.23486328125, 0.0472412109375, 0.248046875, 0.09332275390625, 0.1494140625, 0.2371826171875, 0.0265045166015625, 0.1761474609375, 0.169921875, 0.2027587890625, 0.1776123046875, 0.04095458984375, 0.2032470703125, 0.013916015625, 0.1419677734375, 0.2529296875, 0.141...

embed

28500006_c0

28500006

haskell

0

Title: How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? Problem title: How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? Tags: adhoc-polymorphism, haskell, io, output, string Problem: How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? I use encode (Haskell type via JSON to a string):...

How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? How do I putStrLn a Data.ByteString.Lazy.Internal.ByteString? adhoc-polymorphism haskell io output string GHC.Generics Data.Aeson How Data.ByteString.Lazy.Internal.ByteString valencies.lhs:182:22 Couldn Char Expected Actual CALL How do I putStrLn a Data.Byte...

[ 0.00848388671875, 0.01324462890625, -0.005828857421875, 0.00286865234375, 0.0054931640625, 0.0220947265625, 0.01141357421875, -0.0198974609375, -0.0159912109375, -0.00872802734375, 0.002105712890625, -0.0230712890625, 0.0159912109375, 0.001617431640625, -0.00634765625, -0.0058898925781...

[ 11249, 54, 87, 3884, 71713, 866, 19, 11809, 75358, 67, 214, 2729, 3285, 44851, 6236, 606, 497, 238, 135545, 178851, 8780, 1556, 142508, 22995, 140992, 79315, 527, 73265, 135932, 191, 17159, 117538, 24070, 191147, 21656, 60075, 13, 89829, 10...

[ 0.0802001953125, 0.027587890625, 0.034088134765625, 0.2255859375, 0.2113037109375, 0.1397705078125, 0.1461181640625, 0.131103515625, 0.054931640625, 0.093994140625, 0.10052490234375, 0.1357421875, 0.17919921875, 0.1358642578125, 0.119873046875, 0.08856201171875, 0.11669921875, 0.08...

embed

29188217_c1

29188217

haskell

1

= do card <- drawCard "Bob" liftIO $ print card getPlayer :: PlayerHandle -> Lens' GameState Player getPlayer handle f st = fmap put' get' where players = st^.gamePlayers put' player = let g p = case p^.playerHandle == handle of True -> player False -> p in set gamePlayers (map g players) st get' = f $ fromJust $ find...

[ -0.02880859375, 0.0034942626953125, -0.001007080078125, -0.017578125, 0.005767822265625, 0.00970458984375, -0.0142822265625, -0.021484375, 0.01007080078125, -0.0172119140625, 0.0252685546875, 0.026611328125, -0.00830078125, 0.000576019287109375, -0.00848388671875, -0.01544189453125, ...

[ 2203, 54, 20596, 79442, 156119, 571, 3522, 60520, 17780, 28412, 2046, 142581, 60560, 135679, 133, 18226, 7, 13547, 135206, 34831, 1238, 6138, 62346, 3884, 92865, 58585, 2633, 706, 915, 7225, 139570, 69112, 87599, 22225, 5423, 6712, 1295, 1277...

[ 0.062042236328125, 0.08624267578125, 0.227783203125, 0.202392578125, 0.269775390625, 0.0889892578125, 0.1505126953125, 0.191162109375, 0.164794921875, 0.16162109375, 0.0987548828125, 0.1951904296875, 0.1650390625, 0.1549072265625, 0.08056640625, 0.1585693359375, 0.01165771484375, 0...

embed

7394433_c0

7394433

haskell

0

Title: Yesod application source in a sub directory Problem title: Yesod application source in a sub directory Tags: haskell, yesod Problem: Yesod application source in a sub directory I generated a Yesod stub website using yesod init and was able to run yesod devel for testing. However, I usually put the actual haskell...

Yesod application source in a sub directory Yesod application source in a sub directory haskell yesod Yesod Model.hs:12:57 Exception Yesod application source in a sub directory I generated a Yesod stub website using yesod init and was able to run yesod devel for testing. However, I usually put the actual haskell source...

[ -0.00421142578125, 0.0162353515625, -0.0045166015625, 0.0023040771484375, -0.01483154296875, 0.01104736328125, -0.017333984375, 0.0038909912109375, -0.01007080078125, -0.057373046875, -0.0107421875, -0.019287109375, -0.002960205078125, 0.01068115234375, 0.0184326171875, -0.011840820312...

[ 32635, 2199, 38415, 31344, 23, 1614, 14364, 1556, 142508, 2422, 23722, 13293, 127, 20927, 35315, 5443, 63928, 53, 139392, 136057, 4165, 217, 8, 2601, 134234, 56104, 3884, 8561, 97264, 80581, 30675, 19437, 5201, 13452, 17366, 35064, 95322, 408...

[ 0.1939697265625, 0.284423828125, 0.1614990234375, 0.2198486328125, 0.0303192138671875, 0.2108154296875, 0.154052734375, 0.118896484375, 0.2174072265625, 0.132080078125, 0.23388671875, 0.158447265625, 0.05389404296875, 0.0303955078125, 0.09161376953125, 0.025909423828125, 0.0998535156...

embed

4512541_c0

4512541

haskell

0

Title: Translate imperative control flow with break-s/continue-s to haskell Problem title: Translate imperative control flow with break-s/continue-s to haskell Tags: imperative-programming, haskell, functional-programming Problem: Translate imperative control flow with break-s/continue-s to haskell Consider the followi...

Translate imperative control flow with break-s/continue-s to haskell Translate imperative control flow with break-s/continue-s to haskell imperative-programming haskell functional-programming Translate i-1 j-1 Translate imperative control flow with break-s/continue-s to haskell Consider the following imperative code wh...

[ -0.00970458984375, -0.0078125, -0.00994873046875, 0.004058837890625, 0.0010986328125, 0.0283203125, 0.0042724609375, -0.01092529296875, 0.003509521484375, -0.0228271484375, 0.0206298828125, 0.00592041015625, -0.018310546875, -0.004791259765625, 0.01361083984375, -0.0028533935546875, ...

[ 11062, 19309, 222530, 13, 6226, 86608, 678, 36356, 7, 133891, 47, 1556, 142508, 9, 28966, 123309, 17, 5759, 1647, 137399, 25632, 18151, 7413, 142105, 17923, 19, 102851, 54940, 38742, 5691, 4803, 101935, 5117, 66211, 223353, 144057, 47148, 337...

[ 0.1263427734375, 0.1968994140625, 0.2449951171875, 0.0467529296875, 0.216796875, 0.2254638671875, 0.014251708984375, 0.1798095703125, 0.1495361328125, 0.1697998046875, 0.1365966796875, 0.138427734375, 0.22900390625, 0.0211944580078125, 0.10205078125, 0.12744140625, 0.03240966796875, ...

embed

76871648_c0

76871648

haskell

0

Title: Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? Problem title: Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? Tags: haskell, http, ihp Problem: Is there an alternative to createTemporaryDownlo...

Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? Is there an alternative to createTemporaryDownloadUrl that doesn't require file storage on the server? haskell http ihp file Is there an alternative to createTemporaryDownloadUrl that doesn't require file st...

[ -0.00250244140625, 0.0228271484375, 0.018798828125, 0.0157470703125, 0.01416015625, -0.0128173828125, -0.0303955078125, -0.0181884765625, 0.003326416015625, 0.00048828125, -0.024169921875, -0.00482177734375, 0.0130615234375, 0.0198974609375, 0.0166015625, 0.018310546875, 0.0228271484...

[ 2071, 30700, 28282, 159065, 748, 6635, 144786, 48743, 141, 22027, 3768, 18, 64209, 11435, 132096, 10723, 98, 1556, 142508, 1621, 9633, 254, 2685, 142, 47, 450, 31577, 31255, 79315, 237, 20763, 334, 38937, 19048, 7026, 87, 36599, 32354, 5177...

[ 0.016357421875, 0.1920166015625, 0.1795654296875, 0.1649169921875, 0.15771484375, 0.1422119140625, 0.1888427734375, 0.156494140625, 0.1495361328125, 0.0982666015625, 0.0300140380859375, 0.1251220703125, 0.1494140625, 0.1478271484375, 0.2071533203125, 0.15771484375, 0.059173583984375,...

embed

32916738_c1

32916738

haskell

1

t AppState coreOfTheApp = accumB (AppState 0) events sink output [text :== show <$> coreOfTheApp] sink output2 [text :== show <$> reactimate ( getAnotherRemoteApiValue <@> coreOfTheApp)] network <- compile networkDescription actuate network As you can see what I am trying to do it is using the new state of the applica...

[ -0.0177001953125, 0.0135498046875, -0.00543212890625, 0.00927734375, -0.007415771484375, 0.008544921875, 0.00122833251953125, 0.017822265625, -0.00445556640625, -0.044921875, 0.0128173828125, 0.007110595703125, -0.006561279296875, 0.050537109375, 0.0128173828125, -0.010009765625, 0.0...

[ 808, 5659, 135206, 13, 56458, 132887, 3957, 39179, 2203, 61689, 39, 571, 757, 47353, 880, 92, 140992, 7639, 304, 131300, 1352, 67, 2046, 126340, 432, 1434, 856, 50770, 33120, 9969, 1340, 59478, 103694, 31577, 17368, 3525, 11341, 38415, 4332...

[ 0.1126708984375, 0.1983642578125, 0.221435546875, 0.0928955078125, 0.2012939453125, 0.2130126953125, 0.1336669921875, 0.2083740234375, 0.0072021484375, 0.0809326171875, 0.045654296875, 0.083740234375, 0.119140625, 0.170166015625, 0.165283203125, 0.09613037109375, 0.193115234375, 0....

embed

76910027_c1

76910027

haskell

1

Semigroup (f MyType) where (<>) = bzipWith (<>) instance ApplicativeB f => Monoid (f MyType) where mempty = bpure mempty But this only works if MyType a is a monoid for ALL a . Edit: Workaround Changing the Semigroup definition to the following: semigroupOp :: forall c t. (forall b. c b => Semigroup b) => SomeMaybe c ...

[ -0.00543212890625, -0.0025634765625, 0.004302978515625, 0.0064697265625, -0.01397705078125, 0.0238037109375, 0.007171630859375, -0.007415771484375, 0.01708984375, 0.0035247802734375, -0.0087890625, 0.032470703125, 0.006988525390625, 0.00335693359375, -0.01300048828125, -0.0039367675781...

[ 84420, 51588, 420, 2646, 196707, 2740, 50836, 194583, 110527, 5659, 11048, 4935, 571, 1238, 77879, 532, 163, 2676, 939, 3408, 903, 4734, 43240, 2174, 10, 22460, 100, 58837, 27985, 67688, 108193, 80934, 25632, 36137, 39029, 5584, 808, 31384, ...

[ 0.263671875, 0.290771484375, 0.060028076171875, 0.17822265625, 0.309326171875, 0.0745849609375, 0.143798828125, 0.11279296875, 0.1669921875, 0.09619140625, 0.13525390625, 0.077880859375, 0.051666259765625, 0.10125732421875, 0.1632080078125, 0.159423828125, 0.0198516845703125, 0.049...

embed

78531783_c0

78531783

haskell

0

Title: Why pruning of game tree needed in lazy language Problem title: Why pruning of game tree needed in lazy language Tags: minimax, haskell, lazy-evaluation Problem: Why pruning of game tree needed in lazy language So I was reading the book Programming in Haskell by Graham Hutton. In chapter 11, the game tic-tac-toe...

Why pruning of game tree needed in lazy language Why pruning of game tree needed in lazy language minimax haskell lazy-evaluation Why Tree Node n-1 Why pruning of game tree needed in lazy language So I was reading the book Programming in Haskell by Graham Hutton. In chapter 11, the game tic-tac-toe is implemented. My q...

[ 0.0084228515625, 0.0211181640625, 0.01214599609375, 0.0098876953125, 0.0228271484375, 0.01361083984375, -0.0037994384765625, -0.01226806640625, 0.002105712890625, -0.0208740234375, -0.0133056640625, -0.0027313232421875, 0.008056640625, -0.003326416015625, 0.000957489013671875, 0.003463...

[ 44084, 25230, 592, 6712, 53201, 44841, 21, 3285, 46876, 83818, 425, 1556, 142508, 159258, 101344, 438, 112, 5759, 16454, 12877, 27958, 20625, 147756, 1507, 534, 96212, 102, 238, 51890, 29479, 38730, 2831, 11814, 55681, 86, 32354, 3871, 6044, ...

[ 0.10418701171875, 0.2052001953125, 0.116943359375, 0.1356201171875, 0.23681640625, 0.135009765625, 0.0931396484375, 0.1546630859375, 0.143310546875, 0.1695556640625, 0.130859375, 0.08056640625, 0.2210693359375, 0.0985107421875, 0.17236328125, 0.1080322265625, 0.0830078125, 0.064392...

embed

29905159_c1

29905159

haskell

1

it and help GHC out. So far, I've got this: import Data.Constraint weakenAnd1 :: ((a :&: b) c) :- a c weakenAnd1 = Sub Dict -- not the Dict from vinyl. ekmett's Dict. weakenAnd2 :: ((a :&: b) c) :- b c weakenAnd2 = Sub Dict These work fine. But this is where I am stuck: -- The two Proxy args are to stop GHC from compl...

[ -0.0022735595703125, -0.0107421875, 0.01348876953125, 0.0186767578125, 0.0224609375, 0.0010528564453125, -0.039306640625, 0.013671875, 0.0177001953125, 0.01416015625, 0.00136566162109375, -0.00171661376953125, 0.003204345703125, 0.0289306640625, 0.01043701171875, -0.003570556640625, ...

[ 442, 4358, 527, 73265, 1810, 2060, 4163, 903, 24927, 11809, 11935, 2816, 4288, 642, 344, 33, 37839, 418, 1230, 10, 501, 8273, 60897, 18, 959, 193289, 1928, 304, 4488, 5885, 179933, 6626, 1250, 50878, 79459, 7279, 1295, 186992, 10250, 1228...

[ 0.099365234375, 0.0697021484375, 0.079345703125, 0.182861328125, 0.0233306884765625, 0.04827880859375, 0.020965576171875, 0.004180908203125, 0.2110595703125, 0.1324462890625, 0.064208984375, 0.1749267578125, 0.149169921875, 0.14013671875, 0.16455078125, 0.1148681640625, 0.15234375, ...

embed

58225776_c0

58225776

haskell

0

Title: Understanding simple functions applied to graphs Problem title: Understanding simple functions applied to graphs Tags: graph, functional-programming, haskell Problem: Understanding simple functions applied to graphs I have a question about how to manipulate a function in Haskell. I have this graph: import Data.M...

Understanding simple functions applied to graphs Understanding simple functions applied to graphs graph functional-programming haskell Data.Map Graphviz Understanding Map Graph Show Ord Adds Understanding simple functions applied to graphs I have a question about how to manipulate a function in Haskell. I have this gra...

[ -0.01373291015625, 0.0233154296875, -0.0118408203125, 0.0155029296875, -0.013916015625, -0.00421142578125, -0.0091552734375, 0.01165771484375, 0.01129150390625, -0.034912109375, 0.0172119140625, -0.01904296875, 0.0093994140625, 0.0380859375, -0.000621795654296875, -0.004913330078125, ...

[ 9626, 144057, 8781, 32354, 190659, 47, 41382, 7, 123309, 28966, 1556, 142508, 11809, 166179, 6524, 11727, 22572, 42719, 17367, 35379, 29117, 9655, 3642, 45258, 67, 20625, 765, 903, 8382, 2967, 9790, 25379, 756, 95378, 5170, 5303, 15190, 15896...

[ 0.1156005859375, 0.0946044921875, 0.1885986328125, 0.2191162109375, 0.1353759765625, 0.0616455078125, 0.2213134765625, 0.039581298828125, 0.1444091796875, 0.082275390625, 0.114990234375, 0.2427978515625, 0.05584716796875, 0.130615234375, 0.1541748046875, 0.133056640625, 0.16821289062...

embed

10946167_c0

10946167

haskell

0

Title: Handling nested variable scopes when implementing an interpreter Problem title: Handling nested variable scopes when implementing an interpreter Tags: interpreter, haskell Problem: Handling nested variable scopes when implementing an interpreter I'm currently writing an interpreter for a simple programming langu...

Handling nested variable scopes when implementing an interpreter Handling nested variable scopes when implementing an interpreter interpreter haskell Handling Env Handling nested variable scopes when implementing an interpreter I'm currently writing an interpreter for a simple programming language and just wanted to as...

[ -0.00445556640625, 0.005096435546875, 0.0029144287109375, 0.0311279296875, 0.005401611328125, 0.018310546875, 0.00836181640625, 0.0169677734375, -0.00078582763671875, -0.022216796875, 0.01507568359375, 0.00750732421875, -0.02001953125, -0.0103759765625, 0.00848388671875, 0.002914428710...

[ 193237, 8512, 71, 77336, 44679, 90, 29479, 29481, 56, 1556, 142508, 357, 334, 32562, 8781, 56037, 46876, 2965, 51515, 36461, 133, 442, 65998, 1528, 18151, 6713, 2037, 136, 28350, 179933, 35142, 70820, 12638, 9842, 46389, 27781, 5117, 14, 17...

[ 0.22265625, 0.259765625, 0.1187744140625, 0.263916015625, 0.18115234375, 0.098388671875, 0.169189453125, 0.221435546875, 0.141357421875, 0.1474609375, 0.2174072265625, 0.103271484375, 0.209228515625, 0.01043701171875, 0.0477294921875, 0.043670654296875, 0.0692138671875, 0.034118652...

embed

28535481_c0

28535481

haskell

0

Title: Writing Parser for JSON String Problem title: Writing Parser for JSON String Tags: parsing, monads, haskell Problem: Writing Parser for JSON String As part of trying to write a JSON Parser, I'm working on parsing a JSON String value. Given the following definition from Prof. Brent Yorgey's Haskell course : -- A ...

Writing Parser for JSON String Writing Parser for JSON String parsing monads haskell Writing Parser JSON Maybe JValue Char Nothing x:xs Just Writing Parser for JSON String As part of trying to write a JSON Parser, I'm working on parsing a JSON String value. Given the following definition from Prof. Brent Yorgey's Haske...

[ -0.0169677734375, 0.026611328125, -0.013916015625, 0.021728515625, -0.0242919921875, 0.022216796875, -0.0019073486328125, -0.01953125, -0.01361083984375, 0.01513671875, -0.0093994140625, 0.0167236328125, -0.006744384765625, -0.0027923583984375, 0.005950927734375, 0.0247802734375, -0....

[ 213185, 2392, 2189, 100, 821, 58627, 23351, 214, 366, 6953, 2667, 712, 7, 1556, 142508, 83425, 856, 50770, 21656, 182747, 1022, 12, 425, 33022, 20697, 34292, 80934, 192050, 27616, 53, 20625, 15411, 51042, 3934, 63134, 17932, 45234, 19060, 1...

[ 0.1710205078125, 0.1605224609375, 0.221435546875, 0.0770263671875, 0.14892578125, 0.2266845703125, 0.1798095703125, 0.08111572265625, 0.1630859375, 0.0394287109375, 0.0758056640625, 0.11328125, 0.05889892578125, 0.1134033203125, 0.2139892578125, 0.0362548828125, 0.1259765625, 0.152...

embed

29830391_c0

29830391

haskell

0

Title: do..while(0) function-like C macro wrapper in c2hs Problem title: do..while(0) function-like C macro wrapper in c2hs Tags: petsc, haskell, c2hs, c, c-preprocessor Problem: do..while(0) function-like C macro wrapper in c2hs I'd like to wrap a function-like C macro in a C function (and in turn wrap it in Haskell w...

do..while(0) function-like C macro wrapper in c2hs do..while(0) function-like C macro wrapper in c2hs petsc haskell c2hs c c-preprocessor PetscError do..while c2hs TestMacro TestF1 c_testF1 TestMacro.chs TestMacro.chs.h:6 ERROR Syntax CHKERRQ petscerror.h PetscUnlikely PETSC_COMM_SELF __LINE__ PETSC_FUNCTION_NAME __FIL...

[ 0.00118255615234375, 0.0189208984375, -0.01397705078125, -0.01171875, 0.01251220703125, 0.0201416015625, -0.0062255859375, -0.0174560546875, 0.0021820068359375, -0.004638671875, -0.0262451171875, -0.0062255859375, -0.033203125, -0.019775390625, 0.023193359375, -0.006500244140625, -0....

[ 54, 204610, 177609, 32354, 5062, 313, 111789, 137565, 1264, 501, 304, 127, 23, 8093, 10382, 1556, 142508, 4692, 63923, 26516, 18468, 31611, 5, 8647, 55450, 6954, 910, 151206, 19010, 14045, 34324, 1052, 2737, 188800, 14256, 82914, 14495, 16113...

[ 0.07891845703125, 0.26318359375, 0.2218017578125, 0.134765625, 0.2115478515625, 0.150634765625, 0.1962890625, 0.176513671875, 0.108154296875, 0.03924560546875, 0.119384765625, 0.144775390625, 0.0201568603515625, 0.16064453125, 0.1146240234375, 0.04962158203125, 0.2222900390625, 0.0...

embed

55123697_c0

55123697

haskell

0

Title: Haskell - find path to value of nodes Problem title: Haskell - find path to value of nodes Tags: tree, nodes, haskell Problem: Haskell - find path to value of nodes The question for this problem is: Tree holds data of type a. Function findpath which given a function f, some data x and a tree t, returns the lists...

Haskell - find path to value of nodes Haskell - find path to value of nodes tree nodes haskell Haskell Btree Data Branch Show Dir Path tree1 tree2 tree3 Throws Haskell - find path to value of nodes The question for this problem is: Declared structure of data types used in this problem: My attempt to solve this function...

[ 0.0047607421875, 0.0133056640625, 0.00341796875, -0.01025390625, 0.00555419921875, 0.028076171875, 0.00067901611328125, -0.00836181640625, -0.00341796875, -0.018798828125, -0.004730224609375, -0.0081787109375, -0.00138092041015625, -0.0021820068359375, 0.009765625, 0.008056640625, 0....

[ 20625, 142508, 7413, 60875, 47, 34292, 111, 110, 988, 53201, 1556, 62600, 11809, 21110, 17367, 19946, 108421, 363, 15555, 9655, 2967, 25755, 320, 297, 45646, 2053, 52895, 11814, 81887, 86869, 32354, 134234, 11782, 3034, 140992, 76199, 4358, 1...

[ 0.1395263671875, 0.2310791015625, 0.150390625, 0.2381591796875, 0.167236328125, 0.21240234375, 0.06390380859375, 0.1383056640625, 0.134521484375, 0.1380615234375, 0.1160888671875, 0.1966552734375, 0.055999755859375, 0.007568359375, 0.086669921875, 0.067626953125, 0.1729736328125, 0...

embed

13193346_c0

13193346

haskell

0

Title: Generate more evenly distributed random sequence Problem title: Generate more evenly distributed random sequence Tags: haskell, random Problem: Generate more evenly distributed random sequence I have read this question and thought that this algorithm is not optimal. For example, 'f 20 100' returns lists like [85...

Generate more evenly distributed random sequence Generate more evenly distributed random sequence haskell random Generate Couldn Generate more evenly distributed random sequence I have read this question and thought that this algorithm is not optimal. For example, 'f 20 100' returns lists like [85,14,1,0,0,0,0,0,0,0,0,...

[ 0.00092315673828125, 0.018798828125, 0.003387451171875, -0.032470703125, 0.0013427734375, 0.004150390625, 0.0019989013671875, -0.01025390625, 0.0023651123046875, -0.0286865234375, 0.00799560546875, 0.0174560546875, -0.00016498565673828125, 0.01324462890625, 0.015380859375, 0.0053710937...

[ 155370, 67, 1286, 3853, 538, 15917, 3674, 96759, 40, 944, 3956, 1556, 142508, 191147, 19, 12301, 17569, 903, 234873, 959, 24087, 27781, 420, 387, 805, 30646, 5303, 1884, 12951, 2592, 206808, 63527, 87, 195409, 4989, 45234, 46741, 16750, 490...

[ 0.198974609375, 0.0965576171875, 0.17822265625, 0.2069091796875, 0.1387939453125, 0.212158203125, 0.04766845703125, 0.2132568359375, 0.0684814453125, 0.1295166015625, 0.0267333984375, 0.17236328125, 0.234375, 0.126953125, 0.0938720703125, 0.00244140625, 0.040191650390625, 0.0256500...

embed

7479948_c0

7479948

haskell

0

Title: Equivalent of Haskell do-notation or F# Computation Expressions in Scala? Problem title: Equivalent of Haskell do-notation or F# Computation Expressions in Scala? Tags: do-notation, monads, scala, haskell, f%23 Problem: Equivalent of Haskell do-notation or F# Computation Expressions in Scala? F# Computation Expr...

Equivalent of Haskell do-notation or F# Computation Expressions in Scala? Equivalent of Haskell do-notation or F# Computation Expressions in Scala? do-notation monads scala haskell f%23 Equivalent Haskell Computation Expressions Scala Future f.get Copy ReadMode WriteMode Done Equivalent of Haskell do-notation or F# Com...

[ -0.0098876953125, 0.01409912109375, 0.00225830078125, 0.00482177734375, -0.0036163330078125, -0.003265380859375, 0.00543212890625, -0.004425048828125, -0.01068115234375, -0.03369140625, -0.0004405975341796875, -0.0118408203125, -0.00127410888671875, 0.0015106201171875, 0.0086669921875, ...

[ 145666, 85540, 111, 20625, 142508, 54, 157, 22062, 563, 4904, 159415, 25129, 17514, 23, 152653, 11, 707, 2667, 712, 7, 146232, 1556, 1238, 3949, 3742, 94724, 3794, 146930, 4764, 9083, 601, 18781, 984, 63769, 1274, 27140, 18403, 6002, 86531,...

[ 0.07757568359375, 0.124267578125, 0.0202484130859375, 0.131103515625, 0.2384033203125, 0.146728515625, 0.1492919921875, 0.077880859375, 0.1304931640625, 0.1968994140625, 0.1768798828125, 0.16162109375, 0.0682373046875, 0.03851318359375, 0.218017578125, 0.1763916015625, 0.003051757812...

embed

8534006_c0

8534006

haskell

0

Title: Type class definition with functions depending on an additional type Problem title: Type class definition with functions depending on an additional type Tags: typeclass, haskell Problem: Type class definition with functions depending on an additional type Still new to Haskell, I have hit a wall with the followin...

Type class definition with functions depending on an additional type Type class definition with functions depending on an additional type typeclass haskell Type Num MixedRing Could Fractional Wrap Type class definition with functions depending on an additional type Still new to Haskell, I have hit a wall with the follo...

[ -0.00775146484375, 0.035400390625, 0.006805419921875, 0.006439208984375, -0.012939453125, 0.00154876708984375, -0.019287109375, -0.005889892578125, 0.00689697265625, 0.000514984130859375, -0.0302734375, 0.00052642822265625, 0.005859375, -0.0012359619140625, -0.0234375, -0.0009613037109...

[ 60457, 18507, 80934, 678, 32354, 96819, 78301, 10644, 67413, 1556, 142508, 52782, 37286, 297, 1052, 214, 191147, 7868, 10763, 13631, 3525, 20625, 5962, 58982, 61924, 61112, 4537, 115497, 39209, 27169, 86869, 192617, 76519, 13722, 5426, 10, 8085...

[ 0.25390625, 0.257080078125, 0.16259765625, 0.0838623046875, 0.1778564453125, 0.131103515625, 0.131103515625, 0.220947265625, 0.202880859375, 0.10205078125, 0.1898193359375, 0.148193359375, 0.13818359375, 0.012176513671875, 0.0726318359375, 0.0635986328125, 0.047271728515625, 0.1475...

embed

1937102_c0

1937102

haskell

0

Title: Is it possible to test the return value of Haskell I/O functions? Problem title: Is it possible to test the return value of Haskell I/O functions? Tags: functional-programming, haskell, unit-testing Problem: Is it possible to test the return value of Haskell I/O functions? Haskell is a pure functional language, ...

Is it possible to test the return value of Haskell I/O functions? Is it possible to test the return value of Haskell I/O functions? functional-programming haskell unit-testing Haskell Hello Is it possible to test the return value of Haskell I/O functions? Haskell is a pure functional language, which means Haskell funct...

[ -0.0172119140625, 0.01123046875, 0.00897216796875, 0.0257568359375, 0.004638671875, 0.0025482177734375, 0.006103515625, -0.03173828125, -0.019775390625, 0.009033203125, 0.006378173828125, -0.0211181640625, -0.011962890625, -0.006744384765625, 0.0002841949462890625, -0.0023345947265625,...

[ 2071, 7722, 3034, 30646, 34292, 20625, 142508, 87, 64, 670, 32354, 47, 123309, 28966, 1556, 25072, 6954, 35378, 442, 70, 34166, 46876, 110, 5609, 52490, 29479, 17368, 2667, 712, 33636, 7839, 181135, 8781, 127, 13817, 8999, 1528, 28282, 182,...

[ 0.0194091796875, 0.1884765625, 0.260009765625, 0.260498046875, 0.2181396484375, 0.1513671875, 0.273193359375, 0.104248046875, 0.2340087890625, 0.204345703125, 0.2130126953125, 0.058837890625, 0.148681640625, 0.057952880859375, 0.097412109375, 0.1282958984375, 0.141845703125, 0.0955...

embed

20038899_c1

20038899

haskell

1

eval val f) && (eval val g) eval val (Imp f g) = eval val (Or (Not f) g) valuations :: [Variable] -> [Valuation] valuations [] = [[]] valuations (v:vs) = map ((v,True):) ds ++ map ((v,False):) ds where ds = valuations vs I now have to write a models function and I worked out that the typeline has to be models :: Prop -...

[ -0.012451171875, 0.003662109375, -0.00494384765625, -0.00555419921875, -0.005462646484375, 0.0244140625, -0.0052490234375, 0.0032806396484375, 0.01214599609375, -0.03515625, 0.00014972686767578125, -0.00135040283203125, 0.01043701171875, 0.001495361328125, 0.0028076171875, 0.0092163085...

[ 28, 1405, 3502, 1238, 619, 1230, 13, 706, 128878, 2203, 19060, 122116, 55932, 21094, 81827, 2886, 42272, 334, 18043, 22288, 882, 104, 37223, 17647, 20209, 33022, 115774, 32354, 10644, 2256, 1556, 1984, 43796, 34, 27781, 30646, 5303, 4769, 1...

[ 0.0718994140625, 0.272705078125, 0.2607421875, 0.1552734375, 0.054229736328125, 0.09814453125, 0.01373291015625, 0.123291015625, 0.1651611328125, 0.016082763671875, 0.0655517578125, 0.139892578125, 0.2222900390625, 0.0899658203125, 0.0902099609375, 0.01361083984375, 0.1820068359375, ...

embed

46203009_c0

46203009

haskell

0

Title: Partial application of type synonyms Problem title: Partial application of type synonyms Tags: partial-application, haskell, ghc, type-families, type-synonyms Problem: Partial application of type synonyms I'm having trouble with unsaturated type synonyms in the following example: {-# LANGUAGE TypeFamilies #-} {-...

Partial application of type synonyms Partial application of type synonyms partial-application haskell ghc type-families type-synonyms Partial LANGUAGE TypeFamilies LiberalTypeSynonyms TypeFamilyHackery CollectArgTypes MapReturnType MkT Goal BuryT Bool XLiberalTypeSynonyms Partial application of type synonyms I'm having...

[ 0.01007080078125, 0.0230712890625, -0.000942230224609375, 0.005035400390625, -0.02294921875, -0.00909423828125, -0.0033416748046875, -0.03271484375, -0.002166748046875, 0.00567626953125, -0.00445556640625, -0.00811767578125, -0.0029296875, 0.0242919921875, 0.005157470703125, 0.00430297...

[ 9148, 289, 38415, 10644, 164661, 2878, 101687, 1556, 142508, 31380, 238, 69128, 12654, 45757, 98064, 60457, 1191, 91441, 196707, 3371, 6495, 11050, 138521, 42719, 987, 92, 618, 2016, 7362, 53, 2460, 929, 43523, 1297, 7, 63134, 2234, 26690, ...

[ 0.173583984375, 0.087890625, 0.1591796875, 0.217041015625, 0.2393798828125, 0.150390625, 0.141357421875, 0.0623779296875, 0.2010498046875, 0.034210205078125, 0.0249481201171875, 0.06494140625, 0.050140380859375, 0.164306640625, 0.07763671875, 0.18115234375, 0.0306549072265625, 0.15...

embed

33026225_c0

33026225

haskell

0

Title: Data type errors on haskell regarding arguments Problem title: Data type errors on haskell regarding arguments Tags: haskell Problem: Data type errors on haskell regarding arguments So I'm new to haskell and I'm not quite sure how to do certain things Not many online tutorials even address the problem I'm having...

Data type errors on haskell regarding arguments Data type errors on haskell regarding arguments haskell Data PointVal Float Show Extension.lhs:17:3 Couldn Failed Data type errors on haskell regarding arguments So I'm new to haskell and I'm not quite sure how to do certain things Not many online tutorials even address t...

[ 0.0201416015625, 0.032470703125, -0.00506591796875, 0.0101318359375, 0.00537109375, -0.00787353515625, 0.002593994140625, 0.007080078125, -0.0164794921875, -0.0234375, -0.00433349609375, -0.06884765625, 0.01519775390625, -0.0140380859375, -0.0194091796875, -0.013916015625, 0.02941894...

[ 11809, 10644, 18499, 7, 98, 1556, 142508, 118861, 10750, 41097, 42272, 38699, 257, 17367, 224545, 79366, 22950, 363, 191147, 19, 190355, 57143, 18151, 127, 11435, 20949, 31577, 28282, 2053, 201, 21917, 9821, 27992, 237, 1022, 136, 113, 552, ...

[ 0.117431640625, 0.2259521484375, 0.2044677734375, 0.045379638671875, 0.032012939453125, 0.1396484375, 0.219970703125, 0.07366943359375, 0.2156982421875, 0.143798828125, 0.2254638671875, 0.1552734375, 0.02764892578125, 0.1632080078125, 0.15478515625, 0.0802001953125, 0.08612060546875,...

embed

33268280_c0

33268280

haskell

0

Title: Is there a way to use an "unlift" style when writing in a monad transformer do block? Problem title: Is there a way to use an "unlift" style when writing in a monad transformer do block? Tags: haskell, monad-transformers, monads, refactoring Problem: Is there a way to use an "unlift" style wh...

Is there a way to use an "unlift" style when writing in a monad transformer do block? Is there a way to use an "unlift" style when writing in a monad transformer do block? haskell monad-transformers monads refactoring MaybeT ExceptT Producer Consumer Is there a way to use an "unlift" style when writ...

[ -0.00038909912109375, 0.0247802734375, 0.028564453125, -0.00823974609375, -0.0008087158203125, -0.01031494140625, 0.01202392578125, -0.019775390625, 0.01397705078125, -0.01043701171875, 0.01116943359375, -0.002777099609375, 0.01239013671875, -0.01031494140625, 0.000904083251953125, 0.0...

[ 3917, 4527, 309, 104501, 20623, 32562, 2667, 712, 27198, 56, 54, 46389, 1556, 142508, 215175, 1314, 144810, 83425, 618, 218288, 103687, 76980, 23, 20625, 15190, 1632, 11001, 32354, 3647, 17780, 82463, 96704, 56104, 81409, 1884, 26531, 17368, ...

[ 0.068115234375, 0.0948486328125, 0.1463623046875, 0.290283203125, 0.2191162109375, 0.1802978515625, 0.10382080078125, 0.14453125, 0.2064208984375, 0.1029052734375, 0.1376953125, 0.1885986328125, 0.045745849609375, 0.2386474609375, 0.1971435546875, 0.0823974609375, 0.1226806640625, ...

embed

2305370_c1

2305370

haskell

1

is an API function getUrlContents :: String -> IO String that opens HTTP connection and returns an HTML for given URL. UPDATE : why to have state (or may be not)? The API can have more functions, not just single "load-and-parse results". I didn't add them to avoid complexity. Also it could care about HTTP Referer head...

[ -0.01507568359375, 0.0040283203125, 0.005645751953125, 0.0042724609375, -0.00701904296875, 0.0213623046875, 0.004425048828125, -0.0167236328125, 0.0018768310546875, -0.02880859375, 0.0001373291015625, -0.0205078125, -0.01416015625, -0.0283203125, 0.022705078125, -0.016357421875, 0.01...

[ 83, 142, 61687, 32354, 2046, 48743, 141, 11935, 25352, 7, 1984, 23351, 214, 33079, 17780, 450, 9803, 135913, 94878, 136, 30646, 19097, 100, 34475, 31862, 5, 161521, 15400, 47, 765, 11341, 15, 748, 1543, 186, 959, 32, 581, 831, 1286, 4, ...

[ 0.15087890625, 0.073974609375, 0.2822265625, 0.235107421875, 0.2003173828125, 0.214599609375, 0.1497802734375, 0.1739501953125, 0.29296875, 0.1287841796875, 0.12890625, 0.1971435546875, 0.098876953125, 0.06121826171875, 0.24609375, 0.04779052734375, 0.2005615234375, 0.2325439453125...

embed

18959720_c1

18959720

haskell

1

data PendulumState = PendulumState { omega :: Double -- rad/s Angular Velocity , theta :: Double -- rad Angular Displacement , time :: Double -- s Time } type Time = Double type TIncrement = Double list2State :: [[Double]] -> PendulumState list2State [xs, ys] = PendulumState { theta = (ys !! 0) , omega = (ys !! 1) , t...

[ -0.0213623046875, -0.00958251953125, -0.01300048828125, -0.0033416748046875, -0.0181884765625, 0.01141357421875, -0.01336669921875, -0.01385498046875, -0.01177978515625, -0.03369140625, -0.00958251953125, -0.0167236328125, 0.00799560546875, -0.0032806396484375, -0.036376953125, -0.0076...

[ 2053, 150034, 95671, 135206, 13, 2203, 99245, 1984, 107172, 4210, 4248, 64, 2393, 35975, 139993, 60089, 70, 102, 6206, 23935, 6, 1733, 91, 19055, 10644, 26906, 19, 7612, 674, 5303, 304, 34, 2661, 86245, 425, 7, 113, 268, 4778, 6506, 757...

[ 0.233642578125, 0.2392578125, 0.281005859375, 0.265869140625, 0.08056640625, 0.0872802734375, 0.255615234375, 0.028778076171875, 0.1488037109375, 0.023468017578125, 0.1298828125, 0.1025390625, 0.103271484375, 0.130859375, 0.161865234375, 0.051116943359375, 0.127197265625, 0.1582031...

embed

43787633_c0

43787633

haskell

0

Title: Structural induction proof on filter infix on filter Problem title: Structural induction proof on filter infix on filter Tags: haskell, induction, proof Problem: Structural induction proof on filter infix on filter I am trying to prove the following: filter p . filter q = filter (and p q) where and p q x = p x &...

Structural induction proof on filter infix on filter Structural induction proof on filter infix on filter haskell induction proof Structural Induction Base Inductive Structural induction proof on filter infix on filter I am trying to prove the following: here is my try, but i am not sure if it is correct, can anyone gi...

[ 0.00616455078125, 0.017333984375, -0.0016937255859375, -0.00714111328125, 0.005035400390625, -0.0030975341796875, -0.000274658203125, -0.00933837890625, 0.0267333984375, -0.007476806640625, -0.01434326171875, 0.01171875, -0.01348876953125, -0.0023040771484375, -0.0079345703125, 0.00933...

[ 63667, 73317, 141, 23, 77391, 98869, 98, 46312, 55923, 1556, 142508, 360, 44978, 39367, 4935, 31577, 23534, 25632, 9790, 9077, 26785, 25647, 135989, 7225, 6275, 151994, 831, 29479, 390, 18344, 7569, 5303, 46683, 3220, 4527, 6889, 3664, 186 ]

[ 0.135009765625, 0.139404296875, 0.03265380859375, 0.102783203125, 0.19970703125, 0.18994140625, 0.0380859375, 0.220947265625, 0.181396484375, 0.10009765625, 0.17431640625, 0.0946044921875, 0.1083984375, 0.1551513671875, 0.122314453125, 0.03167724609375, 0.1474609375, 0.029891967773...

embed

77467489_c1

77467489

haskell

1

sac-0.0 (exe:gsac) (dependency rebuilt) Configuring library for gsdl-0.0.. Preprocessing library for gsdl-0.0.. Building library for gsdl-0.0.. [1 of 1] Compiling GSDL.Core.ReadFile ( hslib/GSDL/Core/ReadFile.hs, dist/build/GSDL/Core/ReadFile.o, dist/build/GSDL/Core/ReadFile.dyn_o ) Installing library in /home/jcast/.c...

[ -0.01055908203125, -0.0120849609375, -0.0185546875, -0.006561279296875, 0.0203857421875, 0.0086669921875, -0.017333984375, 0.003936767578125, -0.00653076171875, 0.0240478515625, 0.007781982421875, -0.037109375, -0.0201416015625, -0.00787353515625, 0.0130615234375, -0.009033203125, -0...

[ 30823, 9, 99929, 46480, 9405, 2263, 105254, 33, 2408, 456, 978, 24908, 59994, 35773, 1294, 706, 7, 20469, 1914, 63923, 104919, 15612, 49725, 74356, 27502, 50886, 31345, 174350, 1096, 5612, 34162, 127, 177149, 31, 107951, 23, 29552, 170, 557...

[ 0.2080078125, 0.024078369140625, 0.2222900390625, 0.105712890625, 0.0999755859375, 0.2056884765625, 0.13671875, 0.0271453857421875, 0.019927978515625, 0.0975341796875, 0.09228515625, 0.105712890625, 0.179443359375, 0.2078857421875, 0.09906005859375, 0.075927734375, 0.08544921875, 0...

embed

53487894_c0

53487894

haskell

0

Title: Haskell IORef - an answer vs. a function to get an answer Problem title: Haskell IORef - an answer vs. a function to get an answer Tags: closures, do-notation, haskell, io, ioref Problem: Haskell IORef - an answer vs. a function to get an answer I'm trying to understand how IORefs are really used, and I'm having...

Haskell IORef - an answer vs. a function to get an answer Haskell IORef - an answer vs. a function to get an answer closures do-notation haskell io ioref Haskell IORef IORefs Haskell IORef - an answer vs. a function to get an answer I'm trying to understand how IORefs are really used, and I'm having trouble following t...

[ -0.005706787109375, 0.0091552734375, 0.0198974609375, 0.011474609375, 0.0098876953125, 0.0126953125, 0.00494384765625, -0.0086669921875, 0.018798828125, -0.0167236328125, -0.00118255615234375, -0.01611328125, 0.0233154296875, 0.01409912109375, 0.00982666015625, -0.0032501220703125, -...

[ 20625, 142508, 123435, 4240, 142, 35166, 20209, 32354, 47, 2046, 170224, 54, 157, 1556, 22995, 29087, 10, 28219, 7, 6183, 11814, 63134, 121413, 18151, 184, 162, 15246, 2947, 79832, 1837, 8996, 22875, 309, 115840, 5, 28412, 108210, 71924, 50...

[ 0.1280517578125, 0.2412109375, 0.20947265625, 0.275634765625, 0.03912353515625, 0.2474365234375, 0.1895751953125, 0.2159423828125, 0.139404296875, 0.17041015625, 0.2120361328125, 0.1480712890625, 0.1334228515625, 0.130615234375, 0.2498779296875, 0.277099609375, 0.00994873046875, 0....

embed

73776527_c0

73776527

haskell

0

Title: How to use equational reasoning to reduce this expression Problem title: How to use equational reasoning to reduce this expression Tags: haskell Problem: How to use equational reasoning to reduce this expression I have the following definitions: fibs = 1 : scanl (+) 1 fibs scanl :: (a -> b -> a) -> a -> [b] -> [...

How to use equational reasoning to reduce this expression How to use equational reasoning to reduce this expression haskell How x:xs n-1 How to use equational reasoning to reduce this expression I have the following definitions: I would like to reduce the following expression: So, I would proceed: How can I continue re...

[ 0.000751495361328125, -0.016357421875, 0.002349853515625, 0.03076171875, -0.0064697265625, -0.009765625, -0.0133056640625, 0.015380859375, 0.0123291015625, -0.03564453125, 0.00665283203125, 0.0218505859375, 0.020263671875, 0.00628662109375, 0.0101318359375, 0.002777099609375, 0.02429...

[ 11249, 4527, 13722, 43315, 31635, 214, 34390, 903, 125195, 47, 28, 1556, 142508, 1022, 12, 425, 7, 653, 5759, 80934, 1884, 25632, 172337, 21342, 136475, 4568, 13315, 214552, 11737, 7077, 3698, 20990, 52544, 14012, 5608, 1892, 86869 ]

[ 0.0806884765625, 0.0921630859375, 0.1700439453125, 0.1170654296875, 0.1759033203125, 0.093017578125, 0.209716796875, 0.033782958984375, 0.1966552734375, 0.0068359375, 0.0266265869140625, 0.1490478515625, 0.2215576171875, 0.1248779296875, 0.04486083984375, 0.134765625, 0.1035766601562...

embed

10093884_c0

10093884

haskell

0

Title: Using referential-transparency to pre-compute values in haskell Problem title: Using referential-transparency to pre-compute values in haskell Tags: haskell, precompute, referential-transparency Problem: Using referential-transparency to pre-compute values in haskell Let's say we have a program like this : list ...

Using referential-transparency to pre-compute values in haskell Using referential-transparency to pre-compute values in haskell haskell precompute referential-transparency Using Using referential-transparency to pre-compute values in haskell Let's say we have a program like this : I want this to be compiled such that t...

[ 0.001007080078125, -0.006103515625, 0.0272216796875, 0.0111083984375, -0.000652313232421875, 0.011474609375, -0.004058837890625, 0.0086669921875, 0.0194091796875, -0.050048828125, -0.01507568359375, 0.0186767578125, 0.00958251953125, -0.001129150390625, 0.0023956298828125, 0.0086669921...

[ 345, 15005, 80973, 30145, 16082, 27771, 47, 479, 58875, 6743, 142424, 1556, 142508, 23, 118562, 65970, 13, 6953, 1528, 1884, 903, 3444, 186, 375, 5974, 297, 6044, 70, 71924, 2886, 1660, 28412, 190, 197094, 4283, 28568, 4, 15490, 35971, 50...

[ 0.0836181640625, 0.2095947265625, 0.17822265625, 0.1583251953125, 0.22021484375, 0.080322265625, 0.089599609375, 0.2069091796875, 0.1583251953125, 0.1307373046875, 0.181884765625, 0.1573486328125, 0.2413330078125, 0.027557373046875, 0.1414794921875, 0.1942138671875, 0.015365600585937...

embed

29580187_c0

29580187

haskell

0

Title: Haskell Language Report: definition of reservedid Problem title: Haskell Language Report: definition of reservedid Tags: haskell, syntax Problem: Haskell Language Report: definition of reservedid OK, so I've spent all day playing with the Haskell Language Report (2010), and finding all sorts of "interesting" edg...

Haskell Language Report: definition of reservedid Haskell Language Report: definition of reservedid haskell syntax Haskell Language Report Haskell Language Report: definition of reservedid OK, so I've spent all day playing with the Haskell Language Report (2010), and finding all sorts of "interesting" edge-cases. Stuff...

[ 0.005859375, -0.0024261474609375, 0.0262451171875, -0.004669189453125, 0.028076171875, 0.005401611328125, -0.00628662109375, 0.00665283203125, -0.0179443359375, -0.005950927734375, 0.01373291015625, -0.008056640625, -0.0186767578125, -0.021484375, 0.007232666015625, 0.0220947265625, ...

[ 20625, 142508, 83658, 34798, 80934, 111, 70488, 532, 1556, 6002, 86531, 75169, 71189, 90791, 50171, 1916, 121303, 58437, 21493, 5351, 5608, 18499, 20653, 107003, 75675, 21533, 91067, 58994, 4068, 10461, 13648, 41206, 1957, 217225, 450, 5303, 49...

[ 0.111328125, 0.2247314453125, 0.1689453125, 0.2081298828125, 0.1490478515625, 0.02801513671875, 0.2462158203125, 0.2298583984375, 0.1026611328125, 0.05889892578125, 0.1490478515625, 0.0572509765625, 0.1029052734375, 0.011810302734375, 0.047149658203125, 0.08074951171875, 0.1494140625...

embed

69876975_c0

69876975

haskell

0

Title: Making a list of strings lowercase in Haskell Problem title: Making a list of strings lowercase in Haskell Tags: haskell Problem: Making a list of strings lowercase in Haskell I have a list of strings ["Hi", "hELLO", "nO"] and I want to convert everything to lowercase. I wrote a function for this: import Data.Ch...

Making a list of strings lowercase in Haskell Making a list of strings lowercase in Haskell haskell Data.Char Making Haskell Couldn Char Making a list of strings lowercase in Haskell I have a list of strings ["Hi", "hELLO", "nO"] and I want to convert everything to lowercase. I wrote a function for this: It compiles, b...

[ -0.000667572021484375, -0.005340576171875, 0.0250244140625, 0.00469970703125, 0.00738525390625, 0.005035400390625, -0.007568359375, -0.009521484375, 0.0078125, 0.032470703125, -0.01214599609375, -0.042724609375, 0.03515625, 0.015869140625, -0.02197265625, -0.002227783203125, 0.024536...

[ 13676, 5303, 79315, 92319, 58437, 20625, 142508, 7, 23, 1556, 11809, 84068, 191147, 19, 21656, 111, 20861, 127, 174444, 670, 3444, 96760, 26818, 47, 54397, 32354, 903, 9969, 1340, 1284, 3249, 69070, 18499, 28219, 4488 ]

[ 0.0958251953125, 0.1953125, 0.233642578125, 0.2099609375, 0.2279052734375, 0.1439208984375, 0.2435302734375, 0.0292205810546875, 0.0199127197265625, 0.1356201171875, 0.07562255859375, 0.148681640625, 0.06231689453125, 0.0745849609375, 0.14697265625, 0.004547119140625, 0.15625, 0.07...

embed

23503702_c0

23503702

haskell

0

Title: Parsec returns [Char] instead of Text Problem title: Parsec returns [Char] instead of Text Tags: type-inference, parsec, haskell Problem: Parsec returns [Char] instead of Text I am trying to create a parser for a custom file format. In the format I am working with, some fields have a closing tag like so: <SOL> <...

Parsec returns [Char] instead of Text Parsec returns [Char] instead of Text type-inference parsec haskell Data.Text Text.Parsec Text.Parsec.Text Parsec Char Text SOL DATE YEAR LANGUAGE NoMonomorphismRestriction OverloadedStrings Parsec returns [Char] instead of Text I am trying to create a parser for a custom file form...

[ 0.0022125244140625, 0.004241943359375, 0.008056640625, 0.0361328125, -0.0198974609375, 0.02490234375, 0.0042724609375, -0.02783203125, 0.000919342041015625, -0.0015869140625, -0.00732421875, -0.01507568359375, -0.0247802734375, -0.0022430419921875, 0.0013275146484375, 0.0322265625, -...

[ 2392, 39797, 30646, 84068, 64457, 111, 24129, 10644, 73, 69988, 366, 1556, 142508, 11809, 174379, 28636, 21656, 78837, 35746, 990, 127427, 98064, 438, 178851, 8780, 7655, 9578, 63033, 71713, 7, 28282, 2189, 114122, 11435, 9384, 20697, 44457, ...

[ 0.164794921875, 0.26171875, 0.2181396484375, 0.241455078125, 0.179931640625, 0.0304718017578125, 0.214111328125, 0.18603515625, 0.03387451171875, 0.1739501953125, 0.1346435546875, 0.1011962890625, 0.1998291015625, 0.085693359375, 0.1959228515625, 0.078857421875, 0.1630859375, 0.105...

embed

76116041_c0

76116041

haskell

0

Title: Exception handling in lambda calculus and functional programming Problem title: Exception handling in lambda calculus and functional programming Tags: lambda-calculus, exception, theory, functional-programming, haskell Problem: Exception handling in lambda calculus and functional programming Is there a way to mo...

Exception handling in lambda calculus and functional programming Exception handling in lambda calculus and functional programming lambda-calculus exception theory functional-programming haskell Control.Exception Exception setjmp.h errno.h signal.h Exception handling in lambda calculus and functional programming Is ther...

[ 0.00958251953125, 0.031982421875, -0.0162353515625, -0.01068115234375, 0.00714111328125, -0.0025177001953125, 0.00836181640625, -0.00250244140625, -0.019775390625, -0.053955078125, -0.003692626953125, -0.03564453125, -0.00567626953125, -0.0032196044921875, 0.0179443359375, 0.0052490234...

[ 5443, 63928, 45064, 21, 6492, 85, 44805, 223, 136, 123309, 56037, 23, 6827, 94739, 131527, 154453, 28966, 1556, 142508, 27131, 19279, 5423, 170, 2676, 127, 72, 37599, 26073, 3917, 3299, 39210, 48716, 48322, 117249, 59158, 46876, 30057, 214709...

[ 0.1378173828125, 0.258056640625, 0.21533203125, 0.03826904296875, 0.1854248046875, 0.1162109375, 0.1885986328125, 0.08001708984375, 0.0001220703125, 0.1700439453125, 0.13818359375, 0.01983642578125, 0.08935546875, 0.084716796875, 0.273193359375, 0.04241943359375, 0.09210205078125, ...

embed

48478292_c0

48478292

haskell

0

Title: Lazy operations with haskell/cryptonite Problem title: Lazy operations with haskell/cryptonite Tags: haskell Problem: Lazy operations with haskell/cryptonite I'm using cryptonite to perform AES256 encryption in CTR mode. So far, everything works fine with ByteStrings, but for better space efficiency (some files ...

Lazy operations with haskell/cryptonite Lazy operations with haskell/cryptonite haskell a Lazy ByteArray memory-0.14.6:Data.ByteArray.Types.ByteArray LBS.ByteString Lazy operations with haskell/cryptonite I'm using cryptonite to perform AES256 encryption in CTR mode. So far, everything works fine with ByteStrings, but ...

[ -0.005645751953125, 0.0074462890625, -0.00848388671875, -0.010498046875, -0.006561279296875, -0.00872802734375, 0.0166015625, 0.0081787109375, -0.002410888671875, -0.0216064453125, 0.0012664794921875, 0.0224609375, 0.0120849609375, 0.0244140625, -0.01434326171875, 0.002899169921875, ...

[ 239, 3285, 41018, 678, 1556, 142508, 136791, 191, 1486, 3311, 67, 7614, 7092, 98323, 102014, 115459, 137989, 75358, 196707, 20429, 71713, 215637, 17094, 51339, 62, 6706, 127892, 28981, 13736, 26818, 43240, 5885, 5180, 11522, 32628, 227066, 1021...

[ 0.190673828125, 0.225830078125, 0.182373046875, 0.04913330078125, 0.10699462890625, 0.2391357421875, 0.203369140625, 0.0469970703125, 0.159423828125, 0.10699462890625, 0.1319580078125, 0.128173828125, 0.2027587890625, 0.1278076171875, 0.10137939453125, 0.1907958984375, 0.059997558593...

embed

30694244_c0

30694244

haskell

0

Title: Non-exhaustive patterns in function combadd1 Problem title: Non-exhaustive patterns in function combadd1 Tags: haskell Problem: Non-exhaustive patterns in function combadd1 already added count - 1 > 0 terminate it , no infinity loop, do not know why it has this pattern ./hello hello: main.hs:(95,1)-(102,9): Non-...

Non-exhaustive patterns in function combadd1 Non-exhaustive patterns in function combadd1 haskell Non-exhaustive combadd1 main.hs count-1 comb0 mapM_ Non-exhaustive patterns in function combadd1 already added count - 1 > 0 terminate it , no infinity loop, do not know why it has this pattern expect to add one of combina...

[ -0.02294921875, 0.01544189453125, -0.0089111328125, 0.015869140625, -0.0028839111328125, 0.003448486328125, -0.006927490234375, 0.0078125, 0.021240234375, 0.01513671875, -0.000904083251953125, -0.03125, 0.053955078125, 0.0179443359375, 0.0072021484375, -0.00640869140625, -0.000549316...

[ 3775, 3355, 18391, 4935, 103510, 32354, 375, 12283, 71, 418, 1556, 142508, 5201, 127, 7, 54529, 5759, 275, 2389, 22288, 594, 21771, 49814, 106, 977, 757, 121011, 110, 54241, 40956, 3714, 41206, 15190, 1632, 162515, 140992, 62775, 23180, 959...

[ 0.16650390625, 0.020782470703125, 0.1385498046875, 0.0748291015625, 0.21435546875, 0.139404296875, 0.1268310546875, 0.1138916015625, 0.1220703125, 0.10546875, 0.1239013671875, 0.2098388671875, 0.0853271484375, 0.09149169921875, 0.03857421875, 0.1817626953125, 0.1181640625, 0.039581...

embed

54946242_c0

54946242

haskell

0

Title: Can not return maybe result in the IO Monad Problem title: Can not return maybe result in the IO Monad Tags: haskell, io-monad Problem: Can not return maybe result in the IO Monad I do not understand why this sample of code does not work and in RWH book it works: module Monads where import Data.Maybe import Cont...

Can not return maybe result in the IO Monad Can not return maybe result in the IO Monad haskell io-monad Data.Maybe Control.Monad Can Monad Monads f::String Maybe Couldn Expected Integer Actual Can not return maybe result in the IO Monad I do not understand why this sample of code does not work and in RWH book it works...

[ -0.02587890625, -0.0019073486328125, 0.00970458984375, 0.00933837890625, 0.01226806640625, 0.009521484375, 0.00171661376953125, -0.0167236328125, -0.00531005859375, 0.00860595703125, 0.01007080078125, -0.0169677734375, -0.004730224609375, -0.00128173828125, 0.015869140625, -0.015075683...

[ 4171, 959, 30646, 51139, 16750, 23, 17780, 60331, 71, 1556, 142508, 22995, 3796, 712, 11809, 82419, 372, 27131, 46674, 6468, 1238, 12, 71713, 83425, 191147, 19, 60075, 13, 44401, 100582, 28219, 903, 121413, 18151, 14602, 4488, 78691, 841, 1...

[ 0.09521484375, 0.16552734375, 0.29345703125, 0.293212890625, 0.2261962890625, 0.04754638671875, 0.249755859375, 0.2110595703125, 0.1513671875, 0.1063232421875, 0.2039794921875, 0.2276611328125, 0.138671875, 0.10302734375, 0.07110595703125, 0.1409912109375, 0.095458984375, 0.2199707...

embed

35689193_c0

35689193

haskell

0

Title: Console Output of bytestrings - deletes first character of next line Problem title: Console Output of bytestrings - deletes first character of next line Tags: unicode, haskell, bytestring Problem: Console Output of bytestrings - deletes first character of next line Answering haskell-convert-unicode-sequence-to-u...

Console Output of bytestrings - deletes first character of next line Console Output of bytestrings - deletes first character of next line unicode haskell bytestring Data.Text Data.ByteString qualified Console Output ByteString.putStrLn LANGUAGE OverloadedStrings Main Text ByteString Data.ByteString.Char8 B.putStrLn DC4...

[ 0.0087890625, 0.0206298828125, 0.01129150390625, 0.022216796875, -0.00457763671875, -0.0017852783203125, 0.011962890625, -0.00131988525390625, -0.0089111328125, 0.047119140625, 0.00164794921875, -0.00083160400390625, 0.0157470703125, -0.011962890625, -0.00408935546875, 0.0115966796875,...

[ 1657, 40777, 13538, 7077, 111, 390, 6954, 46828, 8, 74635, 5117, 62816, 11737, 13315, 60347, 112, 1556, 142508, 67, 91693, 11809, 174379, 75358, 71713, 217225, 3311, 214, 866, 3358, 98064, 9578, 63033, 12321, 24129, 84068, 1019, 335, 31455, ...

[ 0.0452880859375, 0.1944580078125, 0.1290283203125, 0.10504150390625, 0.0304718017578125, 0.094970703125, 0.169677734375, 0.1927490234375, 0.123291015625, 0.1656494140625, 0.1275634765625, 0.1898193359375, 0.11767578125, 0.1434326171875, 0.1490478515625, 0.080322265625, 0.110717773437...

embed

53689919_c0

53689919

haskell

0

Title: ApplicativeDo pragma and Applicative Functor in Haskell Problem title: ApplicativeDo pragma and Applicative Functor in Haskell Tags: applicative, haskell, functor, monads Problem: ApplicativeDo pragma and Applicative Functor in Haskell An example from Functor, Applicative, and Monad slightly changed: {-# LANGUAG...

ApplicativeDo pragma and Applicative Functor in Haskell ApplicativeDo pragma and Applicative Functor in Haskell applicative haskell functor monads Safe Control.Applicative ApplicativeDo Applicative Functor Haskell LANGUAGE Nothing You Just Please ApplicativeDo pragma and Applicative Functor in Haskell An example from F...

[ -0.00119781494140625, 0.01446533203125, 0.001007080078125, 0.023193359375, -0.01263427734375, 0.04248046875, 0.00543212890625, -0.001983642578125, 0.0012664794921875, -0.01483154296875, 0.01556396484375, -0.0208740234375, -0.004425048828125, 0.004150390625, -0.005615234375, -0.02453613...

[ 5659, 11048, 4935, 8331, 58827, 192, 136, 28670, 18770, 23, 20625, 142508, 41816, 1556, 7477, 2667, 712, 115527, 27131, 39179, 3358, 98064, 182747, 2583, 9563, 30607, 27781, 60331, 71, 161549, 98816, 51139, 284, 429, 678, 54, 87, 11814, 644...

[ 0.142333984375, 0.18115234375, 0.19189453125, 0.2008056640625, 0.1639404296875, 0.123779296875, 0.08282470703125, 0.138427734375, 0.23486328125, 0.0143280029296875, 0.156494140625, 0.25927734375, 0.18896484375, 0.124267578125, 0.1414794921875, 0.08837890625, 0.10137939453125, 0.150...

embed

42529206_c0

42529206

haskell

0

Title: How do I modify a Haskell list without entering an infinite loop? Problem title: How do I modify a Haskell list without entering an infinite loop? Tags: recursion, lazy-evaluation, infinite-loop, debugging, haskell Problem: How do I modify a Haskell list without entering an infinite loop? I am writing a piece of...

How do I modify a Haskell list without entering an infinite loop? How do I modify a Haskell list without entering an infinite loop? recursion lazy-evaluation infinite-loop debugging haskell How Haskell How do I modify a Haskell list without entering an infinite loop? I am writing a piece of code in Haskell, where I hav...

[ -0.01092529296875, 0.028564453125, 0.01116943359375, 0.00836181640625, 0.0068359375, 0.00146484375, -0.005859375, 0.0045166015625, 0.01434326171875, -0.0264892578125, 0.027587890625, -0.02734375, 0.005462646484375, -0.004150390625, 0.0128173828125, 0.005584716796875, 0.031982421875, ...

[ 11249, 2811, 40383, 20625, 142508, 5303, 15490, 22, 33558, 54241, 40956, 13, 195625, 21, 3285, 159258, 28354, 8, 978, 1556, 54, 10, 32562, 18151, 13315, 3871, 32354, 1884, 154107, 3525, 95378, 5170, 493, 24371, 41382, 2053, 45646, 29479, 11...

[ 0.043975830078125, 0.1864013671875, 0.1624755859375, 0.1591796875, 0.25390625, 0.218994140625, 0.1650390625, 0.044769287109375, 0.0731201171875, 0.1558837890625, 0.195556640625, 0.04119873046875, 0.0755615234375, 0.0849609375, 0.127197265625, 0.0947265625, 0.1153564453125, 0.014465...

embed

7656767_c0

7656767

haskell

0

Title: Should I always prefer more general types to specific types? Problem title: Should I always prefer more general types to specific types? Tags: polymorphism, haskell, ghc Problem: Should I always prefer more general types to specific types? Compiled with ghc --make , these two programs produce the exact same bina...

Should I always prefer more general types to specific types? Should I always prefer more general types to specific types? polymorphism haskell ghc Should id1a.hs id1b.hs Char Should I always prefer more general types to specific types? Compiled with ghc --make , these two programs produce the exact same binaries: Is th...

[ 0.01214599609375, 0.0029144287109375, 0.00885009765625, 0.00738525390625, 0.0091552734375, -0.00579833984375, 0.00457763671875, -0.0137939453125, -0.00634765625, -0.0135498046875, 0.00140380859375, -0.0361328125, -0.0032806396484375, -0.0133056640625, -0.0172119140625, 0.00396728515625...

[ 151117, 11343, 12601, 1286, 4537, 52895, 29458, 35874, 178851, 8780, 1556, 142508, 31380, 238, 3447, 11, 127, 275, 21656, 15612, 678, 55898, 6626, 103391, 27489, 24763, 5701, 23035, 10484, 686, 27781, 29568, 2046, 27140, 31635, 71864, 20662, ...

[ 0.07012939453125, 0.089599609375, 0.12548828125, 0.0899658203125, 0.1917724609375, 0.2496337890625, 0.2071533203125, 0.09423828125, 0.1778564453125, 0.000213623046875, 0.1029052734375, 0.2034912109375, 0.10675048828125, 0.099365234375, 0.07244873046875, 0.0206298828125, 0.05645751953...

embed

64823382_c0

64823382

haskell

0

Title: Haskell: List all common factors Problem title: Haskell: List all common factors Tags: sorting, haskell, list Problem: Haskell: List all common factors I am learning Haskell and am currently creating a program that finds all common divisors from 3 different Int:s. I have a working program but the evaluation time...

Haskell: List all common factors Haskell: List all common factors sorting haskell list Data.List Haskell List Ord Merge x:xs y:ys xs1 xs2 Haskell: List all common factors I am learning Haskell and am currently creating a program that finds all common divisors from 3 different Int:s. I have a working program but the eva...

[ 0.00151824951171875, 0.01239013671875, 0.01300048828125, -0.0164794921875, -0.00909423828125, -0.0157470703125, -0.0186767578125, -0.029541015625, 0.005523681640625, -0.0162353515625, 0.00628662109375, 0.0025787353515625, 0.025146484375, -0.0072021484375, -0.029052734375, -0.0103149414...

[ 20625, 142508, 32036, 756, 39210, 120103, 12, 12096, 214, 1556, 5303, 11809, 154663, 35379, 6035, 429, 1022, 425, 113, 4778, 418, 7, 304, 52080, 82424, 105233, 1528, 7413, 45, 51858, 1295, 138, 12921, 360, 18, 20697, 1284, 219836, 1733, 4...

[ 0.1727294921875, 0.27490234375, 0.2197265625, 0.185302734375, 0.22607421875, 0.272705078125, 0.03759765625, 0.17919921875, 0.024169921875, 0.172119140625, 0.1748046875, 0.08953857421875, 0.1512451171875, 0.166259765625, 0.1767578125, 0.062469482421875, 0.036895751953125, 0.05187988...

embed

69848165_c0

69848165

haskell

0

Title: Fibonacci infinite list performance (Higher order functions vs. Standard recursion) Problem title: Fibonacci infinite list performance (Higher order functions vs. Standard recursion) Tags: haskell, higher-order-functions, fibonacci, infinite, list-comprehension Problem: Fibonacci infinite list performance (Highe...

Fibonacci infinite list performance (Higher order functions vs. Standard recursion) Fibonacci infinite list performance (Higher order functions vs. Standard recursion) haskell higher-order-functions fibonacci infinite list-comprehension Fibonacci Higher Standard Integer Num Ord Fibonacci infinite list performance (High...

[ 0.0027313232421875, -0.013916015625, 0.002044677734375, -0.0072021484375, -0.005706787109375, -0.018798828125, 0.0032501220703125, -0.01275634765625, 0.01373291015625, -0.02490234375, 0.00933837890625, 0.0021514892578125, -0.0017852783203125, 0.003082275390625, 0.00421142578125, -0.001...

[ 3698, 20990, 52544, 54241, 13, 5303, 23718, 163025, 56, 12989, 32354, 20209, 20744, 195625, 1830, 1556, 142508, 77546, 80596, 137175, 809, 4692, 3220, 19694, 44401, 35379, 166635, 20625, 25632, 208124, 17368, 68330, 194583, 60818, 4552, 27571, ...

[ 0.1519775390625, 0.1666259765625, 0.199462890625, 0.1417236328125, 0.0657958984375, 0.1810302734375, 0.17041015625, 0.08905029296875, 0.02288818359375, 0.171630859375, 0.1748046875, 0.076904296875, 0.1407470703125, 0.1826171875, 0.0477294921875, 0.081298828125, 0.2257080078125, 0.1...

embed

31238766_c0

31238766

haskell

0

Title: Haskell: Finding the source of incomplete record construction Problem title: Haskell: Finding the source of incomplete record construction Tags: haskell, ghci, debugging, ghc Problem: Haskell: Finding the source of incomplete record construction I'm trying to debug a large, complicated program in Haskell, which ...

Haskell: Finding the source of incomplete record construction Haskell: Finding the source of incomplete record construction haskell ghci debugging ghc Haskell Finding Prelude.undefined Haskell: Finding the source of incomplete record construction I'm trying to debug a large, complicated program in Haskell, which I didn...

[ -0.000797271728515625, 0.005645751953125, -0.003814697265625, 0.0274658203125, -0.00775146484375, 0.016845703125, -0.00482177734375, 0.006683349609375, 0.00897216796875, -0.01348876953125, 0.010009765625, -0.04296875, 0.036865234375, -0.000629425048828125, 0.018798828125, -0.0016326904...

[ 20625, 142508, 26040, 31344, 82940, 46485, 17164, 50961, 1556, 31380, 318, 8, 978, 238, 1914, 822, 112, 59437, 5983, 111, 31577, 85779, 96704, 1528, 15935, 18, 167969, 33022, 35978, 28412, 2053, 45646, 99219, 54608, 25632, 18499, 5, 111531, ...

[ 0.1319580078125, 0.26416015625, 0.08880615234375, 0.1865234375, 0.128173828125, 0.1546630859375, 0.189697265625, 0.1322021484375, 0.07000732421875, 0.061187744140625, 0.088134765625, 0.13525390625, 0.151123046875, 0.031341552734375, 0.13916015625, 0.2445068359375, 0.19189453125, 0....

embed

56548719_c0

56548719

haskell

0

Title: How to run a specific number of tests in QuickCheck? Problem title: How to run a specific number of tests in QuickCheck? Tags: haskell, quickcheck Problem: How to run a specific number of tests in QuickCheck? I am trying to learn Haskell and specifically QuickCheck. While Haskell has a lot of information online ...

How to run a specific number of tests in QuickCheck? How to run a specific number of tests in QuickCheck? haskell quickcheck Test.QuickCheck 1 How QuickCheck Bool age1 age2 age3 age4 Failed Falsifiable How to run a specific number of tests in QuickCheck? I am trying to learn Haskell and specifically QuickCheck. While H...

[ -0.00860595703125, 0.01141357421875, -0.000225067138671875, 0.00518798828125, 0.006622314453125, 0.0142822265625, -0.006866455078125, -0.021240234375, 0.0023956298828125, -0.00970458984375, 0.0045166015625, -0.00823974609375, 0.008544921875, 0.0206298828125, 0.006591796875, 0.005859375...

[ 11249, 47, 11675, 29458, 14012, 109921, 23, 89038, 202567, 1556, 142508, 63773, 78292, 8647, 96010, 2594, 106, 2460, 929, 32070, 418, 304, 363, 617, 190355, 22225, 7, 27430, 2886, 30698, 20625, 237875, 28282, 96759, 3034, 678, 26499, 45831, ...

[ 0.0760498046875, 0.0198211669921875, 0.197509765625, 0.1949462890625, 0.172607421875, 0.27490234375, 0.06097412109375, 0.1702880859375, 0.296630859375, 0.07421875, 0.178955078125, 0.13232421875, 0.26171875, 0.1591796875, 0.0743408203125, 0.0888671875, 0.0185394287109375, 0.06231689...

embed

39002342_c0

39002342

haskell

0

Title: Adding an Ord instance to 'singleton' package generated naturals Problem title: Adding an Ord instance to 'singleton' package generated naturals Tags: dependent-type, haskell, singleton-type, template-haskell Problem: Adding an Ord instance to 'singleton' package generated naturals I am using...

Adding an Ord instance to 'singleton' package generated naturals Adding an Ord instance to 'singleton' package generated naturals dependent-type haskell singleton-type template-haskell Data.Singletons Data.Singletons.TH Data.Singletons.Prelude Data.Promotion.Prelude n_a9na a the Adding Ord LANGUAGE ...

[ -0.01214599609375, -0.00262451171875, -0.0024566650390625, -0.031494140625, 0.00537109375, 0.005767822265625, 0.0189208984375, -0.00150299072265625, 0.0179443359375, -0.023193359375, 0.006591796875, -0.00836181640625, -0.003936767578125, -0.0036468505859375, 0.00061798095703125, 0.0019...

[ 62, 59725, 142, 35379, 110527, 47, 3768, 6953, 133, 1507, 98169, 139392, 6083, 7, 108750, 50986, 1556, 142508, 11001, 110934, 10557, 11809, 213039, 67772, 23415, 822, 10752, 105401, 19273, 76, 98064, 19335, 196707, 140803, 196631, 6495, 27435, ...

[ 0.1231689453125, 0.1153564453125, 0.021942138671875, 0.2548828125, 0.26611328125, 0.117919921875, 0.035247802734375, 0.12255859375, 0.07159423828125, 0.1943359375, 0.1904296875, 0.129150390625, 0.197998046875, 0.02667236328125, 0.154052734375, 0.110595703125, 0.084228515625, 0.1862...

embed

51098495_c0

51098495

haskell

0

Title: Efficient way of printing property names in Haskell Problem title: Efficient way of printing property names in Haskell Tags: haskell, typeclass Problem: Efficient way of printing property names in Haskell Hello i am new to Haskell and i was wondering : For every new defined type constructor even if it is somethi...

Efficient way of printing property names in Haskell Efficient way of printing property names in Haskell haskell typeclass Efficient Haskell Letter Show Type ToString Person Male Female IsMarried Yes Worker person::Person status::IsMarried Efficient way of printing property names in Haskell Hello i am new to Haskell and...

[ -0.003631591796875, 0.0005035400390625, 0.01300048828125, 0.0235595703125, -0.003753662109375, 0.010009765625, -0.0089111328125, -0.002410888671875, 0.0023956298828125, -0.0059814453125, -0.0081787109375, -0.03125, 0.0123291015625, 0.01251220703125, -0.01312255859375, 0.0169677734375, ...

[ 24500, 45964, 3917, 2448, 1916, 57266, 123055, 20625, 142508, 1556, 10644, 67413, 105451, 17367, 60457, 717, 71713, 214, 15270, 35220, 213342, 2071, 16305, 46572, 32635, 27985, 3445, 160054, 10778, 29598, 23, 3525, 149016, 11907, 61924, 64549, ...

[ 0.1783447265625, 0.06494140625, 0.07977294921875, 0.1785888671875, 0.097412109375, 0.239990234375, 0.223876953125, 0.1500244140625, 0.2418212890625, 0.130859375, 0.1920166015625, 0.16259765625, 0.1588134765625, 0.235107421875, 0.1976318359375, 0.164794921875, 0.1466064453125, 0.105...

embed

19086408_c1

19086408

haskell

1

when defined as newtype Set' = Set' (Int -> Bool) . {-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-} import Data.List (intercalate) bound = 1000 -- ALTERNATE #1 type Set = Int -> Bool contains :: Set -> Int -> Bool contains s elem = s elem intersect :: Set -> Set -> Set intersect s t = \x -> s x && t x toStrin...

[ 0.00567626953125, 0.005096435546875, 0.0216064453125, 0.00811767578125, -0.004974365234375, 0.031494140625, -0.0005950927734375, -0.0198974609375, 0.004119873046875, 0.0267333984375, -0.024658203125, 0.0242919921875, 0.00689697265625, 0.01416015625, -0.00860595703125, 0.021728515625, ...

[ 3229, 61924, 71, 237, 3525, 50986, 19943, 25, 2203, 4153, 18, 33079, 2460, 929, 3358, 98064, 75930, 60457, 3371, 45757, 116071, 180842, 2661, 24927, 11809, 5, 154663, 10433, 62309, 67, 99091, 4382, 100019, 104105, 35746, 41766, 10644, 360, ...

[ 0.11083984375, 0.223388671875, 0.052825927734375, 0.053558349609375, 0.177734375, 0.326416015625, 0.286376953125, 0.1512451171875, 0.06396484375, 0.1121826171875, 0.1019287109375, 0.049346923828125, 0.106201171875, 0.2000732421875, 0.019866943359375, 0.107177734375, 0.07763671875, ...

embed

21328537_c0

21328537

haskell

0

Title: RequestBody is applied to too many type arguments Problem title: RequestBody is applied to too many type arguments Tags: http-conduit, haskell Problem: RequestBody is applied to too many type arguments What doesn't the following function doesn't typecheck: import qualified Control.Exception as E import Data.Cond...

RequestBody is applied to too many type arguments RequestBody is applied to too many type arguments http-conduit haskell Control.Exception E.SomeException qualified Data.Conduit Network.HTTP.Types Network.HTTP.Conduit RequestBody ResourceT Method Status Data.ByteString.Lazy.Char8 LBS Maybe Either Response LBS.ByteStrin...

[ 0.00799560546875, 0.043212890625, -0.0030517578125, -0.007476806640625, -0.01007080078125, 0.002685546875, 0.005035400390625, -0.017333984375, -0.0010833740234375, -0.0023651123046875, 0.003265380859375, -0.04345703125, -0.00531005859375, -0.01544189453125, -0.004180908203125, -0.00982...

[ 853, 75616, 12647, 1459, 190659, 47, 5792, 5941, 10644, 10750, 1621, 2271, 112061, 1556, 142508, 27131, 19279, 63928, 241, 217225, 11809, 28997, 23658, 5, 196707, 18544, 152055, 618, 74644, 56504, 71713, 2729, 3285, 84068, 1019, 20429, 83425, ...

[ 0.087890625, 0.17236328125, 0.161865234375, 0.1368408203125, 0.154052734375, 0.0703125, 0.140625, 0.141845703125, 0.23046875, 0.20703125, 0.10198974609375, 0.014617919921875, 0.1201171875, 0.1065673828125, 0.2181396484375, 0.19287109375, 0.002166748046875, 0.049652099609375, 0.02...

embed

45024640_c1

45024640

haskell

1

uzzy_fn(p_license_number VARCHAR) RETURNS TABLE (id INT ,license_number VARCHAR ,full_name TEXT ) AS $$ SELECT id, license_number, full_name FROM names WHERE license_number LIKE '%' || p_license_number || '%' $$ LANGUAGE sql; By 'fuzzy search', I mean it searches for any row with a licence number containing as a substr...

[ -0.01202392578125, -0.0252685546875, -0.00787353515625, 0.01177978515625, -0.0218505859375, 0.004058837890625, 0.034912109375, -0.0164794921875, 0.0037689208984375, -0.017822265625, 0.00860595703125, -0.012939453125, -0.00653076171875, 0.0079345703125, -0.0247802734375, 0.0116577148437...

[ 958, 3285, 14783, 254, 150, 147881, 2606, 1297, 310, 169243, 11909, 9069, 56943, 384, 183057, 532, 59537, 25724, 11627, 13018, 70981, 1388, 6483, 4369, 6755, 144832, 3447, 86872, 4393, 563, 61607, 123055, 339, 57692, 3949, 25, 915, 454, 335...

[ 0.096435546875, 0.234130859375, 0.1600341796875, 0.0679931640625, 0.073974609375, 0.1583251953125, 0.1182861328125, 0.06988525390625, 0.04803466796875, 0.038330078125, 0.09814453125, 0.0265045166015625, 0.106201171875, 0.087890625, 0.13037109375, 0.011260986328125, 0.0565185546875, ...

embed

31090228_c0

31090228

haskell

0

Title: Is it correct to use the Reader monad in this turn-based game? Problem title: Is it correct to use the Reader monad in this turn-based game? Tags: monads, haskell Problem: Is it correct to use the Reader monad in this turn-based game? I need to learn to use the Reader monad. (And also the Writer and State). The ...

Is it correct to use the Reader monad in this turn-based game? Is it correct to use the Reader monad in this turn-based game? monads haskell Reader Game AllNeeded StrategicPositions AndGameRelatedStuffs Turn PlayersPositions AndTurnDependentStuffs Is it correct to use the Reader monad in this turn-based game? I need to...

[ -0.021728515625, 0.004974365234375, 0.0167236328125, -0.00689697265625, -0.01019287109375, -0.0096435546875, -0.005645751953125, -0.007537841796875, -0.0098876953125, -0.041015625, 0.00457763671875, 0.0223388671875, -0.0047607421875, 0.0024871826171875, -0.01080322265625, -0.0185546875...

[ 26785, 4527, 70, 122636, 2667, 712, 23, 903, 15504, 77007, 6712, 7, 1556, 142508, 13547, 3164, 6433, 297, 37008, 7192, 172, 107576, 21493, 41961, 60560, 42671, 26885, 30698, 2783, 136, 22836, 6954, 11343, 58055, 7964, 171859, 35604, 87420, ...

[ 0.1845703125, 0.1212158203125, 0.028289794921875, 0.291015625, 0.1424560546875, 0.1854248046875, 0.031341552734375, 0.0841064453125, 0.1575927734375, 0.1507568359375, 0.11279296875, 0.055572509765625, 0.1083984375, 0.220947265625, 0.111083984375, 0.012908935546875, 0.07781982421875, ...

embed

51069951_c0

51069951

haskell

0

Title: Using closed type families to write functions "if type A, then X, else type Y" Problem title: Using closed type families to write functions "if type A, then X, else type Y" Tags: haskell Problem: Using closed type families to write functions "if type A, then X, else type Y" I want to define a...

Using closed type families to write functions "if type A, then X, else type Y" Using closed type families to write functions "if type A, then X, else type Y" haskell Using IORef Ptr Specialized Foo Bar Baz Using closed type families to write functions "if type A, then X, else type Y" I want to defin...

[ 0.00787353515625, -0.0067138671875, 0.000804901123046875, -0.00799560546875, -0.0023956298828125, -0.00872802734375, -0.0177001953125, 0.011962890625, 0.0025482177734375, 0.0390625, -0.0118408203125, -0.0225830078125, -0.0108642578125, 0.017333984375, 0.005096435546875, 0.0143432617187...

[ 345, 155738, 10644, 87143, 33022, 32354, 3190, 62, 7068, 1193, 37076, 990, 47, 1556, 142508, 6953, 123435, 4240, 436, 4448, 25132, 29367, 9572, 31, 3253, 36490, 3444, 61924, 5361, 208124, 3060, 52895, 4537, 756, 3789, 1286, 49846, 224343, 5...

[ 0.041107177734375, 0.2310791015625, 0.22119140625, 0.18896484375, 0.1669921875, 0.2080078125, 0.1888427734375, 0.1265869140625, 0.09710693359375, 0.09393310546875, 0.17333984375, 0.1466064453125, 0.00665283203125, 0.0970458984375, 0.211181640625, 0.007354736328125, 0.09130859375, 0...

embed

43233599_c1

43233599

haskell

1

type ‘(Label, Potential)’ • Possible cause: ‘fst’ is applied to too many arguments In the second argument of ‘(.)’, namely ‘fst x’ In the first argument of ‘VariableNode’, namely ‘(fst . fst x)’ In the first argument of ‘(:)’, namely ‘(VariableNode (fst . fst x) (snd . fst x) (snd x))’ Graph.hs:14:47: error: • Couldn'...

[ 0.0002346038818359375, 0.0130615234375, -0.0150146484375, 0.006011962890625, 0.00982666015625, 0.017578125, -0.032470703125, -0.00787353515625, 0.003753662109375, -0.0302734375, -0.014404296875, -0.031494140625, 0.0106201171875, -0.01171875, -0.004730224609375, -0.004852294921875, 0....

[ 10644, 2729, 4063, 229677, 768, 115861, 2661, 22304, 420, 271, 83, 190659, 47, 5792, 5941, 10750, 17932, 5, 1022, 5117, 81827, 14, 2886, 5021, 112, 1238, 132, 12, 2208, 6524, 127, 22635, 33573, 18499, 191147, 18, 14858, 11, 418, 33079, ...

[ 0.2259521484375, 0.089599609375, 0.2047119140625, 0.265625, 0.041168212890625, 0.1212158203125, 0.118408203125, 0.160888671875, 0.1043701171875, 0.1602783203125, 0.0086669921875, 0.14501953125, 0.047454833984375, 0.1363525390625, 0.154541015625, 0.2327880859375, 0.13525390625, 0.07...

embed

5709183_c1

5709183

haskell

1

-version-min=10.6 -framework Cocoa "/Users/rcl/TestXCodeProjects/FFI Test/FFI Test/ForeignExportCost.a" -o "/Users/rcl/TestXCodeProjects/FFI Test/build/Debug/FFI Test.app/ Contents/MacOS/FFI Test" Undefined symbols for architecture i386: "_hs_init", referenced from: -[FFI_TestAppDelegate applicationDidFinishLaunching:]...

[ 0.0157470703125, 0.0167236328125, -0.0181884765625, 0.00238037109375, -0.004852294921875, -0.01953125, 0.0184326171875, 0.0005950927734375, 0.00299072265625, -0.0142822265625, 0.00069427490234375, -0.0498046875, 0.0025634765625, 0.0159912109375, 0.00506591796875, -0.029296875, 0.0156...

[ 46354, 1249, 122887, 160328, 18244, 80573, 11, 1062, 7, 34937, 111337, 1542, 114211, 223353, 30110, 568, 8647, 18537, 38529, 19279, 6982, 441, 5510, 31, 177149, 4657, 85779, 9007, 70870, 55450, 7285, 79912, 5983, 26582, 159958, 17, 105742, 45...

[ 0.07379150390625, 0.1788330078125, 0.16064453125, 0.078857421875, 0.01812744140625, 0.1800537109375, 0.135986328125, 0.003631591796875, 0.01824951171875, 0.06207275390625, 0.116455078125, 0.056884765625, 0.173828125, 0.0732421875, 0.1220703125, 0.119384765625, 0.1727294921875, 0.07...

embed

12906937_c1

12906937

haskell

1

,j) mat)) fim (decrementaPosicao (i,j) mat) else 0 matrizFinal:: Pos->Pos->Matrix matrizFinal (m,n) p = [[if (y,x)==p then 1 else 0 | x<-[1..n]]| y<-[1..m]] movimentos::Pos->[Pos] movimentos (i,j)= [(i+1,j),(i+2,j),(i-1,j),(i-2,j),(i,j+1),(i,j+2),(i,j-1),(i,j-2)] decrementaPosicao:: Pos->Matrix->Matrix decrementaPosica...

[ 0.003753662109375, 0.031494140625, 0.00045013427734375, 0.00115203857421875, 0.00823974609375, -0.01287841796875, -0.00921630859375, 0.0059814453125, 0.035400390625, -0.0072021484375, -0.006195068359375, 0.002105712890625, 0.0240478515625, -0.006103515625, -0.0206298828125, -0.00090408...

[ 6, 4, 170, 2589, 16, 20342, 112, 7612, 32125, 7192, 172, 123142, 14, 37076, 757, 50944, 169, 6159, 6236, 13498, 7, 4613, 87427, 39, 19, 915, 3190, 53, 425, 254, 106, 1022, 113, 39712, 21748, 54651, 5759, 5428, 110218, 10461, 8, 238, ...

[ 0.022613525390625, 0.04510498046875, 0.17578125, 0.1986083984375, 0.04559326171875, 0.167236328125, 0.162841796875, 0.1964111328125, 0.1632080078125, 0.08306884765625, 0.142333984375, 0.1556396484375, 0.0877685546875, 0.0548095703125, 0.09454345703125, 0.1536865234375, 0.048675537109...

embed

42983879_c0

42983879

haskell

0

Title: Sum Of Two Squares: Where's My Error? Problem title: Sum Of Two Squares: Where's My Error? Tags: number-theory, haskell, algorithm Problem: Sum Of Two Squares: Where's My Error? I'm trying to calculate the number of ways to write a natural number as the sum of two squares. I'm working from the definiti...

Sum Of Two Squares: Where's My Error? Sum Of Two Squares: Where's My Error? number-theory haskell algorithm Sum Two Squares Where Error Integer d1_test d3_test Bool Main Numbers.SumOfSquares Sum Of Two Squares: Where's My Error? I'm trying to calculate the number of ways to write a natural number as the sum o...

[ -0.0027618408203125, -0.000934600830078125, 0.000827789306640625, -0.006195068359375, -0.0050048828125, -0.016357421875, -0.02685546875, 0.00799560546875, 0.01153564453125, -0.01287841796875, 0.00921630859375, -0.018310546875, 0.015869140625, 0.0019073486328125, 0.0021209716796875, 0.0...

[ 36335, 6619, 32964, 68305, 7, 78662, 3768, 2646, 212059, 14012, 2347, 1556, 142508, 234873, 44401, 104, 418, 6954, 363, 2460, 929, 12321, 103332, 316, 132887, 94727, 12, 31577, 74481, 48322, 33022, 6083, 237, 10554, 111, 6626, 108047, 20697, ...

[ 0.25146484375, 0.181396484375, 0.23974609375, 0.2154541015625, 0.037109375, 0.1580810546875, 0.09051513671875, 0.143310546875, 0.2744140625, 0.146728515625, 0.02166748046875, 0.1007080078125, 0.21142578125, 0.128173828125, 0.1695556640625, 0.07147216796875, 0.0751953125, 0.12622070...

embed

79209073_c0

79209073

haskell

0

Title: Stack tried to find libgmp then failed, even with no dependencies at all Problem title: Stack tried to find libgmp then failed, even with no dependencies at all Tags: nix, gmp, nix-darwin, haskell, haskell-stack Problem: Stack tried to find libgmp then failed, even with no dependencies at all I use nix-darwin an...

Stack tried to find libgmp then failed, even with no dependencies at all Stack tried to find libgmp then failed, even with no dependencies at all nix gmp nix-darwin haskell haskell-stack Stack config.yaml Library lac8fhiz0pmif1bmrkkry3w4slc9wg47-gmp-with-cxx-6.3.0 libgmp.10.dylib Referenced A379-2BC393A601C5 Users aarc...

[ -0.0198974609375, 0.01324462890625, -0.00872802734375, 0.0111083984375, -0.00024127960205078125, 0.011474609375, 0.00469970703125, -0.006378173828125, 0.00732421875, -0.01251220703125, 0.000545501708984375, -0.007720947265625, 0.00885009765625, 0.0052490234375, 0.00689697265625, 0.0025...

[ 6512, 2594, 37842, 7413, 25474, 177, 2676, 165523, 110, 42548, 117538, 678, 300, 425, 706, 9494, 1556, 142508, 590, 153837, 14520, 141, 103835, 76228, 52219, 13545, 132265, 10179, 1459, 5612, 141520, 128877, 139024, 53400, 59438, 13307, 232, ...

[ 0.183837890625, 0.15771484375, 0.0216827392578125, 0.1375732421875, 0.12744140625, 0.0880126953125, 0.2496337890625, 0.147216796875, 0.049041748046875, 0.15478515625, 0.058837890625, 0.0089111328125, 0.104248046875, 0.13525390625, 0.0928955078125, 0.16650390625, 0.117919921875, 0.1...

embed

69686123_c0

69686123

haskell

0

Title: Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number Problem title: Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number Tags: haskell, recursion, pattern-matching Problem: Functi...

Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number Function that returns a list of strings, if the strings' paired number is smaller than the parameter's number haskell recursion pattern-matching Hungary Japan Iceland United States Mongolia ...

[ -0.00897216796875, -0.00244140625, 0.0130615234375, 0.0159912109375, -0.01190185546875, 0.011962890625, 0.01324462890625, -0.00157928466796875, 0.00836181640625, 0.025634765625, 0.03515625, -0.0279541015625, 0.0026397705078125, -0.0201416015625, 0.01226806640625, -0.0159912109375, 0....

[ 28670, 10763, 30646, 5303, 79315, 7, 2174, 3768, 80836, 297, 14012, 83, 164917, 3501, 171859, 450, 111, 1556, 142508, 195625, 1830, 103510, 98753, 175055, 15758, 114749, 14098, 46684, 187434, 3775, 3355, 18391, 4935, 2060, 37842, 130078, 22027,...

[ 0.1605224609375, 0.0963134765625, 0.18798828125, 0.1767578125, 0.232421875, 0.0230255126953125, 0.1085205078125, 0.0931396484375, 0.20751953125, 0.07879638671875, 0.13037109375, 0.04876708984375, 0.203369140625, 0.1138916015625, 0.2149658203125, 0.0147857666015625, 0.024169921875, ...

embed

54470002_c1

54470002

haskell

1

't visible from the type of foo or a and GHC can't unify them, because it has nothing that guarantees that b and b0 are really always exactly the same and this is not such an unexpected error when working with ambiguous types. Normally when I encounter such errors, I'm able to solve them using TypeApplications and Scop...

[ 0.01123046875, -0.0005340576171875, -0.00138092041015625, 0.004180908203125, 0.00836181640625, -0.0024871826171875, -0.00872802734375, 0.00927734375, -0.000732421875, 0.004486083984375, -0.005340576171875, 0.00494384765625, 0.0125732421875, 0.0184326171875, -0.010498046875, -0.05273437...

[ 18, 75693, 1295, 10644, 5775, 31, 10, 136, 527, 73265, 831, 51, 40383, 2856, 33720, 142027, 876, 2389, 6183, 11343, 66161, 5701, 241957, 18499, 20697, 920, 12282, 10821, 52895, 28723, 190647, 86869, 60457, 47677, 182867, 182783, 297, 196707, ...

[ 0.083740234375, 0.25048828125, 0.04437255859375, 0.1558837890625, 0.16162109375, 0.1307373046875, 0.08905029296875, 0.0267486572265625, 0.06915283203125, 0.1727294921875, 0.051513671875, 0.1375732421875, 0.1566162109375, 0.033203125, 0.04669189453125, 0.0911865234375, 0.1363525390625...

embed

14825543_c0

14825543

haskell

0

Title: What does the double-backslash \\ mean in Haskell? Problem title: What does the double-backslash \\ mean in Haskell? Tags: haskell, syntax Problem: What does the double-backslash \\ mean in Haskell? I'm trying to figure out what \\ means in Haskell? I've got a program that runs perfectly when compiled, implying ...

What does the double-backslash \\ mean in Haskell? What does the double-backslash \\ mean in Haskell? haskell syntax Data.List What Haskell Main Number Integer Run Bool What does the double-backslash \\ mean in Haskell? I'm trying to figure out what \\ means in Haskell? I've got a program that runs perfectly when compi...

[ 0.0106201171875, 0.0201416015625, 0.0274658203125, 0.0078125, -0.003265380859375, 0.0250244140625, -0.00994873046875, -0.005584716796875, 0.0184326171875, -0.01806640625, 0.010009765625, 0.00384521484375, -0.004669189453125, -0.0145263671875, -0.019287109375, 0.002410888671875, 0.012...

[ 4865, 14602, 70, 41929, 12620, 7, 5544, 18991, 29459, 23, 20625, 142508, 1556, 6002, 86531, 11809, 154663, 12321, 103332, 44401, 28398, 2460, 929, 9, 31577, 26366, 2367, 26950, 1528, 127877, 169123, 375, 5974, 21980, 83, 88303, 73, 32354, 9...

[ 0.0872802734375, 0.08056640625, 0.043914794921875, 0.202880859375, 0.197998046875, 0.06591796875, 0.2177734375, 0.26708984375, 0.1817626953125, 0.115966796875, 0.1610107421875, 0.26513671875, 0.1353759765625, 0.03515625, 0.060577392578125, 0.058837890625, 0.09765625, 0.114624023437...

embed

19215851_c0

19215851

haskell

0

Title: Haskell - Return item from custom type Problem title: Haskell - Return item from custom type Tags: haskell, types Problem: Haskell - Return item from custom type I'm working on a Haskell problem for a class, and I can't seem to get the syntax right for pulling an item out of a custom type. Here's the type: -- Fi...

Haskell - Return item from custom type Haskell - Return item from custom type haskell types custom Haskell Finite State Machine FSM Char Couldn t10 t20 t30 Expected Actual Haskell - Return item from custom type I'm working on a Haskell problem for a class, and I can't seem to get the syntax right for pulling an item ou...

[ -0.0189208984375, -0.0091552734375, 0.005340576171875, 0.012939453125, -0.00439453125, 0.00982666015625, -0.01318359375, -0.00360107421875, -0.0133056640625, -0.0020751953125, 0.028076171875, -0.0220947265625, -0.0152587890625, -0.0032958984375, -0.01470947265625, -0.0030059814453125, ...

[ 20625, 142508, 173340, 35735, 1295, 114122, 10644, 20, 1556, 52895, 13316, 1486, 22836, 68311, 563, 18148, 21656, 191147, 808, 963, 1549, 1197, 60075, 13, 100582, 20697, 2967, 18507, 6002, 86531, 7108, 50065, 1810, 3034, 34292, 3444, 19048, 1...

[ 0.1392822265625, 0.23291015625, 0.2208251953125, 0.1737060546875, 0.1007080078125, 0.1993408203125, 0.2110595703125, 0.0010986328125, 0.12158203125, 0.1851806640625, 0.108642578125, 0.04547119140625, 0.0823974609375, 0.085693359375, 0.08685302734375, 0.185791015625, 0.1451416015625, ...

embed

16383396_c0

16383396

haskell

0

Title: How to replace more than one element at the same time in a String (Haskell) Problem title: How to replace more than one element at the same time in a String (Haskell) Tags: string, replace, haskell, list Problem: How to replace more than one element at the same time in a String (Haskell) i want to take 2 lists f...

How to replace more than one element at the same time in a String (Haskell) How to replace more than one element at the same time in a String (Haskell) string replace haskell list How Haskell Hou House Mouse Mou Bird How to replace more than one element at the same time in a String (Haskell) i want to take 2 lists for ...

[ -0.00677490234375, -0.00811767578125, -0.01055908203125, 0.033447265625, -0.00921630859375, 0.0091552734375, -0.004547119140625, -0.00958251953125, 0.024658203125, 0.0089111328125, 0.0155029296875, -0.00811767578125, 0.0167236328125, -0.02294921875, 0.004638671875, -0.0030059814453125,...

[ 11249, 47, 91995, 1286, 3501, 1632, 12830, 5701, 1733, 23351, 214, 6495, 7, 142508, 23, 79315, 1556, 5303, 20625, 45471, 13038, 174799, 45709, 72607, 3444, 5646, 116, 27781, 1884, 903, 8337, 7986, 450, 13538, 7077, 5608, 30646, 18, 4488, ...

[ 0.07550048828125, 0.0618896484375, 0.198486328125, 0.1927490234375, 0.1805419921875, 0.1427001953125, 0.200927734375, 0.11865234375, 0.1556396484375, 0.1900634765625, 0.1290283203125, 0.08331298828125, 0.0694580078125, 0.2108154296875, 0.05218505859375, 0.194580078125, 0.117919921875...

embed

26763855_c0

26763855

haskell

0

Title: HXT ignoring HTML DTD, replacing it with XML DTD Problem title: HXT ignoring HTML DTD, replacing it with XML DTD Tags: hxt, doctype, haskell Problem: HXT ignoring HTML DTD, replacing it with XML DTD I'm having a bit of trouble figuring out why HXT is replacing my DTD's. Firstly, here is my input file to be parse...

HXT ignoring HTML DTD, replacing it with XML DTD HXT ignoring HTML DTD, replacing it with XML DTD hxt doctype haskell HXT HTML DTD XML DOCTYPE US-ASCII App UTF-8 HXT ignoring HTML DTD, replacing it with XML DTD I'm having a bit of trouble figuring out why HXT is replacing my DTD's. Firstly, here is my input file to be ...

[ 0.00238037109375, 0.0247802734375, -0.0047607421875, -0.01165771484375, 0.00811767578125, -0.008544921875, -0.005401611328125, -0.0113525390625, -0.006195068359375, 0.004638671875, 0.003204345703125, -0.009033203125, -0.0277099609375, -0.0032806396484375, -0.01507568359375, -0.00503540...

[ 572, 70981, 47438, 19097, 391, 100045, 456, 133266, 92537, 678, 1096, 29062, 51584, 50986, 1556, 142508, 120959, 27143, 7082, 134165, 568, 5659, 30992, 17376, 4785, 63134, 26747, 15400, 759, 107730, 11435, 366, 5281, 140992, 112892, 11389, 1182...

[ 0.1380615234375, 0.275390625, 0.1590576171875, 0.2403564453125, 0.07421875, 0.24560546875, 0.040924072265625, 0.1224365234375, 0.2261962890625, 0.065673828125, 0.06842041015625, 0.250244140625, 0.122802734375, 0.2120361328125, 0.10986328125, 0.1845703125, 0.10748291015625, 0.142822...

embed

26948201_c0

26948201

haskell

0

Title: Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type Problem title: Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type Tags: ghci, haskell Problem: Infinite Square Roots : Couldn't match expected type & cannot construct...

Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type Infinite Square Roots : Couldn't match expected type & cannot construct the infinite type ghci haskell infisqrt xs Infinite Square Roots Couldn Float isq.hs:1:24 Relevant isq.hs:1:1 isq.hs:5:33 Occurs isq.hs:5:13...

[ 0.00860595703125, -0.003448486328125, -0.0037078857421875, -0.00396728515625, -0.004486083984375, -0.01177978515625, 0.0093994140625, 0.0010833740234375, -0.0028228759765625, -0.0257568359375, 0.0205078125, -0.013671875, 0.00994873046875, -0.01104736328125, -0.01104736328125, 0.0095825...

[ 134322, 13, 68305, 150948, 7, 191147, 3768, 18, 14858, 84751, 10644, 25133, 53418, 64549, 54241, 31380, 318, 1556, 142508, 23, 31916, 3198, 1022, 38699, 83, 864, 127, 25732, 133, 19721, 758, 31191, 48650, 22618, 19993, 619, 68649, 20625, 31...

[ 0.1627197265625, 0.08837890625, 0.132080078125, 0.2254638671875, 0.011260986328125, 0.090087890625, 0.0792236328125, 0.0924072265625, 0.1473388671875, 0.126220703125, 0.153564453125, 0.004547119140625, 0.1177978515625, 0.12255859375, 0.148681640625, 0.038360595703125, 0.062255859375,...

embed

28386117_c0

28386117

haskell

0

Title: XMonad: how to bind Super (Win key) + Space to keyboard layout switch? Problem title: XMonad: how to bind Super (Win key) + Space to keyboard layout switch? Tags: emacs, haskell, key-bindings, xmonad, keyboard-layout Problem: XMonad: how to bind Super (Win key) + Space to keyboard layout switch? I used to switch...

XMonad: how to bind Super (Win key) + Space to keyboard layout switch? XMonad: how to bind Super (Win key) + Space to keyboard layout switch? emacs haskell key-bindings xmonad keyboard-layout XMonad Super Win Space XMonad: how to bind Super (Win key) + Space to keyboard layout switch? I used to switch keyboard layout p...

[ -0.025146484375, 0.0186767578125, -0.00897216796875, -0.004302978515625, -0.0003299713134765625, 0.0021209716796875, 0.01080322265625, -0.004058837890625, 0.01141357421875, 0.01080322265625, 0.040771484375, 0.0191650390625, -0.005523681640625, -0.00360107421875, -0.0250244140625, 0.008...

[ 1193, 46674, 712, 3642, 68557, 4265, 92049, 22799, 997, 43045, 47, 149186, 108802, 101089, 352, 2263, 7, 1556, 142508, 128239, 1022, 3796, 5259, 17686, 24234, 244749, 19916, 32628, 1299, 3773, 382, 247452, 11787, 29908, 171332, 237, 24367, 12...

[ 0.10162353515625, 0.177978515625, 0.18017578125, 0.0780029296875, 0.2386474609375, 0.2142333984375, 0.181640625, 0.2127685546875, 0.13232421875, 0.280517578125, 0.1138916015625, 0.210693359375, 0.2291259765625, 0.219482421875, 0.0338134765625, 0.0625, 0.031341552734375, 0.032348632...

embed

45523507_c0

45523507

haskell

0

Title: Haskell: last digit of a very large number Problem title: Haskell: last digit of a very large number Tags: haskell Problem: Haskell: last digit of a very large number I'm trying to work out the last digit of a very large number. The challenge is that I'm getting the error *** Exception: Prelude.!!: negative inde...

Haskell: last digit of a very large number Haskell: last digit of a very large number haskell Haskell Exception Prelude Integer x:y:ys y:ys foldr1 Haskell: last digit of a very large number I'm trying to work out the last digit of a very large number. The challenge is that I'm getting the error which I don't think shou...

[ -0.013916015625, 0.023681640625, 0.0027008056640625, -0.0145263671875, -0.005615234375, -0.0084228515625, -0.0009918212890625, 0.0024871826171875, 0.01031494140625, -0.03076171875, 0.0169677734375, -0.019287109375, -0.01422119140625, 0.0011749267578125, 0.003173828125, -0.0191650390625...

[ 20625, 142508, 4568, 153939, 111, 4552, 21334, 14012, 1556, 5443, 63928, 1914, 822, 44401, 1022, 12, 53, 4778, 113, 18344, 7569, 418, 31577, 4488, 1810, 66801, 20949, 18499, 18, 5351, 5608, 7722, 96276, 9790, 759, 18151, 35509, 162076, 1369...

[ 0.1630859375, 0.261962890625, 0.263427734375, 0.2486572265625, 0.0946044921875, 0.156982421875, 0.14990234375, 0.14453125, 0.1531982421875, 0.045654296875, 0.1563720703125, 0.0750732421875, 0.161376953125, 0.1583251953125, 0.072998046875, 0.08013916015625, 0.108642578125, 0.1726074...

embed

24432341_c0

24432341

haskell

0

Title: Preserving comments in `Text.Parsec.Token` tokenizers Problem title: Preserving comments in `Text.Parsec.Token` tokenizers Tags: comments, haskell, parsec, parsing, code-translation Problem: Preserving comments in `Text.Parsec.Token` tokenizers I'm writing a source-to-source transformation using parsec , So I ha...

Preserving comments in `Text.Parsec.Token` tokenizers Preserving comments in `Text.Parsec.Token` tokenizers comments haskell parsec parsing code-translation Preserving Text.Parsec.Token LanguageDef TokenParser Text.Parsec.Token.makeTokenParser Preserving comments in `Text.Parsec.Token` tokenizers I'm writing a source-t...

[ 0.01385498046875, 0.0294189453125, -0.00396728515625, 0.0242919921875, -0.00885009765625, 0.01904296875, 0.006561279296875, -0.0006561279296875, 0.004241943359375, -0.029052734375, -0.0021209716796875, 0.040771484375, 0.0024261474609375, -0.010986328125, -0.017822265625, 0.011901855468...

[ 20703, 56, 24626, 23, 174379, 28636, 39797, 7763, 1098, 47, 52825, 1556, 142508, 366, 18151, 30145, 24129, 83658, 187423, 717, 2189, 55898, 31344, 188, 60427, 167201, 46876, 45367, 61924, 6868, 126597, 136, 152378, 12638, 22321, 22230, 75675, ...

[ 0.0792236328125, 0.116943359375, 0.2431640625, 0.00836181640625, 0.1590576171875, 0.12841796875, 0.16162109375, 0.0845947265625, 0.1678466796875, 0.07708740234375, 0.134033203125, 0.0263519287109375, 0.146484375, 0.1051025390625, 0.06640625, 0.03387451171875, 0.1383056640625, 0.116...

embed

50083476_c0

50083476

haskell

0

Title: Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns Problem title: Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns Tags: haskell, list, recursion Problem: Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns i try to write a function [int] -...

Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns Haskell Beginner, recursive function, list, Error: Non-exhaustive patterns haskell list recursion Haskell Beginner Error Non-exhaustive uebung1.lhs:20:2 Wincomplete-patterns Pattern Patterns _:_:_ Main Exception uebung1.lhs Haskell Beginner, rec...

[ -0.0157470703125, 0.01287841796875, 0.00616455078125, 0.006744384765625, -0.0113525390625, -0.0023040771484375, -0.008056640625, 0.0198974609375, 0.00982666015625, -0.0057373046875, 0.0084228515625, -0.022216796875, 0.014404296875, 0.00897216796875, 0.023193359375, 0.0167236328125, 0...

[ 20625, 142508, 67053, 56, 195625, 5844, 32354, 5303, 212059, 3775, 18391, 4935, 103510, 1556, 75, 21463, 79366, 16619, 17686, 277, 131801, 4453, 22766, 9876, 12321, 5443, 63928, 418, 3355, 17, 9790, 33022, 4288, 23, 18, 54529, 10554, 892, 2...

[ 0.1253662109375, 0.2362060546875, 0.1177978515625, 0.07208251953125, 0.1727294921875, 0.073974609375, 0.1383056640625, 0.1407470703125, 0.1785888671875, 0.140380859375, 0.124267578125, 0.060028076171875, 0.1885986328125, 0.0819091796875, 0.0279083251953125, 0.16259765625, 0.096435546...

embed

50672527_c0

50672527

haskell

0

Title: Haskell Servant: GET Requests with arbitrary request data Problem title: Haskell Servant: GET Requests with arbitrary request data Tags: servant, haskell, haskell-snap-framework Problem: Haskell Servant: GET Requests with arbitrary request data I'm serving an API using Servant, all managed by Snap. In Servant, i...

Haskell Servant: GET Requests with arbitrary request data Haskell Servant: GET Requests with arbitrary request data servant haskell haskell-snap-framework Haskell Servant GET Requests FromJSON ReqBody JSON RequestData Post ResponseData QueryParam FromHttpApiData Haskell Servant: GET Requests with arbitrary request data...

[ -0.0037078857421875, 0.033935546875, 0.01495361328125, -0.007415771484375, -0.0140380859375, 0.00262451171875, -0.0057373046875, -0.004791259765625, -0.0126953125, -0.041748046875, 0.01171875, -0.032470703125, -0.036376953125, -0.00537109375, -0.0185546875, 0.01397705078125, -0.00399...

[ 20625, 142508, 5406, 30624, 79794, 853, 75616, 678, 61799, 1294, 50336, 2053, 187646, 1556, 10957, 160328, 18244, 28090, 1375, 58627, 864, 12647, 1459, 821, 137989, 2795, 92748, 58836, 55292, 3062, 1434, 520, 61687, 145755, 121190, 23468, 26698...

[ 0.1519775390625, 0.2264404296875, 0.1934814453125, 0.24169921875, 0.1947021484375, 0.091552734375, 0.2222900390625, 0.09783935546875, 0.195556640625, 0.11767578125, 0.22509765625, 0.156005859375, 0.22314453125, 0.10760498046875, 0.1529541015625, 0.1058349609375, 0.007537841796875, ...

embed

20872825_c0

20872825

haskell

0

Title: Trying to render fields in threepenny-gui with special behaviour Problem title: Trying to render fields in threepenny-gui with special behaviour Tags: threepenny-gui, haskell, user-interface Problem: Trying to render fields in threepenny-gui with special behaviour What I want to do is set up fields which show de...

Trying to render fields in threepenny-gui with special behaviour Trying to render fields in threepenny-gui with special behaviour threepenny-gui haskell user-interface Trying Map Element UI.input UI.blur UI.value UI.focus Trying to render fields in threepenny-gui with special behaviour What I want to do is set up field...

[ -0.037353515625, -0.01263427734375, -0.006072998046875, -0.0220947265625, 0.0018310546875, -0.004302978515625, 0.01904296875, -0.014404296875, 0.0089111328125, -0.005828857421875, 0.006500244140625, 0.0264892578125, -0.0020599365234375, 0.0059814453125, 0.0048828125, -0.004638671875, ...

[ 40858, 89159, 44457, 17262, 2278, 299, 17086, 5361, 224833, 7, 23, 1556, 142508, 38937, 10433, 42719, 48325, 111481, 47491, 42, 27494, 3584, 11680, 3444, 54, 5423, 1257, 7639, 22443, 3229, 32153, 1284, 177074, 1836, 959, 10, 388, 90, 3794, ...

[ 0.1077880859375, 0.2017822265625, 0.214111328125, 0.182373046875, 0.17431640625, 0.1898193359375, 0.201904296875, 0.1485595703125, 0.1861572265625, 0.0237884521484375, 0.03997802734375, 0.08935546875, 0.2091064453125, 0.05987548828125, 0.036041259765625, 0.1639404296875, 0.1247558593...

embed

44976769_c0

44976769

haskell

0

Title: I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong Problem title: I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong Tags: haskell Prob...

I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong I'm getting Haskell "parse error (possibly incorrect indentation or mismatched brackets)" and I cannot see what's wrong haskell Haskell Name Test f_name t:ts o:...

[ 0.0091552734375, -0.00799560546875, -0.01300048828125, 0.00927734375, 0.00726318359375, 0.01019287109375, -0.00927734375, -0.0062255859375, 0.007232666015625, 0.001007080078125, 0.01312255859375, -0.004364013671875, 0.000743865966796875, -0.015869140625, 0.0087890625, 0.000812530517578...

[ 3768, 20625, 142508, 2500, 184, 18499, 7522, 172, 214552, 18597, 22062, 707, 1239, 98753, 1620, 27853, 53418, 1957, 44691, 2367, 1556, 15757, 8647, 1238, 11627, 808, 933, 36, 232, 2970, 142484, 190355, 53400, 141423, 123254, 43731, 105376, 56...

[ 0.04644775390625, 0.1405029296875, 0.2249755859375, 0.1466064453125, 0.1141357421875, 0.1624755859375, 0.09912109375, 0.0860595703125, 0.1533203125, 0.17333984375, 0.1107177734375, 0.0703125, 0.10394287109375, 0.2340087890625, 0.1595458984375, 0.1885986328125, 0.0966796875, 0.11401...

embed

24376521_c1

24376521

haskell

1

.b. I've tried using Traversable.mapAccumL and Vector.unfoldrN instead of State and they end up being about the same speed and clarity. It's still a very overcomplicated way of solving this problem. import Criterion.Config import Criterion.Main import Control.DeepSeq import Control.Monad.State import Data.Maybe import ...

[ -0.025634765625, 0.004669189453125, -0.0029449462890625, -0.006011962890625, 0.01214599609375, 0.01397705078125, 0.00054931640625, -0.0028228759765625, 0.00482177734375, -0.0233154296875, 0.01220703125, 0.040283203125, -0.005859375, 0.0233154296875, 0.012939453125, 0.00701904296875, ...

[ 6, 5, 275, 37842, 17368, 4937, 7864, 2886, 62346, 10591, 866, 2609, 18770, 309, 42822, 839, 64457, 22836, 1836, 3564, 8035, 1672, 5701, 38352, 136, 17306, 2481, 7464, 4552, 645, 52721, 3115, 6496, 903, 2967, 24927, 26315, 720, 1830, 83671...

[ 0.033233642578125, 0.12060546875, 0.05523681640625, 0.05889892578125, 0.054107666015625, 0.1099853515625, 0.1754150390625, 0.19775390625, 0.1199951171875, 0.1802978515625, 0.115478515625, 0.178955078125, 0.2186279296875, 0.0850830078125, 0.173095703125, 0.105224609375, 0.082763671875...

embed

73158909_c0

73158909

haskell

0

Title: Elegant way to access the value of a record in haskell which is inside a monad Problem title: Elegant way to access the value of a record in haskell which is inside a monad Tags: pointfree, record, monads, haskell, functional-programming Problem: Elegant way to access the value of a record in haskell which is in...

Elegant way to access the value of a record in haskell which is inside a monad Elegant way to access the value of a record in haskell which is inside a monad pointfree record monads haskell functional-programming Elegant MonadIO Wave Elegant way to access the value of a record in haskell which is inside a monad General...

[ -0.0118408203125, -0.01043701171875, -0.0038299560546875, -0.006744384765625, 0.0033111572265625, 0.0028076171875, 0.00848388671875, -0.00848388671875, 0.0162353515625, -0.0284423828125, 0.025390625, -0.00750732421875, -0.003509521484375, -0.038818359375, -0.00445556640625, -0.01147460...

[ 161231, 3917, 17203, 34292, 17164, 1556, 142508, 46132, 2667, 712, 23, 6275, 32087, 123309, 28966, 60331, 71, 17780, 148529, 10, 43581, 2967, 32354, 10644, 80934, 1238, 347, 33079, 335, 114122, 2053, 50986, 97, 3642, 831, 32786, 6044, 237, ...

[ 0.261962890625, 0.07513427734375, 0.21142578125, 0.196533203125, 0.2083740234375, 0.1402587890625, 0.26953125, 0.1693115234375, 0.1427001953125, 0.2010498046875, 0.043670654296875, 0.0855712890625, 0.19140625, 0.1331787109375, 0.08251953125, 0.161865234375, 0.11962890625, 0.2292480...

embed

48269226_c0

48269226

haskell

0

Title: Unified interface for pure and constrained monadic functions Problem title: Unified interface for pure and constrained monadic functions Tags: polymorphism, overloading, typeclass, haskell Problem: Unified interface for pure and constrained monadic functions I want to create overloaded function by x type variabl...

Unified interface for pure and constrained monadic functions Unified interface for pure and constrained monadic functions polymorphism overloading typeclass haskell Unified MonadThrow MyClasss MonadConstraint Constraint Identity MyClass Illegal Text Reason Un-determined Unified interface for pure and constrained monadi...

[ -0.01251220703125, 0.0196533203125, 0.02734375, 0.005218505859375, 0.0267333984375, 0.009033203125, 0.0006256103515625, -0.000255584716796875, 0.01025390625, -0.0189208984375, -0.00194549560546875, -0.035400390625, -0.001495361328125, -0.01171875, 0.006561279296875, -0.021240234375, ...

[ 992, 47314, 101758, 34166, 136, 158, 9297, 2667, 11, 18403, 32354, 100, 35874, 178851, 8780, 645, 63033, 10644, 67413, 1556, 142508, 60331, 71, 15555, 2646, 140803, 2816, 71257, 891, 86966, 24129, 236267, 112, 30524, 122009, 3444, 28282, 297,...

[ 0.127197265625, 0.187255859375, 0.2156982421875, 0.1199951171875, 0.05792236328125, 0.04144287109375, 0.136474609375, 0.109619140625, 0.052734375, 0.057525634765625, 0.182861328125, 0.011444091796875, 0.09613037109375, 0.1787109375, 0.026275634765625, 0.117919921875, 0.2125244140625,...

embed

31226073_c0

31226073

haskell

0

Title: Using cubes in postgresql-simple results in error of "syntax error in multi-row template" Problem title: Using cubes in postgresql-simple results in error of "syntax error in multi-row template" Tags: postgresql, haskell, cube Problem: Using cubes in postgresql-simple results in error of "syn...

Using cubes in postgresql-simple results in error of "syntax error in multi-row template" Using cubes in postgresql-simple results in error of "syntax error in multi-row template" postgresql haskell cube Using SELECT WHERE ORDER cube_distance ASC INSERT INTO VALUES Float mapM_ Cube Using cubes in po...

[ 0.0111083984375, -0.0026702880859375, -0.01312255859375, 0.01153564453125, 0.002197265625, 0.00439453125, -0.0022735595703125, -0.022216796875, 0.0224609375, -0.0244140625, 0.0240478515625, -0.03955078125, -0.002655029296875, -0.0198974609375, -0.02978515625, 0.0030059814453125, -0.0...

[ 345, 314, 7438, 1305, 17562, 99247, 191560, 18499, 12654, 86531, 6024, 15555, 110934, 1556, 142508, 372, 6755, 144832, 33172, 18044, 56883, 125429, 64083, 56263, 213354, 310, 89994, 38699, 22288, 594, 3003, 131148, 4527, 91, 678, 3129, 43240, ...

[ 0.054931640625, 0.1632080078125, 0.1849365234375, 0.02545166015625, 0.114501953125, 0.1353759765625, 0.2044677734375, 0.1295166015625, 0.07061767578125, 0.1192626953125, 0.06134033203125, 0.1077880859375, 0.2021484375, 0.02020263671875, 0.1287841796875, 0.1729736328125, 0.01536560058...

embed

35820970_c0

35820970

haskell

0

Title: Using the map/mapM function to return a String ready for putStrLn to separate list elements Problem title: Using the map/mapM function to return a String ready for putStrLn to separate list elements Tags: newline, haskell, dictionary Problem: Using the map/mapM function to return a String ready for putStrLn to s...

Using the map/mapM function to return a String ready for putStrLn to separate list elements Using the map/mapM function to return a String ready for putStrLn to separate list elements newline haskell dictionary Using Car Ford Mondeo Autotrader Parkers Golf mapM_ Using the map/mapM function to return a String ready for ...

[ 0.003021240234375, -0.0162353515625, -0.005889892578125, 0.0111083984375, -0.0234375, 0.0052490234375, 0.024169921875, 0.00604248046875, 0.0169677734375, -0.00823974609375, -0.01251220703125, -0.0137939453125, 0.00177764892578125, 0.0172119140625, 0.0087890625, 0.000274658203125, -0....

[ 345, 22288, 64, 62346, 594, 32354, 30646, 23351, 214, 43542, 3884, 71713, 866, 19, 47, 84797, 5303, 80854, 3525, 2256, 1556, 142508, 45, 10763, 3980, 17652, 111651, 31, 4396, 1517, 820, 119109, 7, 23426, 454, 100, 31577, 28282, 10644, 159...

[ 0.064208984375, 0.224365234375, 0.035552978515625, 0.156982421875, 0.1876220703125, 0.1766357421875, 0.17626953125, 0.19189453125, 0.0936279296875, 0.16845703125, 0.1163330078125, 0.12744140625, 0.05194091796875, 0.029296875, 0.05584716796875, 0.203857421875, 0.1883544921875, 0.125...

embed

51878873_c0

51878873

haskell

0

Title: Storing IO action result in a LET clause Problem title: Storing IO action result in a LET clause Tags: haskell Problem: Storing IO action result in a LET clause Hello can someone please explain me how do you store in haskell the result of an action in a let block if you know you are going to use it from that poi...

Storing IO action result in a LET clause Storing IO action result in a LET clause haskell System.IO System.Directory DB Company Storing Main main::IO Insert Created Existed Already makeDir::String Bool Directory Storing IO action result in a LET clause Hello can someone please explain me how do you store in haskell the...

[ 0.00081634521484375, 0.0047607421875, 0.00970458984375, 0.0294189453125, 0.00604248046875, 0.0185546875, -0.00107574462890625, -0.000614166259765625, 0.0103759765625, -0.01409912109375, -0.00225830078125, 0.01904296875, 0.015869140625, 0.020751953125, 0.006683349609375, 0.0023956298828...

[ 23604, 214, 17780, 22631, 16750, 23, 27089, 70731, 13, 1556, 142508, 12353, 184911, 30675, 57976, 33734, 12321, 5201, 33657, 151313, 99068, 1283, 3249, 481, 71713, 2460, 929, 31068, 73342, 3642, 54, 398, 4343, 2633, 46389, 4527, 6275, 3871, ...

[ 0.2022705078125, 0.047637939453125, 0.2252197265625, 0.204345703125, 0.2186279296875, 0.054931640625, 0.2164306640625, 0.1937255859375, 0.0360107421875, 0.15087890625, 0.25048828125, 0.069580078125, 0.1640625, 0.1048583984375, 0.102294921875, 0.0869140625, 0.037872314453125, 0.0549...

embed

75518923_c2

75518923

haskell

2

.0.0.0, process-1.6.13.0 (constraint from user target requires ==1.6.16.0) [__1] fail (backjumping, conflict set: ghc, process) After searching the rest of the dependency tree exhaustively, these were the goals I've had most trouble fulfilling: process, ghc I tried to installing it with both GHC 9.4.4 and GHC 8.8.4. Al...

[ 0.001739501953125, -0.005828857421875, 0.0106201171875, -0.000606536865234375, -0.002960205078125, 0.00017833709716796875, -0.02783203125, -0.005096435546875, 0.0023193359375, 0.016357421875, -0.004547119140625, -0.0224609375, 0.00421142578125, -0.0013427734375, 0.01495361328125, 0.004...

[ 2389, 99929, 9433, 5759, 173245, 132265, 2271, 2816, 4288, 1295, 38937, 30388, 144570, 69112, 122336, 2485, 35782, 12620, 461, 44287, 79612, 5423, 31380, 238, 42548, 27771, 53201, 109458, 2684, 63134, 211394, 37842, 20600, 527, 73265, 3569, 180...

[ 0.1087646484375, 0.1790771484375, 0.191162109375, 0.0258636474609375, 0.1119384765625, 0.1357421875, 0.034271240234375, 0.1649169921875, 0.072998046875, 0.04925537109375, 0.1287841796875, 0.1947021484375, 0.192626953125, 0.0048828125, 0.171142578125, 0.139892578125, 0.20751953125, ...

embed

7866375_c0

7866375

haskell

0

Title: Why does GHC think that this type variable is not injective? Problem title: Why does GHC think that this type variable is not injective? Tags: ghc, haskell Problem: Why does GHC think that this type variable is not injective? I have this piece of code: {-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies, ...

Why does GHC think that this type variable is not injective? Why does GHC think that this type variable is not injective? ghc haskell CatchError the Why GHC LANGUAGE MultiParamTypeClasses FunctionalDependencies KindSignatures GADTs FlexibleInstances FlexibleContexts Monad Effect ErrorEff Could Why does GHC think that t...

[ -0.01129150390625, 0.0045166015625, 0.00830078125, 0.00543212890625, -0.0130615234375, 0.0145263671875, -0.020263671875, -0.000362396240234375, -0.0068359375, -0.0130615234375, -0.01336669921875, -0.0255126953125, -0.004058837890625, 0.006683349609375, 0.017822265625, 0.007415771484375...

[ 44084, 527, 73265, 5351, 903, 10644, 77336, 83, 959, 115049, 5844, 31380, 238, 1556, 142508, 18826, 206, 18468, 31611, 98064, 19335, 55292, 196707, 140803, 26885, 27435, 218723, 23749, 41072, 180842, 2661, 116071, 22829, 60331, 71, 129297, 2120...

[ 0.1024169921875, 0.0916748046875, 0.2080078125, 0.109375, 0.07489013671875, 0.200439453125, 0.254638671875, 0.07940673828125, 0.181884765625, 0.21728515625, 0.151611328125, 0.10467529296875, 0.112548828125, 0.1029052734375, 0.2081298828125, 0.105224609375, 0.0211639404296875, 0.080...

embed

30175974_c0

30175974

haskell

0

Title: Haskell function to check if two values are identical Problem title: Haskell function to check if two values are identical Tags: haskell Problem: Haskell function to check if two values are identical In Haskell we have the function (==) :: Eq a => a->a->Bool which is fine for the large number of datatypes for wh...

Haskell function to check if two values are identical Haskell function to check if two values are identical haskell Haskell Bool Foo Haskell function to check if two values are identical In Haskell we have the function (==) :: Eq a => a->a->Bool which is fine for the large number of datatypes for which an instance of E...

[ -0.000827789306640625, 0.0067138671875, -0.01007080078125, 0.011962890625, 0.02001953125, 0.011474609375, -0.004608154296875, -0.005462646484375, 0.002105712890625, -0.0162353515625, 0.00946044921875, 0.01611328125, -0.004058837890625, 0.0068359375, 0.000293731689453125, -0.01440429687...

[ 20625, 142508, 32354, 47, 12765, 2174, 6626, 142424, 621, 31943, 6827, 1556, 2460, 929, 9572, 31, 69112, 1984, 241, 864, 10, 103607, 11, 12647, 5885, 2053, 50986, 110527, 61924, 52895, 110, 169022, 27781, 8781, 10644, 275, 16487, 1221, 1419...

[ 0.1417236328125, 0.250244140625, 0.19384765625, 0.05169677734375, 0.2200927734375, 0.118896484375, 0.16259765625, 0.20166015625, 0.0875244140625, 0.2247314453125, 0.1695556640625, 0.1328125, 0.0841064453125, 0.1685791015625, 0.1724853515625, 0.13720703125, 0.17236328125, 0.06112670...

embed

74527112_c0

74527112

haskell

0

Title: Matching on a particular type of a parametric type Problem title: Matching on a particular type of a parametric type Tags: typeclass, haskell Problem: Matching on a particular type of a parametric type I'm trying to work with an external library that has provided a parametric type like this: data ParametricType ...

Matching on a particular type of a parametric type Matching on a particular type of a parametric type typeclass haskell Matching ParametricType TypeConstructor GetsString HoldsString Illegal All Couldn Matching on a particular type of a parametric type I'm trying to work with an external library that has provided a par...

[ -0.01361083984375, 0.00051116943359375, -0.0047607421875, -0.01025390625, -0.00537109375, 0.003082275390625, -0.00518798828125, -0.00176239013671875, 0.0067138671875, 0.001312255859375, 0.017822265625, -0.050048828125, -0.015869140625, -0.0017852783203125, -0.012451171875, -0.030883789...

[ 67407, 214, 98, 17311, 10644, 121, 186518, 67413, 1556, 142508, 1720, 196707, 60457, 36716, 748, 20779, 71713, 41656, 891, 86966, 3164, 191147, 173591, 35773, 71924, 18151, 10, 29458, 18304, 34648, 18499, 110527, 21635, 724, 7831, 55292, 43512,...

[ 0.24169921875, 0.111572265625, 0.11572265625, 0.1385498046875, 0.172607421875, 0.1051025390625, 0.146484375, 0.170166015625, 0.1170654296875, 0.197509765625, 0.103271484375, 0.1639404296875, 0.166259765625, 0.09063720703125, 0.010650634765625, 0.043426513671875, 0.1578369140625, 0....

embed

4364657_c0

4364657

haskell

0

Title: Why the boilerplates when writing new Monad Transformers Problem title: Why the boilerplates when writing new Monad Transformers Tags: haskell, boilerplate, monads, monad-transformers Problem: Why the boilerplates when writing new Monad Transformers This section http://book.realworldhaskell.org/read/monad-transf...

Why the boilerplates when writing new Monad Transformers Why the boilerplates when writing new Monad Transformers haskell boilerplate monads monad-transformers Why Monad Transformers MonadState MonadIO MaybeT Maybe MonadTrans Just Why the boilerplates when writing new Monad Transformers This section http://book.realwor...

[ -0.0091552734375, -0.00089263916015625, 0.014892578125, -0.00830078125, 0.01165771484375, -0.0224609375, -0.010986328125, -0.000232696533203125, -0.0167236328125, -0.01513671875, 0.00193023681640625, -0.00677490234375, -0.0029449462890625, -0.000762939453125, 0.000888824462890625, -0.0...

[ 44084, 337, 34759, 92558, 7, 3229, 32562, 3525, 60331, 71, 11062, 82772, 1556, 142508, 2667, 712, 215175, 1314, 135206, 17780, 83425, 618, 62624, 14137, 30544, 32554, 10557, 39116, 3796, 12877, 5120, 6661, 20625, 122, 110527, 100, 23009, 5974...

[ 0.115234375, 0.099853515625, 0.1497802734375, 0.255126953125, 0.02685546875, 0.0187530517578125, 0.1768798828125, 0.1473388671875, 0.1910400390625, 0.1568603515625, 0.157470703125, 0.2462158203125, 0.1099853515625, 0.226318359375, 0.1280517578125, 0.1484375, 0.232666015625, 0.09838...

embed

65590600_c1

65590600

haskell

1

TooBig Int deriving Show choose :: MonadPlus m => [a] -> m a choose = msum . map return ex1 :: (MonadPlus m, MonadError TooBig m) => m Int ex1 = do x <- choose [5,7,1] if x > 5 then throwError (TooBig x) `catchError` handler else return x where handler (TooBig x) = if x > 7 then throwError (TooBig x) else return x ex3...

[ -0.0167236328125, 0.01019287109375, 0.0224609375, 0.010498046875, 0.00144195556640625, 0.0009002685546875, -0.01361083984375, -0.0164794921875, 0.0184326171875, -0.0103759765625, 0.0093994140625, -0.0068359375, 0.014404296875, -0.02197265625, 0.01458740234375, 0.0026092529296875, -0....

[ 56374, 129933, 360, 18, 16406, 17367, 55076, 60331, 71, 88225, 347, 11, 10, 11832, 22288, 30646, 1119, 418, 46674, 712, 18468, 31611, 1022, 135461, 2174, 190, 104250, 7763, 31, 4460, 35863, 361, 363, 4153, 11675, 37379, 19462, 154663, 618, ...

[ 0.1845703125, 0.27490234375, 0.1182861328125, 0.1346435546875, 0.0953369140625, 0.2288818359375, 0.1783447265625, 0.1470947265625, 0.07781982421875, 0.2037353515625, 0.0826416015625, 0.006195068359375, 0.023223876953125, 0.1500244140625, 0.08062744140625, 0.093994140625, 0.1055297851...

embed

55716502_c1

55716502

haskell

1

ex.PCRE Yields <no location info>: error: Ambiguous module name ‘Text.Regex.PCRE’: it was found in multiple packages: regex-pcre-0.94.4 regex-pcre-builtin-0.94.4.8.8.35 I would like to revert my installation to the earlier state such that code on my machine that imports Text.Regex.PCRE without qualification continues t...

[ -0.007049560546875, -0.015869140625, 0.00933837890625, 0.04248046875, 0.01251220703125, 0.00927734375, -0.00592041015625, 0.002105712890625, -0.0191650390625, -0.006500244140625, 0.0037841796875, 0.0023956298828125, -0.00555419921875, -0.0306396484375, 0.0166015625, 0.0118408203125, ...

[ 1119, 12233, 11766, 42341, 19388, 7, 157, 31913, 3004, 18499, 10250, 12282, 10821, 88996, 9351, 174379, 54601, 3355, 14037, 23, 48716, 98169, 6835, 254, 7612, 143161, 180874, 978, 379, 2311, 200701, 5843, 1884, 47, 39531, 18, 59720, 110680, ...

[ 0.1495361328125, 0.1077880859375, 0.25537109375, 0.13232421875, 0.200927734375, 0.036590576171875, 0.0367431640625, 0.19189453125, 0.0665283203125, 0.153564453125, 0.1373291015625, 0.1783447265625, 0.080810546875, 0.224853515625, 0.06134033203125, 0.1990966796875, 0.1683349609375, ...

embed

38791455_c1

38791455

haskell

1

_hsc_make.o -fno-stack-protector -D__GLASGOW_HASKELL__=710 -Dlinux_BUILD_OS=1 -Dx86_64_BUILD_ARCH=1 -Dlinux_HOST_OS=1 -Dx86_64_HOST_ARCH=1 -Icbits -Idist/build/autogen -include dist/build/autogen/cabal_macros.h -I/usr/local/haskell/ghc-7.10.2-x86_64/lib/ghc-7.10.2/base_GDytRqRVSUX7zckgKqJjgw/include -I/usr/local/haskel...

[ -0.013671875, 0.015380859375, 0.00933837890625, -0.0079345703125, 0.00012493133544921875, 0.01123046875, -0.02783203125, -0.006988525390625, -0.0086669921875, -0.001251220703125, -0.025634765625, -0.031005859375, 0.000576019287109375, -0.00958251953125, 0.0084228515625, 0.0125122070312...

[ 101, 127, 10382, 55898, 31, 420, 157, 590, 2594, 208202, 1290, 46705, 19930, 1456, 101413, 605, 56051, 966, 963, 397, 2397, 6077, 15639, 16444, 7285, 33000, 15276, 13307, 169243, 34274, 3137, 46295, 177149, 8913, 1409, 217028, 408, 3571, 36...

[ 0.030059814453125, 0.1298828125, 0.1597900390625, 0.1248779296875, 0.1649169921875, 0.046661376953125, 0.2095947265625, 0.12109375, 0.1461181640625, 0.2239990234375, 0.1654052734375, 0.09588623046875, 0.167724609375, 0.1224365234375, 0.14599609375, 0.12939453125, 0.2138671875, 0.03...

embed

43551745_c0

43551745

haskell

0

Title: Missing C library: Problem title: Missing C library: Tags: haskell, ffi Problem: Missing C library: I have written some simplistic code to call a function in a C library. The code compiles (and a similar piece works for a standard C library) but when I compile and link, ghc cannot find the C library. My cabal fi...

Missing C library: Missing C library: haskell ffi ccall Missing MainFFI4TT.hs Haskell2010 Include-dirs Includes tagger-api.h libtreetagger.so init_treetagger c_initTreeTagger CString param_file_name german-utf8.par Missing C library: I have written some simplistic code to call a function in a C library. The code compil...

[ 0.0147705078125, 0.003814697265625, 0.011962890625, -0.004791259765625, 0.00811767578125, -0.021484375, 0.00787353515625, -0.00628662109375, -0.00341796875, -0.041259765625, -0.00171661376953125, -0.041259765625, -0.0059814453125, 0.0274658203125, 0.01519775390625, -0.0086669921875, ...

[ 16771, 214, 313, 35773, 1294, 1556, 142508, 24500, 85763, 12321, 30110, 568, 617, 13739, 127, 20625, 11436, 822, 936, 308, 21407, 40897, 25474, 62600, 102, 991, 217, 62731, 66448, 1505, 2852, 121, 29822, 42712, 1019, 2500, 59121, 112892, 28...

[ 0.1500244140625, 0.063232421875, 0.14697265625, 0.23583984375, 0.146728515625, 0.139892578125, 0.2318115234375, 0.15380859375, 0.1934814453125, 0.0821533203125, 0.095703125, 0.0279083251953125, 0.07537841796875, 0.140380859375, 0.07379150390625, 0.1365966796875, 0.1611328125, 0.063...

embed

32959661_c0

32959661

haskell

0

Title: How to avoid needless rebuilds with stack? Problem title: How to avoid needless rebuilds with stack? Tags: haskell-stack, haskell Problem: How to avoid needless rebuilds with stack? Stack usually caches package dependency builds to save time in future builds, but I've noticed many cases in practice where this do...

How to avoid needless rebuilds with stack? How to avoid needless rebuilds with stack? haskell-stack haskell Network.Haskoin.Internals How lts-2.15 haskoin-0.1.0.2 json-rpc-0.2.1.6 pbkdf-1.1.1.1 text-1.1.1.4 Main.hs Haskell2010 How to avoid needless rebuilds with stack? Stack usually caches package dependency builds to ...

[ -0.0012969970703125, 0.003326416015625, -0.005096435546875, 0.01318359375, -0.0235595703125, 0.005096435546875, -0.0230712890625, 0.00628662109375, -0.01214599609375, -0.015869140625, 0.01495361328125, -0.0228271484375, 0.024169921875, 0.0191650390625, 0.013916015625, 0.02001953125, ...

[ 11249, 71864, 3871, 9393, 456, 177149, 7, 678, 177261, 1556, 142508, 590, 2594, 28997, 6495, 1579, 73, 44851, 933, 1837, 256, 102014, 133684, 1647, 1681, 57095, 122336, 420, 83783, 7986, 92134, 91977, 12321, 127, 20625, 11436, 6512, 56104, ...

[ 0.0171966552734375, 0.1702880859375, 0.1005859375, 0.1556396484375, 0.1483154296875, 0.23583984375, 0.03668212890625, 0.0989990234375, 0.257568359375, 0.1041259765625, 0.197021484375, 0.1324462890625, 0.17333984375, 0.037261962890625, 0.08599853515625, 0.1373291015625, 0.108642578125...

embed

59550775_c0

59550775

haskell

0

Title: How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? Problem title: How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? Tags: semigroup, haskell, monoids Problem: How to solve a Haskell code error...

How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? How to solve a Haskell code error "<>' is not a (visible) method of class `Monoid'"? semigroup haskell monoids Data.Monoid How Haskell Monoid RevList Nil RCons Show Semigroup RNil How...

[ -0.031005859375, 0.0224609375, 0.01708984375, 0.02783203125, 0.01214599609375, 0.02587890625, -0.0029296875, 0.003814697265625, 0.004241943359375, -0.0040283203125, -0.0108642578125, -0.0034027099609375, 0.01470947265625, 0.004058837890625, -0.0072021484375, -0.025390625, -0.00720214...

[ 11249, 86869, 20625, 142508, 18151, 18499, 5386, 3768, 959, 99017, 55300, 18507, 46674, 48899, 83, 36137, 51588, 1556, 22460, 30185, 11809, 77879, 532, 80893, 154663, 77175, 81135, 5245, 17367, 84420, 379, 16093, 2740, 10, 21635, 3525, 2053, ...

[ 0.00726318359375, 0.16357421875, 0.127197265625, 0.2454833984375, 0.1727294921875, 0.2073974609375, 0.043182373046875, 0.094970703125, 0.165771484375, 0.239501953125, 0.2015380859375, 0.162353515625, 0.1500244140625, 0.2261962890625, 0.0271453857421875, 0.1297607421875, 0.17456054687...

embed