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

    Goncharov, Sergey Rauch, Christoph and Schröder, Lutz 2015. Unguarded Recursion on Coinductive Resumptions. Electronic Notes in Theoretical Computer Science, Vol. 319, p. 183.

    Goncharov, Sergey and Schröder, Lutz 2013. A coinductive calculus for asynchronous side-effecting processes. Information and Computation, Vol. 231, p. 204.

    Goncharov, Sergey and Schroder, Lutz 2013. 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science. p. 273.

    Lack, Stephen 2012. Non-canonical isomorphisms. Journal of Pure and Applied Algebra, Vol. 216, Issue. 3, p. 593.

    COCKETT, ROBIN and LACK, STEPHEN 2007. Restriction categories III: colimits, partial limits and extensivity. Mathematical Structures in Computer Science, Vol. 17, Issue. 04, p. 775.

    Fiore, Marcelo Di Cosmo, Roberto and Balat, Vincent 2006. Remarks on isomorphisms in typed lambda calculi with empty and sum types. Annals of Pure and Applied Logic, Vol. 141, Issue. 1-2, p. 35.

    Jacobs, Bart 2006. Distributive laws for the coinductive solution of recursive equations. Information and Computation, Vol. 204, Issue. 4, p. 561.

    Levy, Paul Blain 2006. Monads and Adjunctions for Global Exceptions. Electronic Notes in Theoretical Computer Science, Vol. 158, p. 261.

    Gumm, H.Peter Hughes, Jesse and Schröder, Tobias 2003. Distributivity of categories of coalgebras. Theoretical Computer Science, Vol. 308, Issue. 1-3, p. 131.

    Levy, Paul Blain 2003. Adjunction Models For Call-By-Push-Value With Stacks. Electronic Notes in Theoretical Computer Science, Vol. 69, p. 248.

    Santocanale, Luigi 2003. Logical Construction of Final Coalgebras. Electronic Notes in Theoretical Computer Science, Vol. 82, Issue. 1, p. 321.

    Cockett, J.R.B. and Lack, Stephen 2002. Restriction categories I: categories of partial maps. Theoretical Computer Science, Vol. 270, Issue. 1-2, p. 223.

    Fiore, M. Di Cosmo, R. and Balat, V. 2002. Proceedings 17th Annual IEEE Symposium on Logic in Computer Science. p. 147.

    Carboni, A. Pedicchio, M.C. and Rosický, J. 2001. Syntactic characterizations of various classes of locally presentable categories. Journal of Pure and Applied Algebra, Vol. 161, Issue. 1-2, p. 65.

    Lack, Stephen and Vitale, E.M. 2001. When do completion processes give rise to extensive categories?. Journal of Pure and Applied Algebra, Vol. 159, Issue. 2-3, p. 203.

    Scott, P.J. 2000.

    Cockett, J.R.B. and Spooner, David A. 1997. Constructing process categories. Theoretical Computer Science, Vol. 177, Issue. 1, p. 73.

    Cockett, J.R.B. and Seely, R.A.G. 1997. Weakly distributive categories. Journal of Pure and Applied Algebra, Vol. 114, Issue. 2, p. 133.

    Blute, R. F. Cockett, J. R. B. and Seely, R. A. G. 1996. ! and ? – Storage as tensorial strength. Mathematical Structures in Computer Science, Vol. 6, Issue. 04, p. 313.

    Cockett, J.R.B. and Spooner, D.A. 1995. Categories for synchrony and asynchrony. Electronic Notes in Theoretical Computer Science, Vol. 1, p. 66.

  • Mathematical Structures in Computer Science, Volume 3, Issue 3
  • September 1993, pp. 277-307

Introduction to distributive categories

  • J. R. B. Cockett (a1)
  • DOI:
  • Published online: 01 March 2009

Distributive category theory is the study of categories with two monoidal structures, one of which “distributes” over the other in some manner. When these are the product and coproduct, this distribution is taken to be the law

which asserts that the obvious canonical map has an inverse. A distributive category is here taken to mean a category with finite products and binary coproducts such that this law is satisfied.

In any distributive category the coproduct of the final object with itself, 1 + 1, forms a boolean algebra. Thus, maps into 1 + 1 provide a boolean logic: if each such map recognizes a unique subobject, the category is a recognizable distributive category. If, furthermore, the category is such that these recognizers classify detachable subobjects (coproduct embeddings), it is an extensive distributive category.

Extensive distributive categories can be approached in various ways. For example, recognizable distributive categories, in which coproducts are disjoint or all preinitials are isomorphic, are extensive. Also, a category X having finite products and binary coproducts satisfying the slice equation (due to Schanuel and Lawvere) is extensive. This paper describes a series of embedding theorems. Any distributive category has a full faithful embedding into a recognizable distributive category. Any recognizable distributive category can be "solidified" faithfully to produce an extensive distributive category. Any extensive distributive category can be embedded into a topos.

A peculiar source of extensive distributive categories is the coproduct completion of categories with familial finite products. In particular, this includes the coproduct completion of cartesian categories, which is serendipitously, therefore, also the distributive completion. Familial distributive categories can be characterized as distributive categories for which every object has a finite decomposition into indecomposables.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

M. Barr and C. Wells (1985) Toposes, triples and theories. Grundlehren der mathematischen Wis-senschaften 278, Springer-Verlag, Berlin, Heidelberg, New York.

S. Mac Lane (1971) Categories for the working mathematician, Springer-Verlag, Berlin, Heidelberg, New York.

D. Schumacher and R. H. Street (1988) Some Parameterized Categorical Concepts. Communications in Algebra 16(11) 23132347.

Recommend this journal

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

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *