topical slide(s): creative technology / new media / game development(s)

Type dependency -- is polymorphic

Let $F[%a] = { m_1:%s_1,...,m_j:%s_j }$ \zline{(type function)}
$P:\A %a <= F[%a].t -> F[%a]$
$P = %L %a <= F[%a].%l( self:%a ).{ m_1:e1,...,m_j:e_j }$

F-bounded constraint $%a <= F[%a]$ \n Object instantiation: $\Y(P[%s])$ for $%s = %m t.F[t]$ \n We have $P[%s]:%s -> F[%s]$ because $F[%s] = %s$

slide: Bounded type constraints