Inferring cost equations for recursive, polymorphic and higher-order functional programs

PB Vasconcelos*, K Hammond

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

41 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationImplementation of Functional Languages
EditorsP Trinder, G Michaelson, R Pena
Place of PublicationBERLIN
PublisherSpringer-Verlag
Pages86-101
Number of pages16
ISBN (Print)3-540-23727-5
DOIs
Publication statusPublished - 2004
Event15th International Workshop on Implementation of Functional Languages - Edinburgh, United Kingdom
Duration: 8 Sept 200311 Sept 2003

Publication series

NameLECTURE NOTES IN COMPUTER SCIENCE
PublisherSPRINGER-VERLAG BERLIN
Volume3145
ISSN (Print)0302-9743

Conference

Conference15th International Workshop on Implementation of Functional Languages
Country/TerritoryUnited Kingdom
CityEdinburgh
Period8/09/0311/09/03

Fingerprint

Dive into the research topics of 'Inferring cost equations for recursive, polymorphic and higher-order functional programs'. Together they form a unique fingerprint.

Cite this