Choreographic programming is becoming complex. To remain useful, choreography languages will need to accrete features like process polymorphism, fully out-of-order execution, and dynamic topologies—but many of these features increase the burden on the programmer and the compiler writer. In an effort to simplify choreographies without hampering expressivity, we present poroutines (partial order routines). Poroutines resemble choreographies, but they omit communication and data locality—leaving both to be handled under the hood by the compiler. In this talk, we briefly describe Poutine: a prototype compiler that adds poroutines to Scala 3. A key insight in Poutine is that choreographies can be used as an intermediate representation; we survey several novel opportunities for compiler optimization that this presents.