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 2020-05-01 to 2024-05-01.)
ArticleCitations
Syntax and models of Cartesian cubical type theory8
Three improvements to the top-down solver8
Quasi-Nelson algebras and fragments8
From Kruskal’s theorem to Friedman’s gap condition6
String diagram rewrite theory III: Confluence with and without Frobenius5
Bisimulation as a logical relation5
Languages of higher-dimensional automata5
Petri nets based on Lawvere theories5
Two-level type theory and applications4
Bicategories in univalent foundations4
String diagram rewrite theory II: Rewriting with symmetric monoidal structure4
Implicative algebras: a new foundation for realizability and forcing4
A categorical view of varieties of ordered algebras3
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs3
Rewriting with generalized nominal unification3
Two decades of automatic amortized resource analysis3
Causal inference via string diagram surgery3
Quantum circuits generating four-qubit maximally entangled states2
On reduction and normalization in the computational core2
Weakest preconditions in fibrations2
Convenient antiderivatives for differential linear categories2
Substitution Principle and semidirect products2
Back to the Coordinated Attack Problem2
Separating minimal valuations, point-continuous valuations, and continuous valuations2
A domain-theoretic framework for robustness analysis of neural networks2
Probability, valuations, hyperspace: Three monads on top and the support as a morphism2
Forward analysis for WSTS, part I: completions2
Finitary monads on the category of posets2
A focused linear logical framework and its application to metatheory of object logics2
Strictifying and taming directed paths in Higher Dimensional Automata2
Detection and diagnosis of deviations in distributed systems of autonomous agents2
Products and projective limits of continuous valuations on T0 spaces2
Implicit computation complexity in higher-order programming languages2
Proof-relevance in Bishop-style constructive mathematics2
Type-based analysis of logarithmic amortised complexity2
Formalising nominal C-unification generalised with protected variables2
Freely adjoining monoidal duals2
Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention2
Preserving consistency in geometric modeling with graph transformations2
Synthetic topology in Homotopy Type Theory for probabilistic programming1
Metric monads1
Confluence of algebraic rewriting systems1
Semantic analysis of normalisation by evaluation for typed lambda calculus1
Doctrines, modalities and comonads1
Elementary fibrations of enriched groupoids1
Constructive sheaf models of type theory1
Modal descent1
Higher-order pattern generalization modulo equational theories1
A unified approach to some non-Hausdorff topological properties1
A general framework for the semantics of type theory1
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability1
Robustness, Scott continuity, and computability1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties1
Indexed type theories1
Cubical methods in homotopy type theory and univalent foundations1
Quantifiers on languages and codensity monads1
Z property for the shuffling calculus1
The costructure–cosemantics adjunction for comodels for computational effects1
Triposes as a generalization of localic geometric morphisms1
Indexed and fibered structures for partial and total correctness assertions1
An improved primal-dual approximation algorithm for the k-means problem with penalties1
Rogers semilattices of punctual numberings1
Computing with continuous objects: a uniform co-inductive approach1
Algebras of UTxO blockchains1
Convolution and concurrency1
Branching-time logics and fairness, revisited1
Nilpotent types and fracture squares in homotopy type theory1
Coherence for bicategorical cartesian closed structure1
Dilations and information flow axioms in categorical probability1
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability1
Consistent disjunctive sequent calculi and Scott domains1
Bounded ACh unification1
The role of linearity in sharing analysis1
A (machine-oriented) logic based on pattern matching1
CHAD for expressive total languages1
0.086255073547363