1. A. Abel, R. Matthes, (Co-)iteration for higher-order nested datatypes, in: H. Geuvers, F. Wiedijk (Eds.), Types for Proofs and Programs, Internat. Workshop, TYPES 2002, Selected Papers, Lecture Notes in Computer Science, Vol. 2646, Springer, Berlin, 2003, pp. 1–20.
2. A. Abel, R. Matthes, T. Uustalu, Generalized iteration and coiteration for higher-order nested datatypes, in: A. Gordon (Ed.), Foundations of Software Science and Computation Structures, Proc. of the Sixth Internat. Conf., FoSSaCS 2003, Lecture Notes in Computer Science, Vol. 2620, Springer, Berlin, 2003, pp. 54–69.
3. T. Altenkirch, Logical relations and inductive/coinductive types. in: G. Gottlob, E. Grandjean, K. Seyr (Eds.), Computer Science Logic, Proc. of the 12th Internat. Workshop, CSL ’98, Lecture Notes in Computer Science, Vol. 1584, Springer, Berlin, 1999, pp. 343–354.
4. T. Altenkirch, C. McBride, Generic programming within dependently typed programming, in: J. Gibbons, J. Jeuring (Eds.), Proc. of the IFIP TC2 Working Conf. on Generic Programming, Kluwer Academic Publishers, Dordrecht, 2003, pp. 1–20.
5. T. Altenkirch, B. Reus, Monadic presentations of lambda terms using generalized inductive types, in: J. Flum, M. Rodríguez-Artalejo (Eds.), Computer Science Logic, Proc. of the 13th Internat. Workshop, CSL ’99, Lecture Notes in Computer Science, Vol. 1683, Springer, Berlin, 1999, pp. 453–468.