Search results

• Diagrams/Dev/Gradients
  ...dient we need to apply only non-frozen transforms. The problem is that we don't know which are frozen and which are not. (10:17) <Martingale> It's seems like we need information we don't yet have as we traverse the tree
  9 KB (1,383 words) - 16:48, 18 November 2013
• Xmonad/Notable changes since 0.7
  ...want or need manual gap-setting ability (if you're not sure, you probably don't) can use the new contrib module XMonad.Layout.Gaps. ...pt), and the URL string. If you want to replicate the old simpleEngine, it'd look like 'newEngine = searchEngine "" "http://..."'.
  3 KB (451 words) - 12:13, 19 April 2021
• What a Monad is not
  Don't be surprised if you leave this page more confused than before. That just ...In no way whatsoever. You don't even need flexible morals to claim it. To be more specific, it's IO that
  6 KB (1,032 words) - 16:45, 2 December 2020
• Hac NYC
  If you don't have an irc client you can use http://webchat.freenode.net/ ...en to everyone. To register, fill out this [https://docs.google.com/forms/d/1taZtjgYozFNebLt1TR2VnKv-ovD2Yv5sOdSZzmi_xFo/viewform registration form].
  5 KB (917 words) - 14:35, 5 April 2014
• Yi/FAQ
  ...g the latest development (GitHub) or stable (Hackage) versions of Yi, so ''don't'' try to install these two packages. Yi supports VTY and Gtk2hs directly |C-d
  9 KB (1,413 words) - 00:17, 24 November 2014
• 99 questions/61 to 69
  (Branch 'd' Empty Empty) ...t your predicate in an appropriate way. Note: This is a difficult problem. Don't give up too early!
  12 KB (1,696 words) - 05:35, 11 June 2023
• Xmonad/Config archive/Template xmonad.hs (0.6)
  '''NOTE:''' You don't ''need'' to use this config file to replicate the default config. This is -- Normally, you'd only override those defaults you care about.
  10 KB (1,329 words) - 15:18, 6 February 2021
• Diagrams/Dev/Constraints
  ..., Float.R2 is float-specific, and SDouble's are ADT's (boxed types), thus don't pack, so the generic V2 is sufficient. ...dth is 1/x of the diagram's width", while Measure probably does not, but I don't think it will be any worse than what we have now.
  10 KB (1,671 words) - 03:59, 16 August 2014
• Questions and answers
  ...it, there is also [[Help:Editing | help on editing wiki pages]]. Finally, don't forget to categorize your new page. ** have a look at [[Libraries and tools/GUI libraries]]. i'd have a look at [http://haskell.org/graphics/ HGL], [http://haskell.org/HOpe
  6 KB (915 words) - 06:17, 23 July 2020
• Hackage wiki page per project discussion
  Duncan Coutts proposed contacting the maintainer. If you don't receive replies within a time frame write to the haskell-cafe mailinglist ...an't reply because they are on holiday or got very busy.. In these cases I'd like to put my patch somewhere so that others can find them.
  18 KB (3,049 words) - 10:29, 7 February 2021
• The Monadic Way
  program you will construct at the end. but your reader don't know all these! related with lambda calculus, I don't think you can claim you
  9 KB (1,615 words) - 15:16, 6 February 2021
• Non-empty list
  approach. One can't help but wonder why don't we program in this (whose code, if available, we'd rather not change) and we want to
  8 KB (1,274 words) - 20:23, 18 July 2014
• Haskell a la carte
  New to Haskell? This menu will give you a first impression. Don't read all the explanations, or you'll be starved before the meal! ::The ''infinite'' list of fibonacci numbers. Just don't try to print all of it.
  6 KB (1,024 words) - 23:56, 25 June 2021
• Class system extension proposal
  In other words, we'd like to be able to write: ...rarchy has been refined to add extra functionality these existing programs don't use. This also applies to other hierachies in wide use at the moment, whe
  8 KB (1,232 words) - 01:58, 8 October 2014
• Benchmarks Game
  ...ny of the benchmarks with no clear rational for the different versions. It'd be better to have entries for "GHC" be clean, short, functional code and en -- Shortened by Don Stewart
  4 KB (577 words) - 17:21, 4 February 2023
• Non-strict semantics
  ...n particular, you can separate ''production'' and ''consumption'' of data: don't know how many prime numbers you're going to need? Just make `primes` a li ..., except if you know you're going to use their value at least once. If you don't, you have to wrap your value in a function that doesn't take any argument
  9 KB (1,503 words) - 13:55, 15 December 2019
• 10分で学ぶHaskell
  :[(1,'a'),(2,'b'),(3,'c'),(4,'d'),(5,'e')] [ ("Chris", 472), ("Don", 100), ("Simon", -5) ]
  17 KB (1,020 words) - 07:22, 9 June 2023
• Performance/Strictness
  ...ed. The resulting function won't use any heap while it is running, as you'd expect. -- Don't force: f isn't building on x, so just let g deal with it.
  7 KB (1,162 words) - 17:16, 8 June 2022
• GHC/Using rules
  (along with build's unfolding) else we'd get an infinite loop You can complete a rule system this way by hand, although it'd be quite a nice thing to automate it in GHC.
  19 KB (3,096 words) - 17:21, 4 February 2023
• Hac Boston
  ...t on the [[/Projects|projects page]] and set up a public repository if you don't already have one, so that other people can help hack on your project. ...l an up to date Haskell toolchain: at least ghc and cabal-install. If you don't already have these installed (or need to install from scratch on the lapt
  7 KB (1,102 words) - 22:17, 25 June 2014

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