A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Typed closure conversion preserves observational equivalence
2008
Proceeding of the 13th ACM SIGPLAN international conference on Functional programming - ICFP '08
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different language, this is true only if the translation process preserves observational equivalence. We investigate the problem of fully abstract compilation, i.e., compilation that both preserves and reflects observational equivalence. In particular, we prove that typed closure conversion for the polymorphic λ-calculus with
doi:10.1145/1411204.1411227
dblp:conf/icfp/AhmedB08
fatcat:6llfzaa55bbj7ol2dmtsixvcma