The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
High level programming for distributed computing
Communications of the ACM
Abstract data types and the development of data structures
Communications of the ACM
Communications of the ACM
On the criteria to be used in decomposing systems into modules
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Gypsy: A language for specification and implementation of verifiable programs
Proceedings of an ACM conference on Language design for reliable software
Proceedings of an ACM conference on Language design for reliable software
Implementation of a Capability-Based Data Abstraction
IEEE Transactions on Software Engineering
An Introduction to the Construction and Verification of Alphard Programs
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
Data abstractions have been proposed as a means to enhance program modularity. The implementation of such new features to an existing language is typically handled by either rewriting large portions of an existing compiler or by using a preprocessor to translate the extensions into the standard language. The first technique is expensive to implement while the latter is usually slow and clumsy to use. In this paper a data abstraction addition to PL 1 is described and a hybrid implementation is given. A minimal set of primitive features are added to the compiler and the other extensions are added via an internal macro processor that expands the new syntax into the existing language.