Dopls: A new type of programming language

  • Graham Lee
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 79)

Abstract

The importance of operand description in programming is emphasised, and programming languages are classified into Description-Oriented Programming Languages (DOPLs) and Identifien-Oriented Prognamming Languages (IOPLs) according to their operand-description facilities. Several examples are used to illustrate DOPLs, and the advantages, in terms of the level of transparency in programs, of using DOPLs over IOPLs.

Keywords

Parameter Sequence Null Sequence Prime Integer Parameter Integer Eulerian Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. ALAGIC, S., ARBIB, M.A., (1978): "The Design of Well-Structured and Correct Programs", Springer-Verlag, New York.Google Scholar
  2. ASTRAHAN, M.M., CHAMBERIAIN, D.D., (1975): "Implementation of a Structured English Query Language", Comm. ACM, Vol. 18, No. 10, pp 580–588.Google Scholar
  3. BARRON, D.W., (1977): "An Introduction to the Study of Programming Languages", CUP, Cambridge.Google Scholar
  4. BURGER, J.F., LEAL, A., SHOSHANI, A., (1975) "A Semantic-Based Natural-Language Interface for Data Management Systems", Proceedings of International Conference on Systems Sciences, Hawaii, pp 218–220.Google Scholar
  5. CHAMBERLAIN, D.D., BOYCE, R.F., (1974): "SEQUEL: A structured English query language", Proceedings of ACM-SIGFIDET Workshop on Data Description, Access and Control, Ann Arbor, Michigan, pp 249–264.Google Scholar
  6. FELDMAN, J.A., ROVNER, P.D., (1969): "An Algol-Based Associative Language", Comm. ACM, Vol. 12, No. 8, pp 439–449.Google Scholar
  7. FINDLER, N.V., (1969): "Design Features of and Programming Experience with an Associative Memory, Parallel Processing Language, AMPPL-11", Proceedings of Fourth Australian Computer Conference, Adelaide, pp 321–325.Google Scholar
  8. FOLEY, M., HOARE, C.A.R., (1971): "Proof of a recursive program: Quicksort", Computer Journal, Vol. 14, No. 4, pp 391–395.Google Scholar
  9. HEBDITCH, D.L., (1973):"Terminal languages for data base access", Data Base Management, Infotech State of the Art Report 15, pp 521–541.Google Scholar
  10. HERRIOT, R.G., (1977): "Towards the Ideal Programming Language", SIGPLAN Notices, Vol. 12, No. 3, pp 56–62.Google Scholar
  11. HOARE, C.A.R., (1961): "Algorithm 63, Partition", "Algorithm 64, Quicksort", Comm. ACM, Vol. 4, No. 7, p 321.Google Scholar
  12. HOARE, C.A.R., (1962): "Quicksort", Computer Journal, Vol. 5, No. 1, pp 10–15.Google Scholar
  13. HOARE, C.A.R., (1972): "Proof of a structured program: The Sieve of Eratosthenes", Computer Journal, Vol. 15, No. 4, pp 321–325.Google Scholar
  14. HOUSEL, B.C., SHU, N.C., (1976): "A High-Level Data Manipulation Language for Hierarchical Data Structures", Proceedings of a Conference on DATA: Abstraction, Definition and Structure, SIGPLAN Notices, Vol. 8, No. 2, pp 155–168.Google Scholar
  15. LEE, G., (1978): "Some design features of a Description Oriented Programming Language", Proceedings of the Eighth Australian Computer Conference, Canberra, pp 938–946.Google Scholar
  16. MARTIN, J., (1976): "Principles of Data-Base Management", Prentice-Hall, Englewood Cliffs, N.J.Google Scholar
  17. NYLIN, Jr., W.C., HARVILL, J.B. (1976): "Multiple Tense Computer Programming", SIGPLAN Notices, Vol. 11, No. 12, pp 74–93.Google Scholar
  18. POTTS, G.W., (1970): "Natural language inquiry to an open-ended data library", Proceedings of the SJCC, Atlantic City, N.J., pp 333–342.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Graham Lee
    • 1
  1. 1.Department of Computer ScienceUniversity of Western AustraliaAustralia

Personalised recommendations