Search results

• 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
• Missing tutorials
  ...ications, inverses) with vectors and matrices. There are many packages and it takes a while to find the ones serving basic needs (i.e. small arrays, no s ...lications. There's two ways you could go about it. One might be to build it as a Haskell-for-Objective-C programmers, thing. Another might be Mac OS X
  1 KB (222 words) - 13:03, 5 March 2024
• MonadPlus reform proposal
  It is proposed that MonadPlus be split like this: ...us for the Maybe monad should be used as an implementation of morelse, but it is also possible to give an unbiased mplus for Maybe:
  4 KB (609 words) - 18:22, 23 June 2015
• Prelude
  If you wish to program without a prelude or to use a custom version of it you can suppress its automatic inclusion in several ways. The problem is al ...-XNoImplicitPrelude (or -fno-implicit-prelude in older [[GHC]]) that makes it not import Prelude implicitly. The option can be also specified by adding:
  1 KB (187 words) - 22:09, 28 June 2021
• Lazy evaluation
  '''Lazy evaluation''' is a method to evaluate a Haskell program. It means that expressions are not evaluated when they are bound to variables, ...o bypass undefined values (e.g. results of infinite loops) and in this way it also allows one to process formally infinite data.
  2 KB (291 words) - 15:20, 6 February 2021
• Denotative
  A programming language is trivially denotative if it only permits programs to be defined in terms of denotative expressions. ...O to be managed by the denotative language's implementation, with parts of it written in a non-denotative (I/O-capable) programming language.
  4 KB (490 words) - 12:00, 24 May 2024
• Burton-style nondeterminism
  ...nvolved in determining a <code>Decision</code> value only occur once: when it is initially used; * Once it has been determined, a <code>Decision</code> value won't change: it remains constant, even if reused.
  2 KB (341 words) - 09:18, 22 February 2022
• Jhc
  ...ient programs possible via whole program analysis and other optimizations. It also performs well as a cross compiler and is able to generate Windows prog ...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
  2 KB (230 words) - 22:57, 23 May 2014
• Anonymous function
  An anonymous function is a [[function]] without a name. It is a [[Lambda abstraction]] and might look like this: <hask>\x -> x + 1</ha ...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
• Safe Haskell
  Safe Haskell is a Haskell language extension. It is described in detail: As the Safe Haskell paper describes, it "hardens" the Haskell language by providing five properties:
  3 KB (471 words) - 03:00, 5 August 2021
• Haskell/Lazy evaluation
  ...e up in #haskell, and it seemed instructive to take the discussion and sum it up into a simple tutorial on lazy evaluation. ...empty list, and any Int. The 'any Int' part is fine, so we need to know if it's passed an empty list. Answering that question forces one step in the eval
  4 KB (708 words) - 23:10, 19 April 2021

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