基于Mendler归纳法的模数据集推理
Reasoning about modular datatypes with Mendler induction
摘要:
在函数式编程中,数据库点菜提供了递归数据库的一种方便的模块化表示,基于它们的初始代数语义。不幸的是,在基于类型论的证明助手(如Coq)中实现这种技术是非常具有挑战性的。原因是它涉及类型定义,例如类型级定点运算符的类型定义,这些类型定义不是严格正的。已知的非断言编码的解决方法是有问题的,因为它阻碍了传统的归纳推理。弱归纳原理可以用来代替,但它们相当复杂的证明。本文提出了一种新的和更简单的技术,归纳推理的非谓词编码,基于Mendler风格的归纳。这种技术涉及免除依赖归纳,确保数据集可以提升为谓词,并依赖于关系公式。一个关于证明结构操作语义的主题约简的案例研究表明,该方法可以实现模块化证明,并且这些证明与传统的证明基本相似。
英文摘要:
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof assistants that are based on type theory, like Coq. The reason is that it involves type definitions, such as those of type-level fixpoint operators, that are not strictly positive. The known work-around of impredicative encodings is problematic, insofar as it impedes conventional inductive reasoning. Weak induction principles can be used instead, but they considerably complicate proofs. This paper proposes a novel and simpler technique to reason inductively about impredicative encodings, based on Mendler-style induction. This technique involves dispensing with dependent induction, ensuring that datatypes can be lifted to predicates and relying on relational formulations. A case study on proving subject reduction for structural operational semantics illustrates that the approach enables modular proofs, and that these proofs are essentially similar to conventional ones.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。