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.
17 lines
532 B
Plaintext
17 lines
532 B
Plaintext
BBT.has
|
|
: ∀(K: *)
|
|
∀(V: *)
|
|
∀(cmp: ∀(a: K) ∀(b: K) Cmp)
|
|
∀(key: K)
|
|
∀(map: (BBT K V))
|
|
Bool
|
|
= λK λV λcmp λkey λmap
|
|
use P = λx Bool
|
|
use bin = λnext.size λnext.key λnext.val λnext.lft λnext.rgt
|
|
use P = λx ∀(cmp: ∀(a: K) ∀(b: K) Cmp) ∀(key: K) Bool
|
|
use ltn = λcmp λkey (BBT.has K V cmp key next.lft)
|
|
use eql = λcmp λkey Bool.true
|
|
use gtn = λcmp λkey (BBT.has K V cmp key next.rgt)
|
|
(~(cmp key next.key) P ltn eql gtn cmp key)
|
|
use tip = Bool.false
|
|
(~map P bin tip) |