Struct lamcal::ApplicativeOrder

pub struct ApplicativeOrder<A> { /* fields omitted */ }

Applicative-Order β-reduction to normal form.

• Reduces the leftmost innermost redex first.
• It treats free variables as strict data constructors.
• An argument e2 of an application (e1 e2) is reduced before contracting the redex and before building an application term.
• Reductions are performed also under lambda abstractions.

This strategy is uniform as its definition involves no other reduction strategy.

Trait Implementations

impl<A: Default> Default for ApplicativeOrder<A>

fn default() -> ApplicativeOrder<A>

Returns the "default value" for a type.

impl<A: Debug> Debug for ApplicativeOrder<A>

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

Formats the value using the given formatter.

impl<A: Clone> Clone for ApplicativeOrder<A>

fn clone(&self) -> ApplicativeOrder<A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Copy> Copy for ApplicativeOrder<A>

impl<A: PartialEq> PartialEq for ApplicativeOrder<A>

fn eq(&self, other: &ApplicativeOrder<A>) -> bool

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

fn ne(&self, other: &ApplicativeOrder<A>) -> bool

This method tests for !=.

impl<A> BetaReduce for ApplicativeOrder<A> where     A: AlphaRename,

fn reduce_inspected(     expr: Term,     inspect: &mut impl Inspect ) -> Term

Performs β-reduction allowing to inspect the current term before each contraction.

fn reduce(expr: Term) -> Term

Performs β-reduction on the given Term and returns the result.

fn reduce_once(expr: Term) -> Term

Performs one step of β-reduction on the given Term and returns the result.