Simple Noninterference from Parametricity
Paper in proceedings, 2019

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 in the Calculus of Constructions. The proof is modular: it leverages parametricity for the Calculus of Constructions and 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.

Author

Maximilian Algehed

Chalmers, Computer Science and Engineering (Chalmers), Functional Programming

Jean-Philippe Bernardy

University of Gothenburg

Proceedings of the ACM on Programming Languages

2475-1421 (eISSN)

Vol. 3

International Conference on Functional Programming (ICFP)
Berlin, Germany,

Subject Categories

Computer and Information Science

DOI

10.1145/3341693

More information

Latest update

4/13/2021