Abstract
These notes were originally written for lectures on the semantics of programming languages delivered at Oxford during Michaelmas Term 1980. The purpose of the course was to provide the foundations needed for the method of denotational semantics; in particular I wanted to make the connections with recursive function theory more definite and to show how to obtain explicit, effectively given solutions to domain equations. Roughly, these chapters cover the first half of the book by Stoy, and he was able to continue the lectures the next term discussing semantical concepts following his text.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, North-Holland Publishing Co., 1981, xiv+615 pp.
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. A Compendium of Continuous Lattices, Springer-Verlag, 1980, xx+371 pp.
M. J. Gordon. The Denotational Description of Programming Languages, Springer-Verlag, 1979, 160 pp.
M. J. Gordon, A. J. R. Milner, and C. P. Wadsworth. Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science, vol. 78 (1979), 159 pp.
D. S. Scott. “Data types as lattices,” Slam Journal on Computing, vol. 5 (1976), pp. 522–587.
D. S. Scott. “Logic and programming languages,” Communications of the ACM, vol. 20 (1977), pp. 634–641.
D. S. Scott. “Lambda calculus: some models, some philosophy.” In: The Kleene Symposium (K. J. Barwise, et al. editors), North-Holland Publishing Co., 1980, pp 223–265.
D. S. Scott. “Relating theories of the λ-calculus.” In: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J. P. Seldin and J. R. Hindley, editors), Academic Press, 1980, pp. 403–450.
D. S. Scott. “Lectures on a Mathematical Theory of Computation,” Oxford University PRG Technical Monograph, No. 19 (1981), iv +148 pp. (This is the same text as the present publication. It is also reprinted under the title “Domain Equations” in: Proceedings of the Sixth IBM Symposium on Mathematical Foundations of Computer Science: Logic Aspects of Programs, Corporate & Scientific Programs, IBM Japan, 1981, pp. 103–256.)
D. S. Scott. “Some ordered sets in computer science.” In: Ordered Sets. Proceedings of the NATO Advanced Study Institute held at Banff, Canada, August 28 to September 12, 1981 (I. Rival, editor); D. Reidel Publishing Co., pp. 677–717.
J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, 1977, xxx+414 pp.
R. D. Tennent. Principles of Programming Languages, Prentice/Hall International, 1981, xiv+271 pp.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 D. Reidel Publishing Company
About this chapter
Cite this chapter
Scott, D.S. (1982). Lectures on a Mathematical Theory of Computation. In: Broy, M., Schmidt, G. (eds) Theoretical Foundations of Programming Methodology. NATO Advanced Study Institutes Series, vol 91. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7893-5_9
Download citation
DOI: https://doi.org/10.1007/978-94-009-7893-5_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-277-1462-6
Online ISBN: 978-94-009-7893-5
eBook Packages: Springer Book Archive