Packages

case class LambdaTerm[X <: Term with Subs[X], Y <: Term with Subs[Y]](variable: X, value: Y) extends LambdaLike[X, Y] with Product with Serializable

functions given by lambda, which may be dependent; even if it is pure, the scala type does not show this; one should usually not use the constructor of this case class, instead use the function lmbda or the syntactic sugar for this, e.g. 

val f = x :~> y

Note the :~>, not :-> These create a new variable to avoid name collisions.

Linear Supertypes
Serializable, Product, Equals, LambdaLike[X, Y], FuncLike[X, Y], (X) => Y, Term, Subs[FuncLike[X, Y]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LambdaTerm
  2. Serializable
  3. Product
  4. Equals
  5. LambdaLike
  6. FuncLike
  7. Function1
  8. Term
  9. Subs
  10. AnyRef
  11. Any
Implicitly
  1. by UnliftOps
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new LambdaTerm(variable: X, value: Y)

Type Members

  1. type Cod = Y
    Definition Classes
    LambdaLike
  2. type D = X
    Definition Classes
    LambdaLike
  3. abstract type Obj <: FuncLike[X, Y]
    Definition Classes
    FuncLike

Value Members

  1. def act(arg: X): Y

    the action of the function to define: define this method, but use apply.

    the action of the function to define: define this method, but use apply.

    Definition Classes
    LambdaLike → FuncLike
  2. def andThen[A](g: (Y) => A): (X) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def andthen[Z <: Term with Subs[Z]](f: (Y) => Z): LambdaTerm[X, Z]
    Definition Classes
    LambdaLike
  4. def apply(arg: X): Y

    application of the function: use this but define the act method; checks HoTT-type of argument is in the domain and throws exception if it fails.

    application of the function: use this but define the act method; checks HoTT-type of argument is in the domain and throws exception if it fails.

    Definition Classes
    FuncLike → Function1
  5. def applyUnchecked(arg: X): Y
    Definition Classes
    FuncLike
  6. def canApply(arg: X): Boolean

    checks if application is valid; can override to allow for example resizing universes

    checks if application is valid; can override to allow for example resizing universes

    arg

    the argument

    returns

    whether the argument has the correct type.

    Definition Classes
    LambdaLike → FuncLike
  7. def compose[A](g: (A) => X): (A) => Y
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  8. val dep: Boolean
    Definition Classes
    LambdaTerm → LambdaLike
  9. val depcodom: (X) => Typ[Y]
    Definition Classes
    LambdaTerm → FuncLike
  10. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  11. lazy val dom: Typ[X]
    Definition Classes
    LambdaLike → FuncLike
  12. def equals(that: Any): Boolean
    Definition Classes
    LambdaLike → AnyRef → Any
  13. lazy val hashCode: Int
    Definition Classes
    LambdaLike → AnyRef → Any
  14. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  15. def newobj: LambdaTerm[X, Y]

    A new object with the same type, to be used in place of a variable to avoid name clashes.

    A new object with the same type, to be used in place of a variable to avoid name clashes. Should throw exception when invoked for constants.

    Definition Classes
    LambdaTerm → Subs
  16. def productElementNames: Iterator[String]
    Definition Classes
    Product
  17. def replace(x: Term, y: Term): FuncLike[X, Y] with Subs[FuncLike[X, Y]]

    refine substitution so if x and y are both of certain forms such as pairs or formal applications, components are substituted.

    refine substitution so if x and y are both of certain forms such as pairs or formal applications, components are substituted.

    Definition Classes
    Subs
  18. def subs(x: Term, y: Term): LambdaLike[X, Y]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    LambdaLike → FuncLike → Subs
  19. def toString(): String
    Definition Classes
    LambdaLike → Function1 → AnyRef → Any
  20. lazy val typ: Typ[FuncLike[X, Y]]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    LambdaLike → FuncLike → Term
  21. def unlift: PartialFunction[X, B]
    Implicit
    This member is added by an implicit conversion from LambdaTerm[X, Y] toUnliftOps[X, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if Y is a subclass of Option[B] (Y <: Option[B]).
    Definition Classes
    UnliftOps
  22. def usesVar(t: Term): Boolean

    returns whether the variable t is used as a variable in a lambda definition.

    returns whether the variable t is used as a variable in a lambda definition.

    Definition Classes
    LambdaLike → Term
  23. val value: Y

    the value y in the lambda definition x mapsto y

    the value y in the lambda definition x mapsto y

    Definition Classes
    LambdaTerm → LambdaLike
  24. val variable: X

    the variable x in the lambda definition x \mapsto y

    the variable x in the lambda definition x \mapsto y

    Definition Classes
    LambdaTerm → LambdaLike