论文标题
作为图表的程序：从分类可计算性到可计算类别
Programs as Diagrams: From Categorical Computability to Computable Categories
论文作者
论文摘要
这是教科书/专着的草稿，它使用字符串图提出了可计算性理论。介绍性章节被教授为研究生和本科课程，并通过8年的讲座发展。后面的章节包含有关分类计算性的新想法和结果，以及可计算类别理论的第一步。计算的基本分类视图基于带有程序评估器的单体类别，称为 *MONOIDAL计算机 *。这种分类结构可以看作是称为run的单一指导图编程语言，其唯一的指令称为run。此版本：改进的文本，将最后一章移至下一卷。 （最终版本将继续进行大量的练习和锻炼，但是此版本已经严重降低了图形以满足尺寸的范围。）
This is a draft of the textbook/monograph that presents computability theory using string diagrams. The introductory chapters have been taught as graduate and undergraduate courses and evolved through 8 years of lecture notes. The later chapters contain new ideas and results about categorical computability and some first steps into computable category theory. The underlying categorical view of computation is based on monoidal categories with program evaluators, called *monoidal computers*. This categorical structure can be viewed as a single-instruction diagrammatic programming language called Run, whose only instruction is called RUN. This version: improved text, moved the final chapter to the next volume. (The final version will continue lots of exercises and workouts, but already this version has severely degraded graphics to meet the size bounds.)
