arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.14950cs.LOmath.CTmath.LO
收藏

动态追踪:一种用于重写协议的图形化语言

Dynamic Tracing: a graphical language for rewriting protocols

Kristopher Brown, David I. Spivak

AI总结:

本研究将Set_*范畴的追踪幺半结构中的隐式转换过程显式化,推广到更多追踪Kleisli范畴并给出推测性追踪算子,为图重写计算提供形式化图形语法。

摘要:

众所周知,由集合与部分函数构成的范畴Set_*是追踪幺半的,这意味着部分函数S+U -/-> T+U可以被一致地转换为部分函数S -/-> T。这种转换通常通过一个必须运行的隐式过程来描述。我们通过在Cat#(范畴与余函子构成的对称幺半范畴)中丰富该追踪范畴,使这一过程变得显式:每个同态范畴都以这类过程为对象,以过程的推进为态射。我们还将结果推广到Set_*之外的追踪Kleisli范畴,为形如t+1的任意多项式单子的Kleisli范畴提供了一个推测性的追踪算子。本研究的主要动机是为图重写驱动的复杂计算提供一种形式化的图形化语法,而图重写本身就是一种用于数据转换的图形化语言。

英文摘要:

The category Set_* of sets and partial functions is well-known to be traced monoidal, meaning that a partial function S+U -/-> T+U can be coherently transformed into a partial function S -/-> T. This transformation is generally described in terms of an implicit procedure that must be run. We make this procedure explicit by enriching the traced category in Cat#, the symmetric monoidal category of categories and cofunctors: each hom-category has such procedures as objects, and advancement through the procedures as arrows. We also generalize to traced Kleisli categories beyond Set_*, providing a conjectural trace operator for the Kleisli category of any polynomial monad of the form t+1. The main motivation for this work is to give a formal and graphical syntax for performing sophisticated computations powered by graph rewriting, which is itself a graphical language for data transformation.

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

↑