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 2020-03-01 to 2024-03-01.)
ArticleCitations
Open Petri nets20
SMT-based verification of data-aware processes: a model-theoretic approach13
From Kruskal’s theorem to Friedman’s gap condition6
Syntax and models of Cartesian cubical type theory6
Quasi-Nelson algebras and fragments6
Three improvements to the top-down solver6
Bisimulation as a logical relation5
String diagram rewrite theory III: Confluence with and without Frobenius4
Bicategories in univalent foundations4
Two-level type theory and applications4
Languages of higher-dimensional automata4
Petri nets based on Lawvere theories4
Implicative algebras: a new foundation for realizability and forcing4
Two decades of automatic amortized resource analysis3
Causal inference via string diagram surgery3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure3
A categorical view of varieties of ordered algebras3
Cofree coalgebras and differential linear logic3
Denotational semantics for guarded dependent type theory3
Rewriting with generalized nominal unification3
Freely adjoining monoidal duals2
Products and projective limits of continuous valuations on T0 spaces2
Proof-relevance in Bishop-style constructive mathematics2
Convenient antiderivatives for differential linear categories2
Back to the Coordinated Attack Problem2
Separating minimal valuations, point-continuous valuations, and continuous valuations2
Probability, valuations, hyperspace: Three monads on top and the support as a morphism2
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
A domain-theoretic framework for robustness analysis of neural networks2
Implicit computation complexity in higher-order programming languages2
Type-based analysis of logarithmic amortised complexity2
Formalising nominal C-unification generalised with protected variables2
Doctrines, modalities and comonads1
Witness algebra and anyon braiding1
Indexed and fibered structures for partial and total correctness assertions1
Quantifiers on languages and codensity monads1
Rogers semilattices of punctual numberings1
Z property for the shuffling calculus1
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs1
Encodings of Turing machines in linear logic1
CHAD for expressive total languages1
Modal descent1
Synthetic topology in Homotopy Type Theory for probabilistic programming1
Substitution Principle and semidirect products1
Metric monads1
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties1
Quantum circuits generating four-qubit maximally entangled states1
Dilations and information flow axioms in categorical probability1
On reduction and normalization in the computational core1
Forward analysis for WSTS, part I: completions1
The role of linearity in sharing analysis1
Elementary fibrations of enriched groupoids1
A (machine-oriented) logic based on pattern matching1
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability1
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability1
The costructure–cosemantics adjunction for comodels for computational effects1
Robustness, Scott continuity, and computability1
Bounded ACh unification1
Convolution and concurrency1
Detection and diagnosis of deviations in distributed systems of autonomous agents1
Branching-time logics and fairness, revisited1
Indexed type theories1
Weakest preconditions in fibrations1
Cubical methods in homotopy type theory and univalent foundations1
Coherence for bicategorical cartesian closed structure1
A general framework for the semantics of type theory1
Computing knowledge in equational extensions of subterm convergent theories1
Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention1
Constructive sheaf models of type theory1
Computing with continuous objects: a uniform co-inductive approach1
Consistent disjunctive sequent calculi and Scott domains1
Algebras of UTxO blockchains1
A unified approach to some non-Hausdorff topological properties1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem1
Preserving consistency in geometric modeling with graph transformations1
Confluence of algebraic rewriting systems1
Nilpotent types and fracture squares in homotopy type theory1
Dynamic game semantics0
Naive cubical type theory0
The genesis of the groupoid model0
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part I0
Apartness, sharp elements, and the Scott topology of domains0
Parameterized complexity of weighted team definability0
Coherent differentiation0
Hofmann-Mislove type definitions of non-Hausdorff spaces0
The nominal/FM Yoneda Lemma0
Preface to the special issue on metric and differential semantics0
Univalent categories of modules0
Some representations of real numbers using integer sequences0
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations0
On notions of compactness, object classifiers, and weak Tarski universes0
Model structure on the universe of all types in interval type theory0
On Church’s thesis in cubical assemblies0
Normalization in the simply typed -calculus0
Two-stage submodular maximization problem beyond nonnegative and monotone0
What should a generic object be?0
Preface for the special issue in homage to Martin Hofmann Part 20
Visibility and exploitation in social networks0
Discrete equational theories0
The long exact sequence of homotopy n-groups0
Introduction to the special issue: Confluence0
Computable soft separation axioms0
From type theory to setoids and back0
On (co)products of partial combinatory algebras, with an application to pushouts of realizability toposes0
Divergences on monads for relational program logics0
Hom weak ω-categories of a weak ω-category0
An interpretation of dependent type theory in a model category of locally cartesian closed categories0
A MALL geometry of interaction based on indexed linear logic0
Triposes as a generalization of localic geometric morphisms0
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective0
E-Unification based on Generalized Embedding0
Game semantics of Martin-Löf type theory0
Bicategorical type theory: semantics and syntax0
A concrete model for a typed linear algebraic lambda calculus0
Preserving cardinals and weak forms of Zorn’s lemma in realizability models0
Up-to techniques for behavioural metrics via fibrations0
Special issue on homotopy type theory 2019 vol. 20
A point-free perspective on lax extensions and predicate liftings0
A quantitative model for simply typed λ-calculus0
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?0
Rewriting in Gray categories with applications to coherence0
Preface to special issue: LSFA 2017 and 20180
Weighted synchronous automata0
On function spaces equipped with Isbell topology and Scott topology0
Higher-order pattern generalization modulo equational theories0
Introduction to the special issue: Unification0
Injective types in univalent mathematics0
The order-K-ification monads0
Scott topology on Smyth power posets0
A rewriting coherence theorem with applications in homotopy type theory0
An intuitionistic set-theoretical model of fully dependent CC0
Two-level type theory and applications - ERRATUM0
Monoidal reverse differential categories0
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding0
A dual-context sequent calculus for the constructive modal logic S40
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations – Part II0
Special issue on homotopy type theory 20190
On generalized algebraic theories and categories with families0
Extensional constructive real analysis via locators0
Behavioural equivalences for continuous-time Markov processes0
The combinator M and the Mockingbird lattice0
An improved primal-dual approximation algorithm for the k-means problem with penalties0
Martin Hofmann’s contributions to type theory: Groupoids and univalence0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II0
Material dialogues for first-order logic in constructive type theory: extended version0
Preface0
Preface to Special Issue: LSFA 2019 and 20200
Linear logic in normed cones: probabilistic coherence spaces and beyond0
A construction of free dcpo-cones0
Local Yoneda completions of quasi-metric spaces0
On existence of equilibrium under social coalition structures0
Preface for the special issue in homage to Martin Hofmann Part 10
The Scott model of PCF in univalent type theory0
Monotone recursive types and recursive data representations in Cedille0
A linear logic framework for multimodal logics0
Fixed point logics and definable topological properties0
Learning quantum finite automata with queries0
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs0
Monoidal weak ω-categories as models of a type theory0
Not every countable complete distributive lattice is sober0
Semantic analysis of normalisation by evaluation for typed lambda calculus0
The geometry of Bayesian programming0
Jets and differential linear logic0
Game characterizations for the number of quantifiers0
0.024248123168945