Enum ReductionStrategy 

pub enum ReductionStrategy {
    LeftmostOutermost,
    LeftmostInnermost,
    RightmostOutermost,
    ParallelOutermost,
    Needed,
}

Represents a reduction strategy for a term rewriting system.

Variants

LeftmostOutermost

Leftmost-outermost (normal order).

LeftmostInnermost

Leftmost-innermost (applicative order).

RightmostOutermost

Rightmost-outermost.

ParallelOutermost

Parallel outermost.

Needed

Needed reduction (lazy evaluation).

Implementations

impl ReductionStrategy

pub fn name(&self) -> &str

Returns the name of the strategy.

pub fn is_complete(&self) -> bool

Checks if this strategy is complete (finds normal form if it exists).

pub fn normalizing_for_orthogonal(&self) -> bool

Checks if this strategy is normalizing for orthogonal TRS.

pub fn lambda_calculus_analog(&self) -> &str

Returns the corresponding lambda calculus evaluation order.

Trait Implementations

impl Clone for ReductionStrategy

fn clone(&self) -> ReductionStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReductionStrategy

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

Formats the value using the given formatter.

impl PartialEq for ReductionStrategy

fn eq(&self, other: &ReductionStrategy) -> 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 StructuralPartialEq for ReductionStrategy