Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
- Cite this paper as:
- Vasconcelos P.B., Hammond K. (2004) Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs. In: Trinder P., Michaelson G.J., Peña R. (eds) Implementation of Functional Languages. IFL 2003. Lecture Notes in Computer Science, vol 3145. Springer, Berlin, Heidelberg
This paper presents a type-based analysis for inferring size- and cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annotations or unusual syntax. Our type reconstruction algorithm is capable of inferring first-order cost equations for a non-trivial subset of higher-order, recursive and polymorphic functions. We illustrate the approach with reference to some standard examples of recursive programs.
Unable to display preview. Download preview PDF.