Mathematical Structures in Computer Science

Article	Citations
Three improvements to the top-down solver	10
Syntax and models of Cartesian cubical type theory	10
Languages of higher-dimensional automata	9
Quasi-Nelson algebras and fragments	8
String diagram rewrite theory II: Rewriting with symmetric monoidal structure	6
Two decades of automatic amortized resource analysis	6
Two-level type theory and applications	6
String diagram rewrite theory III: Confluence with and without Frobenius	5
Bicategories in univalent foundations	4
On reduction and normalization in the computational core	4
Back to the Coordinated Attack Problem	4
A categorical view of varieties of ordered algebras	4
Products and projective limits of continuous valuations on T0 spaces	3
Finitary monads on the category of posets	3
A focused linear logical framework and its application to metatheory of object logics	3
Bisimulation as a logical relation	3
Coherence for bicategorical cartesian closed structure	3
Proof-relevance in Bishop-style constructive mathematics	3
Causal inference via string diagram surgery	3
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs	3
Weakest preconditions in fibrations	3
Type-based analysis of logarithmic amortised complexity	3
Synthetic topology in Homotopy Type Theory for probabilistic programming	2
A domain-theoretic framework for robustness analysis of neural networks	2
Implicit computation complexity in higher-order programming languages	2

Dilations and information flow axioms in categorical probability	2
Strictifying and taming directed paths in Higher Dimensional Automata	2
Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention	2
Preserving consistency in geometric modeling with graph transformations	2
Quantum circuits generating four-qubit maximally entangled states	2
Semantic analysis of normalisation by evaluation for typed lambda calculus	2
Formalising nominal C-unification generalised with protected variables	2
Separating minimal valuations, point-continuous valuations, and continuous valuations	2
Detection and diagnosis of deviations in distributed systems of autonomous agents	2
Probability, valuations, hyperspace: Three monads on top and the support as a morphism	2
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability	2
Substitution Principle and semidirect products	2
The costructure–cosemantics adjunction for comodels for computational effects	1
Apartness, sharp elements, and the Scott topology of domains	1
The Scott model of PCF in univalent type theory	1
Indexed and fibered structures for partial and total correctness assertions	1
Logical characterizations of algebraic circuit classes over integral domains	1
Robustness, Scott continuity, and computability	1
A rewriting coherence theorem with applications in homotopy type theory	1
Not every countable complete distributive lattice is sober	1
Confluence of algebraic rewriting systems	1
Cubical methods in homotopy type theory and univalent foundations	1
Quantifiers on languages and codensity monads	1
Constructive sheaf models of type theory	1
Triposes as a generalization of localic geometric morphisms	1
The role of linearity in sharing analysis	1
A general framework for the semantics of type theory	1
Computing with continuous objects: a uniform co-inductive approach	1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem	1
Algebras of UTxO blockchains	1
On Church’s thesis in cubical assemblies	1
Bicategorical type theory: semantics and syntax	1
Scott topology on Smyth power posets	1
Elementary fibrations of enriched groupoids	1
Coherent differentiation	1
An improved primal-dual approximation algorithm for the k-means problem with penalties	1
A (machine-oriented) logic based on pattern matching	1
Rogers semilattices of punctual numberings	1
CHAD for expressive total languages	1
Convolution and concurrency	1
Metric monads	1
Branching-time logics and fairness, revisited	1
A linear linear lambda-calculus	1
Doctrines, modalities and comonads	1
Z property for the shuffling calculus	1
Behavioural equivalences for continuous-time Markov processes	0
Two-stage submodular maximization problem beyond nonnegative and monotone	0
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations – Part II	0
Up-to techniques for behavioural metrics via fibrations	0
What should a generic object be?	0

