CPS Translating Inductive and Coinductive Types [Extended Abstract]

We investigate CPS translatability of typed al uli with indu tive and oindu tive types. We show that tenable Plotkin-style all-by-name CPS translations exist for simply typed al uli with a natural number type and stream types and, more generally, with arbitrary positive indu tive and oindu tive types. These translations also work in the presen e of ontrol operators and generalize for dependently typed al uli where ase-like eliminations are only allowed in non-dependent forms. No translation is possible along the same lines for small -types and sum types with dependent ase.