Modular programming of recurrences: a comparison of two approaches
Volume 6, Issue 4 (1995): Special Issue on Information Systems and Software Systems Engineering, pp. 397–444
Pub. online: 1 January 1995
Type: Research Article
This paper extends the comparison of two approaches first contributed to the 6th NWPT in Aarhus, Denmark (Čyras and Haveraaen, 1994). The research was supported in part by the Research Council of Norway under the Nordic–Baltic scholarship programme, and in part by the University of Bergen.
Published
1 January 1995
1 January 1995
Abstract
We present two methods for expressing computations based on recurrence relations and discuss their relative merits. One method, the structural blanks approach, is built on top of traditional programming languages like Fortran or Pascal. It aims at program reuse and bases a certain architecture of software packages. The other method, the constructive recursive approach, is based on recursive relations over graphs.