Archives/papers-we-love_papers-we-love
1
0
Fork 0
mirror of https://github.com/papers-we-love/papers-we-love.git synced 2024-10-27 20:34:20 +00:00
Code Issues Projects Releases Wiki Activity

Added Elm language thesis

Browse Source
This commit is contained in:
Oleg Akbarov 2015-10-23 13:57:57 +03:00
parent 7d172baaf3
commit 2c398212bf
2 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
functional_programming/README.md
View File

@ -6,11 +6,12 @@
From Patrick Thomson's [An introduction to Recursion Schemes](http://patrickthomson.ghost.io/an-introduction-to-recursion-schemes/): From Patrick Thomson's [An introduction to Recursion Schemes](http://patrickthomson.ghost.io/an-introduction-to-recursion-schemes/):
> In 1991, Erik Meijer, Maarten Fokkinga, and Ross Paterson published their now-classic paper Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. Though this paper isn’t widely known outside of the functional programming community, its contributions are astonishing: the authors use category theory to express a set of simple, composable combinators, called recursion schemes, that automate the process of traversing and recursing through nested data structures. Though recursion schemes predate Meijer et. al’s work, this paper brings the enormous abstractive power of category theory to bear on the subject of traversing data structures—it’s a magnificent example of how category-theoretical concepts can bring both rigor and simplicity to day-to-day programming tasks. > In 1991, Erik Meijer, Maarten Fokkinga, and Ross Paterson published their now-classic paper Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. Though this paper isn’t widely known outside of the functional programming community, its contributions are astonishing: the authors use category theory to express a set of simple, composable combinators, called recursion schemes, that automate the process of traversing and recursing through nested data structures. Though recursion schemes predate Meijer et. al’s work, this paper brings the enormous abstractive power of category theory to bear on the subject of traversing data structures—it’s a magnificent example of how category-theoretical concepts can bring both rigor and simplicity to day-to-day programming tasks.
* :scroll: [Equal Rights for Functional Objects or, The More Things Change, The More They Are the Same](equal-rights-for-functional-objects.pdf) * :scroll: [Equal Rights for Functional Objects or,
* :scroll: [Optimal Purely Functional Priority Queues](optimal-purely-functional-priority-queues.pdf) The More Things Change, The More They Are the Same](equal-rights-for-functional-objects.pdf)
* :scroll: [Why Functional Programming Matters](why-functional-programming-matters.pdf) * :scroll: [Optimal Purely Functional Priority Queues](optimal-purely-functional-priority-queues.pdf)
* :scroll: [Why Functional Programming Matters](why-functional-programming-matters.pdf)
* :scroll: [Elm: Concurrent FRP for Functional GUIs](elm-concurrent-frp-for-functional-guis.pdf)
## Applicative Programming ## Applicative Programming

BIN
functional_programming/elm-concurrent-frp-for-functional-guis.pdf Normal file
View File

Binary file not shown.