%A R. Burstall
%A B. Lampson
%T A kernel language for abstract data types and modules
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 1-50

%A Luca Cardelli
%T A semantics of multiple inheritance
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 51-67

%A James G. Hook
%T Understanding Russell - a first attempt
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 69-85

%A Peter Moses
%T A basic abstract semantic algebra
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 87-107

%A K.G. Larsen
%A G. Winskel
%T Using information systems
to solve recursive domain equations effectively
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 109-129

%A Kim B. Bruce
%A Albert R. Meyer
%T The semantics of second order polymorphic lambda calculus
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 131-144

%A John C. Reynolds
%T Polymorphism is not set-theoretic
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 145-156

%A Christopher T. Haynes
%T A theory of data type representation independence
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 157-175

%A A. Bertoni
%A G. Mauri
%A P. Miglioli
%A M. Ornaghi
%T Abstract data types and their extensions within a constructive logic
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 177-195

%A Lawrence Paulson
%T Deriving structural induction in LCF
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 197-214

%A Thierry Despeyroux
%T Executable specifications of static semantics
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 215-233

%A G. Longo
%A E. Moggi
%T Cartesian closed categories of enumerations
for effective type structures
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 235-255

%A John Mitchell
%T Type inference and type containment
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 257-277

%A M. Dezani-Ciancaglini
%A I. Margaria
%T F-semantics for intersection type discipline
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 279-300

%A Nancy McCracken
%T The typechecking of programs with implicit type structure
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 301-315

%A Samuel Kamin
%A Myla Archer
%T Prtial implementations of abstract data types:
a dissenting view on errors
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 317-336

%A Donald Sannella
%A Andrzej Tarlecki
%T Building specifications in an arbitrary institution
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 337-356

%A Fernando Orejas
%T A proof system for verifying
composability of abstract implementations
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 357-374

%A Peter Padawitz
%T Towards a proof theory of parameterized specifications
%J Proceedings of the International Symposium
on the Semantics of Data Types
%E G. Kahn
%E D.B. MacQueen
%E G. Plotkin
%C Sophia-Antipolis, France
%D June 1984
%O published as Lecture Notes in Computer Science 173
%K sdt
%P 375-391