Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11964681_1 | IFL |
Keywords | Field | DocType |
algebraic data type,functional program transformation,programs equationally,type-parameterized recursion pattern,point-free program transformation,program transformation,implicit recursion,automatic conversion,automatic application,categorically-inspired combinators,so-called point-free style,functional programming,fixed point,data type | Programming language,Program transformation,Functional programming,Computer science,Combinatory logic,Theoretical computer science,Algebraic data type,Data type,Haskell,Recursion,Automatic programming | Conference |
Volume | ISSN | ISBN |
4015 | 0302-9743 | 3-540-69174-X |
Citations | PageRank | References |
8 | 0.53 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alcino Cunha | 1 | 298 | 27.55 |
| Jorge Sousa Pinto | 2 | 160 | 23.19 |
| José Proença | 3 | 16 | 1.32 |