Live briefing
Everything about Applicative functor
Intermediate structure between functors and monads
In functional programming, an applicative functor, or an applicative for short, is an intermediate structure between functors and monads. Applicative functors allow for functorial computations to be sequenced, but don't allow using results from prior computations in the definition of subsequent ones. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Applicative functorA 5-minute orientation
- Pick up a classic book: Commutative algebra and its connections to geometryThe most-reprinted book on the subject
- Read the landmark paper: Free Applicative FunctorsCited 17 times
- Go sideways: Functor (functional programming)A closely related topic
- Go sideways: Monad (functional programming)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
- 📕Commutative algebra and its connections to geometryPan-American Advanced Studies Institute (2009 Universidade Federal de Pernambuco) · 2011
- 📕Hopf algebras and tensor categoriesConference on Hopf Algebras and Tensor Categories (2011 University of Almeria) · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Functor (functional programming) In functional programming, a functor is a design pattern inspired by the definition from category theory that allows one to apply a function to values…
- Monad (functional programming) In functional programming, monads are a way to structure computations as a sequence of steps, where each step produces a value, plus some extra information…
- Catamorphism In functional programming, the concept of catamorphism (from the Ancient Greek: κατά "downwards" and μορφή "form, shape") denotes the unique homomorphism…
- Haskell features This article describes the features in the programming language Haskell. A simple example that is often used to demonstrate the syntax of functional languages…
- Monad (category theory) In category theory, a branch of mathematics, a monad is a triple (T,η,μ) consisting of a functor T from a category to itself and two natural transformations…
- Map (higher-order function) In many programming languages, map is a higher-order function that applies a given function to each element of a collection, e.g. a list or set, returning…
- Corecursion In computer science, corecursion is a type of operation that is dual to (structural) recursion. Whereas recursion consumes a data structure by first handling…
- Currying In mathematics and computer science, currying (named after Haskell Curry) is the technique of translating a function that takes multiple arguments into…