mirror of
https://github.com/HigherOrderCO/Kind.git
synced 2024-09-11 20:40:38 +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.
11 lines
311 B
Plaintext
11 lines
311 B
Plaintext
Kind.equal.enter
|
|
: ∀(e: Bool)
|
|
∀(a: Kind.Term)
|
|
∀(b: Kind.Term)
|
|
∀(dep: Nat)
|
|
Bool
|
|
= λe λa λb λdep
|
|
use P = λx ∀(a: Kind.Term) ∀(b: Kind.Term) ∀(dep: Nat) Bool
|
|
use true = λa λb λdep Bool.true
|
|
use false = λa λb λdep (Kind.comparer Kind.equal a b dep)
|
|
(~e P true false a b dep) |