当前位置: X-MOL 学术arXiv.cs.LO › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
New Rewriter Features in FGL
arXiv - CS - Logic in Computer Science Pub Date : 2020-09-29 , DOI: arxiv-2009.13763
Sol Swords (Centaur Technology, Inc.)

FGL is a successor to GL, a proof procedure for ACL2 that allows complicated finitary conjectures to be translated into efficient Boolean function representations and proved using SAT solvers. A primary focus of FGL is to allow greater programmability using rewrite rules. While the FGL rewriter is modeled on ACL2's rewriter, we have added several features in order to make rewrite rules more powerful. A particular focus is to make it more convenient for rewrite rules to use information from the syntactic domain, allowing them to replace built-in primitives and meta rules in many cases. Since it is easier to write, maintain, and prove the soundness of rewrite rules than to do the same for rules programmed at the syntactic level, these features help make it feasible for users to precisely program the behavior or the rewriter. We describe the new features that FGL's rewriter implements, discuss the solutions to some technical problems that we encountered in their implementation, and assess the feasibility of adding these features to the ACL2 rewriter.

中文翻译:

FGL 中的新重写器功能

FGL 是 GL 的继承者,它是 ACL2 的证明程序,允许将复杂的有限猜想转换为有效的布尔函数表示并使用 SAT 求解器进行证明。FGL 的一个主要焦点是使用重写规则实现更大的可编程性。虽然 FGL 重写器以 ACL2 的重写器为模型,但我们添加了一些功能以使重写规则更强大。一个特别的重点是让重写规则更方便地使用来自句法域的信息,允许它们在许多情况下替换内置原语和元规则。由于编写、维护和证明重写规则的健全性比在句法级别编写规则更容易,因此这些功能有助于用户对行为或重写器进行精确编程。
更新日期:2020-09-30
down
wechat
bug