The talks were videotaped, and the talk slides collected. The organizers said all this material would probably be made public at some point. If it is, I will tell the whole world about it.

]]>• A higher-order temporal logic for dynamical systems — talk slides and video.

But this time he’s emphasizing the role of a hypergraph category where wires with arrows indicate ‘signal passing’, and the edges don’t have arrows.

]]>Perhaps predictable. SysML is a square-peg in a round-hole type of tool for everything but the narrow application area it’s designed for.

]]>It will start up this summer. The executive editors are Joshua Tan, Nina Otter, and Brendan Fong, and the board of advisors includes Bob Coecke, Steve Lack, Kathryn Hess and myself. It’s being funded by Ilyas Khan of Cambridge Quantum Computing.

]]>• Frank M.V. Feys, Helle Hvid Hansen and Lawrence S. Moss, Long-term values in Markov decision processes, (co)algebraically, in *Coalgebraic Methods in Computer Science (CMCS 2018)*.

A Markov decision process can be seen as a coalgebra of a certain functor. The classical theory of these, not using coalgebras, is well-developed:

• M. L. Puterman, *Markov Decision Processes: Discrete Stochastic Dynamic Programming*, John Wiley & Sons, 2014.

However, many of the standard concepts can be nicely phrased in terms of *maps from a coalgebra of one functor to an algebra of another*, a simple categorical concept I’d never considered.