1. Abstract and Concrete Categories;Adámek,1990
2. On the greatest fixed point of a set functor;Adámek;Theoretical Computer Science,1995
3. Parametrized data types do not need highly constrained parameters;Arbib;Inform. Control,1982
4. Terminal coalgebras in well-founded set theory;Barr;Theoret. Comput. Sci.,1993
5. H. Baumeister, M. Cerioli, A. Haxthausen, T. Mossakowski, P.D. Mosses, D. Sannella, A. Tarlecki, Casl semantics, Part III of 34.