Relating Structure and Power: Comonadic Semantics for Computational Resources.- Coalgebraic Logics and Duality.- Intuitionistic Podelski-Rybalchenko Theorem and Equivalence between Inductive Definitions and Cyclic Proofs.- Undecidability of Equality for Codata Types.- Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.- Long-Term Values in Markov Decision Processes, (Co)Algebraically.- (In)finite Trace Equivalence of Probabilistic Transition Systems.- Steps and Traces.- On Algebras with Effectful Iteration.- Monoidal computer III: A coalgebraic view of computability and complexity.- Fibrational Bisimulations and Quantitative Reasoning.- Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors.
Note: Online resource; title from PDF title page (SpringerLink, viewed September 26, 2018).
Access Rights:
Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
Access Usage:
Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.