Programming with Data Dependencies: a Comparison of Two Approaches

Vytautas Cyras
Magne Haveraaen

In 6th NWPT, pages 112-126

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. The other method, the constructive recursive approach, is based on recursive relations over graphs.

Comments
Vilnius University, Lithuania and University of Bergen, Norway.

Available as PostScript, DVI.

BRICS WWW home page