Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings: Lecture Notes in Computer Science, cartea 173

A kernel language for abstract data types and modules.- A semantics of multiple inheritance.- Understanding Russell a first attempt.- A basic Abstract Semantic Algebra.- Using information systems to solve reoursive domain equations effectively.- The semantics of second order polymorphic lambda calculus.- Polymorphism is not set-theoretic.- A theory of data type representation independence.- Abstract data types and their extensions within a constructive logic.- Deriving structural induction in LCF.- Executable specification of static semantics.- Cartesian closed categories of enumerations for effective type structures.- Type inference and type containment.- F-semantics for intersection type discipline.- The typechecking of programs with implicit type structure.- Partial implementations of abstract data types: A dissenting view on errors.- Building specifications in an arbitrary institution.- A proof system for verifying composability of abstract implementations.- Towards a proof theoryof parameterized specifications.