Skip to main content Accessibility help

Applicative programming with effects


In this article, 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 article, introducing the applicative pattern by diverse examples, then abstracting it to define the Applicative type class and introducing a bracket notation that interprets the normal application syntax in the idiom of an Applicative functor. Furthermore, 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 Arrow.

Hide All
Baars, A., Löh, A. & Swierstra, S. D. (2004) Parsing permutation phrases. Journal of Functional Programming, 14 (6), 635646.
Barr, M. & Wells, C. (1984) Toposes, Triples and Theories. Grundlehren der Mathematischen Wissenschaften, no. 278. New York:Springer, Chap. 9.
Coutts, D. (2002) Arrows for Errors: Extending the Error Monad. Unpublished presentation at the Summer School on Advanced Functional Programming.
Fridlender, D. & Indrika, M. (2000) Do we need dependent types? Journal of Functional Programming, 10 (4), 409415.
Hughes, J. (2000) Generalising monads to arrows. Science of Computer Programming, 37 (1–3), 67111.
Hutton, G. & Meijer, E. (1998) Monadic parsing in Haskell. Journal of Functional Programming, 8 (4), 437444.
Leijen, D. & Meijer, E. (1999) Domain specific embedded compilers. 2nd Conference on Domain-Specific Languages (DSL). USENIX, Austin, TX, USA.
Meertens, L. (1998) Functor pulling. Workshop on Generic Programming (WGP'98). Marstrand, Sweden: Chalmers University of Technology.
Peyton Jones, S. (ed). (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press.
Power, J. & Robinson, E. (1997) Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7 (5), 453468.
Röjemo, N. (1995) Garbage Collection and Memory Efficiency in Lazy Functional Languages. Ph.D. thesis, Chalmers University of Technology and Göteborg University.
Swierstra, S. D. & Duponcheel, L. (1996) Deterministic, error-correcting combinator parsers. Pages 184–207 of: Launchbury, J., Meijer, E. & Sheard, T. (eds), Advanced Functional Programming. LNCS, vol. 1129. Springer.
Wadler, P. (1985) How to replace failure by a list of successes. Pages 113–128 of: Jouannaud, J.-P. (ed), Functional Programming Languages and Computer Architecture. LNCS, vol. 201. Springer.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Applicative programming with effects

Submit a response


No Discussions have been published for this article.


Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *