Universal Constructions for (Co)Relations: categories, monoidal categories, and props.
LOGICAL METHODS IN COMPUTER SCIENCE(2018)
摘要
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic interpretation for diagrams is given in terms of relations or corelations (generalised equivalence relations) of some kind. In this paper we show how semantic categories of both relations and corelations can be characterised as colimits of simpler categories. This modular perspective is important as it simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams. Moreover, our general result unifies various theorems that are independently found in literature and are relevant for program semantics, quantum computation and control theory.
更多查看译文
关键词
corelation,prop,string diagram
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络