arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.09909cs.PLcs.CLcs.LO
收藏

共归纳简单明了

Coinduction Plain and Simple

Institute for Informatics, Ludwig-Maximilian University of Munich(慕尼黑大学信息学研究所)

François Bry

摘要:

余归纳是指定义无限流的技术,所谓的余数据,以及证明余归纳指定的余数据相等的技术。本文首先回顾了声明式编程中的共归纳。其次,它回顾并稍微扩展了通常用于指定codata的形式主义。第三,它推广了共归纳证明原则,这是原来规定的平等谓词,以其他谓词。这种推广使得共归纳证明原理更加直观,并强调了它与结构归纳的紧密性。文章最后建议在其结论扩展的功能和逻辑编程的有限和可判定形式的广义共归纳证明原则。

英文摘要:

Coinduction refers to both a technique for the definition of infinite streams, so-called codata, and a technique for proving the equality of coinductively specified codata. This article first reviews coinduction in declarative programming. Second, it reviews and slightly extends the formalism commonly used for specifying codata. Third, it generalizes the coinduction proof principle, which has been originally specified for the equality predicate only, to other predicates. This generalization makes the coinduction proof principle more intuitive and stresses its closeness with structural induction. The article finally suggests in its conclusion extensions of functional and logic programming with limited and decidable forms of the generalized coinduction proof principle.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