Semantics of Data Types International Symposium Sophia-Antipolis, France, June 27 – 29, 1984 Proceedings / [electronic resource] :
edited by Gilles Kahn, David B. MacQueen, Gordon Plotkin.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 1984.
- VIII, 396 p. online resource.
- Lecture Notes in Computer Science, 173 0302-9743 ; .
- Lecture Notes in Computer Science, 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 theory of parameterized specifications.
9783540388913
10.1007/3-540-13346-1 doi
Computer science.
Computer Science.
Mathematical Logic and Formal Languages.
Programming Languages, Compilers, Interpreters.
QA8.9-QA10.3
005.131
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 theory of parameterized specifications.
9783540388913
10.1007/3-540-13346-1 doi
Computer science.
Computer Science.
Mathematical Logic and Formal Languages.
Programming Languages, Compilers, Interpreters.
QA8.9-QA10.3
005.131