A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Histo- and dynamorphisms revisited
2013
Proceedings of the 9th ACM SIGPLAN workshop on Generic programming - WGP '13
Dynamic programming algorithms embody a widely used programming technique that optimizes recursively defined equations that have repeating subproblems. The standard solution uses arrays to share common results between successive steps, and while effective, this fails to exploit the structural properties present in these problems. Histomorphisms and dynamorphisms have been introduced to expresses such algorithms in terms of structured recursion schemes that leverage this structure. In this
doi:10.1145/2502488.2502496
dblp:conf/icfp/HinzeW13
fatcat:o7vaczc4mve4lczjl5ap4iewde