X. Leroy. Unboxed objects and polymorphic typing. In ACM Symp. on Principles of Programming Languages, 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a uniform representation: a machine word. If an object is too large to fit into a word, then it is boxed by placing it in memory and using a pointer in its place. Unfortunately, the overheads of using a boxed representation are considerable. Previous research, notably the coercion work of Leroy [8] which was also implemented in SML NJ [23] had tried to avoid these overheads. However, Leroy s technique did not apply to recursive or imperative data structures (i.e. lists, trees, and arrays) In a paper presented the previous year, Harper and Morrisett suggested a new approach to compiling ....

X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, Jan. 1992.

....[7] One strategy of utilizing types obtained by program analysis is to adopt conversion interpretation of the subtyping. For example, it is possible to choose an optimized representation of values based on types and to insert conversion functions as type directed unboxing of polymorphic languages [8]. In order to adopt this compilation method we need to show that the conversion interpretation is safe with respect to performance. The results in this paper ensure safety with respect to execution time and stack space. Both the safety proofs on execution time and stack space are based on the ....

....in this paper ensure safety with respect to execution time and stack space. Both the safety proofs on execution time and stack space are based on the method of logical relations. The method of logical relations has been used for correctness proofs of many type directed program transformations [8, 14, 12] and was extended to prove time safety of unboxing by Minamide and Garrigue [11] One motivation of this work is to show that the method of logical relations can be extended to prove safety with respect to stack space. The structure of the proof we obtained for stack space is almost the same as ....

[Article contains additional citation context not shown here]

X. Leroy. Unboxed objects and polymorphic typing. In the 19th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 177--188, 1992.

....on the structure of another constructor. Thus, Typerec Int is equivalent to Int if = Int , and 1 2 (Typerec 1 Int ) Typerec 2 Int ) if = 1 2 . Typical applications of Typerec include type directed optimizations like automatic boxing and unboxing [18], array attening, and automatic marshaling [10] Using phantom types, we can simulate Typerec as follows: data Typerec = T Int with = Int Without the decomposition rule, this form of Typerec would have limited usefulness. Consider as a simple example the following type function de ....

Xaver Leroy. Unboxed objects and polymorphic typing. In Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 177-188. ACM Press, 1992.

....in the implementation of many languages, such as Lisp, Scheme, Smalltalk, and ML. It is a natural choice for these languages since it can facilitate garbage collection as well, but it has also contributed to their reputation for poor efficiency. The idea of coercion originates with Leroy [24], who proposed it as a way of improving the performance of monomorphic code in ML. The boxing transformation is more complicated in ML, since it is possible for a function to receive, for instance, a tuple of polymorphic values from which it extracts one; for this reason, the boxing must often be ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 177--188. ACM Press, 1992.

....in a separate assembly process. Some HOT module systems fail to scale essential features of the core language to modules, which re stricts the ways that modules can be defined, e.g. ML 1 does This research was partially supported by a NSF Graduate Research Fellowship, NSF grants CCI 9619756, CDA 9713032, and CCR 9708957, and a Texas ATP grant. ML stands for SML or CAML. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee proded that copies are not made or distributed for profit or commercial advantage end ....

....not made or distributed for profit or commercial advantage end that copies beer this notice and the full citation o1 the flrat page. To copy otherwise, to republish, to poet on servers or to , redistribute to lists. requires prior specific permission and or a fee. SIGPLAN 98 Montreal. Canada 1998 ACM 0.89791 987 4 98 0006. 6.00 not support mutually recursive procedure and type definitions at the module level. Finally, few HOT module lan guages handle dynamic program construction and dynamic linking, which are needed for programs with some assembly required, e.g. web based applets. ....

[Article contains additional citation context not shown here]

LEROY, X. Unboxed objects and polymorphic typing. In Proc. A CM Symposium on Principles of Program- ming Languages (1992), pp. 177-188.

