ACM Home Page
Please provide us with feedback. Feedback
Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
Full text PdfPdf (1.54 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 4 ,  Issue 2  (April 1982) table of contents
Pages: 196 - 225  
Year of Publication: 1982
ISSN:0164-0925
Author
Micha Sharir  School of Mathematical Sciences, Tel-Aviv University, Ramat-Aviv, Tel Aviv 69978, Israel
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 21,   Citation Count: 6
Additional Information:

references   cited by   index terms   collaborative colleagues  

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

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
 
3
DEWAR, R.B.K., AND MCCANN, A.P. MACRO SPITBOL--A SNOBOL4 compiler. Sofiw. Pract. Exper. 7 (1977), 95-113.
 
4
DEWAR, R.B.K., SCHONBERa, E., AND SCHWARTZ, J.T. Higher Level Programming: Introduction to the Use of the Set-Theoretic Programming Language SETL. Courant Institute of Mathematical Sciences, New York Univ., New York, 1981.
 
5
DEWAR, R.B.K., SHARIR, M., AND WEIXELRAUM, E. On transformational construction of garbage collection algorithms. Tech. Rep., Computer Science Dep., Courant Institute of Mathematical Sciences, New York Univ., New York, to appear.
 
6
EARLEY, J. High level iterators and a method for automatically designing data structure representation. Comput. Lang. I (1976), 321-342.
7
8
 
9
KENNEDY, K., AND SCHWARTZ, J.T. An introduction to the set-theoretical language SETL. Comput. Math. Appl. 1, I (1975), 97-119.
 
10
 
11
 
12
PAIGE, R. Expression continuity and the formal differentiation of algorithms. Tech. Rep. 15, Computer Science Dep., Courant Institute of Mathematical Sciences, New York Univ., New York, 1979.
 
13
PAIGE, R., AND KOENiG, S. Finite differencing of computable expressions. Tech. Rep. LCSR- TR-8, Laboratory for Computer Science Research, Rutgers Univ., New Brunswick, N.J., 1980.
14
 
15
SCHWARTZ, J.T. On the "base form" of algorithms. SETL Newsl. 159, Courant Institute of Mathematical Sciences, New York Univ., New York, 1975.
 
16
SO,WAR?Z, J.T. On Programming: An Interim Report on the SETL Project, 2d ed. Courant Institute of Mathematical Sciences, New York Univ., New York, 1975.
 
17
SCHWARTZ, J.T. intermediate result recording and other techniques for optimizing recursions and backtrack programs. SETL Newsl. 155, Courant Institute of Mathematical Sciences, New York Univ., New York, 1975.
 
18
SHARm, M. A strange sorting technique inspired by program transformation. Comput. Math. Appl. 7, 4 (1981), 293-298.
 
19
SHARIR, M. Formal integration--A program transformation technique. Comput. Lang. 6, 1 (1981), 35-46.
 
20
SHARm, M. Set theoretic constructs as a tool in program construction. In Proceedings of the Internationa~ Workshop on Program Construction, Bonas, France, Sept. 1980.
 
21
SHARm, M. Algorithm derivation by transformation. Tech. Rep. 21, Computer Science Dep., Courant Institute of Mathematical Sciences, New York Univ., New York, 1980.