Syntax and semantics of a persistent Common Lisp

ABSTRACT

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.

REFERENCES

• 1: R. Agrawal , N. H. Gehani, ODE (Object Database and Environment): the language and the data model, Proceedings of the 1989 ACM SIGMOD international conference on Management of data, p.36-45, June 1989, Portland, Oregon, United States
• 2: Gilles Barbedette, Lisp O2: a persistent object-oriented Lisp, Building an object-oriented database system: the story of 02, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992
• 3: Peter Broadbery , Christopher Burdorf, Applications of Telos, Lisp and Symbolic Computation, v.6 n.1-2, p.139-158, Aug. 1993 [doi>10.1007/BF01025918]
• 4: W. Paul Cockshott, PS-ALGOL implementations: applications in persistent object-oriented programming, Ellis Horwood, Upper Saddle River, NJ, 1990
• 5: Henry F. Korth , Abraham Silberschatz, Database system concepts, McGraw-Hill, Inc., New York, NY, 1986
• 6: S. Ford , J. Joseph , D. E. Langworthy , D. F. Lively , G. Pathak, ZEITGEIST: Database support for object-oriented programming, Lecture notes in computer science on Advances in object-oriented database systems, p.23-42, September 1988, Bad Mu:9Ainster am Stein-Edernburg, Germany
• 7: Richard P. Gabriel, Performance and evaluation of LISP systems, Massachusetts Institute of Technology, Cambridge, MA, 1985
• 8: Antony L. Hosking , J. E Moss , Cynthia Bliss, Design of an Object Faulting Persistent Smalltalk, University of Massachusetts, Amherst, MA, 1990
• 9: J. H. Jacobs, M. R. Swanson, and R. R. Kessler. Persistence is hard, then you die! or Compiler and runtime support for a persistent common llsp. Technical report, Center for Software Science, University of Utah, 1994. UUCS-94*004.
• 10: Charles Lamb , Gordon Landis , Jack Orenstein , Dan Weinreb, The ObjectStore database system, Communications of the ACM, v.34 n.10, p.50-63, Oct. 1991 [doi>10.1145/125223.125244]
• 11: Arthur H. Lee, The persistent object system metastore: persistence via metaprograming, University of Utah, Salt Lake City, UT, 1992
• 12: J. Eliot , B. Moss, Nested transactions: an introduction, Concurrency control and reliability in distributed systems, Van Nostrand Reinhold Co., New York, NY, 1987
• 13: S. M. Nettles and Wing J. M. Persistence 4- undoability ~- transactions. In Proceedings of the Hawaii International Conference on Systems Science 25, 1992. See also tech-report CMU-CS-91-173.
• 14: A. Paepcke, PCLOS: a flexible implementation of CLOS persistence, on ECOOP '88 (European Conference on Object-Oriented Programming), p.374-389, August 1988, Oslo, Norway
• 15: Joel E. Richardson, Michael J. Carey, and Daniel T. Schuh. The design of the E programming language. Technical report, University of Wisconsin, 1989. Tech Report 824.
• 16: Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: Common Lisp

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.1 Formal Definitions and Theory
          Subjects: Syntax; Semantics
      D.3.3 Language Constructs and Features
          Subjects: Procedures, functions, and subroutines

  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS

General Terms:
Algorithms, Languages