J. Hughes. 3622, chapter 2, page 73--129. Springer Berlin Heidelberg, Berlin, Heidelberg, (2005)
DOI: 10.1007/11546382\_2
Abstract
Consider this simple Haskell definition, of a function which counts the number of occurrences of a given word in a string: This is an example of ” point-free” programming style, where we build a function by composing others, and make heavy use of higher-order functions such as . Point-free programming is rightly popular: used appropriately, it makes for concise and readable definitions, which are well suited to equational reasoning in the style of Bird and Meertens 2. It's also a natural way to assemble programs from components, and closely related to connecting programs via pipes in the UNIX shell.
%0 Book Section
%1 Hughes2005Programming
%A Hughes, John
%C Berlin, Heidelberg
%D 2005
%E Vene, Varmo
%E Uustalu, Tarmo
%I Springer Berlin Heidelberg
%J Advanced Functional Programming
%K 18c20-algebras-and-kleisli-categories-associated-with-monads 68n18-functional-programming-and-lambda-calculus haskell
%P 73--129
%R 10.1007/11546382\_2
%T Programming with Arrows
%U http://dx.doi.org/10.1007/11546382\_2
%V 3622
%X Consider this simple Haskell definition, of a function which counts the number of occurrences of a given word in a string: This is an example of ” point-free” programming style, where we build a function by composing others, and make heavy use of higher-order functions such as . Point-free programming is rightly popular: used appropriately, it makes for concise and readable definitions, which are well suited to equational reasoning in the style of Bird and Meertens 2. It's also a natural way to assemble programs from components, and closely related to connecting programs via pipes in the UNIX shell.
%& 2
%@ 978-3-540-28540-3
@inbook{Hughes2005Programming,
abstract = {{Consider this simple Haskell definition, of a function which counts the number of occurrences of a given word in a string: This is an example of ” point-free” programming style, where we build a function by composing others, and make heavy use of higher-order functions such as . Point-free programming is rightly popular: used appropriately, it makes for concise and readable definitions, which are well suited to equational reasoning in the style of Bird and Meertens [2]. It's also a natural way to assemble programs from components, and closely related to connecting programs via pipes in the UNIX shell.}},
added-at = {2019-03-01T00:11:50.000+0100},
address = {Berlin, Heidelberg},
author = {Hughes, John},
biburl = {https://www.bibsonomy.org/bibtex/296db79f307fc109646c7ab5e7efa1ce5/gdmcbain},
chapter = 2,
citeulike-article-id = {2240748},
citeulike-attachment-1 = {hughes_05_programming_1152710.pdf; /pdf/user/gdmcbain/article/2240748/1152710/hughes_05_programming_1152710.pdf; f1ec487a43c8a41c1678a85fa63301e92a6416c5},
citeulike-linkout-0 = {http://dx.doi.org/10.1007/11546382\_2},
doi = {10.1007/11546382\_2},
editor = {Vene, Varmo and Uustalu, Tarmo},
file = {hughes_05_programming_1152710.pdf},
interhash = {24d0e14b35977d3dac89e77008f7660d},
intrahash = {96db79f307fc109646c7ab5e7efa1ce5},
isbn = {978-3-540-28540-3},
journal = {Advanced Functional Programming},
keywords = {18c20-algebras-and-kleisli-categories-associated-with-monads 68n18-functional-programming-and-lambda-calculus haskell},
pages = {73--129},
posted-at = {2019-02-07 23:02:20},
priority = {5},
publisher = {Springer Berlin Heidelberg},
timestamp = {2019-03-01T00:11:50.000+0100},
title = {{Programming with Arrows}},
url = {http://dx.doi.org/10.1007/11546382\_2},
volume = 3622,
year = 2005
}