Type Alias GoalData

pub type GoalData = GoalData<Interner>;

Aliased Type

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

Variants

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

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

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

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

All(Goals<Interner>)

List of goals that all should hold.

Not(Goal<Interner>)

Negation: the inner goal should not hold.

EqGoal(EqGoal<Interner>)

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

SubtypeGoal(SubtypeGoal<Interner>)

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

DomainGoal(DomainGoal<Interner>)

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

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> GoalData<I>

where I: Interner,

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

Create an interned goal.

Trait Implementations

impl<I> Clone for GoalData<I>

where I: Clone + Interner,

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> Debug for GoalData<I>

where I: Interner,

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

Formats the value using the given formatter.

impl<I> HasInterner for GoalData<I>

where I: Interner,

type Interner = I

The interner associated with the type.

impl<I> Hash for GoalData<I>

where I: Hash + Interner,

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

where __H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I> PartialEq for GoalData<I>

where I: PartialEq + Interner,

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I> TypeFoldable<I> for GoalData<I>

where I: Interner,

fn try_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex, ) -> Result<GoalData<I>, E>

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.

fn fold_with( self, folder: &mut dyn TypeFolder<I, Error = Infallible>, outer_binder: DebruijnIndex, ) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<I> TypeVisitable<I> for GoalData<I>

where I: Interner,

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

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> Zip<I> for GoalData<I>

where I: Interner,

fn zip_with<Z>( zipper: &mut Z, variance: Variance, a: &GoalData<I>, b: &GoalData<I>, ) -> Result<(), NoSolution>

where Z: Zipper<I>,

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

impl<I> Copy for GoalData<I>

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

impl<I> Eq for GoalData<I>

where I: Eq + Interner,

impl<I> StructuralPartialEq for GoalData<I>

where I: Interner,