Algebraic programs optimization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algebraic programs optimization

Full text

Pdf (574 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents

Bonn, West Germany

Pages: 370 - 376

Year of Publication: 1991

ISBN:0-89791-437-6

Authors

A. A. Letichevsky	Glushkov Institute of Cybernetics, Ukrainian Acad. of Sciences, Kiev 252207, USSR
J. V. Kapitonova	Glushkov Institute of Cybernetics, Ukrainian Acad. of Sciences, Kiev 252207, USSR
S. V. Konozenko	Glushkov Institute of Cybernetics, Ukrainian Acad. of Sciences, Kiev 252207, USSR

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 7, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120751 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	D. Bjorner, A. P. Ershov, and Jons, editors. Partial Evaluations and Mixed Computations, Proc. of the IFIP TC-2WS, North-Holland, 1986.
	2	P. Lescanne, Current trends in rewriting techniques and related problems, Trends in computer algebra, Springer-Verlag New York, Inc., New York, NY, 1988
	3	Alexander A. Letichevsky, On finding invariant relations of programs, Proceedings on Algorithms in Modern Mathematics and Computer Science, p.304-314, September 16-22, 1979
	4	A. A. Letichevsky. On the possibility of completing a search for invariant equalities in programs. Soviet Math. Do}l., 37(2):559-561, 1988.
	5	A. A. Letichevsky. Mixed computations and optimization of progrn.ms. Programming, (1):69-76, 1990. (In Russian).
	6	A. A. Letichevsky , J. V. Kapitonova, Algebraic programming in the APS system, Proceedings of the international symposium on Symbolic and algebraic computation, p.68-75, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96896]
	7	A. A. Letichevsky, J. V. K~pitonova, and S. V. Konozenko. Algebraic programming system APS-1. To be published in TSI special issue.
	8	A. A. Letichevsky, J. V. Kapitonova, and S. V. Konozenko. Algebraic programming system APS-1. In O. M. Tammepuu, editor, INFORMAT- ICS '89, Proc. o.f the Soviet-Franch Syrup., pages 46-52, Tallinn, May 1989. Institute of Cybernetics, Estonian Acid, of Sciences,
	9	M. J. O'Donnell, Term-rewriting implementation of equational logic programming, on Rewriting techniques and applications, p.1-12, May 1987, Bordeaux, France
	10	Paul W. Pardom, Jr. , Cynthia A. Brown, Fast many-to-one matching algorithms, Proc. of the first international conference on Rewriting techniques and applications, p.407-416, December 1985, Dijon, France
	11	R. C. Sekar ~nd I. V. R~m~krishnan. Programming in equational logic: Beyond strong sequenti~lity. In Proc. 5th Annual IEEE Syrup. on Logic in Computer Sci, p~ges 230-241. IEEE Comp. Soc. Press, June 1990.

CITED BY 2

	A. A. Letichevskii , V. V. Khomenko, A Rewriting Machine and Optimization of Strategies of Term Rewriting, Cybernetics and Systems Analysis, v.38 n.5, p.637-649, September-October 2002
	A. B. Godlevsky , A. E. Doroshenko, Parallelizing programs with APs, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.55-62, July 06-08, 1993, Kiev, Ukraine