1. Michael Abott, Thorsten Altenkirch & Neil Ghani (2005): Containers - Constructing Strictly Positive Types. Theoretical Computer Science 342, pp. 3–27, doi:10.1016/j.tcs.2005.06.002. Applied Semantics: Selected Topics.
  2. J. Adámek & J. Rosický (1994): Locally Presentable and Accessible Categories. Cambridge University Press, doi:10.1017/CBO9780511600579.
  3. Brian J. Day (1970): Construction of Biclosed Categories. University of New South Wales.
  4. G. M. Kelly (1980): A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on. Bulletin of the Australian Mathematical Society 22, pp. 1–83, doi:10.1017/S0004972700006353.
  5. Simon Marlow (2010): Haskell 2010 Language Report.
  6. Conor McBride & Ross Paterson (2008): Applicative programming with effects. Journal of Functional Programming 18(1), pp. 1–13, doi:10.1017/S0956796807006326.
  7. Ross Paterson (2012): Constructing Applicative Functors. In: Mathematics of Program Construction, Lecture Notes in Computer Science 7342. Springer-Verlag, pp. 300–323, doi:10.1007/978-3-642-31113-0_15.
  8. John C. Reynolds (1983): Types, Abstraction and Parametric Polymorphism. In: IFIP Congress, pp. 513–523.
  9. S. Doaitse Swierstra & Luc Duponcheel (1996): Deterministic, Error-Correcting Combinator Parsers. In: Advanced Functional Programming, Lecture Notes in Computer Science 1129. Springer-Verlag, pp. 184–207, doi:10.1007/3-540-61628-4_7.
  10. Wouter Swierstra (2008): Data types à la carte. Journal of Functional Programming 18(4), pp. 423–436, doi:10.1017/S0956796808006758.
  11. Philip Wadler (1989): Theorems for free!. In: Functional Programming Languages and Computer Architecture. ACM Press, pp. 347–359, doi:10.1145/99370.99404.

Comments and questions to:
For website issues: