Normal form (abstract rewriting)

Formal sciences
Theoretical computer science
Programming language theory
Type theory

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (11)

Termination Analysis using Dependency Pairs

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

Value Definitions and Conditionals

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

Functions and state

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

Lambda Calculus and Type Safety: An Overview

Provides an overview of lambda calculus, type safety, and type inference in programming languages.

Lambda Calculus: Syntax and Abstractions

Introduces terms, abstractions, applications, and values in the lambda calculus.

Logical Formulas and Types: Understanding the Kerry Howard Isomorphism

Explores the Kerry Howard Isomorphism, translating logical propositions into types and terms, with a focus on proof by induction and exam preparation.

Designing Calculi: Strong Normalization and Error Handling

Covers strong normalization, error handling, and typing rules for Calculi design.

Semantics in Computer Language Processing: Understanding Meaning

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

Kernel Methods: Representer Theorem & ERM

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

Dataflow Analysis: Optimization

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

Scattering Theory: Quantum Mechanics

Explores scattering theory in quantum mechanics, including tunneling phenomena and differential cross-section concepts.

Page 1 of 1