The Simply-typed Pure Pattern Type System Ensures Strong Normalization - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

The Simply-typed Pure Pattern Type System Ensures Strong Normalization

Résumé

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.
Fichier non déposé

Dates et versions

inria-00100109 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100109 , version 1

Citer

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⟩
55 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More