Simple noninterference from parametricity

11Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

In this paper we revisit the connection between parametricity and noninterference. Our primary contribution is a proof of noninterference for a polyvariant variation of the Dependency Core Calculus of Abadi et al. in the Calculus of Constructions. The proof is modular: it leverages parametricity for the Calculus of Constructionsand the encoding of data abstraction using existential types.This perspective gives rise to simple and understandable proofs of noninterference from parametricity. All our contributions have been mechanised in the Agda proof assistant.

Cite

CITATION STYLE

APA

Algehed, M., & Bernardy, J. P. (2019). Simple noninterference from parametricity. Proceedings of the ACM on Programming Languages, 3(ICFP). https://doi.org/10.1145/3341693

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free