Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabio Zanasi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c43]Tao Gu, Jialu Bao, Justin Hsu, Alexandra Silva, Fabio Zanasi:
A Categorical Approach to DIBI Models. FSCD 2024: 17:1-17:20- [c42]Mateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva, Fabio Zanasi:
On Iteration in Discrete Probabilistic Programming. FSCD 2024: 20:1-20:21 - [i37]Tao Gu, Jialu Bao, Justin Hsu, Alexandra Silva, Fabio Zanasi:
A Categorical Approach to DIBI Models. CoRR abs/2401.05842 (2024) - [i36]Dario Stein, Fabio Zanasi, Richard Samuelson, Robin Piedeleu:
Graphical Quadratic Algebra. CoRR abs/2403.02284 (2024) - [i35]Geoffrey S. H. Cruttwell, Bruno Gavranovic, Neil Ghani, Paul W. Wilson, Fabio Zanasi:
Deep Learning with Parametric Lenses. CoRR abs/2404.00408 (2024) - [i34]Ekaterina Piotrovskaya, Leo Lobski, Fabio Zanasi:
Learning Closed Signal Flow Graphs. CoRR abs/2407.00245 (2024) - 2023
- [j19]Paul W. Wilson
, Fabio Zanasi:
An axiomatic approach to differentiation of polynomial circuits. J. Log. Algebraic Methods Program. 135: 100892 (2023) - [j18]Robin Piedeleu, Fabio Zanasi:
A Finite Axiomatisation of Finite-State Automata Using String Diagrams. Log. Methods Comput. Sci. 19(1) (2023) - [c41]Aleksandar Milosavljevic, Robin Piedeleu, Fabio Zanasi:
String Diagram Rewriting Modulo Commutative (Co)Monoid Structure. CALCO 2023: 9:1-9:17 - [c40]Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Functorial String Diagrams for Reverse-Mode Automatic Differentiation. CSL 2023: 6:1-6:20 - [c39]Paul W. Wilson, Dan R. Ghica, Fabio Zanasi:
String Diagrams for Non-Strict Monoidal Categories. CSL 2023: 37:1-37:19 - [c38]Ella Gale, Leo Lobski, Fabio Zanasi:
A Categorical Approach to Synthetic Chemistry. ICTAC 2023: 276-294 - [i33]Paul W. Wilson, Fabio Zanasi:
Data-Parallel Algorithms for String Diagrams. CoRR abs/2305.01041 (2023) - [i32]Robin Piedeleu, Fabio Zanasi:
An Introduction to String Diagrams for Computer Scientists. CoRR abs/2305.08768 (2023) - [i31]Dan R. Ghica, Fabio Zanasi:
Hierarchical string diagrams and applications. CoRR abs/2305.18945 (2023) - [i30]Ella Gale, Leo Lobski, Fabio Zanasi:
A Categorical Model for Retrosynthetic Reaction Analysis. CoRR abs/2311.04085 (2023) - 2022
- [j17]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Model theory of monadic predicate logic with the infinity quantifier. Arch. Math. Log. 61(3-4): 465-502 (2022) - [j16]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure. J. ACM 69(2): 14:1-14:58 (2022) - [j15]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String diagram rewrite theory II: Rewriting with symmetric monoidal structure. Math. Struct. Comput. Sci. 32(4): 511-541 (2022) - [j14]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String diagram rewrite theory III: Confluence with and without Frobenius. Math. Struct. Comput. Sci. 32(7): 829-869 (2022) - [j13]Helle Hvid Hansen, Fabio Zanasi:
Report on coalgebraic methods in computer science 2022. ACM SIGLOG News 9(3): 61-62 (2022) - [c37]Geoffrey S. H. Cruttwell, Bruno Gavranovic, Neil Ghani, Paul W. Wilson, Fabio Zanasi:
Categorical Foundations of Gradient-Based Learning. ESOP 2022: 1-28 - [c36]Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Rewriting for Monoidal Closed Categories. FSCD 2022: 29:1-29:20 - [c35]Paul W. Wilson, Fabio Zanasi:
Categories of Differentiable Polynomial Circuits for Machine Learning. ICGT 2022: 77-93 - [c34]Leo Lobski, Fabio Zanasi:
String Diagrams for Layered Explanations. ACT 2022: 362-382 - [c33]Tao Gu, Robin Piedeleu, Fabio Zanasi:
A Complete Diagrammatic Calculus for Boolean Satisfiability. MFPS 2022 - [e1]Helle Hvid Hansen, Fabio Zanasi:
Coalgebraic Methods in Computer Science - 16th IFIP WG 1.3 International Workshop, CMCS 2022, Colocated with ETAPS 2022, Munich, Germany, April 2-3, 2022, Proceedings. Lecture Notes in Computer Science 13225, Springer 2022, ISBN 978-3-031-10735-1 [contents] - [i29]Paul W. Wilson, Fabio Zanasi:
Categories of Differentiable Polynomial Circuits for Machine Learning. CoRR abs/2203.06430 (2022) - [i28]Aleksandar Milosavljevic, Fabio Zanasi:
String Diagram Rewriting Modulo Commutative Monoid Structure. CoRR abs/2204.04274 (2022) - [i27]Robin Piedeleu, Fabio Zanasi:
A Finite Axiomatisation of Finite-State Automata Using String Diagrams. CoRR abs/2211.16484 (2022) - 2021
- [j12]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Bialgebraic foundations for the operational semantics of string diagrams. Inf. Comput. 281: 104767 (2021) - [j11]Tao Gu, Fabio Zanasi:
Coalgebraic Semantics for Probabilistic Logic Programming. Log. Methods Comput. Sci. 17(2) (2021) - [j10]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Equivalence checking for weak bi-Kleene algebra. Log. Methods Comput. Sci. 17(3) (2021) - [j9]Bart Jacobs, Aleks Kissinger, Fabio Zanasi:
Causal inference via string diagram surgery: A diagrammatic approach to interventions and counterfactuals. Math. Struct. Comput. Sci. 31(5): 553-574 (2021) - [c32]Filippo Bonchi, Alessandro Di Giorgio, Fabio Zanasi:
From Farkas' Lemma to Linear Programming: an Exercise in Diagrammatic Algebra ((Co)algebraic pearls). CALCO 2021: 9:1-9:19 - [c31]Tao Gu, Fabio Zanasi:
Functorial Semantics as a Unifying Perspective on Logic Programming. CALCO 2021: 17:1-17:22 - [c30]Robin Piedeleu, Fabio Zanasi:
A String Diagrammatic Axiomatisation of Finite-State Automata. FoSSaCS 2021: 469-489 - [c29]Paul W. Wilson, Fabio Zanasi:
The Cost of Compositionality: A High-Performance Implementation of String Diagram Composition. ACT 2021: 262-275 - [p1]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
A Survey of Compositional Signal Flow Theory. IFIP's Exciting First 60+ Years 2021: 29-56 - [i26]Geoff S. H. Cruttwell, Bruno Gavranovic, Neil Ghani, Paul W. Wilson, Fabio Zanasi:
Categorical Foundations of Gradient-Based Learning. CoRR abs/2103.01931 (2021) - [i25]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure. CoRR abs/2104.14686 (2021) - [i24]Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi:
Functorial String Diagrams for Reverse-Mode Automatic Differentiation. CoRR abs/2107.13433 (2021) - [i23]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory III: Confluence with and without Frobenius. CoRR abs/2109.06049 (2021) - 2020
- [j8]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
The Power of the Weak. ACM Trans. Comput. Log. 21(2): 15:1-15:47 (2020) - [c28]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Contextual Equivalence for Signal Flow Graphs. FoSSaCS 2020: 77-96 - [c27]Tobias Kappé, Paul Brunet, Alexandra Silva, Jana Wagemaker, Fabio Zanasi:
Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness. FoSSaCS 2020: 381-400 - [c26]Tao Gu, Alexandra Silva, Fabio Zanasi:
Hennessy-Milner Results for Probabilistic PDL. MFPS 2020: 283-304 - [c25]Paul W. Wilson, Fabio Zanasi:
Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits. ACT 2020: 247-260 - [i22]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Contextual Equivalence for Signal Flow Graphs. CoRR abs/2002.08874 (2020) - [i21]Tobias Kappé, Paul Brunet, Alexandra Silva, Jana Wagemaker, Fabio Zanasi:
Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness. CoRR abs/2002.09682 (2020) - [i20]Robin Piedeleu, Fabio Zanasi:
A String Diagrammatic Axiomatisation of Finite-State Automata. CoRR abs/2009.14576 (2020) - [i19]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure. CoRR abs/2012.01847 (2020) - [i18]Tao Gu, Fabio Zanasi:
Coalgebraic Semantics for Probabilistic Logic Programming. CoRR abs/2012.03916 (2020)
2010 – 2019
- 2019
- [j7]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
On series-parallel pomset languages: Rationality, context-freeness and automata. J. Log. Algebraic Methods Program. 103: 130-153 (2019) - [j6]Filippo Bonchi, Joshua Holland, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Diagrammatic algebra: from linear to concurrent systems. Proc. ACM Program. Lang. 3(POPL): 25:1-25:28 (2019) - [c24]Tao Gu, Fabio Zanasi:
A Coalgebraic Perspective on Probabilistic Logic Programming. CALCO 2019: 10:1-10:21 - [c23]Pawel Sobocinski, Paul W. Wilson, Fabio Zanasi:
CARTOGRAPHER: A Tool for String Diagrammatic Reasoning (Tool Paper). CALCO 2019: 20:1-20:7 - [c22]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Bialgebraic Semantics for String Diagrams. CONCUR 2019: 37:1-37:17 - [c21]Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva, Jana Wagemaker, Fabio Zanasi:
Kleene Algebra with Observations. CONCUR 2019: 41:1-41:16 - [c20]Bart Jacobs, Aleks Kissinger, Fabio Zanasi:
Causal Inference by String Diagram Surgery. FoSSaCS 2019: 313-329 - [c19]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Graphical Affine Algebra. LICS 2019: 1-12 - [i17]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Bialgebraic Semantics for String Diagrams. CoRR abs/1906.01519 (2019) - 2018
- [j5]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Deconstructing Lawvere with distributive laws. J. Log. Algebraic Methods Program. 95: 128-146 (2018) - [j4]Brendan Fong, Fabio Zanasi:
Universal Constructions for (Co)Relations: categories, monoidal categories, and props. Log. Methods Comput. Sci. 14(3) (2018) - [c18]Tobias Kappé, Paul Brunet, Alexandra Silva, Fabio Zanasi:
Concurrent Kleene Algebra: Free Model and Completeness. ESOP 2018: 856-882 - [c17]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting with Frobenius. LICS 2018: 165-174 - [i16]Bart Jacobs, Fabio Zanasi:
The Logical Essentials of Bayesian Reasoning. CoRR abs/1804.01193 (2018) - [i15]Fabio Zanasi:
Interacting Hopf Algebras: the theory of linear systems. CoRR abs/1805.03032 (2018) - [i14]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Equivalence checking for weak bi-Kleene algebra. CoRR abs/1807.02102 (2018) - [i13]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Model Theory of Monadic Predicate Logic with the Infinity Quantifier. CoRR abs/1809.03262 (2018) - [i12]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
The Power of the Weak. CoRR abs/1809.03896 (2018) - [i11]Bart Jacobs, Aleks Kissinger, Fabio Zanasi:
Causal Inference by String Diagram Surgery. CoRR abs/1811.08338 (2018) - [i10]Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva, Jana Wagemaker, Fabio Zanasi:
Kleene Algebra with Observations. CoRR abs/1811.10401 (2018) - [i9]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
On Series-Parallel Pomset Languages: Rationality, Context-Freeness and Automata. CoRR abs/1812.03058 (2018) - 2017
- [j3]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
The Calculus of Signal Flow Diagrams I: Linear relations on streams. Inf. Comput. 252: 2-29 (2017) - [c16]Brendan Fong, Fabio Zanasi:
A Universal Construction for (Co)Relations. CALCO 2017: 12:1-12:16 - [c15]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. CONCUR 2017: 25:1-25:16 - [c14]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Confluence of Graph Rewriting with Interfaces. ESOP 2017: 141-169 - [c13]Bart Jacobs, Fabio Zanasi:
A Formal Semantics of Influence in Bayesian Reasoning. MFCS 2017: 21:1-21:14 - [c12]Fabio Zanasi:
Rewriting in Free Hypegraph Categories. GaM@ETAPS 2017: 16-30 - [i8]Brendan Fong, Fabio Zanasi:
A Universal Construction for (Co)Relations. CoRR abs/1703.08247 (2017) - [i7]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. CoRR abs/1704.07199 (2017) - [i6]Tobias Kappé, Paul Brunet, Alexandra Silva, Fabio Zanasi:
Concurrent Kleene Algebra: Free Model and Completeness. CoRR abs/1710.02787 (2017) - [i5]Brendan Fong, Fabio Zanasi:
Universal Constructions for (Co)Relations: categories, monoidal categories, and props. CoRR abs/1710.03894 (2017) - 2016
- [c11]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Lawvere Categories as Composed PROPs. CMCS 2016: 11-32 - [c10]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting modulo symmetric monoidal structure. LICS 2016: 710-719 - [c9]Bart Jacobs, Fabio Zanasi:
A Predicate/State Transformer Semantics for Bayesian Learning. MFPS 2016: 185-200 - [c8]Fabio Zanasi:
The Algebra of Partial Equivalence Relations. MFPS 2016: 313-333 - [i4]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting modulo symmetric monoidal structure. CoRR abs/1602.06771 (2016) - 2015
- [b1]Fabio Zanasi:
Interacting Hopf Algebras- the Theory of Linear Systems. (Interacting Hopf Algebras - la théorie des systèmes linéaires). École normale supérieure de Lyon, France, 2015 - [j2]Filippo Bonchi, Fabio Zanasi:
Bialgebraic Semantics for Logic Programming. Log. Methods Comput. Sci. 11(1) (2015) - [j1]Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi:
Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure. Theor. Comput. Sci. 604: 102-126 (2015) - [c7]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Full Abstraction for Signal Flow Graphs. POPL 2015: 515-526 - 2014
- [c6]Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi:
How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. CMCS 2014: 53-74 - [c5]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
A Categorical Semantics of Signal Flow Graphs. CONCUR 2014: 435-450 - [c4]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Weak MSO: automata and expressiveness modulo bisimilarity. CSL-LICS 2014: 27:1-27:27 - [c3]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Interacting Bialgebras Are Frobenius. FoSSaCS 2014: 351-365 - [i3]Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
Weak MSO: Automata and Expressiveness Modulo Bisimilarity. CoRR abs/1401.4374 (2014) - [i2]Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi:
How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. CoRR abs/1402.4062 (2014) - [i1]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Interacting Hopf Algebras. CoRR abs/1403.7048 (2014) - 2013
- [c2]Filippo Bonchi, Fabio Zanasi:
Saturated Semantics for Coalgebraic Logic Programming. CALCO 2013: 80-94 - [c1]Alessandro Facchini, Yde Venema, Fabio Zanasi:
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus. LICS 2013: 478-487
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
