%0 Conference Proceedings
%T Duality of Equations and Coequations via Contravariant Adjunctions
%+ Centrum Wiskunde & Informatica (CWI)
%+ Leiden Institute of Advanced Computer Science [Leiden] (LIACS)
%+ Laboratoire de l'Informatique du Parallélisme (LIP)
%A Salamanca, Julian
%A Bonsangue, Marcello
%A Rot, Jurriaan
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS)
%C Eindhoven, Netherlands
%Y Ichiro Hasuo
%3 Coalgebraic Methods in Computer Science
%V LNCS-9608
%P 73-93
%8 2016-04-02
%D 2016
%R 10.1007/978-3-319-40370-0_6
%Z Computer Science [cs]Conference papers
%X In this paper we show duality results between categories of equations and categories of coequations. These dualities are obtained as restrictions of dualities between categories of algebras and coalgebras, which arise by lifting contravariant adjunctions on the base categories. By extending this approach to (co)algebras for (co)monads, we retrieve the duality between equations and coequations for automata proved by Ballester-Bolinches, Cosme-Llópez and Rutten, and generalize it to dynamical systems.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-01446034/document
%2 https://inria.hal.science/hal-01446034/file/418352_1_En_6_Chapter.pdf
%L hal-01446034
%U https://inria.hal.science/hal-01446034
%~ ENS-LYON
%~ CNRS
%~ INRIA
%~ UNIV-LYON1
%~ LIP_PLUME
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9608
%~ IFIP-WG1-3
%~ IFIP-CMCS
%~ INRIA-AUT
%~ UDL
%~ UNIV-LYON