Search results

• Diagrams/Dev/Migrate0.7
  ...es between diagrams 0.6 and 0.7, along with explanations of how to migrate to the new 0.7 API. ...You must now import <code>Diagrams.Coordinates</code> explicitly in order to make use of it.
  2 KB (297 words) - 06:13, 3 August 2013
• Combinator
  ...h no free variables" is a [[Pure|pure]] lambda-expression that refers only to its arguments, like ...and some "combinators" which can combine values of type T in various ways to build up more complex values of type T.
  2 KB (256 words) - 22:11, 3 May 2024
• Real World Applications/Event Driven Applications
  ...vents. Most non-trivial applications/architectures (from Operating Systems to Web Servers and Enterprise applications) are event driven. * A new Rostering Schedule is ready for distribution to all crew (Airline Management System).
  7 KB (1,076 words) - 08:53, 4 July 2014
• Parallel/Reading
  ''Note: you may want to read [[Parallelism vs. Concurrency]], as the terms have historically been c ...ead/concurrent-and-multicore-programming.html chapter 24]: an introduction to the most common forms of concurrent and parallel programming in GHC.
  4 KB (456 words) - 12:02, 9 May 2024
• Burton-style nondeterminism
  ...n an (theoretically) infinite structured value (which Burton simply refers to as ''pseudodata''). to convey the abstract values of type <code>Decision</code>.
  2 KB (341 words) - 09:18, 22 February 2022
• Manatee
  The goal of the Manatee project is to provide a fast, safe and flexible integrated environment for haskell hackin You can consider it is new environment mix Gnome and Emacs. Like Gnome to provide friendly graphics interface and work
  12 KB (1,458 words) - 02:36, 26 April 2021
• Applicative functor
  Monads allow you to run actions depending on the outcomes of earlier actions. then putStrLn "You refuse to enter something?"
  8 KB (1,326 words) - 08:20, 31 March 2022
• Cabal/Developer-FAQ
  ...yle="color: red">[WARNING: This page is *extremely* out of date and likely to be obsolete]</span> == How do I handle Haskell language extensions? ==
  7 KB (998 words) - 12:32, 2 October 2020
• Non-strict semantics
  ...her language has [[strict semantics]], in which if any subexpression fails to have a value, the whole expression fails with it. ...one of the most important features in Haskell: it is what allows programs to work with conceptually infinite data structures, and it is why people say t
  9 KB (1,503 words) - 13:55, 15 December 2019
• Infinity and efficiency
  In this article we demonstrate how to check the efficiency of an implementation by checking for proper results fo In general, it is harder to reason about time and memory complexity of an implementation than about its
  3 KB (422 words) - 21:22, 29 June 2021
• BayHac2013/Denotative Programming
  <li>Worked out how to mechanically evaluate lambda calculus.</li> <li>Led to the lambda-calculus-based languages, including Scheme, ML, and Haskell.</li
  2 KB (316 words) - 14:12, 14 October 2021
• Cabal
  *[http://dev.stephendiehl.com/hask/#cabal An introduction to cabal-install] *[[How to write a Haskell program]]
  2 KB (244 words) - 12:34, 2 October 2020
• High-level option handling with GetOpt
  I've used Haskell to create various command-line utilities for unix-like has a simple, easy to use interface, handles short and long options,
  8 KB (1,082 words) - 23:30, 3 December 2020
• Encoding issues
  ...n between the two can be done in many ways. This page gives an overview of how these issues should be handled. ...geString/WhateverString. Such a type is either a list of bytes, equivalent to <hask>[Word8]</hask> or it is a string, a list of character, <hask>[Char]</
  2 KB (307 words) - 13:45, 23 May 2021
• Diagrams/Dev/Migrate1.2
  ...es between diagrams 1.1 and 1.2, along with explanations of how to migrate to the new 1.2 API. ...ails. The most noticeable effects of this change in porting diagrams code to 1.2 will be type errors on uses of attribute functions like <code>lw</code>
  5 KB (807 words) - 19:36, 30 June 2014
• Incompatibilities between MTL 1 and MTL 2
  incompatibilities relative to version 1, described below. See "[[Upgrading from MTL 1 to MTL 2]]" for instructions on how
  3 KB (378 words) - 15:19, 6 February 2021
• Hac NYC/Talks
  ...ase also let us know if you won't be attending Saturday afternoon and want to present at another time. | style="width: 150px;" | An invitation to Homotopy Type Theory
  2 KB (335 words) - 15:02, 5 April 2014
• Parallelism
  ''Note: you may want to read [[Parallelism vs. Concurrency]], as the terms have historically been c This page contains notes and information about how to write parallel programs in Haskell.
  3 KB (360 words) - 12:02, 9 May 2024
• Monad laws
  ...isely why they're known as ''identity'' and ''associative'' laws, you have to change your notation slightly. It's now easy to see that monad composition is an associative operator with left and right i
  5 KB (788 words) - 10:40, 1 February 2024
• GHC/Typed holes
  ...ki.portal.chalmers.se/agda/pmwiki.php Agda]. But what are typed holes, and how do they help us write code? ...the types. But it can be difficult sometimes when writing a program to see how the polymorphic types should exactly fit together, given the things in scop
  9 KB (1,711 words) - 20:19, 31 August 2014

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