Algebra and coalgebra in computer science

InhaltsverzeichnisInvited Talks.Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories.Labels from Reductions: Towards a General Theory.Adequacy for Algebraic Effects with State.Contributed Papers.Bisimilarity Is Not Finitely Based over BPA with Interrupt.Algebra ? Coalgebra = Presheaves.Strong Splitting Bisimulation Equivalence.Complete Axioms for Stateless Connectors.On the Semantics of Coinductive Types in Martin-Löf Type Theory.Look: Simple Stochastic Relations Are Just, Well, Simple.Modelling Fusion Calculus using HD-Automata.An Algebraic Framework for Verifying the Correctness of Hardware with Input and Output: A Formalization in HOL.Using Proofs by Coinduction to Find “Traditional” Proofs.From T-Coalgebras to Filter Structures and Transition Systems.Context-Free Languages via Coalgebraic Trace Semantics.Towards a Coalgebraic Semantics of the Ambient Calculus.The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic.Ultrafilter Extensions for Coalgebras.Equational Logic of Recursive Program Schemes.The Category Theoretic Solution of Recursive Program Schemes.A Categorical Approach to Simulations.Behavioral Extensions of Institutions.Discrete Lawvere Theories.Final Semantics for Event-Pattern Reactive Programs.Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing.Final Sequences and Final Coalgebras for Measurable Spaces.Bireachability and Final Multialgebras.Parametrized Exceptions.Property Preserving Redesign of Specifications.