Abstract

Certain adaptations, that are usually performed manually by functional programmers are formalized by program transformations in this paper. We focus on adaptations to obtain a more reusable version of a program or a version needed for a special use case. The paper provides a few examples, namely propagation of additional parameters, introduction of monadic style, and symbolic rewriting. The corresponding transformations are specified by inference rules in the style of natural semantics. Preservation properties such as type and semantics preservation are discussed. The overall thesis of this paper is that suitable operator suites for automated adaptations and a corresponding transformational programming style can eventually be combined with other programming styles, such as polymorphic programming, modular programming, or the monadic style, in order to improve reusability of functional programs. ⋆ Partial support received from the Netherlands Organization for Scientific Research (NWO) under the Generation of Program Transformation Systems project

Citations

1224	Lectures on constructive functional programming - Bird - 1989
651	Notions of computation and monads - Moggi - 1991
235	The essence of compiling with continuations - Flanagan, Sabry, et al. - 1993
96	Applicative functors and fully transparent higher-order modules - Leroy - 1995
68	Rules and Strategies for Transforming Functional and Logic Programs - Pettorossi, Proietti - 1996
60	A programmer friendly modular definition of the semantics of java, in - Börger, Schulte - 1998
55	Mixin modules - Duggan, Sourelis - 1996
48	Representing layered monads - Filinski - 1999
35	Semantic Lego - Espinosa - 1995
30	Extensible denotational language specifications, in - Cartwright, Felleisen - 1994
30	Declarative aspect-oriented programming - Lammel - 1999
29	Theory and practice of action semantics - Mosses - 1996
4	How powerful are folding/unfolding transformations - Zhu - 1994
3	Subtyping and Inheritance for Inductive Types - Poll - 1997