TALK KEYWORD INDEX

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

A | |

abstract interpretation | |

abstract machine | |

accumulation | |

Admissible strategies | |

Algebraic effect | |

Algebraic effects | |

Algorithmic randomness | |

algorithms | |

Atomic flows | |

Automata | |

automata theory | |

automatic sequences | |

auxiliary relations | |

axiomatization | |

B | |

bimodule | |

bisimulation | |

bisimulation invariance | |

bisimulation up-to | |

Blum-Shub-Smale | |

Boehm tree | |

Borel determinancy | |

Borel measurable payoffs | |

Bounded Polymorphism | |

bounded quantifier alternation | |

Boundedness problem | |

Brownian motion | |

Buchi automata | |

C | |

Calculus of structures | |

Categorical semantics | |

category theory | |

CCS | |

characterisation theorem | |

classical logic | |

Classical realizability | |

Clique-Width | |

coalgebra | |

Coercion | |

coinductive predicates | |

communicating automata | |

commutative context-free grammars | |

complexity | |

complexity of evaluation | |

compositionality | |

computability | |

Computational Complexity | |

computational logic | |

Computational Models | |

concurrency | |

Concurrent systems | |

conjunctive query evaluation | |

constraint logic | |

Constraint satisfaction problems | |

Constructive temporal logic | |

context semantics | |

contextual equivalence | |

continuations | |

continuous payoffs | |

Control | |

Conversion | |

Corecursion | |

correctness criterion | |

cost automata | |

Cost Models | |

cost monadic second-order logic | |

counting quantifiers | |

cut elimination | |

D | |

data trees | |

database theory | |

deadlock | |

decidability | |

decomposition theorems | |

Deep inference | |

degree sequences | |

delay | |

delimited control operators | |

denotational semantics | |

dependent types | |

Descriptive complexity theory | |

deterministic transitive closure | |

Dialectica translation | |

Direct style | |

disjoint unions | |

distance metrics | |

DNF duality | |

domain theory | |

domains | |

E | |

effect system | |

Ehrenfeucht-Fraïssé games | |

elementary algorithms | |

Energy games | |

Entropy of formal languages | |

enumeration | |

Equality | |

equivalence | |

equivalence relation | |

Event structures | |

Explicit Substitutions | |

expressive completeness | |

expressive power | |

F | |

fast-growing complexity | |

Feferman-Vaught | |

fibrations | |

filter-model | |

finite automata | |

Finite model theory | |

first order logic | |

first order logic with majority quantifiers | |

first-order logic | |

First-Order Logic Model Checking | |

first-order model checking | |

fixed-parameter complexity | |

Fixpoints | |

focalisation | |

Formal verification | |

formalized mathematics | |

formulae-as-types | |

full abstraction | |

Function combinators | |

Functional reactive programming | |

G | |

Gale-Stewart games | |

Game Semantics | |

Games | |

Games on graphs | |

Geometry of Interaction | |

graph algorithms | |

graph rewriting | |

graph theory | |

Ground Tree Rewrite Systems | |

GSOS | |

guarded logics | |

Guarded recursion | |

H | |

Hanf-locality | |

higher-order model checking | |

higher-order pi-calculus | |

Higher-order programs | |

Hoare logic | |

homomorphism preservation in the finite | |

homomorphisms | |

homotopy | |

homotopy type theory | |

Hyper-Ackermannian complexity | |

hypergraph duality | |

Hypergraph transversals | |

Hyprgraphs | |

I | |

implicit computational complexity | |

incremental evaluation | |

Induction | |

inductive predicates | |

Infinite connected graph of bounded degree | |

Infinite tree | |

Interaction nets | |

Interpolation | |

intersection types | |

intuitionistic logic | |

J | |

Janin-Walukiewicz theorem | |

K | |

Kleene algebra | |

Kleene algebra with tests | |

L | |

labelled Markov Chains | |

lambda calculus | |

lambda-calculus | |

limited nondeterminism | |

linear logic | |

linear pi-calculus | |

