Strategies for data abstraction in LISP

Authors:
Barbara K. Steele
Affiliations:
-
Venue:
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Year:
1980

Citing 7
Cited 0

Abstraction mechanisms in CLU

Communications of the ACM
On the criteria to be used in decomposing systems into modules

Communications of the ACM
The Design of an Optimizing Compiler

The Design of an Optimizing Compiler
Programming with abstract data types

Proceedings of the ACM SIGPLAN symposium on Very high level languages
The use of abstract data types to simplify program modifications

Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Debunking the “expensive procedure call” myth or, procedure call implementations considered harmful or, LAMBDA: The Ultimate GOTO

ACM '77 Proceedings of the 1977 annual conference
Global program optimizations.

Global program optimizations.

Quantified Score

Hi-index	0.00

Visualization

Abstract

The benefits of abstract data types are many and are generally agreed upon [Liskov and Zilles 1974, Linden 1976]. New languages are being constructed which provide for and enforce the use of data abstractions [Liskov et al 1977, Wulf et al 1976]. However, many of us are not in a position to use these new languages, but must stick to our installation's compiler. How then can we obtain the benefits of data abstraction? We discuss the implementation of data abstraction in a LISP program and the subtleties involved in doing so: specifically, how it is possible to enforce proper data abstraction in a language which does not provide for abstract data types.