Mendeley出力
Programs as Diagrams : From Categorical Computability to Computable Categories / by Dusko Pavlovic
(Theory and Applications of Computability, In cooperation with the association Computability in Europe. ISSN:21906203)
| データ種別 | 電子ブック |
|---|---|
| 版 | 1st ed. 2023. |
| 出版者 | (Cham : Springer Nature Switzerland : Imprint: Springer) |
| 出版年 | 2023 |
| 大きさ | XVII, 252 p. 1 illus : online resource |
| 著者標目 | *Pavlovic, Dusko author SpringerLink (Online service) |
書誌詳細を非表示
| 一般注記 | 1. Drawing Types and Functions -- 2. Monoidal Computer: Computability as a Structure -- 3. Fixpoints -- 4. What can be Computed -- 5. What cannot be Computed -- 6. Computing Programs -- 7. Program-Closed Categories: Computability as a Property -- 8. Computable Categories and Effective Categorical Operations It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions. In this unique textbook/reference, programs are drawn as string diagrams in the language of categories, which display a universal syntax of mathematics (Computer scientists use them to analyze the program semantics; programmers to display the syntax of computations). Here, the string-diagrammatic depictions of computations are construed as programs in a single-instruction programming language. Such programs as diagrams show how functions are packed in boxes and tied by strings. Readers familiar with categories will learn about the foundations of computability; readers familiar with computability gain access to category theory. Additionally, readers familiar with both are offered many opportunities to improve the approach. Topics and features: Delivers a ‘crash’ diagram-based course in theory of computation Uses single-instruction diagrammatic programming language Offers a practical introduction into categories and string diagrams as computational tools Reveals how computability is programmability, rather than an ‘ether’ permeating computers Provides a categorical model of intensional computation is unique up to isomorphism Serves as a stepping stone into research of computable categories In addition to its early chapters introducing computability for beginners, this flexible textbook/resource also contains both middle chapters that expand for suitability to a graduate course as well as final chapters opening up new research. Dusko Pavlovic is a professor at the Department of Information and Computer Sciences at the University of Hawaii at Manoa, and by courtesy at the Department of Mathematics and the College of Engineering. He completed this book as an Excellence Professor at Radboud University in Nijmegen, The Netherlands HTTP:URL=https://doi.org/10.1007/978-3-031-34827-3 |
|---|---|
| 件 名 | LCSH:Computer science LCSH:Computable functions LCSH:Recursion theory LCSH:Computational complexity LCSH:Programming languages (Electronic computers) FREE:Theory of Computation FREE:Computability and Recursion Theory FREE:Computational Complexity FREE:Programming Language |
| 分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
| 書誌ID | EB00003813 |
| ISBN | 9783031348273 |
類似資料
この資料の利用統計
このページへのアクセス回数：9回
※2019年3月27日以降
全貸出数：0回
(1年以内の貸出：0回)
※2019年3月27日以降