A new notation for arrows

Authors
Citation
R. Paterson, A new notation for arrows, ACM SIGPL N, 36(10), 2001, pp. 229-240
Citations number
30
Categorie Soggetti
Computer Science & Engineering
Journal title
ACM SIGPLAN NOTICES
ISSN journal
15232867 → ACNP
Volume
36
Issue
10
Year of publication
2001
Pages
229 - 240
Database
ISI
SICI code
1523-2867(200110)36:10<229:ANNFA>2.0.ZU;2-K
Abstract
The categorical notion of monad, used by Moggi to structure denotational de scriptions, has proved to be a powerful tool for structuring combinator lib raries. Moreover, the monadic programming style provides a convenient synta x for many kinds of computation, so that each library defines a new sublang uage. Recently, several workers have proposed a generalization of monads, called variously "arrows" or Freyd-categories. The extra generality promises to in crease the power, expressiveness and efficiency of the embedded approach, b ut does not mesh as well with the native abstraction and application. Defin itions are typically given in a point-free style, which is useful for provi ng general properties, but can be awkward for programming specific instance s. In this paper we define a simple extension to the functional language Haske ll that makes these new notions of computation more convenient to use. Our language is similar to the monadic style, and has similar reasoning propert ies. Moreover, it is extensible, in the sense that new combining forms can be defined as expressions in the host language.