A Fold for All Seasons

A Fold for All Seasons (1993)

Cached

Download Links

[cse.ogi.edu]
[cse.ogi.edu]

Other Repositories/Bibliography

DBLP

by Tim Sheard , Leonidas Fegaras

Venue:	IN PROC. CONFERENCE ON FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE
Citations:	107 - 15 self

Versions

Version History

Metadata Version 0

Datum	Value	Source
TITLE	A Fold for All Seasons	SVM HeaderParse 0.1
AUTHOR NAME	Tim Sheard	SVM HeaderParse 0.1
AUTHOR ADDR	19600 N.W. von Neumann Drive; Beaverton, OR 97006-1999	SVM HeaderParse 0.1
AUTHOR NAME	Leonidas Fegaras	SVM HeaderParse 0.1
AUTHOR ADDR	19600 N.W. von Neumann Drive; Beaverton, OR 97006-1999	SVM HeaderParse 0.1
ABSTRACT	Generic control operators, such as fold, can be generated from algebraic type definitions. The class of types to which these techniques are applicable is generalized to all algebraic types definable in languages such as Miranda and ML, i.e. mutually recursive sums-of-products with tuples and function types. Several other useful generic operators, also applicable to every type in this class, also are described. A normalization algorithm which automatically calculates improvements to programs expressed in a language based upon folds is described. It reduces programs, expressed using fold as the exclusive control operator, to a canonical form. Based upon a generic promotion theorem, the algorithm is facilitated by the explicit structure of fold programs rather than using an analysis phase to search for implicit structure. Canonical programs are minimal in the sense that they contain the fewest number of fold operations. Because of this property, the normalization algorithm has important applications in program transformation, optimization, and theorem proving. In addition a generic promotion theorem is identified for each of the other operators. It is hoped that these theorems can be the basis of normalization algorithms for the other operators as well.	SVM HeaderParse 0.1
CITATIONS	18 found	ParsCit 1.0