Faithful Translations between Polyvariant Flows and Polymorphic Types

OpenBU

Show simple item record

dc.contributor.author Amtoft, Torben en_US
dc.contributor.author Turbak, Franklyn en_US
dc.date.accessioned 2011-10-20T05:09:45Z
dc.date.available 2011-10-20T05:09:45Z
dc.date.issued 2000-01-10 en_US
dc.identifier.uri http://hdl.handle.net/2144/1796
dc.description.abstract Recent work has shown equivalences between various type systems and flow logics. Ideally, the translations upon which such equivalences are based should be faithful in the sense that information is not lost in round-trip translations from flows to types and back or from types to flows and back. Building on the work of Nielson & Nielson and of Palsberg & Pavlopoulou, we present the first faithful translations between a class of finitary polyvariant flow analyses and a type system supporting polymorphism in the form of intersection and union types. Additionally, our flow/type correspondence solves several open problems posed by Palsberg & Pavlopoulou: (1) it expresses call-string based polyvariance (such as k-CFA) as well as argument based polyvariance; (2) it enjoys a subject reduction property for flows as well as for types; and (3) it supports a flow-oriented perspective rather than a type-oriented one. en_US
dc.description.sponsorship National Science Foundation (EIA–9806747) en_US
dc.language.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-2000-001 en_US
dc.title Faithful Translations between Polyvariant Flows and Polymorphic Types en_US
dc.type Technical Report en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Advanced Search

Browse

Deposit Materials