case class Rec[U <: Term with Subs[U]](init: U, g: Func[Nat, Func[U, U]]) extends RecFunc[Nat, U] with Product with Serializable
- Alphabetic
- By Inheritance
- Rec
- Serializable
- Product
- Equals
- RecFunc
- Func
- FuncLike
- Function1
- Term
- Subs
- AnyRef
- Any
- by UnliftOps
- by orderingToOrdered
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Rec[U], B)
- def <(that: Rec[U]): Boolean
- def <=(that: Rec[U]): Boolean
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def >(that: Rec[U]): Boolean
- def >=(that: Rec[U]): Boolean
- def act(x: Nat): U
the action of the function to define: define this method, but use apply.
- def andThen[A](g: (U) => A): (Nat) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def apply(arg: Nat): 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: Nat): U
- Definition Classes
- FuncLike
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def baseFunction: ExstFunc
- Definition Classes
- RecFunc
- def canApply(arg: Nat): 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 clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- val codom: Typ[U]
codomain
- def compare(that: Rec[U]): Int
- def compareTo(that: Rec[U]): Int
- def compose[A](g: (A) => Nat): (A) => U
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- val defnData: Vector[Term]
definition data for all introduction rules.
- val depcodom: (Nat) => Typ[U]
- def dependsOn(that: Term): Boolean
returns whether
thisdepends onthatreturns whether
thisdepends onthat- Definition Classes
- Term
- val dom: NatRing.LocalTyp.type
domain
- def ensuring(cond: (Rec[U]) => Boolean, msg: => Any): Rec[U]
- def ensuring(cond: (Rec[U]) => Boolean): Rec[U]
- def ensuring(cond: Boolean, msg: => Any): Rec[U]
- def ensuring(cond: Boolean): Rec[U]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- RecFunc → AnyRef → Any
- def formatted(fmtstr: String): String
- def fromData(data: Vector[Term]): RecFunc[Nat, U]
- lazy val fullData: (Typ[Nat], Typ[U], Vector[Term])
- Definition Classes
- RecFunc
- val g: Func[Nat, Func[U, U]]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def h: (SafeLong) => Func[U, U]
- def hashCode(): Int
- Definition Classes
- RecFunc → AnyRef → Any
- def indepOf(that: Term): Boolean
returns whether
thisis independent ofthat.returns whether
thisis independent ofthat.- Definition Classes
- Term
- val init: U
- lazy val intros: Vector[Term]
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newobj: Rec[U]
A new object with the same type, to be used in place of a variable to avoid name clashes.
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def replace(x: Term, y: Term): Func[Nat, U] with Subs[Func[Nat, 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 subs(x: Term, y: Term): Rec[U]
substitute x by y recursively in
this. - final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- RecFunc → Function1 → AnyRef → Any
- val typ: FuncTyp[Nat, U]
the HoTT-type of the term
- def unlift: PartialFunction[Nat, B]
- def usesVar(t: Term): Boolean
returns whether the variable
tis used as a variable in a lambda definition. - final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def →[B](y: B): (Rec[U], B)
- Implicit
- This member is added by an implicit conversion from Rec[U] toArrowAssoc[Rec[U]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if U is a subclass of Option[Nothing] (U <: Option[Nothing]).
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.