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>>,
}
Expand description

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

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

The interner associated with the type.

Feeds this value into the given Hasher. Read more

Feeds a slice of this type into the given Hasher. Read more

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

This method tests for !=.

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

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

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Cast a value to type U using CastTo.

Compare self to key and return true if they are equal.

Returns the argument unchanged.

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

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.

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.

Check whether there are free (non-bound) variables.

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more