## Abstract

We revisit the connection between three notions of computation: Moggi's monads, Hughes's arrows and McBride and Paterson's idioms (also called applicative functors). We show that idioms are equivalent to arrows that satisfy the type isomorphism A;B ' 1;(A ! B) and that monads are equivalent to arrows that satisfy the type isomorphism A;B ' A ! (1;B). Further, idioms embed into arrows and arrows

embed into monads..

embed into monads..

Original language | English |
---|---|

Title of host publication | Mathematically Structured Functional Programming 2008 |

Number of pages | 19 |

Publication status | Published - 2008 |