Abstract
Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped λ -calculus and Gödel’s T is presented and analysed in the coalgebraic framework of non-wellfounded terms with so-called repetition constructors. The primitive recursive normalization function is uniformly continuous w.r.t. the natural metric on non-wellfounded terms. Furthermore, the number of necessary repetition constructors is locally related to the number of reduction steps needed to reach the normal form (as represented by the Böhm tree) and its size. It is also shown how continuous normal forms relate to derivations of strong normalizability in the typed λ -calculus and how this leads to new bounds for the sum of the height of the reduction tree and the size of the normal form. Finally, the methods are extended to an infinitary λ -calculus with ω -rule and permutative conversions and this is used to derive a strong form of normalization for an iterative version of Gödel’s system T , leading to a value table semantics for number-theoretic functions.
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.
