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.
Produkteigenschaften
- Artikelnummer: 9783540133469
- Medium: Buch
- ISBN: 978-3-540-13346-9
- Verlag: Springer
- Erscheinungstermin: 01.06.1984
- Sprache(n): Englisch
- Auflage: 1. Auflage 1984
- Serie: Lecture Notes in Computer Science
- Produktform: Kartoniert, Paperback
- Gewicht: 1250 g
- Seiten: 396
- Format (B x H x T): 155 x 235 x 22 mm
- Ausgabetyp: Kein, Unbekannt
