Partiality, cartesian closedness, and toposes (Q1121368)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4103319
Language Label Description Also known as
default for all languages
No label defined
    English
    Partiality, cartesian closedness, and toposes
    scientific article; zbMATH DE number 4103319

      Statements

      Partiality, cartesian closedness, and toposes (English)
      0 references
      0 references
      0 references
      1989
      0 references
      This paper is concerned with some categorical aspects of structures with partial morphisms vis à vis to \(\lambda_ p\)-calculus of \textit{E. Moggi} [Lect. Notes Comput. Sci. 240, 242-251 (1986; Zbl 0628.03007)]. As a result of a synthesis of numerous papers published in the last decade (the papers of the authors are also included, and widely referred to in the text), the article gives a basic equational framework for categories with partial morphisms. The basic concepts are: category of partial maps (pC), lifting, partially cartesian category (pCC), domain, restriction, range, partial epi, partial mono, partial exponentiation, partially cartesian closed category (pCCC), dominion, partial topos, interval equality. In the authors' view the structure pC is an enriched (pre)-ordered category. The introduced axioms are strongly related to the intuitive concept of partiality. Notions corresponding to the ``total ones'' are defined and several basic results in pC, pCC, pCCC are established. The authors construct the category \(C_ T\) of total arrows. The main result gives conditions under which the partial properties in C imply the corresponding total properties in \(C_ T\). Using ``inverse'' constructions, the partial structures \(C_ p\) are obtained from the ``total ones'' C. Some properties of partial toposes are presented and a characterization of toposes is given: a cartesian closed category with pullbacks C is a topos iff its associated partial category \(C_ p\) is partially cartesian closed. As a final result the authors present an equational description of partial toposes and of other structures. These results have applications in the areas of programming languages and of automated categorical reasoning.
      0 references
      partiality in lambda calculus
      0 references
      category of total arrows
      0 references
      categories with partial morphisms
      0 references
      category of partial maps
      0 references
      partially cartesian category
      0 references
      domain
      0 references
      partially cartesian closed category
      0 references
      dominion
      0 references
      partial topos
      0 references
      programming languages
      0 references
      automated categorical reasoning
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references