Download:
|
by Vytautas Cyras, Magne Haveraaen
The 6th Nordic Workshop on Program Theory, NWPT6. Aarhus
http://www.brics.dk/BRICS/NS/94/6/NWPT6/Abs/NWPT6-Abs/../../CH/NWPT6-CH.ps.gz
Add To MetaCart
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. 1
Citations
|
136
|
The organization of computations for uniform recurrence equations
– Karp, Miller, et al.
- 1967
|
|
45
|
Crystal: theory and pragmatics of generating efficient parallel code
– Chen, Choo, et al.
- 1991
|
|
25
|
Program Correctness over Abstract Data Types, with Error-State Semantics
– Tucker, Zucker
- 1988
|
|
1
|
Loop synthesis on structural data in program packages
– Cyras
- 1983
|
|
1
|
Lomonosov Moscow State University, Faculty of Numerical Mathematics and Cybernetics, Thesis (avtoreferat kandidata fiziko-matematicheskix nauk
– V
- 1984
|
|
1
|
Chiras: "Synthesis of programs on data structures
– Greshnev, Lyubimskii, et al.
- 1986
|
|
1
|
program synthesis using array traversing modules. Forschungsberichte Kunstliche Intelligenz, Report FKI-93-88, August 1988, Technische Universitat Munchen, Institut fur Informatik, 25 p. Also
– Loop
- 1993
|
|
1
|
Lyubimskii: "Issues of automatic programming
– Z
- 1960
|
|
1
|
Zadykhailo: "The organisation of a cyclical computing process using a parametric representation of special form
– B
- 1963
|