Search results

Jump to navigation Jump to search

  • 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
  • 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
  • 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
  • Lifting
    ...s <hask>a</hask> and <hask>b</hask> into a function between pairs of these types. ...ines to containers into a single one and <hask>zeroL</hask>, which gives a standard container for ().
    7 KB (1,165 words) - 20:40, 31 October 2019
  • CTRex
    ...s of records are structs in c. In Haskell, we can currently declare record types as follows: A type-level record, i.e. the mapping of labels to types, such as <hask> {x = Int, y = Bool, z = String } </hask>, is called a '''ro
    25 KB (4,073 words) - 08:53, 9 December 2013
  • Web/Frameworks/HSP
    creating values of the same types as the literal XML syntax, though ...alized. Most of the packages can be configured, built and installed in the standard way.
    4 KB (597 words) - 10:39, 19 April 2021
  • GHC/Data Parallel Haskell
    ...defines variants of most list operations from the Haskell Prelude and the standard <hask>List</hask> library (e.g., we have <hask>lengthP</hask>, <hask>sumP</ ...l arrays also come with some aggregate operations that are absent from the standard list library, such as <hask>permuteP</hask>.
    21 KB (3,158 words) - 08:39, 10 August 2022
  • FFI complete examples
    === Calling standard library functions === import Foreign.C -- get the C types
    7 KB (1,181 words) - 21:12, 30 August 2014
  • GHC/Type families
    ...creating interfaces with enhanced static information, much like dependent types. ...h a type class. Standalone definitions are more general, while associated types can more clearly express how a type is used and lead to better error messag
    42 KB (6,828 words) - 17:15, 4 February 2023
  • HaRe
    * Some refactorings require types, which are retrieved using hint. ...need a parser that is maintained and up-to-date with the current language standard and extensions.
    4 KB (645 words) - 12:53, 4 August 2014
  • Upgrading packages/Updating to GHC 6.10
    * Changes to the return types of Map and Set functions Each of these has a standard way to solve the problem. Techniques should be attached here.
    11 KB (1,737 words) - 18:00, 13 March 2011
  • State Monad
    ...short tutorial on the state monad. Emphasis is placed on intuition. The types have been simplified to protect the innocent. Simple example that demonstrates the use of the standard Control.Monad.State monad. It's a simple string parsing algorithm.
    7 KB (1,055 words) - 15:06, 21 December 2018
  • SPOJ
    The standard Haskell IO using System.IO and [Char] (or String) is slow and will make ans with standard Prelude functions. I use the prefix <code>SS</code> in
    18 KB (3,044 words) - 03:03, 28 September 2009
  • How to read Haskell
    === Tip: types, functions and values === ...nd/or abused in ''any'' given piece of Haskell code. (A quick look at the Standard Prelude as provided in the Haskell 98 Report should be convincing enough fo
    15 KB (2,547 words) - 21:58, 29 October 2011
  • From a newbie
    ...poorly documented. It just makes life harder. (I could name any number of standard modules right now that have virtually ''no'' documentation beyond function ...fectly possible to write a state monad in plain Haskell. So ''why'' do the standard modules not to this??)
    11 KB (1,716 words) - 06:40, 29 November 2007
  • DataDriven
    ...pdf FranTk]. This time around, I've been particularly interested in using standard classes as much as possible, most centrally [http://www.haskell.org/ghc/doc Some of the useful event operations come through standard classes.
    13 KB (2,149 words) - 10:44, 17 July 2011
  • Hoogle
    Hoogle is a Haskell API search engine, which allows you to search many standard Haskell libraries by either function name, or by approximate [[type signatu ...name, or to avoid a package with -package. By default Hoogle will search a standard set of packages.
    18 KB (2,779 words) - 22:27, 12 June 2017
  • HAppS tutorial
    ...tomicity and Isolation and lets your app be simply a set of functions with types like: ...o convert between those internal haskell types and external protocol event types; e.g. from URL Encoded HTTP requests to SomeInputType and from SomeOutputTy
    33 KB (5,103 words) - 21:57, 15 September 2008
  • FrontpageDraft
    | [http://haskell.org/ghc/docs/latest/html/libraries/ Standard libraries] * '''[[Type inference]]''', which deduces types automatically and frees the programmer from writing superfluous type signat
    5 KB (636 words) - 04:07, 14 August 2021
  • Opting for oracles
    ...en Burton illustrates how oracle streams can be repurposed to convey other types of outside information, based on the classic example of [[Burton-style nond ...present when Burton's paper was first published, and now forms part of the standard <code>Prelude</code> for Haskell. Using the [https://downloads.haskell.org/
    6 KB (809 words) - 07:56, 12 June 2023
  • Haskell programming tips
    ...spend a minute trying to figure out why you've done that. But if you use a standard function, the reader will either immediately understand what you've done, o If you don't find appropriate functions in the standard library, extract a general function.
    29 KB (4,702 words) - 12:36, 4 May 2021
  • Why not Pointed?
    ...ou'd indeed get some finer grained control over what you could do with the standard classes. For instance lens would be able to give real types to affine traversals given Pointed -- one of their few legitimate uses!
    4 KB (765 words) - 04:26, 4 September 2013
  • HsLua
    Note that fresh Lua instances only have access to a dozen standard and results has simple enough types (lua numbers, strings, booleans, lists
    13 KB (2,016 words) - 18:34, 20 August 2017

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

Retrieved from "https://wiki.haskell.org/Special:Search"