Abstract types have existential type

  title={Abstract types have existential type},
  author={J. Mitchell and G. Plotkin},
  journal={ACM Trans. Program. Lang. Syst.},
  • J. Mitchell, G. Plotkin
  • Published 1988
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • Abstract data type declarations appear in typed programming languages like Ada, Alphard, CLU and ML. This form of declaration binds a list of identifiers to a type with associated operations, a composite “value” we call a data algebra. We use a second-order typed lambda calculus SOL to show how data algebras may be given types, passed as parameters, and returned as results of function calls. In the process, we discuss the semantics of abstract data type declarations and review a connection… CONTINUE READING
    368 Citations
    Polymorphic type inference and abstract data types
    • 113
    • Highly Influenced
    • PDF
    Pebble, a Kernel Language for Modules and Abstract Data Types
    • 41
    Dynamic opacity for abstract types
    • 1
    • PDF
    Quantified types in an imperative language
    • 16
    • PDF
    Putting type annotations to work
    • 164
    Polymorphic Lambda Calculus with Dynamic Types
    • 1
    • PDF
    A Logic for Abstract Data Types as Existential Types
    • 10
    • PDF
    An Extension of ML with First-Class Abstract Types
    • 11
    • Highly Influenced
    • PDF
    Soft Interfaces : Typing Scheme at the Module Level
    • 1
    • PDF


    A Kernel Language for Abstract Data Types and Modules
    • 130
    • Highly Influential
    Putting Theories Together to Make Specifications
    • 516
    • Highly Influential
    • PDF
    Towards a theory of type structure
    • J. Reynolds
    • Physics, Computer Science
    • Symposium on Programming
    • 1974
    • 1,000
    • Highly Influential
    • PDF
    Constructive mathematics and computer programming. Paper presented at The 6th International Congress for Logic, Methodology and Philosophy of Science
    • Preprint, Univ. of Stockholm, Dept. of Mathematics, Stockholm,
    • 1979
    Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur
    • 744
    • Highly Influential
    • PDF
    Natural Deduction: A Proof-Theoretical Study
    • 1,252
    • Highly Influential
    An informal introduction to specification using CLEAR
    • In The Correctness Problem in Computer Science,
    • 1981