Atsushi Ohori, Tomonobu Takamizawa  Home/Search
Context Related
Links: ACM DBLP | jaist.ac.jp/~ohori/unboxsem.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: jaist.ac.jp/~ohori/list (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an unboxed operational semantics for an ML-style polymorphic language. Di erent from the conventional formalisms, the proposed semantics accounts for actual representations of run-time objects of various types, and supports a refined notion of polymorphism that allows polymorphic functions to be applied directly to values of various different representations. In particular, polymorphic functions can receive multi-word constants such as oating-point numbers without requiring them to... (Update)
Context of citations to this paper: More
...polymorphic functional, there is no way we can use its unboxed version. Runtime type passing can handle this case. Ohori and Takamizawa [15] showed that it is possible to pass unboxed values to polymorphic functions by parameterizing them on the size of their arguments....
.... locations and sizes of values with statically unknown types [18, 8] Earlier proposals in the context of stack based abstract machines [9, 10] pass only size information as extra parameters, instead of full type expressions. Unlike the coercion based approach, this approach...
Cited by: More
An overview of Types in Compilation - Leroy (1998) (Correct)
The Effectiveness of Type-Based Unboxing - Leroy (1997) (Correct)
On the Runtime Complexity of Type-Directed Unboxing - Minamide (1998) (Correct)
Active bibliography (related documents): More All
0.9: A Polymorphic Record Calculus and Its Compilation - Ohori (1995) (Correct)
0.3: Unboxed Values and Polymorphic Typing Revisited - Thiemann (1995) (Correct)
0.3: Kinded Parameteric Overloading - Duggan, Ophel (1994) (Correct)
Similar documents based on text: More All
0.5: Programming with Regions in the ML Kit (for Version 4) - Tofte, Birkedal, Elsman.. (2001) (Correct)
0.3: The Amber Machine - Cardelli (1986) (Correct)
0.3: Unboxed Objects and Polymorphic Typing - Leroy (1992) (Correct)
Related documents from co-citation: More All
3: TIL: A type-directed optimizing compiler for ML - Tarditi, Morrisett et al. - 1995
3: Flexible representation analysis - Shao - 1997
3: A type-based compiler for Standard ML - Shao, Appel - 1994
BibTeX entry: (Update)
A. Ohori and T. Takamizawa. An unboxed operational semantics for ML polymorphism. Journal of Lisp and Symbolic Computation, 10(1):61 - 91, 1997. http://citeseer.ist.psu.edu/ohori97unboxed.html More
@article{ ohori97unboxed,
author = "Atsushi Ohori and Tomonobu Takamizawa",
title = "An Unboxed Operational Semantics for {ML} Polymorphism",
journal = "Lisp and Symbolic Computation",
volume = "10",
number = "1",
pages = "61-91",
year = "1997",
url = "citeseer.ist.psu.edu/ohori97unboxed.html" }
Citations (may not include all citations):343 Principal type-schemes for functional programs (context) - Damas, Milner - 1982 DBLP
233 Natural semantics (context) - Kahn - 1987 ACM DBLP
190 How to make ad hoc polymorphism less ad hoc - Wadler, Blott - 1989
186 Compiling polymorphism using intensional type analysis - Harper, Morrisett ACM DBLP
178 Standard ML of New Jersey - Appel, MacQueen - 1991 DBLP
162 Unboxed objects and polymorphic typing - Leroy - 1992 ACM DBLP
106 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
106 The categorical abstract machine (context) - Cousineau, Curien et al. - 1987 ACM DBLP
103 The Denition of Standard ML (context) - Milner, Tofte et al. - 1990
87 Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1988
81 The ZINC experiment: an economical implementation of the ML .. - Leroy - 1992
63 Tag-free garbage collection using explicit type parameters - Tolmach - 1994 ACM DBLP
55 A compilation method for ML-style polymorphic record calculi - Ohori - 1992 ACM DBLP
54 A polymorphic record calculus and its compilation - Ohori - 1995 ACM DBLP
43 Formally optimal boxing (context) - Henglein, rgensen - 1994 ACM DBLP
42 An ad hoc approach to the implementation of polymorphism - Morrison, Dearle et al. - 1991 ACM DBLP
30 Polymorphic typing of an algorithmic language - Leroy - 1992
30 the type structure of Standard ML - Harper, Mitchell - 1993
18 Implementing type classes - Peterson, Jones - 1993 ACM DBLP
13 Unboxed values as rst class citizens in a nonstrict function.. - Jones, Launchbury - 1991
13 Unrolling lists - Shao, Reppy et al. - 1994 ACM DBLP
12 A simple semantics for ML polymorphism (context) - Ohori ACM DBLP
6 Using Hindley-Milner type inference to optimize list represe.. (context) - Hall - 1994
5 Unboxed values and polymorphic typing revisited - Thiemann - 1995 ACM DBLP
3 Compiling with non-parametric polymorphism (context) - Harper, Morrisett - 1994
2 Type class in Haskell (context) - Hall, Hammond et al. - 1994
Documents on the same site (http://www.jaist.ac.jp/~ohori/list.html): More
An Equational Object-Oriented Data Model and its.. - Nishimura, Ohori, Tajima (1996) (Correct)
Proof-Directed De-compilation of Low-Level Code - Katsumata, Ohori (2001) (Correct)
A Curry-Howard Isomorphism for Compilation and Program Execution.. - Ohori (1999) (Correct)
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