ACM Transactions on Programming Languages and Systems · 1988 · 432 citations · 36 references
ComputingComputer ScienceAlgebraProgramming LanguagesSyntaxAbstract InterpretationData TypesType CheckingType SystemsAbstract Data TypesAbstract TypesExistential TypesLambda CalculusLambda Calculus SemanticsType DeclarationsType TheoryTyped Lambda Calculus
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 between typed programming languages and constructive logic.
36
Thierry Coquand, Gérard Huet · Information and Computation · 1988 · 1.1K citations · Full text
Barbara Liskov, Alan Snyder, Russell R. Atkinson et al. · Communications of the ACM · 1977 · 772 citations · Full text
Types, Abstraction and Parametric Polymorphism.
John Reynolds · IFIP Congress · 1983 · 771 citations