Types and polymorphism in persistent programming systems

data type 8 Number of existential quantifiers and representation of field names One list element for each field type Witness type 9 Which one of the abstract type's quantifiers Abstract data type bound to Parameterised type 10 Number of parameters and label, specificInfo of specialised type references of specialised type

[1]  John Rosenberg,et al.  Security and Persistence , 1990, Workshops in Computing.

[2]  李幼升,et al.  Ph , 1989 .

[3]  Ronald Morrison,et al.  On the Classification of Binding Mechanisms , 1990, Inf. Process. Lett..

[4]  J. Fairbairn,et al.  Ponder and its type system , 1982 .

[5]  J. Girard Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

[6]  Ronald Morrison,et al.  The persistent store as an enabling technology for integrated project support environments , 1985, ICSE '85.

[7]  Ronald Morrison,et al.  An Approach to Persistent Programming , 1989, Comput. J..

[8]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Inf. Comput..

[9]  O. J. Dahl,et al.  Simula Begin , 1979 .

[10]  Juris Hartmanis,et al.  The Programming Language Ada , 1983, Lecture Notes in Computer Science.

[11]  Luca Cardelli,et al.  Persistence and Type Abstraction , 1985, Data Types and Persistence , Informal Proceedings.

[12]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[13]  Philip Wadler,et al.  How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.

[14]  B. J. Mailloux,et al.  Report on the Algorithmic Language ALGOL 68 , 1969 .

[15]  Ronald Morrison,et al.  Data Types and Persistence , 1988 .

[16]  Renzo Orsini,et al.  GALILEO: a strongly-typed, interactive conceptual language , 1985, TODS.

[17]  Malcolm S. Powell,et al.  Adding Programming Facilities to an Abstract Data Store , 1985, Data Types and Persistence , Informal Proceedings.

[18]  A. S. M. Sajeev,et al.  A Capability Based Language for Persistent Programming: Implementation Issues , 1989, POS.

[19]  Elliott I. Organick,et al.  The multics system: an examination of its structure , 1972 .

[20]  Ronald Morrison,et al.  Types, Bindings and Parameters in a Persistent Environment , 1988, Data Types and Persistence , Informal Proceedings.

[21]  X. St. Andrews , 1883, Nature.

[22]  D. W. Barron,et al.  The Main Features of CPL , 1963, Comput. J..

[23]  Richard C. H. Connor,et al.  Persistence and Type Abstraction Revisited , 1990, POS.

[24]  Craig Schaffert,et al.  CLU Reference Manual , 1984, Lecture Notes in Computer Science.

[25]  Michael Stonebraker,et al.  The design and implementation of INGRES , 1976, TODS.

[26]  Robert Harper Modules and Persistence in Standard ML , 1985, Data Types and Persistence.

[27]  Florian Matthes,et al.  The Type System of DBPL , 1989, DBPL.

[28]  Ronald Morrison,et al.  An object addressing mechanism for statically typed languages with multiple inheritance , 1989, OOPSLA '89.

[29]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[30]  Michael J. Carey,et al.  Implementing Persistence in E , 1989, POS.

[31]  Richard C. H. Connor,et al.  Existentially Quantified Typed as a Database Viewing Mechanism , 1990, EDBT.

[32]  Malcolm P. Atkinson Programming Languages and Databases , 1978, VLDB.

[33]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[34]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[35]  Patrick Pfeffer,et al.  The Design and Implementation of O2, an Object-Oriented Database Systems , 1988, OODBS.

[36]  Robin Milner,et al.  How ML evlolved , 1982 .

[37]  Marvin H. Solomon,et al.  Type definitions with parameters , 1978, POPL.

[38]  Luca Cardelli,et al.  Typeful Programming , 1989, Formal Description of Programming Concepts.

[39]  Ronald Morrison,et al.  Procedures as persistent data objects , 1985, TOPL.

[40]  David W. Stemple,et al.  Exceeding the Limits of Polymorphism in Database Programming Languages , 1990, EDBT.

[41]  Jon Fairbairn,et al.  A New Type-Checker for a Functional Language , 1986, Sci. Comput. Program..

