Mathematical Structures in Computer Science

Papers
(The median citation count of Mathematical Structures in Computer Science is 0. 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-11-01 to 2025-11-01.)
ArticleCitations
Preface: Advances in Homotopy Type Theory13
An axiomatics and a combinatorial model of creation/annihilation operators13
A construction of free dcpo-cones9
Automatic differentiation for ML-family languages: Correctness via logical relations6
Game semantics of Martin-Löf type theory6
A point-free perspective on lax extensions and predicate liftings6
Substitution Principle and semidirect products6
Hom weak ω-categories of a weak ω-category5
Bicategories in univalent foundations5
Z property for the shuffling calculus4
Implicational Kleene algebra with domain and the substructural logic of partial correctness4
Preface – MSCS4
Principal types as partial involutions4
Monoidal weak ω-categories as models of a type theory4
Learning quantum finite automata with queries4
Implicit computation complexity in higher-order programming languages3
Foreword3
Visibility and exploitation in social networks3
A foundation for synthetic algebraic geometry3
Divergences on monads for relational program logics3
Weighted synchronous automata3
Adding an implication to logics of perfect paradefinite algebras3
Preserving consistency in geometric modeling with graph transformations3
Groupoidal realizability for intensional type theory3
On existence of equilibrium under social coalition structures3
Abstract cyclic proofs3
Logical characterizations of algebraic circuit classes over integral domains3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs2
The Grothendieck construction in the context of tangent categories2
Preface2
From type theory to setoids and back2
String diagram rewrite theory III: Confluence with and without Frobenius2
On Hofmann–Streicher universes2
Computational synthetic cohomology theory in homotopy type theory2
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions2
Proof-relevance in Bishop-style constructive mathematics2
Univalent categories of modules2
Limits and colimits in synthetic $\infty$ -categories2
A quantitative approach to global state composition2
Apartness, sharp elements, and the Scott topology of domains2
Weakest preconditions in fibrations2
A categorical view of varieties of ordered algebras2
Robustness, Scott continuity, and computability1
Preface to the special issue on metric and differential semantics1
Coherent Taylor expansion as a bimonad1
Paraconsistent transition structures: compositional principles and a modal logic1
Prior’s ideal language1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
Hofmann-Mislove type definitions of non-Hausdorff spaces1
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties1
A short proof of the Frobenius property for generic fibrations1
Bisimulation as a logical relation1
A topological reading of coinductive predicates in dependent type theory1
On notions of compactness, object classifiers, and weak Tarski universes1
On function spaces equipped with Isbell topology and Scott topology1
On higher-order communication in ambient calculi1
The order-K-ification monads1
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs1
Transformation of any Verbrugge model to a bisimilar Veltman model1
Two-stage submodular maximization problem beyond nonnegative and monotone1
The combinator M and the Mockingbird lattice1
A classification of bisimilarities for general Markov decision processes1
Indexed and fibered structures for partial and total correctness assertions1
CHAD for expressive total languages1
Special issue on logic and complexity1
Two-level type theory and applications1
Naive cubical type theory0
Not every countable complete distributive lattice is sober0
A set-theoretic approach to algebraic L-domains0
Countability constraints in order-theoretic approaches to computability0
Scott topology on Smyth power posets0
Material dialogues for first-order logic in constructive type theory: extended version0
Errata to “Isomorphism theorems between models of mixed choice,” fixes and consequences0
The complexity of completions in partial combinatory algebra0
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding0
An intuitionistic set-theoretical model of fully dependent CC0
Foreword0
Fixed point logics and definable topological properties0
Smooth and proper maps with respect to a fibration0
Non-Hausdorff parallelized manifolds over geometric models of conservative programs0
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective0
Up-to techniques for behavioural metrics via fibrations0
A quantitative model for simply typed λ-calculus0
Game characterizations for the number of quantifiers0
A rewriting coherence theorem with applications in homotopy type theory0
Symmetric monoidal smash products in homotopy type theory0
A general framework for the semantics of type theory0
Normalization in the simply typed -calculus0
Witnessing flows in arithmetic0
Some representations of real numbers using integer sequences0
Dimension in team semantics0
A linear linear lambda-calculus0
Preface for the special issue in homage to Martin Hofmann Part 20
Semantic analysis of normalisation by evaluation for typed lambda calculus0
sL-approximation spaces capture sL-domains0
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability0
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs0
Coherent differentiation0
Monoidal reverse differential categories0
Preface to Special Issue: LSFA 2019 and 20200
You can only be lucky once: optimal gossip for epistemic goals0
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties0
The set of maximal points of an $\boldsymbol{\omega}$ -domain need not be a $\boldsymbol{G}_{\boldsymbol{\delta}}$ -set0
Why the Kock-Lawvere axiom holds, and also doesn’t, in the classifier of integral rigs0
Introduction to the special issue: Confluence0
Bicategorical type theory: semantics and syntax0
A domain-theoretic framework for robustness analysis of neural networks0
Quantum circuits generating four-qubit maximally entangled states0
Differentiable causal computations via delayed trace (extended version)0
On planarity of graphs in homotopy type theory0
Rewriting in Gray categories with applications to coherence0
Wb-sober spaces and the core-coherence of dcpo models0
Universal algebra in UniMath0
GADTs are not (Even partial) functors0
On Church’s thesis in cubical assemblies0
Computable soft separation axioms0
A concrete model for a typed linear algebraic lambda calculus0
A 2-categorical proof of Frobenius for fibrations defined from a generic point0
Synthetic G-jet-structures in modal homotopy type theory0
Cubical methods in homotopy type theory and univalent foundations0
Local Yoneda completions of quasi-metric spaces0
Special issue on homotopy type theory 2019 vol. 20
T0-spaces and the lower topology0
Inquisitive split and structural completeness0
Foreword for the special issue “Differential Structures in Computer Science and Mathematics”0
Special Issue on Theory and Applications of Models of Computation TAMC 20220
Preface to Special Issue dedicated to LSFA 2021 and LSFA 20220
On reduction and normalization in the computational core0
Two decades of automatic amortized resource analysis0
The role of linearity in sharing analysis0
The costructure–cosemantics adjunction for comodels for computational effects0
Parameterized complexity of weighted team definability0
Behavioural equivalences for continuous-time Markov processes0
New and improved bounds on the contextuality degree of multi-qubit configurations0
Discrete equational theories0
Confluence of algebraic rewriting systems0
Complexity of inversion of functions on the reals0
What should a generic object be?0
Two-layered logics for probabilities and belief functions over Belnap–Dunn logic0
Rogers semilattices of punctual numberings0
Detection and diagnosis of deviations in distributed systems of autonomous agents0
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?0
Special issue on homotopy type theory 20190
A parametricity-based formalization of semi-simplicial and semi-cubical sets0
Equational theorem proving for clauses over strings0
Optimal approximate minimization of one-letter weighted finite automata0
A dual-context sequent calculus for the constructive modal logic S40
A (machine-oriented) logic based on pattern matching0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II0
Dilations and information flow axioms in categorical probability0
The long exact sequence of homotopy n-groups0
A linear logic framework for multimodal logics0
The category of iterative sets in homotopy type theory and univalent foundations0
The patch topology in univalent foundations0
Two-level type theory and applications - ERRATUM0
0.2891149520874