Find link

language:

Find link is a tool written by Edward Betts.

searching for Functor (functional programming) 32 found (38 total)

alternate case: functor (functional programming)

Monad (category theory) (4,489 words) [view diff] no match in snippet view article

a triple ( T , η , μ ) {\displaystyle (T,\eta ,\mu )} consisting of a functor T from a category to itself and two natural transformations η , μ {\displaystyle

Catamorphism (1,835 words) [view diff] no match in snippet view article find links to article

In functional programming, the concept of catamorphism (from the Ancient Greek: κατά "downwards" and μορφή "form, shape") denotes the unique homomorphism

Initial algebra (1,139 words) [view diff] no match in snippet view article find links to article

F-algebra. Initiality is established by the function known as foldr in functional programming languages such as Haskell and ML. Likewise, binary trees with elements

Monad (functional programming) (9,297 words) [view diff] no match in snippet view article

In functional programming, monads are a way to structure computations as a sequence of steps, where each step not only produces a value but also some extra

Higher-order function (2,643 words) [view diff] no match in snippet view article find links to article

functions are higher-order; in a typed lambda calculus, from which most functional programming languages are derived, higher-order functions that take one function

Category theory (3,910 words) [view diff] no match in snippet view article find links to article

areas of computer science also rely on category theory, such as functional programming and semantics. A category is formed by two sorts of objects: the

F-algebra (1,808 words) [view diff] no match in snippet view article find links to article

and these algebraic laws may then be glued together in terms of a single functor F, the signature. F-algebras can also be used to represent data structures

Currying (5,036 words) [view diff] no match in snippet view article find links to article

Currying is useful in both practical and theoretical settings. In functional programming languages, and many others, it provides a way of automatically managing

Memoization (3,740 words) [view diff] no match in snippet view article find links to article

overall speed-up. Memoization is heavily used in compilers for functional programming languages, which often use call by name evaluation strategy. To

Container (type theory) (739 words) [view diff] no match in snippet view article

Sam (2009). "Containers and Higher-Order Containers". Journal of Functional Programming. 19 (3–4): 469–492. doi:10.1017/S0956796809007323. Altenkirch, Thorsten;

Anamorphism (1,260 words) [view diff] no match in snippet view article find links to article

used in functional programming as unfolds. The categorical dual (aka opposite) of the anamorphism is the catamorphism. In functional programming, an anamorphism

Monoidal functor (1,285 words) [view diff] no match in snippet view article find links to article

theory, monoidal functors are functors between monoidal categories which preserve the monoidal structure. More specifically, a monoidal functor between two

Exponential object (1,143 words) [view diff] no match in snippet view article find links to article

subcategory spanned by the compactly generated Hausdorff spaces. In functional programming languages, the morphism eval {\displaystyle \operatorname {eval}

Lift (mathematics) (718 words) [view diff] no match in snippet view article

Hom functor are adjoint; however, they might not always lift to an exact sequence. This leads to the definition of the Tor functor and the Ext functor. A

Standard ML (3,714 words) [view diff] no match in snippet view article find links to article

Standard ML (SML) is a general-purpose, high-level, modular, functional programming language with compile-time type checking and type inference. It is

Cartesian closed category (2,611 words) [view diff] no match in snippet view article find links to article

The third condition is equivalent to the requirement that the functor – ×Y (i.e. the functor from C to C that maps objects X to X ×Y and morphisms φ to φ × idY)

Function space (1,225 words) [view diff] no match in snippet view article find links to article

bifunctor; but as (single) functor, of type [ X , − ] {\displaystyle [X,-]} , it appears as an adjoint functor to a functor of type − × X {\displaystyle

Idris (programming language) (899 words) [view diff] no match in snippet view article

Idris is a purely-functional programming language with dependent types, optional lazy evaluation, and features such as a totality checker. Idris may be

Haskell (4,594 words) [view diff] no match in snippet view article find links to article

Haskell (/ˈhæskəl/) is a general-purpose, statically typed, purely functional programming language with type inference and lazy evaluation. Haskell pioneered

Combinatory logic (5,301 words) [view diff] no match in snippet view article find links to article

theoretical model of computation and also as a basis for the design of functional programming languages. It is based on combinators, which were introduced by

Coinduction (1,962 words) [view diff] no match in snippet view article find links to article

stated. F-coalgebra Corecursion Bisimulation Anamorphism Total functional programming "Co-Logic Programming | Lambda the Ultimate". "Gopal Gupta's Home

Gérard Huet (1,136 words) [view diff] no match in snippet view article find links to article

2000–2004. He organized the Institute of Logical Foundations of Functional Programming during the Year of Programming at the University of Texas at Austin

Apache Commons (260 words) [view diff] no match in snippet view article find links to article

servlets and web applications 1.6.0 2025-06-05 Functor Supports functional programming using functors, objects representing functions 1.0 RC1 2011-10-20

Modulo (mathematics) (809 words) [view diff] no match in snippet view article

category theory as applied to functional programming, "operating modulo" is special jargon which refers to mapping a functor to a category by highlighting

Go! (programming language) (791 words) [view diff] no match in snippet view article

It is multi-threaded, strongly typed and higher order (in the functional programming sense). It has relation, function and action procedure definitions

Intuitionistic type theory (4,646 words) [view diff] no match in snippet view article find links to article

typed programming language: Design and implementation". Journal of Functional Programming. 23 (5): 552–593. doi:10.1017/S095679681300018X. ISSN 0956-7968

Transformation semigroup (1,053 words) [view diff] no match in snippet view article find links to article

Mauro (2017). "Notions of Computation as Monoids". Journal of Functional Programming. 27 (e21). arXiv:1406.4823. doi:10.1017/S0956796817000132. Clifford

Function (mathematics) (11,410 words) [view diff] no match in snippet view article

Functor Associative array Closed-form expression Elementary function Functional Functional decomposition Functional predicate Functional programming Parametric

Generic programming (7,796 words) [view diff] no match in snippet view article find links to article

employed by the language.[citation needed] The term has been used in functional programming, specifically in Haskell-like languages, which use a structural

Monoid (4,462 words) [view diff] no match in snippet view article find links to article

S. This conversion of any semigroup to the monoid is done by the free functor between the category of semigroups and the category of monoids. Thus, an

Prolog (8,098 words) [view diff] no match in snippet view article find links to article

maplist(P, Xs, Ys) is equivalent to applying the map function in functional programming as Ys = map(Function, Xs). Higher-order programming style in Prolog

Smalltalk (9,662 words) [view diff] no match in snippet view article find links to article

allAmounts select: [:anAmount | anAmount isPositive] This is related to functional programming, wherein patterns of computation (here selection) are abstracted