Linear Temporal Logic | |

Liveness | |

locality | |

Lock-freedom | |

logic of infinite sequences | |

Logic over graphs | |

logical analysis of algorithms | |

Logical aspects of computational complexity | |

Logics for AI | |

logics for graphs | |

Los-Tarski | |

LTL | |

LTL Separation | |

M | |

Markov Chain | |

Markov chains | |

Martin Lof randomness | |

Martin Lof test | |

matrix multiplication | |

MDP | |

mean-payoff and discounted sum | |

mean-payoff games | |

Measure | |

message sequence charts | |

Modal and temporal logics | |

modal logic | |

modal µ-calculus | |

model checking | |

model counting | |

modulo counting quantifiers | |

Monadic metalanguages | |

monadic program schemes | |

monadic recursion schemes | |

monadic second-order logic | |

Monads | |

monitor | |

Monoid | |

Monotone proofs | |

morphic words | |

MSO | |

MSO-automata | |

mu-calculus | |

Muller games | |

Multi-counter automata | |

Multi-Stack Pushdown Systems | |

multidimensional quantitative games | |

multiplicative linear logic | |

mutable state | |

N | |

Nash equilibria | |

Nash equilibrium | |

Nested words | |

nominal automata | |

Noninterleaving semantics | |

Normalisation | |

O | |

Omega-automata | |

Ontology-based data access | |

operational semantics | |

P | |

parameterized communication topology | |

parameterized complexity | |

parity games | |

Partially Ordered Sets | |

passivation | |

patterns | |

PCTL | |

Pebble walking automata | |

periodically iterated morphisms | |

pigeonhole principle | |

polarisation | |

polymorphism | |

PosSLP | |

Presburger arithmetic | |

preservation | |

preservation theorems | |

presheaf | |

Privacy & Information Flow | |

probabilistic systems | |

probability | |

Program Logic | |

program schematology | |

program transformation | |

proof complexity | |

proof equivalence problem | |

proof nets | |

proof theory | |

proof-nets | |

pure lambda-calculus | |

pushdown automata | |

Pushdown Systems | |

Q | |

Quantitative analysis | |

Quantitative Model-Checking | |

quantitative objectives | |

quantitative synthesis | |

quantum computation | |

R | |

rational relations | |

reachability | |

Real Turing Machine | |

reconfiguration problem | |

refinement | |

Regular cost functions | |

regular expressions | |

Regular Languages of Infinite Words | |

Regular Languages of Words | |

regular path queries | |

Retyping functions | |

rewards | |

Rewrite Systems | |

Rewriting | |

robust quantitative objectives | |

S | |

Safety | |

satisfiability | |

Satisfiability Modulo Theories | |

Scope-Bounding | |

second-order logic | |

secure equilibria | |

semantics | |

semialgebraic | |

Semigroups | |

Semilattice Polymorphisms | |

separation | |

separation logic | |

session types | |

Sets with atoms | |

shuffle | |

similarity | |

simulation | |

stochastic processes | |

strategies | |

String transducers | |

Strong Embedding | |

structures of bounded degree | |

subgame perfect | |

substitution | |

subtyping | |

subword complexity | |

Symmetry | |

synthesis | |

System F | |

T | |

TC_0 | |

temporal logic | |

Term | |

termination | |

token machines | |

transition system | |

Transitive closure | |

trees | |

treewidth | |

Turing machines | |

two-dimensional partial map | |

two-player games on weighted graphs | |

two-variable logic | |

two-variable logics | |

two-way automata | |

Type | |

Type and effect system | |

Type containment | |

type isomorphism | |

Type systems | |

type theory | |

U | |

ultimately-periodic sets | |

Unification | |

Universal algebra | |

up-to techniques | |

V | |

vector addition systems | |

verification | |

W | |

weak EXP hierarchy | |

weak monadic second-order | |

Weighted first-order logic | |

weights | |

Well-structured pushdown systems | |

Wiener measure | |

WMSO | |

word equations | |

X | |

XML and graph data |