Work

Information flow inference for ML

Year: 2003
Type: article
Abstract: This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions and let-polymorphism, which we refer to as ML. The type system is constraint-based and has decidable type inference. Its noninterference proof is reasonably light-weight, thanks to the use of a number of orthogonal techniques. First, a syntactic segregation between values and expressions allows a lighter formulation of the type system. Second, noninterference is reduced to subject reduction for a nonstandard language extension. Lastly, a semi-syntactic approach to type soundness allows dealing with constraint-based polymorphism separately.
Language: English
Subfield: Software
Open Access status: bronze
OpenAlex ID: W2061056245
FWCI: 25.31
Cites: 33
Cited by: 278
Related to: 10