Constructing Applicative Functors

DOI10.1007/978-3-642-31113-0_15MaRDI QIDQ2908572zbMATH OpenOpenAlexFDO

Authors Ross Paterson

Publication date 5 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://openaccess.city.ac.uk/id/eprint/1141/1/Constructors.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) General theory of categories and functors (18A99)

Recommendations

• Free applicative functors
• Double applicative functors
• Functorial approach structures
• Functoriality and extensions
• scientific article; zbMATH DE number 800106
• On constructing stably equivalent functors
• Constructible functors and the notion of tameness
• APLicative Programming with Naperian Functors
• Coarse equivalences of functorial constructions
• Frobenius functors: applications

Cited in

(10)

• APLicative Programming with Naperian Functors
• Double applicative functors
• A probability monad as the colimit of spaces of finite samples
• On structuring functional programs with monoidal profunctors
• Functorial approach structures
• Notions of computation as monoids
• Structured monads for generic first-order syntax metatheory
• Breadth-first traversal via staging
• The Cooper storage idiom
• Free applicative functors

This page was built for publication: Constructing Applicative Functors

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