Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27 – 29, 1984 Proceedings

A kernel language for abstract data types and modules....Pages 1-50
A semantics of multiple inheritance....Pages 51-67
Understanding Russell a first attempt....Pages 69-85
A basic Abstract Semantic Algebra....Pages 87-107
Using information systems to solve reoursive domain equations effectively....Pages 109-129
The semantics of second order polymorphic lambda calculus....Pages 131-144
Polymorphism is not set-theoretic....Pages 145-156
A theory of data type representation independence....Pages 157-175
Abstract data types and their extensions within a constructive logic....Pages 177-195
Deriving structural induction in LCF....Pages 197-214
Executable specification of static semantics....Pages 215-233
Cartesian closed categories of enumerations for effective type structures....Pages 235-255
Type inference and type containment....Pages 257-277
F-semantics for intersection type discipline....Pages 279-300
The typechecking of programs with implicit type structure....Pages 301-315
Partial implementations of abstract data types: A dissenting view on errors....Pages 317-336
Building specifications in an arbitrary institution....Pages 337-356
A proof system for verifying composability of abstract implementations....Pages 357-374
Towards a proof theory of parameterized specifications....Pages 375-391