Barendregt, H.P. 1981

**The Lambda Calculus: Its Syntax And Semantics**. Studies in Logic, vol. 103, North Holland, New York (1981), xiv+615pp.

Google Scholar Berry, G. and

Curien, P.L. 1981

*Sequential algorithms on concrete data structures*. Report of Ecole Nationale Supérience des Mines de Paris, Centre de Mathematiques Appliquées, Sophia Antipolis (1981).

Google Scholar Engeler, E. 1979 Algebras and combinators. Berichte des Instituts fur Informatik, Nr. 32, ETH Zurich, 12pp.

Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. and Scott, D.S. 1980 **A Compendium of Continuous Lattices**. Springer-Verlag (1980), 371 pp.

Gordon, M. J., Milner, A.J.R. and Wadsworth, C.P. 1979 **Edinburgh LCF**. Springer-Verlag Lecture Notes in Computer Science, vol. 78 (1979), 159 pp.

Gordon, M. 1979 **The Denotational Description of Programming Languages, An Introduction**. Springer-Verlag (1979).

Greibach, S. A. 1981

*Formal languages: origins and directions*. Annals of the History of Computing, vol. 3 (1981), pp. 14–41.

Google Scholar Kahn, G. and Plotkin, G. 1978 *Domaines Concrètes*. Rapport IRIA-LABORIA, No. 336 (1978).

Longo, G. 1982 *Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms*. Preprint, Pisa (1982), 46pp.

Meyer, A. R. 1981 *What is a model of the lambda calculus?*. (Expanded version) Preprint, MIT (1981), 40 pp.

Nielsen, M., Plotkin, G. and

Winskel, G. 1981

*Petri nets, event structures and domains*. Theoretical Computer Science, vol. 13(1981), pp.85–108.

Google Scholar Plotkin, G.D. 1972 *A set-theoretical definition of application*. Memorandum MIP-R-95, School of Artificial Intelligence, University of Edinburgh, 32pp.

1978 *The category of complete partial orders: a tool for making meanings*. **In: Proc. Summer School on Foundations of Artificial Intelligence and Computer Science**. Institute di Scienze dell' Informazione, Universita di Pisa (June 1978).

Rabin, M. O. and

Scott, D. S. 1959

*Finite automata and their decision problems*. IBM Journal Research and Development, vol. 3 (1959), pp. 114–125.

Google Scholar Scott, D.S. 1972 Continuous lattices. Springer Lecture Notes in Mathematics, vol. 274 (1972), pp. 97–136.

Google Scholar Scott, D.S. 1976

*Data types as lattices*.

**SIAM Journal on Computing**, vol. 5 (1976), pp. 522–587.

Google Scholar 1980a *Lambda calculus: some models, some philosophy*. **The Kleene Symposium**. Barwise, J., et al., eds., Studies in Logic 101, North Holland (1980), pp. 381–421.

1980b *Relating theories of the λ-calculus*. **To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism**. Seldin, J. P. and Hindley, J. R., eds., Academic Press (1980), pp. 403–450.

1980c *Lectures on a mathematical theory of computation*. Oxford University Computing Laboratory Technical Monograph PRG-19 (1981), 148pp.

1982 *Some ordered sets in computer science*. **In: Ordered Sets**. I. Rival, ed., D. Reidel (1982), pp. 677–718.

Smyth, M. and Plotkin, G. D. 1981 *The categorical solution of recursive domain equations*. **SIAM Journal on Computation.**. To appear (1981).

Stoy, J.E. 1977 Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. M.I.T. Press, Cambridge, Mass., xxx–414pp.

Google Scholar Tennent, R.D. 1981 **Principles of Programming languages**. Prentice-Hall (1981), 271 pp.6.

Wadsworth, C. 1976

*The relation between computational and denotational properties for Scott's D*_{t8}-

*models of the lambdacalculus*. SIAM Journal of Computing, vol. 5, pp. 488–521.

Google Scholar Wilnskel, G. 1980 Events in Computation. Ph.D thesis, University of Edinburgh (1980).