On the Development of the Algebra of Functional Programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the Development of the Algebra of Functional Programs

Full text

Pdf (1.24 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 4 , Issue 4 (October 1982) table of contents

Pages: 733 - 757

Year of Publication: 1982

ISSN:0164-0925

Author

John H. Williams

K51-282, IBM Research, 5600 Cottle Road, San Jose, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 37, Citation Count: 10

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/69622.357193 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, 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
	2	BACKUS, J.W. On extending the concept of program and solving linear functional equations. Draft paper distributed at Summer Workshop on Programming Methodology, Univ. of Calif. at Santa Cruz, Santa Cruz, Calif., Aug. 1979. A revised version was published as {1}.
	3	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]
	4	BURCE, W.H. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975.
	5	BURSTALL, R.M. Design considerations for a functional programming language. In Proceedings of Infotech State of the Art Conference, Copenhagen, 1977.
	6	CADIOV, J.M. Recursive de~mitions of partial functions and their computations. Stanford Artificial Intelligence Memo 163, Computer Science Dep., Stanford Univ., Stanford, Calif., 1972.
	7	DIJKSTRA, E.W. Lecture notes on program development, in Proceedings of International Summer School on Program Construction, Marktoberdorf, W. Germany, Aug. 1978.
	8	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	9	KLE~NE, S.C. Introduction to Metamathematics. Van Nostrand Reinhold, Florence, Ky., 1952.
	10	LANDtN, P.J. The mechanical evaluation of expressions. Comput. J. (Jan. 1964), 308-320.
	11	MCCARTHY, J. Predicate calculus with undefined as a truth value. Stanford Artificial Intelligence Memo 1, Computer Science Dep., Stanford Univ., Stanford, Calif., 1963.
	12	John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
	13	Zohar Manna , Stephen Ness , Jean Vuillemin, Inductive methods for proving properties of programs, Communications of the ACM, v.16 n.8, p.491-502, Aug. 1973 [doi>10.1145/355609.362336]
	14	James H. Morris, Jr., Another recursion induction principle, Communications of the ACM, v.14 n.5, p.351-354, May 1971 [doi>10.1145/362588.362598]

CITED BY 10

	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
	K. M. George , G. E. Hedrick, Expansions in the algebra of FP, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.1-8, February 1988, Atlanta, Georgia, United States
	Z. Zhang , K. M. George , G. E. Hedrick, A data flow approach to the evaluation of FP programs, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.586-592, February 1988, Atlanta, Georgia, United States
	Daniel Le Métayer, ACE: an automatic complexity evaluator, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.2, p.248-266, April 1988
	Walter Dosch , Bernhard Möller>, Busy and lazy FP with infinite objects, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.282-292, August 06-08, 1984, Austin, Texas, United States
	Debasish Banerjee, A methodology for synthesis of recursive functional programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.441-462, July 1987
	Joseph Y. Halpern , John H. Williams , Edward L. Wimmers, Completeness of rewrite rules and rewrite strategies for FP, Journal of the ACM (JACM), v.37 n.1, p.86-143, Jan. 1990
	Yingzhou Zhang , Baowen Xu, A survey of semantic description frameworks for programming languages, ACM SIGPLAN Notices, v.39 n.3, March 2004
	Joseph Y. Halpern , John H. Williams , Edward L. Wimmers , Timothy C. Winkler, Denotational semantics and rewrite rules for FP, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.108-120, January 14-16, 1985, New Orleans, Louisiana, United States
	Uday S. Reddy , Barat Jayaraman, Theory of linear equations applied to program transformation, Proceedings of the Eighth international joint conference on Artificial intelligence, p.10-16, August 08-12, 1983, Karlsruhe, West Germany