mirror of
https://github.com/papers-we-love/papers-we-love.git
synced 2026-03-02 03:40:31 +00:00
Rename "paradigm" and "plt" folders for findability (#561)
* rename "language-paradigm" folder for findability lang para pluralize * rename PLT => languages-theory * fixed formatting
This commit is contained in:
29
languages-paradigms/functional_programming/README.md
Normal file
29
languages-paradigms/functional_programming/README.md
Normal file
@@ -0,0 +1,29 @@
|
||||
# Functional Programming
|
||||
|
||||
* [:scroll:](organizing-programs-without-classes.pdf) [Organizing Programs Without Classes](http://cs.au.dk/~hosc/local/LaSC-4-3-pp223-242.pdf)
|
||||
* [:scroll:](functional-programming-with-bananas-lenses-envelops-and-barbed-wire.pdf) [Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire](http://eprints.eemcs.utwente.nl/7281/01/db-utwente-40501F46.pdf)
|
||||
|
||||
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.
|
||||
|
||||
* :scroll: [Equal Rights for Functional Objects or,
|
||||
The More Things Change, The More They Are the Same](equal-rights-for-functional-objects.pdf)
|
||||
* :scroll: [Optimal Purely Functional Priority Queues](optimal-purely-functional-priority-queues.pdf)
|
||||
* :scroll: [Why Functional Programming Matters](why-functional-programming-matters.pdf)
|
||||
* [:scroll:](purely-functional-data-structures.pdf) [Purely Functional Data Structures](https://www.cs.cmu.edu/~rwh/theses/okasaki.pdf)
|
||||
|
||||
|
||||
## Applicative Programming
|
||||
|
||||
* [Backtracking Iterators](https://www.lri.fr/~filliatr/publis/enum2.pdf)
|
||||
|
||||
* [Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design](http://www.cs.tufts.edu/~nr/cs257/archive/chris-okasaki/breadth-first.pdf)
|
||||
|
||||
## Concatenative Programming
|
||||
|
||||
* :scroll: [Concatenative Programming: An Overlooked Paradigm in Functional Programming](concatenative-programming-an-overlooked-paradigm.pdf)
|
||||
|
||||
## Imperative Programming - Functional Programming
|
||||
|
||||
* [Crossing the Gap from Imperative to Functional Programming through Refactoring](http://dig.cs.illinois.edu/papers/lambdaRefactoring.pdf)
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,28 @@
|
||||
# Functional Reactive Programming
|
||||
|
||||
* [Functional Reactive Programming, Continued](http://haskell.cs.yale.edu/wp-content/uploads/2011/02/workshop-02.pdf)
|
||||
|
||||
* [Event-Driven FRP](http://www.cs.yale.edu/homes/zwan/papers/mcu/efrp.pdf)
|
||||
|
||||
* [Real-Time FRP](http://haskell.cs.yale.edu/wp-content/uploads/2011/02/rt-frp.pdf)
|
||||
|
||||
* [Asynchronous Functional Reactive Programming for GUIs](http://people.seas.harvard.edu/~chong/pubs/pldi13-elm.pdf)
|
||||
|
||||
* [Push-Pull Functional Reactive Programming](http://conal.net/papers/push-pull-frp/push-pull-frp.pdf)
|
||||
|
||||
* [Wormholes: Introducing Effects to FRP](http://haskell.cs.yale.edu/wp-content/uploads/2012/08/Winograd-Cort-Wormholes.pdf)
|
||||
|
||||
* [Elm: Concurrent FRP for Functional GUIs](https://www.seas.harvard.edu/sites/default/files/files/archived/Czaplicki.pdf)
|
||||
|
||||
|
||||
## Hosted Papers
|
||||
|
||||
* :scroll: [A Survey of Functional Reactive Programming](a-survey-of-functional-reactive-programming.pdf)
|
||||
|
||||
* :scroll: [Deprecating the Observer Pattern](deprecating-the observer-pattern.pdf)
|
||||
|
||||
* :scroll: [FrTime: Functional Reactive Programming in PLT Scheme](frp-in-plt-scheme.pdf)
|
||||
|
||||
* :scroll: [Functional Reactive Animation](functional-reactive-animation.pdf)
|
||||
|
||||
* :scroll: [RAY: Integrating Rx and Async for Direct-Style Reactive Streams](ray-integrating-rx-and-async-for-direct-style-reactive-streams.pdf)
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
3
languages-paradigms/new_paradigms/README.md
Normal file
3
languages-paradigms/new_paradigms/README.md
Normal file
@@ -0,0 +1,3 @@
|
||||
## New Paradigms
|
||||
|
||||
* :scroll: [Cognitive Computing Programming Paradigm: A Corelet Language for Composing Networks of Neurosynaptic Cores](cognitive-computing-programming-paradigm-corelet-language.pdf)
|
||||
Binary file not shown.
@@ -0,0 +1,3 @@
|
||||
|
||||
* [Metaobject protocols: Why we want them and what else they can do](http://cseweb.ucsd.edu/~vahdat/papers/mop.pdf)
|
||||
|
||||
Reference in New Issue
Block a user