Bindings persistent programming languages
- 1 April 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 23 (4) , 27-34
- https://doi.org/10.1145/44326.44328
Abstract
In designing and building persistent object systems we are attempting to regularise the activities on data that are traditional in programming languages, operating systems, database management systems and file systems. We hypothesise that regularity and simplicity may be achieved by regarding the exercise as one of designing a language powerful enough to allow for all our programming needs and using some principles in the design of the language to achieve this regularity and simplicity.In this paper we investigate the nature of binding mechanisms showing how some form of dynamic binding is necessary for persistence. The binding mechanisms of Ada, which has a traditional file based view of persistence, and of Napier, which has an object based view, are used as illustrations.Keywords
This publication has 7 references indexed in Scilit:
- Safe Browsing in a Strongly Typed Persistent EnvironmentThe Computer Journal, 1988
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- An Approach to Persistent ProgrammingThe Computer Journal, 1983
- The UNIX time-sharing systemCommunications of the ACM, 1974
- Performance predictions for extended paged memoriesActa Informatica, 1971
- Segmentation and the Design of Multiprogrammed Computer SystemsJournal of the ACM, 1965
- LISP 1.5 PROGRAMMER'S MANUALPublished by Defense Technical Information Center (DTIC) ,1962