Simple Noninterference from Parametricity
Paper i proceeding, 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.

Författare

Maximilian Algehed

Chalmers, Data- och informationsteknik, Funktionell programmering

Jean-Philippe Bernardy

Programvaruteknik

Proceedings of the ACM on Programming Languages

2475-1421 (eISSN)

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

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1145/3341693

Mer information

Skapat

2019-10-25