Fabio Zanasi

Orcid: 0000-0001-6457-1345

According to our database1, Fabio Zanasi authored at least 78 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Disconnection Rules are Complete for Chemical Reactions.
CoRR, 2024

A Fibrational Theory of First Order Differential Structures.
CoRR, 2024

A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming.
CoRR, 2024

Learning Closed Signal Flow Graphs.
CoRR, 2024

Deep Learning with Parametric Lenses.
CoRR, 2024

Graphical Quadratic Algebra.
CoRR, 2024

On Iteration in Discrete Probabilistic Programming.
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

A Categorical Approach to DIBI Models.
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

2023
An axiomatic approach to differentiation of polynomial circuits.
J. Log. Algebraic Methods Program., October, 2023

A Finite Axiomatisation of Finite-State Automata Using String Diagrams.
Log. Methods Comput. Sci., 2023

A Categorical Model for Retrosynthetic Reaction Analysis.
CoRR, 2023

Hierarchical string diagrams and applications.
CoRR, 2023

An Introduction to String Diagrams for Computer Scientists.
CoRR, 2023

Data-Parallel Algorithms for String Diagrams.
CoRR, 2023

A Categorical Approach to Synthetic Chemistry.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

Functorial String Diagrams for Reverse-Mode Automatic Differentiation.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

String Diagrams for Non-Strict Monoidal Categories.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

String Diagram Rewriting Modulo Commutative (Co)Monoid Structure.
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
String diagram rewrite theory III: Confluence with and without Frobenius.
Math. Struct. Comput. Sci., August, 2022

String diagram rewrite theory II: Rewriting with symmetric monoidal structure.
Math. Struct. Comput. Sci., April, 2022

Report on coalgebraic methods in computer science 2022.
ACM SIGLOG News, 2022

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure.
J. ACM, 2022

A Complete Diagrammatic Calculus for Boolean Satisfiability.
Proceedings of the 38th Conference on the Mathematical Foundations of Programming Semantics, 2022

String Diagrams for Layered Explanations.
Proceedings of the Proceedings Fifth International Conference on Applied Category Theory, 2022

String Diagram Rewriting Modulo Commutative Monoid Structure.
CoRR, 2022

Model theory of monadic predicate logic with the infinity quantifier.
Arch. Math. Log., 2022

Categories of Differentiable Polynomial Circuits for Machine Learning.
Proceedings of the Graph Transformation - 15th International Conference, 2022

Rewriting for Monoidal Closed Categories.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

Categorical Foundations of Gradient-Based Learning.
Proceedings of the Programming Languages and Systems, 2022

2021
A Survey of Compositional Signal Flow Theory.
Proceedings of the Advancing Research in Information and Communication Technology, 2021

Causal inference via string diagram surgery: A diagrammatic approach to interventions and counterfactuals.
Math. Struct. Comput. Sci., 2021

Equivalence checking for weak bi-Kleene algebra.
Log. Methods Comput. Sci., 2021

Coalgebraic Semantics for Probabilistic Logic Programming.
Log. Methods Comput. Sci., 2021

Bialgebraic foundations for the operational semantics of string diagrams.
Inf. Comput., 2021

The Cost of Compositionality: A High-Performance Implementation of String Diagram Composition.
Proceedings of the Fourth International Conference on Applied Category Theory, 2021

A String Diagrammatic Axiomatisation of Finite-State Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

Functorial Semantics as a Unifying Perspective on Logic Programming.
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

From Farkas' Lemma to Linear Programming: an Exercise in Diagrammatic Algebra ((Co)algebraic pearls).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
The Power of the Weak.
ACM Trans. Comput. Log., 2020

Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits.
Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

Hennessy-Milner Results for Probabilistic PDL.
Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Contextual Equivalence for Signal Flow Graphs.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
Diagrammatic algebra: from linear to concurrent systems.
Proc. ACM Program. Lang., 2019

On series-parallel pomset languages: Rationality, context-freeness and automata.
J. Log. Algebraic Methods Program., 2019

Graphical Affine Algebra.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Causal Inference by String Diagram Surgery.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Kleene Algebra with Observations.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

Bialgebraic Semantics for String Diagrams.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

CARTOGRAPHER: A Tool for String Diagrammatic Reasoning (Tool Paper).
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

A Coalgebraic Perspective on Probabilistic Logic Programming.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Universal Constructions for (Co)Relations: categories, monoidal categories, and props.
Log. Methods Comput. Sci., 2018

Deconstructing Lawvere with distributive laws.
J. Log. Algebraic Methods Program., 2018

Interacting Hopf Algebras: the theory of linear systems.
CoRR, 2018

The Logical Essentials of Bayesian Reasoning.
CoRR, 2018

Rewriting with Frobenius.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Concurrent Kleene Algebra: Free Model and Completeness.
Proceedings of the Programming Languages and Systems, 2018

2017
The Calculus of Signal Flow Diagrams I: Linear relations on streams.
Inf. Comput., 2017

Rewriting in Free Hypegraph Categories.
Proceedings of the Proceedings Third Workshop on Graphs as Models, 2017

A Formal Semantics of Influence in Bayesian Reasoning.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Confluence of Graph Rewriting with Interfaces.
Proceedings of the Programming Languages and Systems, 2017

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

A Universal Construction for (Co)Relations.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
The Algebra of Partial Equivalence Relations.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

A Predicate/State Transformer Semantics for Bayesian Learning.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

Rewriting modulo symmetric monoidal structure.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Lawvere Categories as Composed PROPs.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

2015
Interacting Hopf Algebras- the Theory of Linear Systems. (Interacting Hopf Algebras - la théorie des systèmes linéaires).
PhD thesis, 2015

Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure.
Theor. Comput. Sci., 2015

Bialgebraic Semantics for Logic Programming.
Log. Methods Comput. Sci., 2015

Full Abstraction for Signal Flow Graphs.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

2014
Interacting Hopf Algebras.
CoRR, 2014

Interacting Bialgebras Are Frobenius.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Weak MSO: automata and expressiveness modulo bisimilarity.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

A Categorical Semantics of Signal Flow Graphs.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

2013
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Saturated Semantics for Coalgebraic Logic Programming.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013


  Loading...