Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Qualified Types
  • Cited by 59
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      May 2010
      November 1994
      ISBN:
      9780511663086
      9780521543262
      DOI:
      https://doi.org/10.1017/CBO9780511663086
      Dimensions:
      Weight & Pages:
      Dimensions:
      (247 x 174 mm)
      Weight & Pages:
      0.328kg, 172 Pages
      • Subjects:
      Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Programming Languages and Applied Logic, Computing: General Interest
      Series:
      Distinguished Dissertations in Computer Science (9)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Programming Languages and Applied Logic, Computing: General Interest
    Series:
    Distinguished Dissertations in Computer Science (9)
    Information

    Book description

    This book describes the use of qualified types to provide a general framework for the combination of polymorphism and overloading. For example, qualified types can be viewed as a generalization of type classes in the functional language Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in Standard ML. Other applications of qualified types include extensible records and subtyping. Using a general formulation of qualified types, the author extends the Damas/Milner type inference algorithm to support qualified types, which in turn specifies the set of all possible types for any term. In addition, he describes a new technique for establishing suitable coherence conditions that guarantee the same semantics for all possible translations of a given term. Practical issues that arise in concrete implementations are also discussed, concentrating in particular on the implementation of overloading in Haskell and Gofer, a small functional programming system developed by the author.

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.