Equations
Instances For
Equations
- Esolangs.Cornucopia.OneAlt₁.defOneAlt = { arity := 0, expr := Esolangs.Cornucopia.OneAlt₁.exprOneAlt }
Instances For
Equations
- Esolangs.Cornucopia.OneAlt₁.defMain = { arity := 1, expr := Esolangs.Cornucopia.Expr.call "1" [] }
Instances For
Equations
Instances For
@[simp]
@[simp]
theorem
Esolangs.Cornucopia.OneAlt₁.fs₁_get!_of
{fs₁ : Map String (List ℕ → ℕ)}
{name : String}
(h : CompatibleDefs (Map.ofList defs) fs₁)
(d : Def)
(h₁ : (name, d) ∈ defs)
(h₂ :
∀ (f : List ℕ → ℕ),
Map.get! name (Map.ofList defs) = d →
Map.get! name (builtinFs ∪ fs₁) = f →
Map.get? name fs₁ = some (fn d.arity (d.expr.eval prog (builtinFs ∪ fs₁))) →
Map.get? name fs₁ = some f →
f = fn d.arity (d.expr.eval prog (builtinFs ∪ fs₁)) → fn d.arity f = Map.get! name (Map.ofList fs))
:
@[simp]
@[simp]
@[simp]
@[simp]
theorem
Esolangs.Cornucopia.OneAlt₁.fs₁_get?_builtin
{fs₁ : Map String (List ℕ → ℕ)}
{name : String}
[H : BuiltinC name]
(h : CompatibleDefs (Map.ofList defs) fs₁)
:
theorem
Esolangs.Cornucopia.OneAlt₁.fs₁_get?_oneAlt
{fs₁ : Map String (List ℕ → ℕ)}
(h : CompatibleDefs (Map.ofList defs) fs₁)
:
theorem
Esolangs.Cornucopia.OneAlt₁.fs₁_get!_builtin
{fs₁ : Map String (List ℕ → ℕ)}
{name : String}
[H : BuiltinC name]
(h : CompatibleDefs (Map.ofList defs) fs₁)
:
theorem
Esolangs.Cornucopia.OneAlt₁.fs₁_get!_oneAlt
{fs₁ : Map String (List ℕ → ℕ)}
(h : CompatibleDefs (Map.ofList defs) fs₁)
:
theorem
Esolangs.Cornucopia.OneAlt₁.fs₁_get!_main
{fs₁ : Map String (List ℕ → ℕ)}
(h : CompatibleDefs (Map.ofList defs) fs₁)
:
@[instance_reducible]
Equations
- Esolangs.Cornucopia.OneAlt₁.instProgInfoProg = { name := "OneAlt₁", defNames := ["main", "1"], has_model := true, has_unique_model := true, h_defNames := Esolangs.Cornucopia.OneAlt₁.instProgInfoProg._proof_1, h_wf' := Esolangs.Cornucopia.OneAlt₁.instProgInfoProg._proof_2, h_has_model := Esolangs.Cornucopia.OneAlt₁.instProgInfoProg._proof_3, h_has_unique_model := Esolangs.Cornucopia.OneAlt₁.instProgInfoProg._proof_4 }