Search results
Jump to navigation
Jump to search
- #redirect [[Xmonad/Config archive/Thomas ten Cate's xmonad.hs]]98 bytes (14 words) - 13:00, 8 June 2023
- monadic <hask>do</hask>-block. Here's some quick examples: s <- foldM fn [] [1..n]986 bytes (142 words) - 15:18, 6 February 2021
- revWorker s [] = s revWorker s (x:xs) = revWorker (x:s) xs2 KB (333 words) - 12:44, 4 June 2018
- ...being used in the wild, and discuss lessons learned about working with GHC's plugin mechanism. HERMIT is being used to optimize SYB traversals, to fuse Stream Fusion's concatMap combinator, and to implement staged compilation within GHC to gen1 KB (174 words) - 06:36, 16 September 2013
- echo ${cpu} | gdbar -s v -h 15 -sw 1 >> /tmp/.dzen2cpugraph echo ${cpu cpu1} | gdbar -s p -w 7 -nonl924 bytes (169 words) - 15:18, 6 February 2021
- ...in xmonad from ghci's main thread is another option, which requires xmonad's code to be modified slightly:1 KB (163 words) - 20:37, 8 February 2015
- end s = (last s == n) && (length s /= 1)1 KB (153 words) - 06:29, 31 July 2021
- Here's how Haskellers responded to the following question in the Call for Particip * Any, but I'd especially like to help people improve docs if that's welcome.1 KB (145 words) - 18:33, 27 January 2017
- where search :: STArray s Vertex Bool -> [Vertex] -> ST s [Tree Vertex]4 KB (490 words) - 12:00, 24 May 2024
- *All of the guts of MapReduce are hidden in the monad's <hask>bind</hask> function a -> ([(s,a)] -> [(s',b)])6 KB (1,053 words) - 03:27, 9 April 2021
- ...to install diagrams of course cabal rejects the latest version. But here's where things go screwy: cabal then starts looking back in time to try to fi1 KB (207 words) - 15:18, 6 February 2021
- ...ages.inf.ed.ac.uk/wadler/index.html#links Links] language and Steele et al's [http://lambda-the-ultimate.org/node/view/673 Fortress] language are effort ...patibility, exploring dark corners of [[GHC]], [[domain specific language]]s, and the [[Foreign Function Interface]].2 KB (239 words) - 22:47, 25 March 2017
- * [[Bresenham's line drawing algorithm]]226 bytes (25 words) - 01:10, 26 April 2021
- ...sed algebraic datatype|GADTs]]. One solution is to use [[existential type]]s. The example here is a solution to one of the exercises in Fun with [[phant compress (RPair s t) (x,y) = compress s x ++ compress t y8 KB (1,072 words) - 18:32, 16 January 2017
- ...uncements regarding the provisional (as of Jan. 2012) Ireland Haskell User's Group will be posted here.247 bytes (34 words) - 15:19, 6 February 2021
- , Run Com "uname" ["-s","-r"] "" 36000 , Run Date "%a %b %_d %Y %H:%M:%S" "date" 101,023 bytes (104 words) - 15:18, 6 February 2021
- This little piece of code computes an approximation of Riemann's zeta function, balancing the work to be done between N threads. zetaRange s (x,y) = [ fromIntegral n ** (-s) | n <- [x..y] ]4 KB (555 words) - 10:58, 22 June 2021
- ...ne the greatest common divisor of two positive integer numbers. Use Euclid's algorithm. ...for ours. The function gcd' is a straightforward implementation of Euler's algorithm, and myGCD is just a wrapper that makes sure the arguments are po777 bytes (117 words) - 19:42, 18 January 2014
- ...ent and return a result of that type". All universal quantifiers ("for all"s) must appear at the beginning of a type. ...e, even inside normal datatypes like lists or <tt>Maybe</tt>. The GHC User's Guide gives the following example:2 KB (347 words) - 11:46, 4 February 2023
- This is intended as a beginner's tutorial for learning Haskell from a "Let's just solve things already!" point of view. The examples should6 KB (842 words) - 05:27, 8 February 2016