Types and persistence in database programming languages

ABSTRACT

Traditionally, the interface between a programming language and a database has either been through a set of relatively low-level subroutine calls, or it has required some form of embedding of one language in another. Recently, the necessity of integrating database and programming language techniques has received some long-overdue recognition. In response, a number of attempts have been made to construct programming languages with completely integrated database management systems. These languages, which we term database programming languages, are the subject of this review. The design of these languages is still in its infancy, and the purpose of writing this review is to identify the areas in which further research is required. In particular, we focus on the problems of providing a uniform type system and mechanisms for data to persist. Of particular importance in solving these problems are issues of polymorphism, type inheritance, object identity, and the choice of structures to represent sets of similar values. Our conclusion is that there are areas of programming language research—modules, polymorphism, persistence, and inheritance—that must be developed and applied to achieve the goal of a useful and consistent database programming language. Other research areas of equal importance, such as implementation, transaction handling, and concurrency, are not examined here in any detail.

REFERENCES

• 1: Alfred V. Aho , Jeffrey D. Ullman, Universality of data retrieval languages, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.110-119, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567763]
• 2: AIT-KACI, H., AND NASR, R. 1985. Login: A logic programming language with built in inheritance. In Proceedings o{ the Appin Workshop on Data Types and Persistence, Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland.
• 3: ALBANO, A., CARDELLI, L., AND ORSINI, R. 1983. Galileo: A strongly typed, interactive conceptual language. Tech. Rep. Internal Technical Document Services, AT&T Bell Laboratories, Murray Hill, N.J.
• 4: Antonio Albano , Luca Cardelli , Renzo Orsini, GALILEO: a strongly-typed, interactive conceptual language, ACM Transactions on Database Systems (TODS), v.10 n.2, p.230-260, June 1985 [doi>10.1145/3857.3859]
• 5: A. Albano , G. Gheli , R. Orsini, The implementation of Galileo's persistent values, Data types and persistence, Springer-Verlag, London, 1988
• 6: ALBANO, A., OCCHIUTO, M. E., AND ORSINI, R. 1985c. Galileo Reference Manual, Vax/Unix version 1.0. Tech. Rep., Diparimento di informatica, Univ. di Pisa, Pisa, Italy.
• 7: ALBANO, A., GIANNOTTI, F., ORSINI, R., AND PEDRESCHI, D. 1985. The type system of Gallleo. In Proceedings o{ the Appin Workshop on Data Types and Persistence, Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 175-195.
• 8: AMBLE, T., BRATBERGSENGEN, K., AND RISNES, O. 1979. ASTRAL: A structured and unified approach to database design and manipulation. In Proceedings o{ the Database Architecture Con{erence (Venice, italy, June).
• 9: M. M. Astrahan , M. W. Blasgen , D. D. Chamberlin , K. P. Eswaran , J. N. Gray , P. P. Griffiths , W. F. King , R. A. Lorie , P. R. McJones , J. W. Mehl , G. R. Putzolu , I. L. Traiger , B. W. Wade , V. Watson, System R: relational approach to database management, ACM Transactions on Database Systems (TODS), v.1 n.2, p.97-137, June 1976 [doi>10.1145/320455.320457]
• 10: ATKINSON, M. P. 1978. Programming languages and databases. In The 4th International Conference on Very Large Data Bases, S. B. Yao, Ed. (Berlin, West Germany, Sept.). IEEE & ACM, New York, pp. 408-419.
• 11: Malcolm P. Atkinson , Ronald Morrison, Persistent First Class Procedures are Enough, Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science, p.223-240, December 13-15, 1984
• 12: ATKINSON, M. P., AND MORmSON, R. 1985a. First class persistent procedures. A CM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501-538.
• 13: M. P. Atkinson , R. Morrison, Types, bindings and parameters in a persistent environment, Data types and persistence, Springer-Verlag, London, 1988
• 14: ATKINSON, M. P., AND MORRISON, R. 1986. Towards an integrated persistent graphical programming language. In Proceedings o{ the 18th Hawaii International Con{erence on Systems Sciences, vol. 2 (Jan.). Western Periodicals, North Hollywood, Calif., pp. 842-854.
• 15: Malcolm Atkinson , Ken Chisholm , Paul Cockshott, PS-algol: an algol with a persistent heap, ACM SIGPLAN Notices, v.17 n.7, July 1982 [doi>10.1145/988376.988378]
• 16: ATKINSON, M. P., CHISHOLM, K. J., COCKSHOTT, W. P., AND MARSHALL., R. M. 1983a. Algorithms for a persistent heap. So{tw. Pract. Exper. 13, 7 (Mar.).
• 17: ATKINSON, M. P., BAILEY, P. J., CHISHOLM, K. J., COCKSHOTr, W. P., AND MORRISON, R. 1983b. An approach to persistent programming. Comput. J. 26, 4 (Nov.).
• 18: ATKINSON, M. P., BAILEY, P., COCKSHOTT, W. P., CHISHOLM, K. g., AND MORRISON, R. 1984. Progress with Persistent Programming. Cambridge University Press, Cambridge, England.
• 19: ATKINSON, M. P., MORRISON, R., AND PRATTEN, G. D. 1986. Designing a persistent information space architecture. In Proceedings, H. J. Kugler, Ed. IFIP, Dublin, Sept., pp. 115-119.
• 20: John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
• 21: BALZER, R. M. 1986. Living in the next generation operating system. In In{ormation Processing 86. Elsevier North-Holland, New York.
• 22: Francois Bancilhon , Raghu Ramakrishnan, An amateur's introduction to recursive query processing strategies, Proceedings of the 1986 ACM SIGMOD international conference on Management of data, p.16-52, May 28-30, 1986, Washington, D.C., United States
• 23: Martin Bever , Peter C. Lockemann, Database hosting in strongly-typed programming languages, ACM Transactions on Database Systems (TODS), v.10 n.1, p.107-126, March 1985 [doi>10.1145/3148.3327]
• 24: BORGIDA, A. 1983. Features of Languages for Conceptual Information System Development. Tech. Rep. Dept. of Computer Science, Hill Center, Rutgers Univ., New Brunswick, N.J.
• 25: BORGIDA, A. 1985a. Accommodating exceptions to type. In Proceedings o{ the Appin Workshop on Data Types and Persistence, Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 265-271.
• 26: BORGIDA, A. 1985b. Flexible data exceptions. In Proceedings of the 11th International Conference on Very Large Data Bases (Singapore, Aug.). VLDB Endowment, Saratoga, Calif.
• 27: Alexander Borgida, Language features for flexible handling of exceptions in information systems, ACM Transactions on Database Systems (TODS), v.10 n.4, p.565-603, Dec. 1985 [doi>10.1145/4879.4995]
• 28: BRACHMAN, R. J. 1978. A New Paradigm for Representing Knowledge. Tech. Rep. BBN 3605. Bolt, Beranek and Newman, Cambridge, Mass.
• 29: BRACHMAN, R. J. 1983. What IS-A is and isn't: An analysis of taxonomic links in semantic networks. Computer 16, 10 (Oct.), 30-35.
• 30: BRAGGER, R. P., DUDLER, A., REBSAMEN, J., AND ZEHNDER, C. A. 1983. Gambit: An Interactive Database Design Tool {or Data Structures, Integrity Constraints and Transactions. Institute Fur Informatik, Eidgenossiche Technische Hochschule, Zurich, pp. 65-95.
• 31: BROOIE, M., MYLOPOULOS, J., AND SCHMIDT, J. 1983. On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases, and Programming Languages. Springer-Verlag, Berlin.
• 32: BRUCE, K., AND WEGNER, P. 1987. An algebraic model of subtype and inheritance. In Proceedings of the Roscoff Workshop on Database Programruing Languages, Alta'fr--CRAI (Sept.). Available as a technical report from Computer and information Science Dept., Univ. of Pennsylvania, Philadelphia, Pa. or from Alta'/r, BP 105 Rocquencourt, 76153 LeChesnay Cedex, France.
• 33: BUNEMAN, O. P. 1985. Data Types for Data Base Programming. In Proceedings o{ the Appin Workshop on Data Types and Persistence, Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 285-298.
• 34: Peter Buneman , Malcolm Atkinson, Inheritance and persistence in database programming languages, ACM SIGMOD Record, v.15 n.2, p.4-15, June 1986
• 35: Peter Buneman , Atsushi Ohori, A domain theoretic approach to higher-order relations, Proceedings on International conference on database theory, p.91-104, December 1986, Rome, Italy
• 36: BUNEMAN, O. P., AND OHORI, A. 1987. Using powerdomains to generalize relational databases. Tech. Rep. Computer and Information Science Dept., Univ. of Pennsylvania, Philadelphia.
• 37: Peter Buneman , Robert E. Frankel , Rishiyur Nikhil, An implementation technique for database query languages, ACM Transactions on Database Systems (TODS), v.7 n.2, p.164-186, June 1982 [doi>10.1145/319702.319711]
• 38: BUNEMAN, O. P., HIRSCHBERG, J., AND ROOT, D. 1982. A CODASYL interface for Pascal and Ada. In Proceedings of the 2nd British National Conference on Databases (Bristol, England, July). British Computer Society, Bristol, England.
• 39: BURGE, W. H. 1977. Recursive Programming Techniques. Addison-Wesley, Reading, Mass.
• 40: Luca Cardelli, A semantics of multiple inheritance., Proc. of the international symposium on Semantics of data types, p.51-67, July 1984, Sophia-Antipolis, France
• 41: CARDELLI, L. 1984b. Amber. Tech. Rep. AT&T Bell Labs, Murray Hill, N.J.
• 42: CARDELLI, L., AND MACQUEEN, D. M. 1985. Persistence and type abstraction. In Proceedings of the Appin Workshop on Data Types and Persistence, Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 221-230.
• 43: Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
• 44: Michael J. Carey , David J. DeWitt , Joel E. Richardson , Eugene J. Shekita, Object and File Management in the EXODUS Extensible Database System, Proceedings of the 12th International Conference on Very Large Data Bases, p.91-100, August 25-28, 1986
• 45: CATTELL, R. G. G. 1983. Design and implementation of a relationship-entity-datum data model. Tech. Rep. CSL-83-4, Xerox Paid Alto Research Center, Paid Alto, Calif.
• 46: Peter Pin-Shan Chen, The entity-relationship model—toward a unified view of data, ACM Transactions on Database Systems (TODS), v.1 n.1, p.9-36, March 1976 [doi>10.1145/320434.320440]
• 47: CHUNG, K. L. 1984. Implementation of Taxis, Process Management and Enforcement of Semantic Integrity Constraints. Master's thesis, Dept. of Computing Science, Univ. of Toronto, Toronto, Canada.
• 48: W F. Clocksin , Christopher S. Mellish, Programming in Prolog (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1984
• 49: E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, v.13 n.6, p.377-387, June 1970 [doi>10.1145/362384.362685]
• 50: E. F. Codd, Extending the database relational model to capture more meaning, ACM Transactions on Database Systems (TODS), v.4 n.4, p.397-434, Dec. 1979 [doi>10.1145/320107.320109]
• 51: A. J. Cole , R. Morrison, An Introduction to Programming with S-ALGOL, Cambridge University Press, New York, NY, 1982
• 52: COPELAND, G. P., AND KHOSHAFIAN, S. N. 1987. Identity and versions for complex objects. In Proceedings of the Appin Workshop on Persistent Object Systems, Research Report 44. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Glasgow, Scotland, Aug., pp. 407-428.
• 53: George Copeland , David Maier, Making smalltalk a database system, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
• 54: Ole-Johan Dahl , Kristen Nygaard, SIMULA: an ALGOL-based simulation language, Communications of the ACM, v.9 n.9, p.671-678, Sept. 1966 [doi>10.1145/365813.365819]
• 55: J. Darlington , D. Turner , P. Henderson, Functional Programming and Its Applications: An Advanced Course, Cambridge University Press, New York, NY, 1982
• 56: DATE, C. J. 1981a. Referential integrity. In The 7th International Con{erence on Very Large Data Bases (Cannes, France). IEEE, New York, pp. 2-12.
• 57: C. J. Date, An introduction to database systems: vol. I (4th ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 58: C. J. Date, Introduction to Database Systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2002
• 59: DATE, C. J. 1983b. Database: A Primer. Addison- Wesley, Reading, Mass.
• 60: DEMERS, A., AND DONAHUE, J. 1979. Revised report on Russell. Tech. Rep. TR79-389. Dept. of Computer Science, Cornell Univ., Ithaca, N.Y.
• 61: DONAHUE, J., HAUSER, C., AND KENT, J. 1986. A client interface to an entity-relationship database system. Tech. Rep. CSL-86-4. Xerox Palo Alto Research Center, Palo Alto, Calif.
• 62: ECKHARDT, H., EDELMAN, J., KOCH, J., MALL, M., AND SCHMiDT, J. W. 1985. Draft report on the database programming language DBPL. DBPL- Memo 091-85. Fachbereich Informatik, Univ. of Frankfurt, Frankfurt, West Germany.
• 63: FAIRBAIRN, J. 1982. Ponder and its type system. Tech. Rep. 31, Computer Laboratory, Univ. of Cambridge, Cambridge, England.
• 64: FAIRBAIRN, J. 1985. A new type-checker for a functional language. In Proceedings o{ the Appin Workshop on Data Types and Persistence. Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 107- 123.
• 65: Herve Gallaire , Jack Minker, Logic and Data Bases, Perseus Publishing, 1978
• 66: Herve Gallaire , Jack Minker , Jean-Marie Nicolas, Logic and Databases: A Deductive Approach, ACM Computing Surveys (CSUR), v.16 n.2, p.153-185, June 1984 [doi>10.1145/356924.356929]
• 67: GOOUEN, A., AND MESEOUER, J. 1984. EQLOG: Equality, types and generic modules for logic programming. J. Logic Program. 1,179-209.
• 68: Adele Goldberg , David Robson, Smalltalk-80: the language and its implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
• 69: Ira P. Goldstein , Daniel G. Bobrow, Extending object oriented programming in Smalltalk, Proceedings of the 1980 ACM conference on LISP and functional programming, p.75-81, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802792]
• 70: GORDON, M. J., MILNER, A. J. R. G., AND WADS- WORTH, C. P. 1979. Edinburgh LCF. Lecture Notes in Computer Science, vol. 78, Springer- Verlag, New York.
• 71: Patrick A. V. Hall, Adding database management to Ada, ACM SIGMOD Record, v.13 n.3, p.13-17, April 1983 [doi>10.1145/984532.984533]
• 72: HAMMER, M., AND MCLEOD, D. 1980. On database management system architecture. In In{otech State o{ the Art Report on Database, M. Atkinson, Ed. Infotech, Maidenhead, England.
• 73: Michael Hammer , Dennis Mc Leod, Database description with SDM: a semantic database model, ACM Transactions on Database Systems (TODS), v.6 n.3, p.351-386, Sept. 1981 [doi>10.1145/319587.319588]
• 74: Peter Henderson , James H. Morris, Jr., A lazy evaluator, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.95-103, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811543]
• 75: HOROWITZ, E., AND KEMPER, A. 1983. AdaRel: A relational extension of Ada. Tech. Rep. TR-83- 218, Dept. of Computing Science, Univ. of Southern California, Los Angeles, Calif.
• 76: Jean D. Ichbiah , Bernd Krieg-Brueckner , Brian A. Wichmann , John G. P. Barnes , Olivier Roubine , Jean-Claude Heliard, Rationale for the design of the Ada programming language, ACM SIGPLAN Notices, v.14 n.6b, p.1-261, June 1979 [doi>10.1145/956653.956654]
• 77: Kenneth E. Iverson, Operators, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.2, p.161-176, Oct. 1979 [doi>10.1145/357073.357074]
• 78: JARKE, M., AND KOCH, J. 1982. A survey of query optimization in centralized database systems. Tech. Rep. CRIS 44, GBA 82-73 CR, Center for Research on Information Systems, New York Univ., New York, Nov.
• 79: Matthias Jarke , Jürgen Koch, Range nesting: a fast method to evaluate quantified queries, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
• 80: Matthias Jarke , Jurgen Koch, Query Optimization in Database Systems, ACM Computing Surveys (CSUR), v.16 n.2, p.111-152, June 1984 [doi>10.1145/356924.356928]
• 81: Matthias Jarke , Yannis Vassiliou, A framework for choosing a database query language, ACM Computing Surveys (CSUR), v.17 n.3, p.313-340, Sept. 1985 [doi>10.1145/5505.5506]
• 82: KAHN, G., MACQUEEN, D., AND PLOTKIN, G. EDS. Semantics o{ Data Types: International Symposiun~ Springer-Verlag, Berlin, 1984.
• 83: KAPLAN, H. 1983. High level interfaces for databases. Master's thesis, Dept. of Computing and information Science, Univ. of Pennsylvania, Philadelphia, Pa.
• 84: KENT, W. 1978. Data and Reality. North-Holland, Amsterdam.
• 85: William Kent, Limitations of record-based information models, ACM Transactions on Database Systems (TODS), v.4 n.1, p.107-131, March 1979 [doi>10.1145/320064.320070]
• 86: KERSTEN, M. L., AND WASSERMAN, A. I. 1981. The architecture of the plain data base handler. So{tw. Pract. Exper. 11, 175-186.
• 87: Setrag N. Khoshafian , George P. Copeland, Object identity, Conference proceedings on Object-oriented programming systems, languages and applications, p.406-416, September 29-October 02, 1986, Portland, Oregon, United States
• 88: KOCH, J., MALL, M., PUTFARKEN, P., REIMER, M., SCHMIDT, J. W., AND ZEHNDER, C. A. 1983. Modula/R report. Lilith version. Tech. Rep. Institute Fur Informatik, Eidgenossische Technische Hochschule, Zurich.
• 89: KRABLIN, G. L. 1985. Building flexible multilevel transactions in a distributed persistent environment. In Proceedings of the Appin Workshop on Data Types and Persistence, Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp, 83-105.
• 90: K. G. Kulkarni , M. P. Atkinson, Implementing an extended functional data model using PS-algol, Software—Practice & Experience, v.17 n.3, p.171-185, March 1987 [doi>10.1002/spe.4380170302]
• 91: KULKARNI, K. G., AND ATKINSON, M. P. 1985. EFDM: Extended Functional Data Model. Brit. Comput. J. 19, 1 (Jan.), 38-45.
• 92: B. W. Lampson , J. J. Horning , R. L. London , J. G. Mitchell , G. J. Popek, Report on the programming language Euclid, ACM SIGPLAN Notices, v.12 n.2, p.1-79, February 1977 [doi>10.1145/954666.971189]
• 93: Barbara Liskov, CLU Reference Manual, Springer-Verlag New York, Inc., Secaucus, NJ, 1983
• 94: LISKOV, B.: HERLIHY, M., JOHNSON, P., LEAVENS, G., SCHEIFLER, R., AND WEIHL, W. 1983. Preliminary ARGUS reference manual. Tech. Rep. Memo 39. Programming Methodology Group, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass., Oct.
• 95: MACQUEEN, D. M. 1985. Modules for standard ML. Polymorphism 2, 2. AT&T Bell Laboratories.
• 96: David Maier , Jacob Stein , Allen Otis , Alan Purdy, Development of an object-oriented DBMS, ACM SIGPLAN Notices, v.21 n.11, p.472-482, Nov. 1986
• 97: MALL, M., SCHMIDT, J. W., AND REIMER, M. 1984. Data selection, sharing, and access control in a rela'tional scenario. In On Conceptual ModeUing, M. L. Brodie, J, L. Mylopoulos, and J. W. Schmidt, Eds. Springer-Verlag, Berlin.
• 98: MATTHEWS, C. J. 1985a. Poly manual. Tech. Rep. 63, Computer Laboratory, Univ. of Cambridge, Cambridge, England.
• 99: MATTHEWS, D. C. J. 1985b. Overview of the poly programming language. In Proceedings o{ the Appin Workshop on Data Types and Persistence. Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 255-263.
• 100: John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
• 101: MERRETT, T. H. 1977. Relations as programming language elements. Inf. Process. Lett. 6, 1 (Feb.), 29-33.
• 102: T. H. Merrett, Extending the relational algebra to capture less meaning, ACM SIGMOD Record, v.14 n.3, p.55-68, November 1984 [doi>10.1145/984549.984552]
• 103: T H Merrett, Relational Information Systems, Reston Publishing Co., Reston, VA, 1984
• 104: MERRETT, T. H. 1985a. First Steps to Algebraic Processing of Text. Academic Press, Orlando, Fla.
• 105: MERRETT, T. H. 1985b. Persistence and Aldat. in Proceedings of the Appin Workshop on Data Types and Persistence. Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, Aug., pp. 35-48.
• 106: MERRETT, T. H., AND D0CHTING, B. 1984. Relational storage and processing of two dimensional diagrams. Comput. Graplr 9, 3.
• 107: MICHIE, D. 1968. "Memo" functions and machine learning. Nature, 218 (Apr.), 19-22.
• 108: MILLER, D. 1986. A theory of modules for logic programming. In Proceedings o{ the 1986 IEEE Symposium on Logic Programming (Salt Lake City, Utah). IEEE, New York.
• 109: MILNER, R. 1978. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17, 348-375.
• 110: Robin Milner, Flowgraphs and Flow Algebras, Journal of the ACM (JACM), v.26 n.4, p.794-818, Oct. 1979 [doi>10.1145/322154.322167]
• 111: MILNER, R. 1983. A proposal for standard ML. Polymorphism 1, 3 (Dec.).
• 112: Robin Milner, A proposal for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.184-197, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802035]
• 113: MORISON, R. 1979. S-Algol Language Reference Manual. Tech. Rep. CS/79/1, Dept. of Computational Science, Univ. of St. Andrews, St. Andrews, Scotland.
• 114: Ronald Morrison , Alan Dearle , Peter J. Bailey , Alfred L. Brown , Malcolm P. Atkinson, The persistent store as an enabling technology for integrated project support environments, Proceedings of the 8th international conference on Software engineering, p.166-172, August 28-30, 1985, London, England
• 115: R Morrison , A L Brown , P J Bailey , A J T Davie , A Dearle, A persistent graphics facility for the ICL PERQ, Software—Practice & Experience, v.16 n.4, p.351-367, April. 1986 [doi>10.1002/spe.4380160405]
• 116: MYCROFT, A. 1984. An inferential type system for Prolog. Tech. Rep., Computer Science Dept., Univ. of Edinburgh, Edinburgh, Scotland.
• 117: MYLOPOULOS, J., AND WONO, H. K. T. 1980. Some features of the Taxis data model. In The 6th International Conference on Very Large Data Bases (Montreal, Canada, Oct. 1-3). ACM, New York.
• 118: John Mylopoulos , Philip A. Bernstein , Harry K. T. Wong, A language facility for designing database-intensive applications, ACM Transactions on Database Systems (TODS), v.5 n.2, p.185-207, June 1980 [doi>10.1145/320141.320150]
• 119: NIKHIL, R. 1982. RDB--A relational database management system, User Manual. Tech. Rep., Dept. of Computer Science and information Science, Univ. of Pennsylvania, Philadelphia.
• 120: NIKHIL, R. 1984. An incremental, strongly typed applicative programming system for databases. Ph.D. dissertation, Dept. of Computing and Information Science, School of Engineering and Applied Science, Univ. of Pennsylvania, Philadelphia.
• 121: NIXON, B. 1983. A Taxis compiler. Master's thesis, Dept. of Computing Science, Univ. of Toronto, Toronto, Ont., Canada.
• 122: NIXON, B., ED. 1984. Taxis '84: Selected papers. Tech. Rep. TR CSRG-160, Computer Science Research Group, Univ. of Toronto, Toronto, Ont., Canada.
• 123: O'BRIEN, P. 1983. An integrated interactive design environment for Taxis. In Proceedings o{ the 1983 So{t{air Con{erence (July). Softfair, Washington, D.C.
• 124: Patrick O'Brien , Bruce Bullis , Craig Schaffert, Persistent and shared objects in Trellis/Owl, Proceedings on the 1986 international workshop on Object-oriented database systems, p.113-123, September 23-26, 1986, Pacific Grove, California, United States
• 125: OHORI, A. 1987. Orderings and types in databases. In Proceedings o{ the Roscoff Workshop on Database Programming Languages, Altai~--CRAI. Available as a technical report from Computer and Information Science Dept., Univ. of Pennsylvania, Philadelphia, Pa. 19104 or from Altair, BP 105 Rocquencourt, 76153 LeChesnay Cedex, France.
• 126: T. William Olle, The Codasyl Approach to Data Base Management, John Wiley & Sons, Inc., New York, NY, 1978
• 127: ONTOLOOIC, INC. 1986. Vbase Object Manager User Manual. Bilerica, Mass.
• 128: OWOSO, G. O. 1984. Data description and manipulation in persistent programming languages. Ph.D. dissertation. Univ. of Edinburgh, Computer Science Dept., Edinburgh, Scotland.
• 129: OWOSO, G. O. 1985. Flexible data handling in programming languages. In Proceedings o{ the Appin Workshop on Data Types and Persistence. Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland.
• 130: PERSISTENT PROGRAMMING RE8EARCH GROUP 1985. The PS-Algol Reference Manual. 2d ed. Tech. Rep. PPR-12-85. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland.
• 131: PIROTTE, A., AND LACROIX, M. 1980. User interfaces for database application programming. In Infotech State o{ the Art Con{erence on Databases. Infotech, London, England.
• 132: RICHARD, P., AND VELEZ, F. 1987. An object-oriented formal data model. In Proceedings o{ the Roscof{ Workshop on Database Programming Languages, Altair--CRAI. Sept. Available as a technical report from Computer and Information Science Dept., Univ. of Pennsylvania, Philadelphia, Pa. 19104, or from Altair, BP 105 Rocquencourt, 76153 LeChesnay Cedex, France.
• 133: Arnon Rosenthal , Sandra Heiler , Umeshwar Dayal , Frank Manola, Traversal recursion: a practical approach to supporting recursive applications, Proceedings of the 1986 ACM SIGMOD international conference on Management of data, p.166-176, May 28-30, 1986, Washington, D.C., United States
• 134: ROWE, L. 1985. Windows on relations. In Proceedings of the 11th International Con{erence on Very Large Data Bases (Singapore, Aug.). J. Bubenko, Ed., VLDB Endowment, Saratoga, Calif.
• 135: Lawrence A. Rowe , Kurt A. Shoens, Data abstraction, views and updates in RIGEL, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582107]
• 136: SAMET, P. A., ED. 1981. Query Languages: A Unified Approach. Monographs in Informatics. Heyden & Sons, London, England.
• 137: Joachim W. Schmidt, Some high level language constructs for data of type relation, ACM Transactions on Database Systems (TODS), v.2 n.3, p.247-261, Sept. 1977 [doi>10.1145/320557.320568]
• 138: Joachim William Schmidt , M. L. Brodie, Relational Database Systems: Analysis and Comparison, Springer-Verlag New York, Inc., Secaucus, NJ, 1983
• 139: SCHMIDT, J. W., AND MALL, M. 1983. Abstraction mechanisms for database programming. SIG- PLAN Not. (ACM) 18, 6 (June).
• 140: David W. Shipman, The functional data model and the data languages DAPLEX, ACM Transactions on Database Systems (TODS), v.6 n.1, p.140-173, March 1981 [doi>10.1145/319540.319561]
• 141: Jonathan E. Shopiro, Theseus—a programming language for relational databeses, ACM Transactions on Database Systems (TODS), v.4 n.4, p.493-517, Dec. 1979 [doi>10.1145/320107.320121]
• 142: Andrea H. Skarra , Stanley B. Zdonik, The management of changing types in an object-oriented database, Conference proceedings on Object-oriented programming systems, languages and applications, p.483-495, September 29-October 02, 1986, Portland, Oregon, United States
• 143: John Miles Smith , Diane C. P. Smith, Database abstractions: aggregation and generalization, ACM Transactions on Database Systems (TODS), v.2 n.2, p.105-133, June 1977 [doi>10.1145/320544.320546]
• 144: SMITH, J. M., FOX, S., AND LANDERS, T. 1983. ADAPLEX: Rationale and Reference Manual 2d ed. Computer Corporation Of America, Cambridge, Mass.
• 145: Michael Stonebraker , Lawrence A. Rowe, The design of POSTGRES, Proceedings of the 1986 ACM SIGMOD international conference on Management of data, p.340-355, May 28-30, 1986, Washington, D.C., United States
• 146: Michael Stonebraker , Gerald Held , Eugene Wong , Peter Kreps, The design and implementation of INGRES, ACM Transactions on Database Systems (TODS), v.1 n.3, p.189-222, Sept. 1976 [doi>10.1145/320473.320476]
• 147: Bjarne Stroustrup, The C++ programming language, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 148: Daniel C. Swinehart , Polle T. Zellweger , Richard J. Beach , Robert B. Hagmann, A structural view of the Cedar programming environment, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.4, p.419-490, Oct. 1986 [doi>10.1145/6465.6466]
• 149: TEITELMAN, W. 1975. INTERSLIP reference manual. Tech. Rep., Xerox Paid Alto Research Center, Paid Alto, Calif.
• 150: TSICHRITZIS, D. C., AND LOCHOVSKY, F. H. 1977. Data Base Management Systems. Academic Press, New York.
• 151: D. A. Turner, The semantic elegance of applicative languages, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.85-92, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806766]
• 152: D. A. Turner, Miranda: a non-strict functional language with polymorphic types, Proc. of a conference on Functional programming languages and computer architecture, p.1-16, January 1985, Nancy, France
• 153: D Turner, An overview of Miranda, ACM SIGPLAN Notices, v.21 n.12, p.158-166, Dec. 1986 [doi>10.1145/15042.15053]
• 154: Jeffrey D. Ullman, Principles of Database Systems, W. H. Freeman & Co., New York, NY, 1983
• 155: VAN WIJNGAARDEN, A., MAiLLOUX, B. J., PECK, J. E. L., COSTER, C. H. A., SINTZOFF, M., LiNDSEY, C. H., MEERTENS, L. G. L. T., AND FISKER, R. G. 1969. Report on the algorithmic language Algol 68. Numer. Math. 14, 79-218.
• 156: WASSERMAN, A. I. 1978. Design goals for PLAIN. In Proceedings of the 11th Hawaii International Conference on Systems Sciences, Western Periodicals, No. Hollywood, Calif., pp. 25-30.
• 157: WASSERMAN, A. I., AND BOOSTER, T. W. 1981. String handling and pattern matching in PLAIN. Tech. Rep. 50, Laboratory of Medical Information Science, Univ. of California, San Francisco, Calif.
• 158: WASSERMAN, A. I., SHERTZ, D. D., KERSTEN, M. L., REIT, R. P., AND VAN DE DIPPE, M. D. 1981. Revised report on the programming language PLAIN. SIGPLAN Not. (ACM).
• 159: William Weihl , Barbara Liskov, Implementation of resilient, atomic data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.2, p.244-269, April 1985 [doi>10.1145/3318.3319]
• 160: WIHEL, W. E. 1985b. Linguistic support for atomic data types. In Proceedings of the Appin Workshop on Data Types and Persistence. Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 145-173.
• 161: WIRTH, N. 1971. The programming language PAS- CAL. Acta Inf. 1.
• 162: Niklaus Wirth, Programming in MODULA-2 (3rd corrected ed.), Springer-Verlag New York, Inc., New York, NY, 1985
• 163: ZDONXK, S. B., AND WEGNER, P. 1985. A database approach to languages, libraries and environments. In Proceedings of the Appin Workshop on Data Types and Persistence. Research Report 16. M. P. Atkinson, O. P. Buneman, and R. Morrison, Eds. Persistent Programming Research Group, Dept. of Computing Science, Univ. of Glasgow, Glasgow, Scotland, pp. 145-173.

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications
          Subjects: Specialized application languages

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

  H. Information Systems
  H.2 DATABASE MANAGEMENT

General Terms:
Design, Languages