| Description |
1 online resource (xvi, 477 pages) |
| Series |
Cambridge tracts in theoretical computer science ; 59 |
|
Cambridge tracts in theoretical computer science ; 59.
|
| Contents |
Motivation -- Coalgebras of polynomial functors -- Bisimulations -- Logic, lifting and finality -- Monads, comonads and distributive laws -- Invariants and assertions |
| Summary |
The area of coalgebra has emerged within theoretical computer science with a unifying claim: to be the mathematics of computational dynamics. It combines ideas from the theory of dynamical systems and from the theory of state-based computation. Although still in its infancy, it is an active area of research that generates wide interest. Written by one of the founders of the field, this book acts as the first mature and accessible introduction to coalgebra. It provides clear mathematical explanations, with many examples and exercises involving deterministic and non-deterministic automata, transition systems, streams, Markov chains and weighted automata. The theory is expressed in the language of category theory, which provides the right abstraction to make the similarity and duality between algebra and coalgebra explicit, and which the reader is introduced to in a hands-on manner. The book will be useful to mathematicians and (theoretical) computer scientists and will also be of interest to mathematical physicists, biologists and economists |
| Bibliography |
Includes bibliographical references (pages 440-465) and indexes |
| Notes |
Print version record |
| Subject |
Associative algebras.
|
|
Universal enveloping algebras.
|
|
Algebra, Universal.
|
|
MATHEMATICS -- Algebra -- Intermediate.
|
|
Álgebra universal
|
|
Algebra, Universal
|
|
Associative algebras
|
|
Universal enveloping algebras
|
|
Assoziative Algebra
|
|
Theoretische Informatik
|
| Form |
Electronic book
|
| ISBN |
9781316838563 |
|
1316838560 |
|
9781316837030 |
|
1316837033 |
|
