Expansions in the algebra of FP

Authors:
K. M. George;G. E. Hedrick
Affiliations:
Oklahoma State University, Department of Computing and Information Sciences, Stillwater, OK;Oklahoma State University, Department of Computing and Information Sciences, Stillwater, OK
Venue:
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Year:
1988

Citing 4
Cited 0

On the Development of the Algebra of Functional Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions

Proceedings of the International Colloquium on Formalization of Programming Concepts

Quantified Score

Hi-index	0.00

Visualization

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.