mirror of
https://github.com/HigherOrderCO/Kind.git
synced 2024-09-11 17:56:48 +03:00
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.
8 lines
262 B
Plaintext
8 lines
262 B
Plaintext
Kind.reduce.ref
|
|
: ∀(maj: Bool) ∀(nam: String) ∀(val: Kind.Term)
|
|
Kind.Term
|
|
= λmaj λnam λval
|
|
use P = λx ∀(nam: String) ∀(val: Kind.Term) Kind.Term
|
|
use true = λnam λval (Kind.reduce maj val)
|
|
use false = Kind.ref
|
|
(~maj P true false nam val) |