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