Recursion and dynamic data-structures in bounded space

John Hughes, Lars Pareto
1999 SIGPLAN notices  
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 TaIpin's region inference system to which the notion of sized types, of Hughes, Pareto and Sabry, has been added.
doi:10.1145/317765.317785 fatcat:wpdgyeabsrbifjswg43s7dzv5e