Packages

trait FuncLike[W <: Term with Subs[W], +U <: Term with Subs[U]] extends Term with (W) => U with Subs[FuncLike[W, U]]

Terms that are functions or dependent functions, is a scala function, but the apply is not directly defined - instead the method FuncLike#act is defined.

Linear Supertypes
(W) => U, Term, Subs[FuncLike[W, U]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FuncLike
  2. Function1
  3. Term
  4. Subs
  5. AnyRef
  6. Any
Implicitly
  1. by UnliftOps
  2. by RichTerm
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. abstract type Obj <: FuncLike[W, U]

Abstract Value Members

  1. abstract def act(arg: W): U

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

  2. abstract val depcodom: (W) => Typ[U]
  3. abstract val dom: Typ[W]
  4. abstract def newobj: FuncLike[W, U] with Subs[FuncLike[W, U]]

    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
    Subs
  5. abstract def subs(x: Term, y: Term): FuncLike[W, U]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    FuncLikeSubs
  6. abstract val typ: Typ[FuncLike[W, U]]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    FuncLikeTerm

Concrete Value Members

  1. def :->[V <: Term with Subs[V]](that: V): Func[FuncLike[W, U], V]

    constructor for (pure) lambda functions, see lmbda

    constructor for (pure) lambda functions, see lmbda

    Implicit
    This member is added by an implicit conversion from FuncLike[W, U] toRichTerm[FuncLike[W, U]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  2. def :~>[V <: Term with Subs[V]](that: V): FuncLike[FuncLike[W, U], V]

    constructor for (in general dependent) lambda functions, see lambda

    constructor for (in general dependent) lambda functions, see lambda

    Implicit
    This member is added by an implicit conversion from FuncLike[W, U] toRichTerm[FuncLike[W, U]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  3. def =:=(rhs: FuncLike[W, U]): IdentityTyp[FuncLike[W, U]]

    equality type 'term = rhs'

    equality type 'term = rhs'

    Implicit
    This member is added by an implicit conversion from FuncLike[W, U] toRichTerm[FuncLike[W, U]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  4. def andThen[A](g: (U) => A): (W) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def apply(arg: W): U

    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
  6. def applyUnchecked(arg: W): U
  7. def canApply(arg: W): 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.

  8. def compose[A](g: (A) => W): (A) => U
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  9. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  10. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  11. def refl: Refl[FuncLike[W, U]]

    reflexivity term refl : term = term

    reflexivity term refl : term = term

    Implicit
    This member is added by an implicit conversion from FuncLike[W, U] toRichTerm[FuncLike[W, U]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  12. def replace(x: Term, y: Term): FuncLike[W, U] with Subs[FuncLike[W, U]]

    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
  13. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any
  14. def unlift: PartialFunction[W, B]
    Implicit
    This member is added by an implicit conversion from FuncLike[W, U] toUnliftOps[W, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if U is a subclass of Option[B] (U <: Option[B]).
    Definition Classes
    UnliftOps
  15. 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
    Term