Mathematical Structures in Computer Science

Article	Citations
Preface: Advances in Homotopy Type Theory	14
Automatic differentiation for ML-family languages: Correctness via logical relations	11
An axiomatics and a combinatorial model of creation/annihilation operators	11
Bicategories in univalent foundations	8
A construction of free dcpo-cones	6
A point-free perspective on lax extensions and predicate liftings	6
Hom weak ω-categories of a weak ω-category	5
Substitution Principle and semidirect products	5
Game semantics of Martin-Löf type theory	5
Principal types as partial involutions	4
Preface – MSCS	4
Monoidal weak ω-categories as models of a type theory	4
Type-based analysis of logarithmic amortised complexity	4
Z property for the shuffling calculus	4
Implicational Kleene algebra with domain and the substructural logic of partial correctness	4
Learning quantum finite automata with queries	3
Weighted synchronous automata	3
Foreword	3
Groupoidal realizability for intensional type theory	3
Divergences on monads for relational program logics	3
A foundation for synthetic algebraic geometry	3
Implicit computation complexity in higher-order programming languages	3
String diagram rewrite theory II: Rewriting with symmetric monoidal structure	3
On existence of equilibrium under social coalition structures	3
The Grothendieck construction in the context of tangent categories	2

Computational synthetic cohomology theory in homotopy type theory	2
Univalent categories of modules	2
Abstract cyclic proofs	2
Adding an implication to logics of perfect paradefinite algebras	2
Visibility and exploitation in social networks	2
Preface	2
A categorical view of varieties of ordered algebras	2
Preserving consistency in geometric modeling with graph transformations	2
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs	2
Apartness, sharp elements, and the Scott topology of domains	2
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions	2
Preface for the special issue in homage to Martin Hofmann Part 1	2
Logical characterizations of algebraic circuit classes over integral domains	2
On Hofmann–Streicher universes	2
Robustness, Scott continuity, and computability	1
A short proof of the Frobenius property for generic fibrations	1
Hofmann-Mislove type definitions of non-Hausdorff spaces	1
Special issue on logic and complexity	1
The order-K-ification monads	1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem	1
On function spaces equipped with Isbell topology and Scott topology	1
Preface to the special issue on metric and differential semantics	1
Prior’s ideal language	1
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs	1
Two-level type theory and applications	1
String diagram rewrite theory III: Confluence with and without Frobenius	1
From type theory to setoids and back	1
Transformation of any Verbrugge model to a bisimilar Veltman model	1
The combinator M and the Mockingbird lattice	1
On notions of compactness, object classifiers, and weak Tarski universes	1
Bisimulation as a logical relation	1
Indexed and fibered structures for partial and total correctness assertions	1
On higher-order communication in ambient calculi	1
Weakest preconditions in fibrations	1
Proof-relevance in Bishop-style constructive mathematics	1
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties	1
CHAD for expressive total languages	1
A classification of bisimilarities for general Markov decision processes	1
Coherent Taylor expansion as a bimonad	1
Two-stage submodular maximization problem beyond nonnegative and monotone	1
Paraconsistent transition structures: compositional principles and a modal logic	0
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II	0
On generalized algebraic theories and categories with families	0
Special issue on homotopy type theory 2019 vol. 2	0
Naive cubical type theory	0
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs	0
A set-theoretic approach to algebraic L-domains	0
New and improved bounds on the contextuality degree of multi-qubit configurations	0
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability	0
Material dialogues for first-order logic in constructive type theory: extended version	0

