Faithful Translations between Polyvariant Flows and Polymorphic Types (2000)
Cached
Download Links
- [www.cs.bu.edu]
- [www.church-project.org]
- [www.church-project.org]
- [cs.wellesley.edu]
- [www.church-project.org]
- [www.church-project.org]
- [people.cis.ksu.edu]
- [www.cis.ksu.edu]
- [cs.wellesley.edu]
- [www.church-project.org]
- [www.cis.ksu.edu]
- [www.cis.ksu.edu]
- [people.cis.ksu.edu]
- [swissnet.ai.mit.edu]
- [cs.wellesley.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 11 - 2 self |
BibTeX
@MISC{Amtoft00faithfultranslations,
author = {Torben Amtoft and Ranklyn Turbak},
title = {Faithful Translations between Polyvariant Flows and Polymorphic Types},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recent work h& s h wn equivalences between various type systems and flow logics. Ideally, th translations upon wh= h such equivalences are basedshd&@ be faithful in th sense the information is not lost in round-trip translations from flows to types and back or from types to flows and back. Building on t h work of Nielson Nielson and of Palsberg Pavlopoulou, we present t h firstfaithT# translations between a class of finitary polyvariant flow analyses and a type system supporting polymorph@@ in th 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 perspectiverath# thh a type-oriented one. 1
