【24h】

Typed Compilation Against Non-manifest Base Classes

机译:针对非清单基类的类型化编译

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:最近关于证明代码的工作旨在为单继承面向对象的语言(例如Java或C#)构建证明编译器。一些现代的面向对象的语言支持在没有派生类完整信息的情况下编译派生类。尽管该策略对于支持诸如混合,特性和一流类之类的功能是必需的,但是现有类型化的中间语言却无法很好地支持这种策略。我们提出一种基于归纳演算微积分的类型系统的低级IL。即使在编译时不知道基类,它也是进行各种形式继承的有效,保留类型的编译的合适目标。不需要这种灵活性的语言(例如Java)在运行时不会受到惩罚。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号