1. Amadio, R., Bruce, K. B., Longo, G., The finitary projection model for second order lambda calculus and solutions to higher order domain equations. In: Logic in Computer Science, edited by A. Meyer, IEEE Computer Society Press, 1986, pp. 122–130.
2. Berry, G., Stable models of typed λ-calculi. In: Fifth International Colloquium on Automata, Languages and Programs, Springer-Verlag, Lecture Notes in Computer Science, vol. 62, 1978, pp. 72–89.
3. Bruce, K. and Meyer, A., The semantics of polymorphic lambda-calculus. In: Semantics of Data Types, edited by G. Kahn, D.B. MacQueen and G. Plotkin, Lecture Notes in Computer Science, vol. 173, Springer-Verlag, 1984, pp. 131–144.
4. Coquand, T., and Ehrhard, T., An equational presentation of higher-order logic. To appear in: Category theory and computer science, Lecture Notes in Computer Science, Springer-Verlag, 1987.
5. Coquand, T., Gunter, C., and Winskel, G., Domain theoretic models of polymorphism. In preparation. To appear as: University of Cambridge Computer Laboratory Technical Report, 1987.