binary functor

См. также в других словарях:

• Functor — For functors as a synonym of function objects in computer programming to pass function pointers along with its state, see function object. For the use of the functor morphism presented here in functional programming see also the fmap function of… …   Wikipedia

• Diagonal functor — In category theory, for any object a in any category where the product exists, there exists the diagonal morphism satisfying for , where πk …   Wikipedia

• Forgetful functor — In mathematics, in the area of category theory, a forgetful functor is a type of functor. The nomenclature is suggestive of such a functor s behaviour: given some object with structure as input, some or all of the object s structure or properties …   Wikipedia

• Monad (functional programming) — In functional programming, a monad is a programming structure that represents computations. Monads are a kind of abstract data type constructor that encapsulate program logic instead of data in the domain model. A defined monad allows the… …   Wikipedia

• Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …   Wikipedia

• Category theory — In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them: it abstracts from sets and functions to objects and morphisms . Categories now appear in most branches of mathematics and in… …   Wikipedia

• Comparison of programming languages (mapping) — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations …   Wikipedia

• Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… …   Wikipedia

• Groupoid — dablink|This article is about groupoids in category theory. For the algebraic structure with a single binary operation see magma (algebra). In mathematics, especially in category theory and homotopy theory, a groupoid is a simultaneous… …   Wikipedia

• Pre-Abelian category — In mathematics, specifically in category theory, a pre Abelian category is an additive category that has all kernels and cokernels.Spelled out in more detail, this means that a category C is pre Abelian if: # C is preadditive, that is enriched… …   Wikipedia

• Free object — In mathematics, the idea of a free object is one of the basic concepts of abstract algebra. It is a part of universal algebra, in the sense that it relates to all types of algebraic structure (with finitary operations). It also has a clean… …   Wikipedia