- J. Gibbons, “Origami programming.”, The Fun of Programming, Palgrave, 2003
- C. McBride & R. Paterson, “Applicative programming with effects”, Journal of Functional Programming, vol. 18, no. 01, pp. 1-13, 2008.
- E. Meijer, “Functional Programming with Bananas , Lenses , Envelopes and Barbed Wire”, 1991.
- W. Swierstra, “Data types à la carte”, Journal of Functional Programming, vol. 18, no. 04, pp. 423–436, Mar. 2008.
- L. Augusteijn, “Sorting morphisms” pp. 1–23. 3rd International Summer School on Advanced Functional Programming, volume 1608 of LNCS, 1998.
- V. Vene, “Functional Programming with Apomorphisms (Corecursion)” pp. 147–161, 1998.
- T. Uustalu & V. Venu, “Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically” Informatica, Vol. 10, No. 1, 5–26, 1999.
Last active
December 15, 2015 13:09
-
-
Save threedaymonk/5265258 to your computer and use it in GitHub Desktop.
Links for the references in Tim Williams's talk on Recursion Schemes by Example http://www.timphilipwilliams.com/slides.html
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment