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

Author:   G. Kahn ,  D. B. MacQueen ,  G. Plotkin
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   1984 ed.
Volume:   173
ISBN:  

9783540133469


Pages:   396
Publication Date:   01 June 1984
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $51.48 Quantity:  
Add to Cart

Share |

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


Overview

Full Product Details

Author:   G. Kahn ,  D. B. MacQueen ,  G. Plotkin
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1984 ed.
Volume:   173
Dimensions:   Width: 15.50cm , Height: 2.10cm , Length: 23.50cm
Weight:   1.250kg
ISBN:  

9783540133469


ISBN 10:   3540133461
Pages:   396
Publication Date:   01 June 1984
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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 theory of parameterized specifications.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List