Diacritical companions
From MaRDI portal
Publication:2133161
DOI10.1016/j.entcs.2019.09.003OpenAlexW4211188130WikidataQ113317360 ScholiaQ113317360MaRDI QIDQ2133161
Piotr Polesiuk, Dariusz Biernacki, Sergueï Lenglet
Publication date: 29 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.09.003
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proving soundness of extensional normal-form bisimilarities
- 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
- Tower Induction and Up-to Techniques for CCS with Fixed Points
- Enhancements of the bisimulation proof method
- The Largest Respectful Function
This page was built for publication: Diacritical companions