What is a recursive module? Export

@inproceedings{citeulike:4645, abstract = {A hierarchical module system is an effective tool for structuring large programs. Strictly hierarchical module systems impose an acyclic ordering on import dependencies among program units. This can impede modular programming by forcing mutually-dependent components to be consolidated into a single module. Recently there have been several proposals for module systems that admit cyclic dependencies, but it is not clear how these proposals relate to one another, nor how one might integrate them into an expressive module system such as that of ML.To address this question we provide a type-theoretic analysis of the notion of a recursive module in the context of a "phase-distinction" formalism for higher-order module systems. We extend this calculus with a recursive module mechanism and a new form of signature, called a recursively dependent signature , to support the definition of recursive modules. These extensions are justified by an interpretation in terms of more primitive language constructs. This interpretation may also serve as a guide for implementation.}, address = {New York, NY, USA}, author = {Crary, Karl and Harper, Robert and Puri, Sidd}, booktitle = {PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation}, citeulike-article-id = {4645}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=301641}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/301618.301641}, comment = {PLDIr \#3 (2009-11-03) で読んだ。}, doi = {10.1145/301618.301641}, isbn = {1-58113-094-5}, issn = {0362-1340}, keywords = {module-system}, location = {Atlanta, Georgia, United States}, month = {May}, number = {5}, pages = {50--63}, posted-at = {2009-11-06 00:07:04}, priority = {0}, publisher = {ACM}, title = {What is a recursive module?}, url = {http://dx.doi.org/10.1145/301618.301641}, volume = {34}, year = {1999} }

TY - CONF ID - citeulike:4645 L3 - citeulike-article-id:4645 N2 - A hierarchical module system is an effective tool for structuring large programs. Strictly hierarchical module systems impose an acyclic ordering on import dependencies among program units. This can impede modular programming by forcing mutually-dependent components to be consolidated into a single module. Recently there have been several proposals for module systems that admit cyclic dependencies, but it is not clear how these proposals relate to one another, nor how one might integrate them into an expressive module system such as that of ML.To address this question we provide a type-theoretic analysis of the notion of a recursive module in the context of a "phase-distinction" formalism for higher-order module systems. We extend this calculus with a recursive module mechanism and a new form of signature, called a recursively dependent signature , to support the definition of recursive modules. These extensions are justified by an interpretation in terms of more primitive language constructs. This interpretation may also serve as a guide for implementation. CY - Atlanta, Georgia, United States IS - 5 SN - 1-58113-094-5 AD - New York, NY, USA EP - 63 TI - What is a recursive module? PB - ACM VL - 34 T2 - PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation SP - 50 KW - module-system N1 - PLDIr #3 (2009-11-03) で読んだ。 AU - Crary, Karl AU - Harper, Robert AU - Puri, Sidd PY - 1999/05// UR - http://dx.doi.org/10.1145/301618.301641 ER -