Lean.Meta.DiscrTreeTypes

See file DiscrTree.lean for the actual implementation and documentation.

source

inductive Lean.Meta.DiscrTree.Key :

Type

Discrimination tree key. See DiscrTree

const : Name → Nat → Key
fvar : FVarId → Nat → Key
lit : Literal → Key
star : Key
other : Key
arrow : Key
proj : Name → Nat → Nat → Key

Instances For

source

instance Lean.Meta.DiscrTree.instInhabitedKey :

Inhabited Key

Equations

Lean.Meta.DiscrTree.instInhabitedKey = { default := Lean.Meta.DiscrTree.Key.const default default }

source

instance Lean.Meta.DiscrTree.instBEqKey :

BEq Key

Equations

Lean.Meta.DiscrTree.instBEqKey = { beq := Lean.Meta.DiscrTree.beqKey✝ }

source

instance Lean.Meta.DiscrTree.instReprKey :

Repr Key

Equations

Lean.Meta.DiscrTree.instReprKey = { reprPrec := Lean.Meta.DiscrTree.reprKey✝ }

source

def Lean.Meta.DiscrTree.Key.hash :

Key → UInt64

Equations

(Lean.Meta.DiscrTree.Key.const a a_1).hash = mixHash 5237 (mixHash (hash a) (hash a_1))
(Lean.Meta.DiscrTree.Key.fvar a a_1).hash = mixHash 3541 (mixHash (hash a) (hash a_1))
(Lean.Meta.DiscrTree.Key.lit a).hash = mixHash 1879 (hash a)
Lean.Meta.DiscrTree.Key.star.hash = 7883
Lean.Meta.DiscrTree.Key.other.hash = 2411
Lean.Meta.DiscrTree.Key.arrow.hash = 17
(Lean.Meta.DiscrTree.Key.proj a a_1 a_2).hash = mixHash (hash a_2) (mixHash (hash a) (hash a_1))

source

instance Lean.Meta.DiscrTree.instHashableKey :

Hashable Key

Equations

Lean.Meta.DiscrTree.instHashableKey = { hash := Lean.Meta.DiscrTree.Key.hash }

source

instance Lean.Meta.DiscrTree.instToExprKey :

ToExpr Key

Equations

One or more equations did not get rendered due to their size.

source

inductive Lean.Meta.DiscrTree.Trie (α : Type) :

Type

Discrimination tree trie. See DiscrTree.

node {α : Type} (vs : Array α) (children : Array (Key × Trie α)) : Trie α

Instances For

Notes regarding term reduction at the DiscrTree module.

In simp, we want to have simp theorem such as

@[simp] theorem liftOn_mk (a : α) (f : α → γ) (h : ∀ a₁ a₂, r a₁ a₂ → f a₁ = f a₂) :
    Quot.liftOn (Quot.mk r a) f h = f a := rfl

If we enable iota, then the lhs is reduced to f a. Note that when retrieving terms, we may also disable beta and zeta reduction. See issue https://github.com/leanprover/lean4/issues/2669

During type class resolution, we often want to reduce types using even iota and projection reduction. Example:

inductive Ty where
  | int
  | bool

@[reducible] def Ty.interp (ty : Ty) : Type :=
  Ty.casesOn (motive := fun _ => Type) ty Int Bool

def test {a b c : Ty} (f : a.interp → b.interp → c.interp) (x : a.interp) (y : b.interp) : c.interp :=
  f x y

def f (a b : Ty.bool.interp) : Ty.bool.interp :=
  -- We want to synthesize `BEq Ty.bool.interp` here, and it will fail
  -- if we do not reduce `Ty.bool.interp` to `Bool`.
  test (.==.) a b

source

structure Lean.Meta.DiscrTree (α : Type) :

Type

Discrimination trees. It is an index from terms to values of type α.

root : PersistentHashMap Key (Trie α)

Instances For