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-12-01 to 2025-12-01.)
ArticleCitations
An axiomatics and a combinatorial model of creation/annihilation operators13
Preface: Advances in Homotopy Type Theory13
A construction of free dcpo-cones9
Game semantics of Martin-Löf type theory7
Preface – MSCS6
A point-free perspective on lax extensions and predicate liftings6
Hom weak ω-categories of a weak ω-category6
Substitution Principle and semidirect products6
Automatic differentiation for ML-family languages: Correctness via logical relations6
Monoidal weak ω-categories as models of a type theory5
Z property for the shuffling calculus5
Principal types as partial involutions5
Learning quantum finite automata with queries4
Exponentiable functors between synthetic $\boldsymbol{\infty}$ -categories4
Implicational Kleene algebra with domain and the substructural logic of partial correctness4
Divergences on monads for relational program logics4
Groupoidal realizability for intensional type theory3
On existence of equilibrium under social coalition structures3
Abstract cyclic proofs3
A foundation for synthetic algebraic geometry3
Implicit computation complexity in higher-order programming languages3
Foreword3
Visibility and exploitation in social networks3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
Weighted synchronous automata3
Logical characterizations of algebraic circuit classes over integral domains3
Preserving consistency in geometric modeling with graph transformations3
Adding an implication to logics of perfect paradefinite algebras2
A quantitative approach to global state composition2
Preface2
Proof-relevance in Bishop-style constructive mathematics2
A categorical view of varieties of ordered algebras2
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs2
The Grothendieck construction in the context of tangent categories2
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions2
From type theory to setoids and back2
Univalent categories of modules2
Apartness, sharp elements, and the Scott topology of domains2
On Hofmann–Streicher universes2
Computational synthetic cohomology theory in homotopy type theory2
Limits and colimits in synthetic $\infty$ -categories2
Weakest preconditions in fibrations2
0.39340710639954