Programs as Diagrams

DOI10.1007/978-3-031-34827-3MaRDI QIDQ6060786zbMATH OpenOpenAlexFDO

Authors Dusko Pavlovic

Publication date 5 November 2023

Published in Theory and Applications of Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2208.03817

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to category theory (18-01) String diagrams and graphical calculi (18M30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) General topics in the theory of computing (68Q01)

Abstract: 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.)

Recommendations

• Monoidal computer. I: Basic computability by string diagrams
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• scientific article; zbMATH DE number 3999258
• Introducing String Diagrams
• Introduction to Turing categories

Cited in

(5)

• Algebra and Coalgebra in Computer Science
• Testing randomness by Matching Pennies
• A categorical approach to DIBI models
• Compositional separation of control flow and data flow
• Functorial semantics for relational theories

This page was built for publication: Programs as Diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060786)