Author:
FLUET MATTHEW,MORRISETT GREG
Abstract
Region-based type systems provide programmer control over memory management without sacrificing type-safety. However, the type systems for region-based languages, such as the ML-Kit or Cyclone, are relatively complicated, and proving their soundness is non-trivial. This paper shows that the complication is in principle unnecessary. In particular, we show that plain old parametric polymorphism, as found in Haskell, is all that is needed. We substantiate this claim by giving a type- and meaning-preserving translation from a variation of the region calculus of Tofte and Talpin to a monadic variant of System F with region primitives whose types and operations are inspired by (and generalize) the ST monad of Launchbury and Peyton Jones.
Publisher
Cambridge University Press (CUP)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Q# as a Quantum Algorithmic Language;Electronic Proceedings in Theoretical Computer Science;2023-11-16
2. Reference Capabilities for Flexible Memory Management;Proceedings of the ACM on Programming Languages;2023-10-16
3. Freer monads, more extensible effects;ACM SIGPLAN Notices;2016-01-28
4. Refined Environment Classifiers;Programming Languages and Systems;2016
5. Combinators for impure yet hygienic code generation;Science of Computer Programming;2015-11