Matthews, D. C. J.: "Poly Manual". ACM SIGPLAN Notices 20(9), pp. 52 -- 76, September 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The first language to provide orthogonal persistence, PSAlgol [5] was conceived in order to add persistence to an existing language with minimal perturbation of its initial semantics and implementation. There are persistent versions of functional programming languages, such as Persistent Poly [6] and Poly ML [7] There has also been research done on adding orthogonal persistence to widely used pro Page 2 gramming languages. Probably the most interesting project at the moment is PJava [8] a project that aims at providing orthogonal persistence to the Java [9] programming language. As ....

Matthews, D. C. J.: "Poly Manual". ACM SIGPLAN Notices 20(9), pp. 52 -- 76, September 1985.

....future work in Section 7. 2R ELATED WORK Most research investigating the use of garbage collection in ODBMSs has not been explicitly directed at partitioned garbage collection algorithms. Although some of the proposed algorithms do act incrementally on subsets of the database [4] 6] 21] [23], the partitioning aspects of those algorithms have been treated secondarily at best. Techniques for garbage collection may be classified by whether the algorithm relocates objects during execution. Fig. 2. Example of a partitioned object database. 156 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ....

....error recovery when a crash occurs during collection. Their collector performs garbage collection across multiple databases, allowing the collection of only one database at a time, if desired. Matthews describes a mark and sweep garbage collector for a persistent version of ML called Poly [23]. The collector performs a complete reachability analysis, but at the granularity of a page. The analysis is neither depth first nor breadth first. Rather, it can be said to be page first, since all intrapage object references are followed before any interpage object references are considered. The ....

D.C.J. Matthews, "Poly Manual," SIGPLAN Notices, vol. 20, no. 9, Sept. 1985.

....it should be possible to have applicative, relational, logic, object, query and imperative persistent languages. Some known persistent languages are: DBPL [MS89] relational . PS algol [PS88] imperative . Leibniz [Eve85] object . E [RC89] almost object (C ) Galileo [ACO85] object . Poly [Mat85] applicative . Staple [DM90] applicative . Amber [Car85] applicative . Persistent Prolog [GMD85] logic . c [HS89] capability . Napier88 [MBC89] imperative 1.2.4.1 PS algol and Napier88 Two examples of orthogonally persistent languages are PS algol [PS88] and Napier88 [MBC89] In both languages, ....

....With ad hoc polymorphism there is a requirement for operations with different semantic meanings to be executed according to the type of the operands, which may be abstracted over in some systems. 17 A number of solutions to these problems have been proposed and successfully implemented [Mil83, Lis81, DD79, Mat85, BMS80, Fai82, Tur87, WB89]. All of these implementations however have been in non persistent languages, and for various reasons are not well suited to the implementation of polymorphism in a persistent programming system. Two new mechanisms for the implementation of polymorphism are described here. One of these solves the ....

[Article contains additional citation context not shown here]

D.C.J. Matthews "Poly Manual" University of Cambridge Technical Report 65 ( 1985 )

....and written out at the end. Opening a database is similar to reading in the workspace and commit to writing it out again. The difference is that the cost of reading a persistent database is dependent on the amount of data used and not the overall size of the database. 3 Poly and Standard ML Poly[8] and Standard ML[9] are general purpose programming language supporting polymorphic operations. They are both statically type checked and statically scoped and treat closures as first class objects. Their type systems are different but the underlying abstract machines are sufficiently similar for ....

Matthews D.C.J. "Poly Manual" SIGPLAN Notices. Vol.20 No.9 Sept. 1985.

....and written out at the end. Opening a database is similar to reading in the workspace and commit to writing it out again. The difference is that the cost of reading a persistent database is dependent on the amount of data used and not the overall size of the database. 3 Poly and Standard ML Poly[Mat85] and Standard ML[Mil84] are general purpose programming language supporting polymorphic operations. They are both statically type checked and statically scoped and treat closures as first class objects. Their type systems are different but the underlying abstract machines are sufficiently similar ....

Matthews D.C.J. "Poly Manual" SIGPLAN Notices. Vol.20 No.9 Sept. 1985.

....components to be stored in a database. PS Algol has been used to implement a variety of applications including compilers, relational databases and a commercial process modelling tool [39] Orthogonal persistence is supported by a few other languages and environments. Persistent Poly and Poly ML [33,34] are persistent implementations of functional programming languages. Napier88 [37] is a statically type checked procedural language that supports first class functions, abstract types and dynamic binding. Galileo [3] and DBPL [40] are examples of database programming languages that fall within ....

D.C.J. Matthews, "Poly Manual", ACMSIGPLANNotices Vol 20 No 9, September 1985.

....in its own variant of ML by Kevin Mitchell and Alan Mycroft at Edinburgh, and this compiler was also modified with the help of Robert Harper to make it conform fairly closely to the Standard ML definition. A new compiler was developed in Cambridge by David Matthews, using his Poly language [8, 9] as the implementation language, and sharing the Poly back end. At INRIA, a group headed by Gerard Huet and Guy Cousineau have been implementing an ML variant called CAML[10] that is intermediate between the LCF version and Standard ML. Yet there was still justification for another Standard ML ....

David C. J. Matthews, "The Poly manual," SIGPLAN Notices, September 1985.

....possible to model all of the activities required for a body of data within a single system. 1. 3 Persistence as a Platform A number of persistent programming systems have been proposed, including PS algol [ACC82] Amber [Car85] Galileo [ACO85] Leibniz [Eve85] Persistent Prolog [GMD85] Poly [Mat85], DBPL [MS89] E [RC90] c [HS90] Napier88 [MBC 89] and STAPLE [DM90] To various extents these systems provide the benefits described earlier. The work presented in this thesis attempts to advance the technology by taking the basic persistent system as given and using it as a platform on which ....

Matthews, D.C.J. "Poly Manual". University of Cambridge Technical Report 65 (1985).

.... However, some dynamic projection out of unions for types any and env [Dea89] as well as variant selection, allows the dynamic binding required for orthogonal persistence [ABC 83] and system evolution [MCC 93] The type system is polymorphic, like ML [Mil78, MTH89] Russell [DD79] and Poly [Mat85] and uses the existentially quantified types of Mitchell Plotkin [MP88, CMM91] for abstract data types. There is deliberately no type inference, to allow for explicit specialisation of polymorphic forms from the persistent store. A unique design feature of the implementation of the typed objects ....

Matthews, D.C.J. "Poly Manual". University of Cambridge (1985).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC