Derek R. Dreyer, Robert Harper, and Karl Crary. Towards a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, Pittsburgh, PA, March 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Mixin Modules in a Call-By-Value Setting - Hirschowitz, Leroy (2002) (23 citations) (Correct)
....theory. Neither Ancona Zucca nor Vestergaard Wells attempt to control recursive definitions statically, performing on demand unwinding instead. Still, some care is required when unwinding definitions inside a structure, because of confluence problems [4] Recurslye modules in ML Crary et al. [10, 11] and Russo [18] extend the Stan dard ML module system with mutually recursive structures via a structure rec A = and B = binding. Like mixins, this construct addresses ML s cross module recursion problem; unlike mixins, it does not support late binding and incremental programming. The ....
D. Dreyer, K. Crary, and R. Harper. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, 2001.
Mixin Modules in a Call-By-Value Setting - Hirschowitz, Leroy (2002) (23 citations) (Correct)
....yielding a powerful theory. Neither Ancona Zucca nor Vestergaard Wells attempt to control recursive definitions statically, performing on demand unwinding instead. Still, some care is required when unwinding definitions inside a structure, because of confluence problems [4] Crary et al. [11, 12] and Russo [20] extend the Standard ML module system with mutually recursive structures via a structure rec binding. Like mixins, this construct addresses ML s cross module recursion problem; unlike mixins, it does not support late binding and incremental programming. The structure rec binding ....
....type definitions and declarations as components of mixins. While these type components account for most of the complexity of ML module typing, we are confident that we can extend to mixins the considerable body of type theoretic work already done for ML modules [16, 18] and recursive modules [11, 12]. Acknowledgements. We thank Elena Zucca and Davide Ancona for discussions, and Vincent Simonet for his technical advice on the typing rules for #B . ....
D. Dreyer, K. Crary, and R. Harper. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, 2001.
Mixin Modules in a Call-By-Value Setting - Hirschowitz, Leroy (2002) (23 citations) (Correct)
....powerful theory. Neither Ancona Zucca nor Vestergaard Wells attempt to control recursive de nitions statically, performing on demand unwinding instead. Still, some care is required when unwinding de nitions inside a structure, because of con uence problems [4] Recursive modules in ML Crary et al. [10, 11] and Russo [18] extend the Standard ML module system with mutually recursive structures via a structure rec A = and B = binding. Like mixins, this construct addresses ML s cross module recursion problem; unlike mixins, it does not support late binding and incremental programming. The ....
....support type de nitions and declarations as components of mixins. While these type components account for most of the complexity of ML module typing, we are con dent that we can extend to mixins the considerable body of type theoretic work already done for ML modules [15, 16] and recursive modules [10, 11]. ....
D. Dreyer, K. Crary, and R. Harper. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, 2001.
A Type System for Well-Founded Recursion - Dreyer, Harper, Crary (2003) (4 citations) Self-citation (Dreyer Harper Crary) (Correct)
No context found.
Derek R. Dreyer, Robert Harper, and Karl Crary. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, School of Computer Science, Carnegie Mellon University, March 2001.
Efficient Recursion in the Presence of Effects - Dreyer, Harper, Crary Self-citation (Dreyer Harper Crary) (Correct)
No context found.
Derek R. Dreyer, Robert Harper, and Karl Crary. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, School of Computer Science, Carnegie Mellon University, March 2001. 11
Rigid Mixin Modules - Hirschowitz (2003) (Correct)
No context found.
Derek R. Dreyer, Robert Harper, and Karl Crary. Towards a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, Pittsburgh, PA, March 2001.
Call-by-Value Mixin Modules - Reduction Semantics, Side.. - Hirschowitz, Leroy.. (Correct)
No context found.
D. R. Dreyer, R. Harper, and K. Crary. Towards a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, Pittsburgh, PA, Mar. 2001.
Call-by-Value Mixin Modules - Reduction Semantics, Side.. - Hirschowitz, Leroy.. (2004) (Correct)
No context found.
D. R. Dreyer, R. Harper, K. Crary. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, Pittsburgh, PA, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC