Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming

@inproceedings{citeulike:2361383, abstract = {We present a functional language with a type system such that well typed programs run within stated space-bounds. The language is a strict, first-order variant of ML with constructs for explicit storage management. The type system is a variant of Tofte and Talpin's region inference system to which the notion of sized types, of Hughes, Pareto and Sabry, has been added.}, author = {Hughes, John and Pareto, Lars }, booktitle = {International Conference on Functional Programming}, citeulike-article-id = {2361383}, keywords = {compilers, stack, types}, pages = {70--81}, posted-at = {2008-02-11 05:02:10}, priority = {5}, title = {Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming}, url = {http://citeseer.ist.psu.edu/hughes99recursion.html}, year = {1999} }

TY - CONF ID - citeulike:2361383 L3 - citeulike-article-id:2361383 TI - Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming T2 - International Conference on Functional Programming SP - 70 EP - 81 N2 - We present a functional language with a type system such that well typed programs run within stated space-bounds. The language is a strict, first-order variant of ML with constructs for explicit storage management. The type system is a variant of Tofte and Talpin's region inference system to which the notion of sized types, of Hughes, Pareto and Sabry, has been added. KW - compilers KW - stack KW - types AU - Hughes, John AU - Pareto, Lars PY - 1999/// UR - http://citeseer.ist.psu.edu/hughes99recursion.html ER -