Search results
Jump to navigation
Jump to search
Page title matches
- #redirect [[Xmonad/Config archive/twifkak's Config.hs]]90 bytes (12 words) - 12:56, 8 June 2023
- ...| running tests]]. The document concludes with a section describing HUnit's [[#ConstituentFiles | constituent files]] and a section giving [[#Reference assertString s = unless (null s) (assertFailure s)23 KB (3,542 words) - 03:11, 15 May 2020
- 629 bytes (98 words) - 04:43, 27 February 2019
- And here is an implementation of generalized Bresenham's line drawing algorithm, in terms of balanced words: https://github.com/Lamb1 KB (168 words) - 23:01, 11 July 2021
- #redirect [[Haskell Quiz/Knight's Travails]]79 bytes (10 words) - 06:31, 8 June 2023
- ...ion of [http://en.wikipedia.org/wiki/Floyd's_cycle-finding_algorithm Floyd's cycle-finding algorithm] for finding cycles in lists.950 bytes (133 words) - 00:39, 5 February 2019
- Now that you know the math basics behind the <hask>Monoid</hask> class, let's see its definition: ...tical consequence: '''we cannot create malformed LaTeX code'''. ''And that's a good deal!''21 KB (3,518 words) - 09:52, 14 May 2014
- ...edia article on [http://en.wikipedia.org/wiki/Chaitin%27s_constant Chaitin's construction], referring to e.g. ...one for example in Section 4.1 of [https://tromp.github.io/cl/LC.pdf Tromp's paper].10 KB (1,527 words) - 09:31, 24 April 2024
- #REDIRECT [[Haskell Quiz/Knight's Travails]]79 bytes (10 words) - 06:56, 8 June 2023
- #redirect [[Xmonad/Config archive/Don's Config.hs]]86 bytes (12 words) - 04:31, 8 June 2023
- Wadler's Law states that: Under these circumstances, Paul's ruling seems right: it is pointless4 KB (583 words) - 10:26, 26 December 2017
Page text matches
- gray n = foldr (\s acc -> ("0" ++ s):("1" ++ s):acc) [] $ gray (n-1) gray' n = (gl . gr) [] where gl y = foldr (\s acc -> ('0':s):acc) y gp2 KB (298 words) - 03:02, 7 June 2021
- (**) Calculate Euler's totient function phi(m). Euler's so-called totient function phi(m) is defined as the number of positive inte1 KB (224 words) - 19:44, 18 January 2014
- ...nd raise the profile of the Haskell programming language. Most of all, it's fun---you get to tangibly experience your contributions in the form of beau1 KB (165 words) - 22:48, 5 March 2014
- ...hs using graph canonization. It is somewhat of a slow solution, taking >10 s to run <hask>regular 6 3</hask>. [i : s | i <- n, s <- xs, i `notElem` s, asc (i : s)])2 KB (388 words) - 03:47, 10 January 2017
- Because (State s) forms a monad, values can be combined with (>>=) or do{}. ...is a function from initial state s to final value a and final state s: (a,s). These are usually wrapped, but shown here unwrapped for simplicity.7 KB (1,055 words) - 15:06, 21 December 2018
- 2007-03-01 closing=1403.17 change%=-0.25944346 cash=12389.992 assets=(#S(PURCHASE :AMOUNT 0.9840075 :ORIGINAL-PRICE 1399.04)) 2007-03-02 closing=1387.17 change%=-1.1402752 cash=12389.992 assets=(#S(PURCHASE :AMOUNT 0.9840075 :ORIGINAL-PRICE 1399.04))3 KB (309 words) - 16:40, 6 February 2015
- .../notes-on-haskell.blogspot.com/2007/02/whats-wrong-with-for-loop.html What's wrong with for loops] ...blogspot.com/2007/02/whats-wrong-with-for-loop-revisited.html More on what's wrong with for loops]2 KB (160 words) - 08:56, 16 April 2020
- This month's editorial is an encouragement to join the [http://www.haskell.org/mailman/l ...y, for example c2hs, Knit, and other projects require C parsers, but there's no common code base. Since parsers are one of the killer features of Haskel2 KB (241 words) - 22:48, 25 March 2017
- #redirect [[Wadler's Law]]61 bytes (8 words) - 12:43, 8 June 2023
- #redirect [[Poor man's here document]]73 bytes (10 words) - 11:48, 8 June 2023
- #REDIRECT [[Haskell Quiz/Knight's Travails]]79 bytes (10 words) - 06:56, 8 June 2023
- #redirect [[Haskell Quiz/Knight's Travails]]79 bytes (10 words) - 06:31, 8 June 2023
- #redirect [[Xmonad/Config archive/Don's Config.hs]]86 bytes (12 words) - 04:31, 8 June 2023
- #redirect [[Xmonad/Config archive/twifkak's Config.hs]]90 bytes (12 words) - 12:56, 8 June 2023
- #redirect [[Xmonad/Config archive/Gwern's xmonad.hs]]88 bytes (12 words) - 13:01, 8 June 2023
- #REDIRECT [[Xmonad/Config archive/leedo's xmonad.hs]]88 bytes (12 words) - 13:01, 8 June 2023
- ...mation about <code>cabal new-build</code>, the main entry point into Cabal's new Nix-style local builds facility. * Haskell at Work's [https://haskell-at-work.com/episodes/2018-05-13-introduction-to-cabal.html592 bytes (78 words) - 15:19, 6 February 2021
- == What's in the platform ==2 KB (260 words) - 13:28, 21 January 2020
- #redirect [[Xmonad/Config archive/David Roundy's Config.hs]]95 bytes (13 words) - 13:00, 8 June 2023
- [http://hackage.haskell.org/package/lens Edward Kmett’s <code>lens</code> package]. ''“JQuery for Haskell values”.'' ...s.Setter] ||<code>over setter f s</code> ||<code>setter %~ f $ s</code> ||modify pure value5 KB (742 words) - 19:22, 22 May 2022