Dreyer, D., Crary, K., and Harper, R. 2003. A type system for higher-order modules. In Thirtieth ACM Symposium on Principles of Programming Languages. New Orleans, Louisiana, 236--249.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....programs. One can imagine stronger theorems, relating type equality between two programs that share a common (DAG )prefix of module definitions, but their statements become rather elaborate. 5. Related work Modules and generativity There is an extensive literature on ML style modules, including [19, 21, 11, 17, 28, 7], much of it discussing subtle questions of generativity versus applicativity. To our knowledge, however, none deals with the inter program case. In [26] fresh type names are generated during call by value module reduction, with # binders that can extrude across distributed scope. This allows ....

D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proc. 30th POPL, New Orleans, pages 236--249, 2003.

....seem very restrictive. We believe these problems arise from the way that the lambda calculus is used for parameterization. There is also a type theoretic literature on higher order modules, largely associated with ML, but because this approach is remote from ours, we do not survey it here; see [6] and its references. Space precludes many details, including proofs, some de nitions, and further examples; see the full technical report [19] Parts of the paper assume familiarity with basics of category theory and algebraic speci cation (e.g. 17, 21] 2 Examples This section introduces ....

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules, 2002. Submitted for publication.

....assuming s : Set Int f , where f is a fresh (skolem) type constant replacing the existentially quanti ed f in the type of intSet 5 . By opening intSet explicitly we eliminate the existential quanti er on its type without compromising its type abstraction: bad = let open s = intSet in s. add 2 [1] error: Incompatible types f and [ where type variable f arises from open of absIntSet Writing to range over type and kind contexts, and to range over kind contexts, we may write the typing rule for 5 Haskell s existing monadic do notation also uses a binding construct whose ....

....abstract. Not only must record types be changed to parameterise over such types, but all uses of those record types must be similarly changed to encode the appropriate propagation of type information. This has long been used as a justi cation for the move to dependent sum based module systems [3, 1]. Hovever, we feel this will not be a problem in practice. After all, Haskell programmers have been getting by for years with a comparatively simple module system in which only top level type abstraction was possible. Our aim in this paper was to motivate each of our design decisions. Most of our ....

K. Crary, R. Harper, and D. Dreyer. A type system for higher-order modules. (To appear in POPL'02), Sept. 2001.

No context found.

Dreyer, D., Crary, K., and Harper, R. 2003. A type system for higher-order modules. In Thirtieth ACM Symposium on Principles of Programming Languages. New Orleans, Louisiana, 236--249.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In POPL '03.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Thirtieth ACM Symposium on Principles of Programming Languages, pages 236--249, New Orleans, Louisiana, January 2003.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In POPL '03.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. Technical Report CMU-CS-02-122, School of Computer Science, Carnegie Mellon University, March 2002.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In 2003.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In 2003.

....algorithm is closely based on Stone and Harper s algorithm [33] for type constructor equivalence in the presence of singleton kinds. Space considerations preclude further discussion of this algorithm here. Full details of all these algorithms and proofs appear in the companion technical report [7]. THEOREM 2.1 (SOUNDNESS) If # # then # # M : #. THEOREM 2.2 (COMPLETENESS) If # # M : # then # # and # # and # # #. Note that since the synthesis algorithm is deterministic, it follows from Theorem 2.2 that principal signatures exist. Finally, since our synthesis ....

....However, when it encounters an 1 .# 2 , it extracts the # 2 component (the elaborator s invariants ensure that it always can do so) looking for the expected functor. Space considerations preclude further details of the elaboration algorithm, which appear in the companion technical report [7]. In a sense, the elaborator solves the avoidance problem by introducing existential signatures to serve in place of the non existent minimal supersignatures not mentioning a variable. In light of this, a natural question is whether the need for an elaborator could be eliminated by making ....

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules (expanded version). Technical Report CMU-CS-02-122R, School of Computer Science, Carnegie Mellon University, December 2002.

....algorithm is closely based on Stone and Harper s algorithm [33] for type constructor equivalence in the presence of singleton kinds. Space considerations preclude further discussion of this algorithm here. Full details of all these algorithms and proofs appear in the companion technical report [7]. THEOREM 2.1 (SOUNDNESS) If G s then G k M : s. THEOREM 2.2 (COMPLETENESS) If G k M : s then G s and G s and k # k. Note that since the synthesis algorithm is deterministic, it follows from Theorem 2.2 that principal signatures exist. Finally, since our synthesis ....

....However, when it encounters an 1 .s 2 , it extracts the s 2 component (the elaborator s invariants ensure that it always can do so) looking for the expected functor. Space considerations preclude further details of the elaboration algorithm, which appear in the companion technical report [7]. 9 In a sense, the elaborator solves the avoidance problem by introducing existential signatures to serve in place of the non existent minimal supersignatures not mentioning a variable. In light of this, a natural question is whether the need for an elaborator could be eliminated by making ....

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules (expanded version). Technical Report CMU-CS-02-122R, School of Computer Science, Carnegie Mellon University, December 2002.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A Type System for Higher-Order Modules. Proc. Principles of Programming Languages, New Orleans, Louisiana, January 2003.

No context found.

D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proceedings of the Thirtieth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 236--249. ACM Press, 2003.

No context found.

D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proc. 30th POPL, New Orleans, LA, pages 236--249, 2003. http://www-2.cs.cmu.edu/rwh/ papers.htm.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 236--249, 2003.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Proc. 30th POPL, New Orleans, LA, pages 236--249, 2003.

No context found.

D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 236--249. ACM Press, 2003.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 236--249, 2003.

No context found.

D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proceedings of the Thirtieth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 236--249. ACM Press, 2003.

No context found.

Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Proc. 30th POPL, New Orleans, pages 236--249, 2003.

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