Expansions in the algebra of FP

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Expansions in the algebra of FP

Full text

Pdf (676 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1988 ACM sixteenth annual conference on Computer science table of contents

Atlanta, Georgia, United States

Pages: 1 - 8

Year of Publication: 1988

ISBN:0-89791-260-8

Authors

K. M. George	Oklahoma State University, Department of Computing and Information Sciences, Stillwater, OK
G. E. Hedrick	Oklahoma State University, Department of Computing and Information Sciences, Stillwater, OK

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 6, Citation Count: 0

Additional Information:

abstract references 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/322609.322610 What is a DOI?

ABSTRACT

One of the advantages of using Backus' FP system for software development is the ability to reason about programs in the associated algebra of programs. In order to be able to use the algebra fully, it must be possible to obtain nonrecursive forms for recursive functions. Expansions provide this nonrecursive form. This paper presents several new expansion theorems along with examples of their use. A new method to find expansion based on object level reasoning is also presented.

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.

	BACK 78	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]
	BACK 81	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
	GEHE 86	K.M. George and G.E. Hedrick,Transformations in the Algebra of Functional Programs, Proceedings of the IEEE ICCL, Miami Beach, October, 1986.
	KALM 40	L. Kalmar,On the Possibility of Definition by Recursion, Acta Scientiarum Mathematicum, VoI. 9 (1940), pp. 227-232.
	MANN 74	Zohar Manna, Introduction to Mathematical Theory of Computation, McGraw-Hill, Inc., New York, NY, 1974
	WILL 82a	John H. Williams, On the Development of the Algebra of Functional Programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.4, p.733-757, Oct. 1982 [doi>10.1145/69622.357193]
	WILL 82b	J.H. Williams,Notes on the FP Style of Functional Programming, in Functional Programming and its Applications, ed., J. Darlington, P. Henderson and D.A. Turner, Cambridge University Press, London, 1982, pp. 73-101.