Point-free program transformation

• Author(s): Cunha, Alcino ; Pinto, Jorge Sousa
• Date: 2004
• Persistent ID: http://hdl.handle.net/1822/842
• Origin: RepositóriUM - Universidade do Minho
• Subject(s): Program transformation; Functional programming; Program calculation
• Document Type: Report
• Language: English

Description

Functional programs are particularly well suited to formal manipulation by equational reasoning. In particular, it is straightforward to use calculational methods for program transformation. Well-known transformation techniques, like tupling or the introduction of accumulating parameters, can be implemented using calculation through the use of the fusion (or promotion) strategy. In this paper we revisit this transformation method, but, unlike most of the previous work on this subject, we adhere to a pure point-free calculus that emphasizes the advantages of equational reasoning. We focus on the accumulation strategy initially proposed by Bird, where the transformed programs are seen as higher-order folds calculated systematically from a specification. The machinery of the calculus is expanded with higher-order point-free operators that simplify the calculations. A substantial number of examples (both classic and new) are fully developed, and we introduce several shortcut optimization rules that capture typical transformation patterns.