1. Roland Backhouse. On the meaning and construction of the rules in Martin-Löf's theory of types. In Proceedings of the Workshop on General Logic, Edinburgh, Laboratory for the Foundations of Computer Science, University of Edinburgh, February 1987.
2. P. Chisholm. Derivation of a Parsing Algorithm in Martin-Löf's theory of types. Science of Computer Programming, 8:1–42, 1987.
3. Robert L. Constable and Nax P. Mendler. Recursive Definitions in Type Theory. In Proceedings of the LICS-Conference, Brooklyn, N. Y., Lecture Notes in Computer Science, Springer-Verlag, June 1985.
4. Peter Dybjer. Inductively Defined Sets in Martin-Löf's Type Theory. 1987. Presented at the Workshop on General Logic, Edinburgh.
5. C. A. R. Hoare. Recursive Data Structures. International Journal of Computer and Information Sciences, 4(2):105–132, 1975.