Search results

• Scrap your boilerplate
  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
• Practice of Functional Programming
  * [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
• Haiku
  Kleisli composition forms<br>
  4 KB (621 words) - 05:56, 26 April 2021
• Applicative data-driven programming
  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
• Currying
  ...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
• How to read Haskell
  :''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
• LGtk/ADT lenses
  .../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
• Tutorials/Programming Haskell/String IO
  ===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
• Parameter order
  using the function composition operator <hask>.</hask>.
  9 KB (1,413 words) - 20:10, 11 January 2013
• Blog articles/Mathematics
  .../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
• Future of Haskell
  parallel composition <b>par</b>, and sequential composition <b>seq</b>. With
  11 KB (1,692 words) - 16:37, 28 January 2023
• Enumerator and iteratee
  ...messages, so <hask>it0</hask> and <hask>it1</hask> work in parallel. Their composition is denoted <hask>it1 . it0</hask>. If <hask>it0</hask> finishes, it is resu
  6 KB (927 words) - 12:02, 19 April 2024
• Hask
  ...y morphism for object <hask>A</hask> is <hask>id :: A -> A</hask>, and the composition of morphisms <hask>f</hask> and <hask>g</hask> is <hask>f . g = \x -> f (g
  7 KB (1,086 words) - 10:33, 9 March 2023
• Synthesizer
  ...k>mapAccumL</hask> like functions. Many important operations like function composition maintain the causality property. They are important in feedback loops where
  7 KB (1,030 words) - 19:38, 15 May 2012
• Monads as containers
  composition, and this is no coincidence. The reason that bind is so important what composition does.
  18 KB (3,270 words) - 05:36, 9 March 2021
• 99 questions/31 to 41
  ...lower and upper limit, print a list of all even numbers and their Goldbach composition.
  6 KB (805 words) - 02:30, 11 June 2023
• HWN/es/2006-10-19
  * [32]Games, Strategies and the Self-Composition of the List Monad 32. http://sigfpe.blogspot.com/2006/10/games-strategies-and-self-composition.html
  8 KB (1,191 words) - 01:56, 21 October 2006
• The Monad.Reader/Issue3/Notes on Learning Haskell
  (Hint: function application binds more tightly than any operator; function composition has very low precedence.) ===to concatenate `ShowS` values, use function composition===
  31 KB (5,175 words) - 04:59, 9 March 2011
• Haskell a la carte
  ::The dot <hask>f . g</hask> is good old function composition <math>f \circ g</math>. First apply g, then apply f. Simple example: squari
  6 KB (1,024 words) - 23:56, 25 June 2021
• HXT
  ...rs for building more complex functions from simpler ones. Of course filter composition, like <hask>(.)</hask>, becomes one of the most frequently used combinators ...we can read composition sequences from left to right, like pipes in Unix. Composition is defined as follows:<p></p>
  48 KB (6,937 words) - 00:20, 27 April 2016

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