Author of the publication

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs.

, , and . LPAR, volume 57 of EPiC Series in Computing, page 271-289. EasyChair, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Bouncing threads for infinitary and circular proofs., , , and . CoRR, (2020)Kleene Algebra with Hypotheses., , , and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 207-223. Springer, (2019)Left-Handed Completeness for Kleene algebra, via Cyclic Proofs., , and . LPAR, volume 57 of EPiC Series in Computing, page 271-289. EasyChair, (2018)Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms., and . CONCUR, volume 171 of LIPIcs, page 29:1-29:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Constructive completeness for the linear-time μ-calculus.. LICS, page 1-12. IEEE Computer Society, (2017)The Class of Representable Semilattice-Ordered Monoids Is Not a Variety.. RAMiCS, volume 13027 of Lecture Notes in Computer Science, page 144-158. Springer, (2021)Non-Axiomatizability of the Equational Theories of Positive Relation Algebras (Invited Talk).. MFCS, volume 202 of LIPIcs, page 1:1-1:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Graph Characterization of the Universal Theory of Relations.. MFCS, volume 202 of LIPIcs, page 41:1-41:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Regular Expressions for Tree-Width 2 Graphs.. ICALP, volume 229 of LIPIcs, page 121:1-121:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)First-order tree-to-tree functions., and . LICS, page 252-265. ACM, (2020)