• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
      • Gl
        • Term-level-reasoning
        • Glmc
        • Other-resources
        • Optimization
        • Reference
        • Debugging
        • Basic-tutorial
          • 7. Proving Coverage
          • 4. Proving Theorems by Symbolic Execution
          • 2. Symbolic Objects
          • 5. Using def-gl-thm
          • 6. Writing :g-bindings forms
          • 3. Computing with Symbolic Objects
          • 1. An Example GL Proof
          • 8. Exercises
      • Witness-cp
      • Ccg
      • Install-not-normalized
      • Rewrite$
      • Removable-runes
      • Efficiency
      • Rewrite-bounds
      • Bash
      • Def-dag-measure
      • Fgl
      • Bdd
      • Remove-hyps
      • Contextual-rewriting
      • Simp
      • Rewrite$-hyps
      • Bash-term-to-dnf
      • Use-trivial-ancestors-check
      • Minimal-runes
      • Clause-processor-tools
      • Fn-is-body
      • Without-subsumption
      • Rewrite-equiv-hint
      • Def-bounds
      • Rewrite$-context
      • Try-gl-concls
      • Hint-utils
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Testing-utilities
    • Math
  • Gl

Basic-tutorial

An introductory guide, recommended for new users of gl.

This is a tutorial introduction to using GL to prove ACL2 theorems. We recommend going through the entire tutorial before beginning to use GL.

You can think of this tutorial as a quick-start guide. By the time you're done with it, you should have a good understanding of how GL works, and be able to use GL to easily prove many theorems.

We don't try to cover more advanced topics, like optimization and term-level-reasoning. You'll probably want to get some practice using GL before exploring these topics.

Subtopics

7. Proving Coverage
4. Proving Theorems by Symbolic Execution
2. Symbolic Objects
5. Using def-gl-thm
6. Writing :g-bindings forms
3. Computing with Symbolic Objects
1. An Example GL Proof
8. Exercises