Dependency analysis for Standard ML
- 1 July 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 21 (4), 790-812
- https://doi.org/10.1145/325478.325481
Abstract
Automatic dependency analysis is a useful addition to a system like CM, our compilation manager for Standard ML of New Jersey. It relieves the programmer from the tedious and error-prone task of having to specify compilation dependencies by hand and thereby makes its usage more user friendly. But dependency analysis is not easy, as the general problem for Standard ML is NP-complete. Therefore, CM has to impose certain restrictions on the programming language to recover tractability. We prove the NP-completeness result, discuss the restrictions on ML that are used by CM, and provide the resulting analysis algorithms.Keywords
This publication has 10 references indexed in Scilit:
- Hierarchical modularityACM Transactions on Programming Languages and Systems, 1999
- The Definition of Standard MLPublished by MIT Press ,1997
- Analysis and caching of dependenciesPublished by Association for Computing Machinery (ACM) ,1996
- An analysis of ML typabilityJournal of the ACM, 1994
- The cost of selective recompilation and environment processingACM Transactions on Software Engineering and Methodology, 1994
- Revised 4 report on the algorithmic language schemeACM SIGPLAN Lisp Pointers, 1991
- CMLPublished by Association for Computing Machinery (ACM) ,1991
- Deciding ML typability is complete for deterministic exponential timePublished by Association for Computing Machinery (ACM) ,1990
- The programming language oberonSoftware: Practice and Experience, 1988
- From modula to oberonSoftware: Practice and Experience, 1988