trait IndRecFunc[W <: Term with Subs[W], +U <: Term with Subs[U], F <: Term with Subs[F]] extends Func[W, U]
common trait for indexed recurion functions, for serialization and pretty printing.
- Alphabetic
- By Inheritance
- IndRecFunc
- Func
- FuncLike
- Function1
- Term
- Subs
- AnyRef
- Any
- by UnliftOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def act(arg: W): U
the action of the function to define: define this method, but use apply.
- abstract val codom: Typ[U]
codomain
codomain
- Definition Classes
- IndRecFunc → Func
- abstract val defnData: Vector[Term]
definition data for all introduction rules.
- abstract val dom: Typ[W]
domain
- abstract val domW: F
the dependent codomain on the family.
- abstract val index: Vector[Term]
indices of the introduction rules.
- abstract val intros: Vector[Term]
- 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
- abstract def subs(x: Term, y: Term): Func[W, U]
substitute x by y recursively in
this. - abstract val typ: Typ[Func[W, U]]
the HoTT-type of the term
Concrete Value Members
- def andThen[A](g: (U) => A): (W) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- 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.
- def applyUnchecked(arg: W): U
- Definition Classes
- FuncLike
- 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
- def compose[A](g: (A) => W): (A) => U
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- val depcodom: (W) => Typ[U]
- def dependsOn(that: Term): Boolean
returns whether
thisdepends onthatreturns whether
thisdepends onthat- Definition Classes
- Term
- def equals(that: Any): Boolean
- Definition Classes
- IndRecFunc → AnyRef → Any
- lazy val fullIndData: (F, Vector[Term], Typ[U], Vector[Term])
- def hashCode(): Int
- Definition Classes
- IndRecFunc → AnyRef → Any
- def indepOf(that: Term): Boolean
returns whether
thisis independent ofthat.returns whether
thisis independent ofthat.- Definition Classes
- Term
- 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
- def toString(): String
- Definition Classes
- IndRecFunc → Function1 → AnyRef → Any
- def unlift: PartialFunction[W, B]
- Implicit
- This member is added by an implicit conversion from IndRecFunc[W, U, F] 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
- def usesVar(t: Term): Boolean
returns whether the variable
tis used as a variable in a lambda definition.returns whether the variable
tis used as a variable in a lambda definition.- Definition Classes
- Term