[42]  WadlerPhilip,et al.  Report on the programming language Haskell , 1992 .

[43]  Richard C. H. Connor,et al.  An ad hoc approach to the implementation of polymorphism , 1991, TOPL.

[44]  Stanley B. Zdonik,et al.  An Object Server for an Object-Oriented Database System , 1986, OODBS.

[45]  Peter Lyngbæk,et al.  Providing Uniform Access to Heterogeneous Information Bases , 1988, OODBS.

[46]  Ronald Morrison,et al.  Recursive descent compiling , 1981 .

[47]  David Robson,et al.  Smalltalk-80: The Language and Its Implementation , 1983 .

[48]  Jack B. Dennis,et al.  Programming semantics for multiprogrammed computations , 1966, CACM.

[49]  Stanley B. Zdonik,et al.  Models of Inheritance , 1989, DBPL.

[50]  Malcolm P. Atkinson,et al.  PS-algol: an algol with a persistent heap , 1982, SIGP.

[51]  Rod M. Burstall,et al.  HOPE: An experimental applicative language , 1980, LISP Conference.

[52]  Stefan Kaes,et al.  Parametric Overloading in Polymorphic Programming Languages , 1988, ESOP.

[53]  Alan Dearle,et al.  Safe Browsing in a Strongly Typed Persistent Environment , 1988, Comput. J..

[54]  Alan Dearle Environments: a flexible binding mechanism to support system evolution , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[55]  Ronald Morrison,et al.  Binding and Type Checking in Database Programming Languages , 1988, Comput. J..

[56]  S. J. Young,et al.  The programming language ADA reference manual: Springer-Verlag (1981) pp 243, $7.90, DM 16.50 , 1982, Microprocess. Microsystems.

[57]  Robin Milner,et al.  A proposal for standard ML , 1984, LFP '84.

[58]  B. J. Mailloux,et al.  Report on the Algorithmic Language , 1971 .

[59]  Stuart I. Feldman,et al.  Make — a program for maintaining computer programs , 1979, Softw. Pract. Exp..

[60]  Richard C. H. Connor,et al.  Polymorphism, persistence and software re-use in a strongly typed object-oriented environment , 1987, Softw. Eng. J..

[61]  Richard C. H. Connor,et al.  The Persistent Abstract Machine , 1989, POS.

[62]  Joachim W. Schmidt,et al.  Some high-level language constructs for data of type relation , 1977, SIGMOD '77.

[63]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[64]  B. J. Mailloux,et al.  Report of Algorithmic Language ALGOL 68 , 1969 .

[65]  David C. J. Matthews,et al.  Poly manual , 1985, SIGP.

[66]  Peter Buneman,et al.  Static type inference for parametric classes , 1989, OOPSLA '89.

[67]  Butler W. Lampson,et al.  A Kernel Language for Abstract Data Types and Modules , 1984, Semantics of Data Types.

[68]  Ronald Morrison,et al.  Designing a Persistent Information Space Architecture , 1986, IFIP Congress.

[69]  Juris Hartmanis,et al.  The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983 , 1983, Lecture Notes in Computer Science.

[70]  Peter J. Bailey Performance Evaluation in a Persistent Object Store , 1989, POS.

[71]  Ronald Morrison,et al.  On the Implementation of Constants , 1979, Inf. Process. Lett..

[72]  Peter Buneman,et al.  Can Object-Oriented Databases be Statically Typed? , 1989, DBPL.

[73]  Benjamin A. Dent,et al.  Burroughs' B6500/B7500 stack mechanism , 1968, AFIPS '68 (Spring).

[74]  John C. Mitchell,et al.  Abstract types have existential type , 1988, TOPL.

[75]  Klaus R. Dittrich,et al.  Advances in Object-Oriented Database Systems , 1988, Lecture Notes in Computer Science.

[76]  Alan Dearle,et al.  On the construction of persistent programming environments , 1988 .

[77]  Mark Evered,et al.  Leibniz, a language to support - software engineering , 1985 .

[78]  Luca Cardelli The Functional Abstract Machine , 1983 .

[79]  簡聰富,et al.  物件導向軟體之架構(Object-Oriented Software Construction)探討 , 1989 .