Skip to main content
SpringerLink
Log in

Bulk types for large scale programming

  • Types For Databases
  • Conference paper
  • First Online:
Book cover Next Generation Information System Technology (EWDW 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 504))

Included in the following conference series:

Abstract

Work on the design of constructors for bulk data types is reported. It introduces highly parametric constructors, parameterised both by types and by properties other than types. Such constructors we call type-quarks. The motivation for and properties of bulk types are discussed. The two examples of bulk types provided via type-quarks, maps and quads, are discussed. Several important questions about this approach to bulk types are identified.

Altaïr is a consortium funded by IN2 (a Siemens subsidiary), BULL, INRIA (the French National Institute in Computer and Control) and LRI (the Computer Science Research Laboratory of the University of Paris XI)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.P. Atkinson and O.P. Buneman. Types and persistence in database programming languages. ACM Surveys, 19(2):105–190, June 1987.

    Google Scholar 

  2. A. Albano, L. Cardelli, and R. Orsini. Galileo: A Strongly Typed, Interactive Conceptual Language. ACM TODS, 10(2):230–260, 1985.

    Google Scholar 

  3. S. Abiteboul and R. Hull. IFO: A Formal Semantic Database Model. ACM TODS, 12(4):525–565, December 1987.

    Google Scholar 

  4. M.P. Atkinson, C Lécluse, and P. Richard. Maps as a Type-quark. Technical Report 2, FIDE project, U. of Glasgow, Dpt. of Computing Science, Glasgow G12 8QQ, Scotland, 1990.

    Google Scholar 

  5. M.P. Atkinson and R. Morrison. Types, bindings and parameters in a persistent environment. In M.P. Atkinson, O.P. Buneman, and R. Morrison, ed., Data Types and Persistence, pages 3–20, Springer-Verlag, Berlin, 1988.

    Google Scholar 

  6. M.P. Atkinson and R. Morrison. Polymorphic names and iterations. In F. Bancilhon and O.P. Buneman, ed., Advances in Database Programming Languages, pages 241–256, ACM Press, 1990.

    Google Scholar 

  7. S. Berman. Persistent Sets and their implementation in P-Pascal. Technical Report CS-90-03-00, U. of Cape Town, 7700 Rondebosch, South Africa, December 1990.

    Google Scholar 

  8. P. Buneman, R.E. Frankel, and R. Nikhil. An Implementation Technique for Database Query Languages. ACM TODS, 7(2):164–187, June 1981.

    Google Scholar 

  9. M. Barr and C. Wells. Toposes, Triples and Theories. Springer-Verlag, 1985.

    Google Scholar 

  10. L. Cardelli. Amber. Technical Memorandum TM 11271-840924-10, AT&T Bell Laboratories, Murray Hill, New Jersey, U.S.A., 1984.

    Google Scholar 

  11. L. Cardelli. Structural Subtyping and the Notion of Power Types. In Proc. of the Fifteenth ACM Symposium on Principles of Programming Languages (San Diego, CA, January 1988), 1988.

    Google Scholar 

  12. L. Cardelli. Typeful Programming. Technical Report Digital Systems Research Center Report 45, Digital Eqipment Corp., Systems Research Centre, 140 Lytton Avenue, Palo Alto, Calif., USA, 1989.

    Google Scholar 

  13. L. Cardelli, J.E. Donahue, M. Jordan, Kalsow. W., and G. Nelson. Modula-3 Report. Technical Report, Olivetti, Palo Alto Research Center, June 1988.

    Google Scholar 

  14. D.K.C. Chan. Query Languages for OODBMs. First Year Report, Computing Science Dpt., Glasgow U., Glasgow G12 8QQ, Scotland, October 1989.

    Google Scholar 

  15. E.F. Codd. A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, 13(6):377–387, June 1970.

    Google Scholar 

  16. J. Darlington. A Synthesis of Several Sorting Programs. Acta Informatica, 11(1):1–30, January 1978.

    Google Scholar 

  17. C.J. Date. An Introduction to Database Systems. Addison-Wesley Publishing Company, fourth edition, 1985.

    Google Scholar 

  18. O. O. Deux. The Story of O 2. IEE Trans. on Knowledge and Data Engineering, 2(1), March 1990.

    Google Scholar 

  19. O. Dahl and K. Nygaard. Simula, an Algol-Based Simulation Language. Communications of the ACM, 9(9):671–678, September 1966.

    Google Scholar 

  20. J.G. Hughes and M. Connolly. A Portable Implementation of a Modular Multiprocessing Database Programming Language. Software Practice and Experience, 1987.

    Google Scholar 

  21. M. Hammer and D. McLeod. Database Description with SDM: A Semantic Database Model. ACM TODS, 6(3):351–386, September 1981.

    Google Scholar 

  22. R. Hull and J. Su. On Bulk Data Type Constructors and Manipulation Primitives: A Framework for Analyzing Expressive Power and Complexity. In R. Hull, R. Morrison, and D. Stemple, ed., Proc. of the Second International Workshop on DBPL, pages 396–410, Morgan Kaufmann, San Mateo, California, 1989.

    Google Scholar 

  23. P. Hudak and P.L. Wadler(Eds). Report on the Functional Programming Language Haskell. Technical Report, Dept. of Computing Science, U. of Glasgow, Glasgow, G12 8QQ, Scotland, April 1989.

    Google Scholar 

  24. J. Koch, M. Mall, P. Putfarken, M. Reimer, J.W. Schmidt, and C.A. Zehnder. Modula/R Report, Lilith Version. Technical Report, Institute für Informatik, Eidgenossische Technische Hochschule Zurich, 1983.

    Google Scholar 

  25. J.L. Keedy and J. Rosenberg. Data Engineering with Sets and Sequences. In Proc. of the third Australian Software Engineering Conference, pages 79–100, 1988.

    Google Scholar 

  26. F. Matthes and J.W. Schmidt. The Type system of DBPL. In R. Hull, R. Morrison, and D. Stemple, ed., Proc. of the Second International Workshop on DBPL (Oregon, June 1989), pages 219–225, Morgan Kaufmann Publishers, San Mateo, Calif., USA, 1989.

    Google Scholar 

  27. A. Ohori, O.P. Buneman, and V. Breazu-Tannen. Database Programming in Machiavelli — a Polymorphic Language with Static Type Inference. In Proc. of the ACM SIGMOD 1989 Conference on the Management of Data (Portland, Oregon, May-June), pages 424–433, 1989.

    Google Scholar 

  28. P. Philbrow. Indexing Strongly Typed Heterogeneous Collections using Reflection and Persistence. In Informal Proc. of the 1990 ECOOP/OOPSLA Workshop on Reflection and Metalevel Architectures in Object-Oriented Programming (22nd October 1990, Ottawa, Canada), 1990.

    Google Scholar 

  29. L. Rowe and K. Shoens. Data abstraction, views and updates in RIGEL. In Proc. of the ACM SIGMOD 1979 Conference on the Management of Data, pages 71–81, May 1979.

    Google Scholar 

  30. J.W. Schmidt. Some High Level Language Constructs for Data of Type Relation. ACM TODS, 2(3):247–261, September 1977.

    Google Scholar 

  31. J.W. Schmidt, H. Eckhardt, and F. Matthes. DBPL Report. Technical Report DBPL-memo 111-88, Fachbereich Informatik, Johann Wolfgang Goethe-Universität, Frankfurt, West Germany, 1988.

    Google Scholar 

  32. J.M. Smith, S. Fox, and T. Landers. ADAPLEX: Rationale and Reference Manual. Four Cambridge Center, Cambridge, Massachusetts 02142, second edition, May 1983.

    Google Scholar 

  33. T. Sheard. A user's guide to TRPL: a Compile-time Reflective Programming Language. Technical Report COINS Technical Report 90–109, Dpt. of Computer and Information Science, U. of Massachusetts, Amherst, Ma 01002, USA, September 1990.

    Google Scholar 

  34. T. Sheard. Automatic Generation and use of Abstract Structure Operators. Technical Report, Dept. of Mathematics and Computer Science, Amherst College, Amherst, Ma 01002, USA, September 1990. expected to appear in TOPLAS.

    Google Scholar 

  35. D.W. Shipman. The Functional Data Model and the Data Language DAPLEX. ACM TODS, 6(1):140–173, March 1981.

    Google Scholar 

  36. D. Stemple. A Recursive Base for Database Programming Primitives. In J.W. Schmidt, editor, Proc. of the Workshop on Information Systems of the Nineties, Springer-Verlag, Berlin, Germany, 1990.

    Google Scholar 

  37. I. Tabkha. Extending the Persistent Programming Language Napier88 with Bulk Library Types. First year Report, U. of Glasgow, Dpt. of Computing Science, Glasgow G12 8QQ, Scotland, September 1990.

    Google Scholar 

  38. P.W. Trinder, D.K.C. Chan, and Harper D.J. Improving Comprehension Queries in PS-algol. In R.L. Cooper, A. Stewart, and P.W. Trinder, ed., Proc. of the 1990 Glasgow Database Workshop, pages 103–120, Dpt. of Computing Science, U. of Glasgow, Glasgow G12 8QQ, Scotland, March 1990.

    Google Scholar 

  39. P.W. Trinder. A Functional Database. PhD thesis, Oxford U., Oxford, England, December 1989. Also available from Dpt. of Computing Science, U. of Glasgow, Glasgow G12 8QQ, Scotland.

    Google Scholar 

  40. P.W. Trinder. Comprehensions a Query Notation for DBPLs. In R.L. Cooper, A. Stewart, and P.W. Trinder, ed., Proc. of the 1990 Glasgow Database Workshop, Glasgow, Scotland, pages 95–102, Glasgow G12 8QQ, Scotland, March 1990.

    Google Scholar 

  41. D. Turner. An Overview of Miranda. ACM SIGPLAN Notices, 21(12):158–166, December 1986.

    Google Scholar 

  42. P.W. Trinder and P.L. Wadler. Improving List Comprehension Database Queries. In, editor, Proc. of TENCON '89, Bombay, India, pages 186–192, November 1989.

    Google Scholar 

  43. P.W. Trinder and P.L. Wadler. List comprehensions and the relational calculus. In C.V. Hall, editor, Proc. of the Glasgow Workshop on Functional Programming, pages 187–202, Dpt. of Computing Science, U. of Glasgow, Glasgow G12 8QQ, 1989.

    Google Scholar 

  44. J.D. Ullman. Principles of Database Systems. Pittman, second edition, 1982.

    Google Scholar 

  45. P.L. Wadler. List Comprehensions. In S.L. Peyton-Jones, editor, The Implementation of Functional Programming Languages, pages 127–128, Prentice Hall International, Hemel Hemstead, UK, 1987.

    Google Scholar 

  46. P.L. Wadler. Comprehending monads. In Proc. of the ACM Conference on Lisp and Functional Programming, pages 61–78, Nice, France, June 1990.

    Google Scholar 

  47. N. Wirth. From Modula to Oberon. Software Practice and Experience, 18(7):661–670, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GIP Altaïr, INRIA, BP105, 78153, Le Chesnay, France

    Malcolm Atkinson & Philippe Richard

  2. Dept. of Computing Science, University of Glasgow, G12 8QQ, Glasgow, Scotland

    Malcolm Atkinson & Phil Trinder

Authors
  1. Malcolm Atkinson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Richard
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Phil Trinder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joachim W. Schmidt Anatoly A. Stogny

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Atkinson, M., Richard, P., Trinder, P. (1991). Bulk types for large scale programming. In: Schmidt, J.W., Stogny, A.A. (eds) Next Generation Information System Technology. EWDW 1990. Lecture Notes in Computer Science, vol 504. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54141-1_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-54141-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54141-7

  • Online ISBN: 978-3-540-47444-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation