This module contains the implementation of the reflection monad, used by all other components of this directory.

@[instance_reducible]

instance Lean.Meta.Tactic.BVDecide.instToExprBVBinOp : ToExpr Std.Tactic.BVDecide.BVBinOp

@[instance_reducible]

instance Lean.Meta.Tactic.BVDecide.instToExprBVUnOp : ToExpr Std.Tactic.BVDecide.BVUnOp

@[instance_reducible]

instance Lean.Meta.Tactic.BVDecide.instToExprBVExpr {w : Nat} : ToExpr (Std.Tactic.BVDecide.BVExpr w)

def Lean.Meta.Tactic.BVDecide.instToExprBVExpr.go {w : Nat} : Std.Tactic.BVDecide.BVExpr w → Expr

@[instance_reducible]

instance Lean.Meta.Tactic.BVDecide.instToExprBVBinPred : ToExpr Std.Tactic.BVDecide.BVBinPred

@[instance_reducible]

instance Lean.Meta.Tactic.BVDecide.instToExprGate : ToExpr Std.Tactic.BVDecide.Gate

@[instance_reducible]

instance Lean.Meta.Tactic.BVDecide.instToExprBVPred : ToExpr Std.Tactic.BVDecide.BVPred

def Lean.Meta.Tactic.BVDecide.instToExprBVPred.go : Std.Tactic.BVDecide.BVPred → Expr

@[instance_reducible]

instance Lean.Meta.Tactic.BVDecide.instToExprBoolExpr {α : Type} [ToExpr α] : ToExpr (Std.Tactic.BVDecide.BoolExpr α)

def Lean.Meta.Tactic.BVDecide.instToExprBoolExpr.go {α : Type} [ToExpr α] : Std.Tactic.BVDecide.BoolExpr α → Expr

structure Lean.Meta.Tactic.BVDecide.Atom : Type

A BitVec atom.

• width : Nat

  The width of the BitVec that is being abstracted.

• atomNumber : Nat

  A unique numeric identifier for the atom.

• synthetic : Bool

  Whether the atom is synthetic. The effect of this is that values for this atom are not considered for the counter example derivation. This is for example useful when we introduce an atom over an expression, together with additional lemmas that fully describe the behavior of the atom.

structure Lean.Meta.Tactic.BVDecide.Context : Type

• hypotheses : Array Normalize.Hyp

structure Lean.Meta.Tactic.BVDecide.State : Type

The state of the reflection monad

• atoms : Std.HashMap Sym.ExprPtr Atom

  The atoms encountered so far. Saved as a map from BitVec expressions to a (width, atomNumber) pair.

• atomsAssignmentCache : Option Expr

  A cache for atomsAssignment. If it is none the cache is currently invalidated as new atoms have been added since it was last updated, if it is some it must be consistent with the atoms contained in atoms.

• evalsAtCache : Std.HashMap Sym.ExprPtr (Option Expr)

  Cached calls to evalsAtAtoms of various reflection structures. Whenever atoms is modified this cache is invalidated as evalsAtAtoms relies on atoms.

@[reducible, inline]

abbrev Lean.Meta.Tactic.BVDecide.M (α : Type) : Type

The reflection monad, used to track BitVec variables that we see as we traverse the context.

structure Lean.Meta.Tactic.BVDecide.ReifiedBVExpr : Type

A reified version of an Expr representing a BVExpr.

• width : Nat
• bvExpr : Std.Tactic.BVDecide.BVExpr self.width

  The reified expression.

• originalExpr : Expr

  The expression that was reflected, used for caching of evalsAtAtoms.

• evalsAtAtoms' : M (Option Expr)

  A proof that bvExpr.eval atomsAssignment = originalExpr, none if it holds by rfl.

• expr : Expr

  A cache for toExpr bvExpr.

def Lean.Meta.Tactic.BVDecide.ReifiedBVExpr.evalsAtAtoms (reified : ReifiedBVExpr) : M (Option Expr)

structure Lean.Meta.Tactic.BVDecide.ReifiedBVPred : Type

A reified version of an Expr representing a BVPred.

• bvPred : Std.Tactic.BVDecide.BVPred

  The reified expression.

• originalExpr : Expr

  The expression that was reflected, usef for caching of evalsAtAtoms.

• evalsAtAtoms' : M (Option Expr)

  A proof that bvPred.eval atomsAssignment = originalExpr, none if it holds by rfl.

• expr : Expr

  A cache for toExpr bvPred

def Lean.Meta.Tactic.BVDecide.ReifiedBVPred.evalsAtAtoms (reified : ReifiedBVPred) : M (Option Expr)

structure Lean.Meta.Tactic.BVDecide.ReifiedBVLogical : Type