Dimension in team semantics	0
Witnessing flows in arithmetic	0
Visibility and exploitation in social networks	0
An intuitionistic set-theoretical model of fully dependent CC	0
The order-K-ification monads	0
Discrete equational theories	0
Equational theorem proving for clauses over strings	0
Divergences on monads for relational program logics	0
A construction of free dcpo-cones	0
An interpretation of dependent type theory in a model category of locally cartesian closed categories	0
A MALL geometry of interaction based on indexed linear logic	0
On notions of compactness, object classifiers, and weak Tarski universes	0
Parameterized complexity of weighted team definability	0
New and improved bounds on the contextuality degree of multi-qubit configurations	0
On Hofmann–Streicher universes	0
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties	0
The combinator M and the Mockingbird lattice	0
Material dialogues for first-order logic in constructive type theory: extended version	0
Game characterizations for the number of quantifiers	0
Linear logic in normed cones: probabilistic coherence spaces and beyond	0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II	0
A 2-categorical proof of Frobenius for fibrations defined from a generic point	0
On function spaces equipped with Isbell topology and Scott topology	0
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?	0
Univalent categories of modules	0
Local Yoneda completions of quasi-metric spaces	0
Injective types in univalent mathematics	0
Weighted synchronous automata	0
A set-theoretic approach to algebraic L-domains	0
The genesis of the groupoid model	0
Two-level type theory and applications - ERRATUM	0
Countability constraints in order-theoretic approaches to computability	0
Fixed point logics and definable topological properties	0
Monoidal weak ω-categories as models of a type theory	0
The long exact sequence of homotopy n-groups	0
Implicational Kleene algebra with domain and the substructural logic of partial correctness	0
The geometry of Bayesian programming	0
From type theory to setoids and back	0
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding	0
A dual-context sequent calculus for the constructive modal logic S4	0
T0-spaces and the lower topology	0
Special issue on homotopy type theory 2019	0
On generalized algebraic theories and categories with families	0
Rewriting in Gray categories with applications to coherence	0
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties	0
Consistent disjunctive sequent calculi and Scott domains	0
GADTs are not (Even partial) functors	0
Hofmann-Mislove type definitions of non-Hausdorff spaces	0
A concrete model for a typed linear algebraic lambda calculus	0
Adding an implication to logics of perfect paradefinite algebras	0
A point-free perspective on lax extensions and predicate liftings	0
Martin Hofmann’s contributions to type theory: Groupoids and univalence	0
Preface	0
Some representations of real numbers using integer sequences	0
A linear logic framework for multimodal logics	0
On existence of equilibrium under social coalition structures	0
Preface to special issue: LSFA 2017 and 2018	0
Hom weak ω-categories of a weak ω-category	0
Preface to the special issue on metric and differential semantics	0
Game semantics of Martin-Löf type theory	0
Monotone recursive types and recursive data representations in Cedille	0
Special issue on logic and complexity	0
Special Issue on Theory and Applications of Models of Computation TAMC 2022	0
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs	0
Introduction to the special issue: Confluence	0
Computable soft separation axioms	0
Learning quantum finite automata with queries	0
Abstract cyclic proofs	0
Monoidal reverse differential categories	0
Wb-sober spaces and the core-coherence of dcpo models	0
On (co)products of partial combinatory algebras, with an application to pushouts of realizability toposes	0
Naive cubical type theory	0
Automatic differentiation for ML-family languages: Correctness via logical relations	0
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs	0
The complexity of completions in partial combinatory algebra	0
Preface for the special issue in homage to Martin Hofmann Part 1	0
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective	0
You can only be lucky once: optimal gossip for epistemic goals	0
Preface to Special Issue: LSFA 2019 and 2020	0
Special issue on homotopy type theory 2019 vol. 2	0

E-Unification based on Generalized Embedding	0
On planarity of graphs in homotopy type theory	0
Normalization in the simply typed -calculus	0
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations	0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part I	0
A quantitative model for simply typed λ-calculus	0
Preface for the special issue in homage to Martin Hofmann Part 2	0