Basic category theory for computer scientists / Benjamin C. Pierce [ Livre]

Auteur principal: Pierce, Benjamin C.Langue: Anglais ; de l'oeuvre originale, Anglais.Mention d'édition: 2nd printingPublication : London : MIT PRESS, 1993Description : XIII-100 pages ; 23 cmISBN: 0262660717.Collection: Foundations of computingClassification: 004.16 Logique mathématiqueRésumé: Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. .Sujet - Nom commun: Informatique -- Mathématiques | Catégories (mathématiques)
Current location Call number Status Notes Date due Barcode
ENS Rennes - Bibliothèque
Informatique
004.16 PIE (Browse shelf) Available 004.16 Logique mathématique 00007616
ENS Rennes - Bibliothèque
Informatique
004.16 PIE (Browse shelf) Exclu du prêt 004.16 Logique mathématique 000076161
ENS Rennes - Bibliothèque
Informatique
004.16 PIE (Browse shelf) Available 004.16 Logique mathématique 000076162
ENS Rennes - Bibliothèque
Informatique
004.16 PIE (Browse shelf) Available 004.16 Logique mathématique 000076163

Bibliogr. p. 81-91. Index

Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts.

Powered by Koha