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

Article	Citations
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations – Part II	10
On notions of compactness, object classifiers, and weak Tarski universes	10
Hom weak ω-categories of a weak ω-category	9
Preface for the special issue in homage to Martin Hofmann Part 2	8
Syntax and models of Cartesian cubical type theory	6
Rewriting in Gray categories with applications to coherence	6
A point-free perspective on lax extensions and predicate liftings	6
An improved primal-dual approximation algorithm for the k-means problem with penalties	5
A linear logic framework for multimodal logics	4
Strictifying and taming directed paths in Higher Dimensional Automata	4
Preface for the special issue in homage to Martin Hofmann Part 1	4
Normalization in the simply typed -calculus	3
Apartness, sharp elements, and the Scott topology of domains	3
A construction of free dcpo-cones	3
Game semantics of Martin-Löf type theory	3
Bicategories in univalent foundations	3
T₀-spaces and the lower topology	3
On function spaces equipped with Isbell topology and Scott topology	3
Substitution Principle and semidirect products	3
Optimal approximate minimization of one-letter weighted finite automata	3
Languages of higher-dimensional automata	3
Consistent disjunctive sequent calculi and Scott domains	2
Game characterizations for the number of quantifiers	2
Preface	2
E-Unification based on Generalized Embedding	2

The combinator M and the Mockingbird lattice	2
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part II	2
Formalising nominal C-unification generalised with protected variables	2
Automatic differentiation for ML-family languages: Correctness via logical relations	2
The costructure–cosemantics adjunction for comodels for computational effects	2
A concrete model for a typed linear algebraic lambda calculus	2
Causal inference via string diagram surgery	2
Wb-sober spaces and the core-coherence of dcpo models	2
Univalent categories of modules	2
A special issue on categorical algebras and computation in celebration of John Power’s 60th birthday, part I	2
Universal algebra in UniMath	2
Discrete equational theories	1
Introduction to the special issue: Confluence	1
Monoidal reverse differential categories	1
A dual-context sequent calculus for the constructive modal logic S4	1
Scott topology on Smyth power posets	1
Doctrines, modalities and comonads	1
Cubical methods in homotopy type theory and univalent foundations	1
Proof-relevance in Bishop-style constructive mathematics	1
Synthetic G-jet-structures in modal homotopy type theory	1
Symmetric monoidal smash products in homotopy type theory	1
Coherent differentiation	1
A focused linear logical framework and its application to metatheory of object logics	1
Divergences on monads for relational program logics	1
A linear linear lambda-calculus	1
Naive cubical type theory	1
Z property for the shuffling calculus	1
Special Issue on Theory and Applications of Models of Computation TAMC 2022	1
Constructive sheaf models of type theory	1
Preface – MSCS	1
You can only be lucky once: optimal gossip for epistemic goals	1
New and improved bounds on the contextuality degree of multi-qubit configurations	1
The category of iterative sets in homotopy type theory and univalent foundations	1
From type theory to setoids and back	1
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability	1
An intuitionistic set-theoretical model of fully dependent CC	1
Elementary fibrations of enriched groupoids	1
Monoidal weak ω-categories as models of a type theory	1
Learning quantum finite automata with queries	1
On generalized algebraic theories and categories with families	1
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions	1
The complexity of completions in partial combinatory algebra	1