Typed Compilation Against Non-manifest Base Classes

  • Christopher League
  • Stefan Monnier
Conference paper

DOI: 10.1007/11741060_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3956)
Cite this paper as:
League C., Monnier S. (2006) Typed Compilation Against Non-manifest Base Classes. In: Barthe G., Grégoire B., Huisman M., Lanet JL. (eds) Construction and Analysis of Safe, Secure, and Interoperable Smart Devices. CASSIS 2005. Lecture Notes in Computer Science, vol 3956. Springer, Berlin, Heidelberg

Abstract

Much recent work on proof-carrying code aims to build certifying compilers for single-inheritance object-oriented languages, such as Java or C#. Some modern object-oriented languages support compiling a derived class without complete information about its base class. This strategy—though necessary for supporting features such as mixins, traits, and first-class classes—is not well-supported by existing typed intermediate languages. We present a low-level IL with a type system based on the Calculus of Inductive Constructions. It is an appropriate target for efficient, type-preserving compilation of various forms of inheritance, even when the base class is unknown at compile time. Languages (such as Java) that do not require such flexibility are not penalized at run time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Christopher League
    • 1
  • Stefan Monnier
    • 2
  1. 1.Long Island UniversityUSA
  2. 2.Université de MontréalCanada

Personalised recommendations