Packages

c

provingground.HoTT

OptDepFuncDefn

case class OptDepFuncDefn[W <: Term with Subs[W]](func: (W) => Option[Term], dom: Typ[W]) extends DepFunc[W, Term] with Subs[OptDepFuncDefn[W]] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, DepFunc[W, Term], FuncLike[W, Term], (W) => Term, Term, Subs[OptDepFuncDefn[W]], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. OptDepFuncDefn
  2. Serializable
  3. Product
  4. Equals
  5. DepFunc
  6. FuncLike
  7. Function1
  8. Term
  9. Subs
  10. AnyRef
  11. Any
Implicitly
  1. by RichTerm
  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 OptDepFuncDefn(func: (W) => Option[Term], dom: Typ[W])

Type Members

  1. type Cod = Term
    Definition Classes
    DepFunc
  2. type D = W
    Definition Classes
    DepFunc
  3. abstract type Obj <: FuncLike[W, Term]
    Definition Classes
    FuncLike

Value Members

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

    equality type 'term = rhs'

    equality type 'term = rhs'

    Implicit
    This member is added by an implicit conversion from OptDepFuncDefn[W] toRichTerm[OptDepFuncDefn[W]] performed by method RichTerm in provingground.HoTT.
    Definition Classes
    RichTerm
  4. def act(arg: W): Term

    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
    OptDepFuncDefn → DepFunc → FuncLike
  5. def andThen[A](g: (Term) => A): (W) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  6. def apply(arg: W): Term

    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
  7. def applyUnchecked(arg: W): Term
    Definition Classes
    FuncLike
  8. 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
  9. def compose[A](g: (A) => W): (A) => Term
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  10. lazy val depcodom: (W) => Typ[Term]
    Definition Classes
    OptDepFuncDefn → FuncLike
  11. def dependsOn(that: Term): Boolean

    returns whether this depends on that

    returns whether this depends on that

    Definition Classes
    Term
  12. val dom: Typ[W]
    Definition Classes
    OptDepFuncDefn → FuncLike
  13. lazy val fibers: Func[W, Typ[Term]]
    Definition Classes
    OptDepFuncDefn → DepFunc
  14. val func: (W) => Option[Term]
  15. def indepOf(that: Term): Boolean

    returns whether this is independent of that.

    returns whether this is independent of that.

    Definition Classes
    Term
  16. def newobj: OptDepFuncDefn[W]

    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
    OptDepFuncDefn → Subs
  17. def productElementNames: Iterator[String]
    Definition Classes
    Product
  18. def refl: Refl[OptDepFuncDefn[W]]

    reflexivity term refl : term = term

    reflexivity term refl : term = term

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

    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
  20. def subs(x: Term, y: Term): OptDepFuncDefn[W]

    substitute x by y recursively in this.

    substitute x by y recursively in this.

    Definition Classes
    OptDepFuncDefn → FuncLike → Subs
  21. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any
  22. lazy val typ: Typ[FuncLike[W, Term]]

    the HoTT-type of the term

    the HoTT-type of the term

    Definition Classes
    OptDepFuncDefn → FuncLike → Term
  23. 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