Abstract
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 some future directions and questions we have about the calculus.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Areces, C., Blackburn, P.: Bringing them all together. Logic and Computation 11(5) (2001); Editorial of special issue on Hybrid Logics
Bechet, D., de Groote, P., Retoré, C.: A complete axiomatisation for the inclusion of series-parallel partial orders. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 230–240. Springer, Heidelberg (1997)
da, M., Corrêa, S., Haeusler, E.H., de Paiva, V.C.V.: A dialectica model of state. In: CATS 1996, Computing: The Australian Theory Symposium Proceedings (January 1996)
Day, B.J.: On closed categories of functors. In: Mac Lane, S. (ed.) Reports of the Midwest Category Seminar. Lecture Notes in Mathematics, vol. 137, pp. 1–38. Springer, Heidelberg (1970)
Hofmann, M.: A type system for bounded space and functional in-place update. Nordic Journal of Computing 7(4), 258–289 (2000)
Hofmann, M., Jost, S.: Static prediction of heap space usage for firstorder functional programs. In: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pp. 185–197. ACM Press, New York (2003)
Konečný, M.: Functional in-place update with layered datatype sharing. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 195–210. Springer, Heidelberg (2003)
Lane, S.M.: Categories for the Working Mathematician, 2nd edn. Springer, Heidelberg (1998)
O’Hearn, P.W.: On bunched typing. Journal of Functional Programming 13(4), 747–796 (2003)
O’Hearn, P.W., Power, A.J., Takeyama, M., Tennent, R.D.: Syntactic control of interference revisited. Theoretical Computer Science 228, 211–252 (1999)
Petersen, L., Harper, R., Crary, K., Pfenning, F.: A type theory for memory allocation and data layout. In: Morrisett, G. (ed.) Conference Record of the 30th Annual Symposium on Principles of Programming Languages (POPL 2003), January 2003, pp. 172–184. ACM Press, New York (2003)
Pym, D.J.: The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series, vol. 26. Kluwer Academic Publishers, Dordrecht (2002)
Reddy, U.: A linear logic model of state (October 1993), Electronic manuscript http://www.cs.bham.ac.uk/~udr/
Retoré, C.: Pomset logic: a non-commutative extension of classical linear logic. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 300–318. Springer, Heidelberg (1997)
Reynolds, J.C.: Syntactic control of interference. In: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages, pp. 39–46. ACM Press, New York (1978)
Reynolds, J.C.: Syntactic control of interference, part 2. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 704–722. Springer, Heidelberg (1989)
Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE Journal on Selected Areas in Communications 21(1), 5–19 (2003); Special issue on Formal Methods for Security
Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. SIAM Journal of Computing 11(2), 298–313 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atkey, R. (2004). A λ-Calculus for Resource Separation. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive