Complete Lattices and Up-To Techniques
From MaRDI portal
Publication:3498446
DOI10.1007/978-3-540-76637-7_24zbMath1138.68041OpenAlexW1539196615MaRDI QIDQ3498446
Publication date: 15 May 2008
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://hal-ens-lyon.archives-ouvertes.fr/ensl-00155308v2/file/LIP-RR2007-30.pdf
Complete lattices, completions (06B23) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Tower Induction and Up-to Techniques for CCS with Fixed Points ⋮ Latticed \(k\)-induction with an application to probabilistic programs ⋮ Diacritical companions ⋮ Fixpoint Theory -- Upside Down ⋮ Compatibility of refining and controlling plant automata with bisimulation quotients ⋮ Enhanced coalgebraic bisimulation ⋮ Up-to techniques for behavioural metrics via fibrations ⋮ Companions, Codensity and Causality ⋮ Unnamed Item ⋮ Fixpoint theory -- upside down ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ Up-To Techniques for Behavioural Metrics via Fibrations ⋮ A general account of coinduction up-to ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Unnamed Item ⋮ Mechanized metatheory revisited ⋮ Unnamed Item ⋮ Corecursion up-to via causal transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficiency preorder for processes
- On reduction-based process semantics
- A calculational approach to mathematical induction
- A hierarchy of equivalences for asynchronous calculi
- Proving congruence of bisimulation in functional programming languages
- A lattice-theoretical fixpoint theorem and its applications
- On the bisimulation proof method
- Typed behavioural equivalences for processes in the presence of subtyping
- Weak Bisimulation Up to Elaboration
