[1]
G. Bellè, C.B. Jay, and E. Moggi. Functorial ML. In PLILP'96, volume 1140 of LNCS. Springer-Verlag, 1996.

[2]
R.S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, volume F36 of NATO ASI Series, pages 5-42. Springer-Verlag, 1987.

[3]
Robin Cockett and Tom Fukushima. About Charity. Yellow Series Report No. 92/480/18, Dep. of Computer Science, Univ. of Calgary, 1992.

[4]
M.M. Fokkinga. Monadic maps and folds for arbitrary datatypes. Memoranda Informatica 94-28, University of Twente, June 1994.

[5]
E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns -- Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.

[6]
Paul Hoogendijk and Roland Backhouse. When do datatypes commute? In Category Theory and Computer Science, LNCS 1290, pages 242-260, 1997.

[7]
Marieke Huisman. The calculation of a polytypic parser. Master's thesis, Utrecht University, 1996. INF/SRC-96-19.

[8]
P. Jansson and J. Jeuring. PolyP - a polytypic programming language extension. In POPL'97, pages 470-482. ACM Press, 1997.

[9]
P. Jansson and J. Jeuring. Polytypic unification. JFP, 1998. In press.

[10]
Patrik Jansson. Functional polytypic programming --- use and implementation. Technical report, Chalmers Univ. of Tech., Sweden, 1997. Lic. thesis. Available from tt http://www.cse.chalmers.se/~patrikj/lic/.

[11]
C.B. Jay, G. Bellè, and E. Moggi. Functorial ML. Unpublished extended version of [1], 1997.

[12]
J. Jeuring and P. Jansson. Polytypic programming. In AFP'96, volume 1129 of LNCS, pages 68-114. Springer-Verlag, 1996.

[13]
J. Jeuring. Polytypic pattern matching. In FPCA'95, pages 238-248. ACM Press, 1995.

[14]
G. Malcolm. Homomorphisms and promotability. In J.L.A. van de Snepscheut, editor, Mathematics of Program Construction, pages 335-347. Springer-Verlag, 1989. LNCS 375.

[15]
G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14:255-279, 1990.

[16]
L. Meertens. Algorithmics --- towards programming as a mathematical activity. In Proceedings of the CWI Symposium on Mathematics and Computer Science, volume 1 of CWI Monographs, pages 289-334. North-Holland, 1986.

[17]
L. Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413-425, 1992.

[18]
L. Meertens. Calculate polytypically! In PLILP'96, volume 1140 of LNCS, pages 1-16. Springer Verlag, 1996.

[19]
E. Meijer and J. Jeuring. Merging monads and folds for functional programming. In AFP'95, LNCS 925, pages 228-266. Springer-Verlag, 1995.

[20]
Fritz Ruehr. Analytical and Structural Polymorphism Expressed Using Patterns Over Types. PhD thesis, University of Michigan, 1992.

[21]
Tim Sheard. Automatic generation and use of abstract structure operators. ACM TOPLAS, 13(4):531-557, 1991.

[22]
Måns Vestin. Genetic algorithms in Haskell with polytypic programming. Master's thesis, Göteborg University, Gothenburg, Sweden, 1997. Available from http://www.cse.chalmers.se/~patrikj/poly/others/geneticalgorithmsinhaskellwithpolytypicprogramming.ps.gz.