Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. Lecture Notes in Computer Science, 526:112--130, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....separate equality attributes in our IL; a type admits equality if and only if the equality compiler is able to generate an equality operation for it. Our approach is related to the compilation of overloading in Haskell [28] and to the treatment of equality proposed by Gunter, Gunter and MacQueen [6]. The judgment Gamma eq con ; exp v expresses that Gamma exp v : con Thetacon Bool is the equality function for type con. These equality functions are the obvious structural equalities for immutable types (primitive equality functions at base types, componentwise equality for record ....

Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. Lecture Notes in Computer Science, 526:112--130, 1991.

....on some types only. These are the predefined types and the predefined type constructors (assuming equality on the argument types) except for function types. In addition, equality is predefined for reference types. This is superficially similar to the treatment of equality in Standard ML [GGM91] except for two important features of rapide. The first is that due to subtyping, we do not have to maintain a special category of equality types. Instead, types with equality are identified as subtypes of the type with equality operation (see, e.g. the example treatment of ordered types in ....

C.A. Gunter, E. Gunter, and D.B. MacQueen. An abstract interpretation of ML equality kinds. In Int'l Conf. Theor. Aspects of Computer Software, page ??, 1991.

....separate equality attributes in our IL; a type admits equality if and only if the equality compiler is able to generate an equality operation for it. Our approach is related to the compilation of overloading in Haskell [30] and to the treatment of equality proposed by Gunter, Gunter and MacQueen [6]. The judgment Gamma eq con ; exp v expresses that Gamma exp v : con Thetacon Bool is the equality function for type con. These equality functions are the obvious structural equalities for immutable types (primitive equality functions at base types, component wise equality for record ....

Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. LNCS 526, pages 112--130, 1991.

....separate equality attributes in our IL; a type admits equality if and only if the equality compiler is able to generate an equality operation for it. Our approach is related to the compilation of overloading in Haskell [28] and to the treatment of equality proposed by Gunter, Gunter and MacQueen [6]. The judgment Gamma eq con ; exp v expresses that Gamma exp v : con Thetacon Bool is the equality function for type con . These equality functions are the obvious structural equalities for immutable types (primitive equality 7 One possible alternative would be to add a polymorphic ....

Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. Lecture Notes in Computer Science, 526:112--130, 1991.

....Standard ML there is no way to declare a reference and omit the initial value. A declaration such as val n : int ref is not legal. We now begin to see that the imperative features of the language can have an impact of the type checking of programs. Carl and Elsa Gunter and Dave MacQueen write in [GGM91]: In the Definition of Standard ML, a unary type constructor Theta F is said to admit equality if t F is an equality type whenever the parameter t is. A constructed type t F admits equality only if both t and F admit equality. This extends to n ary type constructors in the obvious way. ....

Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 112-- 130. Springer-Verlag, September 1991.

....Standard ML there is no way to declare a reference and omit the initial value. A declaration such as val n : int ref is not legal. We now begin to see that the imperative features on the language can have an impact of the type checking of programs. Carl and Elsa Gunter and Dave MacQueen write in [GGM91]: In the Definition of Standard ML, a unary type constructor fl a F is said to admit equality if t F is an equality type whenever the parameter t is. A constructed type t F admits equality only if both t and F admit equality. This extends to n ary type constructors in the obvious way. ....

Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 112--130. Springer-Verlag, September 1991.

....tags, so even with a sophisticated garbage collector they can t be done away with. One alternative is to pass an equalitytest function along with every value of an equality type, but this is also quite costly[36] Finally, the treatment of equality types in Standard ML is irregular and incomplete[15]. The Definition categorizes type constructors as either equality or nonequality type constructors; but a more refined classification would more accurately specify the e#ects of the ref operator. Some types that structurally support equality are classified as nonequality types by the ....

Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen. An abstract interpretation for ML equality kinds. In Theoretical Aspects of Computer Software. Springer, September 1991.

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