PrimParser Lawfulness Proofs

Lawful instances for Success, Outcome, and Parser: LawfulFunctor, LawfulGradedFunctor, LawfulGradedApplicative, LawfulGradedMonad.

theorem Parser.ext {α ε : Type} {g : Grade} {p q : Parser ε g α} (h : ∀ {m : ℕ} (t : Text m), p.run t = q.run t) : p = q

theorem Parser.ext_iff {α ε : Type} {g : Grade} {p q : Parser ε g α} : p = q ↔ ∀ {m : ℕ} (t : Text m), p.run t = q.run t

instance Parser.instLawfulFunctorSuccess {n : ℕ} {gc : Necessity} : LawfulFunctor (Success n gc)

instance Parser.instLawfulFunctorOutcome {ε : Type} {n : ℕ} {gc : Necessity} : LawfulFunctor (Outcome ε n gc)

instance Parser.instLawfulGradedFunctorNecessitySuccess {n : ℕ} : LawfulGradedFunctor (Success n)

instance Parser.instLawfulGradedFunctorGrade {ε : Type} : LawfulGradedFunctor (Parser ε)

theorem Parser.heq {α ε : Type} {g1 g2 : Grade} {p : Parser ε g1 α} {q : Parser ε g2 α} (hg : g1 = g2) (h : ∀ {m : ℕ} (t : Text m), p.run t ≍ q.run t) : p ≍ q

@[simp]

theorem Parser.Failure.trans_self {ε : Type} {n : ℕ} (e : Failure n ε) (h : n ≤ n) : e.trans h = e

theorem Parser.Success.heq {α : Type} {n : ℕ} {c1 c2 : Necessity} {s1 : Success n c1 α} {s2 : Success n c2 α} (hc : c1 = c2) (hr : s1.result = s2.result := by rfl) (hrs : s1.restSize = s2.restSize := by rfl) : s1 ≍ s2

theorem Parser.Success.seq_assoc {α β γ : Type} {n : ℕ} {gc gc' gc'' : Necessity} {a : Success n gc α} {b : Success a.restSize gc' β} {c : Success b.restSize gc'' γ} : (a.seq b).seq c ≍ a.seq (b.seq c)

@[simp]

theorem Parser.Success.seq_result {α β : Type} {n : ℕ} {gc gc' : Necessity} (a : Success n gc α) (b : Success a.restSize gc' β) : (a.seq b).result = b.result

@[simp]

theorem Parser.Success.seq_restSize {α β : Type} {n : ℕ} {gc gc' : Necessity} (a : Success n gc α) (b : Success a.restSize gc' β) : (a.seq b).restSize = b.restSize

theorem Parser.Outcome.failure_congr {α ε : Type} {n : ℕ} {c1 c2 : Necessity} {f : Failure n ε} (hc : c1 = c2) : failure f ≍ failure f

theorem Parser.Outcome.success_congr {α ε : Type} {n : ℕ} {c1 c2 : Necessity} {s1 : Success n c1 α} {s2 : Success n c2 α} (hc : c1 = c2) (hs : s1 ≍ s2) : success s1 ≍ success s2

theorem Parser.bind_run {α β ε : Type} {n : ℕ} {g g' : Grade} (m : Parser ε g α) (f : α → Parser ε g' β) (t : Text n) : (m.bind f).run t = match m.run t with | failure e => failure e | success x => match (f x.result).run (t.dropTo x.restSize ⋯) with | failure e => failure (e.trans ⋯) | success y => success (x.seq y)

theorem Parser.gpure_gbind {α β ε : Type} {j : Grade} (a : α) (f : α → Parser ε j β) : gpure a >>=ᵍ f ≍ f a

theorem Parser.gbind_gpure {α ε : Type} {i : Grade} (p : Parser ε i α) : p >>=ᵍ gpure ≍ p

theorem Parser.gbind_assoc {α β γ ε : Type} {i j k : Grade} (x : Parser ε i α) (f : α → Parser ε j β) (g : β → Parser ε k γ) : x >>=ᵍ f >>=ᵍ g ≍ x >>=ᵍ fun (a : α) => f a >>=ᵍ g

theorem Parser.gmap_gpure {α β ε : Type} (G : α → β) (x : α) : G <$>ᵍ gpure x = gpure (G x)

theorem Parser.gpure_gseq {α β ε : Type} {i : Grade} (G : α → β) (x : Parser ε i α) : (gpure G <*>ᵍ fun (x_1 : Unit) => x) ≍ G <$>ᵍ x

theorem Parser.gseq_gpure {α β ε : Type} {i : Grade} (u : Parser ε i (α → β)) (x : α) : (u <*>ᵍ fun (x_1 : Unit) => gpure x) ≍ (fun (x_1 : α → β) => x_1 x) <$>ᵍ u

theorem Parser.gseq_assoc {α β γ ε : Type} {i j k : Grade} (u : Parser ε i (β → γ)) (v : Parser ε j (α → β)) (w : Parser ε k α) : ((Function.comp <$>ᵍ u <*>ᵍ fun (x : Unit) => v) <*>ᵍ fun (x : Unit) => w) ≍ u <*>ᵍ fun (x : Unit) => v <*>ᵍ fun (x : Unit) => w

instance Parser.instLawfulGradedApplicativeGrade {ε : Type} : LawfulGradedApplicative (Parser ε)

instance Parser.instLawfulGradedMonadGrade {ε : Type} : LawfulGradedMonad (Parser ε)