Monoidal Computer I:Basic Computability by String Diagrams(Monoidal Computer I:用弦图的基本可计算性)
Monoidal computer I: Basic computability by string diagrams
摘要:
我们提出了一个新的计算模型,描述monoidal类别。它符合丘奇-图灵命题,并捕获了与标准模型相同的可计算函数。它提供了一个简洁的分类接口,其中大多数,免费的各种实现细节,使用的想法和结构,同时出现在计算和编程的语义研究。monoidal范畴语言的显著特征是,它得到了一个健全而完整的图形形式主义--弦图的支持,弦图为关于计算的抽象推理提供了一个具体而直观的界面。这种努力的最初动机和最终目标是通过采用隐藏从实践中出现的低级实现细节的方法,为计算资源的理论(例如单向函数和陷门函数)提供方便的高级程序设计语言。在本文中,我们为实现这一宏伟目标迈出了第一步,并勾勒出了实现这一目标的道路,这条道路将在正在编写的三篇后续论文中继续探讨。
英文摘要:
We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most of them, free of their diverse implementation details, using the ideas and structures that in the meantime emerged from research in semantics of computation and programming. The salient feature of the language of monoidal categories is that it is supported by a sound and complete graphical formalism, string diagrams, which provide a concrete and intuitive interface for abstract reasoning about computation. The original motivation and the ultimate goal of this effort is to provide a convenient high level programming language for a theory of computational resources, such as one-way functions, and trapdoor functions, by adopting the methods for hiding the low level implementation details that emerged from practice. In the present paper, we make a first step towards this ambitious goal, and sketch a path to reach it. This path is pursued in three sequel papers, that are in preparation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。