Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The C programming language
Embedding continuations in procedural objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Controlling dynamic objects in large Ada systems
ACM SIGAda Ada Letters
Using the re-export paradigm to build composable Ada software components
ACM SIGAda Ada Letters
Simulating inheritance with Ada
ACM SIGAda Ada Letters
I-structures: data structures for parallel computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Object-oriented programming techniques with Ada: an example
ACM SIGAda Ada Letters
Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
Generic instantiations as closures
ACM SIGAda Ada Letters
Storage reclamation models for Ada programs
SIGAda '87 Proceedings of the 1987 annual ACM SIGAda international conference on Ada
Portable and efficient dynamic storage management in Ada
SIGAda '87 Proceedings of the 1987 annual ACM SIGAda international conference on Ada
Alexi — a case study in design issues for LISP capabilities in Ada
WADAS '88 Proceedings of the fifth Washington Ada symposium on Ada
List processing in real time on a serial computer
Communications of the ACM
Communications of the ACM
Updating elements of a collection in place
ACM SIGAda Ada Letters
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Programming ADA
Proceedings of ACM conference on Proving assertions about programs
Rabbit: A Compiler for Scheme
Nesting in Ada programs is for the birds
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
ACM SIGAda Ada Letters
Object-oriented programming in Ada83—genericity rehabilitated
ACM SIGAda Ada Letters
CLOStrophobia: its etiology and treatment
ACM SIGPLAN OOPS Messenger
The treadmill: real-time garbage collection without motion sickness
ACM SIGPLAN Notices
Relaxing the constraints on Ada's limited private types through functional expressions
ACM SIGAda Ada Letters
Safe and leakproof resource management using Ada83 limited types
ACM SIGAda Ada Letters
Iterators: signs of weakness in object-oriented languages
ACM SIGPLAN OOPS Messenger
Equal rights for functional objects or, the more things change, the more they are the same
ACM SIGPLAN OOPS Messenger
Linear logic and permutation stacks—the Forth shall be first
ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
Abstract data types are under full control with Ada 9X
TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
| Hi-index | 0.00 |
Many traditional styles of programming cannot cope with the limitations of Ada limited private types. We present a style of programming that enables structured programming in Ada with limited private types. The problem of "finalization" is safely and cleanly handled through the use of a generic package which guarantees that a variable of the limited private type will be finalized even in the presence of exceptions.Finalization is often desired in order to perform automatic garbage collection, whether by reference counting or by marking. We have proved our structured technique by developing a garbage-collected Lisp system in Ada in which the Lisp values are instances of a limited private type. The Ada code was so highly structured, that it was generated automatically using a simple compiler. The garbage collector in this system was easily and safely implemented, and different garbage collection techniques were tested without affecting user code.