On well-founded and recursive coalgebras

DOI10.1007/978-3-030-45231-5_2zbMath1455.18001arXiv1910.09401OpenAlexW3022823504MaRDI QIDQ2200809

Lawrence S. Moss, Jiří Adámek, Stefan Milius

Publication date: 23 September 2020

Full work available at URL: https://arxiv.org/abs/1910.09401

zbMATH Keywords

initial algebrageneral recursion theoremwell-founded recursive coalgebra

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categorical semantics of formal languages (18C50) Foundations, relations to logic and deductive systems (18A15)

Related Items

A categorical framework for learning generalised tree automata ⋮ Corecursive algebras in nature

Cites Work

• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Semi-automated verification of security proofs of quantum cryptographic protocols
• Polynomial time decision algorithms for probabilistic automata
• Symbolic bisimulations
• A theory of bisimulation for the \(\pi\)-calculus
• Deciding bisimilarity and similarity for probabilistic processes.
• Probabilistic bisimulations for quantum processes
• Open Bisimulation for Quantum Processes
• An algebra of quantum processes
• Automated Equivalence Checking of Concurrent Quantum Systems
• Towards a quantum programming language
• Symbolic Bisimulation for Quantum Processes
• Communicating quantum processes
• Bisimulation for quantum processes
• Relations among quantum processes: bisimilarity and congruence