LICS 2017: THIRTY-SECOND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE
TALK KEYWORD INDEX

This page contains an index consisting of author-provided keywords.

(
(co)induction
*
*-autonomous categories
\
\Sigma_0^3-completeness
A
Abstracct interpretation
abstract machines
adjunction
affine programs
algebraic approach
algebraic automata theory
Algebraic Complexity
Algebraic Effects
algorithms
Alternating parity automata
Analysis of distributed systems
Antimirov's partial derivatives
Applicative Bisimilarity
approximability
Asymptotic cones
Aumann algebras
automata and logic
Automata theory
Automata transformations
axiomatization
B
B\"uchi automata
Banach spaces
Bar Induction
bar recursion
Bernays-Schoenfinkel-Ramsey fragment
Bisimulation
Boolean closure
Boolean spaces with internal monoid
Bounded Arithmetic
bounded expansion classes of graphs
bounded treewidth
branching vector addition systems
Brotherston-Simpson conjecture
Brzozowski's derivatives
Böhm tree
C
C1 functions
canonization
capturing of polynomial time
categorical model
categorical quantum mechanics
categorical semantics
Category Theory
causal structure
cellular automata
Choice Sequences
Circuit Complexity
circular proofs
circumscription
Clarke's subgradient
clone homomorphism
coalgebra
Coalgebras
codatatypes
codensity monad
cographs
Coherent spaces
coinduction
Coinductive Types
coKleisli category
Common Knowledge Logic
commonsense reasoning
comonad
Comonads
Completeness proof
complexity
Computability
computable analysis
Computable Mathematics
Computable modulus
Computable real function
computation models
Computation with atoms
computational complexity
computational effects
computational logic
computational monad
computational time complexity
Concatenation hierarchies
concurrency
Congruence formats
conjunctive queries
conjunctive regular path queries
constraint programming
constraint satisfaction
constraint satisfaction problem
Constructive Completeness
constructive modal logic
continuity
continuous reachability
convex relaxations
Coq
corecursive algebra
countable choice
countable MDPs
countably categorical structure
Counting complexity classes
counting complexity theory
counting hierarchy
counting problems
Crane Beach
Curry-Howard
Curry-Howard correspondence
Cut-free Axiomatisations
cyclic proofs
D
data structures
database dependencies
database theory
datatypes
De Finetti's Theorem
decidability
decidable first-order fragment
Decidable Fragments
definability of algebraic properties
Delay Games
denotational semantics
dependent type theory
descriptive complexity
descriptive complexity theory
Determinization
dialogue tree
Difference Bound Matrices
Dimension
Dolev-Yao adversary
Domain theory
Domains
dual-context
duality
E
effect masking
Effective convergence
effects
Energy Games
equations over sets of integers
equivalence
Event structures
Existential Pebble Games
Expressive Completeness
expressive power
expressiveness
F
Feasible Mathematics
fibred category
finite model property
finite model theory
finite-degree predicates
Finite-Model Property
First-Order Logic
First-order logic and Quantifier alternation
first-order logic with counting and numerical predicates
fixed point logic with counting
fixed-point logic
fixed-point logic with counting
fixed-point logics with counting
formal mathematics
Frege proofs
full abstraction
full ground references
functional programming
functorial semantics
Fusions
G
games and logic
generalised species
Generic real
Generic set
Geometric logic
geometry of interaction
globular sets
graph database
graph isomorphism
graph languages
Graph rewriting
Guarded Recursion
Gödel Logic
H
hereditary head normalization
Hierarchical observations
higher category theory
higher inductive types
Higher order model checking
higher-order automata
Higher-order Function
higher-order logic
higher-order model checking
Higher-Order Probabilistic Programming Language
higher-order process calculi
Hilbert Basis
homomorphism problem
homotopy type theory
Howe's Method
I
Imperfect information
Indistinguishability
inductive definitions
infinitary calculus
infinite Ramsey theorem
infinite state space
information integration
integrability
interaction nets
Intersection types
Intuitionistic Logic
invariant problem
Isabelle/HOL
isomorphism testing
K
Kleene allegories
knowledge compilation
L
L-derivative
labelled Markov processes
lambda calculus
lambda-calculus
learning theory
Left-c.e. real number
Linear Algebra
linear arithmetic
linear identity
linear logic
liveness
Localic approximable mapping
locality
logic
logic and graphs
logic for polynomial time
logic in databases
logical predicate
M
Mal'tsev algebra
Markov chains
Markov Decision Processes
Markov processes
Markov's principle
Martin-L\"of randomness
Martin-Lof's system of inductive definitions
maximal filters
Mazurkiewicz traces
memory requirement
metric entropy
Metric semantics
metric spaces
minimal inference problem
mixed-sign unbounded expectation
modal lambda calculus
modal logics
Modal Mu-Calculus
model checking
model counting
Model-checking
modular decomposition
modular quantifiers
monad
monadic first-order fragment
Monadic first-order logic without equality
monadic stream function
monads
mu-calculus
multi-dimensional energy games
multisets
N
Natural Deduction
neutral letters
nonidempotent intersection type system
nonmonotonic reasoning
nonuniform recursion
Nullstellensatz
Nuprl
O
one counter automata
one counter nets
One-counter Automata
One-way transducers
Optimal Strategies
optimization
P
PAC learning
parametricity
parametrized complexity
Parikh images
Parity Conditions with Costs
Parity Games
parity objectives
partition refinement algorithms
pasting scheme
permutation graphs
Petri nets
planar graphs
Podelski-Rybalchenko termination theorem
polymorphic recursion
polymorphism
polymorphisms
polynomial calculus
Predicate transformer
presheaf semantics
probabilistic program
probabilistic semantics
probability
Probability Theory
probablistic systems
Process calculi
Proof Complexity
Proof theory
proof-search
Proximity lattices
Q
Quantified Conjunctive Query Containment
Quantified CTL
quantiles
Quantitative Algebras
quantitative games
Quantitative systems
Quasi-isometry
query evaluation over fully dynamic databases
query language
quotient type
R
Randomized Cryptographic protocols
ranking function
ranking supermartingale
rational numbers
reachability
Reactive synthesis
real projective space
realizability
Recursion
Recursive Types
Reduction Semantics
register automata
Regret minimization
regular expressions
regular graph patterns
relational parametricity
Relators
resouce calculus
S
Satisfiability Problem
Schaefer's framework
schema mappings
Scott continuous
SDP
Secrecy
Semantics
semidefinite programming
semilattice
Separation problem
sequent calculus
simulation preorder
size-change termination theorem
stack model
Static analysis
stochastic games
Stone duality
strategies
Strategy Logic
strategy tree
stream
string diagrams
Strong Consistency
strong determinacy
Strong Normalisation
Structural Operational Semantics
subword ordering
successor-invariant logics
summation in Abelian semigroups
Sweeping transducers
Symbolic Dynamics
T
Taylor expansion
the regular separability problem
Ties of functions
Timed automata
timed pushdown automata
token machines
tractability
Tradeoffs
transition systems
Tree automata
Treewidth
Two-way transducers
Typability
Type inference
type system
type theory
U
Ultra-filter
uniform continuity
univalence axiom
Universal Algebra
universal solutions
V
validity
Variety theorems
vector addition systems
vector addition systems with states
verification
W
weak normalizibility
weak ω-category
Weighted Automata
Weighted logics
Weisfeiler-Leman algorithm
Well-structured transition systems
Word transductions
wp-calculus