New foundations for fixpoint computations

A novel higher-order typed constructive predicate logic for fixpoint computations which exploits the categorical semantics of computations introduced by E. Moggi (1989) and contains a strong version of P. Martin-Lof's (1983) iteration type is introduced. The type system enforces a separation of computations from values. The logic contains a novel form of fixpoint induction and can express partial and total correctness statements about evaluation of computations to values. The constructive nature of the logic is witnessed by strong metalogical properties which are proved using a category-theoretic version of the logical relations method.<<ETX>>