We present a formulae-as-types interpretation of Subtractive Logic (i.e. bi-intuitionistic logic). From a computational standpoint, this calculus provides a type system for first-class coroutines (a restricted form of first-class continuations).