Prediction of linear memory usage for first-order functional programs

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

Abstract

Hofmann and Jost have presented a type inference system for a pure first-order functional language which uses linear programming to give linear upper bounds on heap memory usage with respect to the input size. We present an extended analysis which infers bounds for heap and stack space requirements, and which uses more expressive post-evaluation bounds to model a common pattern of stack space use.
Original languageEnglish
Title of host publicationProceedings of the Nineth Symposium on Trends in Functional Programming, TFP 2008, Nijmegen, The Netherlands, May 26-28, 2008.
Pages1-16
Number of pages16
Publication statusPublished - 2008

Fingerprint Dive into the research topics of 'Prediction of linear memory usage for first-order functional programs'. Together they form a unique fingerprint.

Cite this