Skip to main content
×
×
Home

The arrow calculus

  • SAM LINDLEY (a1), PHILIP WADLER (a1) and JEREMY YALLOP (a1)
Abstract

We introduce the arrow calculus, a metalanguage for manipulating Hughes's arrows with close relations both to Moggi's metalanguage for monads and to Paterson's arrow notation. Arrows are classically defined by extending lambda calculus with three constructs satisfying nine (somewhat idiosyncratic) laws; in contrast, the arrow calculus adds four constructs satisfying five laws (which fit two well-known patterns). The five laws were previously known to be sound; we show that they are also complete, and hence that the five laws may replace the nine.

Copyright
References
Hide All
Atkey, R. (2008) What is a categorical model of arrows? In Mathematical Structures in Functional Programming, Capreta, V. & McBride, C. (eds), Electronic Notes in Theoretical Computer Science, Reykjavic, Iceland.
Benton, N. (1995) A mixed linear and non-linear logic: Proofs, terms and models. In Computer Science Logics, Pacholski, L. & Tiuryn, J. (eds), Lecture Notes in Computer Science, vol. 933. Springer–Verlag, Kazimierz, Poland.
Courtney, A. & Elliott, C. (2001) Genuinely Functional User Interfaces. Haskell workshop, 4169.
Hudak, P., Courtney, A., Nilsson, H. & Peterson, J. (2003) Arrows, robots, and functional reactive programming. In Advanced Functional Programming, 4th International School, Jeuring, J. & Jones, S. P. (eds), LNCS, vol. 2638. Springer-Verlag, Oxford, UK.
Hughes, J. (2000) Generalising monads to arrows, Sci Comput Program., 37: 67111.
Jansson, P. & Jeuring, J. (1999) Polytypic compact printing and parsing. Pages 273–287 of: European Symposium on Programming, LNCS, vol. 1576. Springer-Verlag, Amsterdam, The Netherlands.
Lindley, S., Wadler, P. & Yallop, J. (2008a) The Arrow Calculus. Tech. rept. EDI-INF-RR-1258. School of Informatics, University of Edinburgh.
Lindley, S., Wadler, P. & Yallop, J. (2008b) Idioms are oblivious, arrows are meticulous, monads are promiscuous. In Mathematical Structures in Functional Programming, Capreta, V. & McBride, C. (eds), Electronic Notes in Theoretical Computer Science, Reykjavic, Iceland.
McBride, C. & Paterson, R. (2008) Applicative programming with effects, J. Funct. Program., 18 (1): 113.
Moggi, E. (1991) Notions of computation and monads, Inf. Comput., 93 (1): 5592.
Paterson, R. (2001) A new notation for arrows. Pages 229–240 of: International Conference on Functional Programming, ACM Press, Florence, Italy.
Power, J. & Robinson, E. (1997) Premonoidal categories and notions of computation, Math. Struct. Comput. Sci., 7 (5): 453468.
Power, J. & Thielecke, H. (1999) Closed Freyd- and kappa-categories. In International colloquium on automata, languages, and programming, LNCS, vol. 1644. Springer, Prague, Czech Republic.
Sabry, A. & Felleisen, M. (1993) Reasoning about programs in continuation-passing style, Lisp Symbol. Comput., 6 (3/4): 289360.
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? *
×

Metrics

Altmetric attention score

Full text views

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

Abstract views

Total abstract views: 642 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd June 2018. This data will be updated every 24 hours.

The arrow calculus

  • SAM LINDLEY (a1), PHILIP WADLER (a1) and JEREMY YALLOP (a1)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *