| Full abstraction for signal flow graphs F Bonchi, P Sobocinski, F Zanasi ACM SIGPLAN Notices 50 (1), 515-526, 2015 | 72 | 2015 |
| A categorical semantics of signal flow graphs F Bonchi, P Sobociński, F Zanasi International Conference on Concurrency Theory, 435-450, 2014 | 72 | 2014 |
| Interacting Hopf algebras F Bonchi, P Sobociński, F Zanasi Journal of Pure and Applied Algebra 221 (1), 144-184, 2017 | 60 | 2017 |
| Interacting Hopf Algebras: the theory of linear systems F Zanasi arXiv preprint arXiv:1805.03032, 2018 | 48 | 2018 |
| Rewriting modulo symmetric monoidal structure F Bonchi, F Gadducci, A Kissinger, P Sobociński, F Zanasi Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 38 | 2016 |
| Interacting bialgebras are Frobenius F Bonchi, P Sobociński, F Zanasi International Conference on Foundations of Software Science and Computation …, 2014 | 36 | 2014 |
| A predicate/state transformer semantics for Bayesian learning B Jacobs, F Zanasi | 32 | 2016 |
| The calculus of signal flow diagrams I: linear relations on streams F Bonchi, P Sobociński, F Zanasi Information and Computation 252, 2-29, 2017 | 30 | 2017 |
| Concurrent Kleene algebra: free model and completeness T Kappé, P Brunet, A Silva, F Zanasi European Symposium on Programming, 856-882, 2018 | 21 | 2018 |
| The logical essentials of Bayesian reasoning B Jacobs, F Zanasi arXiv preprint arXiv:1804.01193, 2018 | 21 | 2018 |
| Diagrammatic algebra: from linear to concurrent systems F Bonchi, J Holland, R Piedeleu, P Sobociński, F Zanasi Proceedings of the ACM on Programming Languages 3 (POPL), 1-28, 2019 | 19 | 2019 |
| Bialgebraic semantics for logic programming F Bonchi, F Zanasi arXiv preprint arXiv:1502.06095, 2015 | 17 | 2015 |
| Causal inference by string diagram surgery B Jacobs, A Kissinger, F Zanasi International Conference on Foundations of Software Science and Computation …, 2019 | 14 | 2019 |
| A formal semantics of influence in Bayesian reasoning B Jacobs, F Zanasi Dagstuhl: LIPICS, 2017 | 14 | 2017 |
| Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure F Bonchi, S Milius, A Silva, F Zanasi Theoretical Computer Science 604, 102-126, 2015 | 13 | 2015 |
| Saturated semantics for coalgebraic logic programming F Bonchi, F Zanasi International Conference on Algebra and Coalgebra in Computer Science, 80-94, 2013 | 13 | 2013 |
| Confluence of graph rewriting with interfaces F Bonchi, F Gadducci, A Kissinger, P Sobociński, F Zanasi European Symposium on Programming, 141-169, 2017 | 12 | 2017 |
| Weak MSO: Automata and expressiveness modulo bisimilarity F Carreiro, A Facchini, Y Venema, F Zanasi Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 12 | 2014 |
| A characterization theorem for the alternation-free fragment of the modal µ-calculus A Facchini, Y Venema, F Zanasi 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 478-487, 2013 | 12 | 2013 |
| Graphical affine algebra F Bonchi, R Piedeleu, P Sobociński, F Zanasi 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2019 | 10 | 2019 |
Filippo BonchiCNRS ENS-LyonVerified email at ens-lyon.fr