....of function arguments and the complementary optimisations which are based on knowing that certain expressions will already have been evaluated. op is in many respects similar to languages with explicit boxed and unboxed types presented by Peyton Jones and Launchbury in [PJL91] and by Leroy in [Ler92], and indeed many of the same issues arise in the optimisation of data representations (passing Of course, this is just the sort of situation in which one might hope that writing the compiler itself in a lazy language might alleviate the problem, but one can hardly expect to get exactly the ....

....de ning the space of theoretically valid polyvariant translations. It is not yet clear how many di erent analyses and optimisations can be presented using these ideas, but there are already a number of closely related pieces of work. One of these is Leroy s work on boxing optimisations for ML [Ler92], which we have already mentioned, and another is Schellinx s work on decoration strategies for translating conventional logic into linear logic [Sch94] The latter discusses improving the Girard translation so as to introduce fewer types, which is very similar to what we have done in this ....

X. Leroy. Unboxed objects and polymorphic typing. In Proceedings of the 19th Symposium on the Principles of Programming Languages, pages 177-188. ACM, 1992.

....in rept z 1000 (2a) let foo x y = if y 0 then foo (id x) y 1) else unbox int x y in foo z 10 (2b) let foo x y = if y 0 then foo (unbox int (id (box int x) y 1) else x y in foo (unbox int z) 10 Fig. 1. Examples of box unbox cycles and loss of box sharing devoted to the first question [12, 17, 10, 11, 8], but much fewer have addressed the second one (Peterson addresses the problem in [15] but does not discuss interprocedural issues and Henglein Jrgensen touch on it in [11] Most often, however, that question is implicitly answered by all variables that the present method finds legal to unbox . ....

....more fully in the author s PhD thesis [4] At least if local common subexpression elimination is applied and no variable letbound to a producer is free in a lambda abstraction. The compiler does not support floating point numbers; the only representations are box and int. In contrast to e.g. [12, 17], unboxed objects can be stored in data structures, even in fields with polymorphic type. This is implemented as follows: A heap cell consists of a header word, which is a pointer to a statically allocated descriptor containing the information used by the garbage collector, followed by pointer and ....

[Article contains additional citation context not shown here]

Xavier Leroy. Unboxed objects and polymorphic typing. In Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 177--188, Albequerque, New Mexico, January 1992.

....and pointer types. Value types describe the unboxed stack allocated form of a class. The box and unbox instructions coerce between stack and heap forms of a class. Types for boxed and unboxed non strict data structures [PL91] and automatic type based coercions between boxed and unboxed forms [Ler92] have been studied previously. Other approaches include region analysis [TT97] and escape analysis [PG92] Still, the idea and formalization of types to di erentiate between unboxed and boxed forms of class based objects appears to be new. Pointer types describe pointers to either stack or ....

X. Leroy. Unboxed objects and polymorphic typing. In 19th ACM SIGPLAN{SIGACT Symposium on Principles of Programming Languages, pages 177-188. ACM Press, 1992.

....to a real world language like C, bringing to it both the expressiveness of polymorphism as well as a rigorous characterization of the behavior of well typed programs. Future work on Polymorphic C includes the development of ecient implementations of polymorphism (perhaps using the work of [13,18,10]) and the extension of the language to include other features of C, especially structures. More precisely, allocating variables and arrays on a stack in Polymorphic C (or in any language with or that uni es arrays and pointers) causes the type preservation property to fail. 26 ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages, pages 177{ 188, New York, 1992. ACM.

....Closed units in Unit c can be compiled separately in the same way as closed functors in ML. When compiling a unit, imported types are obviously not yet determined and thus have unknown representations. Hence, expressions involving imported types must be compiled like polymorphic functions in ML [52, 81], as suggested by the encoding of polymorphic functions in Section 3.28. Otherwise, the restrictions implied by a unit s interface allow inter procedural optimizations within the unit (such as 61 definitions = type defn datatype defn value defn type defn = type t : oe depends ....

Leroy, X. Unboxed objects and polymorphic typing. In Proc. ACM Symposium on Principles of Programming Languages, pages 177--188, Janurary 1992.

....tradeoff, which the language has resolved in favor of abstraction. But perhaps it is possible to pay for the abstraction only where abstraction is actually used. Xavier Leroy has recently pointed out that it is not necessary to represent every variable in one word, just polymorphic variables [21]. The type checker can identify those places where nonpolymorphic values are passed to polymorphic variables, and vice versa. Then the compiler can choose specialized representations, just as languages of the Algol family do, for nonpolymorphic variables. Then, to the extent that an ML program ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Nineteenth Annual ACM Symp. on Principles of Prog. Languages, pages 177--188, New York, January 1992. ACM Press.

....type inference annotates polymorphic functions with universally quantified types and annotates function applications with the simple types to which the polymorphic types are instantiated. The compiler uses the type information to select e#cient data representations and to minimize boxing coercions [17]. The SML NJ compiler also uses minimal typing derivations [8] to reduce boxing coercions for let polymorphic definitions. The compiler uses a simply typed representation in later stages of the compiler. The Glasgow Haskell Compiler (GHC) 20] also uses a variant of System F. In GHC, type ....

X. Leroy. Unboxed objects and polymorphic typing. In Conf. Rec. 19th Ann. ACM Symp. Princ. of Prog. Langs., pp. 177--188. ACM, 1992.

....Modules language and it is not clear at the moment how functors may be compiled separately in a region based compiler. As an alternative to separate compilation of functors, functors may be unfolded (specialized) for every application [Els95] Third, different analyses such as box unbox analysis [Ler92,HJ94] may be implemented to increase the quality of the generated code. Finally, there are many phases of the compiler for which more efficient algorithms need to be applied for the compiler to be more efficient. Though the region based compiler described in this paper is not competitive to some other ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Principles of Programming Languages, pages 177--188, 1992.

.... of a polymorphic function or method are compiled for each type at which the polymorphic routine is used [CU89, Ble93, Jon94, PC95] The cost of polymorphism can be isolated to uses of polymorphic functions by wrapping them in boxing coercions that are determined by the instantiated types [PJL91, Ler92, HJ94] But boxing coercions introduce new problems they imply copying and coercions that are expensive for compound data and recursive functions and that are semantically incorrect for mutable data structures[Mor95] An alternative is to use dynamic type dispatch to coerce a function to a ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Conf. Rec. 19th Ann. ACM Symp. Princ. of Prog. Langs., pages 177--188. ACM, 1992.

.... the language of properties is found by adding annotations to type constructors (we do not consider our analysis an instance of annotated types due to the intersection) Examples of Church style analyses are: binding time analysis [23,12,5] strictness analysis [16,17,33,14,3] boxing analysis [18,11,15], totality analysis [28,29] and ow analysis [8,21,6] E ect systems also belong to this category [19,31] In Curry style analysis, the analysis does not make use of the underlying type structure. This often makes the analysis applicable to untyped languages but fails to exploit the structural ....

X. Leroy. Unboxed objects and polymorphic typing. In Proc. 19th Annual ACM SIGPLAN{SIGACT Symposium on Principles of Programmin gLanguages (POPL), Albuquerque, New Mexico, pages 177-188. ACM Press, Jan. 1992.

....compilers. That work forms a background for the techniques described later in this thesis. 2. 4 Related Work This thesis is largely based on combining the work that has been done on compiler optimizations for object oriented languages [1, 28, 27, 28, 36, 37, 55, 64] functional languages [42, 54, 56, 66, 68], and compilers for vector and parallel machines [40, 48, 69] as 16 well as some techniques from classical scalar compilers [14, 30] The unique paradigm compiling for the Internet that Java has imposed on compiler research has allowed us to explore these techniques, modify, extend and apply ....

....contained objects, while 17 our technique also converts objects into local variables, essentially changing heap to stack allocation, which results in a much better performance. Functional Languages A significant amount of work in functional languages community has been done on unboxing. Leroy [56] introduces new constructs to core ML language: wrap and unwrap, which are inserted in the code to handle boxing and unboxing of the objects. To our knowledge, this thesis is the first work to apply a similar technique to a non functional language. Our technique is also more complex, since it ....

[Article contains additional citation context not shown here]

Xavier Leroy. Unboxed objects and polymorphic typing. In Conference Record of the Nineteenth ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages, pages 177--188, January 1992.

.... for taking the tail of a list: the newly constructed new version list must be translated back to an old version list before it is returned (since the client of the operation expects to be returned an old version list) This is related to the problems of using coercions to implement polymorphism [38], that in turn motivated work on intensional polymorphism [31, 49, 51] 2. Second, this translation will often be unnecessary. For example, suppose a generic hash table module was instantiated with the old version type, and the table now contains several old version values. After the hot swap, ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Proceedings of ACM Symposium on Principles of Programming Languages, pages 177--188. ACM Press, 1992.

....hierarchy and hence serves as a polymorphic representation. In order to use such a class with primitive element types such as integer, however, it is necessary to box the 2 Object based stack Generic stack class Stack private object[ store; private int size; public Stack( store=new object[10]; size=0; public void Push(object x) if (size =store.Size) object[ tmp = new object[size 2] Array.Copy(store,tmp,size) store = tmp; store[size ] x; public object Pop( return store[ size] public static void Main( Stack x = new Stack( x.Push(17) ....

....store = tmp; store[size ] x; public object Pop( return store[ size] public static void Main( Stack x = new Stack( x.Push(17) Console.WriteLine( int) x. Pop( 17) class Stack T private T[ store; private int size; public Stack( store=new T[10]; size=0; public void Push(T x) if (size =store.Size) T[ tmp = new T[size 2] Array.Copy(store,tmp,size) store = tmp; store[size ] x; public T Pop( return store[ size] public static void Main( Stack int x = new Stack int ( x.Push(17) ....

[Article contains additional citation context not shown here]

X. Leroy. Unboxed objects and polymorphic typing. In 19th Annual ACM Symposium on Principles of Programming Languages, pages 177--188, 1992.

....to CIL code. 6 It can also optionally emit generic code unchanged to run on a CLR with generics implemented natively. The translating implementations currently provided or planned for ILX are: Implementation by erasure to the universal representation System.Object, inserting box unbox [18] instructions where necessary, and with loss of exact runtime type semantics; A similar implementation that code expands with respect to two representations (Object and int32) An implementation that uses runtime reflection to generate new classes as needed (this is work in progress) 5.2 ....

X. Leroy. Unboxed objects and polymorphic typing. In 19th Annual ACM Symposium on Principles of Programming Languages, pages 177--188. ACM, 1992.

....do not appear to be organized around the principle of focusing compilation on recursive functions or loops. The SML NJ compiler [4, 51] is a state of the art compiler for functional languages. It uses a type based data representation analysis, which attempts to keep values unboxed when possible [32, 51]. It has a sophisticated global optimization phase, which does inlining, j reduction, uncurrying, constant folding, hoisting, and dead code elimination. However, this phase does not use information on program structure, such as nesting of recursive functions. It has a sophisticated ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Proceedings of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 177--188, January 1992.

.... solutions to this problem have been proposed but require, either that the language is extended to deal explicitly with boxed unboxed representations as in [18] or that we use a more sophisticated type system to discover where coercions between boxed and unboxed representations are required as in [12, 13]. This section describes a new approach to these problems, avoiding the need for uniform boxed representations by generating specialized versions of polymorphic functions. Obviously, this fits in very closely with the work in the first part of the paper; indeed, we show how this can be described ....

X. Leroy. Unboxed objects and polymorphic typing. In ACM Principles of Programming Languages, New York, January 1992.

....on the ecient implementation of polymorphic languages using explicit type information. Examples include a polymorphic unboxed calculus [Ohori and Takamizawa 1995] which specialize polymorphic functions according to the size information obtained by type inference, mixed representation optimization [Leroy 1992] by inserting appropriate box unbox coercions guided by type information, tag free garbage collection [Tolmach 1994] by translating a raw term to an explicitly typed second order term, specialization of Haskell type classes [Wadler and Blott 1989] using type information [Hall et al. 1994; Peterson ....

Leroy, X. 1992. Unboxed objects and polymorphic typing. In Procceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 177-188.

....polymorphic operations directly using less ecient data representation and costly run time analysis. There have been some e orts to reduce the run time cost due to ineciency of data representation required by polymorphic primitives, including representation optimization for polymorphic bindings [34, 20] and ecient data representation for associative access for labeled records [35] These methods show some positive results, but polymorphic primitives remain inecient compared to the corresponding specialized monomorphic operations. To develop an ecient polymorphic language suitable for serious ....

X. Leroy. Unboxed objects and polymorphic typing. In Proc. ACM Symposium on Principles of Programming Languages, pages 177-188, 1992.

....type information at run time. Peyton Jones and Launchbury [22] have proposed a calculus where boxed and unboxed objects are explicitly manipulated and polymorphism is restricted to boxed objects. They have proposed several optimization strategies by source to source program translation. Leroy [14] proposed a systematic method to transform ML into a calculus similar to that of Peyton Jones and Launchbury. His strategy is to keep objects unboxed as long as its type is statically determined. To combine this strategy with polymor AN UNBOXED OPERATIONAL SEMANTICS FOR ML POLYMORPHISM 3 phic ....

....strategy the compilation preserves the order of evaluation. 6. Related Works This work was motivated by the work of Morrison et al. 17] for an ad hoc approach to implement polymorphic function, and a method for mixed representation optimization of Peyton Jones and Launchbury [22] and of Leroy [14] (see also [10, 24] for further re nements. As already mentioned in the introduction, the new contribution of our work compared to these works is a method to specialize polymorphic functions themselves without resorting to run time type analysis. It does not require coercion functions between ....

X. Leroy. Unboxed objects and polymorphic typing. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 177-188. ACM, New York, 1992.

....function f without physically transmitting f . We extend this encoding decoding to arbitrarily higher monotypes by inductively applying the above described process. This extension is a special case of a general technique of lifting properties on base types to higher types. For example, Leroy s [Ler92] algorithm for eliminating redundant pointer creation in a functional calculus has a similar structure. The process of generating encoder and decoder for higher order functions can also be regarded as a systematic re nement of an ad hoc method of stub generation for remote procedure call ....

X. Leroy. Unboxed objects and polymorphic typing. In Proceedings of ACM Symposium on Principles of Programming Languages, pages 177-188, 1992.

....for values held in polymorphic variables. That way the monomorphic parts of the program can be very efficient, with a price paid only when polymorphic functions are called. Cardelli describes a fully boxed implementation of ML [Cardelli 84] Leroy describes coercion based representation analysis [Leroy 92] and Shao and Appel describe a variant that does recursive wrapping only when necessary [Shao 95] Another approach to the implementation of polymorphism is to pass to a polymorphic function a description of the type of polymorphic variables. Harper and Morrisett describe type passing style ....

X. Leroy, "Unboxed Objects and Polymorphic Typing", 19 th ACM Symposium on Principles of Programming Languages, 1992, pages 177-188.

....verified by a type checker. In practice, this technique has been invaluable for debugging new transformations and optimizations [Tarditi et al. 1996; Morrisett et al. 1996] Today a small number of compilers work with typed intermediate languages in order to realize some or all of these benefits [Leroy 1992; Peyton Jones et al. 1993; Birkedal et al. 1993; Tarditi et al. 1996; Lindholm and Yellin 1996; Shao 1997; Dimock et al. 1997] However, in all of these compilers, there is a conceptual line where types are lost. For instance, the TIL ML compiler preserves type information through approximately ....

Leroy, X. 1992. Unboxed objects and polymorphic typing. In 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, USA, 177-- 188.

....invariant. The simplest way to satisfy this invariant is to adopt a uniform representation assumption (URA) under which the representation of any value is determined by the type constructor of its type and all values are accessed through a xed size interface (usually achieved by boxing [24]) The URA simpli es the task of compiler writing by using a type system as a crude form of ow analysis. Type soundness guarantees that a value reaching an elimination form for a type constructor must have been de ned at an introduction form for that constructor. If the uniform representations ....

X. Leroy. Unboxed objects and polymorphic typing. In Conf. Rec. 19th Ann. ACM Symp. Princ. of Prog. Langs., pp. 177-188, 1992.

....and pointer types. Value types describe the unboxed stack allocated form of a class. The box and unbox instructions coerce between stack and heap forms of a class. Types for boxed and unboxed non strict data structures [PL91] and automatic type based coercions between boxed and unboxed forms [Ler92] have been studied previously. Other approaches include region analysis [TT97] and escape analysis [PG92] Still, the idea and formal26 ization of types to di erentiate between unboxed and boxed forms of class based objects appears to be new. Pointer types describe pointers to either stack or ....

X. Leroy. Unboxed objects and polymorphic typing. In 19th ACM SIGPLAN{SIGACT Symposium on Principles of Programming Languages, pages 177-188. ACM Press, 1992.

....Wand[MW85] Danvy, Dussart, and Hatcliff [DD95, DH93a, DH93b] s works are analogous to ours. They switch between call by value and call by name CPS transformations interconnecting the two transformations by delay and force operators. Another analogous one is Leroy s box and unbox operators[Ler92] that are used to handle mixed representations of values. ....

Xavier Leroy. Unboxed objects and polymorphic typing. In Proceedings of ACM Symposium on Principles of Programming Languages, pages 177-- 188, January 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In ACM Symp. on Principles of Programming Languages, 1992.

No context found.

Xavier Leroy. Unboxed objects and polymorphic typing. In Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, pages 177--188. ACM Press, January 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Proceedings of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 177--188, Jan. 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, Jan. 1992.

No context found.

Leroy, X. 1992. Unboxed objects and polymorphic typing. In 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, USA, 177-- 188.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, Jan. 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Conference Record of the Nineteenth Annual ACM SIGPLAN Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, New Mexico, January 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Conf. Rec. 19th Ann. ACM Symp. Principles of Programming Languages, pp. 177--188, 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, New Mexico, January 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, New Mexico, January 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, Jan. 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, New Mexico, January 1992.

No context found.

Xavier Leroy. Unboxed objects and polymorphic typing. In Proceedings 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 177-- 188, January 1992.

No context found.

Xavier Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 177--188, 1992.

No context found.

Xavier Leroy. Unboxed objects and polymorphic typing. In 19th ACM Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, NM, January 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth Annual ACM Symp. on Principles of Prog. Languages, pages 177--188, New York, Jan 1992. ACM Press. Longer version available as INRIA Tech Report.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Proc. of ACM Symposium on Principles of Programming Languages, pages 177 -- 188, 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Conference Record of the Nineteenth Annual ACM SIGPLAN Symposium on Principles of Programming Languages, pages 177--188, Albuquerque, New Mexico, January 1992.

No context found.

X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM SIGACT-SIGPLAN Symposium pages 177--188, 1992.

No context found.

Xavier Leroy. Unboxed objects and polymorphic typing. In Nineteenth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 177--188, 1992.

First 50 documents  Next 50

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