Universal algebra in UniMath	0
Behavioural equivalences for continuous-time Markov processes	0
The category of iterative sets in homotopy type theory and univalent foundations	0
Introduction to the special issue: Confluence	0
Rewriting in Gray categories with applications to coherence	0
Non-Hausdorff parallelized manifolds over geometric models of conservative programs	0
Confluence of algebraic rewriting systems	0
A domain-theoretic framework for robustness analysis of neural networks	0
What should a generic object be?	0
Parameterized complexity of weighted team definability	0
Up-to techniques for behavioural metrics via fibrations	0
A rewriting coherence theorem with applications in homotopy type theory	0
Probability, valuations, hyperspace: Three monads on top and the support as a morphism	0
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?	0
A general framework for the semantics of type theory	0
Differentiable causal computations via delayed trace (extended version)	0
The complexity of completions in partial combinatory algebra	0
Quantum circuits generating four-qubit maximally entangled states	0
Optimal approximate minimization of one-letter weighted finite automata	0
A linear linear lambda-calculus	0
On planarity of graphs in homotopy type theory	0
GADTs are not (Even partial) functors	0
Witnessing flows in arithmetic	0
Two decades of automatic amortized resource analysis	0
An intuitionistic set-theoretical model of fully dependent CC	0
Constructive sheaf models of type theory	0
Two-level type theory and applications - ERRATUM	0
Scott topology on Smyth power posets	0
Preface to Special Issue: LSFA 2019 and 2020	0
Wb-sober spaces and the core-coherence of dcpo models	0
Normalization in the simply typed -calculus	0
Inquisitive split and structural completeness	0
Preface for the special issue in homage to Martin Hofmann Part 2	0
You can only be lucky once: optimal gossip for epistemic goals	0
On Church’s thesis in cubical assemblies	0
Discrete equational theories	0
On reduction and normalization in the computational core	0
T0-spaces and the lower topology	0
Synthetic G-jet-structures in modal homotopy type theory	0
Convolution and concurrency	0
Special issue on homotopy type theory 2019	0
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective	0
The patch topology in univalent foundations	0
Computable soft separation axioms	0
Stochastic linearized generalized alternating direction method of multipliers: Expected convergence rates and large deviation properties	0
Game characterizations for the number of quantifiers	0
Some representations of real numbers using integer sequences	0
Two-layered logics for probabilities and belief functions over Belnap–Dunn logic	0
Symmetric monoidal smash products in homotopy type theory	0
A (machine-oriented) logic based on pattern matching	0
Dimension in team semantics	0
Dilations and information flow axioms in categorical probability	0
E-Unification based on Generalized Embedding	0
Detection and diagnosis of deviations in distributed systems of autonomous agents	0
Elementary fibrations of enriched groupoids	0
Special Issue on Theory and Applications of Models of Computation TAMC 2022	0
sL-approximation spaces capture sL-domains	0
Monoidal reverse differential categories	0
Not every countable complete distributive lattice is sober	0
Rogers semilattices of punctual numberings	0
The role of linearity in sharing analysis	0
A linear logic framework for multimodal logics	0
A parametricity-based formalization of semi-simplicial and semi-cubical sets	0
Semantic analysis of normalisation by evaluation for typed lambda calculus	0
Cubical methods in homotopy type theory and univalent foundations	0
The costructure–cosemantics adjunction for comodels for computational effects	0
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding	0
Foreword	0
Countability constraints in order-theoretic approaches to computability	0
Branching-time logics and fairness, revisited	0
Bicategorical type theory: semantics and syntax	0
Smooth and proper maps with respect to a fibration	0
The long exact sequence of homotopy n-groups	0
Three improvements to the top-down solver	0
Local Yoneda completions of quasi-metric spaces	0
Equational theorem proving for clauses over strings	0
Fixed point logics and definable topological properties	0
Coherent differentiation	0
A 2-categorical proof of Frobenius for fibrations defined from a generic point	0
Algebras of UTxO blockchains	0

A concrete model for a typed linear algebraic lambda calculus	0
The set of maximal points of an $\boldsymbol{\omega}$ -domain need not be a $\boldsymbol{G}_{\boldsymbol{\delta}}$ -set	0
A quantitative model for simply typed λ-calculus	0
A dual-context sequent calculus for the constructive modal logic S4	0