Date: Friday February 16, 2017
Place: University of Tokyo
Title: Categorical accounts for computing systems
Speaker: Jérémy Dubut (NII)
In this talk, I will give you a big picture of one use of category theory in computer science. The motto is that category theory is the right level of abstraction to reason about computing systems, their operational behaviour and their equivalence (bisimulation). From the simple and classical case of transition system, I will show you how it is possible to extract the mathematical essence of a problem using category theory. This essence will be formalised as the open bisimilarity in categorical models, a kind of categorical parametrised instance of computing systems together with their equivalence, that can be instantiated to give back many known situations (transition systems with silent move, probabilistic systems, …) and new ones (timed systems, presheaves, …).
No prior knowledge in category theory is required.