Type reconstruction for syntactic control of interference, part 2

Syntactic Control of Interference (SCI) [17] has long been studied asabasis for interference-free programming, with cleaner reasoning properties and semantics than traditional imperative languages. This paper improves upon Huang and Reddy's type inference system [7] for SCI-based languages in two signi cant ways. First, we eliminate the need for explicit coercion operators in terms. Second, we consider adding let-bound polymorphism, which appears to be nontrivial in the presence of interference control. SCI can be adapted to a wide variety of languages, and our techniques should be applicable to any such language with SCI-based interference control.