(Head-) Normalization of Typeable Rewrite Systems

In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable systems. On one hand, for all systems that satisfy a variant of the Jouannaud-Okada Recursion Scheme, every term typeable with a type that is not is head normalizable. On the other hand, non-Curryfied terms that are typeable with a type that does not contain , are normalizable.

• Type: Conference
• Year: 1995
• Where: RTA
• Authors: Steffen van Bakel, Maribel Fernández
• Keywords: Jouannaud-Okada Recursion Scheme, Normalization Properties, Rewrite Systems, RTA 1995, Theoretical Computer Science