A Framework for Point-free Program Transformation

Citation:
Cunha A, Pinto JS, Proença J.  2006.  A Framework for Point-free Program Transformation. Selected Papers of the 17th International Workshop on Implementation and Application of Functional Languages - IFL. 4015:1–18.

Tertiary Title:

LNCS

Date Presented:

September

Abstract:

The subject of this paper is functional program transformation in the so-called point-free style. By this we mean first translating programs to a form consisting only of categorically-inspired combinators, algebraic data types defined as fixed points of functors, and implicit recursion through the use of type-parameterized recursion patterns. This form is appropriate for reasoning about programs equationally, but difficult to actually use in practice for programming. In this paper we present a collection of libraries and tools developed at Minho with the aim of supporting the automatic conversion of programs to point-free (embedded in Haskell), their manipulation and rule-driven simplification, and the (limited) automatic application of fusion for program transformation.

Citation Key:

CunhaPintoProenca:06a

DOI:

10.1007/11964681_1

PreviewAttachmentSize
frapfpt.pdf259.02 KB