Search results

• 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
• Plainly partible
  ''Partible types'' are specific forms of ''pseudodata'' (a generalisation of [[Opting for or * they are all [[Uniqueness annotations for types|''unique'']]: no two values will ever be the same;
  11 KB (1,656 words) - 22:33, 4 July 2022
• MonadPlus reform proposal
  Some types could be made instances of both. For instance: ...nadPlus. MonadPlus is also barely made use of; just guard and msum in the standard? To be concrete, I would make the following the default definitions (in Mo
  4 KB (609 words) - 18:22, 23 June 2015
• GHC.Generics
  ==== Representation types ==== We can represent most Haskell datatypes using only the following primitive types:
  16 KB (2,615 words) - 20:24, 19 October 2020
• Learn Haskell in 10 minutes
  == Simple types == ...don't have to declare types unless you want to. If you do want to declare types, you use <hask>::</hask> to do it.
  13 KB (1,986 words) - 17:59, 9 August 2019
• Numeric Haskell: A Vector Tutorial
  ...suitable for passing to and from C, and you can convert between the array types. Arrays are indexed by non-negative <hask>Int</hask> values. The vector package provides several types of array. The most general interface is via [http://hackage.haskell.org/pac
  23 KB (3,342 words) - 19:28, 25 April 2013
• ZuriHac2015
  (*6) On Sunday we will provide three types of pizzas and a salad. ...use "discrimination" to do lots of things in O(n): Sorting many more data types than you'd expect, table joins, etc.
  13 KB (2,000 words) - 08:31, 31 May 2015
• HaBench
  * Make sure code is pure Haskell as accepted by standard Haskell 98 (with addendums) or Haskell' ...s as to which programs have the most room for improvement, as well as what types of optimizations are helpful for a given program.
  5 KB (697 words) - 16:59, 10 March 2011
• Category theory
  ...ategory"]], of which the objects are Haskell types, and the morphisms from types <hask>a</hask> to <hask>b</hask> are Haskell functions of type <hask>a -> b * the category of data types and functions on data structures
  9 KB (1,379 words) - 04:11, 14 February 2023
• Haskell Lisp
  .../justinethier/husk-scheme Husk Scheme] - Implements a superset of the R5RS standard and a large portion of the R7RS-small language. Advanced features are provi ...types, directly representing pattern-matching against a wide range of data types such as lists, multisets, sets, trees and graphs.
  5 KB (799 words) - 16:55, 23 March 2021
• The Monad.Reader/Issue5/HRay: A Haskell ray tracer
  ...th functions before moving on to the actual ray tracing engine. The needed types and datatypes are presented as needed. ===Types and datatypes===
  23 KB (3,591 words) - 20:03, 12 May 2008

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