Recursion and dynamic data-structures in bounded space: towards embedded ML programming

  • Authors:
  • John Hughes;Lars Pareto

  • Affiliations:
  • Department of Computing Science, Chalmers University/ S 412 96 Gö/teborg;Department of Computing Science, Chalmers University/ S 412 96 Gö/teborg

  • Venue:
  • Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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.