skip to main content
article
Free Access

APL procedures (user defined operators, functions and token strings)

Published:01 May 1986Publication History
Skip Abstract Section

Abstract

This paper describes some central aspects of an APL implementation on a Hewlett Packard Minicomputer. The development of these ideas led to an elegant, consistent underlying structure for all procedures, where a procedure is defined as a structured sequence of APL expressions, instances of which are niladic functions, ambivalent functions, monadic operators and dyadic operators. Further to this idea, the introduction of two new functions (tokenize and detokenize) and a single hyperoperator (∇) gave rise to the following features;

  • Ability to manipulate functions and operators as APL objects

  • Extended Assignment applied to all APL objects

  • Ability to store preset (or initialized) values into the header of any procedure

  • Make direct use of the (usually restricted) facet of tokenizing and detokenizing in APL to generate token strings, which may be applied by the programmer to form individual variants of □FX,CR and/or ∇ editing.

These extensions have been superimposed upon a basic imprint of SHARP APL.

References

  1. 1 R. Bernecky, "Function Arrays", APL 84 Proceedings, pp 53-56. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 J. P. Ben kard, "Syntactic Experiments with Arrays of Functions and Operators", APL 84 Proceedings, pp 41-51. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 J.A.Brown, "Function Assignment and Arrays of Functions", APL 84 Proceedings, pp 81-84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 S.J.Taylor and A.T.Whitney, "The One Tree", APL 84 Proceedings.Google ScholarGoogle Scholar
  5. 5 R.Bernecky and K.E.lverson, "Operators and Enclosed Arrays", (I. P.Sharp, Proceedings of the User Meeting, 1980).Google ScholarGoogle Scholar
  6. 6 R. Bernecky, ""Representations for Enclosed Arrays", APL 81 Proceedings, pp 42-46. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 P.C.Berry, SHARP APL Reference Manual, I. P. Sharp Associates, 1981.Google ScholarGoogle Scholar
  8. 8 K.E. lverson, "A Dictionary of the APL Language", I.P.Sharp Associates, 1985 Draft.Google ScholarGoogle Scholar
  9. 9 K. E. lverson and P. K.Wooster, "A Function Definition Operator". APL 81 Proceedinas. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 K. E . I verson and A.T.Whitney, "Political Uses of a Model of APL", APL 82 Proceedings. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 P.G.Cinque, personal communications.Google ScholarGoogle Scholar
  12. 12 J.P.Benkard, "Structural Experiments with Arrays of Functions", APL 85 Proceedinas. pp 166-172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 E. Eusebi, "Operators for program control", APL 85 Proceedings, pp 181-189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 E.Eusebi, "Operators for Recursion", APL 85 Proceedings, pp 190-194. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 G .Gould, personal communications.Google ScholarGoogle Scholar
  16. 16 K.E. Iverson, R . Pesch, J. H. Schueler, "An Operator Calculus", APL 84 Proceedings, pp 213-218. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. APL procedures (user defined operators, functions and token strings)

          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 16, Issue 4
            1986
            334 pages
            ISSN:0163-6006
            DOI:10.1145/22008
            Issue’s Table of Contents
            • cover image ACM Conferences
              APL '86: Proceedings of the international conference on APL
              December 1986
              334 pages
              ISBN:0901865354
              DOI:10.1145/22415

            Copyright © 1986 Author

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 May 1986

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader