Search results

• Pointfree
  composition of other functions, never mentioning the actual arguments ...he 'points' of pointfree style are the <hask>(.)</hask> operator (function composition, as an ASCII symbol), which uses the same identifier as the decimal point.
  10 KB (1,782 words) - 14:44, 5 June 2011
• Lazy functors
  ...rn] by Jeremy Gibbons and Bruno C. d. S. Oliveira, Section 5.2 "Sequential composition of traversals"
  3 KB (500 words) - 14:59, 31 July 2011
• Diagrams/Dev/Transformations
  Linear transformations are closed under composition and form a monoid with the identity function as the neutral element. Affine transformations are also closed under composition, and are used as the basis for all transformations in <code>diagrams</code>
  14 KB (2,245 words) - 03:01, 11 April 2015
• User:Michiexile/MATH198/Lecture 2
  ...rphism <math>x:1\to A</math>, then the value <math>f(x)</math> is just the composition <math>f\circ x:1\to A\to B</math>. Note, also, that since <math>1</math> is ...irc f</math> is monic, do any of <math>g,f</math> have to be monic? If the composition is epic, do any of the factors have to be epic?
  18 KB (3,153 words) - 06:10, 7 December 2009
• User:Michiexile/MATH198/Lecture 3
  ...functors between them. Being graph homomorphisms, functors compose, their composition fulfills all requirements on forming a category. It is sometimes useful to ...= C_1</math> with the monoidal structure on <math>U(C)</math> given by the composition in <math>C</math>. For an arrow <math>F:A\to B</math> we define <math>U(F)
  19 KB (3,419 words) - 01:21, 8 October 2009
• Applicative functor
  for the composition of the functors <hask>f</hask> and <hask>g</hask>. It can be useful to use the applicative composition even when you have a monad transformer at hand. In the example above <hask>
  8 KB (1,326 words) - 08:20, 31 March 2022
• Tangible Value
  ...lues and interfaces are ''combined'' for direct use, and ''separable'' for composition. This combination makes for software that is ''ready to use and ready to r == Composition of TVs ==
  13 KB (1,988 words) - 02:05, 24 September 2021
• Merely monadic
  * the ''time of composition'': when it is defined; ...lt of the aformentioned separation of concerns, most notably the ''time of composition''. Monadic actions thus resemble programs in a particular [[EDSL]] (''embed
  6 KB (988 words) - 04:35, 16 March 2021
• Diagrams/Dev
  * [[/AlignedCompose|Aligned composition]]
  3 KB (338 words) - 19:39, 16 October 2016
• Old-reactive
  Composition is via standard type classes: <hask>Functor</hask>, <hask>Applicative</hask ...active</hask> and <hask>Fun Time</hask> is wrapped in a [[TypeCompose|type composition]], we get <hask>Functor</hask> and <hask>Applicative</hask> instances for f
  10 KB (1,586 words) - 10:40, 17 July 2011
• User:Michiexile/MATH198/Lecture 4
  ...s, and the identity arrow itself, make the diagram commute. Therefore, the composition has to be the identity. QED.
  11 KB (2,014 words) - 06:07, 22 October 2009
• Partible laws
  ...ble for reasoning about the definitions of programs e.g. verifying Kleisli-composition: ...<i>Kleisli-composition</i> style:
  13 KB (2,108 words) - 12:52, 1 January 2024
• The Monad.Reader/Issue2/Haskore
  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
• Example code
  * [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
• Haskell in web browser/Haskell web toolkit
  ====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
• Recursive function theory
  ...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
• The Monad.Reader/Issue5/Generating Polyominoes
  ...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
• Arrow tutorial
  ...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
• GHC/Redesign
  ...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
• Lambdabot
  * Dynamic plugin composition
  5 KB (687 words) - 22:37, 16 February 2013

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