DMCA
Translating Dependency into Parametricity
Cached
Download Links
- [www.cis.upenn.edu]
- [www.cis.upenn.edu]
- [www.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In: ACM International Conference on Functional Programming |
| Citations: | 32 - 3 self |
BibTeX
@INPROCEEDINGS{Tse_translatingdependency,
author = {Stephen Tse and Steve Zdancewic},
title = {Translating Dependency into Parametricity},
booktitle = {In: ACM International Conference on Functional Programming},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and function call tracking. DCC uses a lattice of monads and a nonstandard typing rule for their associated bind operations to describe the dependency of computations in a program. Abadi et al. proved a noninterference theorem that establishes the correctness of DCC’s type system and thus the correctness of the type systems for the analyses above. In this paper, we study the relationship between DCC and the Girard-Reynolds polymorphic lambda calculus (System F). We encode the recursion-free fragment of DCC into F via a type-directed translation. Our main theoretical result is that, following from the correctness of the translation, the parametricity theorem for F implies the noninterference theorem for DCC. In addition, the translation provides insights into DCC’s type system and suggests implementation strategies of dependency calculi in polymorphic languages.
Keyphrases
type system noninterference theorem type-directed translation dependency calculus function call tracking unifying framework polymorphic language implementation strategy dependency core calculus information flow parametricity theorem associated bind operation girard-reynolds polymorphic lambda calculus recursion-free fragment nonstandard typing rule binding time main theoretical result many important program analysis
