Atsushi Ohori and Tomonobu Takamizawa. A polymorphic unboxed calculus as an abstract machine for polymorphic languages. Technical report, RIMS, Kyoto University, May 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....parameters are inferred and solved in a manner similar to overload parameters. Jones thesis [15] has material on extensible records also. More recently Ohori has extended his work to cover possible ways to remove boxing from data representations based on a implicit parameter style mechanism [24]. Both of Ohori s proposals seem like natural future extensions for Oasis. 2.4.2 Effect Systems There has been various work on Effect Systems, at first concerning issues of proper treatment of references in an ML language [29, 30] and more recently the replace CHAPTER 2. HISTORY AND RELATED ....

....ground, a non polymorphic equality parameter can be generated. If this approach turns out to perform well, other aspects of polymorphism might be lifted out of the implementation too; for example, it might be possible to use implicit parameters to avoid all requirements for boxed data structures [24]. ffl Exception tracking [38] This is a mechanism where the compiler would generate warnings to indicate exceptions that might escape a given section of code, much in the vein of pattern match exhaustiveness checks performed by most ML compilers. The analysis for exception tracking would be very ....

Atsushi Ohori and Tomonobu Takamizawa. A polymorphic unboxed calculus as an abstract machine for polymorphic languages. Technical report, RIMS, Kyoto University, May 1995.

....Programming Languages and Systems, 1995. A Polymorphic Record Calculus and Its Compilation 849 generalize the relational natural join operation to general record structures [Buneman et al. 1991; Ohori 1990] and to extend a polymorphic type system with the generalized natural join [Buneman and Ohori 1995; Ohori and Buneman 1988] However, we are not sure that such an operation should be in the polymorphic core of programming languages. The operations considered in this article support a wide range of programming with records while maintaining the existence of an ecient compilation method. We ....

....1 intgggfx : t 1 g (x l) x : int, the typability on closed terms does not change and therefore does not create any problems. Also, if we extend the type system to recursive types using regular trees [Courcelle 1983] allowing those cyclic kind assignments would become essential. Buneman and Ohori [1995] discusse possible usefulness of recursive programming with record polymorphism, and Vasconcelos recent work [Vasconcelos 1994] extends our kinded uni cation to in nite regular trees. 3.5 The Type Inference Algorithm Using the kinded uni cation, Milner s [1978] type inference algorithm is ....

[Article contains additional citation context not shown here]

Ohori, A. and Takamizawa, T. 1995. A polymorphic unboxed calculus as an abstract machine for polymorphic languages. RIMS Preprint 1031, Research Instit. for Mathematical Sciences, Kyoto Univ., Kyoto, Japan.

....languages. In our previous works, we have developed 2 two such methods. One is a compilation method for a polymorphic record calculus [31] which specializes polymorphic operations on labeled records and labeled variants to index operations. The other is an unboxed semantics for ML polymorphism [32], which specializes polymorphic variable binding to ecient size sensitive variable binding. These two methods exhibit common structures in specialization of ML style polymorphic languages. In particular, both exploit type information to perform appropriate specialization. The purpose of the ....

....declaration contains no free type variable, and is therefore suitable for subsequent specialization. 5 Examples of Specialization and Their Analysis As we mentioned in Introduction, we have developed compilation methods for polymorphic record operations [31] and for size sensitive lambda binding [32]. This section gives simpli ed accounts of these two methods and analyzes their common structures. For simplicity of presentation, in the following explanation, we only show implicitly typed languages. 5.1 Compilation of Polymorphic Record Operations Here we only consider the following minimal ....

[Article contains additional citation context not shown here]

A. Ohori and T. Takamizawa. A polymorphic unboxed calculus as an abstract machine for polymorphic languages. Journal of Lisp and Symbolic Computation, 10(1):61-91, 1997.

....ecient implementation of polymorphic functions. This approach has been rst proposed for compilation of a polymorphic record calculus [16] several related methods have also been developed, including overloading resolution [19] intentional type analysis [7] and unboxed operational semantics [18]. Tag free garbage collection [24] uses type information at run time and requires a similar run time structure. In these approaches, type abstraction is compiled to lambda abstraction over type information and type application is compiled to lambda application. Under this implementation strategy, ....

A. Ohori and T. Takamizawa. A polymorphic unboxed calculus as an abstract machine for polymorphic languages. Journal of Lisp and Symbolic Computation, 10(1):61-91, 1997.

....languages. In our previous works, we have developed two such methods. One is a compilation method for a polymorphic record calculus [26] which specializes polymorphic operations on labeled records and labeled variants to index operations. The other is an unboxed semantics for ML polymorphism [27], which specializes polymorphic variable binding to efficient size sensitive variable binding. These two methods exhibit common structures in specialization of ML style polymorphic languages. In particular, both exploit type information to perform appropriate specialization. The purpose of the ....

....algorithms for ML the author aware of produce a typing derivation containing vacuous type variables. 5 Examples of Specialization and Their Analysis As we mentioned in Introduction, we have developed compilation methods for polymorphic record operations [26] and for size sensitive lambda binding [27]. This section gives simplified accounts of these two methods and analyzes their common structures. For simplicity of presentation, in the following explanation, we only show implicitly typed languages. 5.1 Compilation of Polymorphic Record Operations Here we only consider the following minimal ....

[Article contains additional citation context not shown here]

A. Ohori and T. Takamizawa. A polymorphic unboxed calculus as an abstract machine for polymorphic languages. Journal of Lisp and Symbolic Computation, 10(1):61--91, 1997.

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