Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

127

ENTCS
2002

118views more ENTCS 2002»

Rank 2 Types for Term Graph Rewriting

15 years 2 months ago

Rank 2 Types for Term Graph Rewriting

Download www.doc.ic.ac.uk

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.

Steffen van Bakel

Real-time Traffic

ENTCS 2002 | Polymorphic Intersection Types | Term Graph | Type Assignment |

claim paper

Related Content

» Rewriting in the partial algebra of typed terms modulo AC

» On Term Rewriting Systems Having a Rational Derivation

» Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

» On Typability for Rank2 Intersection Types with Polymorphic Recursion

» An inductive view of graph transformation

» Learning patterns in the dynamics of biological networks

» Parallel Independence in Hierarchical Graph Transformation

» Flexible and efficient querying and ranking on hyperlinked data sources

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	ENTCS
Authors	Steffen van Bakel

Comments (0)