Article

Free access

Representing Java classes in a typed intermediate language

Authors:

Christopher League,

Valery TrifonovAuthors Info & Claims

ICFP '99: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming

Pages 183 - 196

https://doi.org/10.1145/317636.317798

Published: 01 September 1999 Publication History

Abstract

We propose a conservative extension of the polymorphic lambda calculus (F^ω) as an intermediate language for compiling languages with name-based class and interface hierarchies. Our extension enriches standard F^ω with recursive types, existential types, and row polymorphism, but only ordered records with no subtyping. Basing our language on F^ω makes it also a suitable target for translation from other higher-order languages; this enables the safe interoperation between class-based and higher-order languages and the reuse of common type-directed optimization techniques, compiler back ends, and runtime support.We present the formal semantics of our intermediate language and illustrate its features by providing a formal translation from a subset of Java, including classes, interfaces, and private instance variables. The translation preserves the name-based hierarchical relation between Java classes and interfaces, and allows access to private instance variables of parameters of the same class as the one defining the method. It also exposes the details of method invocation and instance variable access and allows many standard optimizations to be performed on the object-oriented code.

References

[1]

M. Abadi, L. Cardelli, and R. Viswanathan. An interpretation of objects and object types. In Prec. 23rd ACM SIGPL,4N-SIGACT Syrnp. on Principles of Programming Languages (POPL'96), pages 396-- 409, St. Petersburg, January 1996. ACM Press.

Digital Library

[2]

A. W. Appel and D. B. MacQueen. Standard ML of New Jersey. Technical Report CS-TR~329-91, Princeton University Department of Computer Science, June 1991.

[3]

N. Benton, A. Kennedy, and G. Russell. Compiling Standard ML to Java bytecodes. In Prec. lnt 'I Conf. on Functional Programming (ICFP'98), pages 129-140.

Digital Library

[4]

K. Bruce, L. Cardelli, G. Castagna, The Hopkins Objects Group, G. T. Leavens, and B. Pierce. On binary methods. Theory and Practice of Object Systems, 1(3):221-242, December 1995.

Digital Library

[5]

K. Bruce, L. Cardelli, and B. Pierce. Comparing object encodings. Information and Computation (to appear), 1998.

Digital Library

[6]

K. B. Bruce. A paradigmatic object-oriented programming language: Design, static typing and semantics. Journal of Functional Programming, 4(2), 1994.

[7]

P. Canning, W. Cook, W. Hill, J. Mitchell, and W. Olthoff. F-bounded polyrnorphism for object-oriented programming. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pages 273-280, 1989.

Digital Library

[8]

L. Cardelli and X. Leroy. Abstract types and the dot notation. In Prec. IFIP Working Conf. on Programming Concepts and Methods, pages 46649 I, Israel, April 1990.

[9]

L. Cardelli and G. Longo. A semantic basis for Quest. Journal of Functional Programming, 1 (4), 1991.

[10]

J. Dean, G. DeFouw, D. Grove, V. Litvinov, and C. Chambers. Vortex: An optimizing compiler for object-oriented languages. In Prec. ACM SIGPLAN Conf. on Object-Oriented Programming Systems, Languages, and Apptications (OOPSLA '96), pages 83-100, San Jose, October 1996. ACM.

Digital Library

[11]

S. Drossopoulou and S. Eisenbach. Java is type safe---probably. In Prec. I I th European Conf. on Object-Oriented Programming, Febru~ ary 1997.

[12]

S. Drossopoulou and S. Eisenbach, Towards an operational semantics and proof of type soundness for Java, April 1998.

[13]

J. Eifrig, S. Smith, V. Trifonov, and A. Zwarico. An interpretation of typed OOP in a language with state. Lisp and Symbolic Computation, 8(4):357-397, 1995.

Digital Library

[14]

K. Fisher. Type Systems for Object-Oriented Programming Languages. PhD thesis, Stanford University, August 1996.

Digital Library

[15]

K. Fisher and J. Mitchell. On the relationship between classes, objects and data abstraction. 7heo~ and Practice of Object Systems (to appear), 1998.

Digital Library

[16]

K. Fisher and J, Reppy. The design of a class mechanism for Moby, In Prec. ACM SIGPLAN '99 Co~ on Pros. Lang. Design and tmple. mentation, pages 37-49, New York, May 1999. ACM Press.

Digital Library

[17]

M. Flatt, S. Krishtaamurthi, and M. Felleisen. A programmer's reduction semantics for classes and mixins. Technical Report 97-293, Rice University, 1997.

[18]

J.Y. Girard. Interpretation Fonctionnelle et Elimination des Coupures clans l',4rithmetique d'Ordre ~uperieur. Phi) thesis, University of Paris VII, 1972.

