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 2021-06-01 to 2025-06-01.)

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

Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs	2
Visibility and exploitation in social networks	2
Univalent categories of modules	2
Apartness, sharp elements, and the Scott topology of domains	2
Preserving consistency in geometric modeling with graph transformations	2
Logical characterizations of algebraic circuit classes over integral domains	2
Preface	2
A categorical view of varieties of ordered algebras	2
Adding an implication to logics of perfect paradefinite algebras	2
On Hofmann–Streicher universes	2
Preface for the special issue in homage to Martin Hofmann Part 1	2
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions	2
From type theory to setoids and back	2
Robustness, Scott continuity, and computability	1
Indexed and fibered structures for partial and total correctness assertions	1
Two-stage submodular maximization problem beyond nonnegative and monotone	1
The order-K-ification monads	1
Martin Hofmann’s contributions to type theory: Groupoids and univalence	1
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties	1
Monotone recursive types and recursive data representations in Cedille	1
The geometry of Bayesian programming	1
Transformation of any Verbrugge model to a bisimilar Veltman model	1
An improved primal-dual approximation algorithm for the k-means problem with penalties	1
Preface to the special issue on metric and differential semantics	1
Prior’s ideal language	1
Bisimulation as a logical relation	1
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs	1
Finitary monads on the category of posets	1
Weakest preconditions in fibrations	1
Two-level type theory and applications	1
Special issue on logic and complexity	1
On notions of compactness, object classifiers, and weak Tarski universes	1
On function spaces equipped with Isbell topology and Scott topology	1
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem	1
String diagram rewrite theory III: Confluence with and without Frobenius	1
On higher-order communication in ambient calculi	1
Hofmann-Mislove type definitions of non-Hausdorff spaces	1
Proof-relevance in Bishop-style constructive mathematics	1
CHAD for expressive total languages	1