ACM Home Page
Please provide us with feedback. Feedback
Automatic synthesis of the inverses of APL functions
Full text PdfPdf (504 KB)
Source International Conference on APL archive
Proceedings of the international conference on APL '91 table of contents
Palo Alto, California, United States
Pages: 314 - 318  
Year of Publication: 1991
ISBN:0-89791-441-4
Also published in ...
Author
Alvin J. Surkan  Department of Computer Science and Engineering, University of Nebraska, Lincoln, Ferguson Hall, Room 115, Lincoln, Nebraska
Sponsors
SIGAPL: ACM Special Interest Group on APL Programming Language
APLBUG :
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/114054.114090
What is a DOI?

ABSTRACT

APL is used to facilitate the automatic inversion and execution of programs which are constructed by strict functional composition. Programs for performing high level functions and their inverses can be logically synthesized and then tested in arbitrary instances. APL is used to compose higher level functions by repeated left application of functions and operators designed expressly so that their syntax is limited to be monadic.A small system of auxiliary functions are sufficient to do the synthesis of inverse programs. This system operates on sequences of applicative functions which must be provided originally with their forward form coded in functional style APL. The system inverts higher level user-defined functions and generates correctly sequenced function calls which are used in testing the synthesized inverses.Using this system, the mechanistic re-formulation of the forward functions and either their exact or even their approximate inverses can be produced and then checked for consistency. Consistency in performance can be randomly tested by evaluating and confirming the validity of the identity R ≡ F-1 F R. This may be done for acceptable comparison tolerances over a representative number of objects named R to which the function F and its inverse F-1 are applied in tandem.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Hudak, P., Wadler, P. (editors) Report on the Programming Language HaskeU, Version 1.0 April 1, 1990, Yale University Document YALEU/DCS/RR-777.
 
3
Iverson, Kenneth, The Principles of J, pp 1-15, APL News, Volume 22 Number 3, 1990.
 
4
 
5
Rumelhart, D.E., McClelland J. L., Parallel Distributed Processing, Vol. I, Foundations, page 329, 1988 MIT Press.