skip to main content
article
Free Access

Theseus—a programming language for relational databeses

Published:01 December 1979Publication History
Skip Abstract Section

Abstract

Theseus, a very high-level programming language extending EUCLID, is described. Data objects in Theseus include relations and a-sets, a generalization of records. The primary design goals of Theseus are to facilitate the writing of well-structured programs for database applications and to serve as a vehicle for research in automatic program optimization.

References

  1. 1 AHO, A.V., AND ULLMAN, J.D. Universality of data retrieval languages. Conf. Rec. Sixth Annual ACM Symp. on Principles of Programming Languages, San Antonio, Tex., Jan. 1979, pp. 110-117. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 ALLEN, F.E. Program optimization. In Annual Review in Automatic Programming, Vol. 5, Pergamon Press, New York, 1969, pp. 239-307.Google ScholarGoogle Scholar
  3. 3 ASTRAHAN, M.M., ET AL. System R: Relational approach to database management. ACM Trans. Database Syst. 1, 2 (June 1976), 97-137. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 BIRTWISTLE, G.M. Simula BEGIN, Auerbach, Philadelphia, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 BRINCH HANSEN, P. The programming language Concurrent Pascal. IEEE Trans. on Software Eng. SE-1, 2 (June 1975), 199-207.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 BROWN, P.J. Macro Processors. Wiley-Interscience, New York, 1974.Google ScholarGoogle Scholar
  7. 7 CHAMBERLIN, D.E., ET AL. SEQUEL 2: A unified approach to data definition, manipulation, and control. IBM J. Res. Develop. 20, 6 (Nov. 1976), 560-575.Google ScholarGoogle Scholar
  8. 8 CObb, E.F. A relational model of data for large shared data banks. Comm. ACM 13, 6 (June 1970), 377-387. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 CODD, E.F. Further normalization of the data base relational model. In Courant Computer Sciences Symposia, Vol. 6, Data Base Systems, Prentice-Hall, Englewood Cliffs, N.J., May 1971, pp. 33-64.Google ScholarGoogle Scholar
  10. 10 CODD, E.F. Relational completeness of data base sublanguages, in Courant Computer Sciences Symposia, Vol. 6, Data Base Systems, Prentice-Hall, Englewood Cliffs, N.J., May 1971, pp. 65-98.Google ScholarGoogle Scholar
  11. 11 DAHL, O.-J., DIJKSTRA, E.W., A~D HOARE, C.A.R. Structured Programming. Academic Press, London and New York, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 DATE, C.J. An Introduction to Database Systems, 2nd ed., Addison-Wesley, Reading, Mass., 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 DEMERS, A., DONAHUE, J., AND SKINNER, G. Data types as values: Polymorphism, type-checking, encapsulation. Conf. Rec. Fifth Annual ACM Syrup. on Principles of Programming Languages, Tucson, Ariz., 1977, pp. 23-30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 EARLEY, J. Relational level data structures for programming languages. Acta Informatica 2 (1973), 293-309.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 EARLEY, J. High level operations in automatic programming. SIGPLAN Notices (ACM) 9, 4 (April 1974), 34-42. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 ESWARAN, K.P., ET AL. The notions of consistency and predicate locks in a database system. Comm. ACM 19, 11 (Nov. 1976), 624-633. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 FELDMAN, J.A. High level programming for distributed computing. Comm. ACM 22, 6 (June 1979), 353-368. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 FELDMAN, J.A., v.V AL. Recent developments in SAIL--an ALGOL-based language for artificial intelligence. Proc. FJCC, AFIPS Press, Montvale, N.J., pp. 1193-1201.Google ScholarGoogle Scholar
  19. 19 FELDMAN, J.A., AND ROVNER, P.D. An Algol-based associative language. Comm. ACM 12, 8 (Aug. 1969), 439-449. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 FELDMAN, J.A., AND WILLIAMS, G.J. Some remarks on data types. TR 28, Comptr. Sci. Dept., U. of Rochester, Rochester, N.Y., 1978.Google ScholarGoogle Scholar
  21. 21 GRIFFITHS, P.P., AND WADE, B.W. An authorization mechanism for a relational database system. ACM Trans. Database Syst. i, 3 (Sept. 1976), 242-255. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 GRISWOLD, R.E., POAGE, J.F., AND POLONSKY, I.P. The SNOBOL4 Programming Language, 2nd ed., Prentice-Hall, Englewood Cliffs, N.J., 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 HECHT, M.S. Flow Analysis of Computer Programs. Elsevier, North-Holland, New York, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 JENSEN, K., AND WIRTH, N. Pascal User Manual and Report, 2nd ed., Springer-Verlag, New York, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25 KENNEDY, K., AND SCHWARTZ, d. An introduction to the set theoretical language SETL. Comp. and Math. with Applications 1, 1 (1975), 97-119.Google ScholarGoogle ScholarCross RefCross Ref
  26. 26 LAMPSON, B.W., ET AL. Report on the programming language Euclid. SIGPLAN Notices (ACM) 12, 2 (Feb. 1977), 1-79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 LORIE, R.A., AND WADE, B.W. The compilation of a very high level data language. Rep. RJ2008 (28098), IBM Research Center, Yorktown Heights, N.Y., May 1977.Google ScholarGoogle Scholar
  28. 28 LOW, J.R., AND ROVNER, P.D. Techniques for the automatic selection of data structures. TR 4, Comptr. Sci. Dept., U. of Rochester, Rochester, N.Y., Feb. 1976.Google ScholarGoogle Scholar
  29. 29 Low, J.R. Automatic data structure selection: An example and overview. TR 14, Comptr Sci. Dept., U. of Rochester, Rochester, N.Y., Sept. 1976.Google ScholarGoogle Scholar
  30. 30 McCARTHY, J., ET AL. LISP 1.5 Programmer's Manual. M.I.T. Press, Cambridge, Mass., 1965. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. 31 MXNSKY, M.L. Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, N.J., 1967. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 32 MORRIS, J.B. A comparison of Madcap and SETL. Tech. Rep., U. of California, Los Alamos Scientific Labs., Los Alamos, N.Mex., 1973.Google ScholarGoogle Scholar
  33. 33 REISER, J.F., Ed. SAIL. Memo AIM-289, Stanford Artificial Intelligence Lab., Stanford U., Stanford, Calif., Aug. 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. 34 REISNER, P. Use of psychological experimentation as an aid to development of a query language. Res. Rep. RJ 1707, IBM Research Lab., San Jose, Calif., Jan. 1976.Google ScholarGoogle Scholar
  35. 35 ROVNER, P.D. Automatic representation selection for associative data structures. TR 10, Comptr. Sci. Delft., U. of Rochester, Rochester, N.Y., Sept. 1976.Google ScholarGoogle Scholar
  36. 36 SCHMIDT, d.W. Some high level language constructs for data of type relation. ACM Trans. Database Syst. 2, 3 (Sept. 1977), 247-261. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. 37 SC~MIDT, J.W. Type concepts for database definition. Proc. Int. Conf. on Databases: improving Usability and Responsiveness. Academic Press, New York, 1978, pp. 215-244.Google ScholarGoogle Scholar
  38. 38 SEVERANCE, D.G., AND LOHMAN, G.M. Differential files: Their application to the maintenance of large databases. ACM Trans. Database Syst. 1, 3 (Sept. 1976), 256-267. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. 39 STON~BRAKER, M., ASD ROWE, L.A. Observations on data manipulation languages and their embedding in general purpose progamming languages. Mem. UCB/ERL M77/53, Electronics Research Lab., U. of California, Berkeley, Calif., July 1977.Google ScholarGoogle Scholar
  40. 40 TSXCHmTZIS, D. On implementation of relations. CSRG Tech. Rep, 35, Comptr. Syst. Res. Group, U. of Toronto, Toronto, Canada, May 1974.Google ScholarGoogle Scholar
  41. 41 WULF, W.A., ET AL. The Design ofan Optimizing Compiler. American Elsevier, New York, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. 42 ZLOOF, M.M. Query by example. Proc. AFIPS 1975 NCC, Vol. 44, AFIPS Press, Montvale, N.J., pp. 431-438.Google ScholarGoogle Scholar
  43. 43 ZLOOF, M.M. Query-by-example: A data base management language. IBM Res. Rep., IBM Research Center, Yorktown Heights, N.Y., Dec. 1976.Google ScholarGoogle Scholar

Index Terms

  1. Theseus—a programming language for relational databeses

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader