Lectures related to Confluence (abstract rewriting)

Explores automated termination analysis using dependency pairs, covering classical and modern techniques, annual competitions, and tools like AProVE.

Covers entropy, its definition, and its implications in thermodynamics.

Covers conditional and Boolean expressions, rewrite rules, and value definitions.

Covers the semantics of programming languages, focusing on the Add language and the role of rewriting rules and CK machines in understanding meaning.

Explores functions, state, rewriting, and stateful objects in programming.

Explores the application of the representer theorem in kernel methods and its implications in regularized ERM.

Explores dataflow analysis for optimization, including equations solving, live variables, reaching definitions, and very busy expressions.