Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Modeling of storage properties of higher-level languages

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

The role of storage in the characterization of higher-level programming languages is discussed. Assignment, in particular, has significantly different meaning in different languages, which can hardly be understood without reference to an underlying model of storage. A general storage model is sketched which can be specialized to a model of ALGOL 68 or of PL/I storage. The same model is used to discuss language features allowing highly flexible data structures.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. H. Bekic and K. Walk, “Formalization of storage properties,” in E. Engeler, ed.,Symposium on Semantics of Algorithmic Languages (Lecture Notes in Mathematics 188) (Springer Verlag, 1971), pp. 28–61.

  2. E. F. Codd, “A relational model of data for large shared data banks,”Commun. ACM 13 (June):377–387 (1970).

    Google Scholar 

  3. C. C. Elgot and A. Robinson, “Random access stored program machines—An approach to programming languages,”J. ACM 11 (October):365–399 (1964).

    Google Scholar 

  4. C. A. R. Hoare, “Record handling,” in F. Genuys, ed.,Programming Languages (Academic Press, New York, 1969), pp. 291–447.

    Google Scholar 

  5. J. McCarthy, “Recursive functions of symbolic expressions and their computation by machine, Part I,”Commun. ACM 3 (April):184–195 (1960).

    Google Scholar 

  6. G. H. Mealy, “Another look at data,” in 1967Fall Joint Computer Conference, AFIPS Proc., Vol. 13 (Thompson Books, 1967), pp. 525–534.

  7. “PL/I language specifications,” IBM Systems Library, Form No. C28-6571-4, 1966.

  8. J. E. Sammet, “Roster of programming languages,”SIGPLAN Notices 5(8):19–25 (1970).

    Google Scholar 

  9. T. A. Standish, “A data definition facility for programming languages,” Carnegie Institute of Technology, Pittsburgh, Pa., 1967.

    Google Scholar 

  10. C. Strachey, “Toward a formal semantics,” in T. B. Steel, ed.,Formal Language Description Languages (North-Holland, Amsterdam, 1966), pp. 198–216.

    Google Scholar 

  11. A. van Wijngaarden (ed.), B. J. Mailloux, B. J. Peck, and C. H. A. Koster, “Report on the algorithmic languageAlgol 68,” 2nd ed. (Mathematical Centrum, Amsterdam, 1968).

    Google Scholar 

  12. P. Wegner, “The variability of computations,” Techn. Report, Center for Computers and Information Sciences, Brown University, Providence, Rhode Island, 1970.

    Google Scholar 

  13. P. Lucas and K. Walk, “On the Formal Description ofPl/I,”Ann. Rev. Automatic Programming 6:105–182 (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Revised version of a paper presented at the ACM Symposium on Data Structures in Programming Languages, University of Florida, Gainesville, February 25–27, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Walk, K. Modeling of storage properties of higher-level languages. International Journal of Computer and Information Sciences 2, 1–24 (1973). https://doi.org/10.1007/BF00987149

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00987149

Keywords