bend-collections-laws-math
Releases (1)
-
1.0.0.0 indexed
Definitions (5,526)
proofs/lib/lemmas/proofs/division_value.bend
- def conservationThe denominator is a symbolic U32 identified with the actual fixed divisor; the proof observes the actual execution and discharges each recursive bound.
- def actualPublic native divisor identity is discharged here, with no external premise.
proofs/lib/lemmas/proofs/invariants.bend
- def memberExecutable representation predicates, not assumed correctness or a map oracle.
- def unique
- def included
- def bit_value
- def routed
- def nonempty
- def below
- def same_prefixEvery pair of leaves below a node agrees on every bit strictly before its discriminator.
- def prefix_against
- def common_prefix
- def critbit
- def identities
- def representation
- def string_identity
- law initial_representation
- law skipped_prefix_rejectedA discriminator at 33 routes these children correctly, yet misses their first differing presence bit at zero.
- law lookup_preserves_critbitLookup preserves even the strengthened discriminator/prefix predicate.
proofs/lib/lemmas/proofs/map_bridge.bend
- def routed_key
- law recursive_bit_key
- law bit_go_preserves_key
- law bit_at_preserves_key
- law bit_preserves_key
- def get_bit
- def has_bit
- def put_bit
- def pop_bit
- def seek_bit
- def ins_deep
- def ins_if
- law get_go_bridge
- law get_node
- law has_go_bridge
- law has_node
- law put_go_bridge
- law put_node
- law pop_go_bridge
- law pop_node
- law seek_go_bridge
- law seek_node
- law ins_splice_bridge
- law ins_deep_bridge
- law ins_t
- law ins_node
proofs/lib/lemmas/proofs/map_difference_order.bend
- law add_zero
- law add_commute
- law add_sub_bound
- law sub_from_add
- law add_complement
- law strict_successor
- law less_is_le
- def Split
- law lift_split
- law split_offset
proofs/lib/lemmas/proofs/map_index.bend
- def next_quotientExisting Base.divmod quotient translation; no replacement division algorithm.
- law quotient_translation
- law character_stride
- law bit_at_next
- law native_character_strideThis exact key-preserving result connects bit positions across String prefixes using the native division and bit traversal definitions.
- law add_right_successor
- law division_no_wrap
- law first_character_division
- law native_first_character
proofs/lib/lemmas/proofs/map_insert.bend
- def valueProjections of actual native results; no alternative lookup algorithm.
- def lookup
- def route_bit
- law route_pair
- law route_shape
- law low_value
- law high_value
- law node_left
- law node_right
- law leaf_same
- law splice_same_bit
- law splice_same
- law deep_same_bit
- law insertion_branch_same
- law insertion_sameThis actual native insertion law needs no well-formedness assumption: querying the new key follows the same bits used to choose its newly inserted leaf.
- def seek_found
- law seek_low_found
- law seek_high_found
- law seek_left
- law seek_right
- law replace_left
- law replace_right
- def replacement_certificate
- law certificate_left
- law certificate_right
- law certificate_branch
- law replacement_at_seek
- law seek_low_shape
- law seek_high_shape
- law seek_branch_shape
- law seek_shape
- law set_comparison_case
- law set_found_case
- law set_seek_case
- law set_samePublic native Map update/lookup same-key law.
proofs/lib/lemmas/proofs/map_lookup.bend
- def leafStructural membership names a real leaf and its exact value.