867 search results - page 24 / 174 » On Two Forms of Structural Recursion |
208
Voted
Lecture Notes
"This course has two objectives. First (and obvious) is to teach programming.
Second is to present some fundamental principles of computer science,
especially algorithm desi...
110
click to vote
ICFP
2008
ACM
16 years 12 days ago
2008
ACM
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
118
Voted
COMBINATORICS
1998
15 years 4 days ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
111
Voted
AOSD
2010
ACM
15 years 7 months ago
2010
ACM
The development of complex software requires the implementation of functions over a variety of recursively defined data structures. The design (and modeling) of structures can it...
94
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...