Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
Journal of the ACM (JACM)
The treatment of data types in EL1
Communications of the ACM
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
NPL: highlights of a new programming language
Communications of the ACM
A contribution to the development of ALGOL
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Recursively defined data types: part 1
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Operating system principles
Automatic and semiautomatic optimization of SETL
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Programming with abstract data types
Proceedings of the ACM SIGPLAN symposium on Very high level languages
The System Language for Project SUE
Proceedings of the SIGPLAN symposium on Languages for system implementation
Programming Languages, Information Structures, and Machine Organization.
Programming Languages, Information Structures, and Machine Organization.
Informal introduction to ALGOL 68
Informal introduction to ALGOL 68
Modelling of storage properties of higher level languages
ACM SIGPLAN Notices
The FORTRAN automatic coding system
IRE-AIEE-ACM '57 (Western) Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability
The introduction of definitional facilities into higher level programming languages
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
| Hi-index | 0.00 |
A model for storage in procedural languages is presented. Its fundamental notion is to strictly distinguish values from storage objects. Several difficulties in current languages are resolved in this model, e.g., the problem of flexible locations [1] and the meaning of the term type [2, 3, 4]. In the light of the storage object/value dichotomy, several notions are found to be covered by the term type. The implications of the model are explored with respect to the more conventional data constructs of procedural languages as well as to sets and how they might be provided. Finally, data extension mechanisms are considered. Whereas the treatment here is not complete, the template concept introduced in the model does suggest a useful framework for providing the much talked of but seldom realized benefits of data extensibility.