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 #1 to #50.

Node Replication: Theory And Practice: Label: en
Existential Definability over the Subword Ordering: Label: en
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications: Label: en
Relational Models for the Lambek Calculus with Intersection and Constants: Label: en
The syntactic side of autonomous categories enriched over generalised metric spaces: Label: en
Categorical composable cryptography: extended version: Label: en
Space-Fluid Adaptive Sampling by Self-Organisation: Label: en
A Trichotomy for Regular Trail Queries: Label: en
Simulation by Rounds of Letter-to-Letter Transducers: Label: en
Rewriting with Acyclic Queries: Mind Your Head: Label: en
A categorical characterization of relative entropy on standard Borel spaces: Label: en
The Power-Set Construction for Tree Algebras: Label: en
Token Games and History-Deterministic Quantitative-Automata: Label: en
A coherent differential PCF: Label: en
Subgame-perfect Equilibria in Mean-payoff Games (journal version): Label: en
Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library: Label: en
Variable binding and substitution for (nameless) dummies: Label: en
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests: Label: en
Separators in Continuous Petri Nets: Label: en
Towards Uniform Certification in QBF: Label: en
Galois connecting call-by-value and call-by-name: Label: en
Varieties of unary-determined distributive $\ell$-magmas and bunched implication algebras: Label: en
revTPL: The Reversible Temporal Process Language: Label: en
Playing Safe, Ten Years Later: Label: en
Linear Programs with Conjunctive Database Queries: Label: en
Deciding Equations in the Time Warp Algebra: Label: en
Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language: Label: en
Foundations of probability-raising causality in Markov decision processes: Label: en
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct: Label: en
Depth lower bounds in Stabbing Planes for combinatorial principles: Label: en
Robustness against Read Committed for Transaction Templates with Functional Constraints: Label: en
Efficient Evaluation of Arbitrary Relational Calculus Queries: Label: en
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets: Label: en
Decision Questions for Probabilistic Automata on Small Alphabets: Label: en
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings: Label: en
Dynamic Cantor Derivative Logic: Label: en
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic: Label: en
Model Checking Temporal Properties of Recursive Probabilistic Programs: Label: en
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic: Label: en
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version): Label: en
Overlap Algebras as Almost Discrete Locales: Label: en
Fine-Grained Complexity of Regular Path Queries: Label: en
A model of actors and grey failures: Label: en
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages: Label: en
Making first order linear logic a generating grammar: Label: en
Arboreal Categories: An Axiomatic Theory of Resources: Label: en
A first-order logic characterization of safety and co-safety languages: Label: en
The Complexity of Aggregates over Extractions by Regular Expressions: Label: en
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries: Label: en
Continuous Positional Payoffs: Label: en