R. Paterson. The Fun of Programming, page 201--222. (2003)
Abstract
With this machinery, we can give a common structure to programs based on different notions of computation. The generality of arrows tends to force one into a point-free style, which is useful for proving general properties. However it is not to everyone's taste, and can be awkward for programming specific instances. The solution is a point-wise notation for arrows, which is automatically translated to the functional language Haskell. Each notion of computation thus defines a special sublanguage of Haskell. 1 Notions of computation We shall explore what we mean by a notion of computation using four varied examples. As a point of comparison, we shall consider how the following operator on functions may be generalized to the various types of `function-like ' components.
%0 Conference Paper
%1 citeulike:14166627
%A Paterson, Ross
%B The Fun of Programming
%D 2003
%K functional-programming haskell
%P 201--222
%T Arrows and computation
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.1351
%X With this machinery, we can give a common structure to programs based on different notions of computation. The generality of arrows tends to force one into a point-free style, which is useful for proving general properties. However it is not to everyone's taste, and can be awkward for programming specific instances. The solution is a point-wise notation for arrows, which is automatically translated to the functional language Haskell. Each notion of computation thus defines a special sublanguage of Haskell. 1 Notions of computation We shall explore what we mean by a notion of computation using four varied examples. As a point of comparison, we shall consider how the following operator on functions may be generalized to the various types of `function-like ' components.
@inproceedings{citeulike:14166627,
abstract = {{With this machinery, we can give a common structure to programs based on different notions of computation. The generality of arrows tends to force one into a point-free style, which is useful for proving general properties. However it is not to everyone's taste, and can be awkward for programming specific instances. The solution is a point-wise notation for arrows, which is automatically translated to the functional language Haskell. Each notion of computation thus defines a special sublanguage of Haskell. 1 Notions of computation We shall explore what we mean by a notion of computation using four varied examples. As a point of comparison, we shall consider how the following operator on functions may be generalized to the various types of `function-like ' components.}},
added-at = {2019-06-18T20:47:03.000+0200},
author = {Paterson, Ross},
biburl = {https://www.bibsonomy.org/bibtex/2da9e097a9ce40cef5790210cceba3a85/alexv},
booktitle = {The Fun of Programming},
citeulike-article-id = {14166627},
citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.1351},
interhash = {aaca7140618c0956bfee6fc70906a5ae},
intrahash = {da9e097a9ce40cef5790210cceba3a85},
keywords = {functional-programming haskell},
pages = {201--222},
posted-at = {2016-10-17 02:56:39},
priority = {2},
timestamp = {2019-08-24T00:11:31.000+0200},
title = {{Arrows and computation}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.1351},
year = 2003
}