Mathematical Structures in Computer Science

Papers
(The TQCC of Mathematical Structures in Computer Science is 1. 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-09-01 to 2025-09-01.)
ArticleCitations
Preface: Advances in Homotopy Type Theory14
An axiomatics and a combinatorial model of creation/annihilation operators11
Automatic differentiation for ML-family languages: Correctness via logical relations11
Bicategories in univalent foundations8
A point-free perspective on lax extensions and predicate liftings6
A construction of free dcpo-cones6
Substitution Principle and semidirect products5
Game semantics of Martin-Löf type theory5
Hom weak ω-categories of a weak ω-category5
Monoidal weak ω-categories as models of a type theory4
Type-based analysis of logarithmic amortised complexity4
Z property for the shuffling calculus4
Implicational Kleene algebra with domain and the substructural logic of partial correctness4
Principal types as partial involutions4
Preface – MSCS4
Groupoidal realizability for intensional type theory3
Divergences on monads for relational program logics3
A foundation for synthetic algebraic geometry3
Implicit computation complexity in higher-order programming languages3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
On existence of equilibrium under social coalition structures3
Learning quantum finite automata with queries3
Weighted synchronous automata3
Foreword3
Preserving consistency in geometric modeling with graph transformations2
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs2
Apartness, sharp elements, and the Scott topology of domains2
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions2
Preface for the special issue in homage to Martin Hofmann Part 12
Logical characterizations of algebraic circuit classes over integral domains2
On Hofmann–Streicher universes2
The Grothendieck construction in the context of tangent categories2
Computational synthetic cohomology theory in homotopy type theory2
Univalent categories of modules2
Abstract cyclic proofs2
Adding an implication to logics of perfect paradefinite algebras2
Visibility and exploitation in social networks2
Preface2
A categorical view of varieties of ordered algebras2
From type theory to setoids and back1
Transformation of any Verbrugge model to a bisimilar Veltman model1
The combinator M and the Mockingbird lattice1
On notions of compactness, object classifiers, and weak Tarski universes1
Bisimulation as a logical relation1
Indexed and fibered structures for partial and total correctness assertions1
On higher-order communication in ambient calculi1
Weakest preconditions in fibrations1
Proof-relevance in Bishop-style constructive mathematics1
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties1
CHAD for expressive total languages1
A classification of bisimilarities for general Markov decision processes1
Coherent Taylor expansion as a bimonad1
Two-stage submodular maximization problem beyond nonnegative and monotone1
Robustness, Scott continuity, and computability1
A short proof of the Frobenius property for generic fibrations1
Hofmann-Mislove type definitions of non-Hausdorff spaces1
Special issue on logic and complexity1
The order-K-ification monads1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
On function spaces equipped with Isbell topology and Scott topology1
Preface to the special issue on metric and differential semantics1
Prior’s ideal language1
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs1
Two-level type theory and applications1
String diagram rewrite theory III: Confluence with and without Frobenius1
0.046451091766357