## Rank 2 Types for Term Graph Rewriting (Extended Abstract)

### Cached

### Download Links

by
Steffen van Bakel

Citations: | 3 - 3 self |

### BibTeX

@MISC{Bakel_rank2,

author = {Steffen van Bakel},

title = {Rank 2 Types for Term Graph Rewriting (Extended Abstract)},

year = {}

}

### OpenURL

### Abstract

We define a notion of type assignment with polymorphic intersection types of rank 2 fora term graph rewriting language that expresses sharing and cycles. We show that type assignment is decidable through defining, using the extended notion of unification from [5],a notion of principal pair which generalizes ml's principal type property.