![]() |
CiteULike | ![]() |
pedagand's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Recursion and dynamic data-structures in bounded space: towards embedded ML programmingby: John Hughes, Lars Pareto
In ICFP '99: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming (1999), pp. 70-81.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe 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.
BibTeX record
RIS record