Article

Free access

Unboxed objects and polymorphic typing

Author:

Xavier LeroyAuthors Info & Claims

POPL '92: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

February 1992

Pages 177 - 188

https://doi.org/10.1145/143165.143205

Published: 01 February 1992 Publication History

Abstract

This paper presents a program transformation that allows languages with polymorphic typing (e.g. ML) to be implemented with unboxed, multi-word data representations. The transformation introduces coercions between various representations, based on a typing derivation. A prototype ML compiler utilizing this transformation demonstrates important speedups.

References

[1]

A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: principles, techniques, and tools. Addison-Wesley, 1986.

Digital Library

[2]

A. W. Appel. l~un-time tags aren't necessary. Lisp and Symbolic Computation, 2(2), June 1989.

[3]

A.W. Appel. Compiling with continuations. Cambridge University Press, 1991.

Digital Library

[4]

A. W. Appel and D. B. MacQueen. A Standard ML compiler. In Functional Programming Languages and Computer Architecture, volume 242 of Lecture Notes in Computer Science. Springer- Verlag, 1987.

Digital Library

[5]

J. F. Bartlett. Compacting garbage collector with ambiguous roots. Technical report, DEC Western Research Laboratory, 1988.

[6]

L. Cardelli. The functional abstract machine. Polymorphism, 1 (1), 1983.

[7]

L. CardelIi and P. Wegner. On understanding types, data abstraction, and polymorphism. Computing surveys, 17(4), 1985.

Digital Library

[8]

F. Chow and J. Hennessy. l~egister allocation by priority-based coloring. SIGPLAN Notices, 19(6), 1984.

Digital Library

[9]

G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8(2), 1987.

Digital Library

[10]

L. Damas and R. Milner. Principal type-schemes for functional programs. In Proc. Syrup. Principles of Programming Languages, 1982.

Digital Library

[11]

G. Kane. MIPS RISC architecture. Prentice-Hall, 1990.

Digital Library

[12]

1~. Milner, M. Torte, and R. Harper. The definition of Standard ML. The MIT Press, 1990.

Digital Library

[13]

R. Morrison, A. Dearle, R. C. H. Connor, and A. L. Brown. An ad hoc approach to the implementation of polymorphism. A CM Transactions on Programming Languages and Systems, 13(3), 1991.

Digital Library

[14]

S. L. Peyton-Jones. Unboxed values as first-class citizens. In Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, 1991.

[15]

S. R. Thatte. Coercive type isomorphism. In Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, 1991.

Digital Library

[16]

M. ToRe. Type inference for polymorphic references. Information and Computation, 89(1), 1990.

Digital Library

[17]

N. Wirth. Programming in Moduia-2. Springer- Verlag, 1983.

Digital Library

Cited By

Baudon TRadanne GGonnord L(2023)Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data TypesProceedings of the ACM on Programming Languages10.1145/36078587:ICFP(813-846)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607858
Henriksen TElsman MLow TGibbons J(2021)Towards size-dependent types for array programmingProceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming10.1145/3460944.3464310(1-14)Online publication date: 17-Jun-2021
https://dl.acm.org/doi/10.1145/3460944.3464310
Griesemer RHu RKokke WLange JTaylor IToninho BWadler PYoshida N(2020)Featherweight goProceedings of the ACM on Programming Languages10.1145/34282174:OOPSLA(1-29)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3428217
Show More Cited By

Index Terms

Unboxed objects and polymorphic typing
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language features
        Data types and structures
      2. Language types
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Functional constructs
      2. Type structures
    2. Program semantics
      1. Operational semantics

Recommendations

On polymorphic gradual typing

We study an extension of gradual typing—a method to integrate dynamic typing and static typing smoothly in a single language—to parametric polymorphism and its theoretical properties, including conservativity of typing and semantics over both statically ...
Read More
Embedding polymorphic dynamic typing
WGP '11: Proceedings of the seventh ACM SIGPLAN workshop on Generic programming

Dynamic typing in a statically typed functional language allows us to defer type unification until run time. This is typically useful when interacting with the 'outside' world where the type of values involved may not be known statically. Haskell has ...
Read More
Polymorphic unification and ML typing
POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We study the complexity of type inference for a core fragment of ML with lambda abstraction, function application, and the polymorphic let declaration. Our primary technical tool is the unification problem for a class of “polymorphic” type expressions. ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '92: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

February 1992

376 pages

ISBN:0897914538

DOI:10.1145/143165

Chairman:
Ravi Sethi
AT&T Bell Labs., Murray Hill, NJ

Copyright © 1992 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL92

Sponsor:

POPL92: 19th ACM Symposium on Principles of Programming Languages

January 19 - 22, 1992

New Mexico, Albuquerque, USA

Acceptance Rates

POPL '92 Paper Acceptance Rate 30 of 204 submissions, 15%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

162
Total Citations
View Citations
547
Total Downloads

Downloads (Last 12 months)68
Downloads (Last 6 weeks)10

Other Metrics

View Author Metrics

Citations

Cited By

Baudon TRadanne GGonnord L(2023)Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data TypesProceedings of the ACM on Programming Languages10.1145/36078587:ICFP(813-846)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607858
Henriksen TElsman MLow TGibbons J(2021)Towards size-dependent types for array programmingProceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming10.1145/3460944.3464310(1-14)Online publication date: 17-Jun-2021
https://dl.acm.org/doi/10.1145/3460944.3464310
Griesemer RHu RKokke WLange JTaylor IToninho BWadler PYoshida N(2020)Featherweight goProceedings of the ACM on Programming Languages10.1145/34282174:OOPSLA(1-29)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3428217
Monnier SDarais DGibbons J(2019)Inductive types deconstructed: the calculus of united constructionsProceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3331554.3342607(52-63)Online publication date: 18-Aug-2019
https://dl.acm.org/doi/10.1145/3331554.3342607
Ohori AUeno KMima H(2018)Finitary polymorphism for optimizing type-directed compilationProceedings of the ACM on Programming Languages10.1145/32367762:ICFP(1-29)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236776
Tokuda RSumii EAbe A(2017)Specialization of Generic Array Accesses After InliningElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.241.4241(45-53)Online publication date: 7-Feb-2017
https://doi.org/10.4204/EPTCS.241.4
Constable RCrary K(2017)Computational complexity and induction for partial computable functions in type theoryReflections on the Foundations of Mathematics10.1017/9781316755983.009(164-181)Online publication date: 31-Mar-2017
https://doi.org/10.1017/9781316755983.009
Ureche VBiboudis ASmaragdakis YOdersky M(2015)Automating ad hoc data representation transformationsACM SIGPLAN Notices10.1145/2858965.281427150:10(801-820)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2858965.2814271
Ureche VBiboudis ASmaragdakis YOdersky MAldrich JEugster P(2015)Automating ad hoc data representation transformationsProceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2814270.2814271(801-820)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2814270.2814271
Jibaja IJensen PHu NHaghighat MMcCutchan JGohman DBlackburn SMcKinley K(2015)Vector Parallelism in JavaScriptProceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT)10.1109/PACT.2015.33(407-418)Online publication date: 18-Oct-2015
https://dl.acm.org/doi/10.1109/PACT.2015.33
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents