Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

Scott topology on Smyth power posets: Label: en
Not every countable complete distributive lattice is sober: Label: en
Computable soft separation axioms: Label: en
Monoidal weak ω-categories as models of a type theory: Label: en
Two-level type theory and applications: Label: en
The long exact sequence of homotopy n-groups: Label: en
On notions of compactness, object classifiers, and weak Tarski universes: Label: en
Special issue on homotopy type theory 2019 vol. 2: Label: en
A (machine-oriented) logic based on pattern matching: Label: en
Divergences on monads for relational program logics: Label: en
CHAD for expressive total languages: Label: en
Coherent differentiation: Label: en
Behavioural equivalences for continuous-time Markov processes: Label: en
A general framework for the semantics of type theory: Label: en
Univalent categories of modules: Label: en
A domain-theoretic framework for robustness analysis of neural networks: Label: en
Constructing a small category of setoids: Label: en
Relative formal topology: the binary positivity predicate comes first: Label: en
Bisimulations for non-deterministic labelled Markov processes: Label: en
Lenses, fibrations and universal translations: Label: en
Interpolation for predefined types: Label: en
Detection and diagnosis of deviations in distributed systems of autonomous agents: Label: en
Weighted synchronous automata: Label: en
A dual-context sequent calculus for the constructive modal logic S4: Label: en
A linear logic framework for multimodal logics: Label: en
Indexed and fibered structures for partial and total correctness assertions: Label: en
Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability: Label: en
Preface to Special Issue: LSFA 2019 and 2020: Label: en
Monoidal reverse differential categories: Label: en
From type theory to setoids and back: Label: en
On function spaces equipped with Isbell topology and Scott topology: Label: en
Normalization in the simply typed -calculus: Label: en
Semantic analysis of normalisation by evaluation for typed lambda calculus: Label: en
Z property for the shuffling calculus: Label: en
A rewriting coherence theorem with applications in homotopy type theory: Label: en
On reduction and normalization in the computational core: Label: en
Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs: Label: en
Confluence of algebraic rewriting systems: Label: en
String diagram rewrite theory III: Confluence with and without Frobenius: Label: en
Introduction to the special issue: Confluence: Label: en
Some representations of real numbers using integer sequences: Label: en
Rewriting in Gray categories with applications to coherence: Label: en
Two decades of automatic amortized resource analysis: Label: en
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem: Label: en
Preface for the special issue in homage to Martin Hofmann Part 2: Label: en
Type-based analysis of logarithmic amortised complexity: Label: en
A quantitative model for simply typed λ-calculus: Label: en
Implicit computation complexity in higher-order programming languages: Label: en
A projective formalism applied to topological and probabilistic event structures: Label: en
Restriction categories III: colimits, partial limits and extensivity: Label: en