Performance and evaluation of LISP systems
Performance and evaluation of LISP systems
Database system concepts
Nested transactions: an introduction
Concurrency control and reliability in distributed systems
ZEITGEIST: Database support for object-oriented programming
Lecture notes in computer science on Advances in object-oriented database systems
PCLOS: a flexible implementation of CLOS persistence
on ECOOP '88 (European Conference on Object-Oriented Programming)
ODE (Object Database and Environment): the language and the data model
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
PS-ALGOL implementations: applications in persistent object-oriented programming
PS-ALGOL implementations: applications in persistent object-oriented programming
Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
The ObjectStore database system
Communications of the ACM
Lisp O2: a persistent object-oriented Lisp
Building an object-oriented database system
The persistent object system metastore: persistence via metaprograming
The persistent object system metastore: persistence via metaprograming
Lisp and Symbolic Computation
Design of an Object Faulting Persistent Smalltalk
Design of an Object Faulting Persistent Smalltalk
Adding Support for Persistence to CLOS via Its Metaobject Protocol
Lisp and Symbolic Computation
Reflections on Metaprogramming
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
The syntax and semantics for UCL+P, a persistent Common Lisp, are defined. The definition provides adequate support for persistence while maintaining the look-and-feel of Common Lisp. All Lisp data types (except streams) can be made persistent. Persistence is conferred automatically on non-symbol values when they become part of a persistent data structure. Symbols are persistent if interned in a persistent package. The Common Lisp package facility was enhanced to allow for persistent packages which provide modularity to the space of persistent values and serve as the ultimate roots of the persistence conferral algorithm. Values are retrieved from the store using demand loading; new or mutated values are automatically detected and written back to the store when the transaction is committed. The sharing semantics of Lisp are preserved in this specification.