Strong Normalization of Typeable Rewrite Systems

This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewrite Systems, that consists of assigning intersection types to function symbols, and specifying the way in which types can be assigned to nodes and edges between nodes in the tree representation of terms. Two operations on types are specified that are used to define type assignment on terms and rewrite rules, and are proven to be sound on both terms and rewrite rules. Using a more liberal approach to recursion, a general scheme for recursive definitions is presented, that generalizes primitive recursion, but has full Turing-machine computational power. It will be proved that, for all systems that satisfy this scheme, every typeable term is strongly normalizable.

• Type: Conference
• Year: 1993
• Where: HOA
• Authors: Steffen van Bakel, Maribel Fernández
• Keywords: HOA 1993, Intersection Types, Rewrite Systems, Theoretical Computer Science, Type Assignment