A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors

Abstract : This paper presents a sound and complete sequent-style deduction system for determining behavioural equivalence in coalgebras of finitary set functors preserving weak pullbacks. We select finitary set functors because they are quotients of polynomial functors: the polynomial functor provides a ready-made signature and the quotient provides necessary additional axioms. We also show that certain operations on functors can be expressed with uniform changes to the presentations of the input functors, making this system compositional for a range of widely-studied classes of functors, such as the Kripke polynomial functors. Our system has roots in the $FLR_0$ proof system of Moschovakis et al., particularly as used by Moss, Wennstrom, and Whitney for non-wellfounded sets. Similarities can also be drawn to expression calculi in the style of Bonsangue, Rutten, and Silva.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01446025
Contributor : Hal Ifip <>
Submitted on : Wednesday, January 25, 2017 - 3:24:10 PM
Last modification on : Thursday, January 26, 2017 - 9:14:42 AM
Long-term archiving on : Wednesday, April 26, 2017 - 3:47:48 PM

File

418352_1_En_10_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

David Sprunger. A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors. 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2016, Eindhoven, Netherlands. pp.156-173, ⟨10.1007/978-3-319-40370-0_10⟩. ⟨hal-01446025⟩

Share

Metrics

Record views

92

Files downloads

111