Search results

• Diagrams/GHC7.6
  ...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 fi
  1 KB (207 words) - 15:18, 6 February 2021
• The Monad.Reader/Issue2
  ...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
• Sample Programs for Learning
  * [[Bresenham's line drawing algorithm]]
  226 bytes (25 words) - 01:10, 26 April 2021
• QuickCheck / GADT
  ...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 y
  8 KB (1,072 words) - 18:32, 16 January 2017
• Ireland HUG
  ...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
• 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
• Concurrency demos/Zeta
  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
• 99 questions/Solutions/32
  ...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 po
  777 bytes (117 words) - 19:42, 18 January 2014
• Impredicative types
  ...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
• Simple Unix tools
  This is intended as a beginner's tutorial for learning Haskell from a "Let's just solve things already!" point of view. The examples should
  6 KB (842 words) - 05:27, 8 February 2016
• Idiom brackets
  Since f is not a pure function, it's f :: x -> y -> m c. The correct form would be instance Idiomatic i f g => Idiomatic i (s -> f) (i s -> g) where
  2 KB (365 words) - 18:50, 19 September 2017
• ListT done right alternative
  instance (MonadReader s m, Functor m) => MonadReader s (ListT m) where instance (MonadState s m, Functor m) => MonadState s (ListT m) where
  2 KB (402 words) - 06:31, 12 May 2015
• BayHac2014/DenotationalDesign
  ...conal/talk-2014-bayhac-denotational-design/blob/master/README.md this talk's README on GitHub].
  298 bytes (41 words) - 05:35, 23 May 2014
• Smart constructors
  This has a problem however, that the [[constructor]]s of type ''Resistor'' are data S a = S a
  9 KB (1,351 words) - 18:21, 6 June 2020
• Roll your own IRC bot/Source
  ...e uncompilable). That page already has source for the bot anyway, so there's not much point in keeping this separate one.
  284 bytes (52 words) - 00:57, 17 June 2015
• Case comprehensions
  but when it's used in case expressions: Could the GHC example benefit from some more list-comprehension syntax? Let's borrow a new reserved word:
  6 KB (743 words) - 02:12, 5 August 2021
• Anonymous function
  ...ight look like this: <hask>\x -> x + 1</hask>. (That backslash is Haskell's way of expressing a &lambda; and is supposed to look like a Lambda.) .../ foldr</hask>. So if I wanted to add one to each element of a list, here's one way to do it (without anonymous functions):
  2 KB (296 words) - 06:56, 12 April 2021
• 99 questions/Solutions/96
  identifier s = identifier' s 'l' identifier' (c:s) t = (match c t) && or [identifier' s b | (a, b) <- fsm, a == t]
  2 KB (346 words) - 03:47, 10 January 2017
• Foldl as foldr alternative
  ...ve, however, is the ''wrong one'' for what we're trying to do here. So let's change the order of the arguments of the helper: Believe it or not, we're almost done! How is that? Let's parenthesize a bit for emphasis:
  5 KB (891 words) - 14:21, 3 January 2018
• Let vs. Where
  f :: s -> (a,s) f :: State s a
  4 KB (716 words) - 07:41, 26 January 2019

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