mirror of
https://github.com/HigherOrderCO/Kind.git
synced 2024-09-11 17:56:48 +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.
15 lines
407 B
Plaintext
15 lines
407 B
Plaintext
Nat.equal
|
|
: ∀(a: Nat) ∀(b: Nat) Bool
|
|
= λa λb
|
|
use P = λx ∀(b: Nat) Bool
|
|
use succ = λa.pred λb
|
|
use P = λx ∀(a.pred: Nat) Bool
|
|
use succ = λb.pred λa.pred (Nat.equal a.pred b.pred)
|
|
use zero = λa.pred Bool.false
|
|
(~b P succ zero a.pred)
|
|
use zero = λb
|
|
use P = λx Bool
|
|
use succ = λb.pred Bool.false
|
|
use zero = Bool.true
|
|
(~b P succ zero)
|
|
(~a P succ zero b) |