James William O'Toole Jr. Type Abstraction Rules for References: A comparison of four which have achieved notoriety. Technical Memo MIT/LCS/TM-390, Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, Massachusetts 02139, August 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Functional Encapsulation and Type Reconstruction in a.. - Gupta (1995) (2 citations) (Correct)
....in the literature follow this general framework [Dam85, Tof90, LG88, JG91, Wri92, TJ92] The various systems differ in their notion of a store abstraction and the amount of information propagated across function boundaries. An illustrative comparison of some of these systems is presented in [OJ91] First, we will briefly describe two such systems that are simple extensions of the original Hindley Milner type system and have been successfully used in practical programming languages. Then, we will describe two more recent type systems that are more complex but are much more powerful in ....
James William O'Toole Jr. Type Abstraction Rules for References: A comparison of four which have achieved notoriety. Technical Memo MIT/LCS/TM-390, Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, Massachusetts 02139, August 1991.
Standard ML Weak Polymorphism Can Be Sound - Greiner (1993) (8 citations) (Correct)
....A slightly different approach is given by Leroy [5] where type arrows are labelled with types that may occur in references. He also provides a comparison of this approach with some of these others. For a comparison of some of these systems to each other, see Wright [13] Also refer to O Toole [8] for a rough comparison of four systems, including MacQueen s. 4 In general, this approach appears to be more powerful than weak types, although existing systems are incomparable. Furthermore, the systems using this approach have simpler inference rules than those shown here for weak ....
James William O'Toole, Jr. Type Abstraction Rules for References: A Comparison of Four Which Have Achieved Notoriety. Technical report MIT--LCS--TM--390, MIT. 1989.
A Typed Approach to Layered Programming Language Design - Gupta (1994) (1 citation) (Correct)
....Many type systems in the literature follow this general framework [5, 25, 16, 11, 26, 24] The various systems differ in their notion of a store abstraction and the amount of information propagated across function boundaries. An illustrative comparisons of some of these systems is presented in [21]. We will briefly discuss two such systems which are simple extensions of the original Hindley Milner type system and have been used within practical programming languages. 2.2 Type System of Standard ML In Standard ML [18, 19] type variables are syntactically classified into two separate ....
James William O'Toole Jr. Type Abstraction Rules for References: A comparison of four which have achieved notoriety. Technical Memo MIT/LCS/TM-390, Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, Massachusetts 02139, August 1991.
Standard ML of New Jersey - Appel, MacQueen (1991) (152 citations) (Correct)
....variables can be generalized. The weak typing scheme is fairly subtle and has been prone to bugs, so it is important that it be formalized and proven sound (as the Tofte scheme has been [Tofte thesis] There are several people currently working on formalizing the treatment used in the compiler[17, 38]. The weak polymorphism scheme currently used in Standard ML of New Jersey is not regarded as the final word on polymorphism and references. It shares with the imperative type variable scheme the fault that weak polymorphism propagates more widely than necessary. Even purely internal and temporary ....
....inessential weak polymorphism is particularly annoying when it interferes with the matching of a signature specification merely because of the use of an imperative style within a function s definition. Such implementation choices should be invisible in the type. Research continues on this problem[17, 22, 38], but there is no satisfactory solution yet. The interface between the type checker and the parser is quite simple in most respects. There is only one entry point to the type checker, a function that is called to type check each value declaration at top level and within a structure. However, the ....
James William O'Toole Jr. Type abstraction rules for references: A comparison of four which have achieved noteriety. Technical Report 380, MIT Lab. for Computer Science, 1990.
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