A type discipline for Program modules
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
ML for the working programmer
ACM Computing Surveys (CSUR)
The design and implementation of hierarchical software systems with reusable components
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the type structure of standard ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Using parameterized signatures to express modular structure
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using dependent types to express modular structure
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Definition of Standard ML
A Network Protocol Stack in Standard ML
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
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.