diff --git a/functional_programming/README.md b/functional_programming/README.md
index 6aec7a0..bcbc31c 100644
--- a/functional_programming/README.md
+++ b/functional_programming/README.md
@@ -1,6 +1,10 @@
 # Functional Programming
 
 * :scroll: [Organizing Programs Without Classes](http://cs.au.dk/~hosc/local/LaSC-4-3-pp223-242.pdf)
+* :scroll: [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.
 
 ## Applicative Programming
 
diff --git a/functional_programming/functional-programming-with-bananas-lenses-envelops-and-barbed-wire.pdf b/functional_programming/functional-programming-with-bananas-lenses-envelops-and-barbed-wire.pdf
new file mode 100644
index 0000000..409ee9a
Binary files /dev/null and b/functional_programming/functional-programming-with-bananas-lenses-envelops-and-barbed-wire.pdf differ