[1] J. Backus. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. CACM, 21(8):613--641, August 1978.

[2] H.B. Curry and R. Feys. Combinatory Logic. North-Holland Pub. Co., Amsterdam, 1958.

[3] L. Damas and R. Milner. Principal type schemes for functional programs. In Proceedings of the 9th ACM Symposium on Principles of Programming Languages, pages 207--212, Albuquerque, N.M., January 1982.

[4] R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29--60, December 1969.

[5] P. Hudak, J. Fasel, and J. Peterson. A gentle introduction to Haskell. Technical Report YALEU/DCS/RR-901, Yale University, May 1996.

[6] Mark P. Jones. A system of constructor classes: overloading and implicit higher-order polymorphism. Journal of Functional Programming, 5(1), January 1995.

[7] P. Penfield, Jr. Principal values and branch cuts in complex APL. In APL '81 Conference Proceedings, pages 248--256, San Francisco, September 1981.

[8] J. Peterson (editor). The Haskell Library Report. Technical Report YALEU/DCS/RR-1105, Yale University, May 1996.

[9] S.L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall International, Englewood Cliffs, New Jersey, 1987.

[10] Unicode Consortium. Unicode Character Data and Mappings. unicode.org.

[11] P. Wadler and S. Blott. How to make ad hoc polymorphism less ad hoc. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 60--76, Austin, Texas, January 1989.