• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
      • Theories
        • Rune
        • In-theory
        • Disable
        • Enable
          • Theories-and-primitives
          • Deftheory
          • Theory-functions
            • Disable
            • Enable
              • Current-theory
              • Syntactically-clean-lambda-objects-theory
              • Hands-off-lambda-objects-theory
              • Rewrite-lambda-objects-theory
              • Theory
              • Universal-theory
              • E/d
              • Executable-counterpart-theory
              • Function-theory
              • Set-difference-theories
              • Minimal-theory
              • Ground-zero
              • Union-theories
              • Intersection-theories
            • Deftheory-static
            • Current-theory
            • Syntactically-clean-lambda-objects-theory
            • Hands-off-lambda-objects-theory
            • Rewrite-lambda-objects-theory
            • Rulesets
            • Theory
            • Disabledp
            • Universal-theory
            • Using-enabled-rules
            • E/d
            • Active-runep
            • Executable-counterpart-theory
            • Function-theory
            • Set-difference-theories
            • Minimal-theory
            • Ground-zero
            • Union-theories
            • Intersection-theories
            • Incompatible
            • Defthy
            • Incompatible!
            • Active-or-non-runep
            • Rule-names
          • Rule-classes
          • Proof-builder
          • Recursion-and-induction
          • Hons-and-memoization
          • Events
          • Parallelism
          • History
          • Programming
          • Operational-semantics
          • Real
          • Start-here
          • Debugging
          • Miscellaneous
          • Output-controls
          • Macros
          • Interfacing-tools
        • Interfacing-tools
        • Hardware-verification
        • Software-verification
        • Math
        • Testing-utilities
      • Theories
      • Theory-functions

      Enable

      Adds names to current theory

      Example:
      (enable fact (:e fact) associativity-of-app)
      
      General Form:
      (enable name1 name2 ... namek)

      where each namei is a runic designator; see theories. The result is the theory that contains all the names in the current theory plus those listed. Note that this is merely a function that returns a theory. The result is generally a very long list of runes and you will probably regret printing it.

      For related utilities, see disable and see e/d.

      The standard way to ``enable'' a fixed set of names, is as follows; see hints and see in-theory.

      :in-theory (enable name1 name2 ... namek)  ; in a hint
      (in-theory (enable name1 name2 ... namek)) ; as an event
      (local ; often desirable, to avoid exporting from the current context
       (in-theory (enable name1 name2 ... namek)))

      Note that all the names are implicitly quoted. If you wish to enable a computed list of names, lst, use the theory expression (union-theories (current-theory :here) lst).