Fabio Zanasi

According to our database1, Fabio Zanasi authored at least 45 papers between 2013 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits.
CoRR, 2021

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

Coalgebraic Semantics for Probabilistic Logic Programming.
CoRR, 2020

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure.
CoRR, 2020

A String Diagrammatic Axiomatisation of Finite-State Automata.
CoRR, 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

Model Theory of Monadic Predicate Logic with the Infinity Quantifier.
CoRR, 2018

Equivalence checking for weak bi-Kleene algebra.
CoRR, 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...