Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus

DOI10.2168/LMCS-4(3:10)2008zbMath1151.03329OpenAlexW3105003009MaRDI QIDQ3535617

Naokata Shikuma, Atsushi Igarashi

Publication date: 13 November 2008

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-4(3:10)2008

zbMATH Keywords

noninterferencelogical relationssimply typed lambda-calculusdependency core calculussealing calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (2)

A dependent dependency calculus ⋮ Unnamed Item

This page was built for publication: Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus