Type reconstruction for syntactic control of interference. 2

Syntactic control of interference (SCI) (J.C. Reynolds, 1978) has long been studied as a basis for interference free programming, with cleaner reasoning properties and semantics than traditional imperative languages. The paper improves upon H. Huang and U.S. Reddy´s (1996) type inference system for SCI based languages in two significant 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