Abstract data types in Euclid
- 1 March 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 13 (3) , 34-42
- https://doi.org/10.1145/954373.954376
Abstract
The programming language Euclid provides features that support abstract data types, but does not strictly speaking provide a true data abstraction mechanism. This paper assesses the data abstraction facilities that Euclid does provide, examines the two ways of instantiating Euclid modules, and discusses other features of modules that the designers of Euclid chose not to include. In particular, the paper addresses the issues of (1) enforceable separation between abstract definition and representation, (2) specifying the relationship between abstract definition and representation, (3) type parameters in modules, (4) operator extensions, and (5) scope restrictions on identifiers.This publication has 8 references indexed in Scilit:
- Early experience with MesaCommunications of the ACM, 1977
- Abstraction mechanisms in CLUCommunications of the ACM, 1977
- GypsyACM SIGPLAN Notices, 1977
- Report on the programming language EuclidACM SIGPLAN Notices, 1977
- A next step in data structuring for programming languagesPublished by Association for Computing Machinery (ACM) ,1976
- Some desirable properties of data abstraction facilitiesPublished by Association for Computing Machinery (ACM) ,1976
- The treatment of data types in EL1Communications of the ACM, 1974
- Global variable considered harmfulACM SIGPLAN Notices, 1973