Semantics of Data Types

International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings
Herausgegeben:Kahn, G.; MacQueen, D. B.; Plotkin, G.

• Broschiertes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 173
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-13346-9
• 1984.
• Seitenzahl: 404
• Erscheinungstermin: 1. Juni 1984
• Englisch
• Abmessung: 235mm x 155mm x 22mm
• Gewicht: 567g
• ISBN-13: 9783540133469
• ISBN-10: 3540133461
• Artikelnr.: 23144401

Inhaltsangabe

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.