sealed abstract class IndexedConstructorSeqDom[SS <: HList, H <: Term with Subs[H], F <: Term with Subs[F], Index <: HList, Intros <: HList] extends AnyRef
Essentially the definition of an indexed inductive type;
- SS
shape sequence- H
the scala type of terms in an inductive type of this shape
- Intros
the scala type of the introduction rules
Linear Supertypes
Known Subclasses
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- IndexedConstructorSeqDom
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Abstract Value Members
- abstract val W: F
the inductive type family
- abstract val family: TypFamilyPtn[H, F, Index]
the index family
- abstract val intros: Intros
the introduction rules
- abstract def mapped[C <: Term with Subs[C], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]](implicit fmlyMapper: TypFamilyMapper[H, F, C, Index, IF, IDF, IDFT]): IndexedConstructorSeqMap[C, H, RecType, InducType, Intros, F, Index, IF, IDF, IDFT] forSome {type RecType <: Term with Subs[RecType], type InducType <: Term with Subs[InducType]}
existentitally typed lift given codomain
- abstract def subs(x: Term, y: Term): IndexedConstructorSeqDom[SS, H, F, Index, Intros]
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 IndexedConstructorSeqDom[SS, H, F, Index, Intros] toany2stringadd[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (IndexedConstructorSeqDom[SS, H, F, Index, Intros], B)
- Implicit
- This member is added by an implicit conversion from IndexedConstructorSeqDom[SS, H, F, Index, Intros] toArrowAssoc[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def ensuring(cond: (IndexedConstructorSeqDom[SS, H, F, Index, Intros]) => Boolean, msg: => Any): IndexedConstructorSeqDom[SS, H, F, Index, Intros]
- Implicit
- This member is added by an implicit conversion from IndexedConstructorSeqDom[SS, H, F, Index, Intros] toEnsuring[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (IndexedConstructorSeqDom[SS, H, F, Index, Intros]) => Boolean): IndexedConstructorSeqDom[SS, H, F, Index, Intros]
- Implicit
- This member is added by an implicit conversion from IndexedConstructorSeqDom[SS, H, F, Index, Intros] toEnsuring[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): IndexedConstructorSeqDom[SS, H, F, Index, Intros]
- Implicit
- This member is added by an implicit conversion from IndexedConstructorSeqDom[SS, H, F, Index, Intros] toEnsuring[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): IndexedConstructorSeqDom[SS, H, F, Index, Intros]
- Implicit
- This member is added by an implicit conversion from IndexedConstructorSeqDom[SS, H, F, Index, Intros] toEnsuring[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from IndexedConstructorSeqDom[SS, H, F, Index, Intros] toStringFormat[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def getInduc[C <: Term with Subs[C], IDFT <: Term with Subs[IDFT], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], RecType <: Term with Subs[RecType], InducType <: Term with Subs[InducType]](X: Typ[C])(implicit mapper: IndexedConstructorSeqMapper[SS, C, H, RecType, InducType, Intros, F, Index, IF, IDF, IDFT]): (IDFT) => InducType
- def getMapper[C <: Term with Subs[C], IDFT <: Term with Subs[IDFT], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], RecType <: Term with Subs[RecType], InducType <: Term with Subs[InducType]](X: Typ[C])(implicit mapper: IndexedConstructorSeqMapper[SS, C, H, RecType, InducType, Intros, F, Index, IF, IDF, IDFT]): IndexedConstructorSeqMap[C, H, RecType, InducType, Intros, F, Index, IF, IDF, IDFT]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def induc[IDFT <: Term with Subs[IDFT], C <: Term with Subs[C], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], RecType <: Term with Subs[RecType], InducType <: Term with Subs[InducType]](Xs: IDFT)(implicit mapper: IndexedConstructorSeqMapper[SS, C, H, RecType, InducType, Intros, F, Index, IF, IDF, IDFT]): InducType
induction function based on implicits
- def inducE[IDFT <: Term with Subs[IDFT]](Xs: IDFT): InducType forSome {type InducType <: Term with Subs[InducType]}
existentitally typed induction function
- 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 rec[C <: Term with Subs[C], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT], RecType <: Term with Subs[RecType], InducType <: Term with Subs[InducType]](X: Typ[C])(implicit mapper: IndexedConstructorSeqMapper[SS, C, H, RecType, InducType, Intros, F, Index, IF, IDF, IDFT]): RecType
recursion function definition based on implcits
- def recE[C <: Term with Subs[C]](x: Typ[C]): RecType forSome {type RecType <: Term with Subs[RecType]}
existentitally typed recursion function definition
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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])
- def |:[HShape <: HList, HC <: Term with Subs[HC]](head: IndexedConstructor[HShape, H, F, HC, Index]): IndexedConstructorSeqDom[::[HShape, SS], H, F, Index, ::[HC, Intros]]
prepend introduction rule
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def →[B](y: B): (IndexedConstructorSeqDom[SS, H, F, Index, Intros], B)
- Implicit
- This member is added by an implicit conversion from IndexedConstructorSeqDom[SS, H, F, Index, Intros] toArrowAssoc[IndexedConstructorSeqDom[SS, H, F, Index, Intros]] performed by method ArrowAssoc in scala.Predef.
- 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.