A new approach to abstract data types, I Informal development
- 1 June 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 2 (2) , 193-229
- https://doi.org/10.1017/s0960129500001432
Abstract
The concept of abstract data types (ADTs) has emerged in the last fifteen years or so as one of the major programming design tools, with the emphasis on modular construction of large-scale programe. ADTs provide the means for seperating how data objects may be used from the different ways in which they actually are, or might be, implemented. A foundation for the theory of compputation with ADTs must provide answers to such questions as: What are ADTs and how may they be specified? What does it mean to implement an ADT? How may we construct new ADTs from old ones? What does it mean to compute with ADTs? This paper is devoted to a new and rather general, constructively based approach to these questions.Keywords
This publication has 24 references indexed in Scilit:
- Computational Models For Feasible Real AnalysisPublished by Springer Nature ,1990
- The formal language of recursionThe Journal of Symbolic Logic, 1989
- Finitary inductively presented logicsPublished by Elsevier ,1989
- Abstract types have existential typeACM Transactions on Programming Languages and Systems, 1988
- Between constructive and classical mathematicsPublished by Springer Nature ,1984
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization TheoremsSIAM Journal on Computing, 1983
- Partial abstract typesActa Informatica, 1982
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- Programming with abstract data typesACM SIGPLAN Notices, 1974
- Computable Algebra, General Theory and Theory of Computable FieldsTransactions of the American Mathematical Society, 1960