Search results

• Toolmaking libraries
  ...their own implementations that hopefully make the extensions less painful to deal with. ...e, haddock doesn't care about terms at all, whereas other tools might want to know about dependencies and yet others might perform abstract interpretatio
  5 KB (735 words) - 15:20, 6 February 2021
• Unboxed type
  Since Haskell values may contain unevaluated thunks in addition to specific values, in general values must be represented by a pointer to a
  3 KB (470 words) - 09:25, 12 June 2023
• 99 questions/Solutions/41
  ...mall. Very rarely, the primes are both bigger than say 50. Try to find out how many such cases there are in the range 2..3000.
  992 bytes (161 words) - 19:48, 18 January 2014
• Constructor
  ...he data type is polymorphic (and <hask>a</hask> is a type variable that is to be substituted by a specific type). So when used, the values will have type ...nstructors, <hask>Tip</hask> and <hask>Node</hask>. Any value that belongs to the type <hask>Tree a</hask> (again, we leave the type parameter unspecifie
  6 KB (1,060 words) - 16:51, 18 June 2021
• GHC.Generics
  ...two flags: <tt>DeriveGeneric</tt> and <tt>DefaultSignatures</tt>. We show how this all works in this page, starting with a detailed example. He will have to specify an <hask>instance Serialize (UserTree a) where ...</hask> himself.
  16 KB (2,615 words) - 20:24, 19 October 2020
• IO then abstraction
  Even so, it is fair to object that the ‘monadified’ definition is ugly compared to its direct but not obviously terminating counterpart, with more intermediat
  6 KB (940 words) - 12:17, 19 April 2024
• GADTs for dummies
  ...time, I didn't understand what [[Generalised algebraic datatype]]s were or how they could be used. It almost seemed a conspiracy of silence &mdash; people ...) So, I want to share my understanding of GADTs. Maybe the way I realized how GADTs work could help
  14 KB (2,322 words) - 13:55, 24 November 2023
• Game Development
  In recent years this page has not been updated often enough to remain informative, so it probably has only a historical value at this poin ...021, the following forums seem the most active, so please ask there for up-to-date information:
  9 KB (1,258 words) - 05:36, 8 June 2023
• Failure
  ...so refer to the "error" function, which in fact causes a runtime exception to be triggered. ...refers to an exception which is thrown in the IO monad. It can also refer to the actual typeclass "Exception" which was introduced along with extensible
  6 KB (961 words) - 12:45, 12 August 2019
• List comprehension
  ...nerator <hask>c <- s</hask> feeds each character of <hask>s</hask> in turn to the left-hand expression <hask>toUpper c</hask>, building a new list. Note how each successive generator refines the results of the previous generator. Th
  5 KB (679 words) - 17:14, 4 February 2023
• Performance/Monads
  ...it can often impose a performance hit of up to 300% (your code will run up to three times slower). If you care about this, the best option is to flatten you stack of transformers into a single, hand unrolled monad. An ex
  6 KB (995 words) - 23:51, 16 April 2021
• Heterogenous collections
  To compare tuples vs lists: used to Java, with its loose typing of collections, not having this
  5 KB (863 words) - 11:44, 22 August 2021
• The Monad.Reader/Issue3/Functional Programming vs Object Oriented Programming
  .../.Net, or even Pascal or C, and intends to give a mapping from OO concepts to Haskell concepts. ...object that aren't modified aren't copied; you just retain the references to the originals). Also, you avoid any aliasing problems, which is a potential
  10 KB (1,718 words) - 07:14, 10 August 2022
• Partible laws
  ...s the set of <i>basic definitions</i> for <code>T</code>-values (analogous to the set of <i>primitive definitions</i> for a builtin type); * <code>g</code>'s parameter is meant to be used strictly and exclusively by a member of <i>S</i>(<code>T</code>):
  13 KB (2,108 words) - 12:52, 1 January 2024
• Checking for correct invocation of a command line haskell program
  [[Category:How to]] ...second is an example of "ugly" argument checking that is slightly simpler to write, but gives a less user friendly error message
  2 KB (244 words) - 02:29, 9 April 2021
• Darcs repositories
  Programmers love to read code. That's how we get a feel for what a language is. Here's a list of significant Haskell * [http://darcs.haskell.org/c2hs/ c2hs], a C to Haskell binding generator
  4 KB (536 words) - 00:28, 17 June 2021
• Arrow
  "They can do everything monads can do, and more. They are roughly comparable to monads with a static component." However "Arrows do have some problems". ...ve a self-contained material (e.g. section [[#Automaton]] gives links only to the finite state concept itself.).
  11 KB (1,636 words) - 20:01, 13 May 2020
• DeepArrow
  Besides this wiki page, here are more ways to learn about DeepArrow: ...t the composition chains directly spell out the paths to the value subpart to be edited.
  3 KB (540 words) - 21:40, 3 May 2024
• Introduction to Haskell IO
  ...ng useful code as quickly as possible. The pace will be slow and detailed to avoid confusing programmers who are unfamiliar with haskell, may not have a # [[Introduction to Haskell IO/General introduction]]
  10 KB (1,520 words) - 07:20, 10 November 2020
• Enumerator and iteratee
  ...thing that does one step in processing another piece of the big list. E.g. to sum up all elements of a list, we do of the collection and how to get to the next element; iteratee knows
  6 KB (927 words) - 12:02, 19 April 2024

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