UID:
almafu_9959186099402883
Format:
1 online resource (VIII, 396 p.)
Edition:
1st ed. 1984.
Edition:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-38891-5
Series Statement:
Lecture Notes in Computer Science, 173
Note:
Bibliographic Level Mode of Issuance: Monograph
,
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.
,
English
In:
Springer eBooks
Additional Edition:
ISBN 3-540-13346-1
Language:
English
DOI:
10.1007/3-540-13346-1
URL:
http://dx.doi.org/10.1007/3-540-13346-1
URL:
http://dx.doi.org/10.1007/3-540-13346-1
URL:
http://dx.doi.org/10.1007/3-540-13346-1
