A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A λ-Calculus for Resource Separation
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
We present a typed λ-calculus for recording resource separation constraints between terms. The calculus contains a novel way of manipulating nested multi-place contexts augmented with constraints, allowing a concise presentation of the typing rules. It is an extension of the affine αλ-calculus. We give a semantics based on sets indexed by resources, and show how the calculus may be extended to handle non-symmetric relations with application to allowable information flow. Finally, we mention
doi:10.1007/978-3-540-27836-8_16
fatcat:qoxavcux4jekzmpnjiynwbzfku