The promotion and accumulation strategies in transformational programming

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The promotion and accumulation strategies in transformational programming

Full text

Pdf (920 KB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 6 , Issue 4 (October 1984) table of contents
Lecture notes in computer science Vol. 174

Pages: 487 - 504

Year of Publication: 1984

ISSN:0164-0925

Author

R. S. Bird

Oxford University

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/1780.1781 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	Alfred V. Aho , John E. Hopcroft , Jeffrey Ullman , J. D. Ullman , J. E. Hopcroft, Data Structures and Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
	2	John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
	3	R. S. Bird, Tabulation Techniques for Recursive Programs, ACM Computing Surveys (CSUR), v.12 n.4, p.403-417, Dec. 1980 [doi>10.1145/356827.356831]
	4	BURGE, W.H. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975.
	5	R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
	6	BURSTALL, R.M., MACQUEEN, D.B., AND SANELLA, D.T. HOPE: an experimental applicative language. Internal Rep., Dept. of Computer Science, Univ. of Edinburgh, Edinburg, Scotland, 1980.
	7	DARLINGTON, J. A synthesis of several sorting algorithms. Act. Inf. 11 (1978), 1-30.
	8	DARLINGTON, J. The structured description of algorithm derivations. In Algorithmic Languages, de Bakker and van Vleit, Eds. IFiP, North-Holland, Amsterdam, 1981, pp. 221-250.
	9	DIJKSTRA, E.W. Some beautiful arguments using mathematical induction. Act. Inf. 13 (1980), 1-8.
	10	Martin S. Feather, A System for Assisting Program Transformation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.1-20, Jan. 1982 [doi>10.1145/357153.357154]
	11	GORDON, M.J., MILNER, A.J., AND WADSWORTH, C.P. Edinburgh LCF. Lecture Notes in Computer Science, vol. 78. Springer-Verlag, New York, 1979.
	12	Peter Henderson, Functional Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1980
	13	James W. Hunt , Thomas G. Szymanski, A fast algorithm for computing longest common subsequences, Communications of the ACM, v.20 n.5, p.350-353, May 1977 [doi>10.1145/359581.359603]
	14	Robert Paige , Shaye Koenig, Finite Differencing of Computable Expressions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.402-454, July 1982 [doi>10.1145/357172.357177]
	15	Bob Paige , J. T. Schwartz, Expression continuity and the formal differentiation of algorithms, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.58-71, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512957]
	16	PARTSCH, H., AND STEINBRUGGEN, R. A comprehensive survey on program transformation systems. Tech. Rep. TUM-INFO-8108, Institut flit Informatik der TU M'unchen, Munich, W. Germany, 1981. To appear in Computing Surveys).
	17	D. A. Turner, The semantic elegance of applicative languages, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.85-92, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806766]
	18	TURNER, D.A. Recursion equations as a programming language. In Functional Progra~nming and its Applications, Darlington, Henderson, and Turner, Eds. Cambridge University Pres~, 1981, pp. 1-28.
	19	David Sheridan Wile, A generative, nested-sequential basis for general purpose programming languages., 1974

CITED BY 21

	Zhenjiang Hu , Hideya Iwasaki , Masato Takechi, Formal derivation of efficient parallel programs by construction of list homomorphisms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.3, p.444-461, May 1997
	Colin Runciman , Mike Firth, Formalised development of software by machine assisted transformation, ACM SIGSOFT Software Engineering Notes, v.15 n.4, p.115-117, Sep. 1990
	Peter Harrison , Hessam Khoshnevisan, Efficient compilation of linear recursive functions into object level loops, ACM SIGPLAN Notices, v.21 n.7, p.207-218, July 1986
	Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Discovering auxiliary information for incremental computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-170, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Discovering auxiliary information for incremental computation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-170, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Johann Christoph Freytag , Nathan Goodman, On the translation of relational queries into iterative programs, ACM Transactions on Database Systems (TODS), v.14 n.1, p.1-27, March 1989
	J. Cai , R. Paige, Binding performance at language design time, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.85-97, January 21-23, 1987, Munich, West Germany
	Jeremy Gibbons , Geraint Jones, The under-appreciated unfold, ACM SIGPLAN Notices, v.34 n.1, p.273-279, Jan. 1999
	Yanhong A. Liu , Scott D. Stoller, Program optimization using indexed and recursive data structures, ACM SIGPLAN Notices, v.37 n.3, p.108-118, March 2002
	Alberto Pettorossi , Maurizio Proietti, Rules and strategies for transforming functional and logic programs, ACM Computing Surveys (CSUR), v.28 n.2, p.360-414, June 1996
	Yanhong A. Liu , Scott D. Stoller, Dynamic Programming via Static Incrementalization, Higher-Order and Symbolic Computation, v.16 n.1-2, p.37-62, March-June 2003
	Johann Christoph Freytag , Nathan Goodman, Rule-based transformation of relational queries into iterative programs, ACM SIGMOD Record, v.15 n.2, p.206-214, June 1986
	Yanhong A. Liu, Efficiency by Incrementalization: An Introduction, Higher-Order and Symbolic Computation, v.13 n.4, p.289-313, Dec. 1, 2000
	Janis Voigtländer, Concatenate, reverse and map vanish for free, ACM SIGPLAN Notices, v.37 n.9, p.14-25, September 2002
	Yanhong A. Liu , Scott D. Stoller , Michael Gorbovitski , Tom Rothamel , Yanni Ellen Liu, Incrementalization across object abstraction, ACM SIGPLAN Notices, v.40 n.10, October 2005
	Gautam , S. Rajopadhye, Simplifying reductions, ACM SIGPLAN Notices, v.41 n.1, p.30-41, January 2006
	Yanhong A. Liu , Scott D. Stoller , Ning Li , Tom Rothamel, Optimizing aggregate array computations in loops, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.1, p.91-125, January 2005
	Yanhong A. Liu , Scott D. Stoller , Tim Teitelbaum, Static caching for incremental computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.3, p.546-585, May 1998
	Alcino Cunha , Jorge Sousa Pinto, Point-free Program Transformation, Fundamenta Informaticae, v.66 n.4, p.315-352, December 2005
	Johann Christoph Freytag , Nathan Goodman, Translating Aggregate Queries into Iterative Programs, Proceedings of the 12th International Conference on Very Large Data Bases, p.138-146, August 25-28, 1986
	Andrew J. Bennett , Paul H. J. Kelly , Ross A. Paterson, Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence, Journal of Functional Programming, v.11 n.4, p.359-393, July 2001