org.kiama.example.lambda2

ParLazySubst

trait ParLazySubst extends Par

Lazy evaluation of lambda calculus with parallel term-level substitution and arithmetic operations.

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ParLazySubst
  2. Par
  3. ReduceSubst
  4. Reduce
  5. RewritingEvaluator
  6. Evaluator
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. lazy val arithop: rewriting.Rewriter.Strategy

    Definition Classes
    Reduce
  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. lazy val beta: rewriting.Rewriter.Strategy

    Beta reduction via term-level substitution.

    Beta reduction via term-level substitution.

    Definition Classes
    ParReduceSubstReduce
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  10. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  12. def eval(exp: Exp): Exp

    Evaluate the given expression by rewriting it with the evals strategy.

    Evaluate the given expression by rewriting it with the evals strategy.

    Definition Classes
    RewritingEvaluatorEvaluator
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  14. object freshvar

    Generate a fresh variable name.

  15. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  18. lazy val lambda: rewriting.Rewriter.PlusStrategy

    Reusable strategy for reduction with explicit term-level substitution.

    Reusable strategy for reduction with explicit term-level substitution.

    Definition Classes
    ParReduceSubst
  19. lazy val letLet: rewriting.Rewriter.Strategy

    Merging two arbitrary parallel binders.

    Merging two arbitrary parallel binders.

    Definition Classes
    Par
  20. def lookupb(x: Idn, ds: List[Bind]): Option[Exp]

    Lookup a binding for a name in a list of bindings.

    Lookup a binding for a name in a list of bindings.

    Definition Classes
    Par
  21. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  22. final def notify(): Unit

    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  24. def reducesinlambdas(): Boolean

    Whether this mechanism evaluates inside lambdas.

    Whether this mechanism evaluates inside lambdas. Used for testing. Default: false.

    Definition Classes
    Evaluator
  25. lazy val s: rewriting.Rewriter.Strategy

    Lazily evaluate within the expression then try to reduce the expression itself, repeating until no change.

    Lazily evaluate within the expression then try to reduce the expression itself, repeating until no change.

    Definition Classes
    ParLazySubstReduceSubstReduceRewritingEvaluator
  26. lazy val subsApp: rewriting.Rewriter.Strategy

    Substitution in applications.

    Substitution in applications.

    Definition Classes
    ParReduceSubst
  27. lazy val subsLam: rewriting.Rewriter.Strategy

    Substitution in lambda abstractions.

    Substitution in lambda abstractions.

    Definition Classes
    ParReduceSubst
  28. lazy val subsNum: rewriting.Rewriter.Strategy

    Substitution in numeric terms.

    Substitution in numeric terms.

    Definition Classes
    ParReduceSubst
  29. lazy val subsOpn: rewriting.Rewriter.Strategy

    Substitution in primitive operations

    Substitution in primitive operations

    Definition Classes
    ParReduceSubst
  30. lazy val subsVar: rewriting.Rewriter.Strategy

    Substitution in variable terms.

    Substitution in variable terms.

    Definition Classes
    ParReduceSubst
  31. def substitute(x: Idn, e2: Exp, e1: Exp): Exp

    Capture-free substitution of free occurrences of x in e1 with e2.

    Capture-free substitution of free occurrences of x in e1 with e2.

    Definition Classes
    Evaluator
  32. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  33. def toString(): String

    Definition Classes
    AnyRef → Any
  34. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  35. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  36. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Par

Inherited from ReduceSubst

Inherited from Reduce

Inherited from RewritingEvaluator

Inherited from Evaluator

Inherited from AnyRef

Inherited from Any

No Group