mirror of
https://github.com/HigherOrderCO/Kind.git
synced 2024-09-11 16:25:54 +03:00
85ad65b026
Now, there are two local binders: let x = ... use x = ... The 'let' binder will create a local definition, type-check it, and assign a name to it. When compiled, it will create 'dup' nodes. The 'use' binder is just an alias. It will not bind a new variable, and, when compiled, will create inline copies. Also, for type-checking, it allows creating aliases that are definitionaly equal for the checker.
131 lines
3.0 KiB
Plaintext
131 lines
3.0 KiB
Plaintext
Kind.infer
|
|
: ∀(term: Kind.Term) ∀(dep: Nat) (Maybe Kind.Term)
|
|
= λterm λdep
|
|
use bind = (Maybe.bind Kind.Term Kind.Term)
|
|
use pure = (Maybe.some Kind.Term)
|
|
use none = (Maybe.none Kind.Term)
|
|
use P = λx ∀(dep: Nat) (Maybe Kind.Term)
|
|
use all = λnam λinp λbod λdep
|
|
(bind
|
|
(Kind.check inp Kind.set dep)
|
|
λ_
|
|
(bind
|
|
(Kind.check
|
|
(bod (Kind.ann (Kind.var nam dep) inp))
|
|
Kind.set
|
|
(Nat.succ dep)
|
|
)
|
|
λ_ (pure Kind.set)
|
|
)
|
|
)
|
|
use lam = λnam λbod λdep none
|
|
use app = λfun λarg λdep
|
|
(bind
|
|
(Kind.infer fun dep)
|
|
λfun_typ
|
|
(Kind.if.all
|
|
(Kind.reduce Bool.true fun_typ)
|
|
∀(fun: Kind.Term) ∀(arg: Kind.Term) (Maybe Kind.Term)
|
|
λfun_typ.nam λfun_typ.inp λfun_typ.bod λfun λarg
|
|
(bind
|
|
(Kind.check arg fun_typ.inp dep)
|
|
λ_ (pure (fun_typ.bod arg))
|
|
)
|
|
λfun_typ λfun λarg none
|
|
fun
|
|
arg
|
|
)
|
|
)
|
|
use ann = λval λtyp λdep (pure typ)
|
|
use slf = λnam λbod λdep
|
|
(bind
|
|
(Kind.check
|
|
(bod (Kind.ann (Kind.var nam dep) (Kind.slf nam bod)))
|
|
Kind.set
|
|
(Nat.succ dep)
|
|
)
|
|
λ_ (pure Kind.set)
|
|
)
|
|
use ins = λval λdep
|
|
(bind
|
|
(Kind.infer val dep)
|
|
λval_typ
|
|
(Kind.if.slf
|
|
(Kind.reduce Bool.true val_typ)
|
|
∀(val: Kind.Term) (Maybe Kind.Term)
|
|
λval_nam λval_typ.bod λval
|
|
(pure (val_typ.bod (Kind.ins val)))
|
|
λval_typ λval none
|
|
val
|
|
)
|
|
)
|
|
use ref = λnam λval λdep (Kind.infer val dep)
|
|
use def = λnam λval λbod λdep none
|
|
use set = λdep (pure Kind.set)
|
|
use u60 = λdep (pure Kind.set)
|
|
use num = λnum λdep (pure Kind.u60)
|
|
use txt = λtxt λdep (pure Kind.Book.String)
|
|
use op2 = λopr λfst λsnd λdep
|
|
(bind
|
|
(Kind.check fst Kind.u60 dep)
|
|
λ_
|
|
(bind (Kind.check snd Kind.u60 dep) λ_ (pure Kind.u60))
|
|
)
|
|
use mat = λnam λx λz λs λp λdep
|
|
(bind
|
|
(Kind.check x Kind.u60 dep)
|
|
λx_typ
|
|
(bind
|
|
(Kind.check
|
|
(p (Kind.ann (Kind.var nam dep) Kind.u60))
|
|
Kind.set
|
|
dep
|
|
)
|
|
λp_typ
|
|
(bind
|
|
(Kind.check z (p (Kind.num #0)) dep)
|
|
λz_typ
|
|
(bind
|
|
(Kind.check
|
|
(s
|
|
(Kind.ann
|
|
(Kind.var (String.concat nam "-1") dep)
|
|
Kind.u60
|
|
)
|
|
)
|
|
(p
|
|
(Kind.op2
|
|
Kind.Oper.add
|
|
(Kind.num #1)
|
|
(Kind.var (String.concat nam "-1") dep)
|
|
)
|
|
)
|
|
(Nat.succ dep)
|
|
)
|
|
λs_typ (pure (p x))
|
|
)
|
|
)
|
|
)
|
|
)
|
|
use hol = λnam λctx λdep none
|
|
use var = λnam λidx λdep none
|
|
(~term
|
|
P
|
|
all
|
|
lam
|
|
app
|
|
ann
|
|
slf
|
|
ins
|
|
ref
|
|
def
|
|
set
|
|
u60
|
|
num
|
|
op2
|
|
mat
|
|
txt
|
|
hol
|
|
var
|
|
dep
|
|
) |