From The Twelf Project
(Redirected from Tutorial)
- If you are not already familiar with Twelf, you should read the introductions to Twelf before reading the tutorials on this page. See the documentation page for other resources.
Types of tutorials:
- Proof techniques: learn helpful and common Twelf devices.
- Troubleshooting: learn how to diagnose and fix Twelf errors.
Feel free to write new tutorials and add them to this page.
These tutorials are also gathered in the tutorial category.
- Reformulating languages to use hypothetical judgements - how to present judgements in a way that's easy to encode in LF.
- Holes in metatheorems - how to assume lemmas while developing proofs.
- Equality - how to represent equality of LF terms as a type family.
- Respects lemmas - how to prove that other families and constants respect equality and other relations.
- Uniqueness lemmas - how to prove that the inputs to a relation determine an output uniquely.
- Effectiveness lemmas - how to prove totality assertions explicitly.
- Output factoring - how to reason from a disjunction. Illustrates proving the progress theorem for a programming language.
- Reasoning from false - how to do proofs by contradiction.
- Catch-all cases - how to avoid putting a theorem case in the LF context.
- Mutual induction - how to prove mutually inductive theorems
- Converting between implicit and explicit parameters - how to convert between implicit and explicit quantification of the parameters of a type family.
- Strengthening - how to convince Twelf that a term does not depend on some assumptions.
- Explicit termination metrics - how to use a termination metric other than the subderivation ordering.
- Simplifying dynamic clauses - how to streamline certain proofs about relations that introduce hypotheses.
- Canonical forms lemma for a progress theorem - how to get this lemma for free when you can, and how to prove it explicitly using equality when you can't.
- Structural properties of a hypothetical judgement - how to get structural properties for free when you can, and how to prove them explicitly when you can't.
- Evaluation contexts - how to represent evaluation contexts as LF functions
- User-defined constraint domains - how to make encodings more intrinsic by replacing predicates with indexing, and how to use Church-encodings to create special index types that are similar to constraint domains in that they admit non-trivial equations on their elements.
For larger examples of Twelf in action, see see the case studies.
- Error messages - brief explanations of (and remedies for) common Twelf error messages.
- Understanding output freeness - understanding a subtle part of output coverage checking.
- Debugging coverage errors - techniques for finding coverage errors.
- Constraint domains and coverage checking - in general, you can't use them in the same signature.