trait RecursiveDefinition[H <: Term with Subs[H], C <: Term with Subs[C]] extends RecFunc[H, C]
recursively defined function, to be built by mixing in cases, defaults to a formal application by itself
- Self Type
- RecursiveDefinition[H, C]
Linear Supertypes
Known Subclasses
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- RecursiveDefinition
- RecFunc
- Func
- FuncLike
- Function1
- Term
- Subs
- AnyRef
- Any
Implicitly
- by UnliftOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Abstract Value Members
- abstract def caseFn(f: => Func[H, C])(arg: H): Option[C]
the optional recursive definition if a case is matched
- abstract val codom: Typ[C]
codomain
codomain
- Definition Classes
- Func
- abstract def dataSubs(that: RecursiveDefinition[H, C], x: Term, y: Term): RecursiveDefinition[H, C]
- abstract val defnData: Vector[Term]
definition data for all introduction rules.
definition data for all introduction rules.
- Definition Classes
- RecFunc
- abstract val dom: Typ[H]
domain
- abstract def fromData(data: Vector[Term]): RecursiveDefinition[H, C]
- Definition Classes
- RecursiveDefinition → RecFunc
- abstract val intros: Vector[Term]
- Definition Classes
- RecFunc
- abstract def newobj: Func[H, C] with Subs[Func[H, C]]
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 rebuilt: RecursiveDefinition[H, C]
- abstract def subs(x: Term, y: Term): RecursiveDefinition[H, C]
substitute x by y recursively in
this.substitute x by y recursively in
this.- Definition Classes
- RecursiveDefinition → Func → FuncLike → Subs
- abstract val typ: Typ[Func[H, C]]
the HoTT-type of the term
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toany2stringadd[RecursiveDefinition[H, C]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (RecursiveDefinition[H, C], B)
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toArrowAssoc[RecursiveDefinition[H, C]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if C is a subclass of Option[Nothing] (C <: Option[Nothing]).
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def act(arg: H): C
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
- RecursiveDefinition → Func → FuncLike
- def andThen[A](g: (C) => A): (H) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def apply(arg: H): C
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: H): C
- Definition Classes
- FuncLike
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def baseFunction: ExstFunc
- Definition Classes
- RecFunc
- def canApply(arg: H): 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()
- def compose[A](g: (A) => H): (A) => C
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- val depcodom: (H) => Typ[C]
- def dependsOn(that: Term): Boolean
returns whether
thisdepends onthatreturns whether
thisdepends onthat- Definition Classes
- Term
- def ensuring(cond: (RecursiveDefinition[H, C]) => Boolean, msg: => Any): RecursiveDefinition[H, C]
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toEnsuring[RecursiveDefinition[H, C]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (RecursiveDefinition[H, C]) => Boolean): RecursiveDefinition[H, C]
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toEnsuring[RecursiveDefinition[H, C]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): RecursiveDefinition[H, C]
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toEnsuring[RecursiveDefinition[H, C]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): RecursiveDefinition[H, C]
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toEnsuring[RecursiveDefinition[H, C]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- RecFunc → AnyRef → Any
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toStringFormat[RecursiveDefinition[H, C]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
- lazy val fullData: (Typ[H], Typ[C], Vector[Term])
- Definition Classes
- RecFunc
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- 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
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def replace(x: Term, y: Term): Func[H, C] with Subs[Func[H, C]]
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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- RecFunc → Function1 → AnyRef → Any
- def unlift: PartialFunction[H, B]
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toUnliftOps[H, B] performed by method UnliftOps in scala.Function1.This conversion will take place only if C is a subclass of Option[B] (C <: Option[B]).
- Definition Classes
- UnliftOps
- 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): (RecursiveDefinition[H, C], B)
- Implicit
- This member is added by an implicit conversion from RecursiveDefinition[H, C] toArrowAssoc[RecursiveDefinition[H, C]] performed by method ArrowAssoc in scala.Predef.This conversion will take place only if C is a subclass of Option[Nothing] (C <: 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.