LICS 2018 Accepted Papers
What's in a game? A theory of game models
A modal mu perspective on solving parity games in quasipolynomial time.
An Asynchronous Soundness Theorem for Concurrent Separation Logic
An answer to the Gamma question
Riesz Modal Logic with Threshold Operators
Degrees of Relatedness - A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable.
A theory of linear typings as flows on 3-valent graphs
Causal Computational Complexity of Distributed Processes
Logical paradoxes in quantum computation
Type-two polynomial-time and restricted lookahead.
Quasi-Open Bisimilarity with Mismatch is Intuitionistic
Probabilistic Böhm Trees and Probabilistic Separation
The Geometry of Computation-Graph Abstraction
Two complete axiomatisations of pure-state qubit quantum computing
Ribbon tensorial logic
Impredicative Encodings of (Higher) Inductive Types
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
Around Classical and Intuitionistic Linear Logics
Every λ-Term is Meaningful for the Infinitary Relational Model
A functional interpretation with state
Definable decompositions for graphs of bounded linear cliquewidth
Parameterized circuit complexity of model-checking on sparse structures
Rewriting with Frobenius
A Simple and Optimal Complementation Algorithm for Büchi Automata
Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
Classical realizability as a classifier for nondeterminism
A General Framework for Relational Parametricity
Polynomial Invariants for Affine Programs
Automaton-Based Criteria for Membership in CTL
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
Strong Sums in Focused Logic
Work Analysis with Resource-Aware Session Types
Differential Equation Axiomatization: The Impressive Power of Differential Ghosts
A Generalized Modality for Recursion
Quantitative Behavioural Reasoning for Higher-order Effectful Programs: Applicative Distances
Higher Groups in Homotopy Type Theory
A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow
Eager Functions as Processes
Guarded Computational Type Theory
Playing with Repetitions in Data Words Using Energy Games
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
Species, Profunctors and Taylor Expansion Weighted by SMCC--A Unified Framework for Modelling Nondeterministic, Probabilistic and Quantum Programs--
Wreath Products of Distributive Forest Algebras
Unification nets: canonical proof net quantifiers
Tree depth, quantifier elimination, and quantifier rank
One Theorem to Rule Them All: A Unified Translation of LTL into $\omega$-Automata
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
Regular and First Order List Functions
Rational Synthesis Under Imperfect Information
Compositional game theory
Syntax and Semantics for Operations with Scopes
The State Complexity of Alternating Automata
Weighted model counting beyond two-variable logic
Sound up-to techniques and Complete abstract domains
Allegories: decidability and graph homomorphisms
Satisfiability in multi-valued circuits
ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency
Boolean-Valued Semantics for Stochastic Lambda-Calculus
Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes
An algebraic theory of Markov processes
On the number of types in sparse graphs
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth
A van Benthem Theorem for Fuzzy Modal Logic
Logics for Word Transductions with Synthesis
Regular Transducer Expressions for Regular Transformations over infinite words
Free Higher Groups in Homotopy Type Theory
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
Distribution-based objectives for Markov Decision Processes
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem
The concurrent game semantics of Probabilistic PCF
Cellular Cohomology in Homotopy Type Theory
The Syntax and Semantics of Quantitative Type Theory
On computability and tractability for infinite sets
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
A Logical Account for Linear Partial Differential Equations
Computable decision-making on the reals and other spaces via partiality and nondeterminism
A Theory of Register Monitors
LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic
Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams
On Higher Inductive Types in Cubical Type Theory
Probabilistic stable functions on discrete cones are power series.
A sequent calculus with dependent types for classical arithmetic
Computability Beyond Church-Turing via Choice Sequences
PTL-separability and closures for WQOs on words
Concurrency and Probability: Removing Confusion, Compositionally
Sequential Relational Decomposition
Dependent Temporal Effects and Fixpoint Logic for Verification
Unary negation fragment with equivalence relations has the finite model property
Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types
Dialectica models of type theory
LICS Sponsorship
The symposium is sponsored by ACM SIGLOG and the IEEE Technical Committee on Mathematical Foundations of Computing.
Website by Sam Staton based on a bootstrap design by Hartmut Eilers and Eric Koskinen.