arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.03814cs.FL
收藏

一个重写弦图族的框架

A Framework for Rewriting Families of String Diagrams

Vladimir Zamdzhiev

摘要:

我们描述了一个数学框架,方程推理的无限家庭的字符串图,这是服从计算机自动化。该框架是基于上下文无关的家庭的字符串图,我们表示使用上下文无关的图形语法。我们使用上下文无关文法之间的重写规则来建模图的无限族之间的方程。我们的框架表示等式推理的具体字符串图和上下文无关的家庭字符串图,分别使用双推出重写图和上下文无关的图形语法。我们证明,我们的表示是健全的,它尊重字符串图解推理的具体语义,我们表明,我们的框架是适当的软件实现证明成员资格问题是可判定的。

英文摘要:

We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free graph grammars. We model equations between infinite families of diagrams using rewrite rules between context-free grammars. Our framework represents equational reasoning about concrete string diagrams and context-free families of string diagrams using double-pushout rewriting on graphs and context-free graph grammars respectively. We prove that our representation is sound by showing that it respects the concrete semantics of string diagrammatic reasoning and we show that our framework is appropriate for software implementation by proving the membership problem is decidable.

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

↑