Programming languages (2nd ed.)
Programming languages (2nd ed.)
High-level programming features for improving the efficiency of a relational database system
ACM Transactions on Database Systems (TODS)
Theseus—a programming language for relational databeses
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Some high level language constructs for data of type relation
ACM Transactions on Database Systems (TODS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relational database: a practical foundation for productivity
Communications of the ACM
The system for business automation (SBA): programming language
Communications of the ACM
A very high level programming language for data processing applications
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Application Development without Programmers
Application Development without Programmers
Guide to Nomad for Applications Development
Guide to Nomad for Applications Development
Data abstraction, views and updates in RIGEL
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An overview of nonprocedural languages
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Programming Language Constructs for Screen Definition
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
The continued development of higher order programming languages has not yielded major productivity improvements in the software development process. One often mentioned mechanism for achieving significant orders of improvement are application generators, such as RAMIS, NOMAD, and FOCUS. These systems have been applied to data intensive business applications with phenomenal success. The purpose of this paper is to present the basic components of application generators and show why they yield such large productivity increases in the EDP environment. We investigate the meaning of nonprocedural programming and show how it exists in current application generators. Then we analyze the possibility of extending application generators so that they may be used for non-edp type applications.