Search results

• Fizzbuzz
  ...ing-fizzbuzz-to-find-developers-who-grok-coding/ this] so I came up with a quick solution in Haskell.
  466 bytes (55 words) - 15:18, 6 February 2021
• MonadFail Proposal
  A quick summary for migration purposes, here are the versions of GHC/base with majo
  899 bytes (125 words) - 00:00, 27 December 2023
• HaskellImplementorsWorkshop/2011/Wortmann
  We have extended the GHC tool chain accordingly and are now able to give quick and accurate program profiles, complete with source code references. Our ta
  1 KB (186 words) - 13:44, 17 December 2012
• Cookbook/Graphical user interfaces
  This code was taken from [[WxHaskell/Quick_start | "a quick start with wxHaskell"]].
  1 KB (217 words) - 11:34, 9 July 2009
• WxHaskell/Documentation
  ; [[WxHaskell/Quickstart|Quick start]]
  1 KB (203 words) - 10:12, 20 October 2015
• ZuriHac2013/Projects
  Some things are simple additions and should be quick, others are more involved and would probably work out better with more than
  1 KB (168 words) - 22:02, 28 August 2013
• Humor
  *[[Humor/How quick can you write a ISI paper with Haskell or without it ?]] ...om/2016/01/13/stob_remember_the_monoids Learn you Func Prog on five minute quick!]
  5 KB (667 words) - 22:52, 1 May 2024
• New monads/MonadUnique
  ...also a simple way to get the same functionality in the ST Monad. Here's a quick module to construct infinite supplies of unique values in the ST monad:
  2 KB (234 words) - 07:33, 10 December 2006
• Recursion in a monad
  monadic <hask>do</hask>-block. Here's some quick examples:
  986 bytes (142 words) - 15:18, 6 February 2021
• Control-event
  * While no work is planned, if someone were looking for a quick project then they could move this package over to the 'time' packages and e
  1 KB (192 words) - 10:06, 20 April 2021
• Blog articles/Exercises
  * [http://vandreev.wordpress.com/2006/12/24/quick-and-dirty-theorem-prover/ A quick and dirty theorem prover in Haskell]
  5 KB (509 words) - 06:00, 20 February 2008
• WxHaskell/Tips and tricks
  * read carefully [[WxHaskell/Quick start | Quick start]] - it contains more information than you think
  3 KB (496 words) - 14:04, 4 October 2014
• Metaチュートリアル
  .../www.cse.unsw.edu.au/~dons/blog/2006/12/11#interpreters-with-reader-monads Quick interpreters with the Reader monad]
  5 KB (398 words) - 11:37, 22 October 2022
• Haskell Quiz/IP to Country/Solution Dolio
  ...seemed like an ideal use of the famed ByteString library, so I hacked up a quick solution. It uses lazy chunked input for hopefully cache-efficient processi
  3 KB (518 words) - 04:04, 19 September 2007
• Blog articles/Monads
  .../cgi.cse.unsw.edu.au/~dons/blog/2006/12/11#interpreters-with-reader-monads Quick interpreters with the Reader monad]
  7 KB (767 words) - 01:44, 28 January 2011
• List function suggestions
  replace "the" "a" "the quick brown fox jumped over the lazy black dog" "a quick brown fox jumped over a lazy black dog"
  8 KB (1,277 words) - 11:14, 16 June 2012
• HXT/Practical/Simple1
  First, a quick overview of the necessary imports and compiler declarations:
  4 KB (562 words) - 16:11, 11 October 2011
• Obfuscation/IOHCC 2004
  ...are discipline and stomp around in the muddy world of spaghetti code for a quick vacation.
  3 KB (422 words) - 00:04, 18 January 2007
• Cn/WxHaskell
  ** [[/Quick start/]]
  4 KB (581 words) - 10:16, 23 February 2009
• QuickCheck as a test set generator
  == The fame of Quick Check == printer using Quick Check. So, she asked me whether it is possible to
  10 KB (1,529 words) - 18:30, 16 January 2017

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