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-05-01 to 2025-05-01.)
ArticleCitations
Game semantics of Martin-Löf type theory10
Bicategories in univalent foundations10
Preface: Advances in Homotopy Type Theory9
Hom weak ω-categories of a weak ω-category9
Automatic differentiation for ML-family languages: Correctness via logical relations6
A construction of free dcpo-cones6
Substitution Principle and semidirect products5
Divergences on monads for relational program logics4
An axiomatics and a combinatorial model of creation/annihilation operators4
Preface – MSCS4
Implicational Kleene algebra with domain and the substructural logic of partial correctness4
A point-free perspective on lax extensions and predicate liftings4
Monoidal weak ω-categories as models of a type theory3
Principal types as partial involutions3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
Z property for the shuffling calculus3
Weighted synchronous automata3
Implicit computation complexity in higher-order programming languages3
Type-based analysis of logarithmic amortised complexity3
Learning quantum finite automata with queries3
On existence of equilibrium under social coalition structures3
Abstract cyclic proofs2
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs2
Apartness, sharp elements, and the Scott topology of domains2
Foreword2
Logical characterizations of algebraic circuit classes over integral domains2
On Hofmann–Streicher universes2
Adding an implication to logics of perfect paradefinite algebras2
A foundation for synthetic algebraic geometry2
Visibility and exploitation in social networks2
Preserving consistency in geometric modeling with graph transformations2
Preface for the special issue in homage to Martin Hofmann Part 12
Groupoidal realizability for intensional type theory2
String diagram rewrite theory III: Confluence with and without Frobenius1
Martin Hofmann’s contributions to type theory: Groupoids and univalence1
Finitary monads on the category of posets1
Preface1
Robustness, Scott continuity, and computability1
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs1
Prior’s ideal language1
Two-stage submodular maximization problem beyond nonnegative and monotone1
CHAD for expressive total languages1
On higher-order communication in ambient calculi1
Weakest preconditions in fibrations1
Hofmann-Mislove type definitions of non-Hausdorff spaces1
From type theory to setoids and back1
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions1
Two-level type theory and applications1
Preface to the special issue on metric and differential semantics1
A classification of bisimilarities for general Markov decision processes1
Bisimulation as a logical relation1
Special issue on logic and complexity1
The order-K-ification monads1
Monotone recursive types and recursive data representations in Cedille1
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties1
Proof-relevance in Bishop-style constructive mathematics1
Univalent categories of modules1
A categorical view of varieties of ordered algebras1
An interpretation of dependent type theory in a model category of locally cartesian closed categories1
On function spaces equipped with Isbell topology and Scott topology1
Indexed and fibered structures for partial and total correctness assertions1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
The geometry of Bayesian programming1
0.090997934341431