@inproceedings{7f08f1ac187b4d17bb75fb1203eb47d4,
title = "Tracking data-flow with open closure types",
abstract = "Type systems hide data that is captured by function closures in function types. In most cases this is a beneficial design that enables simplicity and compositionality. However, some applications require explicit information about the data that is captured in closures. This paper introduces open closure types, that is, function types that are decorated with type contexts. They are used to track data-flow from the environment into the function closure. A simply-typed lambda calculus is used to study the properties of the type theory of open closure types. A distinctive feature of this type theory is that an open closure type of a function can vary in different type contexts. To present an application of the type theory, it is shown that a type derivation establishes a simple non-interference property in the sense of information-flow theory. A publicly available prototype implementation of the system can be used to experiment with type derivations for example programs.",
keywords = "Closure types, Information flow, Type systems",
author = "Gabriel Scherer and Jan Hoffmann",
year = "2013",
month = dec,
day = "1",
doi = "10.1007/978-3-642-45221-5\_47",
language = "English",
isbn = "9783642452208",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "710--726",
booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR 2013, Proceedings",
note = "19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2013 ; Conference date: 14-12-2013 Through 19-12-2013",
}