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-04-01 to 2025-04-01.)
ArticleCitations
On notions of compactness, object classifiers, and weak Tarski universes10
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations – Part II10
Hom weak ω-categories of a weak ω-category9
Syntax and models of Cartesian cubical type theory6
Preface for the special issue in homage to Martin Hofmann Part 26
Optimal approximate minimization of one-letter weighted finite automata6
Game semantics of Martin-Löf type theory5
Rewriting in Gray categories with applications to coherence4
A point-free perspective on lax extensions and predicate liftings4
Bicategories in univalent foundations4
Languages of higher-dimensional automata3
On function spaces equipped with Isbell topology and Scott topology3
Preface: Advances in Homotopy Type Theory3
An improved primal-dual approximation algorithm for the k-means problem with penalties3
Preface for the special issue in homage to Martin Hofmann Part 13
Substitution Principle and semidirect products3
A linear logic framework for multimodal logics3
Automatic differentiation for ML-family languages: Correctness via logical relations3
Normalization in the simply typed -calculus3
Univalent categories of modules2
T0-spaces and the lower topology2
Wb-sober spaces and the core-coherence of dcpo models2
E-Unification based on Generalized Embedding2
Apartness, sharp elements, and the Scott topology of domains2
Game characterizations for the number of quantifiers2
The costructure–cosemantics adjunction for comodels for computational effects2
Coherent differentiation2
A construction of free dcpo-cones2
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part I2
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II2
Preface2
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability1
Elementary fibrations of enriched groupoids1
Universal algebra in UniMath1
The category of iterative sets in homotopy type theory and univalent foundations1
The combinator M and the Mockingbird lattice1
Causal inference via string diagram surgery1
Consistent disjunctive sequent calculi and Scott domains1
A dual-context sequent calculus for the constructive modal logic S41
Witnessing flows in arithmetic1
From type theory to setoids and back1
Divergences on monads for relational program logics1
Z property for the shuffling calculus1
Dilations and information flow axioms in categorical probability1
Synthetic G-jet-structures in modal homotopy type theory1
New and improved bounds on the contextuality degree of multi-qubit configurations1
You can only be lucky once: optimal gossip for epistemic goals1
A concrete model for a typed linear algebraic lambda calculus1
Constructive sheaf models of type theory1
Naive cubical type theory1
Learning quantum finite automata with queries1
Discrete equational theories1
Two decades of automatic amortized resource analysis1
Monoidal reverse differential categories1
The complexity of completions in partial combinatory algebra1
Symmetric monoidal smash products in homotopy type theory1
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions1
Preface – MSCS1
On generalized algebraic theories and categories with families1
On reduction and normalization in the computational core1
An intuitionistic set-theoretical model of fully dependent CC1
Doctrines, modalities and comonads1
Not every countable complete distributive lattice is sober0
Bicategorical type theory: semantics and syntax0
Weighted synchronous automata0
Two-level type theory and applications - ERRATUM0
Three improvements to the top-down solver0
Coherence for bicategorical cartesian closed structure0
Special issue on homotopy type theory 20190
The order-K-ification monads0
Equational theorem proving for clauses over strings0
A domain-theoretic framework for robustness analysis of neural networks0
Two-stage submodular maximization problem beyond nonnegative and monotone0
Martin Hofmann’s contributions to type theory: Groupoids and univalence0
Rogers semilattices of punctual numberings0
Scott topology on Smyth power posets0
Smooth and proper maps with respect to a fibration0
Up-to techniques for behavioural metrics via fibrations0
A 2-categorical proof of Frobenius for fibrations defined from a generic point0
Algebras of UTxO blockchains0
Proof-relevance in Bishop-style constructive mathematics0
The role of linearity in sharing analysis0
Convolution and concurrency0
Two-level type theory and applications0
Finitary monads on the category of posets0
Bisimulation as a logical relation0
Preserving consistency in geometric modeling with graph transformations0
Special issue on homotopy type theory 2019 vol. 20
Implicit computation complexity in higher-order programming languages0
Robustness, Scott continuity, and computability0
On Church’s thesis in cubical assemblies0
Countability constraints in order-theoretic approaches to computability0
Synthetic topology in Homotopy Type Theory for probabilistic programming0
Behavioural equivalences for continuous-time Markov processes0
What should a generic object be?0
Abstract cyclic proofs0
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective0
On existence of equilibrium under social coalition structures0
Foreword0
Foreword0
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding0
An interpretation of dependent type theory in a model category of locally cartesian closed categories0
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs0
Probability, valuations, hyperspace: Three monads on top and the support as a morphism0
Local Yoneda completions of quasi-metric spaces0
Linear logic in normed cones: probabilistic coherence spaces and beyond0
A general framework for the semantics of type theory0
The geometry of Bayesian programming0
Monoidal weak ω-categories as models of a type theory0
On planarity of graphs in homotopy type theory0
Some representations of real numbers using integer sequences0
Preface to Special Issue: LSFA 2019 and 20200
A rewriting coherence theorem with applications in homotopy type theory0
Cubical methods in homotopy type theory and univalent foundations0
The Scott model of PCF in univalent type theory0
Material dialogues for first-order logic in constructive type theory: extended version0
Confluence of algebraic rewriting systems0
A categorical view of varieties of ordered algebras0
Separating minimal valuations, point-continuous valuations, and continuous valuations0
Special issue on logic and complexity0
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties0
Semantic analysis of normalisation by evaluation for typed lambda calculus0
CHAD for expressive total languages0
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties0
A linear linear lambda-calculus0
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs0
Hofmann-Mislove type definitions of non-Hausdorff spaces0
Groupoidal realizability for intensional type theory0
Visibility and exploitation in social networks0
Parameterized complexity of weighted team definability0
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?0
Fixed point logics and definable topological properties0
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs0
Monotone recursive types and recursive data representations in Cedille0
Metric monads0
A set-theoretic approach to algebraic L-domains0
Detection and diagnosis of deviations in distributed systems of autonomous agents0
A quantitative model for simply typed λ-calculus0
Introduction to the special issue: Confluence0
On Hofmann–Streicher universes0
Logical characterizations of algebraic circuit classes over integral domains0
Type-based analysis of logarithmic amortised complexity0
Preface to the special issue on metric and differential semantics0
A foundation for synthetic algebraic geometry0
A (machine-oriented) logic based on pattern matching0
Computable soft separation axioms0
Adding an implication to logics of perfect paradefinite algebras0
Special Issue on Theory and Applications of Models of Computation TAMC 20220
Indexed and fibered structures for partial and total correctness assertions0
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem0
Quantum circuits generating four-qubit maximally entangled states0
Weakest preconditions in fibrations0
GADTs are not (Even partial) functors0
Dimension in team semantics0
String diagram rewrite theory II: Rewriting with symmetric monoidal structure0
Implicational Kleene algebra with domain and the substructural logic of partial correctness0
The long exact sequence of homotopy n-groups0
Branching-time logics and fairness, revisited0
String diagram rewrite theory III: Confluence with and without Frobenius0
0.058915853500366