Search results

• Library/New collections
  New Collections: A Modern Package of Collections Types * Easy to migrate from standard Lists/Sets/Maps to the new package. The package is an evolution (rather tha
  596 bytes (86 words) - 15:18, 6 February 2021
• Impredicative types
  ...types are an advanced form of polymorphism, to be contrasted with [[rank-N types]]. ...to be ''universally quantified'': <tt>id :: a -> a</tt> means "''for all'' types <tt>a</tt>, <tt>id</tt> can take an argument and return a result of that ty
  2 KB (347 words) - 11:46, 4 February 2023
• Web/Libraries/JavaScript and AJAX
  ...ch can generate further JMacro code, or any of a range of standard Haskell types, which are able to be marshalled into JMacro through typeclass methods.
  2 KB (222 words) - 23:55, 15 August 2011
• Library
  *[[Library/IO]] - a proposal for development of a new standard low-level IO library. *[[Library/New collections]] - A modern package of collections types.
  773 bytes (108 words) - 19:40, 4 June 2009
• News/1988
  * Hope+ and existential data types (Perry) * Yale Meeting, establishes goals of standard language, and the name Haskell is chosen.
  504 bytes (62 words) - 02:57, 29 June 2021
• Hoogle/Tutorial
  ...API Search can search for either names, or types. For example, to find the standard <code>map :: (a -> b) -> [a] -> [b]</code> function you could search for:
  1,015 bytes (186 words) - 15:54, 15 February 2007
• Internationalization of Haskell programs
  === Using native Haskell data types === You can internationalize your program using native Haskell data types.
  5 KB (762 words) - 17:22, 13 January 2012
• Type inference
  ...ype inference''' is a feature of the type system which means that concrete types are deduced by the type system whereever it is obvious. Another example: There are the following standard functions:
  1 KB (221 words) - 07:35, 29 November 2007
• Strings
  There are several types of strings that can be used in Haskell programs. <hask>String</hask> is the only string type mandated by the language standard, and as such is overwhelmingly the most common, especially for non-performa
  2 KB (285 words) - 20:38, 2 March 2014
• Xmonad/Guided tour of the xmonad source
  basic Haskell: defining functions and data; the type system; standard functions, types, and type classes from the Standard Prelude; and at least
  3 KB (531 words) - 09:09, 15 August 2017
• Monad Transformer Library
  ...fferent by necessity, because they used different technology, but the data types themselves were duplicated for no reason. ...rary that used no extensions to Haskell98 and only defined the transformer types themselves, so that more advanced libraries could share them as a base. mon
  3 KB (429 words) - 17:04, 21 December 2012
• Partial functions
  ...for all possible arguments of the specified type. Examples in the Haskell standard library are: ...al function, it's because your types are incorrect and you should fix your types rather than writing partial functions which guarantee the impossible.
  1 KB (247 words) - 16:53, 15 November 2014
• Merely monadic
  In Haskell, ''monadic types'' - types having an instance for the <code>Monad</code> class - can be thought of as ...often makes the monadic interface the preferred choice for ''abstract data types'', where the inner workings of monadic actions must be kept private e.g. to
  6 KB (988 words) - 04:35, 16 March 2021
• Applications and libraries/Generic programming/Lightweight
  <li><p>Requires Haskell 98 + existential types</p></li> == Subset of data types covered ==
  5 KB (859 words) - 10:10, 20 April 2021
• Peano numbers
  === Peano number types === ...hask> has kind <hask>* -> *</hask>. The natural numbers are represented by types (of kind <hask>*</hask>) <hask>Zero</hask>, <hask>Succ Zero</hask>, <hask>S
  4 KB (571 words) - 20:38, 26 November 2022
• Numeric Prelude
  ...re both certain new type classes representing algebraic structures and new types of mathematical objects. Currently supported algebraic structures are ...which is useful both for applications and testing the class hierarchy. The types are
  4 KB (544 words) - 17:33, 9 July 2012
• GHC/Stand-alone deriving declarations
  == Deriving data types with non-standard contexts == because the instance declaration would have a non-standard context. It would have to look like this:
  5 KB (755 words) - 22:49, 12 June 2021
• Simple to complex
  == Types == from which you can build more complex types.
  6 KB (1,000 words) - 16:35, 6 February 2009
• Hexpat/
  -- it to standard out. ...t data type, which is faster than the standard Haskell String. (Both data types are shown on the graph for hexpat.)
  4 KB (552 words) - 09:01, 20 February 2010
• Wc
  == Standard [Char] == import Foreign.C.Types
  8 KB (1,320 words) - 10:40, 9 April 2013
• Hac4/Projects
  ...iety of web servers. It borrows heavily from Python's successful WSGI [2] standard, which serves the same purpose, and recent interest in writing web applicat ...lows us to reuse all the cool HSP functionality with other monads than the standard HSP one (which is now HSPT IO). In particular this allows us to reuse the l
  4 KB (626 words) - 13:14, 17 December 2012
• HSQL
  Patching HSQL to work with recent GHC and Cabal versions is a standard process described in [[Upgrading packages]]. Database.HSQL.Types
  2 KB (252 words) - 21:41, 2 October 2008
• Traits type class
  ...ssociate information with a [[type]], not just a value. An example is the standard <hask>Bounded</hask> class: ...on with [[Functional dependencies]]. For example, there may be some float types for which an Int may not be sufficient to express the number of digits in t
  3 KB (408 words) - 18:20, 18 August 2009
• Constructor
  ...to be substituted by a specific type). So when used, the values will have types like <hask>Tree Int</hask> or <hask>Tree (Tree Boolean)</hask>. ...g to a type. On the other hand, <hask>Node</hask> contains other data. The types of those data are its parameters. The first one has type <hask>a</hask>, so
  6 KB (1,060 words) - 16:51, 18 June 2021
• MapReduce as a monad
  ...turally, using functional programming techniques, as a form of monad. The standard implementation of MapReduce is the JAVA-based HADOOP framework, which is ve where <hask>s</hask> and <hask>s'</hask> are data types and <hask>a</hask> and <hask>b</hask> are key values.
  6 KB (1,053 words) - 03:27, 9 April 2021
• Installers
  The compilers which are committed to implementing this standard ''(note that this document is still in the discussion phase)'' are: [[Yhc]] ...h Tool", ..) will be available via the right-click menu for files of these types. If the user picks no, then no changes will be made to the .lhs/.hs associa
  6 KB (1,025 words) - 20:14, 9 December 2020
• Haskell Platform/FAQ
  ...stead, we rely on the large base library to provide the standard interface types. Addition to the platform is a social process. This social process acts as
  1 KB (214 words) - 15:19, 6 February 2021
• Applications and libraries/Generic programming/SyB
  <li><p>rank-2 types</p></li> Rank-2 types are supported by GHC and Hugs and are going to be part of Haskell'.
  5 KB (827 words) - 04:00, 6 April 2021
• TypeCompose/Versions
  ...ir</hask> & <hask>Data.Fun</hask>. Classes of pair-like and function-like types. * Eliminated dependency on "mtl" package by removing a standard applicative instance for <hask>ReaderT</hask>.
  3 KB (440 words) - 17:28, 18 March 2008
• Hoogle/Specs
  At the top of each file is a list of types and their arities, for example: Maybe=1, []=1, Bool=0 Need a standard and an advanced section. Standard is just a textbox. Advanced both parses the search and allows you to type i
  5 KB (854 words) - 14:39, 2 July 2006
• Short theorem prover
  In order to avoid infinite types (which are not intrinsically dangerous in a programming language but wreak The deduction steps are performed by a standard unification routine:
  3 KB (694 words) - 08:23, 13 December 2009
• Cn/十分钟学会 Haskell
  类型 [[Type|types]]（以及类型类 type [[class]]es，稍后提及）总是以大写开头 Function types are written with the argument type, then <hask> -> </hask>, then the result
  14 KB (1,168 words) - 07:39, 12 February 2012
• Jmacro
  mainly compatible with standard Javascript. Most Javascript code in range of standard Haskell types, which are able to be marshalled into
  8 KB (1,206 words) - 23:52, 29 July 2011
• GHC optimisations
  ...function call is replaced by that function's definition. For example, the standard <hask>map</hask> function can be defined as ...expose new optimisations opportunities; <hask>map</hask> works for ''any'' types, whereas <hask>foo</hask> probably works for only ''one'' type.)
  14 KB (2,322 words) - 09:32, 18 January 2008
• The Monad.Reader/Issue5/Different Language
  ...from standard input and display all lines containing the word "Haskell" on standard output. I'll go through this example with you in more detail and show you h ...unction starts by calling getContents. This returns the entire contents of standard input as a string. getContents is an IO action, so we use the <- operator t
  19 KB (3,237 words) - 01:33, 10 May 2008
• Functional dependencies
  ...y the others can, for example, be the return type but none of the argument types of some of the methods. ...s. You really need a multiplication function which overloads to different types:
  4 KB (706 words) - 22:41, 21 July 2021
• Simonpj/Talk:ListComp
  ...e that after the "foo", the types of "a", "b" and "c" have changed. Their types before "foo" get wrapped by "n" after "foo".) # The Down trick is very neat, perhaps that should be a part of the standard libraries.
  11 KB (1,836 words) - 02:36, 25 September 2007
• Libraries and tools/Linguistics/Applicative universal grammar
  ...ERICExtSearch_SearchType_0=eric_accno&objectId=0900000b80096971 Linguistic Types and the Valence of Operators in Applicative Universal Grammar] written by [ ...ew modification, by GHC too (''transpose'' must be explictly imported from standard library module ''Data.List'', and class ''Text'' renamed to ''Show'').
  5 KB (703 words) - 12:09, 4 September 2006
• Applications and libraries/Data structures
  :This is a package of many useful collections types. Advantages include: :*It's easy to migrate from standard Lists/Sets/Maps to the new package. The package is an evolution (rather tha
  17 KB (2,508 words) - 07:09, 8 June 2023
• Monad/ST
  {{Standard class|ST|module=Control.Monad.ST|module-doc=Control-Monad-ST|package=base}} [[Category:Standard classes]] [[Category:Monad]]
  5 KB (802 words) - 05:38, 4 August 2021
• 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

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