Preface
Functional Programming in Coq (Basics)
Proof by Induction (Induction)
Working with Structured Data (Lists)
Polymorphism and Higher-Order Functions (Poly)
More Basic Tactics (Tactics)
- Overview
- The apply Tactic
- The apply ... with ... Tactic
- The injection and discriminate Tactics
- Using Tactics on Hypotheses
- Varying the Induction Hypothesis
- Unfolding Definitions
- Using destruct on Compound Expressions
- Review
- Levenshtein's edit distance
- Levenshtein edit distance: computing only the cost
- Additional Exercises