Abstract
This paper introduces a new higher-order typed constructive predicate logic for fixpoint computations, which exploits the categorical semantics of computations introduced by Moggi ( in “Proceedings, 4th Annual Symposium on Logic in Computer Science,” pp. 14–23, IEEE Comput. Soc. Press, Washington, 1989) and contains a version of Martin-Löf's “iteration type” ( in “Proceedings, Workshop on Semantics in Programming Laguages,” Chalmers University, 1983) . 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 ( Plotkin, unpublished lecture notes from CSLI Summer School, 1985 ).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
