Computer Laboratory > Teaching > Course material 2008–09 > Computer Science Tripos Syllabus and Booklist 2008-2009 > Denotational Semantics

next up previous contents
Next: Digital Communication II Up: Michaelmas Term 2008: Part Previous: Computer Systems Modelling   Contents


Denotational Semantics

Lecturer: Dr M.P. Fiore

No. of lectures: 10 (including revision)

Prerequisite course: Semantics of Programming Languages (specifically, an idea of operational semantics and how to reason with it).


Aims


The aims of this course are to introduce domain theory and denotational semantics, and show how they provide a mathematical basis for reasoning about the behaviour of programming languages.


Lectures


Objectives


At the end of the course students should


Recommended reading


Books:

* Gunther, C. (1992). Semantics of programming languages: Structures and techniques. MIT Press.
Tennent, R. (1991). Semantics of programming languages. Prentice-Hall.
* Winskel, G. (1993). The formal semantics of programming languages: An introduction. MIT Press.

Papers:

Fiore, M., Jung, A., Moggi, E., O'Hearn, P., Riecke, J., Rosolini, G., and Stark, I. (1996). Domains and denotational semantics: History, accomplishments and open problems. Bulletin of EATCS, 59:227-256.
Milner, R. (1977). Fully abstract models of typed lambda-calculi. Theoretical Computer Science, 4:1-22.
Ong, C.-H. (1995). Correspondence between operational and denotational semantics. Handbook of Logic in Computer Science, Vol. 4, pp. 269-356.
Plotkin, G. (1977). LCF considered as a programming language. Theoretical Computer Science, 5:223-256.
Scott, D. (1969). A type-theoretical alternative to CUCH, ISWIM, OWHY. (In Theoretical Computer Science, 121:411-440, 1993.)



next up previous contents
Next: Digital Communication II Up: Michaelmas Term 2008: Part Previous: Computer Systems Modelling   Contents