A Tutorial on the Universality and Expressiveness of Fold

Hutton, Graham (1999) A Tutorial on the Universality and Expressiveness of Fold. Journal of Functional Programming, 9 (4). pp. 355-372.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
187Kb

Abstract

In functional programming, fold is a standard operator that encapsulates a simple pattern of recursion for processing lists. This article is a tutorial on two key aspects of the fold operator for lists. First of all, we emphasize the use of the universal property of fold both as a proof principle that avoids the need for inductive proofs, and as a definition principle that guides the transformation of recursive functions into definitions using fold. Secondly, we show that even though the pattern of recursion encapsulated by fold is simple, in a language with tuples and functions as first-class values the fold operator has greater expressive power than might first be expected.

Item Type:Article
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:224
Deposited By:Hutton, Graham
Deposited On:26 Oct 2005
Last Modified:09 Oct 2007 16:50

Repository Staff Only: item control page