1. A. Abel.Termination checking with types.Technical Report 0201,Inst. für Infor-matik,Ludwigs-Maximilians-Univ. München,2002.
2. A. Abel and R. Matthes.(Co-)iteration for higher-order nested datatypes. To appear in H. Geuvers, F. Wiedijk,eds.,Post-Conf. Proc. of IST WG TYPES 2nd Ann. Meeting, TYPES’02 Lect. Notes in Comput. Sci.Springer-Verlag.
3. T. Altenkirch and C. McBride.Generic programming within dependently typed programming.To appear in J. Gibbons and J. Jeuring,Proc. of IFIP TC2 WC on Generic Programming, WCGP 2002 Kluwer Acad.Publishers.
4. T. Altenkirch and B. Reus.Monadic presentations of lambda terms using general-ized inductive types.In J. Flum and M. Rodríguez-Artalejo,eds.,Proc. of 13th Int. Wksh. on Computer Science Logic, CSL’99 vol.1683 of Lect. Notes in Comput. Sci.pp.53–468.Springer-Verlag,1999.
5. G. Barthe, M.J. Frade, E. Giménez, L. Pinto,and T. Uustalu.Type-based termi-nation of recursive definitions.Math. Struct. in Comput. Sci., to appear.