Search results

Page title matches

• Xmonad/Config archive/Gwern's xmonad.hs
  ...xK_Print), unsafeSpawn "import -quality 90 -descend png:$HOME/xwd-$(date +%s)$$.png") ...[[:blank:]]\\+/ /g' > $TMP && screen -S 'irssi' -X readbuf $TMP && screen -S 'irssi' -X paste .;rm $TMP")
  6 KB (615 words) - 23:47, 28 November 2018
• Xmonad/Config archive/Gwern's Config.hs
  #redirect [[Xmonad/Config archive/Gwern's xmonad.hs]]
  88 bytes (12 words) - 13:01, 8 June 2023
• Poor Man's Heredoc in Haskell
  #redirect [[Poor man's here document]]
  73 bytes (10 words) - 11:48, 8 June 2023
• Xmonad/Config archive/thoughtpolice's xmobarrc
  , Run Com "uname" ["-s","-r"] "" 36000 , Run Date "%a %b %_d %Y %H:%M:%S" "date" 10
  1,023 bytes (104 words) - 15:18, 6 February 2021
• Xmonad/Config archive/Don's Config.hs
  11 KB (1,532 words) - 15:18, 6 February 2021
• Xmonad/Config archive/loupgaroublond's xmonad.hs
  96 bytes (12 words) - 13:00, 8 June 2023
• Xmonad/Config archive/Nnoell's xmonad.hs
  ...rGray ++ "):^fg()%M^fg(" ++ colorGray ++ "):^fg()^fg(" ++ colorGreen ++ ")%S^fg()") ++! ...f "Switcher" xs = layoutText $ removeWord xs ++ " ^fg(" ++ colorRed ++ ")S^fg(" ++ colorGray ++ ")|^fg(" ++ colorWhiteAlt ++ ")"
  45 KB (4,625 words) - 00:21, 27 October 2013
• Xmonad/Config archive/leedo's xmonad.hs
  xrandr -s 0
  2 KB (236 words) - 00:49, 27 January 2018
• Xmonad/Config archive/TeXitoi's xmonad.hs
  4 KB (452 words) - 14:23, 2 May 2018
• Xmonad/Config archive/yiannist's xmonad.hs
  6 KB (566 words) - 20:23, 21 June 2015
• Xmonad/Config archive/droundy's Config.hs
  #redirect [[Xmonad/Config archive/David Roundy's Config.hs]]
  95 bytes (13 words) - 13:00, 8 June 2023
• HUnit 1.0 User's Guide
  ...| 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
• Let's Play Free Games
  629 bytes (98 words) - 04:43, 27 February 2019
• Bresenham's line drawing algorithm
  And here is an implementation of generalized Bresenham's line drawing algorithm, in terms of balanced words: https://github.com/Lamb
  1 KB (168 words) - 23:01, 11 July 2021
• Haskell Quiz/Knight's Trevails
  #redirect [[Haskell Quiz/Knight's Travails]]
  79 bytes (10 words) - 06:31, 8 June 2023
• Floyd's cycle-finding algorithm
  ...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
• HaTeX User's Guide
  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
• Chaitin's construction
  ...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
• Knight's Trevails
  #REDIRECT [[Haskell Quiz/Knight's Travails]]
  79 bytes (10 words) - 06:56, 8 June 2023
• Don's Config.hs
  #redirect [[Xmonad/Config archive/Don's Config.hs]]
  86 bytes (12 words) - 04:31, 8 June 2023

Page text matches

• Algorithmic information theory
  ...e writings on the relevance of algorithmic information theory, and Chaitin's thoughts of its relatedness to epistemology, biology. [[Chaitin's construction]].
  440 bytes (57 words) - 06:23, 4 February 2016
• Binary IO
  It's very simple to use, and provides a highly efficient, pure interface * JeremyShaw's update of HalDaume's NewBinary package (Cabalized): http://www.n-heptane.com/nhlab/repos/NewBina
  2 KB (254 words) - 19:03, 23 October 2013
• Literate programming/Bird conversion via sed
  s/^> // s/\(\n\)> /\1/g
  600 bytes (99 words) - 10:10, 7 November 2013
• 99 questions/Solutions/33
  ...e the prelude function for computing gcd's along with a test of the result's equality to one.
  329 bytes (49 words) - 19:43, 18 January 2014
• Diagrams/Dev/ReleaseAutomation
  .../github.com/bergey/diagrams-stow/blob/master/release/UpperBounds.hs Daniel's]) This page has ideas & requirements for building a less ad-hoc tool, whic Either Brent's tool or Daniel's (or both) performs each of the tasks listed above. In some cases the code
  2 KB (241 words) - 16:19, 22 June 2015
• Alternatives and extensions for libraries
  ...n if it is (mostly) backward-compatible, and otherwise in the "alternative(s)" column. !Module(s)
  5 KB (633 words) - 15:16, 6 February 2021
• Iteratee
  Page about the implementation of Oleg's Iteratee maintained by John Lato. * [http://okmij.org/ftp/Haskell/Iteratee Oleg's Original Implementation]
  2 KB (228 words) - 15:18, 6 February 2021
• BayHac2017/Karya
  ...e hackathon on Friday and Saturday, and possibly Sunday afternoon if there's interest. To get sound you'll need VSTs, a VST host, and jack if it's linux. It's
  886 bytes (153 words) - 22:47, 5 April 2017
• Web/Existing software
  ! Author(s) ! Maintainer(s)
  4 KB (491 words) - 10:14, 3 August 2015
• 99 questions/Solutions/49
  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 gp
  2 KB (298 words) - 03:02, 7 June 2021
• 99 questions/Solutions/34
  (**) Calculate Euler's totient function phi(m). Euler's so-called totient function phi(m) is defined as the number of positive inte
  1 KB (224 words) - 19:44, 18 January 2014
• Diagrams/GSoC
  ...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 beau
  1 KB (165 words) - 22:48, 5 March 2014
• 99 questions/Solutions/94
  ...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
• State Monad
  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
• Programming performance/Yasuo Common Lisp
  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
• Unsafe functions
  * <hask>unsafeInterleaveST :: ST s a -> ST s a</hask> * <hask>unsafeIOToST :: IO a -> ST s a</hask>
  1 KB (205 words) - 12:02, 24 September 2024
• Blog articles/Functional programming
  .../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
• The Monad.Reader/Issue4
  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 Haskel
  2 KB (241 words) - 22:48, 25 March 2017
• Wadlers Law
  #redirect [[Wadler's Law]]
  61 bytes (8 words) - 12:43, 8 June 2023
• Poor Man's Heredoc in Haskell
  #redirect [[Poor man's here document]]
  73 bytes (10 words) - 11:48, 8 June 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)