Struct chalk_engine::ExClause

pub struct ExClause<I: Interner> {
    pub subst: Substitution<I>,
    pub ambiguous: bool,
    pub constraints: Vec<InEnvironment<Constraint<I>>>,
    pub subgoals: Vec<Literal<I>>,
    pub delayed_subgoals: Vec<InEnvironment<Goal<I>>>,
    pub answer_time: TimeStamp,
    pub floundered_subgoals: Vec<FlounderedSubgoal<I>>,
}

The paper describes these as A :- D | G.

Fields

subst: Substitution<I>

The substitution which, applied to the goal of our table, would yield A.

ambiguous: bool

True if any subgoals were depended upon negatively and were not fully evaluated, or if we encountered a CannotProve goal. (In the full SLG algorithm, we would use delayed literals here, but we don’t bother, as we don’t need that support.)

constraints: Vec<InEnvironment<Constraint<I>>>

Region constraints we have accumulated.

subgoals: Vec<Literal<I>>

Subgoals: literals that must be proven

delayed_subgoals: Vec<InEnvironment<Goal<I>>>

We assume that negative literals cannot have coinductive cycles.

answer_time: TimeStamp

Time stamp that is incremented each time we find an answer to some subgoal. This is used to figure out whether any of the floundered subgoals may no longer be floundered: we record the current time when we add something to the list of floundered subgoals, and then we can compare whether its value has changed since then. This is not the same TimeStamp of Forest’s clock.

floundered_subgoals: Vec<FlounderedSubgoal<I>>

List of subgoals that have floundered. See FlounderedSubgoal for more information.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Interner> Debug for ExClause<I>

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

Formats the value using the given formatter.

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

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for ExClause<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, Self: Sized,

Feeds a slice of this type into the given Hasher.

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

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

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

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

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

impl<I: Interner> TypeFoldable<I> for ExClause<I>

fn try_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex, ) -> Result<Self, 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: Interner> TypeVisitable<I> for ExClause<I>

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: Eq + Interner> Eq for ExClause<I>

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