%0 Journal Article
%J Fundamenta Informaticae
%D 2005
%T Point-free Program Transformation
%A Alcino Cunha
%A Jorge Sousa Pinto
%I IOS Press
%N 4
%P 315–352
%V 66
%X <p>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.</p>
%> https://haslab.uminho.pt/sites/default/files/alcino/files/pfpt.pdf