skip to main content
article
Free Access

ALGOL 68 might-have-beens

Authors Info & Claims
Published:29 March 1977Publication History
Skip Abstract Section

Abstract

This paper discusses some language features which might have been in ALGOL68. They would not have complicated the compiler to any considerable extent. They would certainly have contributed to the expressive power of the language. In fact their desirability emerged from the practice of ALGOL68 programming (cf. {4}). “Might-have-beens” are small super-language features and some of them could even be considered as “might-be”s in the sense that they still might be incorporated in existing compilers without (great) difficulty.

A few of these “lost chances” have deeper roots and may contribute to the development of future languages.

References

  1. 1 Dijkstra, E.W. (1976) "A discipline of programming" Prentice-Hall Series in Automatic Computation Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Jensen, K. and Wirth, N. (1974) "PASCAL, Users manual and Report" Lecture Notes in Computer Science 18/ Springer Verlag Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Meulen, S.G. v.d. (1977) "Refer's, a generalization of address and access-algorithm" (in preparation)Google ScholarGoogle Scholar
  4. 4 Meulen, S.G. v.d. and Veldhorst, M. (1977) "TORRIX, a programming language for operations on vectors and matrices over arbitrary fields and of variable size" MC-Tract/Mathematical Centre AmsterdamGoogle ScholarGoogle Scholar
  5. 5 Rain, M. (1972) "Some formal aspects of MARY or ALGOL X revisited" SINTEF Techn. University of Norway, TrondheimGoogle ScholarGoogle Scholar
  6. 6 Schuman, S.A. editor (1975, 1976) "New directions in algorithmic languages 1975" "New directions in algorithmic languages 1976" (prepared for Working Group 2.1 on Algol) IRIA, Institut de Recherche d'Informatique et d'Automatique Domaine de Voluceau - Rocquencourt - B.P.5 - 78150 Le ChesnayGoogle ScholarGoogle Scholar
  7. 7 Wegner, E. (1973) "Baumstrukturierte Programme" Technische Universität Berlin, Informatik PC2, D83Google ScholarGoogle Scholar
  8. 8 Wirth, N. (1976) "Algorithms + Data Structures &equil; Programs" Prentice-Hall Series in Automatic Computation Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Wulf, W.A., Russell, D.B. and Habermann, A.N. (1971) "BLISS: a language for system programming" Communications of the ACM 14, 780-790 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Wijngaarden, A. van, et al (1975) "Revised Report on the Algorithmic Language ALGOL 68" Springer-Verlag Berlin. Heidelberg. New York (1976) MC Tract 50/ Mathematisch Centrum Amsterdam (1976)Google ScholarGoogle Scholar

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

  • Published in

    cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 12, Issue 6
    Proceedings of the Strathclyde ALGOL 68 conference
    June 1977
    191 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/872738
    Issue’s Table of Contents
    • cover image ACM Conferences
      Proceedings of the Strathclyde ALGOL 68 conference
      March 1977
      199 pages
      ISBN:9781450379014
      DOI:10.1145/800238

    Copyright © 1977 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 29 March 1977

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader