A note on "pointers"

  • C. P. Earnest
Section V - Workshop Position Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 54)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Codd, E. F. A relational model of data for large shared data banks. CACM 13/6 (June 1970), pp. 377–387.Google Scholar
  2. 2.
    Department of Defense Requirements for High Order Computer Programming Languages: "Tinman" (June 1976).Google Scholar
  3. 3.
    Hoare, C. A. R. Recursive data structures Stanford Artificial Intelligence Laboratory Memo STAN-CS-73-400 (Oct. 1973).Google Scholar
  4. 4.
    Hoare, C. A. R. and Wirth, Niklaus. An axiomatic description of the programming language PASCAL. Acta Informatica 2, pp. 335–355 (1973).Google Scholar
  5. 5.
    Jensen, Kathleen and Wirth, Niklaus. Pascal User Manual and Report, Second Edition. Springer Verlag, New York (1975).Google Scholar
  6. 6.
    Kieburtz, Richard B. Programming without pointer variables. Proceedings of Conference on Data, March 22–24, 1976. SIGPLAN Notices Volume 8, No. 2 (1976), pp. 95–107.Google Scholar
  7. 7.
    Knuth, D. E. Structured programming with go to statements. ACM Computing Surveys, Vol. 6, No. 4 (December 1974), pp. 261–301.Google Scholar
  8. 8.
    Van Wijngaarden, ed. Revised report on the algorithmic language Algol 68. Acta Informatica 5, pp. 1–236 (1975).Google Scholar
  9. 9.
    Wirth, Niklaus. Algorithms + Data Structures = Programs. Prentice-Hall, Inc., Englewood Cliffs, N. J. (1976)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • C. P. Earnest

There are no affiliations available

Personalised recommendations