| A categorical semantics of signal flow graphs F Bonchi, P Sobociński, F Zanasi International Conference on Concurrency Theory, 435-450, 2014 | 104 | 2014 |
| Interacting hopf algebras F Bonchi, P Sobociński, F Zanasi Journal of Pure and Applied Algebra 221 (1), 144-184, 2017 | 101 | 2017 |
| Full abstraction for signal flow graphs F Bonchi, P Sobocinski, F Zanasi ACM SIGPLAN Notices 50 (1), 515-526, 2015 | 99 | 2015 |
| Interacting Hopf Algebras: the theory of linear systems F Zanasi arXiv preprint arXiv:1805.03032, 2018 | 83 | 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 | 62 | 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 | 54 | 2017 |
| 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 | 53 | 2019 |
| Causal inference by string diagram surgery B Jacobs, A Kissinger, F Zanasi Foundations of Software Science and Computation Structures: 22nd …, 2019 | 51 | 2019 |
| 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 | 50 | 2019 |
| Categorical foundations of gradient-based learning GSH Cruttwell, B Gavranović, N Ghani, P Wilson, F Zanasi European Symposium on Programming, 1-28, 2022 | 45 | 2022 |
| Interacting bialgebras are Frobenius F Bonchi, P Sobociński, F Zanasi Foundations of Software Science and Computation Structures: 17th …, 2014 | 44 | 2014 |
| String diagram rewrite theory I: rewriting with frobenius structure F Bonchi, F Gadducci, A Kissinger, P Sobocinski, F Zanasi Journal of the ACM (JACM) 69 (2), 1-58, 2022 | 40 | 2022 |
| A predicate/state transformer semantics for Bayesian learning B Jacobs, F Zanasi Electronic Notes in Theoretical Computer Science 325, 185-200, 2016 | 38 | 2016 |
| Concurrent Kleene algebra: Free model and completeness T Kappé, P Brunet, A Silva, F Zanasi Programming Languages and Systems: 27th European Symposium on Programming …, 2018 | 37 | 2018 |
| The logical essentials of Bayesian reasoning B Jacobs, F Zanasi Foundations of Probabilistic Programming, 295-331, 2020 | 36 | 2020 |
| Confluence of graph rewriting with interfaces F Bonchi, F Gadducci, A Kissinger, P Sobociński, F Zanasi Programming Languages and Systems: 26th European Symposium on Programming …, 2017 | 26 | 2017 |
| Bialgebraic semantics for logic programming F Bonchi, F Zanasi Logical Methods in Computer Science 11, 2015 | 22 | 2015 |
| String diagram rewrite theory II: Rewriting with symmetric monoidal structure F Bonchi, F Gadducci, A Kissinger, P Sobocinski, F Zanasi Mathematical Structures in Computer Science 32 (4), 511-541, 2022 | 20 | 2022 |
| Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness. T Kappé, P Brunet, A Silva, J Wagemaker, F Zanasi FoSSaCS, 381-400, 2020 | 20 | 2020 |
| Deconstructing Lawvere with distributive laws F Bonchi, P Sobociński, F Zanasi Journal of logical and algebraic methods in programming 95, 128-146, 2018 | 19 | 2018 |
Filippo BonchiCNRS ENS-LyonVerified email at ens-lyon.fr
