| Publication | Date of Publication | Type |
|---|
Functorial semantics for relational theories
Polynesian Journal of Mathematics | 2026-08-05 | Paper |
Testing randomness by Matching Pennies
SARAJEVO JOURNAL OF MATHEMATICS | 2024-11-26 | Paper |
| Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers | 2024-10-01 | Paper |
From Gödel's incompleteness theorem to the completeness of bot beliefs (extended abstract)
Logic, Language, Information, and Computation | 2024-02-28 | Paper |
| Catales: From topologies without points to categories without objects | 2023-11-17 | Paper |
Programs as Diagrams
Theory and Applications of Computability | 2023-11-05 | Paper |
Convenient category of processes and simulations I: Modulo strong bisimilarity
Category Theory and Computer Science | 2022-12-16 | Paper |
Probabilistic annotations for protocol models. Dedicated to Joshua Guttman
(available as arXiv preprint) | 2022-07-13 | Paper |
Lambek pregroups are Frobenius spiders in preorders
Compositionality | 2022-07-01 | Paper |
| Tight limits and completions from Dedekind-MacNeille to Lambek-Isbell | 2022-04-20 | Paper |
(Modular) effect algebras are equivalent to (Frobenius) antispecial algebras
(available as arXiv preprint) | 2021-12-08 | Paper |
| (Modular) effect algebras are equivalent to (Frobenius) antispecial algebras | 2021-12-08 | Paper |
Logic of fusion
(available as arXiv preprint) | 2021-07-08 | Paper |
Sound up-to techniques and complete abstract domains
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Quotients in monadic programming: projective algebras are equivalent to coalgebras
(available as arXiv preprint) | 2021-01-19 | Paper |
| Quotients in monadic programming: projective algebras are equivalent to coalgebras | 2021-01-19 | Paper |
Logic of fusion
(available as arXiv preprint) | 2020-07-30 | Paper |
| Retracing some paths in categorical semantics: From process-propositions-as-types to categorified reals and computers | 2020-07-20 | Paper |
| Refinement for signal flow graphs | 2020-05-27 | Paper |
| Nucleus I: Adjunction spectra in recommender systems and descent | 2020-04-15 | Paper |
Privacy protocols
(available as arXiv preprint) | 2020-03-03 | Paper |
| Causality and deceit: Do androids watch action movies? | 2019-10-10 | Paper |
Logics for actor networks: a two-stage constrained-hybridisation approach
Journal of Logical and Algebraic Methods in Programming | 2019-06-20 | Paper |
Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
(available as arXiv preprint) | 2018-10-23 | Paper |
| Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract) | 2018-10-23 | Paper |
| Logics for actor networks: a case study in constrained hybridization | 2018-04-12 | Paper |
| Functorial Semantics for Relational Theories | 2017-11-23 | Paper |
Universal probability-free prediction
Annals of Mathematics and Artificial Intelligence | 2017-11-16 | Paper |
Smooth coalgebra: testing vector analysis
Mathematical Structures in Computer Science | 2017-09-27 | Paper |
Towards concept analysis in categories: limit inferior as algebra, limit superior as coalgebra
(available as arXiv preprint) | 2017-07-11 | Paper |
Monoidal computer III: A coalgebraic view of computability and complexity
(available as arXiv preprint) | 2017-04-17 | Paper |
Relating toy models of quantum computation: comprehension, complementarity and dagger mix autonomous categories
Electronic Notes in Theoretical Computer Science | 2016-10-07 | Paper |
Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
| Secure protocol composition | 2016-05-03 | Paper |
Chasing diagrams in cryptography
Lecture Notes in Computer Science | 2014-05-08 | Paper |
| Monoidal computer II: Normal complexity by string diagrams | 2014-02-23 | Paper |
Labelled Markov processes as generalised stochastic relations
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
Monoidal computer. I: Basic computability by string diagrams
Information and Computation | 2013-12-03 | Paper |
A new description of orthogonal bases
Mathematical Structures in Computer Science | 2013-06-11 | Paper |
Bicompletions of distance matrices
Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky | 2013-05-28 | Paper |
Geometry of abstraction in quantum computation
(available as arXiv preprint) | 2012-10-01 | Paper |
Tracing the man in the middle in monoidal categories
Coalgebraic Methods in Computer Science | 2012-09-20 | Paper |
Quantitative concept analysis
Formal Concept Analysis | 2012-09-10 | Paper |
A Semantical Approach to Equilibria and Rationality
Algebra and Coalgebra in Computer Science | 2012-06-01 | Paper |
Guarded transitions in evolving specifications
Algebraic Methodology and Software Technology | 2011-05-06 | Paper |
Formal derivation of concurrent garbage collectors
Lecture Notes in Computer Science | 2010-07-26 | Paper |
Classical and quantum structuralism
(available as arXiv preprint) | 2010-05-14 | Paper |
Colimits for concurrent collectors
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Testing Semantics: Connecting Processes and Process Logics
Algebraic Methodology and Software Technology | 2009-04-28 | Paper |
Quantum and Classical Structures in Nondeterminstic Computation
Quantum Interaction | 2009-03-26 | Paper |
Evolving Specification Engineering
Algebraic Methodology and Software Technology | 2009-01-27 | Paper |
Network as a Computer: Ranking Paths to Find Flows
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Quantum measurements without sums
(available as arXiv preprint) | 2008-03-20 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
| scientific article; zbMATH DE number 1701358 (Why is no real title available?) | 2002-02-05 | Paper |
On coalgebra of real numbers
Electronic Notes in Theoretical Computer Science | 1999-07-12 | Paper |
| scientific article; zbMATH DE number 1231630 (Why is no real title available?) | 1999-01-06 | Paper |
| scientific article; zbMATH DE number 1487474 (Why is no real title available?) | 1999-01-01 | Paper |
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science | 1998-03-04 | Paper |
Chu. I: Cofree equivalences, dualities and *-autonomous categories
MSCS. Mathematical Structures in Computer Science | 1998-01-05 | Paper |
| scientific article; zbMATH DE number 877751 (Why is no real title available?) | 1996-12-01 | Paper |
| scientific article; zbMATH DE number 860039 (Why is no real title available?) | 1996-05-07 | Paper |
On completeness and cocompleteness in and around small categories
Annals of Pure and Applied Logic | 1996-01-17 | Paper |
A categorical setting for the 4-colour theorem
Journal of Pure and Applied Algebra | 1995-12-03 | Paper |
Maps. I: Relative to a factorisation system
Journal of Pure and Applied Algebra | 1995-07-03 | Paper |
| scientific article; zbMATH DE number 517050 (Why is no real title available?) | 1994-08-28 | Paper |
| scientific article; zbMATH DE number 426315 (Why is no real title available?) | 1993-11-04 | Paper |
On the structure of paradoxes
Archive for Mathematical Logic | 1993-09-01 | Paper |
| scientific article; zbMATH DE number 19498 (Why is no real title available?) | 1992-06-26 | Paper |
