Search results

• DDC/DestructiveUpdate
  Values of <hask>Point</hask> type are constructed in the standard way, and we can use the field names to access their components. ...nge our data definitions to include <hask>Ref</hask> or <hask>IORef</hask> types before we can update them. References are created on the fly with the refer
  3 KB (430 words) - 00:46, 24 February 2018
• Shootout/Recursive
  Taken from existing ackermann and takfp entries, with a standard fib. -- that arguments and result types match, as per the spec.
  6 KB (1,027 words) - 03:46, 15 February 2007
• Handling errors in Haskell
  These are the four types of error handling that are standard and ...implements a checked exception monad, etc. but the following ones are the standard ones seen in the wild.
  5 KB (795 words) - 08:03, 3 August 2017
• Applications and libraries/Generic programming/Strafunski
  == Subset of data types covered == ...ions can be called by normal functions without exposing this fact in their types. This is called the "Keyhole Operation" design pattern in "Design Patterns
  7 KB (931 words) - 03:51, 10 December 2011
• IO at work
  This is where the <code>IO</code> types come into play. ...as parameters). The combinators usually have an <code>IO</code> result. In standard Haskell, there's ''no'' combinator having <code>IO</code> parameters, but n
  8 KB (1,215 words) - 07:10, 12 June 2023
• Type
  In Haskell, '''types''' are how you describe the data your program will work with. Let's look at some examples. The Haskell standard data type [[Maybe]] is typically declared as:
  7 KB (1,016 words) - 15:20, 6 February 2021
• Monad (sans metaphors)
  In Haskell, a monad is a type constructor with two operations, implementing a standard interface and following a few simple rules: ...type class tells you the interface (what operations you've got, and their types),
  4 KB (668 words) - 08:53, 21 September 2021
• Library/ArrayRef
  Unboxed references can only contain values of the following types: Ptr a, FunPtr a, StablePtr a. These types are members of the Unboxed class
  13 KB (2,025 words) - 19:32, 23 February 2008
• Rhine
  Signal functions are aware of time and internal state. Standard arrowized FRP constructions are implemented in Rhine: Like in standard Haskell, monad transformers need to be handled. In Rhine (and Dunai), inter
  8 KB (1,207 words) - 21:07, 26 September 2018
• Time
  ...he time package keeps these different concepts separated by different data types with appropriate transformations between them to help keep your logic sound ...associated concepts before moving onto the more complex, widely used, data types.
  11 KB (1,837 words) - 06:28, 8 October 2022
• Library/AltBinary
  ...putBit/putWord8...putWord64/getBit/... is also supported for all integral types) types:
  22 KB (3,405 words) - 19:18, 27 December 2006
• GADTs for dummies
  is [http://www.cs.ox.ac.uk/ralf.hinze/publications/With.pdf "Fun with phantom types"]. Phantom types is another name of GADT. You should also know that this
  14 KB (2,322 words) - 13:55, 24 November 2023
• List function suggestions
  The following are versions of standard prelude functions, but intended for sorted lists. The advantage is that th ...irstsBy</hask> and <hask>intersectBy</hask> (which could have more general types to make this clear).
  8 KB (1,277 words) - 11:14, 16 June 2012
• Nitpicks
  * Replace the special if-then-else syntax with a standard prelude function. See https://wiki.haskell.org/If-then-else . * The kind for inhabited types <hask>*</hask> is not an operator. See https://ghc.haskell.org/trac/ghc/wik
  7 KB (1,033 words) - 01:16, 27 September 2021
• DDC/ClassSystem
  ...passes its data though, so the same region is on both argument and return types. The <hask>Eq a</hask> here restricts 'forall a' to just the types that support equality.
  5 KB (774 words) - 12:35, 8 June 2023
• Blog articles/Mathematics
  ...ss.com/2006/12/04/non-standard-analysis-and-automatic-differentiation/ Non-standard analysis, automatic differentiation, Haskell] ...06/09/programs_are_proofs_models_and_1.php Programs are Proofs: Models and Types in Lambda Calculus]
  9 KB (903 words) - 07:20, 16 April 2020
• Generalised algebraic datatype
  See also [[Research papers/Type systems#Generalised Algebraic Data Types (GADTs)|research papers on type systems]]. * [http://ecommons.library.cornell.edu/handle/1813/5614 First-Class Phantom Types] by James Cheney and Ralf Hinze
  8 KB (1,374 words) - 14:33, 15 December 2022
• Trash/DDC/ClosureTyping
  But what happens if we partially apply <hask>f</hask>? The standard type system will re-generalize the type for the new binding and we're left ...ure terms is not significant to the type system. However, to make inferred types easier to read, DDC names the closure terms in a function's type after the
  3 KB (472 words) - 04:20, 8 June 2023
• Zipper
  There's a principled way to get the necessary types for contexts and the ...science.uu.nl/~jeuri101/homepage/Publications/tidata.pdf Type-indexed data types] by Ralf Hinze, Johan Jeuring and Andres Löh, or a similar paper [http://w
  10 KB (1,623 words) - 21:10, 26 June 2023
• Exception
  Unfortunately Haskell's standard library names common exceptions of IO actions <hask>IOError</hask> ...dy write a nice library and defer the decision of the particular exception types to the library user.
  10 KB (1,404 words) - 06:22, 22 January 2020

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