Pages that link to "Item:Q5145612"

The following pages link to Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Q5145612):

Displaying 50 items.

• Linear Dependent Type Theory for Quantum Programming Languages (Q5043587) (← links)
• When Reachability Meets Grzegorczyk (Q5145613) (← links)
• A tale of intersection types (Q5145614) (← links)
• Automatic Structures (Q5145615) (← links)
• Contextual Types, Explained (Q5145616) (← links)
• Logic Beyond Formulas (Q5145617) (← links)
• A Higher Structure Identity Principle (Q5145618) (← links)
• The Integers as a Higher Inductive Type (Q5145619) (← links)
• Space-efficient Query Evaluation over Probabilistic Event Streams (Q5145621) (← links)
• Algebraic models of simple type theories (Q5145623) (← links)
• Approximating Values of Generalized-Reachability Stochastic Games (Q5145624) (← links)
• Reconciling noninterference and gradual typing (Q5145625) (← links)
• Complexity of controlled bad sequences over finite sets of Nd (Q5145626) (← links)
• Deciding Differential Privacy for Programs with Finite Inputs and Outputs (Q5145627) (← links)
• Universal equivalence and majority of probabilistic programs over finite fields (Q5145628) (← links)
• Modal Logics with Composition on Finite Forests (Q5145629) (← links)
• A Hennessy-Milner Theorem for ATL with Imperfect Information (Q5145630) (← links)
• Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes (Q5145631) (← links)
• Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution (Q5145632) (← links)
• The Complexity of Reachability in Affine Vector Addition Systems with States (Q5145633) (← links)
• Temporal Constraint Satisfaction Problems in Fixed-Point Logic (Q5145634) (← links)
• First-order tree-to-tree functions (Q5145635) (← links)
• Extensions of ω-Regular Languages (Q5145637) (← links)
• A Cellular Howe Theorem (Q5145639) (← links)
• On the Weisfeiler-Leman Dimension of Finite Groups (Q5145641) (← links)
• A Fixed Point Theorem on Lexicographic Lattice Structures (Q5145643) (← links)
• Re-pairing brackets (Q5145644) (← links)
• The Benefit of Being Non-Lazy in Probabilistic λ-calculus (Q5145645) (← links)
• An Approach to Regular Separability in Vector Addition Systems (Q5145646) (← links)
• Modal Intuitionistic Logics as Dialgebraic Logics (Q5145647) (← links)
• Cones as a model of intuitionistic linear logic (Q5145648) (← links)
• Uniformisations of Regular Relations Over Bi-Infinite Words (Q5145649) (← links)
• One-Clock Priced Timed Games are PSPACE-hard (Q5145650) (← links)
• Lower Bounds for QBFs of Bounded Treewidth (Q5145651) (← links)
• Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure (Q5145652) (← links)
• Combining probabilistic and non-deterministic choice via weak distributive laws (Q5145654) (← links)
• A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity (Q5145655) (← links)
• Successor-Invariant First-Order Logic on Classes of Bounded Degree (Q5145657) (← links)
• Multimodal Dependent Type Theory (Q5145658) (← links)
• Counting Bounded Tree Depth Homomorphisms (Q5145659) (← links)
• Bisimulation Finiteness of Pushdown Systems Is Elementary (Q5145660) (← links)
• A tier-based typed programming language characterizing Feasible Functionals (Q5145661) (← links)
• Descriptive complexity of real computation and probabilistic independence logic (Q5145662) (← links)
• A calculus of expandable stores (Q5145663) (← links)
• Intermediate problems in modular circuits satisfiability (Q5145664) (← links)
• The Surprising Power of Constant Depth Algebraic Proofs (Q5145666) (← links)
• Interaction Laws of Monads and Comonads (Q5145667) (← links)
• Consuming and Persistent Types for Classical Logic (Q5145668) (← links)
• Refinement-Based Game Semantics for Certified Abstraction Layers (Q5145669) (← links)
• Large and Infinitary Quotient Inductive-Inductive Types (Q5145670) (← links)