The following books and articles constitute a list (ordered alphabetically) of references for the material thaught in the course. The books are put in reserve at the math library; the articles will be either available on the web or distributed in class. This list will get updated during the course.

Books:

• [Abadi_Cardelli96] Martin Abadi and Luca Cardelli. A Theory of Objects. Monographs in Computer Science, David Gries and Fred B. Schneider Eds. Springer-Verlag, 1996.
• [Barendregt84] Henk P. Barendregt. The Lambda Calculus - Its syntax and semantics. North-Holland. Revised edition, 1984.
• [Hindley_Seldin96] J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and Lambda Calculus. Cambridge Press, 1986.
• [Milner89] Robin Milner. Communication and Concurrency. Prentice Hall International, 1989.
• [Mitchell96] John C. Mitchell. Foundations of Programming Languages. The MIT Press, 1996. Available on line: Index and Chapter 2.
• [Winskell93] Glynn Winskell. The Formal Semantics of Programming Languages. The MIT Press, 1993. Available on line: extract of Ch 11 by Ada Dong.

Articles and book chapters:

• [Apt_Pellegrini] Krzysztof R. Apt and Alessandro Pellegrini. On the occur-check free Prolog programs. ACM TOPLAS 16(3), 687-726, (1994).
• [Banatre_LeMetayer] Jean-Pierre Banatre and Daniel Le Metayer. Gamma and the chemical reaction model: ten years after. Article in the book "Coordination programming: mechanisms, models and semantics", World Scientific Publishing, IC Press, 1996.
• [Barendregt92] Henk P. Barendregt. Lambda Calculi with types. Chapter in the Handbook of Logic in Computer Science, Vol. 2. S. Abramski, Dov M. Gabbay, and T.S.E. Maibaum, Eds. Oxford Science Publications, 1992.
• [Berry_Boudol] Gerard Berry and Gerard Boudol. The Chemical Abstract Machine. Theoretical Computer Science, vol. 96, 1992.
• [deBoer_Klop_Palamidessi92] Frank S. de Boer, Jan Willem Klop, and Catuscia Palamidessi. Asynchronous communication in process algebra. In Proc. of the seventh annual IEEE symposium on Logics in Computer Science (LICS), pages 137-147. IEEE Computer Society Press, Los Alamitos, California, 1992.
• [Carriero_Gelenter89] Nicholas Carriero and David Gelernter. Linda in Context. Communications of the ACM, April 1989, Vol. 32, No. 4, pp. 444-458.
• [Carriero_Gelenter92] Nicholas Carriero and David Gelernter. Coordination Languages and their Significance. Communications of the ACM, 35 (2), February 1992, pp. 97-107.
• [FGMP97] Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott and Catuscia Palamidessi. Confluence in Concurrent Constraint Programming. Theoretical Computer Science 183(2):281-315, 1997.
• [Gallier93] Jean Gallier. Constructive Logics. Part I: A Tutorial on Proof Systems and Typed lambda-Calculi. Theoretical Computer Science, 110(2), 249-239 (1993).
• [Gallier95] Jean Gallier. On the Correspondence Between Proofs and lambda-Terms. Cahiers du Centre de Logique, Philippe DeGroote, Editor, Universite' Catholique de Louvain (1995).
• [Miller98] Dale Miller. Sequent Calculus and the Specification of Computation. Lecture notes, 8 September 1998.
• [vanGlabbeek90] Rob van Glabbeek. The linear time - branching time spectrum . Proceedings CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, (J.C.M. Baeten & J.W. Klop, eds.), LNCS 458, Springer-Verlag, 1990.
• [Miller_Palamidessi98] Dale Miller and Catuscia Palamidessi. Foundational Aspects of Syntax. Draft. An extended version will appear in ACM Computing Surveys.
• [Milner_Parrow_Walker92] Robin Milner, Joachim Parrow, and David Walker. A Calculus of Mobile Processes (Part I and Part II). Information and Computation, 100:1-77, 1992.
• [Milner_Parrow_Walker93] Robin Milner, Joachim Parrow, and David Walker. Modal Logics for Mobile Processes. Theoretical Computer Science 114:149-171, 1993.
• [Nestmann_Pierce96] Uwe Nestmann and Benjamin Pierce. Decoding Choice Encodings, Technical Report, University of Pennsylviania, 1996.
• [Palamidessi97] Catuscia Palamidessi. Comparing the expressive power of the Synchronous and the Asynchronous pi-calculus. Proc. of the 24th ACM Symposium on Principles of Programming Languages (POPL), pages 256-265, ACM, 1997.
• [Pierce96] Benjamin Pierce. Foundational Calculi for Programming Languages. Chapter in the CRC Handbook of Computer Science and Engineering, 1996.