Type sharing constraints and undecidability

Abstract

Abstract Let ${\cal A}$ be a set of modules and parameterized modules including type sharing constraint specifications. We prove that determining the set of the effective modules described by ${\cal A}$ is undecidable. As a consequence, type sharing constraints are proved to be not always avoidable by constructive transformations.