Mathematical Structures in Computer Science

Papers
(The TQCC of Mathematical Structures in Computer Science is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-08-01 to 2025-08-01.)
ArticleCitations
Preface: Advances in Homotopy Type Theory14
Automatic differentiation for ML-family languages: Correctness via logical relations11
An axiomatics and a combinatorial model of creation/annihilation operators10
Bicategories in univalent foundations8
A point-free perspective on lax extensions and predicate liftings6
Hom weak ω-categories of a weak ω-category6
A construction of free dcpo-cones5
Principal types as partial involutions4
Z property for the shuffling calculus4
Game semantics of Martin-Löf type theory4
Monoidal weak ω-categories as models of a type theory4
Implicational Kleene algebra with domain and the substructural logic of partial correctness4
Substitution Principle and semidirect products4
Preface – MSCS4
Learning quantum finite automata with queries4
Foreword3
On existence of equilibrium under social coalition structures3
Groupoidal realizability for intensional type theory3
Weighted synchronous automata3
A foundation for synthetic algebraic geometry3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
Divergences on monads for relational program logics3
Abstract cyclic proofs3
Type-based analysis of logarithmic amortised complexity3
Implicit computation complexity in higher-order programming languages3
Apartness, sharp elements, and the Scott topology of domains2
Adding an implication to logics of perfect paradefinite algebras2
Preface for the special issue in homage to Martin Hofmann Part 12
Preface2
A categorical view of varieties of ordered algebras2
Proof-relevance in Bishop-style constructive mathematics2
Visibility and exploitation in social networks2
Logical characterizations of algebraic circuit classes over integral domains2
Computational synthetic cohomology theory in homotopy type theory2
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions2
From type theory to setoids and back2
The Grothendieck construction in the context of tangent categories2
On Hofmann–Streicher universes2
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs2
Preserving consistency in geometric modeling with graph transformations2
Univalent categories of modules2
Finitary monads on the category of posets2
0.04955005645752