A framework for point-free program transformation

Authors:
Alcino Cunha;Jorge Sousa Pinto;José Proença
Affiliations:
CCTC / Departamento de Informática, Universidade do Minho, Braga, Portugal;CCTC / Departamento de Informática, Universidade do Minho, Braga, Portugal;CCTC / Departamento de Informática, Universidade do Minho, Braga, Portugal
Venue:
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Year:
2005

Citing 10
Cited 9

The promotion and accumulation strategies in transformational programming

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)

Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Bananas in space: extending fold and unfold to exponential types

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Deriving structural hylomorphisms from recursive definitions

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Type Classes with Functional Dependencies

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Typed Combinators for Generic Traversal

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Calculating functional programs

Algebraic and coalgebraic methods in the mathematics of program construction
Point-free Program Transformation

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1

Strongly Typed Rewriting For Coupled Software Transformation

Electronic Notes in Theoretical Computer Science (ENTCS)
Transformation of structure-shy programs: applied to XPath queries and strategic functions

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Coupled Transformation of Schemas, Documents, Queries, and Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
Denotation by Transformation

Logic-Based Program Synthesis and Transformation
Constructing an optimisation phase using grammatical evolution

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Generic point-free lenses

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Algebraic Specialization of Generic Functions for Recursive Types

Electronic Notes in Theoretical Computer Science (ENTCS)
Transformation of structure-shy programs with application to XPath queries and strategic functions

Science of Computer Programming
A bottom-up approach to understand functional programs

Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.