Reference · The Applied Higher-Order Functions catalogue

rainbow.algorithms.proofs.ahof.tree-search-fal

The Applied Higher-Order Functions cataloguesrc/rainbow/algorithms/proofs/ahof/tree_search_fal.clj2 definitions, 3 theorems

AHoF V17 Tree Search for Falsification: best-first search over behaviours toward a violation, expanding the node with the lowest cost-to-violation; it keeps the smaller value: prefers-lower-cost? a b = decide ('a 'b) frontier-value a b = if ('a 'b) then 'a else 'b over exact rationals. Proved native and axiom-free: the preference decision, the selected value, and the switch. Requires audit/decide-nnrat-at-most, logic/if-data (both in the D63 checkpoint). Scope (measured by the kernel): this module has 3 worked instances (statements about specific values). None of its theorems is a guarantee about the algorithm for all inputs; `lein verify rainbow.algorithms.proofs.ahof.tree-search-fal` prints this classification.

tree-fal/prefers-lower-cost? :
  (x₁ x₂ : ℚ≥0)
  → data/Bool

tree-fal/frontier-value :
  (x₁ x₂ : ℚ≥0)
  → ℚ≥0

tree-fal/prefers-example :
  → lis/extends? 1/2 3/4 = data/true

tree-fal/selected-value :
  → ppo/nnrat-min 1/2 3/4 = 1/2

tree-fal/switches :
  → lis/extends? 3/4 1/2 = data/false