A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf
.
Cost recurrences for DML programs
2001
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01
A cost recurrence describes an upper bound for the running time of a program in terms of the size of its input. Finding cost recurrences is a frequent intermediate step in complexity analysis, and this step requires an abstraction from data to data size. In this article, we use information contained in dependent types to achieve such an abstraction: Dependent ML (DML), a conservative extension of ML, provides dependent types that can be used to associate data with size information, thus
doi:10.1145/507663.507666
fatcat:r2r54rciovgzrk3la3hx4ys7oa