Dependency Analysis for Standard ML

Dependency Analysis for Standard ML (1998)

by Matthias Blume

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	7 - 2 self

Datum	Value	Source
TITLE	Dependency analysis for standard ML	INFERENCE
AUTHOR NAME	Matthias Blume	SVM HeaderParse 0.2
AUTHOR AFFIL	Princeton University	SVM HeaderParse 0.2
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. 1 Introduction For programs written in Standard ML [MTH90, MTHM97], the order of compilation matters. But the task of maintaining order within collections of sources can be tedious. Therefore, CM [Blu95], the compilation manager for Standard ML of New Jersey [AM91], o#ers automatic dependency analysis. CM provides a language for specifying the semantic structure of large pr...	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	ACM Transactions on Programming Languages and Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	812	INFERENCE
VOLUME	21	INFERENCE
CITATIONS	23 found	ParsCit 1.0