Typed Compilation Against Non-manifest Base Classes | Zendy

Christopher League | Zendy; Stefan Monnier | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Typed Compilation Against Non-manifest Base Classes

Author(s) -

Christopher League,

Stefan Monnier

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-33689-3

DOI - 10.1007/11741060_5

Subject(s) - computer science , programming language , inheritance (genetic algorithm) , java , compiler , class (philosophy) , multiple inheritance , base (topology) , compile time , object oriented programming , flexibility (engineering) , object (grammar) , theoretical computer science , artificial intelligence , mathematics , mathematical analysis , biochemistry , chemistry , statistics , gene

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research