Skip to Main content Skip to Navigation
Conference papers

The Simply-typed Pure Pattern Type System Ensures Strong Normalization

Benjamin Wack 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Pure Pattern Type Systems (PPTS) combine in a unified setting the capabilities of rewriting and lambda-calculus. Their type systems, adapted from Barendregt's lambda-cube, are especially interesting from a logical point of view. Strong normalization, an essential property for logical soundness, had only been conjectured so far: in this paper, we give a positive answer for the simply-typed system. The proof is based on a translation of terms and types from PPTS into the lambda-calculus. First, we deal with untyped terms, ensuring that reductions are faithfully mimicked in the lambda-calculus. For this, we rely on an original encoding of the pattern matching capability of PPTS into the lambda-calculus. Then we show how to translate types: the expressive power of System F omega is needed in order to fully reproduce the original typing judgments of PPTS. We prove that the encoding is correct with respect to reductions and typing, and we conclude with the strong normalization of simply-typed PPTS terms.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:14:12 AM
Last modification on : Friday, February 26, 2021 - 3:28:05 PM


  • HAL Id : inria-00100109, version 1



Benjamin Wack. The Simply-typed Pure Pattern Type System Ensures Strong Normalization. 3rd IFIP International Conference on Theoretical Computer Science - TCS'2004, Jean-Jacques Lévy, 2004, Toulouse, France, pp.633-646. ⟨inria-00100109⟩



Record views