Gerunds and representations

  • Authors:

  • Robert Bernecky;Roger K. W. Hui

  • Affiliations:

  • Snake Island Research Inc., 18 Fifth Street, Ward's Island, Toronto, Ontario M5J 2B9, Canada;Iverson Software Inc., 33 Major Street, Toronto, Ontario M5S 2K9, Canada

  • Venue:
  • APL '91 Proceedings of the international conference on APL '91
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

Gerunds, verbal forms that can be used as nouns, are recognized as having utility in the realm of programming languages. We show that gerunds can be viewed as arrays of atomic representations of verbs (functions), in a way which is consistent with the syntax and semantics of APL, and which allows verbs to be first class objects in the language. We define derivations of verbs from gerunds in the J dialect of APL, and show how these derivations provide control structures for sequencing, selection (in the sense of generalized forms of CASE or SWITCH statements and IF/THEN/ELSE), iteration (DO UNTIL), recursion, and parallel computation (MIMD, or Multiple Instruction, Multiple Data). We conclude with alternative representations of verbs which are useful in other contexts.