Enum chalk_ir::GoalData

pub enum GoalData<I: Interner> {
    Quantified(QuantifierKind, Binders<Goal<I>>),
    Implies(ProgramClauses<I>, Goal<I>),
    All(Goals<I>),
    Not(Goal<I>),
    EqGoal(EqGoal<I>),
    SubtypeGoal(SubtypeGoal<I>),
    DomainGoal(DomainGoal<I>),
    CannotProve,
}

A general goal; this is the full range of questions you can pose to Chalk.

Variants

Quantified(QuantifierKind, Binders<Goal<I>>)

Introduces a binding at depth 0, shifting other bindings up (deBruijn index).

Tuple Fields of Quantified

0: QuantifierKind1: Binders<Goal<I>>

Implies(ProgramClauses<I>, Goal<I>)

A goal that holds given some clauses (like an if-statement).

Tuple Fields of Implies

0: ProgramClauses<I>1: Goal<I>

All(Goals<I>)

List of goals that all should hold.

Tuple Fields of All

0: Goals<I>

Not(Goal<I>)

Negation: the inner goal should not hold.

Tuple Fields of Not

0: Goal<I>

EqGoal(EqGoal<I>)

Make two things equal; the rules for doing so are well known to the logic

Tuple Fields of EqGoal

0: EqGoal<I>

SubtypeGoal(SubtypeGoal<I>)

Make one thing a subtype of another; the rules for doing so are well known to the logic

Tuple Fields of SubtypeGoal

0: SubtypeGoal<I>

DomainGoal(DomainGoal<I>)

A “domain goal” indicates some base sort of goal that can be proven via program clauses

Tuple Fields of DomainGoal

0: DomainGoal<I>

CannotProve

Indicates something that cannot be proven to be true or false definitively. This can occur with overflow but also with unifications of skolemized variables like forall<X,Y> { X = Y }. Of course, that statement is false, as there exist types X, Y where X = Y is not true. But we treat it as “cannot prove” so that forall<X,Y> { not { X = Y } } also winds up as cannot prove.

Implementations

impl<I: Interner> GoalData<I>

pub fn intern(self, interner: &I) -> Goal<I>

Create an interned goal.

Trait Implementations

impl<I: Clone + Interner> Clone for GoalData<I>

fn clone(&self) -> GoalData<I>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I: Interner> Debug for GoalData<I>

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<I: Interner> Fold<I> for GoalData<I>

type Result = GoalData<I>

The type of value that will be produced once folding is done. Typically this is Self, unless Self contains borrowed values, in which case owned values are produced (for example, one can fold over a &T value where T: Fold, in which case you get back a T, not a &T).

fn fold_with<'i>(
    self,
    folder: &mut dyn Folder<'i, I>,
    outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i, 

Apply the given folder folder to self; binders is the number of binders that are in scope when beginning the folder. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.

impl<I: Interner> HasInterner for GoalData<I>

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for GoalData<I>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<I: PartialEq + Interner> PartialEq<GoalData<I>> for GoalData<I>

fn eq(&self, other: &GoalData<I>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &GoalData<I>) -> bool

This method tests for !=.

impl<I: Interner> Visit<I> for GoalData<I>

fn visit_with<'i, B>(
    &self,
    visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
    outer_binder: DebruijnIndex
) -> ControlFlow<B> where
    I: 'i, 

Apply the given visitor visitor to self; binders is the number of binders that are in scope when beginning the visitor. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.

impl<I: Interner> Zip<I> for GoalData<I>

fn zip_with<'i, Z: Zipper<'i, I>>(
    zipper: &mut Z,
    variance: Variance,
    a: &Self,
    b: &Self
) -> Fallible<()> where
    I: 'i, 

Uses the zipper to walk through two values, ensuring that they match.

impl<I: Interner> Copy for GoalData<I> where
    I::InternedType: Copy,
    I::InternedLifetime: Copy,
    I::InternedGenericArg: Copy,
    I::InternedSubstitution: Copy,
    I::InternedGoal: Copy,
    I::InternedGoals: Copy,
    I::InternedProgramClauses: Copy,
    I::InternedVariableKinds: Copy, 

impl<I: Eq + Interner> Eq for GoalData<I>

impl<I: Interner> StructuralEq for GoalData<I>

impl<I: Interner> StructuralPartialEq for GoalData<I>