Skip to main content
SpringerLink
Log in

Semantics of Data Types

International Symposium Sophia-Antipolis, France, June 27-29, 1984. Proceedings

  • Conference proceedings
  • © 1984

Overview

Editors:
  1. Gilles Kahn
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. David B. MacQueen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Gordon Plotkin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 173)

Included in the following conference series:

Conference proceedings info: SDT 1984.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. A kernel language for abstract data types and modules

    • R. Burstall, B. Lampson
    Pages 1-50

  3. A semantics of multiple inheritance

    • Luca Cardelli
    Pages 51-67

  4. Understanding Russell a first attempt

    • James G. Hook
    Pages 69-85

  5. A basic Abstract Semantic Algebra

    • Peter Mosses
    Pages 87-107

  6. Using information systems to solve reoursive domain equations effectively

    • K. G. Larsen, G. Winskel
    Pages 109-129

  7. The semantics of second order polymorphic lambda calculus

    • Kim B. Bruce, Albert R. Meyer
    Pages 131-144

  8. Polymorphism is not set-theoretic

    • John C. Reynolds
    Pages 145-156

  9. A theory of data type representation independence

    • Christopher T. Haynes
    Pages 157-175

  10. Abstract data types and their extensions within a constructive logic

    • A. Bertoni, G. Mauri, P. Miclioli, M. Ornaghi
    Pages 177-195

  11. Deriving structural induction in LCF

    • Lawrence Paulson
    Pages 197-214

  12. Executable specification of static semantics

    • Thierry Despeyroux
    Pages 215-233

  13. Cartesian closed categories of enumerations for effective type structures

    • G. Longo, E. Moggi
    Pages 235-255

  14. Type inference and type containment

    • John Mitchell
    Pages 257-277

  15. F-semantics for intersection type discipline

    • M. Dezani-Ciancaglini, I. Margaria
    Pages 279-300

  16. The typechecking of programs with implicit type structure

    • Nancy McCracken
    Pages 301-315

  17. Partial implementations of abstract data types: A dissenting view on errors

    • Samuel Kamin, Myla Archer
    Pages 317-336

  18. Building specifications in an arbitrary institution

    • Donald Sannella, Andrzej Tarlecki
    Pages 337-356

  19. A proof system for verifying composability of abstract implementations

    • Fernando Drejas
    Pages 357-374

  20. Towards a proof theory of parameterized specifications

    • Peter Padawitz
    Pages 375-391
Back to top

Other volumes

  1. Semantics of Data Types

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation