Author:
Salamanca J.,Ballester-Bolinches A.,Bonsangue M. M.,Cosme-Llópez E.,Rutten J. J. M. M.
Publisher
Springer International Publishing
Reference13 articles.
1. Abel, A., Pientka, B., Thibodeau, D., Setzer, A.: Copatterns: programming infinite structures by observations. In: Giacobazzi, R., Cousot, R. (eds.) Proceedings of the 40th Annual ACM Symposium on Principles of Programming Languages (POPL ’13), pp. 27–38, ACM (2013)
2. Lecture Notes in Computer Science;J Adámek,2014
3. Awodey, S., Hughes, J.: Modal operators and the formal dual of Birkhoff’s completeness theorem. Math. Struct. Comput. Sci. 13(2), 233–258 (2003)
4. Ballester-Bolinches, A., Cosme-Llópez, E., Rutten, J.J.M.M.: The dual equivalence of equations and coequations for automata. CWI Technical Report report FM-1403, pp. 1–30 (2014)
5. Birkhoff, G.: On the structure of abstract algebras. Proc Camb. Philos. Soc. 31, 433–454 (1935)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Minimisation in Logical Form;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
2. Duality of Equations and Coequations via Contravariant Adjunctions;Coalgebraic Methods in Computer Science;2016