Judicael Courant. A module calculus enjoying the subject-reduction property. Research Report RR 96-30, LIP, 1996. Preliminary version.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....missing up to now is, on the one hand, a complete calculus for mixins equipped with a reduction semantics and, on the other, a more strict integration of our framework with the notions of type system and type checking. We plan to develop a calculus for mixins, analogously to what has been done in [11]; the calculus, again, has to be independent of the core language and sound w.r.t. the model. Notice that, by virtue of the results of this paper, it suffices to define a calculus involving only the primitive operators; the high level operators come for free. On the side of type checking we are ....

J. Courant. A module calculus enjoying the subject-reduction property. In TAPSOFT '97: Theory and Practice of Software Development, number 1214 in Lecture Notes in Computer Science. Springer Verlag, April 1997.

....like restrict . Anyway, the idea of defining a module system as a small language of its own constructed on top of the base language, on which as few as possible assumptions are made, is now becoming a standard approach, see, e.g. some recent work on type theoretic foundations of SML like modules [27, 32, 33, 28, 17, 18]. A paper which can be taken as representative of this point of view, summarized as a slogan in the title ( A modular module system ) is [33] whose aim is to give a constructive proof of the validity of the idea. To this end, it presents (the implementation by an SML functor of) a transformation ....

....framework of the notion of manifest types (types whose definition is visible in the module signature, see [32] would allow mixins to share type definitions. Finally, we plan to develop (within a common project) an integration of our mixin language with the functional module calculus defined in [18], enjoying the important property of subject reduction and guaranteeing true separate compilation. Another topic of particular relevance is the relation between mixins and parameterized modules, like SML functors. In this paper, we have already an interesting result showing that functional ....

J. Courant. A module calculus enjoying the subject-reduction property. In TLCA'97 - 3rd Intl. Conf. on Typed Lambda Calculi and Applications, number 1210 in Lecture Notes in Computer Science. Springer Verlag, 1997.

....topic has not been considered yet from the point of view of theoretical foundations. A different research direction consists in the development of a calculus for the MIX(FL) language enjoying properties like strong normalization and subject reduction, analogously to the module calculus defined in [10] and inspired by a variant of the SML module system. Acknowledgment The author is grateful to Elena Zucca who encouraged him to write this paper and suggested a number of improvements in earlier drafts. ....

J. Courant. A module calculus enjoying the subject-reduction property. To appear in Proc. TAPSOFT '97: Theory and Practice of Software Development, 1997.

....of the type of a module is needed in order to typecheck modules using it. Unfortunately, no proof of correctness was given for any of these system, thus preventing us to be sure their adaptation to a proof system would not lead to inconsistency. We gave one in a variant of these systems in [Cou96] However adaptation of these module systems to Pure Type Systems raises the problem of dealing with fi equivalence that appears in the conversion rule of PTS. In this paper, we give an adaptation of the system of [Cou96] to Pure Type Systems. This system applies to the LF logical framework, the ....

....not lead to inconsistency. We gave one in a variant of these systems in [Cou96] However adaptation of these module systems to Pure Type Systems raises the problem of dealing with fi equivalence that appears in the conversion rule of PTS. In this paper, we give an adaptation of the system of [Cou96] to Pure Type Systems. This system applies to the LF logical framework, the Calculus of Construction [CH88] the Calculus of Constructions extended with universes [Luo89] We do not deal with the problem of adding inductive types to these systems, but the addition of inductive types as firstclass ....

[Article contains additional citation context not shown here]

Judicael Courant. A module calculus enjoying the subject-reduction property. Research Report RR 96-30, LIP, 1996. Preliminary version.

....of the type of a module is needed in order to typecheck modules using it. Unfortunately, no proof of correctness was given for any of these system, thus preventing us to be sure their adaptation to a proof system would not lead to inconsistency. We gave one in a variant of these systems in [Cou96] However adaptation of these module systems to Pure Type Systems raises the problem of dealing with fi equivalence that appears in the conversion rule of PTS. In this paper, we give an adaptation of the system of [Cou96] to Pure Type Systems. This system applies to the LF logical framework, the ....

....not lead to inconsistency. We gave one in a variant of these systems in [Cou96] However adaptation of these module systems to Pure Type Systems raises the problem of dealing with fi equivalence that appears in the conversion rule of PTS. In this paper, we give an adaptation of the system of [Cou96] to Pure Type Systems. This system applies to the LF logical framework, the Calculus of Constructions [CH88] the Calculus of Constructions extended with universes [Luo89] We do not deal with the problem of adding inductive types to these systems, but the addition of inductive types as ....

[Article contains additional citation context not shown here]

Judicael Courant. A module calculus enjoying the subject-reduction property. Research Report RR 96-30, LIP, 1996. Preliminary version.

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