An environment machine for the $\lambda\mu$-calculus
Abstract
We introduce a natural deduction-like formalisation of Parigot's lambda mu -calculus. From this, we derive an environment machine that allows any well-typed lambda mu -term to be reduced to its weak head normal form.