| Claudio V. Russo. Types for Modules. PhD thesis, Univ. of Edinburgh, 1998. |
....this work to prove consistency in the absence of confluence [5, 6] 5.4 ML style Modules vs. Types. Crary, Harper, and Puri describe how to extend the ML module system to deal with recursion [14] Earlier work to add first class modules (i.e. higher order functors) to ML includes that of Russo [40], Harper and Lillibridge [26, 33] and Leroy [32] Harper, Mitchell, and Moggi devised the phase distinction to show the decidability of type checking for the ML module system [27] Jones shows how to avoid much of the complexity of typing ML style modules via higher order (parametric) signatures ....
C. V. Russo. Types for Modules. PhD thesis, Univ. of Edinburgh, 1998.
....work on ML style modules has focused on typing issues. For ML style modules, relevant work includes that of Crary, Harper, and Puri in extending the ML module system to deal with recursion [CHP99] Earlier work to add first class modules (i.e. higher order functors) to ML includes that of Russo [Rus98], Harper and Lillibridge [HL94, Lil97] and Leroy [Ler94] An important work in proving the decidability of type checking for the ML module system was the work of Harper, Mitchell, and Moggi in reasoning about the phase distinction [HMM90] Our work will eventually have to deal with this issue. In ....
Claudio V. Russo. Types for Modules. PhD thesis, Univ. of Edinburgh, 1998.
No context found.
Claudio V. Russo. Types for Modules. PhD thesis, Univ. of Edinburgh, 1998.
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