GADT的(深度)归纳规则
(Deep) Induction Rules for GADTs
摘要:
深度数据类型是从其他数据类型(可能包括它们自身)构造的数据类型。在这种情况下,它们被称为真正的嵌套。深度归纳是结构归纳的扩展,它遍历深度数据类型中的所有结构,在整个结构中传播其原始数据上的谓词。深度归纳可以用来证明嵌套类型的属性,包括真正的嵌套类型,这些属性不能通过结构归纳来证明。在本文中,我们将展示如何将深度归纳扩展到不是真正嵌套的GADT的GADT。这开辟了将自动生成的(深)归纳规则,他们到证明助手。我们还表明,本文中开发的技术不足以将深度归纳扩展到真正嵌套的GADT,因此需要更复杂的技术来推导它们的深度归纳规则。
英文摘要:
Deep data types are those that are constructed from other data types, including, possibly, themselves. In this case, they are said to be truly nested. Deep induction is an extension of structural induction that traverses all of the structure in a deep data type, propagating predicates on its primitive data throughout the entire structure. Deep induction can be used to prove properties of nested types, including truly nested types, that cannot be proved via structural induction. In this paper we show how to extend deep induction to GADTs that are not truly nested GADTs. This opens the way to incorporating automatic generation of (deep) induction rules for them into proof assistants. We also show that the techniques developed in this paper do not suffice for extending deep induction to truly nested GADTs, so more sophisticated techniques are needed to derive deep induction rules for them.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。