Revised report on the algorithm language ALGOL 60
Communications of the ACM
An overview of the SR language and implementation
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
Portable and efficient dynamic storage management in Ada
SIGAda '87 Proceedings of the 1987 annual ACM SIGAda international conference on Ada
Interface control and incremental development in the PIC environment
ICSE '85 Proceedings of the 8th international conference on Software engineering
Block structure and object oriented languages
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
Viewing Ada from a process model perspective
SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada
Tasks as abstraction mechanisms
ACM SIGAda Ada Letters
Type checking, separate compilation and reusability
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Communication system design using ADA
ICSE '84 Proceedings of the 7th international conference on Software engineering
Ambiguities and insecurities in Modula-2
ACM SIGPLAN Notices
A methodology for modular use of Ada
ACM SIGPLAN Notices
Modular decomposition of Ada into a hierarchy of sublanguages
ACM SIGAda Ada Letters
Ada Language statistics for the iMAX 432 operating system
ACM SIGAda Ada Letters
The Byron (tm) program design language
ACM SIGAda Ada Letters
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
| Hi-index | 0.00 |
Given a data abstraction construct like the Ada package and in light of current thoughts on programming methodology, we feel that nesting is an anachronism. In this paper we propose a nest-free program style for Ada that eschews nested program units and declarations within blocks and instead heavily utilizes packages and context specifications as mechanisms for controlling visibility. We view this proposal as a first step toward the development of programming methods that exploit the novel language features available in Ada. Consideration of this proposal's ramifications for data flow, control flow, and overall program structure substantiates our contention that a tree structure is seldom a natural representation of a program and that nesting therefore generally interferes with program development and readability.