Packages

trait Func[W <: Term with Subs[W], +U <: Term with Subs[U]] extends FuncLike[W, U] with Subs[Func[W, U]]

a function (pure, not dependent), i.e., a term in a function type, has a codomain and a fixed type for the domain.

Linear Supertypes
FuncLike[W, U], (W) => U, Term, Subs[Func[W, U]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Func
  2. FuncLike
  3. Function1
  4. Term
  5. Subs
  6. AnyRef
  7. 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]
    Definition Classes
    FuncLike

Abstract Value Members

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

    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
    FuncFuncLike
  2. abstract val codom: Typ[U]

    codomain

  3. abstract val dom: Typ[W]

    domain

    domain

    Definition Classes
    FuncFuncLike
  4. abstract def newobj: Func[W, U] with Subs[Func[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): Func[W, U]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    FuncFuncLikeSubs
  6. abstract val typ: Typ[Func[W, U]]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    FuncFuncLikeTerm

Concrete Value Members

  1. def :->[V <: Term with Subs[V]](that: V): Func[Func[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 Func[W, U] toRichTerm[Func[W, U]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  2. def :~>[V <: Term with Subs[V]](that: V): FuncLike[Func[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 Func[W, U] toRichTerm[Func[W, U]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  3. def =:=(rhs: Func[W, U]): IdentityTyp[Func[W, U]]

    equality type 'term = rhs'

    equality type 'term = rhs'

    Implicit
    This member is added by an implicit conversion from Func[W, U] toRichTerm[Func[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
    Definition Classes
    FuncLike
  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.

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

    returns whether this depends on that

    returns whether this depends on that

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

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  12. def refl: Refl[Func[W, U]]

    reflexivity term refl : term = term

    reflexivity term refl : term = term

    Implicit
    This member is added by an implicit conversion from Func[W, U] toRichTerm[Func[W, U]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  13. def replace(x: Term, y: Term): Func[W, U] with Subs[Func[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
  14. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any
  15. def unlift: PartialFunction[W, B]
    Implicit
    This member is added by an implicit conversion from Func[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
  16. 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