A reified version of an Expr representing a BVLogicalExpr.

• bvExpr : Std.Tactic.BVDecide.BVLogicalExpr

  The reified expression.

• originalExpr : Expr

  The expression that was reflected, usef for caching of evalsAtAtoms.

• evalsAtAtoms' : M (Option Expr)

  A proof that bvExpr.eval atomsAssignment = originalExpr, none if it holds by rfl.

• expr : Expr

  A cache for toExpr bvExpr

def Lean.Meta.Tactic.BVDecide.ReifiedBVLogical.evalsAtAtoms (reified : ReifiedBVLogical) : M (Option Expr)

structure Lean.Meta.Tactic.BVDecide.SatAtBVLogical : Type

A reified version of an Expr representing a BVLogicalExpr that we know to be true.

• bvExpr : Std.Tactic.BVDecide.BVLogicalExpr

  The reified expression.

• satAtAtoms : M Expr

  A proof that bvExpr.eval atomsAssignment = true.

• expr : Expr

  A cache for toExpr bvExpr

def Lean.Meta.Tactic.BVDecide.M.run {α : Type} (m : M α) (hypotheses : Array Normalize.Hyp) : Sym.SymM α

Run a reflection computation as a SymM one.

def Lean.Meta.Tactic.BVDecide.M.atoms : M (Array (Nat × Expr))

Retrieve the atoms as pairs of their width and expression.

def Lean.Meta.Tactic.BVDecide.M.atomsAssignment : M Expr

Retrieve a BitVec.Assignment representing the atoms we found so far.

def Lean.Meta.Tactic.BVDecide.M.lookup (e : Expr) (width : Nat) (synthetic : Bool) : M Nat

Look up an expression in the atoms, recording it if it has not previously appeared.

@[specialize #[]]

def Lean.Meta.Tactic.BVDecide.M.simplifyBinaryProof' (mkFRefl : Expr → Expr) (fst : Expr) (fproof : Option Expr) (mkSRefl : Expr → Expr) (snd : Expr) (sproof : Option Expr) : Option (Expr × Expr)

@[specialize #[]]

def Lean.Meta.Tactic.BVDecide.M.simplifyBinaryProof (mkRefl : Expr → Expr) (fst : Expr) (fproof : Option Expr) (snd : Expr) (sproof : Option Expr) : Option (Expr × Expr)

@[specialize #[]]

def Lean.Meta.Tactic.BVDecide.M.simplifyTernaryProof (mkRefl : Expr → Expr) (fst : Expr) (fproof : Option Expr) (snd : Expr) (sproof : Option Expr) (thd : Expr) (tproof : Option Expr) : Option (Expr × Expr × Expr)

@[inline]

def Lean.Meta.Tactic.BVDecide.M.getHyps : M (Array Normalize.Hyp)

structure Lean.Meta.Tactic.BVDecide.LemmaState : Type

The state of the lemma reflection monad.

• lemmas : Array SatAtBVLogical

  The list of top level lemmas that got created on the fly during reflection.

• bvExprCache : Std.HashMap Sym.ExprPtr (Option ReifiedBVExpr)

  Cache for reification of BVExpr.

• bvPredCache : Std.HashMap Sym.ExprPtr (Option ReifiedBVPred)

  Cache for reification of BVPred.

• bvLogicalCache : Std.HashMap Sym.ExprPtr (Option ReifiedBVLogical)

  Cache for reification of BVLogicalExpr.

@[reducible, inline]

abbrev Lean.Meta.Tactic.BVDecide.LemmaM (α : Type) : Type

The lemma reflection monad. It extends the usual reflection monad M by adding the ability to add additional top level lemmas on the fly.

def Lean.Meta.Tactic.BVDecide.LemmaM.run {α : Type} (m : LemmaM α) (state : LemmaState := { }) : M (α × Array SatAtBVLogical)

def Lean.Meta.Tactic.BVDecide.LemmaM.addLemma (lemma : SatAtBVLogical) : LemmaM Unit

Add another top level lemma.

@[specialize #[]]

def Lean.Meta.Tactic.BVDecide.LemmaM.withBVExprCache (e : Expr) (f : Expr → LemmaM (Option ReifiedBVExpr)) : LemmaM (Option ReifiedBVExpr)

@[specialize #[]]

def Lean.Meta.Tactic.BVDecide.LemmaM.withBVPredCache (e : Expr) (f : Expr → LemmaM (Option ReifiedBVPred)) : LemmaM (Option ReifiedBVPred)

@[specialize #[]]

def Lean.Meta.Tactic.BVDecide.LemmaM.withBVLogicalCache (e : Expr) (f : Expr → LemmaM (Option ReifiedBVLogical)) : LemmaM (Option ReifiedBVLogical)