Theoria.Rewrite.Rule (theoria v0.3.0)

Experimental/internal API for 0.2; subject to change before 0.3. A theorem-like rewrite rule over a core equality term.

Summary

Types

t()

Functions

from_lemma(lemma, equality_or_opts \\ [], opts \\ [])

Builds a rewrite rule from equation-lemma metadata.

from_realized(realized)

Builds a rewrite rule from a realized equation artifact.

new(name_or_id, equality, opts \\ [])

Builds a rewrite rule.

Types

t()

@type t() :: %Theoria.Rewrite.Rule{
  binders: [Theoria.Equation.Lemma.binder()],
  direction: :forward | :backward,
  equality: Theoria.Term.Eq.t(),
  identity: Theoria.Equation.Identity.t() | nil,
  name: atom() | Theoria.Equation.Identity.t(),
  proof: Theoria.Term.t() | nil,
  realized: Theoria.Equation.Realized.t() | nil
}

Functions

from_lemma(lemma, equality_or_opts \\ [], opts \\ [])

@spec from_lemma(Theoria.Equation.Lemma.t(), Theoria.Term.t() | keyword(), keyword()) ::
  t()

Builds a rewrite rule from equation-lemma metadata.

from_realized(realized)

@spec from_realized(Theoria.Equation.Realized.t()) :: t()

Builds a rewrite rule from a realized equation artifact.

new(name_or_id, equality, opts \\ [])

@spec new(atom() | Theoria.Equation.Identity.t(), Theoria.Term.Eq.t(), keyword()) ::
  t()

Builds a rewrite rule.