Computational Types from a Logical Perspective

Moggi’s computational lambda calculus is a metalanguage for denotational semantics which arose from the observation that many dierent notions of computation have the categorical structure of a strong monad on a cartesian closed category. In this paper we show that the computational lambda calculus also arises naturally as the term calculus corresponding (by the Curry-Howard correspondence) to a novel intuitionistic modal propositional logic. We give natural deduction, sequent calculus and Hilbert-style presentations of this logic and prove strong normalisation and con uence results.