Prediction of linear memory usage for first-order functional programs

Brian Campbell

Prediction of linear memory usage for first-order functional programs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

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 language	English
Title of host publication	Proceedings of the Nineth Symposium on Trends in Functional Programming, TFP 2008, Nijmegen, The Netherlands, May 26-28, 2008.
Pages	1-16
Number of pages	16
Publication status	Published - 2008

MRG-Mobile Resource Guarantees
Sannella, D.
EU government bodies
1/01/02 → 31/12/04
Project: Research

Cite this

@inproceedings{8732407a2c624854b939731ee8366eea,

title = "Prediction of linear memory usage for first-order functional programs",

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.",

author = "Brian Campbell",

year = "2008",

language = "English",

pages = "1--16",

booktitle = "Proceedings of the Nineth Symposium on Trends in Functional Programming, TFP 2008, Nijmegen, The Netherlands, May 26-28, 2008.",

}

TY - GEN

T1 - Prediction of linear memory usage for first-order functional programs

AU - Campbell, Brian

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 1

EP - 16

BT - Proceedings of the Nineth Symposium on Trends in Functional Programming, TFP 2008, Nijmegen, The Netherlands, May 26-28, 2008.

ER -

Prediction of linear memory usage for first-order functional programs

Abstract / Description of output

Fingerprint

Projects

MRG-Mobile Resource Guarantees

Cite this