stelliferous

Releases (2)

• 0.0.3.0 invalid

  expected a fresh constructor name (duplicate declaration: Text)

  at checkpoint_pickle.bend:14

  8 files do not load

  • checkpoint_pickle.bend
  • tensor_batch_norm.bend
  • tensor_checkpoint.bend
  • tensor_f32.bend
  • tensor_layer.bend
  • tensor_loss.bend
  • tensor_optimizer.bend
  • tensor_training.bend
• 0.0.2.0 indexed

Definitions (2,086)

proofs/nat_order.bend

• def restore_shift
• def cancel_sum
• def positive_difference
• def positive_has_last
• def split_at_element
• type UpperBound
• def lift_upper_bound
• def upper_bound_cases
• def comparison_not_less
• def comparison_less_not_equal
• def less_not_equal
• def equal_reflexive
• def equal_symmetric
• def zero_le
• def reflexive
• def offset_le
• def offset_lt
• def cancel_offset_lt
• def successor
• def transitive
• def le_add
• def le_double
• def double_le
• def sub_le
• def sub_lt
• def ge_le
• def ge_true
• def ge_false
• def digit_lt
• def digit_bounded
• def commutative
• def le_lt_trans
• def advance_room
• def room_index
• def lt_succOrder structure shared by padding, allocation and mixed-radix indexing.
• def add_leOrder structure shared by padding, allocation and mixed-radix indexing.
• def add_ltOrder structure shared by padding, allocation and mixed-radix indexing.
• def strict_followOrder structure shared by padding, allocation and mixed-radix indexing.
• def below_differenceTranslate a comparison against a remaining extent to its absolute position.
• def antisymmetricTwo opposite bounds identify a natural number.

proofs/nat_to_u32_bounds.bend

• def predecessor_strict
• def strict_le
• def add_one
• def native_bound
• def nat_trans
• def as_nat_lt
• def as_nat_le
• def uint_trans
• law roundtrip

proofs/natural_addition.bend

• law successor_right
• law double
• law zero_right
• law successor_width
• law associative

proofs/storage_address_bounds.bend

• def capacity
• def shift_extent
• def capacity_value
• def natural_bound
• def child_limit_full
• def right_order
• def sub_value
• def right_restores_index_full
• def right_stays_in_child_full
• def below_one_value
• def equal_values
• def equal_words
• def unequal_words
• def subtract_compared
• def subtract_distinct
• def child_limitExisting allocation proofs use the smaller, 30-bit allocation limit.
• def right_restores_index
• def right_stays_in_child

proofs/storage_allocation_refinement.bend

• def dispatch_sameDispatch changes neither the initialized array nor its live certificate.
• def array_same
• def fresh
• def contents

proofs/storage_buffer_model.bend

• type Content
• def contents
• def value
• def content_tree
• def content_length
• type ContentReady
• type Model
• def content
• def pack
• def tree
• def length
• def content_length_of
• def depth
• def balanced
• def capacity_bound
• def capacity_allocatable
• type SizedLogical length and the native machine depth are independent of the stored element values.
• def ready_content
• def content_ready
• def NativeReady
• def native_content_ready
• def ready_packed
• def ready_observed
• def fresh_certificate