BibTeX
@MISC{Bakel_rank2,
author = {Steffen Van Bakel},
title = {Rank 2 Types for Term Graph Rewriting},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We define a notion of type assignment with polymorphic intersection types of rank 2 for a 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.
