4 citations · 9 across the 5 of their papers we have counts for
6 papers
Stone Duality Proofs for Colorless Distributed Computability Theorems
Cameron Calk, Emmanuel Godard
We introduce a new topological encoding of executions of round-based, full-information distributed protocols via spectral spaces. Such protocols constitute a model of distributed c…
Higher Catoids, Higher Quantales and their Correspondences
Cameron Calk, Philippe Malbos, Damien Pous +1
We introduce -catoids as generalisations of (strict) -categories and in particular the higher path categories generated by computads or polygraphs in higher-dimensional rewri…
Persistent homology of partially ordered spaces
Cameron Calk, Eric Goubault, Philippe Malbos
In this work, we explore links between natural homology and persistent homology for the classification of directed spaces. The former is an algebraic invariant of directed spaces,…
Algebraic coherent confluence and higher globular Kleene algebras
Cameron Calk, Eric Goubault, Philippe Malbos +1
We extend the formalisation of confluence results in Kleene algebras to a formalisation of coherent confluence proofs. For this, we introduce the structure of higher globular Kleen…
Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs
Cameron Calk, Anupam Das, Tim Waring
We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as eva…
Time-reversal homotopical properties of concurrent systems
Cameron Calk, Eric Goubault, Philippe Malbos
Directed topology was introduced as a model of concurrent programs, where the flow of time is described by distinguishing certain paths in the topological space representing such a…