The branchless loop

  • Authors:
  • Cole Whiteman

  • Affiliations:
  • University of Michigan, Ann Arbor, Michigan

  • Venue:
  • ACM SIGAPL APL Quote Quad
  • Year:
  • 1981

Quantified Score

Hi-index 0.00

Visualization

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.