Is the following manuscript publically available?Dana Scott, 1969, A theory of computable functions of higher type. Unpublished seminar notes, 7 pages, University of Oxford.There is a discussion of this paper in section 8.1.2, Types as sets, in Cardone & Hindley, 2006 History of Lambda-calculus and Combinatory Logic; additionally section 10.1, Domain theory, traces back to this manuscript some crucial order-theoretic insights.
Seeking Scott's original LCF paper
reference request;lo.logic;type theory;domain theory
Published as:Scott, D. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY.   Theoretical Computer Science, vol. 121 (1993), pp. 411 - 440.See also:Scott, D. Some Reflections on Strachey and his Work. in: A Special Issue   Dedicated to Christopher Strachey, edited by O. Danvy and   C. Talcott.  Higer-Order and Symbolic Computation, vol. 13 (2000),   pp. 103-114.and:Gordon D. Plotkin, Set-theoretical and other elementary models of the -calculus,   Theoretical Computer Science, vol. 121 (1993), pp. 351-409.