首页> 外文会议>Verified Software: Theories, Tools, Experiments >It Is Time to Mechanize Programming Language Metatheory
【24h】

It Is Time to Mechanize Programming Language Metatheory

机译:是时候机械化编程语言元理论了

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

摘要

How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and programming language researchers alike? One crucial step towards achieving these goals is mechanized reasoning about language metatheory. The time has come to bring together the theorem proving and programming language communities to address this problem. We have proposed the POPLMark challenge as a concrete set of benchmarks intended both for measuring progress in this area and for stimulating discussion and collaboration. Our goal is to push the boundaries of existing technology to the point where we can achieve mechanized metatheory for the masses.
机译:我们离一个经过机械验证的软件司空见惯的世界有多近?软件开发人员和编程语言研究人员都经常使用定理证明技术吗?实现这些目标的关键步骤之一是关于语言元理论的机械化推理。现在是时候将定理证明和编程语言社区汇聚在一起解决这个问题了。我们提出了POPLMark挑战,将其作为一组具体的基准,旨在衡量该领域的进展以及促进讨论与合作。我们的目标是将现有技术的界限推到可以为大众实现机械化元理论的地步。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号