INFORMATICAInformatica0868-49520868-4952VUINF640310.3233/INF-1995-6403Research articleModular programming of recurrences: a comparison of two approaches✩ČyrasVytautasHaveraaenMagneDepartment of Informatics, Vilnius University, 2600 Vilnius, Naugarduko St. 24, LithuaniaInstitute of Mathematics and Informatics 2600 Vilnius, Akademijos St. 4, LithuaniaDepartment of Informatics, University of Bergen, Høyteknologisenteret, N-5020 Bergen, Norway

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.

0101199564397444

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.

recurrence relationloop program synthesisdata dependency grapharchitecture of software packagesprogram module specification