Abstract
Pure Pattern Type Systems (P2TS) combine the frameworks and capabilities of rewriting and λ-calculus within a unified setting. Their type systems, which are adapted from Barendregt's λ-cube, are especially interesting from a logical point of view. Until now, strong normalisation, which is an essential property for logical soundness, has only been conjectured: in this paper, we give a positive answer for the simply-typed system and the dependently-typed system.The proof is based on a translation of terms and types fromP2TSinto the λ-calculus. First, we deal with untyped terms, ensuring that reductions are faithfully mimicked in the λ-calculus. For this, we rely on an original encoding of the pattern matching capability ofP2TSinto the System Fω.Then we show how to translate types: the expressive power of System Fω is needed in order to fully reproduce the original typing judgments ofP2TS. We prove that the encoding is correct with respect to reductions and typing, and we conclude with the strong normalisation of simply-typedP2TSterms. The strong normalisation with dependent types is in turn obtained by an intermediate translation into simply-typed terms.
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.
