Paper: Strong Normalization as Safe Interaction (at LICS 2007)

Authors: Colin Riba

Abstract

When enriching the \lambda -calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (\vee E) of union types may also allow to type non normalizing terms (in which case we say that (\vee E) is unsafe). This occurs in particular with non-determinism, but also with some confluent systems. It appears that studying the safety of (\vee E) amounts to the characterization, in a term, of safe interactions between some of its subterms. In this paper, we study the safety of (\vee E) for an extension of the \lambda-calculus with simple rewrite rules. We prove that the union and intersection type discipline without (\vee E) is complete w.r.t. strong normalization. This allows to show that (\vee E) is safe if and only if an interpretation of types based on biorthogonals is sound for it. We also discuss two sufficient conditions for the safety of (\vee E), and study an alternative biorthogonality relation, based on the observation of the least reducibility candidate.

BibTeX

  @InProceedings{Riba-StrongNormalization,
    author = 	 {Colin Riba},
    title = 	 {Strong Normalization as Safe Interaction},
    booktitle =  {Proceedings of the Twenty-Second Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
    year =	 {2007},
    month =	 {July}, 
    pages =      {13--22},
    location =   {Wroclaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }