On "powerloop" constructs in programming languages

  • Authors:
  • Robert Mandl

  • Affiliations:
  • MIT, Cambridge, MA

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

A recent article in these Notices [1] gives an overview of proposals and implementations of a "power operator" which (in its simplest form), acting on a nonnegative integer N and on a dyadic function ¤, yields a monadic function which maps any nonnegative number B into B¤B¤B¤...¤B with N occurrences of B. The entire discourse is couched in APL terms, thus unfortunately suggesting a somewhat narrow relevance. To dispel this erroneous impression, we give here a simple example of a programming task where the utility of such a construct appears in a most natural manner, and suggest a possible syntax therefor.