Cambridge Tracts in Theoretical Computer Science
Cambridge Tracts in Theoretical Computer Science
"Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing.
Levertijd op aanvraag
This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics. Seven chapters deal with various aspects of bisimulation and coinduction: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities.