Semantics of Data Types [electronic resource] : International Symposium Sophia-Antipolis, France, June 27 – 29, 1984 Proceedings /
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.
Main Authors: | , , , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1984
|
Subjects: | Computer science., Programming languages (Electronic computers)., Mathematical logic., Computer Science., Mathematical Logic and Formal Languages., Programming Languages, Compilers, Interpreters., |
Online Access: | http://dx.doi.org/10.1007/3-540-13346-1 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|