1. Aspinall, D. (1995) Subtyping with singleton types, in `Proceedings of Computer Science Logic `94’, Vol. 933 of LNCS.
2. Aspinall, D. & Compagnoni, A. (1996) Subtyping dependent types, in `Proceedings of the eleventh IEEE Symposium on Logic in Computer Science’.
3. Burn, G. L. (1992) A logical framework for program analysis, in J. Launchbury & P. Sansom, Eds, ‘Proceedings of the 1992 Glasgow Functional Programming Workshop’, Springer-Verlag Workshops in Computer Science series, pp. 3042.
4. Burstall, R. & McKinna, J. (1992) Deliverables: A categorical approach to program development in type theory, in `Mathematical Foundations of Computer Science: 18th International Symposium’, Vol. 711 of Lecture Notes in Computer Science, pp. 32–67. An earlier version appeared as LFCS Technical Report ECS-LFCS-92–242.
5. Denney, E. (1997) Refining Refinement Types, in `Informal Proceedings of Types Workshop on Subtyping, Inheritance and Modular Development of Proofs’, University of Durham.