Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 18
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Courtault, Jean-René Galmiche, Didier and Pym, David 2016. A logic of separating modalities. Theoretical Computer Science, Vol. 637, p. 30.

    Kamide, Norihiro 2016. Bunched sequential information. Journal of Applied Logic, Vol. 15, p. 150.

    Kamide, Norihiro 2015. Single-succedent System Approach to Boolean BI. Procedia Computer Science, Vol. 60, p. 27.

    O'Hearn, Peter 2015. 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science. p. 17.

    Staton, Sam 2015. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15. p. 395.

    Staton, Sam 2015. Algebraic Effects, Linearity, and Quantum Programming Languages. ACM SIGPLAN Notices, Vol. 50, Issue. 1, p. 395.

    Thielecke, Hayo 2014. On the semantics of parsing actions. Science of Computer Programming, Vol. 84, p. 52.

    Kamide, Norihiro 2013. Inconsistency-Tolerant Bunched Implications. International Journal of Approximate Reasoning, Vol. 54, Issue. 2, p. 343.

    Kamide, Norihiro 2013. Temporal BI: Proof system, semantics and translations. Theoretical Computer Science, Vol. 492, p. 40.

    Staton, Sam 2013. 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. p. 519.

    PARK, SUNGWOO and IM, HYEONSEUNG 2011. A calculus for hardware description. Journal of Functional Programming, Vol. 21, Issue. 01, p. 21.

    Cheney, James 2009. A Simple Nominal Type Theory. Electronic Notes in Theoretical Computer Science, Vol. 228, p. 37.

    Jiang, Xinyu Guo, Yu and Chen, Yiyun 2009. 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering. p. 209.

    Staton, Sam 2009. Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names. Electronic Notes in Theoretical Computer Science, Vol. 249, p. 471.

    COLLINSON, MATTHEW PYM, DAVID and ROBINSON, EDMUND 2008. Bunched polymorphism. Mathematical Structures in Computer Science, Vol. 18, Issue. 06, p. 1091.

    Power, John 2007. Abstract Syntax: Substitution and Binders. Electronic Notes in Theoretical Computer Science, Vol. 173, p. 3.

    Collinson, Matthew and Pym, David 2006. Bunching for Regions and Locations. Electronic Notes in Theoretical Computer Science, Vol. 158, p. 171.

    Pym, David J. O'Hearn, Peter W. and Yang, Hongseok 2004. Possible worlds and resources: the semantics of BI. Theoretical Computer Science, Vol. 315, Issue. 1, p. 257.


On bunched typing

  • PETER O'HEARN (a1)
  • DOI:
  • Published online: 01 July 2003

We study a typing scheme derived from a semantic situation where a single category possesses several closed structures, corresponding to different varieties of function type. In this scheme typing contexts are trees built from two (or more) binary combining operations, or in short, bunches. Bunched typing and its logical counterpart, bunched implications, have arisen in joint work of the author and David Pym. The present paper gives a basic account of the type system, and then focusses on concrete models that illustrate how it may be understood in terms of resource access and sharing. The most basic system has two context-combining operations, and the structural rules of Weakening and Contraction are allowed for one but not the other. This system includes a multiplicative, or substructural, function type −∗ alongside the usual (additive) function type $\rightarrow$; it is dubbed the $\alpha\lambda$-calculus after its binders, $\alpha$ for the $\alpha$dditive binder and $\lambda$ for the multiplicative, or $\lambda$inear, binder. We show that the features of this system are, in a sense, complementary to calculi based on linear logic; it is incompatible with an interpretation where a multiplicative function uses its argument once, but perfectly compatible with a reading based on sharing of resources. This sharing interpretation is derived from syntactic control of interference, a type-theoretic method of controlling sharing of storage, and we show how bunch-based management of Contraction can be used to provide a more flexible type system for interference control.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *