Companions, Codensity and Causality

DOI10.1007/978-3-662-54458-7_7zbMath1442.68149OpenAlexW2613375231MaRDI QIDQ2988363

Jurriaan Rot, Damien Pous

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25696

Mathematics Subject Classification ID

Logic in computer science (03B70) Complete lattices, completions (06B23) Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)

Related Items (6)

Diacritical companions ⋮ Unnamed Item ⋮ Companions, Codensity and Causality ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Corecursion up-to via causal transformations

Uses Software

• CompCertTSO
• Paco

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general account of coinduction up-to
• Bialgebras for structural operational semantics: an introduction
• Category theory for operational semantics
• Proving language inclusion and equivalence by coinduction
• A calculus of mobile processes. I
• Algebraically compact functors
• Combining a monad and a comonad
• A theory of bisimulation for a fragment of concurrent ML with local names
• Distributive laws for the coinductive solution of recursive equations
• A lattice-theoretical fixpoint theorem and its applications
• Well-behaved Translations between Structural Operational Semantics
• Codensity and the ultrafilter monad
• Coalgebraic Characterizations of Context-Free Languages
• Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
• The power of parameterization in coinductive proof
• Companions, Codensity and Causality
• Complete Lattices and Up-To Techniques
• On the bisimulation proof method
• Coinduction up-to in a fibrational setting
• Coinduction All the Way Up
• A coinductive calculus of streams
• Polynomial functors and polynomial monads
• Presenting Morphisms of Distributive Laws
• Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
• CompCertTSO
• The Largest Respectful Function

This page was built for publication: Companions, Codensity and Causality