Search results
Jump to navigation
Jump to search
- ;Functors preserve composition of morphisms3 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 inefficie3 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 Moskvin7 KB (918 words) - 11:33, 4 April 2012
- Kleisli composition forms<br>4 KB (621 words) - 05:56, 26 April 2021
- It is, thus the composition of the uniquely existing morphism from a coalgebra to the final coalgebra f The ''metamorphism'' is the ''other'' composition of an anamorphism with a catamorphism. It takes some structure, deconstruct14 KB (2,489 words) - 18:40, 17 November 2009
- Using "<hask>g `O` f</hask>" for the ''composition'' of type constructors <hask>g</hask> and <hask>f</hask>, the representatio3 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
- The composition of these yields a monad <math>T</math> in <math>Set</math> taking a set <ma ...''operad'' is a graded set <math>O = \bigoplus_i O_i</math> equipped with composition operations <math>\circ_i: O_n\oplus O_m\to O_{n+m-1}</math> that obey certa16 KB (2,852 words) - 15:45, 22 November 2009
- :''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 "function15 KB (2,547 words) - 21:58, 29 October 2011
- ...terms with morphisms that have equality built in, and provides associative composition ''for free''. ...fically, since the morphisms of cones are morphisms in <math>C</math>, and composition is carried straight over, so proving a map is an isomorphism in the cone ca18 KB (3,328 words) - 06:32, 28 October 2009
- .../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
- parallel composition <b>par</b>, and sequential composition <b>seq</b>. With11 KB (1,692 words) - 16:37, 28 January 2023
- ...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 resu6 KB (927 words) - 12:02, 19 April 2024
- ...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 (g7 KB (1,086 words) - 10:33, 9 March 2023
- ...k>mapAccumL</hask> like functions. Many important operations like function composition maintain the causality property. They are important in feedback loops where7 KB (1,030 words) - 19:38, 15 May 2012
- 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