I made a few choices so far that can probably be discussed: - got rid of `modn` on `UInt`, nobody seems to use it apart from the definition of `shift` which can use normal `mod` - removed the previous defeq optimized definition of `USize.size` in favor for a normal one. The motivation was to allow `OfNat` to work which doesn't seem to be necessary anymore afaict. - Minimized uses of `.val`, should we maybe mark it deprecated? - Mostly got rid of `.val` in basically all theorems as the proper next level of API would now be `.toBitVec`. We could probably re-prove them but it would be more annoying given the change of definition. - Did not yet redefine `log2` in terms of `BitVec` as this would require a `log2` in `BitVec` as well, do we want this? - I added a couple of theorems around the relation of `<` on `UInt` and `Nat`. These were previously not needed because defeq was used all over the place to save us. I did not yet generalize these to all types as I wasn't sure if they are the appropriate lemma that we want to have.
194 lines
6.3 KiB
Text
194 lines
6.3 KiB
Text
/-
|
||
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
|
||
Released under Apache 2.0 license as described in the file LICENSE.
|
||
Authors: Leonardo de Moura
|
||
-/
|
||
prelude
|
||
import Lean.Expr
|
||
import Init.Data.BitVec.Basic
|
||
universe u
|
||
|
||
namespace Lean
|
||
|
||
/--
|
||
We use the `ToExpr` type class to convert values of type `α` into
|
||
expressions that denote these values in Lean.
|
||
Example:
|
||
```
|
||
toExpr true = .const ``Bool.true []
|
||
```
|
||
-/
|
||
class ToExpr (α : Type u) where
|
||
/-- Convert a value `a : α` into an expression that denotes `a` -/
|
||
toExpr : α → Expr
|
||
/-- Expression representing the type `α` -/
|
||
toTypeExpr : Expr
|
||
|
||
export ToExpr (toExpr toTypeExpr)
|
||
|
||
instance : ToExpr Nat where
|
||
toExpr := mkNatLit
|
||
toTypeExpr := mkConst ``Nat
|
||
|
||
instance : ToExpr Int where
|
||
toTypeExpr := .const ``Int []
|
||
toExpr i := if 0 ≤ i then
|
||
mkNat i.toNat
|
||
else
|
||
mkApp3 (.const ``Neg.neg [0]) (.const ``Int []) (.const ``Int.instNegInt [])
|
||
(mkNat (-i).toNat)
|
||
where
|
||
mkNat (n : Nat) : Expr :=
|
||
let r := mkRawNatLit n
|
||
mkApp3 (.const ``OfNat.ofNat [0]) (.const ``Int []) r
|
||
(.app (.const ``instOfNat []) r)
|
||
|
||
instance : ToExpr (Fin n) where
|
||
toTypeExpr := .app (mkConst ``Fin) (toExpr n)
|
||
toExpr a :=
|
||
let r := mkRawNatLit a.val
|
||
mkApp3 (.const ``OfNat.ofNat [0]) (.app (mkConst ``Fin) (toExpr n)) r
|
||
(mkApp3 (.const ``Fin.instOfNat []) (toExpr n)
|
||
(.app (.const ``Nat.instNeZeroSucc []) (mkNatLit (n-1))) r)
|
||
|
||
instance : ToExpr (BitVec n) where
|
||
toTypeExpr := .app (mkConst ``BitVec) (toExpr n)
|
||
-- Remark: We use ``BitVec.ofNat to represent bitvector literals
|
||
toExpr a := mkApp2 (.const ``BitVec.ofNat []) (toExpr n) (toExpr a.toNat)
|
||
|
||
instance : ToExpr UInt8 where
|
||
toTypeExpr := mkConst ``UInt8
|
||
toExpr a :=
|
||
let r := mkRawNatLit a.toNat
|
||
mkApp3 (.const ``OfNat.ofNat [0]) (mkConst ``UInt8) r
|
||
(.app (.const ``UInt8.instOfNat []) r)
|
||
|
||
instance : ToExpr UInt16 where
|
||
toTypeExpr := mkConst ``UInt16
|
||
toExpr a :=
|
||
let r := mkRawNatLit a.toNat
|
||
mkApp3 (.const ``OfNat.ofNat [0]) (mkConst ``UInt16) r
|
||
(.app (.const ``UInt16.instOfNat []) r)
|
||
|
||
instance : ToExpr UInt32 where
|
||
toTypeExpr := mkConst ``UInt32
|
||
toExpr a :=
|
||
let r := mkRawNatLit a.toNat
|
||
mkApp3 (.const ``OfNat.ofNat [0]) (mkConst ``UInt32) r
|
||
(.app (.const ``UInt32.instOfNat []) r)
|
||
|
||
instance : ToExpr UInt64 where
|
||
toTypeExpr := mkConst ``UInt64
|
||
toExpr a :=
|
||
let r := mkRawNatLit a.toNat
|
||
mkApp3 (.const ``OfNat.ofNat [0]) (mkConst ``UInt64) r
|
||
(.app (.const ``UInt64.instOfNat []) r)
|
||
|
||
instance : ToExpr USize where
|
||
toTypeExpr := mkConst ``USize
|
||
toExpr a :=
|
||
let r := mkRawNatLit a.toNat
|
||
mkApp3 (.const ``OfNat.ofNat [0]) (mkConst ``USize) r
|
||
(.app (.const ``USize.instOfNat []) r)
|
||
|
||
instance : ToExpr Bool where
|
||
toExpr := fun b => if b then mkConst ``Bool.true else mkConst ``Bool.false
|
||
toTypeExpr := mkConst ``Bool
|
||
|
||
instance : ToExpr Char where
|
||
toExpr := fun c => mkApp (mkConst ``Char.ofNat) (mkRawNatLit c.toNat)
|
||
toTypeExpr := mkConst ``Char
|
||
|
||
instance : ToExpr String where
|
||
toExpr := mkStrLit
|
||
toTypeExpr := mkConst ``String
|
||
|
||
instance : ToExpr Unit where
|
||
toExpr := fun _ => mkConst `Unit.unit
|
||
toTypeExpr := mkConst ``Unit
|
||
|
||
instance : ToExpr System.FilePath where
|
||
toExpr p := mkApp (mkConst ``System.FilePath.mk) (toExpr p.toString)
|
||
toTypeExpr := mkConst ``System.FilePath
|
||
|
||
private def Name.toExprAux (n : Name) : Expr :=
|
||
if isSimple n 0 then
|
||
mkStr n 0 #[]
|
||
else
|
||
go n
|
||
where
|
||
isSimple (n : Name) (sz : Nat) : Bool :=
|
||
match n with
|
||
| .anonymous => 0 < sz && sz <= 8
|
||
| .str p _ => isSimple p (sz+1)
|
||
| _ => false
|
||
|
||
mkStr (n : Name) (sz : Nat) (args : Array Expr) : Expr :=
|
||
match n with
|
||
| .anonymous => mkAppN (mkConst (.str ``Lean.Name ("mkStr" ++ toString sz))) args.reverse
|
||
| .str p s => mkStr p (sz+1) (args.push (toExpr s))
|
||
| _ => unreachable!
|
||
|
||
go : Name → Expr
|
||
| .anonymous => mkConst ``Lean.Name.anonymous
|
||
| .str p s ..=> mkApp2 (mkConst ``Lean.Name.str) (go p) (toExpr s)
|
||
| .num p n ..=> mkApp2 (mkConst ``Lean.Name.num) (go p) (toExpr n)
|
||
|
||
instance : ToExpr Name where
|
||
toExpr := Name.toExprAux
|
||
toTypeExpr := mkConst ``Name
|
||
|
||
instance [ToExpr α] : ToExpr (Option α) :=
|
||
let type := toTypeExpr α
|
||
{ toExpr := fun o => match o with
|
||
| none => mkApp (mkConst ``Option.none [levelZero]) type
|
||
| some a => mkApp2 (mkConst ``Option.some [levelZero]) type (toExpr a),
|
||
toTypeExpr := mkApp (mkConst ``Option [levelZero]) type }
|
||
|
||
private def List.toExprAux [ToExpr α] (nilFn : Expr) (consFn : Expr) : List α → Expr
|
||
| [] => nilFn
|
||
| a::as => mkApp2 consFn (toExpr a) (toExprAux nilFn consFn as)
|
||
|
||
instance [ToExpr α] : ToExpr (List α) :=
|
||
let type := toTypeExpr α
|
||
let nil := mkApp (mkConst ``List.nil [levelZero]) type
|
||
let cons := mkApp (mkConst ``List.cons [levelZero]) type
|
||
{ toExpr := List.toExprAux nil cons,
|
||
toTypeExpr := mkApp (mkConst ``List [levelZero]) type }
|
||
|
||
instance [ToExpr α] : ToExpr (Array α) :=
|
||
let type := toTypeExpr α
|
||
{ toExpr := fun as => mkApp2 (mkConst ``List.toArray [levelZero]) type (toExpr as.toList),
|
||
toTypeExpr := mkApp (mkConst ``Array [levelZero]) type }
|
||
|
||
instance [ToExpr α] [ToExpr β] : ToExpr (α × β) :=
|
||
let αType := toTypeExpr α
|
||
let βType := toTypeExpr β
|
||
{ toExpr := fun ⟨a, b⟩ => mkApp4 (mkConst ``Prod.mk [levelZero, levelZero]) αType βType (toExpr a) (toExpr b),
|
||
toTypeExpr := mkApp2 (mkConst ``Prod [levelZero, levelZero]) αType βType }
|
||
|
||
instance : ToExpr Literal where
|
||
toTypeExpr := mkConst ``Literal
|
||
toExpr l := match l with
|
||
| .natVal _ => mkApp (mkConst ``Literal.natVal) (.lit l)
|
||
| .strVal _ => mkApp (mkConst ``Literal.strVal) (.lit l)
|
||
|
||
instance : ToExpr FVarId where
|
||
toTypeExpr := mkConst ``FVarId
|
||
toExpr fvarId := mkApp (mkConst ``FVarId.mk) (toExpr fvarId.name)
|
||
|
||
instance : ToExpr Syntax.Preresolved where
|
||
toTypeExpr := .const ``Syntax.Preresolved []
|
||
toExpr
|
||
| .namespace ns => mkApp (.const ``Syntax.Preresolved.namespace []) (toExpr ns)
|
||
| .decl a ls => mkApp2 (.const ``Syntax.Preresolved.decl []) (toExpr a) (toExpr ls)
|
||
|
||
def Expr.toCtorIfLit : Expr → Expr
|
||
| .lit (.natVal v) =>
|
||
if v == 0 then mkConst ``Nat.zero
|
||
else mkApp (mkConst ``Nat.succ) (mkRawNatLit (v-1))
|
||
| .lit (.strVal v) =>
|
||
mkApp (mkConst ``String.mk) (toExpr v.toList)
|
||
| e => e
|
||
|
||
end Lean
|