skip to main content
article
Free Access

The branchless loop

Published:01 March 1981Publication History
Skip Abstract Section

Abstract

I present a clean, attractive expression for looping in APL. It uses no branches, labels, or global variables. It requires no modifications to the interpreter. Its simplicity makes it especially appealing for ad hoc applications in immediate execution.

References

  1. G. A. Blaauw and A. J. W. Duijvestijn. The use of the inner-product operator of APL in graph applications, APL 80: International Conference on APL, North Holland Publishing Co. (1980).Google ScholarGoogle Scholar
  2. Franklin Kemp. Design of a structured APL, APL Quote Quad 9 1 (Sept. 1978) pp. 11--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. P. Reeves and J. Besemer. Special control structures for APL, APL Quote Quad 9 2 (Dec. 1978) pp. 23--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Clark Wiedmann. Whither (wither?) control structures?, APL Quote Quad 9 2 (Dec. 1978) pp. 21--22. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The branchless loop
    Index terms have been assigned to the content through auto-classification.

    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 SIGAPL APL Quote Quad
      ACM SIGAPL APL Quote Quad  Volume 11, Issue 3
      March 1981
      18 pages
      ISSN:0163-6006
      DOI:10.1145/586640
      Issue’s Table of Contents

      Copyright © 1981 Author

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 March 1981

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader