Programs as Diagrams From Categorical Computability to Computable Categories /

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 univer...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijä: Pavlovic, Dusko (Tekijä)
Yhteisötekijä: SpringerLink (Online service)
Aineistotyyppi: Elektroninen E-kirja
Kieli:englanti
Julkaistu: Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Painos:1st ed. 2023.
Sarja:Theory and Applications of Computability, In cooperation with the Association Computability in Europe,
Aiheet:
Linkit:https://doi.org/10.1007/978-3-031-34827-3
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-34827-3
003 DE-He213
005 20260810114953.0
007 cr nn 008mamaa
008 230919s2023 sz | o |||| 0|eng d
020 |a 9783031348273  |9 978-3-031-34827-3 
024 7 |a 10.1007/978-3-031-34827-3  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
100 1 |a Pavlovic, Dusko.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Programs as Diagrams  |h [electronic resource] :  |b From Categorical Computability to Computable Categories /  |c by Dusko Pavlovic. 
250 |a 1st ed. 2023. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2023. 
300 |a 1 online resource (XVII, 252 p. 1 illus.). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theory and Applications of Computability, In cooperation with the Association Computability in Europe,  |x 2190-6203 
505 0 |a 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. 
520 |a 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. 
588 |a Print version record. 
650 0 |a Computer science. 
650 0 |a Computable functions. 
650 0 |a Recursion theory. 
650 0 |a Computational complexity. 
650 0 |a Programming languages (Electronic computers). 
650 1 4 |a Theory of Computation. 
650 2 4 |a Computability and Recursion Theory. 
650 2 4 |a Computational Complexity. 
650 2 4 |a Programming Language. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031348266 
776 0 8 |i Printed edition:  |z 9783031348280 
776 0 8 |i Printed edition:  |z 9783031348297 
830 0 |a Theory and Applications of Computability, In cooperation with the Association Computability in Europe,  |x 2190-6203 
856 4 0 |u https://doi.org/10.1007/978-3-031-34827-3 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)