## Rank 2 Intersection Type Assignment in Term Rewriting Systems (1996)

### Cached

### Download Links

- [pubs.doc.ic.ac.uk]
- [dev.pubs.doc.ic.ac.uk]
- [schiele.doc.ic.ac.uk]
- [www.doc.ic.ac.uk]
- DBLP

### Other Repositories/Bibliography

Citations: | 22 - 14 self |

### BibTeX

@MISC{Bakel96rank2,

author = {Steffen van Bakel},

title = {Rank 2 Intersection Type Assignment in Term Rewriting Systems},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

A notion of type assignment on Curryfied Term Rewriting Systems is introduced that uses Intersection Types of Rank 2, and in which all function symbols are assumed to have a type. Type assignment will consist of specifying derivation rules that describe how types can be assigned to terms, using the types of function symbols. Using a modified unification procedure, for each term the principal pair (of basis and type) will be defined in the following sense: from these all admissible pairs can be generated by chains of operations on pairs, consisting of the operations substitution, copying, and weakening. In general, given an arbitrary typeable CuTRS, the subject reduction property does not hold. Using the principal type for the left-hand side of a rewrite rule, a sufficient and decidable condition will be formulated that typeable rewrite rules should satisfy in order to obtain this property. Introduction In the recent years, several paradigms have been investigated for the implementatio...