Share This Author
Blame for all
This work presents a system that permits a value of dynamic type to be cast to a polymorphic type and vice versa, with relational parametricity enforced by a kind of dynamic sealing along the lines proposed by Matthews and Ahmed (2008) and Neis, Dreyer, and Rossberg (2009).
State-dependent representation independence
This paper develops a possible-worlds model in which relational interpretations of types are allowed to grow over time in a manner that is tightly coupled with changes to some local state, and employs a step-indexed stratification of possible worlds, which facilitates a simplified account of mutable references of higher type.
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
- A. Ahmed
- Computer ScienceESOP
- 27 March 2006
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a λ-calculus with recursive types and impredicative…
An equivalence-preserving CPS translation via multi-language semantics
This paper gives a CPS translation from a less expressive source language to a more expressive target language and proves that the translation preserves observational equivalence, and demonstrates how to prove that for every target term of type σ+, there exists an equivalent source term oftype σ- even when sub-terms of the target term are not necessarily "back-translatable" themselves.
L3: A Linear Language with Locations
We present a simple, but expressive type system that supports strong updates - updating a memory cell to hold values of unrelated types at different points in time. Our formulation is based upon a…
Noninterference for free
A translation from DCC into Fω is presented and it is proved that the translation preserves noninterference and a notion of observer-sensitive equivalence is defined that makes essential use of both first-order and higher-order polymorphism.
Semantics of types for mutable state
- A. Ahmed
- Computer Science
This thesis demonstrates the use of logical relations for proving the soundness of type systems for mutable state and presents a semantic model for a region calculus that supports type-invariant references as well as memory reuse.
Typed closure conversion preserves observational equivalence
It is proved that typed closure conversion for the polymorphic »-calculus with existential and recursive types is fully abstract, i.e., compilation that both preserves and reflects observational equivalence.
Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
This paper shows how to extend System F's parametricity guarantee to a Matthews-Findler-style multi-language system that combines System F with an untyped language by use of dynamic sealing and shows a scheme for implementing parametric higher-order contracts in anUntyped setting which corresponds to a translation given by Sumii and Pierce.
Fully abstract compilation via universal embedding
This work proves the first full abstraction result for a translation whose target language contains exceptions, but the source does not, and presents a new back-translation technique based on a shallow embedding of the target language into the source language at a dynamic type.