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 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 point-free perspective on lax extensions and predicate liftings8
A construction of free dcpo-cones8
An axiomatics and a combinatorial model of creation/annihilation operators7
Game semantics of Martin-Löf type theory7
Linear logic and the Hilbert scheme6
On traces in categories of contractions6
Variable polyadicity without events: a type-theoretic analysis of event semantics6
Preface – MSCS6
On logical aspects of extensionality and continuity for set-valued operators with applications to nonlinear analysis5
Principal types as partial involutions4
Z property for the shuffling calculus4
Monoidal weak ω-categories as models of a type theory4
Divergences on monads for relational program logics3
Groupoidal realizability for intensional type theory3
Abstract cyclic proofs3
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
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
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
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
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
Formalizing two-level type theory with cofibrant exo-nat0
Smooth and proper maps with respect to a fibration0
On reduction and normalization in the computational core0
Gentzen–Mints–Zucker duality0
Symmetric monoidal smash products in homotopy type theory0
Categories of quantum cpos0
Objective Mackey and Tambara functors via parametrized categories0
Fixed point logics and definable topological properties0
A rewriting coherence theorem with applications in homotopy type theory0
New and improved bounds on the contextuality degree of multi-qubit configurations0
Differentiable causal computations via delayed trace (extended version)0
A (machine-oriented) logic based on pattern matching0
An intuitionistic set-theoretical model of fully dependent CC0
Pseudolimits for tangent categories with applications to equivariant algebraic and differential geometry0
What should a generic object be?0
Dilations and information flow axioms in categorical probability0
Optimal approximate minimization of one-letter weighted finite automata0
Wb-sober spaces and the core-coherence of dcpo models0
Coherent Taylor expansion as a bimonad0
The category of iterative sets in homotopy type theory and univalent foundations0
Paraconsistent transition structures: compositional principles and a modal logic0
Toward the effective 2-topos0
Preface to Special Issue dedicated to LSFA 2021 and LSFA 20220
Errata to “Isomorphism theorems between models of mixed choice,” fixes and consequences0
Monoidal reverse differential categories0
Preface for the special issue in homage to Martin Hofmann Part 20
Two-level type theory and applications - ERRATUM0
The Kock–Mikkelsen factorisation0
Behavioural equivalences for continuous-time Markov processes0
A dual-context sequent calculus for the constructive modal logic S40
Introduction to the special issue: Confluence0
A domain-theoretic framework for robustness analysis of neural networks0
Automata and coalgebras in categories of species0
T0-spaces and the lower topology0
On planarity of graphs in homotopy type theory0
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
Parameterized complexity of weighted team definability0
Non-Hausdorff parallelized manifolds over geometric models of conservative programs0
Game characterizations for the number of quantifiers0
Two-layered logics for probabilities and belief functions over Belnap–Dunn logic0
Computable soft separation axioms0
A concrete model for a typed linear algebraic lambda calculus0
Dimension in team semantics0
A dependently-typed calculus of event telicity and culminativity0
Congruence relations on domains0
Formal p -category theory and normalization by evaluation in Rocq0
Local Yoneda completions of quasi-metric spaces0
Detection and diagnosis of deviations in distributed systems of autonomous agents0
Characterizations of $\omega$ -Rudin spaces via sequence convergence0
Special issue on homotopy type theory 2019 vol. 20
Special Issue on Theory and Applications of Models of Computation TAMC 20220
Why the Kock-Lawvere axiom holds, and also doesn’t, in the classifier of integral rigs0
A set-theoretic approach to algebraic L-domains0
Scott topology on Smyth power posets0
Preface to Special Issue: LSFA 2019 and 20200
Not every countable complete distributive lattice is sober0
You can only be lucky once: optimal gossip for epistemic goals0
A linear logic framework for multimodal logics0
Foreword for the special issue “Differential Structures in Computer Science and Mathematics”0
Effectiveness and continuity in intuitionistic quasi-toposes of assemblies0
From differential linear logic to coherent differentiation0
Synthetic G-jet-structures in modal homotopy type theory0
Discrete equational theories0
Up-to techniques for behavioural metrics via fibrations0
Countability constraints in order-theoretic approaches to computability0
Foreword0
Complexity of inversion of functions on the reals0
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective0
A general framework for the semantics of type theory0
Opetopes as zoom complexes and partial orders0
The long exact sequence of homotopy n-groups0
Coherent differentiation0
Bicategorical type theory: semantics and syntax0
Equational theorem proving for clauses over strings0
Witnessing flows in arithmetic0
GADTs are not (Even partial) functors0
A 2-categorical proof of Frobenius for fibrations defined from a generic point0
A linear linear lambda-calculus0
Normalization in the simply typed -calculus0
The set of maximal points of an $\boldsymbol{\omega}$ -domain need not be a $\boldsymbol{G}_{\boldsymbol{\delta}}$ -set0
Controlling unfolding in type theory0
A topological reading of coinductive predicates in dependent type theory0
sL-approximation spaces capture sL-domains0
Inquisitive split and structural completeness0
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs0
Universal algebra in UniMath0
Displayed type theory and semi-simplicial types0
Material dialogues for first-order logic in constructive type theory: extended version0
Day algebras0
Premonoidal and Kleisli double categories0
The patch topology in univalent foundations0
The complexity of completions in partial combinatory algebra0
Categories for collection monads0
Semiframes: the algebra of semitopologies and actionable coalitions0
A parametricity-based formalization of semi-simplicial and semi-cubical sets0
0.32190012931824