Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings
Proceedings of the International Symposium on the Semantics of Data Types.
1111333211
Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings
Proceedings of the International Symposium on the Semantics of Data Types.
49.99 In Stock
Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings

Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings

Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings

Semantics of Data Types: International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings

Paperback(1984)

$49.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

Proceedings of the International Symposium on the Semantics of Data Types.

Product Details

ISBN-13: 9783540133469
Publisher: Springer Berlin Heidelberg
Publication date: 07/02/1984
Series: Lecture Notes in Computer Science , #173
Edition description: 1984
Pages: 396
Product dimensions: 6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

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.
From the B&N Reads Blog

Customer Reviews