Free (total) combinatory algebra #
@[implicit_reducible]
The equational axioms of the free combinatory algebra. Symmetry and transitivity are commented out because so far we have not needed them.
- refl {a : Expr} : a ≈ a
- app {a b c d : Expr} : a ≈ b → c ≈ d → a ⬝ c ≈ b ⬝ d
- K {a b : Expr} : (Expr.K.app a).app b ≈ a
- S {a b c : Expr} : ((Expr.S.app a).app b).app c ≈ (a.app c).app (b.app c)
Instances For
The equational axioms of the free combinatory algebra. Symmetry and transitivity are commented out because so far we have not needed them.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[reducible]
The carrier of the free total combinatory algebra
Equations
Instances For
@[reducible]
Convert an expression to a (defined) partial element of the carrier.
Equations
Instances For
@[implicit_reducible]
Equations
- One or more equations did not get rendered due to their size.
@[implicit_reducible]
The free combinatory algebra
Equations
- One or more equations did not get rendered due to their size.