mirror of
https://github.com/HigherOrderCO/Kind.git
synced 2024-09-11 20:47:25 +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.
9 lines
293 B
Plaintext
9 lines
293 B
Plaintext
Kind.reduce.app
|
|
: ∀(maj: Bool) ∀(fun: Kind.Term) ∀(arg: Kind.Term)
|
|
Kind.Term
|
|
= λmaj λfun λarg
|
|
use P = ∀(arg: Kind.Term) Kind.Term
|
|
use Y = λnam λbod λarg
|
|
(Kind.reduce maj (bod (Kind.reduce maj arg)))
|
|
use N = λfun λarg (Kind.app fun arg)
|
|
(Kind.if.lam fun P Y N arg) |