Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs

  • Pedro B. Vasconcelos
  • Kevin Hammond
Conference paper

DOI: 10.1007/978-3-540-27861-0_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3145)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Pedro B. Vasconcelos
    • 1
  • Kevin Hammond
    • 1
  1. 1.School of Computer ScienceUniversity of St AndrewsSt AndrewsUK

Personalised recommendations