Covers inductive propositions in Coq, focusing on evaluation rules for arithmetic expressions and their applications in defining partial and non-deterministic functions.
Explores the practical application of language theory, including quicksort, gradual typing, and efficient memory management, as well as the challenges of reduction program synthesis.