Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus (Q3535617): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:43, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus |
scientific article |
Statements
Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus (English)
0 references
13 November 2008
0 references
dependency core calculus
0 references
noninterference
0 references
sealing calculus
0 references
simply typed lambda-calculus
0 references
logical relations
0 references
