作者: Jean-Philippe Bernardy , Maximilian Algehed , Catalin Hritcu
DOI:
关键词: Programming language 、 Parametricity 、 Cover (topology) 、 Soundness 、 Agda 、 Abstraction (linguistics) 、 Computer science 、 Type (model theory) 、 Proof assistant 、 Mathematical proof
摘要: We show that noninterference and transparency, the key soundness theorems for dynamic IFC libraries, can be obtained "for free", as direct consequences of more general parametricity theorem type abstraction. This allows us to give very short proofs libraries such faceted values LIO. Our stay even when fully mechanized in Agda proof assistant. Moreover, our cover actual implementations not just an abstract model.