Applicative Programming with Effects

by: Conor Mcbride, Ross Paterson

View FullText article

http://www.soi.city.ac.uk/~ross/papers/Ap…

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

pedagand, zednenem, josefs, mstone, bringert, conal, croys

Find related articles with these CiteULike tags

applicative, applicative-functors, arrows, effects, functional, functional-programming, haskell, monads, no-tag, type-composition, types

Abstract

In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. Indeed, it is the ubiquity of this programming pattern that drew us to the abstraction. We retrace our steps in this paper, introducing the applicative pattern by diverse examples, then abstracting it to define the Applicative type class and introducing a bracket notation which interprets the normal application syntax in the idiom of an Applicative functor. Further, we develop the properties of applicative functors and the generic operations they support. We close by identifying the categorical structure of applicative functors and examining their relationship both with Monads and with Arrows.

@article{citeulike:465691, abstract = {In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. Indeed, it is the ubiquity of this programming pattern that drew us to the abstraction. We retrace our steps in this paper, introducing the applicative pattern by diverse examples, then abstracting it to define the Applicative type class and introducing a bracket notation which interprets the normal application syntax in the idiom of an Applicative functor. Further, we develop the properties of applicative functors and the generic operations they support. We close by identifying the categorical structure of applicative functors and examining their relationship both with Monads and with Arrows.}, author = {Mcbride, Conor and Paterson, Ross }, citeulike-article-id = {465691}, keywords = {functional}, posted-at = {2008-04-24 14:01:47}, priority = {2}, title = {Applicative Programming with Effects}, url = {http://www.soi.city.ac.uk/\~{}ross/papers/Applicative.html} }

RIS record

TY - JOUR ID - citeulike:465691 L3 - citeulike-article-id:465691 TI - Applicative Programming with Effects N2 - In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. Indeed, it is the ubiquity of this programming pattern that drew us to the abstraction. We retrace our steps in this paper, introducing the applicative pattern by diverse examples, then abstracting it to define the Applicative type class and introducing a bracket notation which interprets the normal application syntax in the idiom of an Applicative functor. Further, we develop the properties of applicative functors and the generic operations they support. We close by identifying the categorical structure of applicative functors and examining their relationship both with Monads and with Arrows. KW - functional AU - Mcbride, Conor AU - Paterson, Ross UR - http://www.soi.city.ac.uk/~ross/papers/Applicative.html ER -

RIS BibTeX