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 2022-05-01 to 2026-05-01.)
ArticleCitations
Preface: Advances in Homotopy Type Theory15
Automatic differentiation for ML-family languages: Correctness via logical relations10
Substitution Principle and semidirect products10
An axiomatics and a combinatorial model of creation/annihilation operators8
A point-free perspective on lax extensions and predicate liftings8
Variable polyadicity without events: a type-theoretic analysis of event semantics7
Game semantics of Martin-Löf type theory7
A construction of free dcpo-cones7
On traces in categories of contractions6
Linear logic and the Hilbert scheme6
Preface – MSCS6
Principal types as partial involutions5
On logical aspects of extensionality and continuity for set-valued operators with applications to nonlinear analysis5
Monoidal weak ω-categories as models of a type theory4
Implicational Kleene algebra with domain and the substructural logic of partial correctness4
Z property for the shuffling calculus4
Divergences on monads for relational program logics3
Learning quantum finite automata with queries3
Visibility and exploitation in social networks3
A foundation for synthetic algebraic geometry3
Exponentiable functors between synthetic $\boldsymbol{\infty}$ -categories3
Foreword3
Logical characterizations of algebraic circuit classes over integral domains3
Weighted synchronous automata3
Groupoidal realizability for intensional type theory3
Abstract cyclic proofs3
Adding an implication to logics of perfect paradefinite algebras3
A quantitative approach to global state composition2
Apartness, sharp elements, and the Scott topology of domains2
Univalent categories of modules2
On Hofmann–Streicher universes2
Relative completeness of arithmetical numberings2
WoLLIC 2023 - 29th Workshop on Logic, Language, Information and Computation2
Computational synthetic cohomology theory in homotopy type theory2
The Grothendieck construction in the context of tangent categories2
Robustness, Scott continuity, and computability1
From type theory to setoids and back1
Limits and colimits in synthetic $\infty$ -categories1
A short proof of the Frobenius property for generic fibrations1
Multivariate functorial difference1
Indexed and fibered structures for partial and total correctness assertions1
A classification of bisimilarities for general Markov decision processes1
Coherent Taylor expansion as a bimonad1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties1
Two-level type theory and applications1
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions1
CHAD for expressive total languages1
Transformation of any Verbrugge model to a bisimilar Veltman model1
On notions of compactness, object classifiers, and weak Tarski universes1
Characterizations of $\omega$ -Rudin spaces via sequence convergence1
The order-K-ification monads1
Special issue on logic and complexity1
String diagram rewrite theory III: Confluence with and without Frobenius1
Discrete Lawvere theories and monads1
On higher-order communication in ambient calculi1
Prior’s ideal language1
Preface to the special issue on metric and differential semantics1
On function spaces equipped with Isbell topology and Scott topology1
A topological reading of coinductive predicates in dependent type theory1
0.072561025619507