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-06-01 to 2025-06-01.)
ArticleCitations
Preface: Advances in Homotopy Type Theory13
Automatic differentiation for ML-family languages: Correctness via logical relations11
An axiomatics and a combinatorial model of creation/annihilation operators9
Hom weak ω-categories of a weak ω-category6
Bicategories in univalent foundations6
A construction of free dcpo-cones5
A point-free perspective on lax extensions and predicate liftings5
Game semantics of Martin-Löf type theory4
Principal types as partial involutions4
Preface – MSCS4
Substitution Principle and semidirect products4
Monoidal weak ω-categories as models of a type theory3
Divergences on monads for relational program logics3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
Foreword3
Learning quantum finite automata with queries3
Groupoidal realizability for intensional type theory3
Weighted synchronous automata3
A foundation for synthetic algebraic geometry3
Type-based analysis of logarithmic amortised complexity3
Z property for the shuffling calculus3
Implicational Kleene algebra with domain and the substructural logic of partial correctness3
On existence of equilibrium under social coalition structures3
Implicit computation complexity in higher-order programming languages3
Abstract cyclic proofs2
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs2
Visibility and exploitation in social networks2
Univalent categories of modules2
Apartness, sharp elements, and the Scott topology of domains2
Preserving consistency in geometric modeling with graph transformations2
Logical characterizations of algebraic circuit classes over integral domains2
Preface2
A categorical view of varieties of ordered algebras2
Adding an implication to logics of perfect paradefinite algebras2
On Hofmann–Streicher universes2
Preface for the special issue in homage to Martin Hofmann Part 12
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions2
From type theory to setoids and back2
Proof-relevance in Bishop-style constructive mathematics1
CHAD for expressive total languages1
Robustness, Scott continuity, and computability1
Indexed and fibered structures for partial and total correctness assertions1
Two-stage submodular maximization problem beyond nonnegative and monotone1
The order-K-ification monads1
Martin Hofmann’s contributions to type theory: Groupoids and univalence1
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties1
Monotone recursive types and recursive data representations in Cedille1
The geometry of Bayesian programming1
Transformation of any Verbrugge model to a bisimilar Veltman model1
An improved primal-dual approximation algorithm for the k-means problem with penalties1
Preface to the special issue on metric and differential semantics1
Prior’s ideal language1
Bisimulation as a logical relation1
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs1
Finitary monads on the category of posets1
Weakest preconditions in fibrations1
Two-level type theory and applications1
Special issue on logic and complexity1
On notions of compactness, object classifiers, and weak Tarski universes1
On function spaces equipped with Isbell topology and Scott topology1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
String diagram rewrite theory III: Confluence with and without Frobenius1
On higher-order communication in ambient calculi1
Hofmann-Mislove type definitions of non-Hausdorff spaces1
The role of linearity in sharing analysis0
Introduction to the special issue: Confluence0
Semantic analysis of normalisation by evaluation for typed lambda calculus0
Differentiable causal computations via delayed trace (extended version)0
Branching-time logics and fairness, revisited0
Behavioural equivalences for continuous-time Markov processes0
Confluence of algebraic rewriting systems0
sL-approximation spaces capture sL-domains0
Special issue on homotopy type theory 20190
Convolution and concurrency0
Bicategorical type theory: semantics and syntax0
Computable soft separation axioms0
Scott topology on Smyth power posets0
Symmetric monoidal smash products in homotopy type theory0
Some representations of real numbers using integer sequences0
Game characterizations for the number of quantifiers0
Dimension in team semantics0
Separating minimal valuations, point-continuous valuations, and continuous valuations0
The complexity of completions in partial combinatory algebra0
A quantitative model for simply typed λ-calculus0
Rogers semilattices of punctual numberings0
A dual-context sequent calculus for the constructive modal logic S40
Doctrines, modalities and comonads0
Elementary fibrations of enriched groupoids0
The category of iterative sets in homotopy type theory and univalent foundations0
Coherent Taylor expansion as a bimonad0
Cubical methods in homotopy type theory and univalent foundations0
Special Issue on Theory and Applications of Models of Computation TAMC 20220
Synthetic topology in Homotopy Type Theory for probabilistic programming0
Wb-sober spaces and the core-coherence of dcpo models0
On generalized algebraic theories and categories with families0
Preface to Special Issue: LSFA 2019 and 20200
You can only be lucky once: optimal gossip for epistemic goals0
On planarity of graphs in homotopy type theory0
Discrete equational theories0
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability0
Countability constraints in order-theoretic approaches to computability0
Material dialogues for first-order logic in constructive type theory: extended version0
The set of maximal points of an $\boldsymbol{\omega}$ -domain need not be a $\boldsymbol{G}_{\boldsymbol{\delta}}$ -set0
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?0
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties0
Consistent disjunctive sequent calculi and Scott domains0
The long exact sequence of homotopy n-groups0
A domain-theoretic framework for robustness analysis of neural networks0
Parameterized complexity of weighted team definability0
Equational theorem proving for clauses over strings0
Preface for the special issue in homage to Martin Hofmann Part 20
Two-layered logics for probabilities and belief functions over Belnap–Dunn logic0
A 2-categorical proof of Frobenius for fibrations defined from a generic point0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II0
Detection and diagnosis of deviations in distributed systems of autonomous agents0
What should a generic object be?0
New and improved bounds on the contextuality degree of multi-qubit configurations0
GADTs are not (Even partial) functors0
Up-to techniques for behavioural metrics via fibrations0
A linear linear lambda-calculus0
Normalization in the simply typed -calculus0
An intuitionistic set-theoretical model of fully dependent CC0
Algebras of UTxO blockchains0
The combinator M and the Mockingbird lattice0
Special issue on homotopy type theory 2019 vol. 20
A set-theoretic approach to algebraic L-domains0
Two decades of automatic amortized resource analysis0
Not every countable complete distributive lattice is sober0
A linear logic framework for multimodal logics0
Constructive sheaf models of type theory0
The Scott model of PCF in univalent type theory0
The costructure–cosemantics adjunction for comodels for computational effects0
Naive cubical type theory0
A concrete model for a typed linear algebraic lambda calculus0
Foreword0
Inquisitive split and structural completeness0
Three improvements to the top-down solver0
Rewriting in Gray categories with applications to coherence0
Quantum circuits generating four-qubit maximally entangled states0
On Church’s thesis in cubical assemblies0
Probability, valuations, hyperspace: Three monads on top and the support as a morphism0
A rewriting coherence theorem with applications in homotopy type theory0
Smooth and proper maps with respect to a fibration0
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective0
Local Yoneda completions of quasi-metric spaces0
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding0
On reduction and normalization in the computational core0
A (machine-oriented) logic based on pattern matching0
Coherent differentiation0
Fixed point logics and definable topological properties0
A general framework for the semantics of type theory0
Dilations and information flow axioms in categorical probability0
Optimal approximate minimization of one-letter weighted finite automata0
Witnessing flows in arithmetic0
Synthetic G-jet-structures in modal homotopy type theory0
A classification of bisimilarities for general Markov decision processes0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part I0
E-Unification based on Generalized Embedding0
Two-level type theory and applications - ERRATUM0
T0-spaces and the lower topology0
Coherence for bicategorical cartesian closed structure0
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs0
Universal algebra in UniMath0
Monoidal reverse differential categories0
0.047709941864014