Free applicative functors

MaRDI QIDQ4995159zbMATH OpenFDO

Authors Paolo Capriotti, Ambrus Kaposi

Publication date 23 June 2021

Full work available at URL https://arxiv.org/abs/1403.0749, http://eptcs.web.cse.unsw.edu.au/paper.cgi?MSFP2014.2

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Functional programming and lambda calculus (68N18)

Abstract: Applicative functors are a generalisation of monads. Both allow the expression of effectful computations into an otherwise pure language, like Haskell. Applicative functors are to be preferred to monads when the structure of a computation is fixed a priori. That makes it possible to perform certain kinds of static analysis on applicative values. We define a notion of free applicative functor, prove that it satisfies the appropriate laws, and that the construction is left adjoint to a suitable forgetful functor. We show how free applicative functors can be used to implement embedded DSLs which can be statically analysed.

Recommendations

• Constructing Applicative Functors
• Applicative programming with effects
• Notions of computation as monoids
• Generalising monads to arrows
• A new notation for arrows

Cited in

(7)

• Constructing Applicative Functors
• Asymptotic Improvement of Computations over Free Monads
• Notions of computation as monoids
• Build systems à la carte: theory and practice
• A representation theorem for second-order functionals
• Breadth-first traversal via staging
• Structured monads for generic first-order syntax metatheory

This page was built for publication: Free applicative functors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995159)