| M.Wand: Type inference for record concatenation and multiple inheritance, Proc. of the Fourth Annual Symposium on Logic in Computer Science, 1989. |
....and types can be easily integrated into the basic Quest system to model various programming aspects. For example, basic types can be added to model primitive values and their relations [Mitchell 84] record and variant types can be introduced to model object oriented programming [Cardelli 88, Wand 89, Cardelli Mitchell 89, Cook Hill Canning 90] and set types can be introduced to model relational data bases [Ohori 87] In all these cases, subtyping performs a major role. Many of these additional type constructions can however be encoded in a very small core system, which is the one we ....
....paper we do not need to model them directly (as already done in [Bruce Longo 89] since they can be syntactically encoded to a great extent. More precisely, we show how to encode the record calculus of [Cardelli Wegner 85] although we do not know yet how to encode the more powerful calculi of [Wand 89] and [Cardelli Mitchell 89] Moreover, we show how to encode the functional update problem discussed in [Cardelli Mitchell 89] this problem cannot be represented in the calculus of [Cardelli Wegner 85] In this section we discuss these encodings, and then we feel free to ignore records in the ....
M.Wand: Type inference for record concatenation and multiple inheritance, Proc. of the Fourth Annual Symposium on Logic in Computer Science, 1989.
....and types can be easily integrated into the basic Quest system to model various programming aspects. For example, basic types can be added to model primitive values and their relations [Mitchell 84] record and variant types can be introduced to model object oriented programming [Cardelli 88, Wand 89, Cardelli Mitchell 89, Cook Hill Canning 90] and set types can be introduced to model relational data bases [Ohori 87] In all these cases, subtyping performs a major role. Many of these additional type constructions can however be encoded in a very small core system, which is the one we ....
....do not need to model them directly (as already done in [Bruce Longo 89] since they can be syntactically encoded to a great extent. Page 18 More precisely, we show how to encode the record calculus of [Cardelli Wegner 85] although we do not know yet how to encode the more powerful calculi of [Wand 89] and [Cardelli Mitchell 89] Moreover, we show how to encode the functional update problem discussed in [Cardelli Mitchell 89] this problem cannot be represented in the calculus of [Cardelli Wegner 85] In this section we discuss these encodings, and then we feel free to ignore records in the ....
M.Wand: Type inference for record concatenation and multiple inheritance, Proc. of the Fourth Annual Symposium on Logic in Computer Science, 1989.
....and types can be easily integrated into the basic Quest system to model various programming aspects. For example, basic types can be added to model primitive values and their relations [Mitchell 84] record and variant types can be introduced to model object oriented programming [Cardelli 88, Wand 89, Cardelli Mitchell 89, Cook Hill Canning 90] and set types can be introduced to model relational data bases [Ohori 87] In all these cases, subtyping performs a major role. Many of these additional type constructions can however be encoded in a very small core system, which is the one we ....
....paper we do not need to model them directly (as already done in [Bruce Longo 89] since they can be syntactically encoded to a great extent. More precisely, we show how to encode the record calculus of [Cardelli Wegner 85] although we do not know yet how to encode the more powerful calculi of [Wand 89] and [Cardelli Mitchell 89] Moreover, we show how to encode the functional update problem discussed in [Cardelli Mitchell 89] this problem cannot be represented in the calculus of [Cardelli Wegner 85] In this section we discuss these encodings, and then we feel free to ignore records in the ....
M.Wand: Type inference for record concatenation and multiple inheritance, Proc. of the Fourth Annual Symposium on Logic in Computer Science, 1989.
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