Schema recognition for program transformations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Schema recognition for program transformations

Full text

Pdf (913 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents

Austin, Texas, United States

Pages: 74 - 84

Year of Publication: 1984

ISBN:0-89791-142-3

Authors

John S. Givler
Richard B. Kieburtz

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/800055.802023 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	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]
	2	John Backus, The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions, Proceedings of the International Colloquium on Formalization of Programming Concepts, p.1-43, April 19-25, 1981
	3	COOPER, D.C. The equivalence of certain computations. Computer Journal 9 (May 1966), pp 45-52.
	4	DARLINGTON, J. and BURSTALL R.M. A system which automatically improves programs. Acta Informatica 6 (1976), pp 41-60.
	5	DERSHOWITZ, N. Orderings for term-rewriting systems. Theoretical Computer Science 17 (1982), pp 279-301.
	6	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	7	François Fages, Associative-Commutative Unification, Proceedings of the 7th International Conference on Automated Deduction, p.194-208, May 14-16, 1984
	8	FAY, M.J. First-order unification in an equational theory. 4th Workshop on Automated Deduction, Austin Texas (1979), pp. 161-167.
	9	Jieh Hsiang, Topics in automated theorem proving and program generation, 1983
	10	HSIANG J. Private communication, (1984).
	11	Gérard Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM (JACM), v.27 n.4, p.797-821, Oct. 1980 [doi>10.1145/322217.322230]
	12	HUET, G. and LANG B. Proving and applying program transformations expressed with second-order patterns. Acta Informatica 11 (1978), pp 31-55.
	13	Gerard Huet , Derek C. Oppen, Equations and rewrite rules: a survey, Stanford University, Stanford, CA, 1980
	14	HULLOT, J. Canonical forms and unification. SRI International TR CSL-113 (1980).
	15	Richard B. Kieburtz , Jonathan Shultis, Transformations of FP program schemes, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.41-48, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806761]
	16	KNUTH, D.E. and BENDIX, P. Simple word problems in universal algebras.Computational Problems in Abstract Algebra, Pergamon Press (1970), pp 263-297.
	17	MAC LANE, S. and BIRKHOFF, G. Algebra. The MacMillan Company (1967) pp 482-505.
	18	Jörg H. Siekmann, Universal Unification, Proceedings of the 7th International Conference on Automated Deduction, p.1-42, May 14-16, 1984
	19	Mark E. Stickel, A Unification Algorithm for Associative-Commutative Functions, Journal of the ACM (JACM), v.28 n.3, p.423-434, July 1981 [doi>10.1145/322261.322262]
	20	TAPIA, M.A. and TUCKER, J.H. Complete solution of Boolean equations, IEEE Transactions on Computers C-29 7(July 1980), pp 662-885.

CITED BY 3

	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
	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
	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