[19]

N. Glewo Type dispatch for named hierarchical types. In Prec. 1999 ACM SIGPLAN International Conference on Functional Programming (ICFP '99). ACM Press, September 1999.

Digital Library

[20]

N. Heintze and 3. G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Prvc. 2.5th,4CMSIGPLAN:SIGACTSymp. on Principles of Programming Languages (POPL'98), pages 365-377.

Digital Library

[21]

M. Hofmann and B. Pierce. A unifying type-theoretic framework for objects. Journal of Functional .Programming, January 1994.

[22]

A. Krall and R. Graft. CACAO---a 64~bit Java VM Just-In-Time compiler. In Prec. ACM PPoPP'97 Workshop on Java .{br Science and Engineering Computation., 1997.

[23]

C. League, Z. Shao, and V. Trifonov. Representing Java classes in a typed intermediate language (extended version). Technical Report YALEU/DCS/RR- 1180, Department of Computer Science, Yale University, New Haven, CT, June ! 999.

[24]

X. Leroy and E Rouaix. Security properties of typed applets. In Prec. 25th ACM SIGPLAN-SIGACT Syrup. on Principles of Programming Languages (POPL '98), pages 391403.

Digital Library

[25]

T. Lindholm and E Yellin. The Java Virtual Machine Specification (Second Edition). Addison-Wesley, 1999.

Digital Library

[26]

MicrosoR Win32 VM for Java object model, 1998.

[27]

M. Odersky and P. Wadler. Pizza into Java: Translating theory inw practice. In Prec. 24th ACM SiGPLAN-SIGACT Syrup. on Principles of Programming Languages (POPL '97), pages 146-159.

Digital Library

[28]

J. Palsberg and P. Orba~k, Trust in the X-calculu:~. Journal of Functional Programming, 7(6):557-591, November 1997.

Digital Library

[29]

B. C. Pierce and D. N. Turner. Simple type-theoretic foundations for object-oriented programming. Journal of Functional Programming, 4(2):207-247, April 1994.

[30]

T. A. Proebsting, G. Townsend, P. Bridges, J. H. Hartman, T. Nowsham, and S. A. Watterson. Toba: Java for applications: A way ahead of time (WAT) compiler. In Prec. Third Conf. on Object-Oriented Technologies and Systems (C00TS'97), 1997.

Digital Library

[31]

D. R~my. Syntactic theories and the algebra of nx:ord terms. Technical Report 1869, INRIA, 1993.

[32]

D. R6my and 1. VouiUon. Objective ML: A simple object-oriented extension of ML. In Prec. 24th,4CM SIGPLAN-SIG,4CT Syrup. on Principles of Programming Languages (POPL'97), pages 40-53.

Digital Library

[33]

J.C. Reynolds. Towards a theory of type structure. In Prec., Colloque sur la Programmation, Lecture Notes in Computer Science, volume 19, pages 408-425. Springer- Verlag, Berlin, 1974.

Digital Library

[34]

Z. Shoo. An overview of the FLINT/ML compiler. In Prec. First Int'l Workshop on 73pes in Compilation (TIC'97), Amsterdam, June 1997.

[35]

Z. Shoo. Typed common intermediate format. In Prec. USENIX Conf. on Domain-Specific Languages, pages 89-101, Santa Barbara, CA, October 1997.

Digital Library

[36]

Z. Shao. Typed cross-module compilation. In Prec. Int 7 Conf. on Functional Programming (ICFP'98), pages 141-152.

Digital Library

[37]

Z. Shao, C. League, and S. Mormier. Implementing typed intermediate languages. In Prec. Int'l Conf. on Functional Programming (ICFP '98), pages 313-323.

Digital Library

[38]

A. Wright, S. Jagannathan, C. Ungureanu, and A. Hertzma~. Compiling Java to a typed lambda-calculus: A preliminary report. In Proc. Second Int 7 Workshop on Types in Compilation (TIC'98), pages 1-14, Kyoto, March 1998.

Digital Library

Cited By

Preußer TZabel MSpallek RBollella G(2007)Enabling constant-time interface method dispatch in embedded Java processorsProceedings of the 5th international workshop on Java technologies for real-time and embedded systems10.1145/1288940.1288969(196-205)Online publication date: 26-Sep-2007
https://dl.acm.org/doi/10.1145/1288940.1288969
Glew NPalsberg JGrothoff C(2005)Type-safe optimisation of plugin architecturesProceedings of the 12th international conference on Static Analysis10.1007/11547662_11(135-154)Online publication date: 7-Sep-2005
https://dl.acm.org/doi/10.1007/11547662_11
Stone C(2004)Extensible objects without labelsACM Transactions on Programming Languages and Systems10.1145/1018203.101820626:5(805-835)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1145/1018203.1018206
Show More Cited By

Index Terms

Representing Java classes in a typed intermediate language
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Polymorphism
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Representing Java classes in a typed intermediate language

We propose a conservative extension of the polymorphic lambda calculus (F^ω) as an intermediate language for compiling languages with name-based class and interface hierarchies. Our extension enriches standard F^ω with recursive types, ...
Implementing typed intermediate languages

Recent advances in compiler technology have demonstrated the benefits of using strongly typed intermediate languages to compile richly typed source languages (e.g., ML). A type-preserving compiler can use types to guide advanced optimizations and to ...
A simple typed intermediate language for object-oriented languages
POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermediate language for compiling object-oriented languages and prove its ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICFP '99: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming

September 1999

288 pages

ISBN:1581131119

DOI:10.1145/317636

Chairmen:
Didier Rémy
INRIA Rocquencourt, France
,
Peter Lee
Carnegie Mellon Univ., Pittsburgh, PA ;and Cedilla Systems Inc.

ACM SIGPLAN Notices Volume 34, Issue 9
Sept. 1999
283 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/317765
Editor:
A. Michael Berman
Rowan Univ., Glassboro, NJ
Issue’s Table of Contents

Copyright © 1999 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

SIGPLAN: ACM Special Interest Group on Programming Languages
INRIA: Institut Natl de Recherche en Info et en Automatique

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICFP99

Sponsor:

SIGPLAN
INRIA

ICFP99: International Conference on Functional Programming

September 27 - 29, 1999

Paris, France

Acceptance Rates

ICFP '99 Paper Acceptance Rate 25 of 81 submissions, 31%;

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
511
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)11

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Preußer TZabel MSpallek RBollella G(2007)Enabling constant-time interface method dispatch in embedded Java processorsProceedings of the 5th international workshop on Java technologies for real-time and embedded systems10.1145/1288940.1288969(196-205)Online publication date: 26-Sep-2007
https://dl.acm.org/doi/10.1145/1288940.1288969
Glew NPalsberg JGrothoff C(2005)Type-safe optimisation of plugin architecturesProceedings of the 12th international conference on Static Analysis10.1007/11547662_11(135-154)Online publication date: 7-Sep-2005
https://dl.acm.org/doi/10.1007/11547662_11
Stone C(2004)Extensible objects without labelsACM Transactions on Programming Languages and Systems10.1145/1018203.101820626:5(805-835)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1145/1018203.1018206
Gauthier NPottier FOkasaki CFisher K(2004)Numbering mattersProceedings of the ninth ACM SIGPLAN international conference on Functional programming10.1145/1016850.1016872(150-161)Online publication date: 19-Sep-2004
https://dl.acm.org/doi/10.1145/1016850.1016872
Gauthier NPottier F(2004)Numbering mattersACM SIGPLAN Notices10.1145/1016848.101687239:9(150-161)Online publication date: 19-Sep-2004
https://dl.acm.org/doi/10.1145/1016848.1016872
League CShao ZTrifonov V(2003)Precision in practiceProceedings of the 12th international conference on Compiler construction10.5555/1765931.1765942(106-120)Online publication date: 7-Apr-2003
https://dl.acm.org/doi/10.5555/1765931.1765942
League CZhong Shao Trifonov V(2003)Type-preserving compilation of featherweight javaFoundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems]10.1109/FITS.2003.1264927(35-59)Online publication date: 2003
https://doi.org/10.1109/FITS.2003.1264927
Duggan D(2001)Type-based hot swapping of running modules (extended abstract)ACM SIGPLAN Notices10.1145/507669.50764536:10(62-73)Online publication date: 1-Oct-2001
https://dl.acm.org/doi/10.1145/507669.507645
Duggan DPierce B(2001)Type-based hot swapping of running modules (extended abstract)Proceedings of the sixth ACM SIGPLAN international conference on Functional programming10.1145/507635.507645(62-73)Online publication date: 1-Oct-2001
https://dl.acm.org/doi/10.1145/507635.507645
Knoblock TRehof J(2001)Type elaboration and subtype completion for Java bytecodeACM Transactions on Programming Languages and Systems10.1145/383043.38304523:2(243-272)Online publication date: 1-Mar-2001
https://dl.acm.org/doi/10.1145/383043.383045
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