Alignment-based Translations Across Formal Systems Using Interface Theories

Dennis Müller, Colin Rothgang, Yufei Liu, Florian Rabe
{"title":"Alignment-based Translations Across Formal Systems Using Interface Theories","authors":"Dennis Müller, Colin Rothgang, Yufei Liu, Florian Rabe","doi":"10.4204/EPTCS.262.7","DOIUrl":null,"url":null,"abstract":"Translating expressions between different logics and theorem provers is notoriously and often prohibitively difficult, due to the large differences between the logical foundations, the implementations of the systems, and the structure of the respective libraries. Practical solutions for exchanging theorems across theorem provers have remained both weak and brittle. Consequently, libraries are not easily reusable across systems, and substantial effort must be spent on reformalizing and proving basic results in each system. Notably, this problem exists already if we only try to exchange theorem statements and forgo exchanging proofs. \nIn previous work we introduced alignments as a lightweight standard for relating concepts across libraries and conjectured that it would provide a good base for translating expressions. In this paper, we demonstrate the feasibility of this approach. We use a foundationally uncommitted framework to write interface theories that abstract from logical foundation, implementation, and library structure. Then we use alignments to record how the concepts in the interface theories are realized in several major proof assistant libraries, and we use that information to translate expressions across libraries. Concretely, we present exemplary interface theories for several areas of mathematics and - in total - several hundred alignments that were found manually.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Proof Exchange for Theorem Proving","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.262.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Translating expressions between different logics and theorem provers is notoriously and often prohibitively difficult, due to the large differences between the logical foundations, the implementations of the systems, and the structure of the respective libraries. Practical solutions for exchanging theorems across theorem provers have remained both weak and brittle. Consequently, libraries are not easily reusable across systems, and substantial effort must be spent on reformalizing and proving basic results in each system. Notably, this problem exists already if we only try to exchange theorem statements and forgo exchanging proofs. In previous work we introduced alignments as a lightweight standard for relating concepts across libraries and conjectured that it would provide a good base for translating expressions. In this paper, we demonstrate the feasibility of this approach. We use a foundationally uncommitted framework to write interface theories that abstract from logical foundation, implementation, and library structure. Then we use alignments to record how the concepts in the interface theories are realized in several major proof assistant libraries, and we use that information to translate expressions across libraries. Concretely, we present exemplary interface theories for several areas of mathematics and - in total - several hundred alignments that were found manually.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用接口理论的跨形式系统的基于对齐的翻译
由于逻辑基础、系统实现和各自库的结构之间的巨大差异,在不同的逻辑和定理证明程序之间转换表达式是非常困难的,而且常常是非常困难的。在定理证明者之间交换定理的实际解决方案仍然是脆弱的。因此,库不容易跨系统重用,并且必须花费大量的精力来重新定义和证明每个系统中的基本结果。值得注意的是,如果我们只尝试交换定理陈述而放弃交换证明,这个问题已经存在。在之前的工作中,我们介绍了对齐作为跨库关联概念的轻量级标准,并推测它将为翻译表达式提供良好的基础。在本文中,我们证明了这种方法的可行性。我们使用一个基本的未提交框架来编写从逻辑基础、实现和库结构中抽象出来的接口理论。然后,我们使用对齐来记录接口理论中的概念如何在几个主要的证明辅助库中实现,并且我们使用该信息来跨库翻译表达式。具体地说,我们为几个数学领域提供了典型的界面理论,并且-总共-数百种手动发现的对齐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Proof Generation in CDSAT Alethe: Towards a Generic SMT Proof Format (extended abstract) A Framework for Proof-carrying Logical Transformations General Automation in Coq through Modular Transformations Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1