Explores model interpretation, compilation via partial evaluation, function calls, and the transition to partial evaluation, emphasizing the importance of model interpreters in supporting modeling languages.
Introduces formal verification and its advantages over traditional testing methods, discussing automated theorem proving and compiling correctness statements into verification conditions.
Covers inductive propositions in Coq, focusing on evaluation rules for arithmetic expressions and their applications in defining partial and non-deterministic functions.
