Data abstraction: A static implementation strategy

Authors:
James B. Morris
Affiliations:
Purdue University
Venue:
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Year:
1979

Citing 6
Cited 2

An analysis of inline substitution for a structured programming language

Communications of the ACM
Revised report on the algorithm language ALGOL 60

Communications of the ACM
Task communication in DEMOS

SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
The DEMOS file system

SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Abstract data types in the Model programming language

Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Abstraction mechanisms in CLU

Proceedings of an ACM conference on Language design for reliable software

Sharing code among instances of Ada generics

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
BIGMAC II: A FORTRAN language augmentation tool

ICSE '81 Proceedings of the 5th international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A description of the implementation of the data abstraction mechanism for the Model programming language is discussed. The Model programming language utilizes a “static” approach to data abstraction in that abstract concepts are expanded by early phases of the compiler in a controlled fashion into base language concepts. Thus, the final phase of the compiler sees only base language constructions. Exemplified are generic procedures accepting parameters of several different data types. A discussion is given of the problem of “parameter explosion”, a problem traditionally inherent in languages implementing open (inline) procedures.