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.
Keywords
Get full access to this article
View all access options for this article.