No CrossRef data available.
Article contents
Type sharing constraints and undecidability
Published online by Cambridge University Press: 01 March 2007
Abstract
Let 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 is undecidable. As a consequence, type sharing constraints are proved to be not always avoidable by constructive transformations.
- Type
- Article
- Information
- Copyright
- Copyright © Cambridge University Press 2007
Discussions
No Discussions have been published for this article.