HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 favors 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

Contributor : Scherer Gabriel Connect in order to contact the contributor
Submitted on : Friday, November 29, 2013 - 3:41:26 PM
Last modification on : Friday, February 4, 2022 - 3:13:49 AM
Long-term archiving on: : Monday, March 3, 2014 - 8:01:11 PM


Files produced by the author(s)


  • HAL Id : hal-00911656, version 1
  • ARXIV : 1312.0018



Gabriel Scherer, Jan Hoffmann. Tracking Data-Flow with Open Closure Types. LPAR 2013 - 19th International Conference Logic for Programming, Artificial Intelligence, and Reasoning, Dec 2013, Stellenbosch, South Africa. pp.710-726. ⟨hal-00911656⟩



Record views


Files downloads