Literatur zur Vorlesung
"Grundlagen von Typsystemen"

• H. Barendregt: Lambda Calculi with Types. In: Handbook of Logic in Computer Science, Volume II, Clarendon Press, 1992
• L. Cardelli: Type Systems. In: Handbook of Computer Science and Engineering, Chapter 103, pp. 2208-2236, CRC Press, 1997
• L. Cardelli: Typeful programming. In: Formal Description of Programming Concepts (eds. E.J. Neuhold and M.Paul), IFIP State of the Art Reports Series, Springer-Verlag, 1989
• J. C. Mitchell: Type Systems for Programming Languages. In: Handbook of Theoretical Computer Science (ed. J. van Leeuwen), Chapter 8, pages 366-458, North-Holland, 1990,
• Benjamin C. Pierce: Types. Lecture Notes, CST Part II, University of Cambridge Computer Laboratory, Lent Term 1996
• Andrew Pitts: Types. Lecture Notes, CST Part II, University of Cambridge Computer Laboratory, 1997
• C.A. Gunter: The Semantics of Types in Programming Languages. In: Handbook of Logic in Theoretical Computer Science, Volume III. Clarendon Press, 1995

• J.-Y. Girard, Y. Lafont, P. Taylor: Proofs and Types. Cambridge University Press, 1989.
• G. Huet (ed.): Logical Foundations of Functional Programming. Addison-Wesley, 1990.
• J. Mitchell: Foundations for Programming Languages. The MIT Press, 1996.

• R. Milner: A theory of type polymorphism in programming. J. Computer and Systems Sciences 17, 348-375
• L. Cardelli: Basic Polymorphic Typechecking. Science of Computer Programming, 8(2), 1987
• L. Damas, R. Milner: Principle type-schemes for functional programs. Symp. Principles of Programming Languages, pp. 207-212, 1982
• H.G. Mairson: Deciding ML Typability is Complete for Deterministic Exponential Time. Symp. Principles of Programming Languages, pp. 382-401, 1990
• M. Tofte: Type inference for polymorphic references. Information and Computation, 89(1), pp. 1-34, Nov. 1990
• A.K. Wright: Simple Imperative Polymorphism Lisp and Symbolic Computation 8 (4), pp. 343-356, Dec. 1995

• B. Pierce, S. Dietzen, S. Michaylov: Programming in higher-order typed lambda-calculi. Technical Report CMU-CS-89-111, Carnegie Mellon University, 1989
• J.B. Wells: Typability and Type Checking in the Second Order Lambda-Calculus Are Equivalent and Undecidable

• L. Cardelli: A Semantics of Multiple Inheritance. Information and Computation, 76(2/3), 1988
• An Introduction to Polymorphic Lambda Calculus with Subtyping Techreport vub-tinf-tr-94-01, Vrije Universiteit Brussel, 1994

• L.Cardelli, P. Wegener: On understanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17(4):471-522, 1985
• J.C. Mitchell, G. D. Plotkin: Abstract Types Have Existential Type. ACM Transactions on Programming Languages and Systems, Vol. 10, No. 3, pp. 470-502, 1988

Allgemein

• R.W. Sebesta: Concepts of Programming Languages. The Benjamin/Cummings Publishing Company, 2nd edition, 1993

Algol 68

• A.S.Tanenbaum: A tutorial on Algol 68. ACM Computing Surveys 8, 1976

CLU

• B. Liskov, R. Atkinson, et al.: CLU Reference Manual. Springer-Verlag, 1981

Funktionale Programmiersprachen

• A. Field, P. Harrington: Functional Programming. Addison-Wesley, 1988
• S. Peyton Jones: The implementation of functional programming languages. Prentice-Hall, 1987

ML

• R. Harper: Introduction to Standard ML.
• Mads Tofte's Tips for Computer Scientists on Standard ML.
• A. Wikstroem: Functional Programming using Standard ML. Prentice Hall, 1987
• Andrew Cumming: A Gentle Introduction to ML
• Weitere Informationen zu ML: http://www.cs.princeton.edu/fac/appel/smlnj/sml.html, http://foxnet.cs.cmu.edu/sml.html, Moscow ML

Eiffel

• B. Meyer: EIFFEL: the language. Prentice Hall, 1992
• A.A. Snyder, B.N.Vetter: Eiffel - An Advanced Introduction.

• Functional Programming Archive
  • Type Inference and Overloading
  • Type Systems
• Types list archives
• Personen
  • Henk Barendregt
  • Luca Cardelli
  • John C. Mitchell
  • Benjamin Pierce