Algebra and Coalgebra in Computer Science Book

	Abstract scalars, loops, and free traced and strongly compact closed categories	1
	Labels from reductions : towards a general theory	30
	Adequacy for algebraic effects with state	51
	Bisimilarity is not finitely based over BPA with interrupt	52
	Algebra [actual symbol not reproducible] coalgebra = presheaves	67
	Strong splitting bisimulation equivalence	83
	Complete axioms for stateless connectors	98
	On the semantics of coinductive types in Martin-Lof type theory	114
	Look : simple stochastic relations are just, well, simple	127
	Modelling fusion calculus using HD-automata	142
	An algebraic framework for verifying the correctness of hardware with input and output : a formalization in HOL	157
	Using proofs by coinduction to find "traditional" proofs	175
	From T-coalgebras to filter structures and transition systems	194
	Context-free languages via coalgebraic trace semantics	213
	Towards a coalgebraic semantics of the ambient calculus	232
	The least fibred lifting and the expressivity of coalgebraic modal logic	247
	Ultrafilter extensions for coalgebras	263
	Equational logic of recursive program schemes	278
	The category theoretic solution of recursive program schemes	293
	A categorical approach to simulations	313
	Behavioral extensions of institutions	331
	Discrete Lawvere theories	348
	Final semantics for event-pattern reactive programs	364
	Complete symbolic reachability analysis using back-and-forth narrowing	379
	Final sequences and final coalgebras for measurable spaces	395
	Bireachability and final multialgebras	408
	Parametrized exceptions	424
	Property preserving redesign of specifications	439