Kind/book/BBT.has.kind2
2024-03-01 20:40:31 -03:00

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