Search results

Jump to navigation Jump to search
  • The sequential composition, expressed by the operator composition (I am tempted to write "played one after the other", but
    14 KB (2,261 words) - 19:12, 11 August 2008
  • * [http://www.cse.unsw.edu.au/~dons/data/Music.html Music.hs], a music composition system (literate latex-style Haskell) ([http://darcs.haskell.org/haskore/sr
    6 KB (921 words) - 11:17, 22 October 2022
  • ====Composition combinators==== ...>) appear second (''b'') at the right of the first (''a''). Result of such composition is also a widget, and it may be sequenced with other widgets. <code>(a +++
    24 KB (3,619 words) - 14:49, 7 March 2012
  • ...rking, but raises new questions: what about generalizing operations (here: composition) to deal with zero-arity cases in an appropriate way? ==== Composition ====
    13 KB (2,068 words) - 23:19, 3 June 2019
  • ...y to follow and provides a nice illustration of the usefulness of function composition in expressing algorithms in Haskell. The above program uses function composition to express an algorithm as a pipeline made up of three kinds of function: f
    11 KB (1,782 words) - 21:39, 21 February 2010
  • ...use the list type <code>[]</code> is monadic)! <code>(>>>)</code> performs composition, keeping track of all the multiple results. <code>split</code>, <code>(&&&) is a multi-valued composition <code>(g . f)</code>, and
    8 KB (1,315 words) - 00:43, 16 May 2024
  • ...n-existing file. I'd like to describe the behaviour of 'load' via function composition instead of mutable flags. Moreover, I'd like to remove the targets, module
    3 KB (404 words) - 23:03, 11 July 2021
  • * Dynamic plugin composition
    5 KB (687 words) - 22:37, 16 February 2013
  • ;Functors preserve composition of morphisms
    3 KB (603 words) - 22:50, 8 November 2021
  • ...s in a category, and equational laws are promoted to being equations about composition of morphisms. * The tensor product is composition: <math>F \otimes G = F \circ G</math>
    13 KB (2,245 words) - 15:18, 6 February 2021
  • It illustrates the use of [[ShowS]]-style function composition as an alternative to recursive list concatenation - the latter is inefficie
    3 KB (427 words) - 01:33, 28 December 2013
  • * [http://fprog.ru/2010/issue4/denis-moskvin-compositions-sections/ ''Composition Sections as a Tool of Pointfree Style''] by Denis Moskvin
    7 KB (918 words) - 11:33, 4 April 2012
  • Kleisli composition forms<br>
    4 KB (621 words) - 05:56, 26 April 2021
  • Using "<hask>g `O` f</hask>" for the ''composition'' of type constructors <hask>g</hask> and <hask>f</hask>, the representatio
    3 KB (486 words) - 21:52, 29 June 2021
  • ...ried and uncurried style allows [[Composing functions with multiple values|composition of functions with multiple values]]
    4 KB (669 words) - 02:17, 3 November 2023
  • :''elaborate:'' what does this function do? Is the period for function composition? ...language allows for unparallelled levels of abstraction through functional composition and higher-order functions. Where in most imperative languages a "function
    15 KB (2,547 words) - 21:58, 29 October 2011
  • .../hask> value by <hask>xLens</hask> from the state. The editor would be the composition of the following simpler editors:
    9 KB (1,506 words) - 18:10, 8 June 2013
  • ===On composition=== This nice code reuse via composition is achieved using the <code>(.)</code> function,
    19 KB (3,139 words) - 04:08, 22 October 2021
  • using the function composition operator <hask>.</hask>.
    9 KB (1,413 words) - 20:10, 11 January 2013
  • .../games-strategies-and-self-composition.html Games, Strategies and the Self-Composition of the List Monad.]
    9 KB (903 words) - 07:20, 16 April 2020

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