Advertisement

BIT Numerical Mathematics

, Volume 10, Issue 4, pp 405–414 | Cite as

Implementing the ALGOL 68 heap

  • H. D. Baecker
Article
  • 27 Downloads

Abstract

The implications of the heap, reference variables and global generators in ALGOL 68 are examined and some notes on possible implementation mechanisms are presented. In particular the use or simulation of hardware with segment addressing facilities is discussed.

Key Words and Phrases

ALGOL 68 PL/1 segment addressing storage allocation garbage collection list processing storage structures multi-level storage implementation techniques circular lists rings reference counts 

CR categories

4.2 4.22 4.32 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    IBM System/360 PL/1 Reference Manual, Form C28-8201, IBM Winchester, 1968.Google Scholar
  2. 2.
    A. van Wijngaarden (Ed.),Report on the Algorithmic Language Algol 68, MR 101, Mathematisch Centrum, Amsterdam, 1969.Google Scholar
  3. 3.
    H. D. Baecker,Mapped list structures, Comm. ACM 6, 8 (Aug. 1963), 435–438.Google Scholar
  4. 4.
    D. E. Knuth,The Art of Computer Programming Vol. 1, Fundamental Algorithms, Addison-Wesley, Reading, 1968.Google Scholar
  5. 5.
    S. G. van der Meulen and C. H. Lindsey,Informal Introduction to ALGOL 68, Mathematisch Centrum, Amsterdam, 1969.Google Scholar
  6. 6.
    B. J. Mailloux,On the Implementation of Algol 68, Mathematisch Centrum, Amsterdam, 1968.Google Scholar
  7. 7.
    G. G. Dodd,Elements of Data Management Systems, Computing Surveys 1, 2 (June 1969), 117–133.Google Scholar
  8. 8.
    C. Bowman,Package to ‘name’ records, Computer Weekly, 106 (26 Sept. 1968), 6–7.Google Scholar
  9. 9.
    P. Wegner,Programming Languages, Information Structures and Machine Organisation, McGraw-Hill, New York, 1968.Google Scholar
  10. 10.
    B. Randell,A Note on Storage Fragmentation and Program Segmentation, Comm. ACM 12, 7 (July 1969), 365–369 & 372.Google Scholar
  11. 11.
    W. C. McGee,On dynamic program relocation, IBM Systems Journal 4, 3 (1965), 184–199.Google Scholar
  12. 12.
    J. G. Laski,Segmentation and virtual address topology—an essay in virtual research, Computer Journal 11, 1 (May 1968) 35–40.Google Scholar
  13. 13.
    J. G. Jodiet,Storage organisation in programming systems, Comm. ACM 11, 11 (Nov. 1968), 741–746.Google Scholar
  14. 14.
    J. K. Iliffe,Basic Machine Principles, Macdonald, London and American Elseiver, New York, 1968.Google Scholar
  15. 15.
    H. D. Baecker,Implementing a Stack, Comm. ACM 5, 10 (Oct. 1962) 505–507.Google Scholar
  16. 16.
    D. W. Barron,Recursive Techniques in Programming, Macdonald, London and American Elsevier, New York, 1968.Google Scholar
  17. 17.
    B. Randell and L. J. Russell,Algol 60 Implementation, Academic Press, London and New York, 1964.Google Scholar
  18. 18.
    D. H. R. Huxtable,On writing an optimizing translator for Algol 60, in Introduction to Systems Programming, Academic Press, London and New York, 1964.Google Scholar
  19. 19.
    N. Wirth and C. A. R. Hoare,A contribution to the development of ALGOL, Comm. ACM 9, 6 (June 1966), 413–418.Google Scholar
  20. 20.
    C. A. R. Hoare,Record handling, in Symbol manipulation languages and techniques, 262–284, North-Holland Publ. Co., Amsterdam, 1968.Google Scholar
  21. 21.
    C. A. R. Hoare,Data structures in two-level store, in Proc. IFIP Congress 68, 111–117, North-Holland Publ. Co., Amsterdam, 1968.Google Scholar
  22. 22.
    H. R. Bauer, et al.,ALGOL W Language Description CS110, Computer Science Dept., Stanford U., 1968.Google Scholar
  23. 23.
    G. E. Collins,A method of overlapping and erasure of lists, Comm. ACM 3, 12 (Dec. 1960), 655–657.Google Scholar
  24. 24.
    J. Weizenbaum,Symmetric List Processor, Comm. ACM 6, 9 (Sept. 1963) 524–544.Google Scholar
  25. 25.
    E. W. Dijkstra,Cooperating Sequential Processes—EWD 123, Technological U., Eindhoven, 1965.Google Scholar
  26. 26.
    E. W. Dijkstra,Solution of a problem in concurrent programming control, Comm. ACM 8, 9 (Sept. 1965), 569.Google Scholar
  27. 27.
    J. Weizenbaum,Recovery of Reentrant List Structures in SLIP, Comm. ACM 12, 7 (July 1969), 370–372.Google Scholar
  28. 28.
    J. C. Gray,Compound data structures for computer aided design; a survey, Proc. ACM Nat. Conf. 1967, 355–365.Google Scholar
  29. 29.
    H. Schorr and W. M. Waite,An efficient machine-independent procedure for garbage collection in various list structures, Comm. ACM 10, 8 (Aug. 1967), 501–506.Google Scholar

Copyright information

© BIT Foundations 1970

Authors and Affiliations

  • H. D. Baecker
    • 1
  1. 1.Department of Mathematics, Statistics and Computing ScienceThe University of CalgaryCalgary 44Canada

Personalised recommendations