Computing Publications

Publications Home » Rank 2 Type Assignment for Applic...

Rank 2 Type Assignment for Applicative Term Graph Rewriting

Steffen van Bakel

Conference or Workshop Paper
Workshop on Types in Programming (TIP'02), Dagstuhl, Germany
July, 2002
Electronic Notes in Theoretical Computer Science
Volume 75
pp.1–20
Elsevier
DOI 10.1016/S1571-0661(04)80776-X
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 [Bakel-Barbanera-Fernandez-Types'00], a notion of principal pair which generalizes ML's principal type property.

PDF of full publication (272 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.