Repr

abstract val P: P

abstract val table: P.Table

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map(f: (P.Table) ⇒ P.Table): Repr { type P = Repr.this.P.type }

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def unsafeCoerce[F[_ <: Cake]](term: F[Cake]): Task[F[P]]

Given a term which is a type derived from the generic cake, produce the equivalent term which is typed specific to the cake in this repr.

val transM: M[Cake#trans#TransSpec1] = cake.flatMap(_.trans.Single.Value)

def foo(repr: Repr) = for {
  trans <- repr.unsafeCoerce[λ[`P <: Cake` => P.trans.TransSpec1]](transM).liftM[MT]
} yield repr.table.transform(trans)

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit