Enum ProofComplexity 

pub enum ProofComplexity {
    Atomic,
    Abstraction,
    Application,
    LetBinding,
    Projection,
    Composite,
}

Describes the complexity class of a proof term.

Variants

Atomic

A single atomic term (constant, BVar, FVar, literal, sort).

Abstraction

A lambda abstraction wrapping a simpler proof.

Application

An application (function applied to argument).

LetBinding

A let-binding with a subproof body.

Projection

A projection out of a structure.

Composite

Any composite term beyond the above categories.

Trait Implementations

impl Clone for ProofComplexity

fn clone(&self) -> ProofComplexity

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProofComplexity

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

Formats the value using the given formatter.

impl PartialEq for ProofComplexity

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

impl StructuralPartialEq for ProofComplexity