We present a proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a λ-calculus with recursive types and impredicative universal and existential… (More)
We present a language that integrates statically and dynamically typed components, similar to the gradual types of Siek and Taha (2006), and extend it to incorporate parametric polymorphism. Our… (More)
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstract data type can be shown… (More)
Predicates and Mutable ADTs in Hoare Type Theory The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Nanevski,… (More)
We show how to extend System F’s parametricity guarantee to a MatthewsFindler-style multi-language system that combines System F with an untyped language by use of dynamic sealing. While the use of… (More)
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… (More)
Provenance as dependency analysis†JAMES CHENEY‡, AMAL AHMED§ and UMUT A. ACAR¶ ‡Laboratory for Foundations of Computer Science, University of Edinburgh, Informatics Forum, 10 Crichton Street,… (More)
Language-based security relies on the assumption that all potential attacks follow the rules of the language in question. When programs are compiled into a different language, this is true only if… (More)
Fine-grained concurrent data structures (or FCDs) reduce the granularity of critical sections in both time and space, thus making it possible for clients to access different parts of a mutable data… (More)