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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference37 articles.
1. Goguen J.A. and Meseguer J. (1989), Order-sorted algebra I, Report SRI-CSL-89–10, (to appear in Theoretical Computer Science).
2. Constructive Analysis
3. Boehm H.-J. (1987), Constructive real interpretation of numerical programs, in SIGPLAN ‘87 Symposium on Interpreters and Interpretive Techniques, 214–221.
4. Bidoit M. , Kreowski H.-J. , Lescanne P. , Orejas F. and Sanella D. , (eds.) (1991), Algebraic System Specification and Development, LNCS 501.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献