Memo

ABSTRACT

MEMO is an APL2 operator which implements the strategy of memoizing function values for all APL2 functions free from all side-effects without global variables. Memoizing function values means substitution of function execution by table lookup on repetitive function calls with the same arguments. MEMO maps the set of all APL2 functions free from all side-effects without global variables to the (derived) set of memoizing APL2 functions. MEMO allows the programmer to benefit from the speed advantage of memoized functions while still maintaining a precise and clear code. Moreover, it is possible to perform this speed optimization automatically.

REFERENCES

• 1: Karen A. Frenkel, An interview with Ivan Sutherland, Communications of the ACM, v.32 n.6, p.712-714, June 1989 [doi>10.1145/63526.63531]
• 2: J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
• 3: Peter Henderson, Functional Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1980
• 4: David E. Rydeheard , Rod M. Burstall, Computational category theory, Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1988
• 5: [Mac Lane 1971] Mac Lane S. (1971), Categories for the Working Mathematician, Springer, New York.
• 6: Harold Abelson , Gerald Jay Sussman , Julie Sussman, Structure and interpretation of computer programs, MIT Press, Cambridge, MA, 1985
• 7: [Hughes 1985] Hughes J. (1985), "Lazy Memo-Functions", Lecture Notes in Computer Science 201, Springer Verlag, Berlin.
• 8: [Michie 1968] Michie D. (1968), "'Memo'- Functions and Machine Learning", Nature, N218, pp 19-22 (April 1968).
• 9: [Peyton Jones 1985] Peyton Jones S. (1985), "An Introduction to Fully-Lazy Supercombinators", Lecture Notes in Computer Science 242, Springer Verlag, Berlin.
• 10: [Gonnet 1984] Gonnet G. H. (1984), Handbook off Algorithms and Data Structures, Addison Wesley, London.
• 11: [Hermes 1978] Hermes H. (1978), Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Heidelberger Taschenbücher Band 87, Springer Verlag, Berlin.
• 12: [Kleene 1967] Kleene St. C. (1967), Introduction to Metamathematics, North-Holland, Amsterdam.
• 13: [Rusy 1986] Rusy O. S. (1986), "Einige Bemerkungen zu APL Benchmarks", APL Journal, APL Club Germany e.V., V5, N1.
• 14: [Wheeler 1985] Wheeler J. G. (1985), "The STSC APL Benchmarks", APL Journal, APL Club Germany e.V., V4, N1.
• 15: A. Geyer-Schulz , A. Taudes , J. Mitlöhner, An APL-tutoring adventure game, ACM SIGAPL APL Quote Quad, v.19 n.4, p.148-157, Aug. 1989
• 16: Philippe A. Janson, Operating systems: structures and mechanisms, Academic Press Professional, Inc., San Diego, CA, 1985
• 17: [Herrlich, Strecker 1973] Herrlich H. and Strecker G. E. (1973), Category Theory, Heldermann Verlag, Berlin.

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

General Terms:
Design, Languages, Performance, Theory