Packages

sealed abstract class IndexedIterFuncPtnMap[H <: Term with Subs[H], Fb <: Term with Subs[Fb], Index <: HList, C <: Term with Subs[C], F <: Term with Subs[F], TT <: Term with Subs[TT], DT <: Term with Subs[DT], IF <: Term with Subs[IF], IDF <: Term with Subs[IDF], IDFT <: Term with Subs[IDFT]] extends AnyRef

Indexed version of IterFuncPtnMap

Linear Supertypes
AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedIterFuncPtnMap
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def apply(W: Fb): Typ[F]

    returns the type corresponding to the pattern, such as A -> W, given the (inductive) type W, this is used mainly for constructor patterns, with the W being fixed.

  2. abstract def depTarget(xs: IDFT): (F) => Typ[DT]

    dependent target scala type.

  3. abstract val family: TypFamilyMap[H, Fb, C, Index, IF, IDF, IDFT]
  4. abstract def induced(f: IF): (F) => TT

    function induced by f: W -> X of type (A -> W) -> (A -> X) etc

    function induced by f: W -> X of type (A -> W) -> (A -> X) etc

    f

    function from which to induce

  5. abstract def inducedDep(f: IDF): (F) => DT

    dependent function induced by dependent f: W -> X(s) of type (A -> W) -> ((a : A) ~> Xs(a)) etc

    dependent function induced by dependent f: W -> X(s) of type (A -> W) -> ((a : A) ~> Xs(a)) etc

    f

    dependent function from which to induce

  6. abstract def subs(x: Term, y: Term): IndexedIterFuncPtnMap[H, Fb, Index, C, F, TT, DT, IF, IDF, IDFT]
  7. abstract def target(x: Typ[C]): Typ[TT]

    target scala type.

  8. abstract val univLevel: Int

    the universe containing the type