OOIR: Observatory of International Research

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-11-01 to 2024-11-01.)

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
Two decades of automatic amortized resource analysis	6
Two-level type theory and applications	6
String diagram rewrite theory II: Rewriting with symmetric monoidal structure	6
String diagram rewrite theory III: Confluence with and without Frobenius	5
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
Bicategories in univalent foundations	4
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
Products and projective limits of continuous valuations on T₀ spaces	3
Finitary monads on the category of posets	3
A focused linear logical framework and its application to metatheory of object logics	3
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
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
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
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