Coinduction up-to in a fibrational setting
DOI10.1145/2603088.2603149zbMath1395.68195arXiv1401.6675OpenAlexW2077019667MaRDI QIDQ4635603
Daniela Petrişan, Jurriaan Rot, Filippo Bonchi, Damien Pous
Publication date: 23 April 2018
Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6675
similarityfibrationsbialgebrascoinductive predicatesup-to techniquesGSOSbisimulation up-tonominal automata
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30) Categories of machines, automata (18B20)
Related Items (22)
This page was built for publication: Coinduction up-to in a fibrational setting