Recursion and dynamic data-structures in bounded space: Towards embedded ML programming
Proceedings of the fourth ACM SIGPLAN international conference on Functional …, 1999•dl.acm.org
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.
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.
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.
ACM Digital Library