  The stack calculus is a functional language in which is in a Curry-Howard
correspondence with classical logic. It enjoys confluence but, as well as
Parigot's lambda-mu, does not admit the Bohm Theorem, typical of the
lambda-calculus. We present a simple extension of stack calculus which is for
the stack calculus what Saurin's Lambda-mu is for lambda-mu.
