Documentation

Pretty.Claims.ResolveDet

Determinism of resolving theorems #

theorem Resolve_deterministic :
∀ {α : Type} {F : Factory α} {d : Doc} {c i : } {ms₁ ms₂ : MeasureSet}, Resolve F d c i ms₁Resolve F d c i ms₂ms₁ = ms₂

The determinism of resolving (Page 19, Section 5.6)

theorem ResolveConcatOne_deterministic :
∀ {α : Type} {F : Factory α} {d : Doc} {m : Meas} {i : } {msr₁ msr₂ : MeasureSet}, ResolveConcatOne F d m i msr₁ResolveConcatOne F d m i msr₂msr₁ = msr₂
theorem ResolveConcat_deterministic :
∀ {α : Type} {F : Factory α} {d : Doc} {i : } {msr₁ msr₂ : MeasureSet} {ms : List Meas}, ResolveConcat F ms d i msr₁ResolveConcat F ms d i msr₂msr₁ = msr₂