Enum chalk_ir::GoalData [−][src]
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, }
Expand description
A general goal; this is the full range of questions you can pose to Chalk.
Variants
Introduces a binding at depth 0, shifting other bindings up (deBruijn index).
Tuple Fields of Quantified
0: QuantifierKind
1: Binders<Goal<I>>
A goal that holds given some clauses (like an if-statement).
Tuple Fields of Implies
0: ProgramClauses<I>
1: Goal<I>
List of goals that all should hold.
Tuple Fields of All
0: Goals<I>
Negation: the inner goal should not hold.
Tuple Fields of Not
0: Goal<I>
Make two things equal; the rules for doing so are well known to the logic
Tuple Fields of EqGoal
0: EqGoal<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>
A “domain goal” indicates some base sort of goal that can be proven via program clauses
Tuple Fields of DomainGoal
0: DomainGoal<I>
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
Trait Implementations
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
). Read more
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. Read more
type Interner = I
type Interner = I
The interner associated with the type.
fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: '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. Read more
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,
Auto Trait Implementations
impl<I> RefUnwindSafe for GoalData<I> where
<I as Interner>::DefId: RefUnwindSafe,
<I as Interner>::InternedGenericArg: RefUnwindSafe,
<I as Interner>::InternedGoal: RefUnwindSafe,
<I as Interner>::InternedGoals: RefUnwindSafe,
<I as Interner>::InternedLifetime: RefUnwindSafe,
<I as Interner>::InternedProgramClauses: RefUnwindSafe,
<I as Interner>::InternedSubstitution: RefUnwindSafe,
<I as Interner>::InternedType: RefUnwindSafe,
<I as Interner>::InternedVariableKinds: RefUnwindSafe,
impl<I> Send for GoalData<I> where
<I as Interner>::DefId: Send,
<I as Interner>::InternedGenericArg: Send,
<I as Interner>::InternedGoal: Send,
<I as Interner>::InternedGoals: Send,
<I as Interner>::InternedLifetime: Send,
<I as Interner>::InternedProgramClauses: Send,
<I as Interner>::InternedSubstitution: Send,
<I as Interner>::InternedType: Send,
<I as Interner>::InternedVariableKinds: Send,
impl<I> Sync for GoalData<I> where
<I as Interner>::DefId: Sync,
<I as Interner>::InternedGenericArg: Sync,
<I as Interner>::InternedGoal: Sync,
<I as Interner>::InternedGoals: Sync,
<I as Interner>::InternedLifetime: Sync,
<I as Interner>::InternedProgramClauses: Sync,
<I as Interner>::InternedSubstitution: Sync,
<I as Interner>::InternedType: Sync,
<I as Interner>::InternedVariableKinds: Sync,
impl<I> Unpin for GoalData<I> where
<I as Interner>::DefId: Unpin,
<I as Interner>::InternedGenericArg: Unpin,
<I as Interner>::InternedGoal: Unpin,
<I as Interner>::InternedGoals: Unpin,
<I as Interner>::InternedLifetime: Unpin,
<I as Interner>::InternedProgramClauses: Unpin,
<I as Interner>::InternedSubstitution: Unpin,
<I as Interner>::InternedType: Unpin,
<I as Interner>::InternedVariableKinds: Unpin,
impl<I> UnwindSafe for GoalData<I> where
<I as Interner>::DefId: UnwindSafe,
<I as Interner>::InternedGenericArg: UnwindSafe,
<I as Interner>::InternedGoal: UnwindSafe,
<I as Interner>::InternedGoals: UnwindSafe,
<I as Interner>::InternedLifetime: UnwindSafe,
<I as Interner>::InternedProgramClauses: UnwindSafe,
<I as Interner>::InternedSubstitution: UnwindSafe,
<I as Interner>::InternedType: UnwindSafe,
<I as Interner>::InternedVariableKinds: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Cast a value to type U
using CastTo
.
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
Checks whether self
and other
could possibly match.
Shifts this term in one level of binders.
Shifts a term valid at outer_binder
so that it is
valid at the innermost binder. See DebruijnIndex::shifted_in_from
for a detailed explanation. Read more
Shifts a term valid at the innermost binder so that it is
valid at outer_binder
. See DebruijnIndex::shifted_out_to
for a detailed explanation. Read more
Shifts this term out one level of binders.