Search results

• 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
• The Monad.Reader/Issue3/Notes on Learning Haskell
  ...can sometimes be very obscure, misleading even. Especially in the realm of types and classes. ...errors can be rather tricky to spot, especially when inferred intermediate types are being used. In the following example, the same error is less easy to de
  31 KB (5,175 words) - 04:59, 9 March 2011
• Old-reactive
  Composition is via standard type classes: <hask>Functor</hask>, <hask>Applicative</hask>, <hask>Monad</ ...ilability. A reactive value is a discretly time-varying value. These two types are closely linked: a reactive value is defined by an initial value and an
  10 KB (1,586 words) - 10:40, 17 July 2011
• AMI Tool
  ...ject library produced by this package needs to dynamically link to certain standard Haskell libraries, at run time. I'm working on a statically linked version ==== New data types ====
  9 KB (1,341 words) - 13:22, 30 April 2013
• Programming guidelines
  * In Haskell types start with capital and functions with lowercase letters, so only avoid infi * In the standard libraries, some parts of Haskell code use [https://en.wikipedia.org/wiki/Sn
  17 KB (2,651 words) - 09:36, 10 August 2022
• AutoForms/Tutorial
  * abstract over a larger set of standard dialogs - by standard dialog we mean dialogs like a file dialog or an error dialog We have decided to make our own Cron-like daemon, in stead of using the standard Unix Cron, as:
  17 KB (2,576 words) - 21:25, 29 October 2011
• Synthesizer
  ...int numbers, but the sampling parameters rate and amplitude can be complex types, like numbers with physical units, ...f a signal processing expression. They are inferred automatically, just as types are inferred in Haskell's type system. Although the inference of signal par
  7 KB (1,030 words) - 19:38, 15 May 2012
• Smart constructors
  the typecheck perform the check statically, using [[Phantom type|phantom types]] Firstly, define some [[Peano numbers]] to represent the number of bands as types:
  9 KB (1,351 words) - 18:21, 6 June 2020
• Es/Librerias y Herramientas/Estructuras de Datos
  :The discrete interval encoding tree is a structure for storing subsets of types having a total order and a predecessor and a successor function. ...eous collection is a datatype that is capable of storing data of different types, while providing operations for look-up, update, iteration, and others. The
  10 KB (1,459 words) - 19:29, 15 August 2019
• Do notation considered harmful
  ...skell's standard libraries only after [[monad]]s and [[arrow]]s, thus many types were instances of the <hask>Monad</hask> and <hask>Arrow</hask> classes, bu Thus we cannot use standard <hask>guard</hask> for this monad.
  10 KB (1,589 words) - 01:08, 27 September 2021
• The Monad.Reader/Issue2/Bzlib2Binding
  is part of the standard library. It enables Haskell functions to call # Find appropriate Haskell types for the C types.
  15 KB (2,511 words) - 06:03, 1 June 2022

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