It will guide you through the first steps of isabelle programming, and also explain “tricks of the trade”. We also hope the tutorial will encourage students and researchers to play with isabelle and implement … During proofs they must not be instantiated. Lemma x + 0 = 0 + x convention: Lemma must be true for all x.

Understanding the Context

Isabelle has free (x), bound (x), and schematic (?x) variables. Only schematic variables can be … Specific language elements introduced by isabelle/hol are described in part iii. Although the main language elements are already provided by the isabelle/pure framework, examples given in the … The isabelle/isar implementation manual describes isabelle implementation from a high-level perspective, documenting the major underlying concepts and in-terfaces. Isabelle provides many operations (as ml functions) that involve theorems, and some that involve theories.

Key Insights

Chapters 4 and 5 present examples of theory construction.