E. R. Poulsen. Representation analysis for efficient implementation of polymorphism. Technical report, Department of Computer Science (DIKU), University of Copenhagen, Apr. 1993. Master Dissertation.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....operations that manipulate the values. Since operations are transformed instead of values, this technique places no restrictions on the representations that a value can have. Poulsen describes an extension of Leroy s approach that can be used to specialize more representations, such as lists [18]. An escape analysis is needed to determine whether a value s representation can be specialized. As with other restrict and eliminate techniques, this approach does not work in the presence of separate compilation. Collberg describes practical techniques for eliminating polymorphism that retain ....

E. R. Poulsen. Representation analysis for efficient implementation of polymorphism. Technical report, Department of Computer Science (DIKU), University of Copenhagen, Apr. 1993. Master Dissertation.

....3.45 z list (c) b) a) list fully boxed list simply boxed list flat list val z : real real) list = 4.51, 3.14) 4.51, 2.33) 7.81, 3. 45) Figure 2: Comparison of Various List Representations The main contributions of this paper are: ffl Among all the known coercion based approaches [19, 26, 27, 15, 32, 35], our scheme is the first to successfully solve the open problem on recursive and mutable types. ffl Unlike the type passing approaches [25, 14, 24, 33] our scheme requires little runtime type analysis, even for the heavily polymorphic programs. ffl Our scheme is very flexible because a ....

....the TIL compiler is made publicly available. 6 Related Work and Conclusions The main idea of our flexible representation analysis technique is to explore the use of runtime type information to support more efficient coercions and more powerful boxing schemes. Previous coercion based approaches [19, 26, 27, 15, 32, 35] do not take advantage of runtime type information, so they can only use full boxing as its canonical boxed form. On the other hand, previous type passing approaches [25, 14, 24, 33] do not box polymorphic objects, so they require extensive runtime type analysis and code manipulations. Most ....

[Article contains additional citation context not shown here]

E. Poulsen. Representation analysis for efficient implementation of polymorphism. Master's thesis, DIKU, University of Copenhagen, 1993.

....increased space and execution time overheads of the universal representations. 1.1 Coercion Implementations The problem with polymorphism stems from the assumption that viewing a polymorphic value as a monomorphic value should have no computational effect. Recent work by Leroy [30] and others [41, 24, 43] has suggested that the instantiation of a polymorphic value should correspond to a run time coercion from the universal representation to the appropriate specialized representation. At function types, this requires the dual coercion (for the function argument) that converts specialized ....

....constructors such as Prod or Tran that map types to types. A number of authors have considered problems pertaining to representation analysis in the presence of polymorphism. The boxing interpretation of polymorphism has been studied by Peyton Jones and Launchbury [29] by Leroy [30] by Poulsen [41], by Henglein and J rgensen [24] and by Shao [43] with the goal of minimizing the overhead of boxing and unboxing at run time. All but the first of these approaches involve copying coercions. Of a broadly similar nature is the work on soft type systems [3, 10, 23, 49, 53] that seek to improve ....

E. R. Poulsen. Representation analysis for efficient implementation of polymorphism. Technical report, Department of Computer Science (DIKU), University of Copenhagen, Apr. 1993. Master Dissertation.

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