Search results

• Diagrams/Dev/AlignedCompose
  It seems like a major wart that often, in order to compose diagrams in a certa ...some require <code>Traced</code> and some do not. That is, specifically, it is hard to imagine what type we could give to the hypothetical lens <code>a
  2 KB (397 words) - 20:05, 1 June 2015
• ARM
  ...s a [http://en.wikipedia.org/wiki/RISC RISC] instruction set architecture. It is used in most of the mobile phones and in many other consumer electronics ...project with forking jhc.] Kiwamu Okabe created a fork of [[jhc]] and used it to program a [http://en.wikipedia.org/wiki/ARM_Cortex-M Cortex-M3] processo
  3 KB (409 words) - 07:55, 19 October 2015
• Common Language Runtime
  ...H JS crew have made some good progress on creating a new target for GHC so it's doable at least. ...this spin, head over to github page, and follow the READMEs carefully. It it also the only Mono compatible solution (but again, may require manual steps
  2 KB (405 words) - 10:31, 9 February 2019
• Haskell.org infrastructure
  ...It therefore also determines the policy on the uses of those machines that it pays for. If there are problems with infrastructure, it is good to check [https://status.haskell.org status.haskell.org] to see if
  1 KB (208 words) - 23:49, 17 May 2018
• GHC/TypeSigsAndAmbiguity
  ...alas not always. Perhaps this is a deficiency in GHC, but here's one way it can happen: Now GHC finished typechecking the right hand side of <tt>f</tt>, so next it checks that the constraints ''needed'' in the RHS, namely <tt>(C a b1)</tt>
  4 KB (716 words) - 11:30, 24 January 2016
• Maintenance of standard collection libraries
  ...rac (http://hackage.haskell.org/trac/ghc/wiki/CollectionLibraries) because it made better sense there.
  148 bytes (22 words) - 12:16, 8 June 2023
• Hac NYC/Talks
  If you'd like to give a talk, announce it here; tell us your name, the title of the talk, a short description. Pleas ...tion of what "univalence" could be and why it is reasonable to expect that it should compute.
  2 KB (335 words) - 15:02, 5 April 2014
• Hoare Property
  ...no bugs in it, or write code so complex that there are no obvious bugs in it.
  431 bytes (80 words) - 01:34, 17 June 2021
• Emacs/Project navigation
  ...ll buffer which will jump directly to its definition. You can also now use it for [[Emacs/Autocompletion|autocompletion]]. or just <code>M-x customize-group haskell</code> and it's in there.
  1 KB (170 words) - 18:23, 11 April 2016
• ILogBase
  ...based, it is limited in number sizes, and has accuracy errors that render it unusable even for simple purposes such as digit counting.
  1 KB (173 words) - 01:51, 14 July 2021
• Url
  The URL library provides a module Network.URL that makes it easy to work with HTTP URLs. ...following example shows how to parse a URL and then add some parameters to it:
  829 bytes (129 words) - 15:18, 6 February 2021
• Web/Projects and Ideas
  * See wai-handler-webkit, though it would be nice if it had better Windows support. Create a WAI handler which uses Webkit to conve ...ai-fastcgi. fastcgi handler for WAI. See the hack-handler-fastcgi package; it should be a simple port.
  1 KB (194 words) - 18:09, 27 January 2018
• Foldl as foldr alternative
  ...>. Yes, there is already [[Foldl as foldr|such a page]]! This one explains it differently. ...ges in the recursion. It turns out things will be simpler later if we pull it out:
  5 KB (891 words) - 14:21, 3 January 2018
• Infinity and efficiency
  In general, it is harder to reason about time and memory complexity of an implementation t We want to call it <code>dropWhileRev</code>.
  3 KB (422 words) - 21:22, 29 June 2021
• Show instance for functions
  Why is there a Show instance, but it only prints the type? ...en optimized to <hask>\x -> x :: Int -> Int</hask>. If it's used anywhere, it might have been inlined and optimized to nothing.
  3 KB (430 words) - 00:30, 1 February 2016
• GHC/Memory Management
  ...a new value. But GHC is able to efficiently manage garbage collection, so it's not uncommon to produce 1gb of data per second (most part of which will b ...pointed to from scratch. And since values are never modified, neither can it be pointed to later. This is the key property of immutable data.
  3 KB (490 words) - 21:19, 21 November 2022
• HAC
  * Each contest should focus (e.g. graph-related logic) on one topic, but wrap it in some sort of fun game/competition ** By focussing on one topic it will most likely be more informative to people studying those topics
  1 KB (213 words) - 01:07, 12 July 2021
• Alternatives and extensions for libraries
  ...nge of Haskell packages and modules. Your help is appreciated in expanding it. When editing this table, please try to keep it in alphabetical order (by package name, then by module name), maintain refl
  5 KB (633 words) - 15:16, 6 February 2021
• Piq
  '''Note''': Piq is not ready for use yet. It's waiting for [[Reactive]] to get into better shape.
  835 bytes (127 words) - 03:18, 9 April 2021
• Thunk
  It is used in Haskell systems that implement [[non-strict semantics]] by [[laz A lazy run-time system does not evaluate a thunk unless it has to.
  3 KB (450 words) - 20:07, 19 October 2020

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