[ home | schedule | assignments | resources | handouts | overview ]

CS 15-859 Domain Theory

Some Relevant Book References
Listed Chronologically

For references to journal literature, check the bibliographies of some of the recent books.

R. E. Milne & C. Strachey, A Theory of Programming Language Semantics, Chapman & Hall, 1976.

J. E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Languages, MIT Press, 1977.

M. J. C. Gordon, The Denotational Description of Programming Languages, Springer-Verlag, 1979.

G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, & D. S. Scott, A Compendium of Continuous Lattices, Springer-Verlag, 1980.

R. D. Tennant, Principles of Programming Languages, Prentice-Hall, 1981.

J. C. Reynolds, The Craft of Programming, Prentice-Hall, 1981.

Peter Johnstone, Stone Spaces, Cambridge, 1982.

H. P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, rev. ed., North-Holland, 1984.

P. Martin-Lö f, Intuitionistic Type Theory, Bibliopolis, 1984.

Michael Beeson, Foundations of Constructive Mathematics, Springer-Verlag, 1985.
J. R. Hindley & J. P. Selden, Introduction to Combinators and Lambda Calculus, Cambridge, 1986.

J. Lambek & P.J. Scott, Introduction to Higher-Order Categorical Logic, Cambridge, 1986

D. A. Schmidt, Denotational Semantics: A Methodology for Language Development, Allyn & Bacon, 1986. (Reprint, 1988.)

K. Mulmuley, Full Abstraction and Semantic Equivalence, MIT Press, 1987.

K. Weihrauch, Computability, Springer-Verlag, 1987.

Anne S. Troelstra & Dirk van Dalen, Constructivism in Mathematics, 2 vols., North - Holland, 1988.

A. Stoughton, Fully Abstract Models of Programming Languages, Pitman/Wiley, 1988.

S. Vickers, Topology via Logic, Cambridge, 1989.

J. Y. Girard, Proofs and Types, Cambridge, 1989.

J. Adá mek & V. Trnková , Automata and Algebras in Categories, Kluwer, 1989.

Jan van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier/MIT Press, 1990.

B. A. Davey & H. A. Priestley, Introduction to Lattices and Order, Cambridge, 1990.

P.J. Freyd & A. Scedrov, Categories, Allegories, North-Holland, 1991

G.-Q. Zhang, Logic of Domains, Birkhä user, 1991.

Andrea Asperti & Giuseppe Longo, Categories, Types, and Structures: An Introduction to Category Theory for the Working Computer Scientist, MIT Press, 1991.

P. D. Mosses, Action Semantics, Cambridge, 1992.

Carl A. Gunter, Semantics of Programming Languages: Structures and Techniques, MIT Press, 1992.

Saunders Mac Lane & Ieke Moerdijk, Sheaves in Geometry and Logic: A First Introduction to Topos Theory, Springer-Verlag, 1992.

Glynn Winskel, The Formal Semantics of Programming Languages: An Introduction, MIT Press, 1993.

P.-L. Curien, Categorical Combinators, Sequential Algorithms, and Functional Programming, 2nd ed., Birkhä user, 1993.

Roy L. Crole, Categories for Types, Cambridge, 1993.

Viggo Stoltenberg-Hansen, Ingrid Lindströ m, & Edward R. Griffor, Mathematical Theory of Domains, Cambridge, 1994.

Samson Abramsky, Dov M. Gabbay, Thomas S.E. Maibaum, eds., Handbook of Logic in Computer Science, 6 vols. (projected), Oxford, 1992-1995.

Vol. 1. Background: Mathematical Structures, 1992.
Vol. 2. Background: Computational Structures, 1992.
Vol. 3. Semantic Structures, 1994.
Vol. 4. Semantic Modelling, 1995.

John C. Mitchell. Foundations for Programming Languages, MIT Press, 1996.

Roberto M Amadio and Pierre-Louis Curien, Domains and Lambda-Calculi, Cambridge, 1998.

Bart Jacobs, Categorical Logic and Type Theory, Elsevier Science, 1998.

[ home | schedule | assignments | resources | handouts | overview ]


Page maintainers: Dana Scott and Andrej Bauer